<bdo id="qqusa"></bdo>
<rt id="qqusa"></rt>
All inputs of the C16x family have Schmitt-Trigger input characteristics. These Schmitt-Triggers are intended to always provide proper internal low and high levels, even if anundefined voltage level (between TTL-VIL and TTL-VIH) is externally applied to the pin.The hysteresis of these inputs, however, is very small, and can not be properly used in anapplication to suppress signal noise, and to shape slow rising/falling input transitions.Thus, it must be taken care that rising/falling input signals pass the undefined area of theTTL-specification between VIL and VIH with a sufficient rise/fall time, as generally usualand specified for TTL components (e.g. 74LS series: gates 1V/us, clock inputs 20V/us).The effect of the implemented Schmitt-Trigger is that even if the input signal remains inthe undefined area, well defined low/high levels are generated internally. Note that allinput signals are evaluated at specific sample points (depending on the input and theperipheral function connected to it), at that signal transitions are detected if twoconsecutive samples show different levels. Thus, only the current level of an input signalat these sample points is relevant, that means, the necessary rise/fall times of the inputsignal is only dependant on the sample rate, that is the distance in time between twoconsecutive evaluation time points. If an input signal, for instance, is sampled throughsoftware every 10us, it is irrelevant, which input level would be seen between thesamples. Thus, it would be allowable for the signal to take 10us to pass through theundefined area. Due to the sample rate of 10us, it is assured that only one sample canoccur while the signal is within the undefined area, and no incorrect transition will bedetected. For inputs which are connected to a peripheral function, e.g. capture inputs, thesample rate is determined by the clock cycle of the peripheral unit. In the case of theCAPCOM unit this means a sample rate of 400ns @ 20MHz CPU clock. This requiresinput signals to pass through the undefined area within these 400ns in order to avoidmultiple capture events.For input signals, which do not provide the required rise/fall times, external circuitry mustbe used to shape the signal transitions.In the attached diagram, the effect of the sample rate is shown. The numbers 1 to 5 in thediagram represent possible sample points. Waveform a) shows the result if the inputsignal transition time through the undefined TTL-level area is less than the time distancebetween the sample points (sampling at 1, 2, 3, and 4). Waveform b) can be the result ifthe sampling is performed more than once within the undefined area (sampling at 1, 2, 5,3, and 4).Sample points:1. Evaluation of the signal clearly results in a low level2. Either a low or a high level can be sampled here. If low is sampled, no transition willbe detected. If the sample results in a high level, a transition is detected, and anappropriate action (e.g. capture) might take place.3. Evaluation here clearly results in a high level. If the previous sample 2) had alreadydetected a high, there is no change. If the previous sample 2) showed a low, atransition from low to high is detected now.
標(biāo)簽： Signal Input Fall Rise
上傳時間： 2013-10-23
上傳用戶：copu
最新的支持向量機(jī)工具箱，有了它會很方便 1. Find time to write a proper list of things to do! 2. Documentation. 3. Support Vector Regression. 4. Automated model selection. REFERENCES ========== [1] V.N. Vapnik, "The Nature of Statistical Learning Theory", Springer-Verlag, New York, ISBN 0-387-94559-8, 1995. [2] J. C. Platt, "Fast training of support vector machines using sequential minimal optimization", in Advances in Kernel Methods - Support Vector Learning, (Eds) B. Scholkopf, C. Burges, and A. J. Smola, MIT Press, Cambridge, Massachusetts, chapter 12, pp 185-208, 1999. [3] T. Joachims, "Estimating the Generalization Performance of a SVM Efficiently", LS-8 Report 25, Universitat Dortmund, Fachbereich Informatik, 1999.
上傳時間： 2013-12-16
上傳用戶：亞亞娟娟123
物流分析工具包。Facility location: Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated facility location Vehicle routing: VRP, VRP with time windows, traveling salesman problem (TSP) Networks: Shortest path, min cost network flow, minimum spanning tree problems Geocoding: U.S. city or ZIP code to longitude and latitude, longitude and latitude to nearest city, Mercator projection plotting Layout: Steepest descent pairwise interchange (SDPI) heuristic for QAP Material handling: Equipment selection General purpose: Linear programming using the revised simplex method, mixed-integer linear programming (MILP) branch and bound procedure Data: U.S. cities with populations of at least 10,000, U.S. highway network (Oak Ridge National Highway Network), U.S. 3- and 5-digit ZIP codes
標(biāo)簽： location location-allocation Continuous alternate
上傳時間： 2015-05-17
上傳用戶：kikye
Rotating shafts experience a an elliptical motion called whirl. It is important to decompose this motion into a forward and backward whil orbits. The current function makes use of two sensors to generate a bi-directional spectrogram. The method can be extended to any time-frequency distribution ％ ％ compute the forward/backward Campbell/specgtrogram ％ ％ INPUT: ％ y (n x 2) each column is measured from a different sensor ％ /////// ％ __ ％ |s1| y(:,1) ％ |__| ％ __ ％ / \ ________|/ ％ | | | s2 |/ y(:,2) ％ \____/ --------|/ ％ ％ Fs Sampling frequnecy ％ ％ OUTPUT: ％ B spectrogram/Campbel diagram ％ x x-axis coordinate vector (time or Speed) ％ y y-axis coordinate vector (frequency [Hz])
標(biāo)簽： experience elliptical decompose important
上傳時間： 2015-06-23
上傳用戶：372825274
BNB20 Finds the constrained minimum of a function of several possibly integer variables. ％ Usage: [errmsg,Z,X,t,c,fail] = ％ BNB20(fun,x0,xstatus,xlb,xub,A,B,Aeq,Beq,nonlcon,settings,options,P1,P2,...) ％ ％ BNB solves problems of the form: ％ Minimize F(x) subject to: xlb <= x0 <=xub ％ A*x <= B Aeq*x=Beq ％ C(x)<=0 Ceq(x)=0 ％ x(i) is continuous for xstatus(i)=0 ％ x(i) integer for xstatus(i)= 1 ％ x(i) fixed for xstatus(i)=2 ％
標(biāo)簽： constrained variables function possibly
上傳時間： 2014-01-13
上傳用戶：youth25
palm編成,這種書很少,有興趣看看 Title: Palm Programming: The Developer s Guide URL: http://safari.oreilly.com/JVXSL.asp?x=1&mode=section&sortKey=rank&sortOrder=desc&view=book&xmlid=1-56592-525-4&open=false&srchText=palm+programming&code=&h=&m=&l=1&catid=&s=1&b=1&f=1&t=1&c=1&u=1&page=0 ISBN: 1-56592-525-4 Author: Julie McKeehan/ Neil Rhodes Publisher: O Reilly Page: 478 Edition: 1st edition (December 1998) Catalog: PDA programming / Palm Format: pdf Size: 2.06M Supplier: Summary: Emerging as the bestselling hand-held computers of all time, PalmPilots have spawned intense developer activity and a fanatical following. Used by Palm in their developer training, this tutorial-style book shows intermediate to experienced C programmers how to build a Palm application from the ground up. Includes a CD-ROM with source code and third-party developer tools
標(biāo)簽： Programming Developer oreilly safari
上傳時間： 2013-12-10
上傳用戶：litianchu
acm HDOJ 1051WoodenSticks Description: There is a pile of n wooden sticks. The length and weight of each stick are known in advance. The sticks are to be processed by a woodworking machine in one by one fashion. It needs some time, called setup time, for the machine to prepare processing a stick. The setup times are associated with cleaning operations and changing tools and shapes in the machine. The setup times of the woodworking machine are given as follows: (a) The setup time for the first wooden stick is 1 minute. (b) Right after processing a stick of length l and weight w , the machine will need no setup time for a stick of length l and weight w if l<=l and w<=w . Otherwise, it will need 1 minute for setup.
標(biāo)簽： WoodenSticks Description length wooden
上傳時間： 2014-03-08
上傳用戶：netwolf
The program md.f implements a simple molecular dynamics simulation in continuous real space. The velocity Verlet algorithm is used to implement the time stepping. The force and energy computations are performed in parallel, as is the time integration. (The program uses some Fortran90 features, so an F90 compiler may be needed.)
標(biāo)簽： implements continuous simulation The
上傳時間： 2016-04-03
上傳用戶：zhaiye
小程序應(yīng)有如下功能： 1、登記。登記每位同學(xué)的上網(wǎng)卡號，押金(>=5 RMB)和上網(wǎng)時刻。 2、查詢。可以查詢每個上網(wǎng)卡號的上網(wǎng)時刻，上網(wǎng)的時間，押金和當(dāng)前的費(fèi)用。 3、結(jié)賬。根據(jù)卡號可以算出 應(yīng)收金額，應(yīng)找金額。 4、提醒。當(dāng)某個上網(wǎng)卡號的 上網(wǎng)費(fèi)用 >= 它的押金時應(yīng)提醒管理員。 5、續(xù)費(fèi)。當(dāng)某個上網(wǎng)卡號的 上網(wǎng)費(fèi)用 >= 它的押金，他可以再次交上一定金額的押金(>=5 RMB)。 6、修改費(fèi)率。上網(wǎng)的費(fèi)率應(yīng)可以調(diào)整。默認(rèn)的費(fèi)率是1 RMB /1小時。 為了不讓機(jī)房賠本，應(yīng)是這樣的收費(fèi)模式：先付錢后上網(wǎng)。如上機(jī)就五角， 以后過半小時收五角。 7、總賬。一天下來管理員要知道這天他賺了多少RMB。 你需要考慮程序被意外結(jié)束等特殊情況。 如果你的程序是按系統(tǒng)時間進(jìn)行計時，還應(yīng)考慮系統(tǒng)時間被意外更改的特殊情況。總之，你應(yīng)考慮一切會讓你的程序不能正常運(yùn)行的特殊情況。 如果不知道怎么計時，你可以學(xué)習(xí)參考使用<time.h>中函數(shù)。 說明： a. 假定機(jī)房有150臺機(jī)器。 b. 假定初始的費(fèi)率是1 RMB /1分鐘(便于測試)。
上傳時間： 2016-06-27
上傳用戶：gut1234567
The task of clustering Web sessions is to group Web sessions based on similarity and consists of maximizing the intra- group similarity while minimizing the inter-group similarity． The first and foremost question needed to be considered in clustering W b sessions is how to measure the similarity between Web sessions．However．there are many shortcomings in traditiona1 measurements．This paper introduces a new method for measuring similarities between Web pages that takes into account not only the URL but also the viewing time of the visited web page．Yhen we give a new method to measure the similarity of Web sessions using sequence alignment and the similarity of W eb page access in detail Experiments have proved that our method is valid and e幣cient．
標(biāo)簽： sessions clustering similarity Web
上傳時間： 2014-01-11
上傳用戶：songrui
蟲蟲下載站版權(quán)所有 京ICP備2021023401號-1
<bdo id="me6qo"></bdo>
<s id="me6qo"></s>