ANN and matlab7。you can enjoy the funny from these programs and help you realize what you want based on A
上传时间： 2013-12-14
上传用户：wangdean1101
Sofia SIP is an open-source SIP User-Agent library, compliant with the IETF RFC3261 specification. It can be used as a building block for SIP client software for uses such as VoIP, IM, and many other real-time and person-to-person communication services. The primary target platform for Sofia SIP is GNU/Linux. Sofia SIP is based on a SIP stack developed at the Nokia Research Center. Sofia SIP is licensed under the LGPL.
标签： specification open-source User-Agent SIP
上传时间： 2016-08-25
上传用户：asasasas
DevExpress.ExpressSideBar.v5.37.for.Delphi.BCB.Full.Source delphi和 bcb源码，能轻松实现outlook风格的侧边栏，效果很好，推荐！ ExpressSideBar is a VCL implementation of the MS Outlook bar. Designed to be easy to use and built with a significant feature set. Just drop it on a form, double click the control and in a few moments, you can customize the ExpressSideBar for your needs.
标签： ExpressSideBar DevExpress Delphi Source
上传时间： 2013-12-26
上传用户：han_zh
ELinks is an advanced and well-established feature-rich text mode web (HTTP/FTP/..) browser. ELinks can render both frames and tables, is highly customizable and can be extended via Lua or Guile scripts. It is quite portable and runs on a variety of platforms. Check the about page for a more complete description. ELinks is an Open Source project covered by the GNU General Public License. It originates from the Links project written by Mikulas Patocka. If you want to see ELinks in action check out the screenshots.
标签： ELinks well-established feature-rich advanced
上传时间： 2014-01-22
上传用户：3到15
This Application Note describes the steps that are required to install and use the Keil Monitor-51 on a user specific hardware. The Keil Monitor-51 allows you to connect your 8051 hardware to the μVision2 Debugger. You can use the powerful debugging interface to test application programs in your target hardware.
标签： Application describes the required
上传时间： 2013-12-03
上传用户：lvzhr
MySQL claims to be the world s most popular open source database, and with good reason. It is free, runs on a wide variety of platforms, is relatively simple, easy to configure and performs well even under significant load. By comparison to some other popular database management systems, configuring it is quite simple, but there are still a sufficiently wide variety of security-relevant configuration issues to make securing it a challenge.
标签： database popular claims source
上传时间： 2016-12-13
上传用户：王者A
These routines model tropospheric radiowave propagation over variable terrain and calculates propagation loss vs. height and range. Propagation loss is displayed in dB contours on a height vs. range plot. TPEM is based on the split-step Fourier PE method and was originally developed from an early PE model called PEPC, written by Fred Tappert. Propagation loss over variable terrain is modeled by shifting the field an appropriate number of bin widths correspondc ing to the height of the ground. The field is determined using the smooth earth PE method.
标签： tropospheric propagation calculates radiowave
上传时间： 2017-01-01
上传用户：225588
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
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
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
