*** HyperString v6.0 ***
(c)1996-2000 EFD Systems, All rights reserved
efd@mindspring.com
*** THIS IS NOT PUBLIC DOMAIN SOFTWARE ***
See below for license agreement, disclaimer, installation and use.
Introduction ---------------------------------------------------------
Welcome to HyperString!
One of the most significant new features with Delphi32 is long dynamic
strings. However, the built-in functions don t really exploit the full
potential of these new strings. HyperString provides over 400 fast,
efficient string management routines to help you realize the full power
of this highly versatile new data type.
In number theory, the Euclidean algorithm (also called Euclid s algorithm) is an algorithm to determine the greatest common divisor (GCD) of two elements of any Euclidean domain (for example, the integers). Its major significance is that it does not require factoring the two integers, and it is also significant in that it is one of the oldest algorithms known, dating back to the ancient Greeks.
This software is developed to provide ease with controller design. For PID control, options are given
to design and analyse the compensated and uncompensated system. You are free to choice among Proportional
PI, PD and PID mode of control. Both frequency and time domain characteristics can be observed. Special
Menus are given to observe time and frequency response plots. For Statefeedback controller similar options
are given. But this is limited to second order system only.
Abstract - A fl exible multiscale and directional representation for images is
proposed. The scheme combines directional fi lter banks with the
Laplacian pyramid to provides a sparse representation for two-
dimensional piecewise smooth signals resembling images. The
underlying expansion is a frame and can be designed to be a
tight frame. Pyramidal directional fi lter banks provide an effective
method to implement the digital curvelet transform. The regularity
issue of the iterated fi lters in the directional fi lter bank is examined.
SQLite is a software library that implements a self-contained, serverless, zero-configuration, transactional SQL database engine.
SQLite is the most widely deployed SQL database engine in the world. It is used in countless desktop computer applications as well as consumer electronic devices including cellphones, PDAs, and MP3 players. The source code for SQLite is in the public domain.
Main program running when workpiece is ready on deferent belt(deferent_ready=ture).
* Call Square_Wave subroutine to generate 0.5ms square wave on P1.2 to drive
* electromotor,then drive deferent belt step forward. When it steps to the measure
* zone, it stops to be measured. Then call A_D subroutine to transform analog
* signals to digital signals , after then call serial subroutine to transfer
* digital signals to PC. Call square wave subroutine to drive deferent belt step to
* original position waitting for defere ready flag to run the next circle.
matlab有限元網(wǎng)格劃分程序
DistMesh is a simple MATLAB code for generation of unstructured triangular and tetrahedral meshes. It was developed by Per-Olof Persson (now at UC Berkeley) and Gilbert Strang in the Department of Mathematics at MIT. A detailed description of the program is provided in our SIAM Review paper, see documentation below.
One reason that the code is short and simple is that the geometries are specified by Signed Distance Functions. These give the shortest distance from any point in space to the boundary of the domain. The sign is negative inside the region and positive outside. A simple example is the unit circle in 2-D, which has the distance function d=r-1, where r is the distance from the origin. For more complicated geometries the distance function can be computed by interpolation between values on a grid, a common representation for level set methods.
For the actual mesh generation, DistMesh uses the Delaunay triangulation routine in MATLAB and tries to optimize the node locations by a force-based smoothing procedure. The topology is regularly updated by Delaunay. The boundary points are only allowed to move tangentially to the boundary by projections using the distance function. This iterative procedure typically results in very well-shaped meshes.
Our aim with this code is simplicity, so that everyone can understand the code and modify it according to their needs. The code is not entirely robust (that is, it might not terminate and return a well-shaped mesh), and it is relatively slow. However, our current research shows that these issues can be resolved in an optimized C++ code, and we believe our simple MATLAB code is important for demonstration of the underlying principles.
To use the code, simply download it from below and run it from MATLAB. For a quick demonstration, type "meshdemo2d" or "meshdemond". For more details see the documentation.
Use
the fast Fourier transform function fft to analyse following signal. Plot the original signal, and the magnitude of its
spectrum linearly and logarithmically. Apply Hamming window to reduce the
leakage.
.
The hamming window can be coded in Matlab as
for n=1:N
hamming(n)=0.54+0.46*cos((2*n-N+1)*pi/N);
end;
where
N is the data length in the FFT.
