b ffd dfgdf fd gdfg d gsdgdsg dsg sdg sdg sg sgsd dfhsdfh sh sh sdg sdgh shdxnfvbcvbxf reh g dbbcb cvb dfb dfbxbcb nf bdfdf dfgdfxg
標簽： sdg shdxnfvbcvbxf dfhsdfh gsdgdsg
上傳時間： 2013-12-14
上傳用戶：米卡
一﹑指標要求：. A: f5 b G A( d8 n （１）設計一個4位十進制的頻率計其測量范圍1Hz~9.999KHz；6 N3 G8 k( U- @ n* A （２）記數(shù)過程結束后，保存并顯示結果；
上傳時間： 2014-01-07
上傳用戶：妄想演繹師
迭代法求最佳閾值 圖像為baboon.bmp 分別對R,G,B三個顏色求閾值，進行分割
上傳時間： 2017-09-10
上傳用戶：q123321
可以將圖像中r,g,b三個分量分別提取出來，并顯示
上傳時間： 2015-06-27
上傳用戶：lyx1998
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.
上傳時間： 2013-10-23
上傳用戶：copu
二: 普通計算器的設計說明: 1 普通計算器的主要功能(普通計算與逆波蘭計算): 1.1主要功能: 包括 a普通加減乘除運算及帶括號的運算 b各類三角與反三角運算（可實現(xiàn)角度與弧度的切換） c邏輯運算， d階乘與分解質因數(shù)等 e各種復雜物理常數(shù)的記憶功能 f對運算過程的中間變量及上一次運算結果的儲存. G 定積分計算器（只要輸入表達式以及上下限就能將積分結果輸出） H 可編程計算器（只要輸入帶變量的表達式后，再輸入相應的變量的值就能得到相應的結果） I 二進制及八進制的計算器 j十六進制轉化為十進制的功能。 *k (附帶各種進制間的轉化器)。 L幫助與階乘等附屬功能
上傳時間： 2013-11-26
上傳用戶：yzy6007
車牌定位－－－VC++源代碼程序 1.24位真彩色->256色灰度圖。 2.預處理:中值濾波。 3.二值化:用一個初始閾值T對圖像A進行二值化得到二值化圖像B。 初始閾值T的確定方法是:選擇閾值T=Gmax-(Gmax-Gmin)/3,Gmax和Gmin分別是最高、最低灰度值。 該閾值對不同牌照有一定的適應性,能夠保證背景基本被置為0,以突出牌照區(qū)域。 4.削弱背景干擾。對圖像B做簡單的相鄰像素灰度值相減,得到新的圖像G,即Gi,j=|Pi,j-Pi,j-1|i=0,1,…,439 j=0,1,…,639Gi,0=Pi,0,左邊緣直接賦值,不會影響整體效果。 5.用自定義模板進行中值濾波 區(qū)域灰度基本被賦值為0。考慮到文字是由許多短豎線組成,而背景噪聲有一大部分是孤立噪聲,用模板(1,1,1,1,1)T對G進行中值濾波,能夠得到除掉了大部分干擾的圖像C。 6.牌照搜索:利用水平投影法檢測車牌水平位置,利用垂直投影法檢測車牌垂直位置。 7.區(qū)域裁剪,截取車牌圖像。
上傳時間： 2013-11-26
上傳用戶：懶龍1988
Implemented BFS, DFS and A* To compile this project, use the following command: g++ -o search main.cpp Then you can run it: ./search The input is loaded from a input file in.txt Here is the format of the input file: The first line of the input file shoud contain two chars indicate the source and destination city for breadth first and depth first algorithm. The second line of input file shoud be an integer m indicate the number of connections for the map. Following m lines describe the map, each line represents to one connection in this form: dist city1 city2, which means there is a connection between city1 and city2 with the distance dist. The following input are for A* The following line contains two chars indicate the source and destination city for A* algorithm. Then there is an integer h indicate the number of heuristic. The following h lines is in the form: city dist which means the straight-line distance from the city to B is dist.
標簽： Implemented following compile command
上傳時間： 2014-01-01
上傳用戶：lhc9102
* "Copyright (c) 2006 Robert B. Reese ("AUTHOR")" * All rights reserved. * (R. Reese, reese@ece.msstate.edu, Mississippi State University) * IN NO EVENT SHALL THE "AUTHOR" BE LIABLE TO ANY PARTY FOR * DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES ARISING OUT * OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN IF THE "AUTHOR" * HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
上傳時間： 2015-09-24
上傳用戶：mpquest
考察例1 4 - 8中的1 4個點。A中的最近點對為(b,h)，其距離約為0 . 3 1 6。B中最近點對為 (f, j)，其距離為0 . 3，因此= 0 . 3。當考察 是否存在第三類點時，除d, g, i, l, m 以外 的點均被淘汰，因為它們距分割線x= 1的 距離≥ 。RA ={d, i, m}，RB= {g, l}，由 于d 和m 的比較區(qū)中沒有點，只需考察i 即可。i 的比較區(qū)中僅含點l。計算i 和l 的距離，發(fā)現(xiàn)它小于，因此(i, l) 是最近
標簽：
上傳時間： 2013-12-03
上傳用戶：66666
