Location:
Search - JAVA pi
Search list
Description: 一个用JAVA写的求PI的简易程序，精度还可以，有界面，动态-a written using Java for the PI to the simplified procedure, the accuracy can also, interface, dynamic
Platform: |
Size: 1348 |
Author: huayueer |
Hits:
Description: How well do you really know Java? Are you a code sleuth? Have you ever spent days chasing a bug caused by a trap or pitfall in Java or its libraries? Do you like brainteasers? Then this is the book for you!-How well do you really know Java Are you a cod e sleuth Have you ever spent days chasing a bug ca used by a trap or pitfall in Java or its libraries Do you like brainteasers Then this is the book for The r you!
Platform: |
Size: 1284278 |
Author: 静水 |
Hits:
Description: 用JAVA 写的数据结构 PILE 的算法,这种算法是法国大学老师算PILE 的一种方法.-using Java to write the data structure of the stiffness This algorithm is counting France braced University teachers a way.
Platform: |
Size: 6144 |
Author: li |
Hits:
Description: How well do you really know Java? Are you a code sleuth? Have you ever spent days chasing a bug caused by a trap or pitfall in Java or its libraries? Do you like brainteasers? Then this is the book for you!-How well do you really know Java Are you a cod e sleuth Have you ever spent days chasing a bug ca used by a trap or pitfall in Java or its libraries Do you like brainteasers Then this is the book for The r you!
Platform: |
Size: 1284096 |
Author: 静水 |
Hits:
Description: 通过JAVA设计 GUI 界面的计算器程序，用户可以通过鼠标依次输入参加计算的数值，进行加、减、乘、除等混合运算,这些完成标准计算器的基础操作。当选择科学计算器后，可以实现sin 、 cos 、 tan 、 ln、x^y、x^2、x^3、pi、n!、mod和十六进制除这个以外还可以删除输入，清空结果，求1除X，X百分比，十进制是，八进制，二进制的相互转换。-GUI interface design through JAVA calculator program, the user can take part in the importation of the mouse followed by the numerical calculation for add, subtract, multiply, divide, such as mixed computing, which the basis of the standard calculator operation. When choosing a scientific calculator, you can realize sin, cos, tan, ln, x ^ y, x ^ 2, x ^ 3, pi, n!, Mod and hexadecimal In addition to the outside can also delete the import, empty the results, and one in addition to X, X percentage of the metric system is octal, binary mutual conversion.
Platform: |
Size: 7168 |
Author: gggfhv |
Hits:
Description: Java实现Ping功能(采用JNI技术)，有源码和例子-Java realize Ping function (using JNI technology), there are source code and examples
Platform: |
Size: 219136 |
Author: chh096 |
Hits:
Description: 实现linux java ping 及traceroute 功能-Realize linux java ping and traceroute functions
Platform: |
Size: 1024 |
Author: suny |
Hits:
Description: OFDM程序，这么安排矩阵的目的是为了构造共轭对称矩阵
共轭对称矩阵的特点是 在ifft/fft的矢量上 N点的矢量
在0，N/2点必须是实数 一般选为0
1至N/2点 与 （N/2）+1至N-1点关于N/2共轭对称- BPSK simulation using a carrier cosine wave with ISI
clc
close all
clear all
figure(1)
n=160
for i=1:n
data(i)= 2*round(rand)-1
end
create modulated BPSK signal
first expand the bit stream
exdata=[]
for i=1:length(data)
for rep=1:5
exdata= [exdata data(i)]
end
end
ts=.1
t=1:ts:80.9
carrier=cos(pi*t)
multiply expanded bitstream by cosine wave with carrier frequency
this is the BPSK that is to be transmitted over the channel
bpsk=carrier.*exdata
bpsk=[bpsk(length(bpsk)-1) bpsk(length(bpsk)) bpsk]
plot(bpsk)
generating the noise
p=rand(1,800)*2*pi
p=rand*2*pi
snr=10
r=sqrt(-1*(1/snr*log(1- rand)))
no = 5*(r.* exp(j*p))
no = (r.* exp(j*p))
value of alpha
al=rand+j*rand
al=1
Spreading channel with the alpha as the variable
for k=5:5:795
for l = 1:5
al=round(rand)+j*round(rand)
rec(k+l)=bpsk(k+l)+al*bpsk(k-5+l)
end
end
rxdata=rec+ no
begin demodulation
first multiply recie
Platform: |
Size: 6146048 |
Author: 卞敏捷 |
Hits:
Description: Java 数值计算库
数列求和算法、求解方程的根、插值法和近似法、
数值积分、求解微分方程、矩阵运算及其它一些有趣的东西，
比如：大数、素数算法、PI、分形-Java Number Cruncher
Platform: |
Size: 295936 |
Author: shane liu |
Hits:
Description: Thinking in Java相关教材的实验题及答案，内含1多种算法计算PI,2多态与抽象类，3学生成绩管理系统，4温室管理系统等源码-Thinking in Java-related materials and answer the test questions, including more than one kinds of algorithm for calculating the PI, 2 polymorphism and abstract class, 3 student achievement management system, 4-source, such as greenhouse management system
Platform: |
Size: 43008 |
Author: Kiara |
Hits:
Description: Distributed Logical clocks.
Code will spawn n (distributed) processes Pi, 0 ≤ i < n, each one looping forever.
Each loop iteration is a loop interval and its duration can be set to 1 second. In every loop
interval Pi does the following:
− If there is a message m pending to be received it receives m
− Otherwise
o It does an internal action with probability 0.80
o It sends a message to process Pj, 0 ≤ j < n and j ≠ i with probability 0.20.
The message gets delayed at its source for a random amount of time < 2 sec
to simulate network delay.
− It calculates and prints its logical clock value along with the action it takes.
Note: several messages may arrive in a process within a loop interval. In such a case they
will be queued and delivered to the process in subsequent loop intervals.-Distributed Logical clocks.
Code will spawn n (distributed) processes Pi, 0 ≤ i < n, each one looping forever.
Each loop iteration is a loop interval and its duration can be set to 1 second. In every loop
interval Pi does the following:
− If there is a message m pending to be received it receives m
− Otherwise
o It does an internal action with probability 0.80
o It sends a message to process Pj, 0 ≤ j < n and j ≠ i with probability 0.20.
The message gets delayed at its source for a random amount of time < 2 sec
to simulate network delay.
− It calculates and prints its logical clock value along with the action it takes.
Note: several messages may arrive in a process within a loop interval. In such a case they
will be queued and delivered to the process in subsequent loop intervals.
Platform: |
Size: 5120 |
Author: Araz |
Hits:
Description: 问题：已知有n种物品和一个可容纳M重量的背包，每种物品i的重量为wi。假定将物品i的一部分xi放入背包就会得到pixi的效益，这里，0≤xi≤1，pi>0。如果这些
物品重量的和大于M，要求所有选中要装入背包的物品总重
量不得超过M，而装入背包物品获得的总效益最大。-Question: are known to have n kinds of goods and M can hold the weight of a backpack, the weight of each item i is wi. I assume that part of the item into the knapsack xi get pixi benefits, where, 0 ≤ xi ≤ 1, pi> 0. If the weight of these items is greater than M, requires that all selected items to be loaded backpack should not exceed the total weight of M, while the total load backpack items were the biggest benefits.
Platform: |
Size: 1024 |
Author: lily |
Hits:
Description: 通过JAVA设计 GUI 界面的计算器程序，用户可以通过鼠标依次输入参加计算的数值，进行加、减、乘、除等混合运算,这些完成标准计算器的基础操作。当选择科学计算器后，可以实现sin 、 cos 、 tan 、 ln、x^y、x^2、x^3、pi、n!、mod和十六进制除这个以外还可以删除输入，清空结果，求1除X，X百分比，十进制是，八进制，二进制的相互转换-Through JAVA calculator program designed GUI interface, users can turn the mouse input to participate in the calculation of the values to add, subtract, multiply, in addition to mixed operations, the basis for these operations to complete the standard calculator. When you choose the scientific calculator, you can achieve the sin, cos, tan, ln, x ^ y, x ^ 2, x ^ 3, pi, n!, Mod, and hexadecimal In addition to the other can also delete input, empty a result, seeking an addition to X, X percentage, decimal is, octal, binary mutual conversion
Platform: |
Size: 3072 |
Author: 李瑞 |
Hits:
Description: 利用JNI技术实现java对window API的调用进而得到windows操作系统的所有进程信息。-Java using JNI technology and then on the window API calls to get all the windows operating system process information.
Platform: |
Size: 2646016 |
Author: 大麦哥 |
Hits:
Description: Matrix Chain Multiplication is perhaps the quintessential example of dynamic programming. The problem can be stated as follows: given a chain <A1, A2,..., An> of n matrices, where for i = 1, 2,...,n, matrix Ai has dimension pi-1 x pi, fully parenthesize the product A1A2...An in a way that minimizes the number of scalar multiplications.
Platform: |
Size: 1024 |
Author: Justas |
Hits:
Description: 并行计算实验计算pi的源码，java环境-Parallel experiments the source computing pi, java environment
Platform: |
Size: 1024 |
Author: hydden |
Hits:
Description: 使用随机化算法计算PI 的值·java语言编写-get the PI
Platform: |
Size: 34816 |
Author: huangzhjie |
Hits:
Description: 常用java练习小程序.包括闰年，成绩分类，求和，乘法表，圆周率等。-Common practice java applets, including leap year, the results classification, summation, multiplication tables, and so on pi.
Platform: |
Size: 21504 |
Author: 刘明威 |
Hits:
Description: 使用java实现遗传算法，求出max{f(x1,x2)=21.5+x1*sin(4*π*x1)+x2*sin(20*π*x2)}的最优解
约束条件为 -3.0<=x1<=12.1 4.1<=x2<=5.8(The use of Java genetic algorithm, calculate the max{f (x1, x2) =21.5+x1*sin (4* PI *x1 +x2*sin (*x2) 20* PI)} of the optimal solution The constraint conditions for -3.0<=x1<=12.1 4.1<=x2<=5.8)
Platform: |
Size: 10240 |
Author: LL小怪兽
|
Hits:
Description: PI实时数据库调用driver ，可通过java实现对PI实时数据库的读数。(PI real-time database calls driver, which can read PI real-time database through Java.)
Platform: |
Size: 194560 |
Author: 一片云之雨云 |
Hits: