Individual files are available in the following links:
Bessjy -- Bessel functions Jn and Yn for real argument and integer or real order.
Bessik -- Modified Bessel function In and Kn for real argument and integer or real order.
CBessjy -- Bessel functions Jv and Yv for real or complex Arguments and real order.
CBessik -- Modified Bessel functions Iv and Kv for complex Arguments and real order.
PIECEWISE_EVAL: evaluates a piecewise function of x
usage: y = PIECEWISE_EVAL(x,breakpoints,funs)
Arguments (input)
x - vector or array of points to evaluate though the function
breakpoints - list of n breakpoints, -inf and +inf are implicitly
The main purpose of this project is to add a new scheduling algorithm to GeekOS and to implement a simple synchronization primitive (semaphore). As you might have already noticed, GeekOS uses a simple priority based preemptive Round Robin algorithm. In this project, you will change this to a multilevel feedback scheduling. In addition, you will provide user programs with semaphores, a means to check the system s current time and a mechanism for passing command-line Arguments
simulates coin tossing. Let the program toss a coin each time the user chooses the “Toss Coin” menu option. Count the number of times each side of the coin appears. Display the results. The program should call a separate method flip that takes no Arguments and returns false for tails and true for heads. [ Note: If the program realistically simulates coin tossing, each side of the coin should appear approximately half the time.]
"TR1 roughly doubles the size of the C++ standard library, and it introduces many new facilities and even new kinds of library components. TR1 has some classes, for example, where some nested types may or may not exist depending on the template Arguments. To programmers whose experience stops with the standard library, this is strange and unfamiliar. This book is complete (it covers all TR1 facilities), it is easier to understand than TR1 itself, and it is technically accurate."
how to add arrays
* Use of const (constant) values.
* Creation of vectors.
* Passing vectors as function Arguments.
* Reading from files of unknown size (monitoring istream status).
* Repetitive structures (while and for loops).
* The increment operators (++).
* Selection structures (if-else statements).
* Use of the .size, .empty, .begin, .insert, .erase, .resize, .clear and .swap vector class member functions.
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.
FFTGUI Demonstration of Finite Fourier Transform.
FFTGUI(y) plots real(y), imag(y), real(fft(y)) and imag(fft(y)).
FFTGUI, without any Arguments, uses y = zeros(1,32).
When any point is moved with the mouse, the other plots respond.
Inspired by Java applet by Dave Hale, Stanford Exploration Project,
http://sepwww.stanford.edu/oldsep/hale/FftLab.html
