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.
Based on the analysis of the existing utility-based forwarding mechanisms, for the inefficient forwarding of history encounter time based forwarding mechanism in the initial phase of the node movement, a Random and Encounter Time Based algorithm named RET is proposed in this paper. RET divides the nodes moving into two phases-random forwarding phase (initial phase) and utility-based forwarding phase...
This paper investigates the consensus problem of the multi-agent system. A new method is used to solve the problem, which is Laplace transform. According to the Laplace transform, the accurate solution of the system can be solved, and the state of the consensus center can be found. It is proved that the agents of the system will aggregate and form a cohesive cluster around the consensus center in...
Selection of a suitable and apposite web service for a particular goal oriented job has become a difficult challenge due to the increasing and huge number of web services offering similar functionalities. When dynamic discovery is used in Web Services to select a specific service in optimal way, it is familiar that the outcome of the discovery contains more and supplementary than one provider. From...
This paper provides a symbolic dynamics perspective to Chua's topologically-distinct complex Bernoulli-shift rules 18, 122, 126 and 146. Through this work, a rigorous analysis of their global attractors is conducted in the space of bi-infinite symbolic sequences. Based on the concepts of blocking transformation and releasing transformation, their chaotic dynamics is further uncovered, including topological...
In this paper we discuss the complex carry system after the extension of the real carry system. We focus on the relationship between the decimal set of the complex carry system and fractal and its general speculation.
This paper considers a group of mobile agents moving in Euclidean space with switched network topology. We propose a feedback control algorithm that achieves velocity consensus with weighted directed switched velocity graph and stabilize all position neighboring agents inter-distance to a same desired value. The main results are that the position and velocity graph remaining connected are satisfied...
In this paper we investigate the generalized Mandelbrot sets and Julia sets generated from non-analytic complex maps. We use the escaping time algorithm to construct the generalized Mandelbrot set and Julia sets. We find that the structures of the generalized Mandelbrot sets and the Julia sets are similar to the analytic complex iterated function systems.
In this paper, we consider a complex dynamical network with time-varying delays. We prove that the dynamical complex network is synchronized if the delays satisfy the linear matrix inequality. In addition, we analyze the synchronization of the given network based on the coupling configuration matrix and the delays of the synchronous target. Some simulations illustrate our theoretical results.
Using symbolic algorithms for small signal circuit parameter extraction could make possible implementing extraction programs which, unlike those based on pure numerical methods, no longer require initial (“start”) values for the parameters being extracted, thus ensuring that the final result corresponds to the true global minimum of the error function. Solving the extraction problem, in the particular...
When simulating mixed-signal systems, designers are often dissatisfied either with performance or accuracy. A state-space based precomputation method for analog circuits at electrical level allows for a considerably faster simulation than with SPICE-like simulators. Utilizing an automatically generated SystemC interface, our simulation kernel analyzes mixed analog/digital circuits where the digital...
We propose an image stitching method which can compose the images with similar overlapped regions seamlessly. Traditional minimal error boundary (MEB) based method can't produce correct stitching result when the input images exist photometric inconsistency. To cope with the problem, we adopt the weighted sum of gradient and curvature as the robust feature, which represent the primary content of the...
This paper utilized the arrangement points of AES_256 key, analyzed the difference features of AES_256, and found a method of collision attack. This paper also made use of connection differential features and collision method of AES_256 to analyze the 72 bytes of the initial key of AES_256, with a complexity of 2.
This brief proposes a novel multi-objective heuristic. It is a transformation of a mono-objective heuristic into a multi-objective one by addition of an archive and some non dominance computing routines. Performances of the proposed heuristic are demonstrated thru test functions. An application to the optimal sizing of a class AB second generation CMOS current conveyor is presented. Comparison with...
This article describes logical analysis infrastructure of associative tables (matrices), which enables to perform processing the interaction of the input vector with n-dimensional algebra-logical space, specified by using the ordered and structured tables of problem-oriented data, which represent the associative behavioral models of logical objects. To estimate the interaction of vectors in algebra-logical...
In this paper we present analytical and numerical results concerning the inhibition of chaos in DufŒng-van der Pol system with Œth nonlinear-restoring force and two external forcing terms. We theoretically give parameter-space regions interval of initial phase difference on the basis of Melnikov methods proposed in, where homoclinic chaos can be suppressed. Numerical simulation results show the consistence...
Depth Image Based Rendering (DIBR) technique has been recognized as a promising tool for supporting advanced 3D video services required in MultiView Video (MVV) systems. However, an inherent problem with DIBR is to fill newly exposed areas (holes) caused by disocclusions. This paper addresses the disocclusion problem. To deal with small disocclusions, hole-filling strategies have been designed by...
We propose a new image projection method in an attempt to reduce the perceptual distortion in panoramic image mosaics. Specifically, we reduce the stretching distortion of some image patches and bending of straight lines. Since the stretching distortion usually occurs when projecting a viewing sphere to the cylindrical image surface in an oblique direction, we propose to use an adjustable cylindrical...
An N-gram modeling approach for unstructured audio signals is introduced with applications to audio information retrieval. The proposed N-gram approach aims to capture local dynamic information in acoustic words within the acoustic topic model framework which assumes an audio signal consists of latent acoustic topics and each topic can be interpreted as a distribution over acoustic words. Experimental...
A new technique developed at ESPCI ParisTech should allow cellular received signal strength fingerprints to play an important role in localization systems for regions that are not well covered by GPS. The article describes the ARPEGEO project, initiated to evaluate the impact of full-band GSM fingerprints analyzed with modern machine learning techniques. Results on indoor localization, as well as...
P2P SIP (peer to peer session initiation protocol) systems have emerged as a new trend in multimedia realm due to their abilities to overcome the shortcomings of conventional SIP systems. Most of P2P SIP systems were implemented using Chord, a Distributed Hash Table (DHT) based routing algorithm which can provide scalability and reliability. Previous studies on P2P SIP systems did not address node...
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.