Life32 is a program to animate an manipulate cellulair automa akin to Conway s Game of Life (GoL). 一个国外模拟生命细胞活动的小程序，我到现在还是搞得不是很懂，大家看看吧
标签： Life manipulate cellulair animate
上传时间： 2015-04-15
上传用户：wanqunsheng
a good material for new learners to learn java, this is one of Sun s training material.
标签： material learners training learn
上传时间： 2015-04-17
上传用户：waitingfy
jboss 开发人员 手册 JBoss: A Developer s Notebook also introduces the management console, the web services messaging features, enhanced monitoring capabilities, and shows you how to improve performance. At the end of each lab, you ll find a section called "What about..." that anticipates and answers likely follow-up questions, along with a section that points you to articles and other resources if you need more information.
标签： introduces management Developer the
上传时间： 2015-04-17
上传用户：dreamboy36
SCS-C is another port to C of Goldberg s Simple Classifier System, with a few extensions.
标签： Classifier extensions Goldberg another
上传时间： 2013-12-10
上传用户：l254587896
FinC is Fava in C! A C-like syntax language. It s designed to apply to embededd system.
标签： designed embededd language C-like
上传时间： 2014-01-01
上传用户：zhenyushaw
In today’s IT environment, Java is a leading technology in the world of enterprise development. As management demands more from technology, complexity in infrastructure seems to grow exponentially, leaving many unable to keep up with the demands of such a fast-paced world. These complexities can be seen in the over-evolving Java 2 Enterprise Edition (J2EE) specifications. This unnecessary complexity drove us to discover ways of simplifying development.
标签： environment development enterprise technology
上传时间： 2013-12-24
上传用户：Zxcvbnm
The CMUPA is designed to be a low bandwidth, highly flexible architecture .This is it s protocol.
标签： architecture bandwidth designed flexible
上传时间： 2014-01-16
上传用户：1966640071
（2） 主要算法的基本思想： 从题目上来分析我认为这是一个图的最短路径问题。因此决定用Dijkstra算法按路径长度递增的顺序逐步产生最短路径的方法：设置两个顶点的集合T和S，集合S中存放已找到的最短路径的顶点，集合T中存放当前还未找到的最短路径的顶点。初始状态时，集合S中只包含源点V0，然后不断从集合T中选取到顶点V0路径长度最短的顶点加入到集合S中，集合S中每加入一个新的顶点U，都要修改顶点V0到集合T中剩余顶点的最短路径长度值，集合T中各顶点新的最短路径长度值为原来的最短路径长度值与顶点U的最短路径长度只值中的较小的。此过程不断重复，直到集合T的顶点全部加入到集合S为止。
上传时间： 2015-05-01
上传用户：wpwpwlxwlx
He was the first one (I noticed of) who coded a decrypter for yC 1.2 :)...good job. Also if it hasn t full support yet >:-) So as I promised...here s the source code. I hope it helps someone.
标签： decrypter noticed first coded
上传时间： 2015-05-03
上传用户：498732662
X(t)=Asin(2*pi *f *t+ q)+n(t) 估计其中的参数为A，f， q。n(t)为随机噪声，服从正态分布。 其他的具体见附件中的程序
上传时间： 2013-12-18
上传用户：225588
