-
sb
说明： 网上找的一个有意思的程序。共享下。参阅下子(Internet is an interesting program. Sharing the next. See erupted)
- 2011-09-28 11:03:06下载
- 积分：1
-
adv_database1
project on matlab for student online uploads for university subscribtion
- 2012-06-17 01:52:07下载
- 积分：1
-
Fano_finsh
费诺码在MATLAB条件下的实现，可按概率降序排列的码字，求出码长及编码时间等功能 ((Fenaux code in MATLAB to achieve under the conditions, in descending order according to the probability of the code word, find time to code length and coding functions ()
- 2010-06-27 00:29:41下载
- 积分：1
-
ACE-Docs-0306
ACE自适配通信环境（ADAPTIVE Communication Environment）是可自由使用、开放源码的面向对象（OO）框架（framework），它实现了许多用于并发通信软件的核心模式。ACE提供了一组丰富的可重用C++包装外观（wrapper facade）和框架组件，可跨多种平台完成通用的通信软件任务，其中包括：事件多路分离和事件处理器分派、信号处理、服务初始化、进程间通信、共享内存管理、消息路由、分布式服务动态（重）配置、并发执行和同步，等等。(ACE Adaptive Communication Environment (ADAPTIVE Communication Environment) is free to use, open source object-oriented (OO) framework (framework), it implements a number of concurrent communication software for the core model. ACE provides a rich set of reusable C++ Packaging appearance (wrapper facade) and the framework components, can be a variety of cross-platform communications software to complete common tasks, including: multi-way separation of incident and event processor assignment, signal handling, service initialization, interprocess communications, shared memory management, message routing, distributed service dynamically (re) configuration, concurrent execution and synchronization, and so on.)
- 2007-12-11 19:13:50下载
- 积分：1
-
6089
************内存结构五大区***************(*********** Five regions of memory structure)
- 2009-11-13 02:31:49下载
- 积分：1
-
一种混合贪婪随机自适应搜索 GRASP to solve VRP
一种混合贪婪随机自适应搜索（GRACH）算法，用于解决单车辆段车辆路径问题(a hybrid Greedy Randomized Adaptive Search (GRASP) algorithm that solves a single depot vehicle routing problem)
- 2020-06-25 06:00:02下载
- 积分：1
-
matlab编程
说明： 程序mtlab中的代码-地震波反应谱与时程波相互转换(Interconversion between seismic response spectrum and time-history wave)
- 2021-01-18 20:28:43下载
- 积分：1
-
C
说明： 1.1 C基础知识 1
1.2 函数与头文件 2
1.3 C预处理器 3
1.4 将一个字符转换为long型 4
1.5 strcpy函数 4
1.6 assert用法 5
1.7 itoa函数和atoi函数 6
1.8 strcmp函数实现 8
1.9 strcpy函数实现 9
1.10 memcpy函数实现 10
1.11 memcpy和memmove函数的实现 11
1.12 strcat函数实现 13
1.13 使用库函数atoi，将char *→int 13
1.14 使用库函数itoa，将int→char * 14
1.15 不使用库函数，将int→char * 14
1.16 不使用库函数，将char *→int 15
1.17 求两个整数的最大公约数 16
1.18 Little_endian or Big_endian 17
1.19 sizeof与strlen的区别 19
1.20 实现String类的BIG_FOUR 19
1.21 struct和union的区别 20
1.22 char字符变量与int整型数据 22
1.23 字,字节,字符,比特 23
1.24 空格、空字符、字符数组结束符的区别 25(1.1 C Basics 1
1.2 Functions and header files 2
1.3 C preprocessor 3
1.4 will be a long-type characters into four
1.5 strcpy function 4
1.6 assert usage 5
1.7 itoa function and atoi function 6
1.8 strcmp function to achieve 8
1.9 strcpy function to achieve 9
1.10 memcpy function to achieve 10
Achieve 11 1.11 memcpy and memmove function
1.12 strcat function to achieve 13
1.13 using the library function atoi, the char* → int 13
1.14 using the library function itoa, the int → char* 14
1.15 does not use the library function, int → char* 14
1.16 does not use the library function, char* → int 15
1.17 find the greatest common divisor of two integers 16
1.18 Little_endian or Big_endian 17
Difference 1.19 sizeof and strlen 19
1.20 realize BIG_FOUR String class 19
Difference 1.21 struct and union of 20
1.22 char and int integer variable character data 22
1.23 word, byte, character, bit 23
Difference 1.24 spaces, null characters, character array termi)
- 2014-10-08 10:33:55下载
- 积分：1
-
Introduction-to-Algorithms
《算法导论》，是一本十分经典的计算机算法书籍，与高德纳（Donald E.Knuth）的《计算机程序设计艺术》（《The Art Of Computer Programming》）相媲美。 《算法导论》由Thomas H.Cormen、Charles E.Leiserson、Ronald L.Rivest、Clifford Stein四人合作编著（其中Clifford Stein是第二版开始参与的合著者）。本书的最大特点就是将严谨性和全面性融入在了一起。(原书名——《Introduction to Algorithms》)
- 2013-05-07 10:53:05下载
- 积分：1
-
recursion
说明： 递归，是函数实现的一个很重要的环节，很多程序中都或多或少的使用了递归函数。递归的意思就是函数自己调用自己本身，或者在自己函数调用的下级函数中调用自己。
递归之所以能实现，是因为函数的每个执行过程都在栈中有自己的形参和局部变量的拷贝，这些拷贝和函数的其他执行过程毫不相干。这种机制是当代大多数程序设计语言实现子程序结构的基础，是使得递归成为可能。(Recursion, is a function to achieve a very important part of many programs are more or less use the recursive function. Recursive mean that the function of its own call to themselves or subordinates in their own function calls a function to call their own. Recursion that can be achieved because the function of each execution in the stack has its own shape parameters and local variables of the copy, the copy and the implementation process has nothing to do other functions. This mechanism is the most modern programming language implementation subroutine structure of the foundation is to make recursion possible.)
- 2009-08-30 16:26:06下载
- 积分：1
