jWAP is a Java implementation of the Wireless Application Protocol (WAP).
It includes Wireless Session Protocol (WSP) and Wireless Transaction
Protocol (WTP). Additionally, jWAP contains a WAP Binary XML (WBXML)
Parser/Generator. It requires Java >= 1.2.
OpenSource GPS is software for x86 PCs that allows you to acquire, track and demodulate signals from GPS satellites. OSGPS requires a Zarlink GP2021 12 channel GPS correlator chip
After the successful global introduction during the past decade of the second generation (2G) digital
mobile communications systems, it seems that the third generation (3G) Universal Mobile Communication
System (UMTS) has finally taken off, at least in some regions. The plethora of new services that
are expected to be offered by this system requires the development of new paradigms in the way scarce
radio resources should be managed. The Quality of Service (QoS) concept, which introduces in a natural
way the service differentiation and the possibility of adapting the resource consumption to the specific
service requirements, will open the door for the provision of advanced wireless services to the mass
market.
The combinatorial core of the OVSF code assignment problem
that arises in UMTS is to assign some nodes of a complete binary
tree of height h (the code tree) to n simultaneous connections, such that
no two assigned nodes (codes) are on the same root-to-leaf path. Each
connection requires a code on a specified level. The code can change over
time as long as it is still on the same level. We consider the one-step code
assignment problem: Given an assignment, move the minimum number of
codes to serve a new request. Minn and Siu proposed the so-called DCAalgorithm
to solve the problem optimally. We show that DCA does not
always return an optimal solution, and that the problem is NP-hard.
We give an exact nO(h)-time algorithm, and a polynomial time greedy
algorithm that achieves approximation ratio Θ(h). Finally, we consider
the online code assignment problem for which we derive several results
The scope of this SCM simulator is to provide an easy-to-use, GUI supported, MATLAB developed application to any user who requires a practical tool to perform MIMO simulations and to obtain statistical data.
The existence of numerous imaging modalities makes it possible to present different data present in different modalities together thus forming multimodal images. Component images forming multimodal images should be aligned, or registered so that all the data, coming from the different modalities, are displayed in proper locations. The term image registration is most commonly used to denote the process of alignment of images , that is of transforming them to the common coordinate system. This is done by optimizing a similarity measure between the two images. A widely used measure is Mutual Information (MI). This method requires estimating joint histogram of the two images. Experiments are presented that demonstrate the approach. The technique is intensity-based rather than feature-based. As a comparative assessment the performance based on normalized mutual information and cross correlation as metric have also been presented.
-The existence of numerous imaging modalities makes it possible to present different data present in different modalities together thus forming multimodal images. Component images forming multimodal images should be aligned, or registered so that all the data, coming from the different modalities, are displayed in proper locations. Mutual Information is the similarity measure used in this case for optimizing the two images. This method requires estimating joint histogram of the two images. The fusion of images is the process of combining two or more images into a single image retaining important features from each. The Discrete Wavelet Transform (DWT) has become an attractive tool for fusing multimodal images. In this work it has been used to segment the features of the input images to produce a region map. Features of each region are calculated and a region based approach is used to fuse the images in the wavelet domain.
Face Recognition Library
========================
Advanced face recognition DLL using two functions : Train and Recognize. Uses neural net back propogation alogorithm with more AI tools added for imaging optimization. Library works great even for a low resolution web cam image and requires the user to align to a mirror frame on screen. Complete Source Code with Video capture and feature extraction kit for Registered Users.
Please register here for only $299 with Source Code :
http://www.research-lab.com/facerecognitionorder.htm
(c) www.research-lab.com
The code performs a number (ITERS) of iterations of the
Bailey s 6-step FFT algorithm (following the ideas in the
CMU Task parallel suite).
1.- Generates an input signal vector (dgen) with size
n=n1xn2 stored in row major order
In this code the size of the input signal
is NN=NxN (n=NN, n1=n2=N)
2.- Transpose (tpose) A to have it stored in column
major order
3.- Perform independent FFTs on the rows (cffts)
4.- Scale each element of the resulting array by a
factor of w[n]**(p*q)
5.- Transpose (tpose) to prepair it for the next step
6.- Perform independent FFTs on the rows (cffts)
7.- Transpose the resulting matrix
The code requires nested Parallelism.
Enter the Matrix MS-DOS screensaver.
Sample of using bios functions (by int 10h) for text data output (monitor in the text mode) and keyboard input. requires: Borland C++ 3.1 for DOS.
