This program is a bank switching example that shows how you can run (simulate) code executing in several code banks.
標(biāo)簽： executing switching simulate program
上傳時(shí)間： 2014-01-04
上傳用戶：小草123
RTX51 TINY Version 2 has been completly restructured to gain flexiblity, accelarate performance, and reduce code/data space requirements. Also several new features are added to this popular Real-Time Kernal.
標(biāo)簽： restructured performance accelarate flexiblity
上傳時(shí)間： 2014-01-19
上傳用戶：ikemada
The TMS320LF240xA and TMS320LC240xA devices, new members of the TMS320C24x generation of digital signal processor (DSP) controllers, are part of the TMS320C2000 platform of fixed-point DSPs. The 240xA devices offer the enhanced TMS320 DSP architectural design of the C2xx core CPU for low-cost, low-power, and high-performance processing capabilities. several advanced peripherals, optimized for digital motor and motion control applications, have been integrated to provide a true single-chip DSP controller. While code-compatible with the existing C24x DSP controller devices, the 240xA offers increased processing performance (40 MIPS) and a higher level of peripheral integration. See the TMS320x240xA Device Summary section for device-specific features.
標(biāo)簽： TMS 320 generation 240
上傳時(shí)間： 2013-12-16
上傳用戶：GavinNeko
This document is a "practical guide" to very quickly setup CVS/RCS source code control system. This document has custom shell scripts which are wrappers on top of CVS. These scripts provide an easy user interface for CVS. several shell scripts are provided to make RCS more easy to use. The information in this document applies to Linux and as well as to all other flavors of Unix liks Solaris, HPUX, AIX, SCO, Sinix, BSD, SCO, etc.. and BeOS.
標(biāo)簽： This practical document control
上傳時(shí)間： 2014-01-16
上傳用戶：gxmm
We address the problem of predicting a word from previous words in a sample of text. In particular, we discuss n-gram models based on classes of words. We also discuss several statistical algorithms for assigning words to classes based on the frequency of their co-occurrence with other words. We find that we are able to extract classes that have the flavor of either syntactically based groupings or semantically based groupings, depending on the nature of the underlying statistics.
標(biāo)簽： predicting particular previous address
上傳時(shí)間： 2016-12-26
上傳用戶：xfbs821
The AVRcam source files were built using the WinAVR distribution (version 3.3.1 of GCC). I haven t tested other versions of GCC, but they should compile without too much difficulty. * The source files for the AVRcam had the author name and copyright information added back into them after the judging of the project, since it states in the competition rules that the author s name can not be present during their inspection. * The included source files are the ones that were submitted for the entry into the Circuit Cellar contest. I have continued to develop the AVRcam, and have added several new features (such as ignoring objects that aren t larger than a minimum size, removing tracked objects that overlap with each, and some general optimizations). If you are interested in the latest source, email me at john@jrobot.net * For more info about the AVRcam, check out http://www.jrobot.net John Orlando August 20, 2004
標(biāo)簽： distribution version AVRcam source
上傳時(shí)間： 2016-12-30
上傳用戶：GavinNeko
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
標(biāo)簽： combinatorial assignment problem arises
上傳時(shí)間： 2014-01-19
上傳用戶：BIBI
The NCTUns network simulator and emulator is developed at NCTU, Taiwan. Its predecessor is the Harvard network simulator (invented by Prof. S.Y. Wang in 1999). By using a novel simulation methodology, it can do several tasks that traditional network simulators cannot easily do.
標(biāo)簽： predecessor developed simulator emulator
上傳時(shí)間： 2014-12-02
上傳用戶：txfyddz
I always wanted to play around with JNI. This is my first attempt so I created a utility DLL called TestImpl.dll that exports several useful functions which are difficult or impossible to implement in JAVA.
標(biāo)簽： attempt created utility always
上傳時(shí)間： 2013-12-28
上傳用戶：lx9076
The major functionality added in this release includes: - Rootless mode in X11 - Widget Templtes [both compiled and XML] As always, this isn t meant to be a stable release, it is only provided so people can more easily experiment with PicoGUI and possibly help in its development. Some of the more significant known bugs: - The PicoGUI laucher may not work right now, it s undergoing some change. - several of the apps included here are not finished, not started, or otherwise broken. - There is a redrawing bug that may cause flickering on some platforms
標(biāo)簽： functionality Rootless includes release
上傳時(shí)間： 2014-01-03
上傳用戶：gxmm
蟲蟲下載站版權(quán)所有 京ICP備2021023401號(hào)-1
