Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
Among the approaches used to analyze biomedical signals, e.g. electroencephalogram, there are methods based on fractal dimension (FD) calculation. One of the main drawbacks of these methods is the requirement for long duration of the analyzed signal. To analyze events of brief duration in real-time mode and to apply the results obtained directly in the time domain, thus providing an easier interpretation...
Optimization problems are ubiquitous and consequential. In fact every sphere of human activity that can be quantified can be formulated as an optimization problem. The focus of this work is on Global Optimization which is not only desirable but also necessary in many cases. In the past few decades several Global optimization algorithms have been suggested in literature out of which stochastic, population...
Nowadays, how to efficiently compose Web services has become a hotspot. In this paper, we introduce a method of recommending an optimal service sequence based on the original service sequence for a composite service. This method uses a Bayesian-based approach and selects the service sequence that has the largest probability as the best choice. Compared with existing methods, this method has two advantages:...
Evolutionary algorithms have been widely used to solve difficult constrained optimization problems. However, evolutionary algorithms are intrinsically unconstrained optimization techniques. Constraint handling is mostly incorporated additionally and its choice has great bearing on the quality of the solution. Stochastic ranking was introduced as an improvement over feasibility rules for handling constraints...
Limited lookahead control policies adapt the concept of supervisor synthesis in discrete-event systems (DES) to work for very large and/or dynamic systems. This is accomplished by considering an N-step projection of possible behaviours of the system, instead of dealing directly with the entire system. This paper builds on previous work to produce a limited lookahead algorithm that incorporates probabilistic...
We analyze the asymptotic variance of distributed consensus algorithms over large-scale switching random networks. Our analysis is focused on consensus algorithms over large, i.i.d., and directed Erdo??s-Re??nyi random graphs. We assume that every agent can communicate with any other agent with some fixed probability c/n, where c is the expected number of neighbors of each agent and n is the size...
We show that for a large class of scheduling algorithms, when the algorithm minimizes the drift of a Lyapunov function, the algorithm is optimal in maximizing the asymptotic decay-rate of the probability that the Lyapunov function value exceeds a large threshold. The result in this paper extends our prior results to the important and practically-useful case when the Lyapunov function is not linear...
In this paper, we consider modulation codes for practical multilevel flash memory storage systems with q cell levels. Instead of maximizing the lifetime of the device we maximize the average amount of information stored per cell-level, which is defined as storage efficiency. Using this framework, we show that the worst-case criterion and the average-case criterion are two extreme cases of our objective...
This paper presents the implementation of a tightly coupled hardware architectural enhancement to the Altera FPGA-based Nios II embedded processor. The goal is to accelerate Advanced Encryption Standard (AES) operations in 128, 192 and 256-bits, for application in a high-performance embedded system implementing symmetric key cryptography. The concept is to augment the embedded processor with a new...
The premise of the enterprise that implements the product family architecture is the analysis to the sailed products history data, carrying on accuracy demarcation of the customer sets and products sets. But, the traditional cluster methods consist in simultaneous one partitioning of the set of products or the set of customers. In this paper we review the most widely used and successful biclustering...
In the parameterized string matching, a given pattern P is said to match with a sub-string t of the text T, if there exist a bijection from the symbols of P to the symbols of t. This problem has an important application in software maintenance where it is required to find equivalency between two sections of codes. Two sections of codes are said to be equivalent if one can be transformed into the other...
Generally, link analysis is based re-ranking Web-page retrieval in current Web search engine. The primary reason lies in the difference of link structures and data scale between global Web and Web site. In this paper, we propose a framework to construct implicit link structure by using frequent sequence miner (FS-Miner) in the user Web log. And then, the page rank algorithm is applied to re-ranked...
Ontology mapping is a core task to achieve interoperability among the distributed and heterogeneous ontologies. The quality of ontology mapping is still not good due to the inconsideration of semantic information of the ontology. This paper proposes an ontology mapping method based on tree segmentation. It first divides the ontology into a set of sub-trees with different granularities according to...
One of the key challenging aspects of peer-to-peer systems has been efficient search for objects. To achieve this, we need to minimize the number of nodes that have to be searched, thereby use minimum number of messages during the search process. This can be done by selectively sending requests to nodes having higher probability of a hit for the queried object. In this paper we present an algorithm...
To improve the efficiency of the arc length (AL) algorithm, the paper presents a quantitative method to choose the parameters of AL. The paper analyzes the condition to guarantee the correctness of AL, and gives the approaches to set the parameters. Moreover, the latency of AL under the new method is discussed in detail. The analysis and simulation shows that the latency of AL with the parameters...
This paper proposes a new load balancing strategy based on a systematical research on current load balancing mechanism. The new strategy combines the methods of gossip propagation and replication policy, and adopts two different propagation policies to cope with light and heavy overloaded conditions so as to improve performance of networks. At the end of this paper, we prove the reliability and scalability...
This paper presents the design of an ultra high speed crypto-processor for next generation IT security. It addresses the next generation IT security requirements: the resistance against all attacks and high speed with low latency. The proposed processor is capable of generating cryptographically secured information at a rate of multi-ten Gbps. The performance of the processor is compared with that...
Testing and diagnosis techniques play a key role in the advance of semiconductor memory technologies. The challenge of failure detection has attracted investigation on efficient testing and diagnosis algorithm for better fault coverage and diagnostic resolution. March algorithms are widely used in SRAM testing to detect and diagnose SRAM fault model since they are relatively simple and yet providing...
Dynamic ALOHA-algorithm is an anti-collision algorithm highly concerned in RFID system. After we analyzed the existing ALOHA-algorithm, a new dynamic frame slotted ALOHA-algorithm was proposed, which can dynamically change frame length through the feedback of the last collision slot number in one inventory frame. The simulation indicates that this algorithm has nearly the same performance evaluation...
In this paper, we introduce new bounds on the system throughput and response time of closed, single-class BCMP queueing networks with load-dependent stations. Under the assumption that stations relative service rates are non-decreasing functions of their queue lengths, the bounds derive from the monotonicity of system throughput and queue-lengths and exploit the asymptotic equivalence that exists...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.