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.
標(biāo)簽： optimization demonstrate the traveling
上傳時(shí)間： 2015-07-12
上傳用戶：偷心的海盜
Computes the hafnian of a nonnegative integer matrix. Notes: Copy hafnian.c to main.c, in the same directory as Rothberg s code (see above). You can download the .tar directory with the code weighted-match.tar here. Then "make" the codes (this codes are in C, not C++). The program is then RUN by the command "wmatch".
標(biāo)簽： hafnian nonnegative the Computes
上傳時(shí)間： 2013-12-23
上傳用戶：lmeeworm
加密算法 Test Driver for Crypto++, a C++ Class Library of Cryptographic Primitives: - To generate an RSA key cryptest g - To encrypt and decrypt a string using RSA cryptest r - To calculate MD5, SHS, and RIPEMD-160 message digests: cryptest m file - To encrypt and decrypt a string using DES-EDE in CBC mode: cryptest t - To encrypt or decrypt a file cryptest e|d input output - To share a file into shadows: cryptest s <pieces> <pieces-needed> file (make sure file has no extension, if you re RUNning this under DOS) - To reconstruct a file from shadows: cryptest j output file1 file2 [....] - To gzip a file: cryptest z <compression-level> input output - To gunzip a file: cryptest u input output - To RUN validation tests: cryptest v - To RUN benchmarks: cryptest b [time for each benchmark in seconds]
標(biāo)簽： Cryptographic Primitives generate Library
上傳時(shí)間： 2015-07-16
上傳用戶：wqxstar
encode.v The encoder syndrome.v Syndrome generator in decoder berlekamp.v Berlekamp algorithm in decoder chien-search.v Chien search and Forney algorithm in decoder decode.v The top module of the decoder inverse.v Computes multiplication inverse of an Galois field element test-bench.v The test fixture, and some brief notes on using the modules. data-rom.v A simple data source for testing RUN For those intelligence-challenged who can t RUN verilog LGPL The license
標(biāo)簽： Berlekamp berlekamp algorithm generator
上傳時(shí)間： 2014-02-16
上傳用戶：fxf126@126.com
his project was built and tested with WinAVR-20060125. Make sure the MCU target define in the Makefiles corresponds to the AVR you are using!! To build the code, just install WinAVR and RUN "make" from the console in echomaster and echoslave subdirs. "make program" will program the device if you have a AVRISP attached. Remember to set the AVR device to at least 8MHz. The AVR may use the programmable clock from MC1319x, just remember to check if the MC1319x and SPI communication is working FIRST! Otherwise you wont get any clock signal to the AVR and then you can t program it or reset the fuses! The MC1319x has default clock output of 32kHz so you will have to set your programmer to a very low frequency (<=32kHz/4) to be able to program it while it is RUNning on that!
標(biāo)簽： the 20060125 project WinAVR
上傳時(shí)間： 2014-10-10
上傳用戶：yan2267246
處理機(jī)調(diào)度，編寫一個(gè)進(jìn)程調(diào)度程序，允許多個(gè)進(jìn)程共行的進(jìn)程調(diào)度程序。 進(jìn)程調(diào)度算法：采用最高優(yōu)先數(shù)優(yōu)先的調(diào)度算法（即把處理機(jī)分配給優(yōu)先數(shù)最高的進(jìn)程）和先來(lái)先服務(wù)算法。 每個(gè)進(jìn)程有一個(gè)進(jìn)程控制塊（PCB）表示。進(jìn)程控制塊可以包含如下信息：進(jìn)程名、優(yōu)先數(shù)、到達(dá)時(shí)間、需要運(yùn)行時(shí)間、已用CPU時(shí)間、進(jìn)程狀態(tài)等等。 進(jìn)程的優(yōu)先數(shù)及需要的運(yùn)行時(shí)間可以事先人為地指定（也可以由隨機(jī)數(shù)產(chǎn)生）。進(jìn)程的到達(dá)時(shí)間為輸入進(jìn)程的時(shí)間。 進(jìn)程的運(yùn)行時(shí)間以時(shí)間片為單位進(jìn)行計(jì)算。 每個(gè)進(jìn)程的狀態(tài)可以是就緒 W（Wait）、運(yùn)行R（RUN）、或完成F（Finish）三種狀態(tài)之一。 就緒進(jìn)程獲得 CPU后都只能運(yùn)行一個(gè)時(shí)間片。用已占用CPU時(shí)間加1來(lái)表示。 如果運(yùn)行一個(gè)時(shí)間片后，進(jìn)程的已占用 CPU時(shí)間已達(dá)到所需要的運(yùn)行時(shí)間，則撤消該進(jìn)程，如果運(yùn)行一個(gè)時(shí)間片后進(jìn)程的已占用CPU時(shí)間還未達(dá)所需要的運(yùn)行時(shí)間，也就是進(jìn)程還需要繼續(xù)運(yùn)行，此時(shí)應(yīng)將進(jìn)程的優(yōu)先數(shù)減1（即降低一級(jí)），然后把它插入就緒隊(duì)列等待CPU。 每進(jìn)行一次調(diào)度程序都打印一次運(yùn)行進(jìn)程、就緒隊(duì)列、以及各個(gè)進(jìn)程的 PCB，以便進(jìn)行檢查。 重復(fù)以上過(guò)程，直到所要進(jìn)程都完成為止
上傳時(shí)間： 2013-11-26
上傳用戶：tianjinfan
This a software RUNing on the matlab, it is used in the channel coding simulation. It include DVB-S2 LDPC, Covolution turbo, and block turbo code, You can choose which channel coding to RUN. it RUN the encoder and add white noise in the channel, then it RUN the decoder, and compute the error rate.
標(biāo)簽： simulation the software channel
上傳時(shí)間： 2015-08-06
上傳用戶：
maven 2.0 The following instructions show how to install Maven 2: 1) Unpack the archive where you would like to store the binaries, eg: tar zxvf maven-2.0.tar.gz or unzip maven-2.0.zip 2) A directory called "maven-2.0" will be created. 3) Add the bin directory to your PATH, eg: export PATH=/usr/local/maven-2.0/bin:$PATH or set PATH="c:\program files\maven-2.0\bin" ％PATH％ 4) Make sure JAVA_HOME is set to the location of your JDK 5) RUN "mvn --version" to verify that it is correctly installed.
標(biāo)簽： instructions following archive install
上傳時(shí)間： 2014-01-19
上傳用戶：weiwolkt
將該實(shí)例的源代碼，比如1.c文件（在【001】目錄下）拷貝到【c:\tc】目錄下，在MS-DOS方式下運(yùn)行tc.exe，打開編譯器，在TC中,按【F3】鍵或者“File->Open”菜單命令，打開1.c文件，按【Ctrl+F9】鍵，或者“RUN->RUN”菜單命令，編譯運(yùn)行該程
標(biāo)簽： 源代碼
上傳時(shí)間： 2014-11-29
上傳用戶：mikesering
KVM (for Kernel-based Virtual Machine) is a full virtualization solution for Linux on x86 hardware. It consists of a loadable kernel module (kvm.ko) and a userspace component. Using KVM, one can RUN multiple virtual machines RUNning unmodified Linux or Windows images. Each virtual machine has private virtualized hardware: a network card, disk, graphics adapter, etc. The kernel component of KVM is included in mainline Linux, and will appear in Linux 2.6.20. KVM is open source software.
標(biāo)簽： virtualization Kernel-based for hardware
上傳時(shí)間： 2015-08-20
上傳用戶：lijianyu172
蟲蟲下載站版權(quán)所有 京ICP備2021023401號(hào)-1
