All of Java s Input/Output (I/O) facilities are based on streams, which provide simple ways to read and write data of different types. Java provides many different kinds of streams, each with its own application. The universe of streams is divided into four large categories: input streams and output streams, for reading and writing binary data and readers and writers, for reading and writing textual (character) data. You re almost certainly familiar with the basic kinds of streams--but did you know that there s a CipherInputStream for reading encrypted data? And a ZipOutputStream for automatically compressing data? Do you know how to use buffered streams effectively to make your I/O operations more efficient? Java I/O, 2nd Edition has been updated for Java 5.0 APIs and tells you all you ever need to know about streams--and probably more.
標(biāo)簽： facilities streams provide Output
上傳時(shí)間： 2013-12-17
上傳用戶：6546544
This is GPS Matlab findPreambles finds the first preamble occurrence in the bit stream of each channel. The preamble is verified by check of the spacing between preambles [6sec] and parity checking of the first two words in a subframe. At the same time function returns list of channels, that are in tracking state and with valid preambles in the nav data stream.
標(biāo)簽： findPreambles occurrence the preamble
上傳時(shí)間： 2013-12-23
上傳用戶：秦莞爾w
The Bit Array structure provides a compacted arrays of Booleans, with one bit for each Boolean value. A 0 [1] bit corresponds to the Boolean value false [true], respectively. We can look at a stream of bytes as a stream of bits each byte contains 8 bits, so any n bytes hold n*8 bits. And the operation to manipulate this stream or bits array is so easy, jut read or change the bits state or make any Boolean operation on the whole bits array, like 鈥楢ND鈥? 鈥極R鈥? or 鈥榅OR鈥?
標(biāo)簽： structure compacted Booleans provides
上傳時(shí)間： 2014-01-15
上傳用戶：壞天使kk
The Kalman filter is a set of mathematical equations that provides an efficient computational [recursive] means to estimate the state of a process, in a way that minimizes the mean of the squared error. The filter is very powerful in several aspects: it supports estimations of past, present, and even future states, and it can do so even when the precise nature of the modeled system is unknown.
標(biāo)簽： computational mathematical equations efficient
上傳時(shí)間： 2014-06-02
上傳用戶：yd19890720
it is a verilog code written for traffic light controller will synthesize in xinlix ise 8.2i.i have tested it om my kit.[i mae my own kit for spartan2 device].it is a state machine based code.
標(biāo)簽： controller synthesize verilog traffic
上傳時(shí)間： 2017-03-22
上傳用戶：xymbian
HDFDUMP and BRFDUMP are utility programs developed for use with MISR data files. HDFDUMP will extract data from a MISR file in the HDF-EOS grid format (MISR Level 1B2 and Level 2 files) and writes unformatted binary files. BRFDUMP calculates radiances and bidirectional reflectance factors (BRF) from MISR Level 1B2 files and creates unformatted binary files.
標(biāo)簽： HDFDUMP developed programs BRFDUMP
上傳時(shí)間： 2017-04-02
上傳用戶：yy541071797
Very good Java Applet used to animate Inserting, Deleting and Searching (Preorder & Postorder algorithm) nodes in Binary Trees. This is a part of mine students project. You can use and redistribute the source code absolutelly free!
標(biāo)簽： Inserting Searching Postorder Deleting
上傳時(shí)間： 2014-01-25
上傳用戶：蟲蟲蟲蟲蟲蟲
The main MIPS processor of SMP8630 comes with a JTAG interface, allowing: access to caches and data bus (DRAM) with a bandwidth of about 200kbit/s examining the processor state whatever the execution mode (monice) connecting to monice using mdi-server and using a gdb client on the processor to step and break accurately whatever the execution mode running semi-hosted applications fl ash write tool memory testing (MT command) real-time traces: has not been built in CPU (Config3_TL=0) and only supported by MajicPLUS probes (maybe built into emulator?)
標(biāo)簽： interface processor allowing access
上傳時(shí)間： 2013-12-19
上傳用戶：youke111
(有源代碼)數(shù)值分析作業(yè),本文主要包括兩個(gè)部分,第一部分是常微分方程(ODE)的三個(gè)實(shí)驗(yàn)題,第二部分是有關(guān)的拓展討論,包括高階常微分的求解和邊值問題的求解(BVP).文中的算法和算例都是基于Matlab計(jì)算的.ODE問題從剛性(STIFFNESS)來看分為非剛性的問題和剛性的問題,剛性問題(如大系數(shù)的VDP方程)用通常的方法如ODE45來求解,效率會(huì)很低,用ODE15S等,則效率會(huì)高多了.而通常的非剛性問題,用ODE45來求解會(huì)有很好的效果.從階次來看可以分為高階微分方程和一階常微分方程,高階的微分方程一般可以化為狀態(tài)空間(STATE SPACE)的低階微分方程來求解.從微分方程的性態(tài)看來,主要是微分方程式一階導(dǎo)系數(shù)大的時(shí)候,步長(zhǎng)應(yīng)該選得響應(yīng)的小些.或者如果問題的性態(tài)不是太好估計(jì)的話,用較小的步長(zhǎng)是比較好的,此外的話Adams多步法在小步長(zhǎng)的時(shí)候效率比R-K(RUNGE-KUTTA)方法要好些,而精度也高些,但是穩(wěn)定區(qū)間要小些.從初值和邊值來看,也是顯著的不同的.此外對(duì)于非線性常微分方程還有打靶法,胞映射方法等.而對(duì)于微分方程穩(wěn)定性的研究,則諸如相平面圖等也是不可缺少的工具.值得提出的是,除了用ode系類函數(shù)外,用simulink等等模塊圖來求解微分方程也是一種非常不錯(cuò)的方法,甚至是更有優(yōu)勢(shì)的方法(在應(yīng)用的角度來說).
上傳時(shí)間： 2014-01-05
上傳用戶：caixiaoxu26
OTSU Gray-level image segmentation using Otsu s method. Iseg = OTSU(I,n) computes a segmented image (Iseg) containing n classes by means of Otsu s n-thresholding method (Otsu N, A Threshold Selection Method from Gray-Level Histograms, IEEE Trans. Syst. Man Cybern. 9:62-66 1979). Thresholds are computed to maximize a separability criterion of the resultant classes in gray levels. OTSU(I) is equivalent to OTSU(I,2). By default, n=2 and the corresponding Iseg is therefore a binary image. The pixel values for Iseg are [0 1] if n=2, [0 0.5 1] if n=3, [0 0.333 0.666 1] if n=4, ... [Iseg,sep] = OTSU(I,n) returns the value (sep) of the separability criterion within the range [0 1]. Zero is obtained only with images having less than n gray level, whereas one (optimal value) is obtained only with n-valued images.
標(biāo)簽： OTSU segmentation Gray-level segmented
上傳時(shí)間： 2017-04-24
上傳用戶：yuzsu
蟲蟲下載站版權(quán)所有 京ICP備2021023401號(hào)-1
