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

max-Int

  • As an alternate to the migration scenario, Microsoft offers some interoperation solutions (in an int

    As an alternate to the migration scenario, Microsoft offers some interoperation solutions (in an interoperation scenario, you don t try to turn the MFC code into .NET automatically, you just try to ensure that they can work together):

    标签: interoperation alternate Microsoft migration

    上传时间: 2017-07-01

    上传用户:wys0120

  • This present a primer for people who are unfamiliar with the Java language. This introduction is int

    This present a primer for people who are unfamiliar with the Java language. This introduction is intended to allow you to develop the Java skills necessary to understand basic programs.

    标签: This introduction unfamiliar language

    上传时间: 2014-01-19

    上传用户:Miyuki

  • This routine calls the glpk library to solve a LP/MIP problem. A typical LP problem has following s

    This routine calls the glpk library to solve a LP/MIP problem. A typical LP problem has following structure: [min|max] C x s.t. Ax ["="|"<="|">="] b {x <= UB} {x >= LB} The calling syntax is: [XMIN,FMIN,STATUS,EXTRA]=glpkmex(SENSE,C,A,B,CTYPE,LB,UB,... VARTYPE,PARAM,LPSOLVER,SAVE)

    标签: problem following routine library

    上传时间: 2014-12-01

    上传用户:changeboy

  • 用SHA算法实现对任意文件的hash摘要

    用SHA算法实现对任意文件的hash摘要,并且把hash摘要值(至少为160bit)存入另一个文件,形如: hash inputfile hashvaluefile 说明:SHA算法的实现至少为160bit,或者可以选择256,384或者512的,可以查阅相关资料,按照标准来实现(hash的算法是否正确,可以和网上的标准算法对比,用相同的输入看是否能够得到相同的输出)控制台编程: int main(int argc, char *argv[ ])

    标签: hash SHA 算法

    上传时间: 2017-07-11

    上传用户:cursor

  • I. C. Wong, Z. Shen, J. G. Andrews, and B. L. Evans, ``A Low Complexity Algorithm for Proportional R

    I. C. Wong, Z. Shen, J. G. Andrews, and B. L. Evans, ``A Low Complexity Algorithm for Proportional Resource Allocation in OFDMA Systems , Proc. IEEE Int. Work. Signal Processing Systems, 针对这篇文章给出的源代码

    标签: I. C. B. G.

    上传时间: 2014-01-24

    上传用户:zhichenglu

  • java 线程 静态锁

    java 线程 静态锁,对象锁, synchronized 是锁方法还是锁对象?还是锁类?如何实现?? 部分代码如下, public static Object lock=new Object() //静态锁,锁类,不是锁对象了!!所以两个线程同时 运行两个 TestThread 的execute( ),也可以同步!!! public void execute(){ // synchronized(lock){ for(int i=0 i<20 i++){ try { Thread.sleep(30) } catch (InterruptedException e) { // TODO Auto-generated catch block e.printStackTrace() } System.out.println(Thread.currentThread().getName()+Thread.currentThread ().getName()+" "+i) } } }

    标签: java 线程

    上传时间: 2017-07-15

    上传用户:lijianyu172

  • 三: 针对带表头结点的单链表

    三: 针对带表头结点的单链表,试编写下列函数。 (1) 定位函数Locate:在单链表中寻找第i个结点。若找到,则函数返回第i个结点的地址;若找不到,则函数返回NULL。 (2) 求最大值函数max:通过一趟遍历在单链表中确定值最大的结点。 (3) 统计函数number:统计单链表中具有给定值x的所有元素。 (4) 建立函数create:根据一维数组a[n]建立一个单链表,使单链表中各元素的次序与a[n]中各元素的次序相同,要求该程序的时间复杂性为O(n)。 (5) 整理函数tidyup:在非递减有序的单链表中删除值相同的多余结点。

    标签: 表头 单链表

    上传时间: 2017-07-20

    上传用户:CSUSheep

  • client socket include <sys/types.h> include <sys/socket.h> include <stdio.h> i

    client socket include <sys/types.h> include <sys/socket.h> include <stdio.h> include <netinet/in.h> include <arpa/inet.h> include <unistd.h> int main() { int sockfd int len struct sockaddr_in address int result char ch = A sockfd = socket(AF_INET, SOCK_STREAM, 0) address.sin_family = AF_INET address.sin_addr.s_addr = inet_addr("127.0.0.1") address.sin_port = 9734 len = sizeof(address) result = connect(sockfd, (struct sockaddr *)&address, len) if(result == -1) { perror("oops: client") exit(1) } write(sockfd, &ch, 1) read(sockfd, &ch, 1) printf("char from server = c\n", ch) close(sockfd) exit(0) }

    标签: include socket sys gt

    上传时间: 2017-07-29

    上传用户:wab1981

  • 文中介绍了QPSK调制解调的原理

    文中介绍了QPSK调制解调的原理,并基于FPGA实现了QPSK调制解调电路。MAX+PLUSII环境下的仿真结果表明了该设计的正确性。

    标签: QPSK 调制解调

    上传时间: 2017-08-08

    上传用户:hoperingcong

  • 秒信号发生器

    秒信号发生器,供初学者了解vhdl的编程方法,程序非常简单。编程环境使用Max+Plus IIV10.12

    标签: 信号发生器

    上传时间: 2014-01-17

    上传用户:xinzhch