The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Large array size real time direction finding systems like phased array radars require very fast processing of signals. With subspace based array signal processing like MUltipleSIgnalClassification (MUSIC) algorithm high accuracy and resolution can be achieved if the data collection time is sufficiently large or the Signal to Noise Ratio (SNR) is adequately high. However high computational complexity...
Recently, ESPRIT-based parameter estimation algorithms have been developed to exploit the structure of signals from strictly second-order (SO) non-circular (NC) sources. They achieve a higher estimation accuracy and can resolve up to twice as many sources. However, these NC methods assume that all the received signals are strictly non-circular. In this paper, we present the C-NC Standard ESPRIT and...
In this paper, a 10b SAR ADC is designed for low power and low speed application. A two-mode comparator is applied on a generalized non-binary algorithm for better power efficiency. The comparator works in the low accuracy mode during the first few steps, and works in the high accuracy mode for the last few steps. Compared to a conventional SAR ADC, which has a high-accuracy comparator to complete...
The host cardinality refers to the number of different peers that an Internet host communicates with. Stealthy superpoint is a host that its cardinality is between two thresholds during a measurement period. Detecting stealthy superpoints helps intrusion systems identify potential attackers. However, stealthy superpoints may perform scanning deliberately at a low rate, and they can easily evade the...
Shape context is a classic shape retrieval method with translation invariance, but it has not scalar or rotational invariance, which limits its application. A new shape feature descriptor-centroid distance ratio (CdR) is proposed and an improved shape retrieval algorithm based on CdR and shape context is brought forth. First, the contour points are sampled in order to reduce computation and then,...
In this paper, one hybridized method, in which the periodic equivalence principle algorithm is combined with the equivalence principle algorithm, is proposed to solve the finite antenna array with large scale. This method based on the domain decomposition method is more efficient than full-wave methods and more accurate than asymptotical methods with periodic Green's function. Moreover, this approach...
Distribution of data stream is always changed in the real world. This problem is usually defined as concept drift [1]. The state-of-the-art decision tree classification method CVFDT[2] can solve the concept drift problem well, but the efficiency is debased because of its general method of handling instances in CVFDT without considering the types of concept drift. In this paper, an algorithm called...
Microarray image gridding is one important step of microarray image analysis to determine 2D image coordinates of all array spots in the hybridized gene chip image. Accuracy of microarray image gridding will affect the reliability of gene-chip data extraction and even the final analysis results of gene-chip assays. However, in recent years, many new microarray image gridding methods presented have...
This paper presents a design methodology forhardware synthesis of application-specific logic-in-memory(LiM) blocks. Logic-in-memory designs tightly integrate specializedcomputation logic with embedded memory, enablingmore localized computation, thus save energy consumption. Asa demonstration, we present an end-to-end design frameworkto automatically synthesize an interpolation based logic-in-memoryblock...
A significant number of elders live with memory impairment issues, as a result of the normal aging process. Therefore various kinds of supporting systems have been developed to help the elders, who have mild memory problems. In this paper we propose a Smart Reminder System for reminding forgotten complex activities, in home environment. Subjected complex activities are the activities, which should...
Personalization of search engines is to achieve retrieval for different users with different interests. In this paper, we propose a personalized search engine based on Bloom filter. Bloom filter, an effective space data structure, is used in the research of personalized search. The user interest model based on Bloom filter contains one standard Bloom filter and multiple Counting Bloom filters, and...
The license plate location plays an important role in the License Plate Recognition (LPR). According to the vertical projection and the morphological operations, this paper proposes a kind of locating method based on binary image in order to obtain accurate location of vehicle plate quickly under complex background. First, this method carries out preprocessing such as the color image grays processing,...
The equivalence principle algorithm (EPA) is a kind of domain decomposition scheme for the electromagnetic scattering and radiation problems based on integral equation (IE). This method is suited for solving multi-scale problems and array structures with same elements. However, the original EPA can lead to a loss of accuracy in some cases. Compared with the EPA, Tangential EPA (T-EPA) has the better...
The problem of the low efficiency of the existing spatial interpolation algorithm for hydro meteorological information is discussed and two fast interpolation algorithms based on the conventional Thiessen polygon method was proposed in this paper: improved Thiessen polygon method and self-adaptive Thiessen polygon method. Studies of the Luan River Basin had shown that the self-adaptive Thiessen polygon...
Distributed Hierarchical Graph Neuron (DHGN) is a single-cycle learning distributed pattern recognition algorithm, which reduces the computational complexity of existing pattern recognition algorithms by distributing the recognition process into smaller clusters. This paper investigates an effect of dividing and distributing simple pattern recognition processes within a computational network. Our...
Since wireless communications began to take an abrupt rise, with the development of techniques which were introduced for the growth of data transfer, antenna systems were considered to be the ideal choice to obtain the wanted results. Nevertheless these techniques required the development of certain algorithms also, to facilitate the recognition of the signals at the reception side (direction of arrival...
Range reduction is widely used in the element function library and high performance computing applications. A new rang reduction algorithm and an improved one based on the Payne and Hanek Algorithm are proposed. Using the 64-bit integer arithmetic unit, all the intermediate computation is optimized for its Parallelism, table size and throughput, and the improved one base on it debases the complexity,...
The last decade has witnessed a great interest in using evolutionary algorithms, such as genetic algorithms, evolutionary strategies and particle swarm optimization (PSO), for multivariate optimization. This paper presents a hybrid algorithm for searching a complex domain space, by combining the PSO and orthogonal design. In the standard PSO, each particle focuses only on the error propagated back...
In this work, the results of the comparative analysis of possibilities piecewise-polynomial local bases on three parameters are shown: by quantity of indispensable operations, by efficiency of compression of the information and by error.
One shortcoming of ant colony optimization is that it can not be applied on continuous optimization problems directly. In this paper we propose a new approach for solving continuous optimization problems using ant colony algorithm. While the method maintains the framework of the classical ant colony algorithm, it replaces the discrete frequency in the ant selecting probability by a continuous probability...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.