This worm file is disseminated except That through MIRC and outlook Express. This worm will duplicate red.exe in the computer arriving and infecting too, and in mirc catalogue in the system, produce a script.ini file, let the worm be disseminated through Mirc communication software by this.
标签： This worm disseminated duplicat
上传时间： 2017-01-13
上传用户：dbs012280
This toolbox contains Matlab files That implement the Laplacian pyramid (LP) decomposition and the new reconstruction method
标签： decomposition Laplacian implement the
上传时间： 2014-01-22
上传用户：曹云鹏
This toolbox contains Matlab files That implement the nonsubsample contourlet transform and its utility functions. Some Matlab files are the same as those in Contourlet Toolbox.
标签： nonsubsample contourlet implement transform
上传时间： 2017-01-14
上传用户：lunshaomo
A pet management. To do a project like That in general, pointing hope.
标签： management pointing general project
上传时间： 2013-12-22
上传用户：3到15
Create a Persistance Process in VB 6.0 That is unkillable.
标签： Persistance unkillable Process Create
上传时间： 2017-01-18
上传用户：lz4v4
java book,, a traditional one from the internet, pls quote That it is retrieved from the internet
标签： internet from traditional the
上传时间： 2017-01-21
上传用户：wuyuying
That main is usb and chuankou s contact and are used,I don t konw if they are used
上传时间： 2017-01-24
上传用户：wangdean1101
Samsung S3C2440A SOC RISC Microprocessor test program That demonstrates how to code most peripherals on the chip.
标签： Microprocessor demonstrates peripherals S3C2440A
上传时间： 2013-12-20
上传用户：yulg
ThreadX Library for ARM RISC microprocessor. ThreadX is a high performance RTOS That is wildly used in industrail world-wide.
标签： ThreadX microprocessor performance Library
上传时间： 2014-10-26
上传用户：1101055045
The combinatorial core of the OVSF code assignment problem That arises in UMTS is to assign some nodes of a complete binary tree of height h (the code tree) to n simultaneous connections, such That no two assigned nodes (codes) are on the same root-to-leaf path. Each connection requires a code on a specified level. The code can change over time as long as it is still on the same level. We consider the one-step code assignment problem: Given an assignment, move the minimum number of codes to serve a new request. Minn and Siu proposed the so-called DCAalgorithm to solve the problem optimally. We show That DCA does not always return an optimal solution, and That the problem is NP-hard. We give an exact nO(h)-time algorithm, and a polynomial time greedy algorithm That achieves approximation ratio Θ(h). Finally, we consider the online code assignment problem for which we derive several results
标签： combinatorial assignment problem arises
上传时间： 2014-01-19
上传用户：BIBI
