虫虫首页| 资源下载| 资源专辑| 精品软件
登录| 注册

wave<b>Form</b>s

  • Program to simulate Rayleigh fading using a p-th order autoregressive model AR(p) according to % B

    Program to simulate Rayleigh fading using a p-th order autoregressive model AR(p) according to % Baddour s work: "Autoregressive modeling for fading channel simulation"

    标签: autoregressive according simulate Rayleigh

    上传时间: 2013-12-02

    上传用户:tb_6877751

  • 1、 了解系统调用pipe()的功能和实际原理 2、 编写一段程序

    1、 了解系统调用pipe()的功能和实际原理 2、 编写一段程序,使用管道实现父子进程之间的通信 a) 使用系统调用fork()创建一个子进程 b) 子进程调用函数write()向父进程发送自己的进程ID和字符串” s sending a message to parent.\n”。 c) 父进程调用函数read()通过管道读出子进程发来的消息,将消息输出屏幕,然后终止

    标签: pipe 系统调用 程序 编写

    上传时间: 2013-12-16

    上传用户:古谷仁美

  • SharpNuke源代码

    SharpNuke源代码,文章管理系统,portal门户型开发,b/s模式

    标签: SharpNuke 源代码

    上传时间: 2013-12-18

    上传用户:gaome

  • Ajax技术是目前在浏览器中通过JavaScript脚本可以使用的所有技术的集合。Ajax并没有创造出某种具体的新技术

    Ajax技术是目前在浏览器中通过JavaScript脚本可以使用的所有技术的集合。Ajax并没有创造出某种具体的新技术,它所使用的大多数技术都是在很多年以前就已经存在了,然而Ajax以一种崭新的方式来使用所有的这些技术,使得古老的B/S方式的Web开发焕发了新的活力,迎来了第二个春天。

    标签: Ajax JavaScript 浏览器 创造

    上传时间: 2014-11-26

    上传用户:731140412

  • 本论文中

    本论文中,将软件工程的基本原理和方法应用到整个系统,并对其进行需求分析,提出了解决问题的具体方法。在具体制作中,用ASP技术来实现B/S系统,ASP技术与数据库技术结合,用户在浏览器端可以随意查询自己需要的标本,而数据的后台操作则由服务器端处理。这样提高了网页的互动性,使整个系统能更好的为用户服务。

    标签: 论文

    上传时间: 2013-11-29

    上传用户:xuan‘nian

  • ACM试题An Easy Problem Description As we known, data stored in the computers is in binary form. The

    ACM试题An Easy Problem Description As we known, data stored in the computers is in binary form. The problem we discuss now is about the positive integers and its binary form. Given a positive integer I, you task is to find out an integer J, which is the minimum integer greater than I, and the number of 1 s in whose binary form is the same as that in the binary form of I. For example, if "78" is given, we can write out its binary form, "1001110". This binary form has 4 1 s. The minimum integer, which is greater than "1001110" and also contains 4 1 s, is "1010011", i.e. "83", so you should output "83".

    标签: Description computers Problem binary

    上传时间: 2013-12-11

    上传用户:libenshu01

  • This section contains a brief introduction to the C language. It is intended as a tutorial on the la

    This section contains a brief introduction to the C language. It is intended as a tutorial on the language, and aims at getting a reader new to C started as quickly as possible. It is certainly not intended as a substitute for any of the numerous textbooks on C. 2. write a recursive function FIB (n) to find out the nth element in theFibanocci sequence number which is 1,1,2,3,5,8,13,21,34,55,…3. write the prefix and postfix form of the following infix expressiona + b – c / d + e * f – g * h / i ^ j4. write a function to count the number of nodes in a binary tr

    标签: introduction the contains intended

    上传时间: 2013-12-23

    上传用户:liansi

  • 一款不错的oa系统。包括审批

    一款不错的oa系统。包括审批,计划,邮件等功能。b/s结构。

    标签:

    上传时间: 2015-08-30

    上传用户:Shaikh

  • Procedure TSPSA:  begin   init-of-T { T为初始温度}   S={1

    Procedure TSPSA:  begin   init-of-T { T为初始温度}   S={1,……,n} {S为初始值}   termination=false   while termination=false    begin     for i=1 to L do       begin         generate(S′form S) { 从当前回路S产生新回路S′}         Δt:=f(S′))-f(S) {f(S)为路径总长}         IF(Δt<0) OR (EXP(-Δt/T)>Random-of-[0,1])         S=S′         IF the-halt-condition-is-TRUE THEN         termination=true       End     T_lower    End  End

    标签: Procedure init-of-T TSPSA begin

    上传时间: 2013-12-20

    上传用户:shinesyh

  • Implemented BFS, DFS and A* To compile this project, use the following command: g++ -o search ma

    Implemented BFS, DFS and A* To compile this project, use the following command: g++ -o search main.cpp Then you can run it: ./search The input is loaded from a input file in.txt Here is the format of the input file: The first line of the input file shoud contain two chars indicate the source and destination city for breadth first and depth first algorithm. The second line of input file shoud be an integer m indicate the number of connections for the map. Following m lines describe the map, each line represents to one connection in this form: dist city1 city2, which means there is a connection between city1 and city2 with the distance dist. The following input are for A* The following line contains two chars indicate the source and destination city for A* algorithm. Then there is an integer h indicate the number of heuristic. The following h lines is in the form: city dist which means the straight-line distance from the city to B is dist.

    标签: Implemented following compile command

    上传时间: 2014-01-01

    上传用户:lhc9102