信息安全

最优化算法，包括各种线性优化和非线性优化问题-Optimization algorithms, including linear optimization and nonlinear optimization problems

详细表述了分数阶傅立叶变换的离散实现，将现有的算法进行比较。-In this note we make a critical comparison of some matlab programs for the digital computation of the fractional Fourier transform that are freely available and we describe our own implementation that lters the best out of the existing ones. Two types of transforms are considered: First the fast approximate fractional Fourier transform algorithm for which two algorithms are available. The method is described in H.M. Ozaktas, M.A. Kutay, and G. Bozdagi. Digital computation of the fractional Fourier transform. IEEE Trans. Signal Process., 44:2141{2150, 1996. There are two implementations: one is written by A.M. Kutay the other is part of package written by J. O Neill. Secondly the discrete fractional Fourier transform algorithm described in the master thesis C . Candan. The discrete fractional Fourier transform, Bilkent Univ., 1998 and an algorithm described by S.C. Pei, M.H. Yeh, and C.C Tseng: Digital fractional Fourier transform base

基于BPSK的直接序列扩频编码，效果不错-BPSK-DSSS-CDMA-FFT-Source-Code

改进的哲学家问题，用信号和共享内存实现- The improvement philosopher question, realizes with the signal and the sharing memory

#包括；

牛顿插值计算（牛顿插值公式)-Newton interpolation (Newton interpolation formula)

几种排序算法C＋＋实现-Several sorting algorithm C to achieve

把给定的图像分解为大小相同的小块，并算出灰度共生矩阵，求出图像的熵，能量等特征值。

没有界面，用C写的小程序 问题如下：一家软件公司招聘了数十位程序员，分成若干部门。 进行一次考试，对各个部门的所有程序员进行考核。考试结束后评出了每个人的分数。现在需要知道，在每个部门内，成绩最好的程序员和成绩最差的程序员分别是谁。输入有N+1行，每一个有若干正整数。第一行只有一个正整数，代表公司的部门数目。剩余的N行，每一行代表了该部门所有程序员的得分。其中每行第一个数字k代表了该部门的程序员个数，该行剩下的有k对数据，每对数据包括一个程序员的姓名（一个字符串）和其得分（一个正整数）。【输出形式】输出有N行，每行有两个串。第一个串该部门得分最高的程序员的姓名，第二个数字是得分最低的程序员的姓名。-no interface, written in C minor procedural issues are as follows : a software company recruited dozens of programmers, divided into several departments. An examination of the various departments for testing all programmers. Examinations in 1886 after the end of each grade. Now need to know, in every sector, but the best programmers and the worst programmers who were. N input is a line, each one a number of positive integers. There is only a first positive integer representing the number of departments. The remaining N firms, each firm on behalf of all the sector"s programmers to the basket. Each Bank figures k a representative of the number of programmers, the bank left the k right d

一个用来计算矩阵运算的函数库，希望对大家有用-One used to calculate the matrix operations of the library and hope for all of us