The ability to write efficient, high-speed arithmetic routines ultimately depends upon your knowledge of the elements of arithmetic as they exist on a computer. That conclusion and this book are the result of a long and frustrating search for information on writing arithmetic routines for real-time embedded systems. With instruction cycle times coming down and clock rates going up, it would seem that speed is not a problem in writing fast routines. In addition, math coprocessors are becoming more popular and less expensive than ever before and are readily available. These factors make arithmetic easier and faster to use and implement. However, for many of you the systems that you are working on do not include the latest chips or the faster processors. Some of the most widely used microcontrollers used today are not Digital Signal Processors (DSP), but simple eight-bit controllers such as the Intel 8051 or 8048 microprocessors.
標簽： arithmetic high-speed ultimately efficient
上傳時間： 2014-11-30
上傳用戶：lizhen9880
Abstract The Lucene Server project is an attempt to extend the Jakarta Lucene tool with server capabilities. Lucene is a robust Java API that enables you creating indexes from text sources and perform powerful searches on these indexes. With Lucene, creating an index must be done programmatically and there are almost no possibilities of integrating index management in a distributed environment. In other words, out of the box, Lucene is suitable for integrating indexing and searching possibilities in a single application but not for providing index/search services for multiple applications. The Lucene Server project comes with a Java API that propose the following make it easy to create indexes in a declarative way by simply providing an XML configuration document. make it easy to personalize the way Lucene must handle different kind of data sources. provide services for index management and searching that can be accessed from several applications. enable batch tasks scheduling.
標簽： Lucene Abstract Jakarta project
上傳時間： 2016-01-10
上傳用戶：songrui
Please unzip the file and make the file under linux with version 2.6 or above. The function is just like the utility traceroute in linux or tracert in windows.
上傳時間： 2014-01-13
上傳用戶：h886166
PlotSphereIntensity(azimuth, elevation) PlotSphereIntensity(azimuth, elevation, intensity) h = PlotSphereIntensity(...) Plots the intensity (as color) of a number of points on a unit sphere. Input: azimuth (phi), in degrees elevation (theta), in degrees intensity (optional, if not provided, a green sphere is produced) All inputs must be vectors or matrices of the same size. Data does not have to be evenly spaced. When there aren t enough points to draw a smooth sphere, additional points (with color) are interpolated. Output: h - a handle to the patch object The axes are also plotted: positive x axis is red positive y axis is green positive z axis is blue
標簽： PlotSphereIntensity elevation azimuth intensity
上傳時間： 2014-01-15
上傳用戶：ruan2570406
Kalman filter toolbox written by Kevin Murphy, 1998. See http://www.ai.mit.edu/~murphyk/Software/kalman.html for details. Installation ------------ 1. Install KPMtools from http://www.ai.mit.edu/~murphyk/Software/KPMtools.html 3. Assuming you installed all these files in your matlab directory, In Matlab type addpath matlab/KPMtools addpath matlab/Kalman Demos ----- See tracking_demo.m for a demo of 2D tracking. See learning_demo.m for a demo of parameter estimation using EM. 較早版本的kalman濾波matlab源碼，適合研讀。
標簽： Software toolbox murphyk written
上傳時間： 2016-05-13
上傳用戶：541657925
I ve written some many years ago dynamic Huffman algorithm to compress and decompress data. It is mainly targeted to data with some symbols occuring more often than the rest (e.g. having some data file consisted of 3 different symbols and their total number of occurence in that file s1(1000), s2(200), s3(30) so the total length of file is 1000+200+30=1230 bytes, it will be encoded assigning one bit to s1 and 2 bits to s2, s3 so the encoded length will be 1*1000+2*(200+30)=1460 bits=182 bytes). In the best case the file consisted of just one symbol will be encoded with compression ratio as 1:8. Huffman coding is used in image compression, however in JPEG2000 arithmetic codec is imployed.
標簽： decompress algorithm compress Huffman
上傳時間： 2016-05-16
上傳用戶：aysyzxzm
EasyARM2100工程模板 該工程模板在文件夾EasyARM2100下，適用于EasyARM2104和EasyARM2100開發板。 該模板在文件夾EasyARM2100下，適用于EasyARM2100開發板，僅適合于用ADS編譯器的器情況。 模板文件夾下有一些文件夾，用于存放產生的文件。src文件夾用于存放用戶的源文件。 模板包含了EasyARM系列開發板的啟動代碼、初始化文件、分散加載文件等。這些文件和ADS模板的文件相同。 模板已經為用戶設置好了各種生成目標的設置選項，包括仿真片內RAM調試、片外RAM調試、片內FLASH調試、片內FLASH發布，以及所需要的初始化文件。對不同開發板和不同芯片，生成目標會有所不同。在模板文件夾下有各種不同生成目標的文件夾，用于存放各自的輸出文件。 EasyARM2100模板，有Simulator、Debug in RAM、Debug in FLASH和Release in FLASH 4種生成目標
上傳時間： 2013-12-17
上傳用戶：515414293
IEEE 802.11h-2003 IEEE Standard for Information technology—Telecommunications and Information Exchange Between Systems—LAN/MAN Specific Requirements—Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications: Spectrum and Transmit Power Management Extensions in the 5GHz band in Europe
標簽： Information Telecommunications IEEE technology
上傳時間： 2016-10-02
上傳用戶：lnnn30
C 開發的有限元軟件，界面還可以，不錯，可以試試。 FElt is a free system for introductory level finite element analysis. It is primarily intended as a teaching tool for introductory type courses in finite elements - probably in the mechanical/structural/civil fields. In a command line environment, FElt uses an intuitive, straightforward input syntax to describe problems. It also includes a graphical user interface for workstations that allows the user to set-up, solve and post-process the problem in a single CAD-like environment.
上傳時間： 2014-03-09
上傳用戶：zycidjl
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
