基于单片机的数字温度计设计

这个是一个用java实现的tftp程序。其中包括客户端和用户端-This is a realization of java with the tftp process. Including client and the client

System C是一种软/硬件协同设计语言，一种新的系统级建模语言。它包含了一系列C++的类和宏，并且提供了一个事件驱动的模拟核，使得系统的设计者能够用C++的词法模拟并行的进程，特别是在SoC系统中。 这是SystemC全加器的一个例子，可以使用Linux中的g++编译

2004ACM竞赛上海国内赛题部分答案-2004ACM race Shanghai"s game that part of the answer

基于C语言的小波处理，包含有滤波、复原、融合等C语言源代码。-Wavelet-based C language processing, includes filtering, recovery, integration, such as C language source code.

本代码是《计算机常用数值计算算法与程序 C++版》一书的配套线性方程组求解代码，这些C++程序已经在Virsual C++ 6.0环境下通过。注意，在VC++ 6.0中设置好路径，特别是include目录(文件夹)的路径，否则在编译时会出现找不到头文件的错误，使编译无法正常进行。-the code is "commonly used computer numerical algorithms and procedures C version," a book supporting the linear equation solving the code, these procedures have been in C C 6.0 Virsual environment through. The attention of the VC 6.0 installed path, in particular include directory (folder) path, otherwise there will be compiled header files could not find the mistakes and the compiler not normal.

主要分为3个函数。第一个函数为粒子群初始化函数 InitSwarm(SwarmSize......AdaptFunc)其主要作用是初始化粒子群的粒子，并设定粒子的速度、位置在一定的范围内。 -Mainly divided into three functions. The first function for the particle swarm initialization function InitSwarm (SwarmSize. ..... AdaptFunc) whose primary role is to initialize the particle swarm of particles, and set the speed of particles, location in a certain range.

停车场问题：一个关于堆栈操作的程序- Parking lot question: About storehouse operation procedure

用C语言实现的离散傅里叶变换（DFT）的经典算法！比较实用！-DFT program developed by C, very practical

using System; using System.Collections.Generic; using System.Linq; using System.Text; namespace 实战_使用数组解决约瑟夫环问题 {     class Program     {         static void Main(string[] args)         {             int[] intPers = Jose(12, 3, 4);             Console.WriteLine

A program to demonstrate the optimization process of ant colony optimization for the traveling saleman problem (TSP). The cities are shown as red circles, the pheromone on the connections between them (fully connected graph) by gray lines. The darker the grey, the more pheromone is currently on the edge. During the optimization, the currently best found tour is drawn in red. To run the optimization, first create a random TSP, then create an ant colony, and finally run the optimization.