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.
Continuous optimization is one of the most active research lines in evolutionary and metaheuristic algorithms. Since CEC 2005 and CEC 2008 competitions, many different algorithms have been proposed to solve continuous problems. Despite there exist very good algorithms reporting high quality results for a given dimension, the scalability of the search methods is still an open issue. Finding an algorithm...
In this paper a scalability test over eleven scalable benchmark functions, provided by the current workshop (Evolutionary Algorithms and other Metaheuristics for Continuous Optimization Problems-A Scalability Test), are conducted for accelerated DE using generalized opposition-based learning (GODE). The average error of the best individual in the population has been reported for dimensions 50, 100,...
The method of type functional application is employed attempting to resolve Chinese overlapping ambiguity in the area of Chinese word segmentation. Instead of traditional methods which treat Chinese overlapping ambiguity as classification problems, the proposed approach regards this task as a sentence type calculus problem. The method is based on type theory and the benefit of this method is that...
Key management in sensor networks is the core security protocols for wireless sensor networks (WSNs) in the hostile environment. Sensor nodes have highly constrained resource like limited battery power, memory, processing capabilities, etc. These limitations make infeasible to apply traditional key management techniques such as public key cryptography in the WSNs. For the existing key pre-distribution...
In this paper, we propose a novel spectrum sensing technique, called as multi-slot spectrum sensing, to detect spectral holes and to opportunistically use under-utilized frequency bands without causing harmful interference to legacy (primary) networks. The key idea of the proposed sensing scheme is to combine the observations from the past N (N ?? 2) sensing blocks including the latest one. Specifically,...
Semi-supervised learning aims to utilize unlabeled data in the process of supervised learning. In particular, combining semi-supervised learning with dimension reduction can reduce overfitting caused by small sample size in high dimensional data. By graph representation with similarity edge weights among data samples including both labeled and unlabeled data, statistical and geometric-structures in...
This paper extends the framework of power indices and proposes a notion of coalition power indices to evaluate influence of each coalition in simple games. A coalition power index is defined as a map that assigns a real number to each pair of a simple game and a coalition in the game. The blockability index is then defined as an example of coalition power indices based on the blockability relations...
Relative position of object description are widely used in event understanding and computer vision tasks especially in object recognition. Use of low level features cannot give satisfactory results when high level concepts is not easily expressible in low level contents. Mostly researchers are concentrating on spatio- temporal relationship between objects or regions of an object in images. Object...
In this paper, we systematically construct a new class of quadriphase even-shift orthogonal sequences (or E-sequences) from Golay complementary codes using sequence interleaving. Besides having even-shift-orthogonal properties, the proposed E-sequences have zero real aperiodic correlation functions for all shifts, so it is also a special class of imaginary sequences (IS). Due to its ideal real aperiodic...
Based on the present theories of operators, this paper give a new result on the weakening buffer operator. f is a monotonously increasing function, g is its inverse function. If d is a weakening buffer operator, and x(k)d is made of x(k),..., x(n), k = 1, 2, ... n. If we substitute x(k) by f(x(k)), k=1, ..., n. The new result is m = [f(x(k))]d. If g(m) = e, then e is also a weakening buffer operator.
This paper describes a study conducted at the University of Nottingham, whose goal was to assess whether the students registered on the first-year module ??Mathematics for Computer Scientists?? appreciate the calculational method. The study consisted of two parts: ??Proof Reading?? and ??Problem Solving??. The goal of ??Proof Reading?? was to determine what the students think of calculational proofs,...
Weiser's original papers on slicing defined the concept in an informal way. Since then there have been several attempts to formalise slicing using various formal methods and semantics of programs. In this paper we start by defining some properties that a definition of slicing might reasonably be expected to satisfy and then compare different definitions of slicing to see which properties are satisfied...
Vertical handover is a new trend for heterogeneous next generation networks, in order to assure ubiquitous and seamless connectivity to mobile users. This paper presents a novel vertical handover algorithm based on a probabilistic approach for decision strategy. The proposed technique deals with the assessment of a Wrong Decision Probability (WDP), which assures a trade-off between network performance...
In this paper, we propose a new method for text summarization. The system finds topic word and event word firstly, and then recalculates word weight. Using recalculated word weight to compute similarly of paragraphs to search local topics units. The most representative sentences in each local topic unit are selected as the summary sentences. By analyzing semantic structure of the documents first,...
Recently, sub-root pairs and sequences are introduced to identify Davis-Jedwab (DJ) codes, non-Davis-Jedwab (non-DJ) Golay complementary sequences (GCS) and non-Golay complementary sequences (non-GCS) for OFDM with low PMEPR. In this paper, we extend sub-root pairs to super-root pairs. A discrete version of super-root pairs called multi-dimensional root pairs are used to build arbitrarily interleaving...
In unattended wireless sensor networks, data are stored locally and retrieved on demand. To efficiently transmit the collectorpsilas retrieval results, data are aggregated along being forwarded. The data confidentiality and integrity should be protected at the intermediate nodes. End-to-end encryption or hop-by-hop encryption based schemes are not efficient. Straightforward homomorphic encryption...
In this work, a new empirical mode decomposition (EMD) is introduced. It does not use extrema envelopes nor sifting procedure but the decomposition is only based on a direct calculation of its components from inflexion points. Our technique has many advantages: firstly, in contrast to the classical EMD, we give an analytical formula for the decomposition. Finally, a simulation study shows its efficiency.
The non-coherent time-of-arrival (TOA) estimations are applied in impulse location for its simplicity. However, the multipath propagation of the narrow pulse results in complicated performance analysis. By fitting the output envelope of energy detection into a exponential decay, we approximately deduce the closed-form Cramer-Rao low bound (CRLB) of TOA estimation. Simulations with non-coherent TOA...
Cognitive learning factor is an important parameter in particle swarm optimization algorithm(PSO). Although many selection strategies have been proposed, there is still much work need to do. Inspired by the black stork foraging process, this paper designs a new cognitive selection strategy, in which the whole swarm is divided into adult and infant particle, and each kind particle has its special choice...
The typical algorithm of text clustering is a ldquoHard Partitionrdquo one, Actually, Chinese text is better to treat with ldquoSoft Partitionrdquo for its diversity and largeness. The fuzzy-set theory supply a powerful analyzing tool to this ldquoSoft partitionrdquo. Traditional fuzzy text clustering methods mostly are getting the fuzzy equivalent matrix or fuzzy division by iterating the matrix...
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.