The ADC0803 family is a series of three CMOS 8-bit successive approximation A/D converters using a resistive ladder and capacitive array together with an auto-zero comparator. These converters are designed to operate with microprocessor-controlled buses using a Minimum of external circuitry. The 3-State output data lines can be connected directly to the data bus.
標簽： approximation converters successive family
上傳時間： 2016-11-20
上傳用戶：libenshu01
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
標簽： distribution version AVRcam source
上傳時間： 2016-12-30
上傳用戶：GavinNeko
ucos2 is a file system for embedded applications which can be used on any media, for which you can provide basic hardware access functions. µ C/FS is a high performance library that has been optimized for Minimum memory consumption in RAM and ROM, high speed and versatility. It is written in ANSI C and can be used on any CPU.
標簽： which applications can for
上傳時間： 2017-01-04
上傳用戶：偷心的海盜
ucos2 is a file system for embedded applications which can be used on any media, for which you can provide basic hardware access functions. µ C/FS is a high performance library that has been optimized for Minimum memory consumption in RAM and ROM, high speed and versatility. It is written in ANSI C and can be used on any CPU.
標簽： which applications can for
上傳時間： 2017-01-04
上傳用戶：13517191407
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
c pgm to find redundant paths in a graph.Many fault-tolerant network algorithms rely on an underlying assumption that there are possibly distinct network paths between a source-destination pair. Given a directed graph as input, write a program that uses depth-first search to determine all such paths. Note that, these paths are not vertex-disjoint i.e., the vertices may repeat but they are all edge-disjoint i.e., no two paths have the same edges. The input is the adjacency matrix of a directed acyclic graph and a pair(s) of source and destination vertices and the output should be the number of such disjoint paths and the paths themselves on separate lines. In case of multiple paths the output should be in order of paths with Minimum vertices first. In case of tie the vertex number should be taken in consideration for ordering.
標簽： fault-tolerant algorithms redundant underlyin
上傳時間： 2013-12-18
上傳用戶：jkhjkh1982
You will recieve a Standard Grade for completion of this Extra credit will be given for a more creative approach to the problem, either Minimum amount of code, an additional display of seating beyond just the boarding pass, etc
標簽： will completion for Standard
上傳時間： 2014-01-02
上傳用戶：dongqiangqiang
伸展樹，基本數據結構，The tree is drawn in such a way that both of the edges down from a node are the same length. This length is the Minimum such that the two subtrees are separated by at least two blanks.
標簽： 樹
上傳時間： 2017-05-07
上傳用戶：JIUSHICHEN
This program uses Markowitz portofolio theory to find combination of stocks in a portfolio which has Minimum variance for expected returns
標簽： combination portofolio Markowitz portfolio
上傳時間： 2017-05-07
上傳用戶：李彥東
使用INTEL矢量統計類庫的程序,包括以下功能: Raw and central moments up to 4th order Kurtosis and Skewness Variation Coefficient Quantiles and Order Statistics Minimum and Maximum Variance-Covariance/Correlation matrix Pooled/Group Variance-Covariance/Correlation Matrix and Mean Partial Variance-Covariance/Correlation matrix Robust Estimators for Variance-Covariance Matrix and Mean in presence of outliers
標簽： 61623 and Kurtosis central
上傳時間： 2017-05-14
上傳用戶：yzy6007
