program which uses hashing techniques for storing and retrieving the data. Input to the program: Some random numbers. Input will be from a file. Output: First the program reads all the input and store it properly using some hash techniques. Once your program reads the complete input,it waits for the user input (prompt to the user). User now enters some number.program displays if this number exists in the list or not. it also display the time taken in the search operation.
標簽： program techniques retrieving the
上傳時間： 2017-04-27
上傳用戶：shus521
This project developed in java leads us to realize a flight reservation system in order to emulate databases containing the structures for the flight and for the booking. These bases extend the List interface and implements additional search鈥檚 methods. Two interfaces provide an access to this system. The first one reads and handles reservation request message from a terminal. The arguments are then processed throw a middleware interface that call the flight system methods. The second one, a Graphical User Interfaces (GUI) application using Swing Java Foundation Classes (JFC), offers a simpler access to the systems.
標簽： reservation developed project emulate
上傳時間： 2017-04-27
上傳用戶：6546544
Maya Calendar During his last sabbatical, professor M. A. Ya made a surprising discovery about the old Maya calendar. From an old knotted message, professor discovered that the Maya civilization used a 365 day long year, called Haab, which had 19 months. Each of the first 18 months was 20 days long, and the names of the months were pop, no, zip, zotz, tzec, xul, yoxkin, mol, chen, yax, zac, ceh, mac, kankin, muan, pax, koyab, cumhu. Instead of having names, the days of the months were denoted by numbers starting from 0 to 19. The last month of Haab was called uayet and had 5 days denoted by numbers 0, 1, 2, 3, 4. The Maya believed that this month was unlucky, the court of justice was not in session, the trade stopped, people did not even sweep the floor.
標簽： A. M. sabbatical surprising
上傳時間： 2014-01-05
上傳用戶：libenshu01
The Fat Fs module is a middleware that written in ANSI C. There is no platform dependence, so long as the compiler is in compliance with ANSI C. However it handles the system portable FAT structures. You must take the endian into consideration. It must be changed for your platform first or the compiler will abort with an error.
標簽： C. dependence middleware platform
上傳時間： 2014-01-12
上傳用戶：cccole0605
ImageJ Conebeam Filtered Back Projection Plug-in. To use this plug-in, a stack of projection images need to be opened first.
標簽： Projection projection Conebeam Filtered
上傳時間： 2013-12-25
上傳用戶：z1191176801
Generate Possion Dis. step1:Generate a random number between [0,1] step2:Let u=F(x)=1-[(1/e)x] step3:Slove x=1/F(u) step4:Repeat Step1~Step3 by using different u,you can get x1,x2,x3,...,xn step5:If the first packet was generated at time [0], than the second packet will be generated at time [0+x1],The third packet will be generated at time [0+x1+x2], and so on …. Random-number generation 1.static method random from class Math -Returns doubles in the range 0.0 <= x < 1.0 2.class Random from package java.util -Can produce pseudorandom boolean, byte, float, double, int, long and Gaussian values -Is seeded with the current time of day to generate different sequences of numbers each time the program executes
標簽： Generate Possion between random
上傳時間： 2017-05-25
上傳用戶：bibirnovis
USBHostSlave is a USB 1.1 host and Device IP core. – Supports full speed (12Mbps) and low speed (1.5Mbps) operation. – USB Device has four endpoints, each with their own independent FIFO. – Supports the four types of USB data transfer control, bulk, interrupt, and isochronous transfers. – Host can automatically generate SOF packets. – 8-bit Wishbone slave bus interface. – FIFO depth configurable via paramters.
標簽： speed USBHostSlave and Supports
上傳時間： 2014-01-17
上傳用戶：sxdtlqqjl
The most straightforward approximation is the standard Gaussian approximation, where the MAI is approximated by a Gaussian random variable. This approximation is simple, however it is not accurate in general. In situations where the number of users is not large, the Gaussian approximation is not appropriate. In-depth analysis of must be applied. The Holtzman?s improved Gaussian approximation provides a better approximation to the MAI term. The approximation conditions the interference term on the operation condition of each user.
標簽： approximation straightforward the Gaussian
上傳時間： 2017-06-03
上傳用戶：dyctj
Novell.Press.Linux.Kernel.Development linux內(nèi)核開發(fā)的經(jīng)典書籍之一 The Linux kernel is one of the most interesting yet least understood open-source projects. It is also a basis for developing new kernel code. That is why Sams is excited to bring you the latest Linux kernel development information from a Novell insider in the second edition of Linux Kernel Development. This authoritative, practical guide will help you better understand the Linux kernel through updated coverage of all the major subsystems, new features associated with Linux 2.6 kernel and insider information on not-yet-released developments. You ll be able to take an in-depth look at Linux kernel from both a theoretical and an applied perspective as you cover a wide range of topics, including algorithms, system call interface, paging strategies and kernel synchronization. Get the top information right from the source in Linux Kernel Development
標簽： Linux Development interes Novell
上傳時間： 2017-06-06
上傳用戶：songyue1991
Exceptional C++ shows by example how to go about solid software engineering. Along with a lot of other material, this book includes expanded versions of the first 30 issues of the popular Internet C++ feature Guru of the Week (or, in its short form, GotW), a series of self-contained C++ engineering problems and solutions that illustrate specific design and coding techniques.
標簽： Exceptional engineering software example
上傳時間： 2017-06-07
上傳用戶：yt1993410
