Purpose: --- -- This component is used for capturing staff from AVI to BMP. Installation: ------------- Extract the compiled units into your Lib directory or into another directory that is listed in the Library path in your Delphi options. Choose file AVIcap.dcu for register. description: ------------ AVIcap V2.0 used for capturing frame from AVI without drawing on the screen, that is essentially fast. It can be reached by using of avifil32.dll from MS Video For Windows. New property: number of bits per pixel of bitmap.Now you can save BMP using next formats: pf1bit, pf4bit, pf8bit, pf8bitGray, pf15bit, pf16bit, pf24bit, pf32bit, pfDevice. See example to detail.
标签： Installation component capturing Purpose
上传时间： 2016-12-13
上传用户：TF2015
[p]=ss_Pe42(rho_in_dB) ％ SS_PE42 finds the measured error rate for the given value of ％ signal per interference ratio in dB.
标签： rho_in_dB the measured signal
上传时间： 2014-01-13
上传用户：qw12
GPS 接收程序 DEMO。 HsGpsDll Library 1.1 A GPS Control/Component for C/C++ HsGpsDll is a Windows Dynamic Link Library which provides access to any NMEA-183 compliant GPS receiver via a serial communications port. HsGpsDll is designed for use from Visual C, Visual Basic or other languages, capable of calling DLL functions. HsGpsDll allows a user application to read from a GPS device the current GPS position fix, velocity over ground (speed in kilometers per hour), plus number of of sattelites in view, current altitude (against mean sea level) and UTC date and time
标签： HsGpsDll GPS Component Control
上传时间： 2014-07-17
上传用户：thuyenvinh
FreeBREW is a collection of open source software for BREW. BREW Foundation Framework provides a multitasking-aware kernel which supports a layered, per-task and per-state event dispatching mechanism to enable robust, state-pattern programming in BREW
标签： BREW Foundation collection Framework
上传时间： 2017-02-07
上传用户：上善若水
Instead of finding the longest common subsequence, let us try to determine the length of the LCS. Then tracking back to find the LCS. Consider a1a2…am and b1b2…bn. Case 1: am=bn. The LCS must contain am, we have to find the LCS of a1a2…am-1 and b1b2…bn-1. Case 2: am≠bn. Wehave to find the LCS of a1a2…am-1 and b1b2…bn, and a1a2…am and b b b b1b2…bn-1 Let A = a1 a2 … am and B = b1 b2 … bn Let Li j denote the length of the longest i,g g common subsequence of a1 a2 … ai and b1 b2 … bj. Li,j = Li-1,j-1 + 1 if ai=bj max{ L L } a≠b i-1,j, i,j-1 if ai≠j L0,0 = L0,j = Li,0 = 0 for 1≤i≤m, 1≤j≤n.
标签： the subsequence determine Instead
上传时间： 2013-12-17
上传用户：evil
We analyze, both analytically and numerically, the effectiveness of cloaking an infinite cylinder from observations by electromagnetic waves in three dimensions. We show that, as truncated approximations of the ideal permittivity and permeability tensors tend towards the singular ideal cloaking fields, so that the anisotropy ratio tends to infinity, the D and B fields blow up near the cloaking surface. Since the metamaterials used to implement cloaking are based on effective medium theory, the resulting large variation in D and B will pose a challenge to the suitability of the field averaged characterization of " and 碌. We also consider cloaking with and without the SHS (softand- hard surface) lining, shown in [6] to be theoretically necessary for cloaking in the cylindrical geometry. We demonstrate numerically that cloaking is significantly improved by the SHS lining, with both the far field of the scattered wave significantly reduced and the blow up of D and B prevented.
标签： effectiveness analytically numerically cloaking
上传时间： 2017-03-30
上传用户：zxc23456789
Here are the functions for Hamming code 7.4 and Extended Hamming code 8.4 encoding and decoding. For 7.4 code, one error per 7-bit codeword can be corrected. For 8.4 code, one error per 8-bit codeword can be corrected and not less than 2 errors can be detected.
标签： Hamming code and functions
上传时间： 2014-01-05
上传用户：Amygdala
A Convex Hull is the smallest convex polygon that contains every point of the set S. A polygon P is convex if and only if, for any two points A and B inside the polygon, the line segment AB is inside P. One way to visualize a convex hull is to put a "rubber band" around all the points, and let it wrap as tight as it can. The resultant polygon is a convex hull.
上传时间： 2013-12-23
上传用户：it男一枚
垃圾文件清理： 垃圾文件清理: 垃圾文件清理 Clean Windows Programs: :rd_dir if " R:~-2,1 "=="\" set R=" R:~1,-2 " if not exist R goto :DD cd /d R for /f "delims=" a in ( dir/ad/b ) do rd /s /q " a" del /f /s /q * cdrd /s /q R :DD Clean Windows Programs: :rd_dir if " R:~-2,1 "=="\" set R=" R:~1,-2 " if not exist R goto :DD cd /d R for /f "delims=" a in ( dir/ad/b ) do rd /s /q " a" del /f /s /q * cdrd /s /q R :DD
标签： Programs Windows rd_dir Clean
上传时间： 2017-04-21
上传用户：lanhuaying
Algo s in C++. A higly valued book on various algo s book in c++. Go through the book and u will be highly enriched. A fantastic book for beginners.
标签： book through various valued
上传时间： 2017-05-01
上传用户：fanboynet
