Application Note Abstract
This Application Note introduces a complete and detailed PSoC® project. Telephone call Logger keeps the detailed record of
approximately 945 phone calls (7-digit number is assumed to be one phone call) including date, start time and the duration of
the phone call in the PSoC device. Users can get this detailed report into the PC environment by using free software, which is
included in the project file. When records reach near full capacity of the Flash memory, an LED will turn on to show that it is
necessary to backup the data. Software gets the data from PSoC, organizes it and prepares a printable version. Additionally, it
sends the date and time information to the PSoC. The external parts in this project can be obtained easily in the market.
多項(xiàng)式曲線擬合 任意介數(shù) Purpose - Least-squares curve fit of arbitrary order
working in C++ Builder 2007 as a template class,
using vector<FloatType> parameters.
Added a method to handle some EMathError exceptions.
If do NOT want to use this just call PolyFit2 directly.
usage: call PolyFit by something like this.
CPolyFit<double> PolyFitObj
double correlation_coefficiant = PolyFitObj.PolyFit(X, Y, A)
where X and Y are vectors of doubles which must have the same size and
A is a vector of doubles which must be the same size as the number of
coefficients required.
returns: The correlation coefficient or -1 on failure.
produces: A vector (A) which holds the coefficients.
1) Write a function reverse(A) which takes a matrix A of arbitrary dimensions as input and returns a matrix B consisting of the columns of A in reverse order. Thus for example, if
A = 1 2 3 then B = 3 2 1
4 5 6 6 5 4
7 8 9 9 8 7
Write a main program to call reverse(A) for the matrix A = magic(5). Print to the screen both A and reverse(A).
2) Write a program which accepts an input k from the keyboard, and which prints out the smallest fibonacci number that is at least as large as k. The program should also print out its position in the fibonacci sequence. Here is a sample of input and output:
Enter k>0: 100
144 is the smallest fibonacci number greater than or equal to 100.
It is the 12th fibonacci number.
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.]
Interface for Microsoft Audio Compression Manager. - Delphi Source
The ACM uses existing driver interface hooks to override the default mapping algorithm for waveform audio devices. This allows the ACM to intercept device-open calls. After a call has been intercepted, the ACM can perform a variety of tasks to process the audio data, such as inserting an external compressor or decompressor into the sequence.
Peers is a very minimalistic SIP User-Agent. It s a softphone, written in java, and it has been tested on linux and windows. It allows a user to call from one PC to another on a local area network, using SIP/SDP/RTP with Ulaw encoding for voice.
