算法的許多例子都是最優(yōu)化問題（ optimization problem），每個最優(yōu)化問題都包含一組限制條件（ c o n s t r a i n t）和一個優(yōu)化函數(shù)（ optimization function），符合限制條件的問題求解方案稱為可行解（ feasible solution），使優(yōu)化函數(shù)取得最佳值的可行解稱為最優(yōu)解（optimal solution）。
Tracking a moving object through several frames, provided changes from frame to frame are on the order of +-(10 + "X Range") pixels in the X direction and +-(10 + "Y Range") in the Y direction is done automatically because of a relatively large area of exploration during the search for an optimal (new) position for a particular control point and a very strong force exerted by large values of the image gradient.
In this paper, a new family of Cassinian wave-guides
is proposed, simulating and calculation are finished with CST
Microwave Studio that based on Finite Integral Technique (FIT),
and some results are given. Electromagnetic field mode type of it
is TE, electromagnetic field is stronger near neck region, and
some resonance frequencies appear. The new Cassinian curve
wave-guides will possess higher power than ones of the
rectangular and elliptic wave-guides because the height at the
position where maximal electric field occurs is smaller.
A new cable fault location method based on
wavelet reconstruction is proposed. In this method the
difference between the currents of faulty phase and sound
phase under the high voltage pulse excitation is used as the
measured signal and is decomposed in multi-scale by wavelet
transform, then reconstructed in single scale. Comparing with
traditional fault location method by travelling wave, the
presented method will not be interfered by the reflected wave
from the branch joint of cables or from other positions where
the impedances are not matched and not be influenced by fault
types, otherwise, the reflected waves can be recognized even
the faulty position is near to the measuring terminal, at the
same time, the influence of the wave speed uncertainty can be
reduced. The correctness of the proposed method is proved by
simulation results.
Traveling Salesman Problem (TSP) has been an interesting problem for a long
time in classical optimization techniques which are based on linear and nonlinear
programming. TSP can be described as follows: Given a number of cities to visit
and their distances from all other cities know, an optimal travel route has to be
found so that each city is visited one and only once with the least possible distance
traveled. This is a simple problem with handful of cities but becomes complicated
as the number increases.
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.
PRINCIPLE: PLS cross-validation using the SIMPLS or WIMPLS algorithm, respectively for tall or wide X-data. The optimal approach is selected automatically.
