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.
This paper proposes an enhanced pattern discovery algorithm for data streams processing of sensor networks, in order to improve the performance of SPIRIT. The new algorithm adapts the optimized correction for tracking weights vectors, and the dynamic expanding in detecting the number of hidden variables. Simulation results show that compared to the original algorithm, the proposed algorithm can reduce...
The discrepancies among the spectral range of the component bands of MHSRRSI will result in remarkable differences of the response extent to detect edges of geographical features. Considering the unique property of each color space, an improved Canny operator has been proposed which is available to detect and extract vector or scalar edges from MHSRRSI in weighted color space ( such as RGB, linear...
Note that network coding allows immediate nodes to mix information from different data flows. On the basis of this observation, we prove that under suitable conditions, communicators can communicate with perfect secrecy over wiretap networks. Our method of secure communication over wiretap networks without keys is fundamentally distinct from cryptographic means. Furthermore, a linear network code...
The normalized least-mean-fourth (XE-NLMF) algorithm has a faster convergence rate and lower misalignment performance than the normalized least-mean-squares (NLMS) algorithm in sub-Gaussian noise environments. However, the XE-NLMF algorithm shows convergence performance degradation in highly correlated input signals. To overcome the problem, we propose an XE-NLMF algorithm with variable data-reusing...
In this article, we present a novel algorithm for measuring protein similarity based on their three dimensional structure (protein tertiary structure). The PROSIMA algorithm using suffix tress for discovering common parts of main-chains of all proteins appearing in current NCSB protein data bank (PDB). By identifying these common parts we build a vector model and next use classical information retrieval...
The paper provides a novel approach to emotion recognition from facial expression and voice of subjects. The subjects are asked to manifest their emotional exposure in both facial expression and voice, while uttering a given sentence. Facial features including mouth-opening, eye-opening, eyebrow-constriction, and voice features including, first three formants: F1, F2, and F3, and respective powers...
A method is proposed to annotate editorials and news articles for sentences that most accurately represent the opinion of the speaker towards the issue. The speaker's point of view or level of discernment of the issue is whittled out. A list of informative and related keywords is extracted from the document based on their frequency of occurrence. Subsequently, pronominal anaphora is resolved at the...
Information retrieval (IR) has been widely investigated these last decades and significant results have been applied to several domains like e-commerce, e-library and automatic medical diagnostics. However, very few studies in this area deal with artificial intelligence or AI tools. Knowing the power of meta-heuristics in problem solving, we suggest exploring information retrieval with an evolutionary...
This paper proposes an affine projection algorithm (APA) using the inner product between input vectors. The existing APAs have fast convergence rate but large steady-state estimation errors. In order to reduce the estimation errors, the proposed algorithm adjusts the number of the input vectors by grouping of the input vectors. The grouping process uses the angle between a current input vector and...
The paper provides a novel approach to emotion recognition from facial expression and voice of subjects. The subjects are asked to manifest their emotional exposure in both facial expression and voice, while uttering a given sentence. Facial features including mouth-opening, eye-opening, eyebrow-constriction, and voice features including, first three formants: F1, F2, and F3, and respective powers...
This paper presents a novel methodology to perform matching between image points described by their respective features. Traditionally, such correspondences are determined by computing the similarity between descriptor vectors associated to each point which are obtained by invariant descriptors. Our methodology first obtains a coarse global registration among images, which constrains the correspondence...
In this paper we propose a universal strategy for the automatic interpretation of sensor signals. We focus on acoustic signals. However, any time series may be used. We assume that changes in an object's state cause a typical and reproducible change in the characteristics of the acquired sensor signal. In such cases we can train pattern recognizers basing on Hidden-Markov-Models or support vector...
It is well known that there is a one-to-one correspondence between the entropy vector of a collection of n random variables and a certain group-characterizable vector obtained from a finite group and n of its subgroups. However, if one restricts attention to abelian groups then not all entropy vectors can be obtained. This is an explanation for the fact shown by Dougherty et al that linear network...
Erasure coding techniques are used to increase the reliability of distributed storage systems while minimizing storage overhead. Also of interest is minimization of the bandwidth required to repair the system following a node failure. In a recent paper, Wu et al. characterize the tradeoff between the repair bandwidth and the amount of data stored per node. They also prove the existence of regenerating...
We study network error correction with unequal link capacities. Previous results on network error correction assume unit link capacities. We consider network error correction codes that can correct arbitrary errors occurring on up to z links. We find the capacity of a network consisting of parallel links, and a generalized Singleton outer bound for any arbitrary network. We show by example that linear...
It has been conjectured that complex Gaussian interference channels with constant channel coefficients have only one degree-of-freedom (DoF) regardless of the number of users. While several examples are known of constant channels that achieve more than 1 DoF, these special cases only span a subset of measure zero. In other words, for almost all channel coefficient values, it is not known if more than...
The classification of quaternary [21s+t,3,d] codes with dges16s and without zero coordinates is reduced to the classification of quaternary [21c(3,s,t)+t,k,d] code for sges1 and 0lestles20, where c(3,s,t)les min{s, 3t} is a function of 3, s, and t. Quaternary optimal Hermitian self-orthogonal codes are characterized by systems of linear equations. Based on these two results, the complete classification...
In this paper, we propose an efficient method for resolving the optimal discriminant vectors of generalized discriminant analysis (GDA) and point out the drawback of high computational complexity in the traditional class-incremental GDA [W. Zheng, "Class-Incremental Generalized Discriminant Analysis", Neural Computation 18, 979-1006 (2006)]. Because there is no need to compute the mean of...
The properties of value vector and coefficient vector of symmetric Boolean functions with maximum algebraic immunity are studied by applying combinatory and Lucas formula. Basing on that, we proved the algebraic immunity of three classes (2m -2)-variable symmetric Boolean functions with mges3 is not maximum.
The classification of quaternary [21s+t,3,d] codes with dges16s and without zero coordinates is reduced to the classification of quaternary [21c(3,s,t)+t,k,d] code for sges1 and 0lestles20, where c(3,s,t)les min{s, 3t} is a function of 3, s, and t. Quaternary optimal Hermitian self-orthogonal codes are characterized by systems of linear equations. Based on these two results, the complete classification...
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.