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.
Graphs are a key form of Big Data. Although graph computing technology has been studied extensively in recent years, it remains a grand challenge to process large-scale graphs efficiently. Computation on a graph is to propagate and update the vertex values systematically. Both its complexity and parallelism are affected mainly by the algorithm's value propagating pattern. Efficient graph computing...
Multistage Interconnection Networks (MINs) remain interesting for research and are continuously being improved as they are essential devices for constructing scalable parallel computers or for connecting networks. In this paper a new idea - new architecture - is introduced. The proposed construction uses switch elements connected with redundancy internal paths and fan out at the end of the construction...
A novel and effective framework for the enhancement of low lighting images is proposed in this paper. The novel framework presents an optimized de-haze algorithm on inverted images to enhance the low-dynamic-range images which optimizes the complicated process of computing the parameters A and t(x). The improved gamma correction is used to enhance the image contrast for providing better visual performance...
This paper considers the problem of Base Station power minimization in downlink Orthogonal Frequency Division Multiple Access (OFDMA) systems. It aims at providing new solutions for the reduction of the total energy consumption. Such solutions rely on joint subcarrier and power allocation, under the constraints of requested per-user data rate. Practical results show that the proposed techniques allow...
In this paper, the verification issue for the predictability of decentralized discrete event systems (DESs) is investigated, in which the detection information may be decentralized among physically separated sites. After the predictability for decentralized DESs is formalized by the notion of copredictability, which describes the ability of the involved system that the failure events can be predicted...
A major advantage of wirelessly powered devices is the use of wire-free and sometimes battery-free nodes that can operate for extremely long times. However, to achieve infinite network lifetime a set of chargers is needed to periodically transmit energy to the nodes through the emission of RF signals. In this paper, we study the problem of finding the optimal number of chargers so that a group of...
The paper present new method for determination complexity of using in new hyper-hybrid AD HOC cloud computing. A large body of research has been devoted to identifying the complexity of structures in networks. The study of complex networks is a young and active area of scientific research inspired largely by the empirical study of real-world networks such as computer networks and social networks....
Devices running on Wireless Sensor Networks (WSNs) generally have limited energy resources, which makes it important to design energy-aware algorithms. Capacitated Minimum Spanning Tree (CMST) algorithms can be designed for finding energy-aware routing paths and for load-balancing among sub-trees connected to the sink device. Despite being studied extensively in central settings, there has not been...
Community detection is a substantial technique to find out the relationship between nodes in complex networks. By understanding the behavior of elements in a community, one can predict the overall feature of the large scale social network. Detecting different communities in large scale network is a challenging task due to huge data size associated with such network. The main purpose of this paper...
This paper presents a low-complexity approach for calculating soft decision metrics of polar coded quadrature amplitude modulation (QAM) system. A simple and general bit log likelihood ratio (LLR) expression is provided for Gray coded QAM signals. The characteristics of Gray code mapping such as symmetries and repeated formats of the bit assignment in a symbol among bit groups, are exploited effectively...
Evolutionary affinity propagation, an evolutionary clustering algorithm that groups data points by exchanging messages on a factor graph, is proposed. The algorithm promotes temporal smoothness of the clustering solutions at distinct temporal snapshots by linking variable nodes of the graph across time, and is capable of detecting cluster births and deaths. Unlike most existing evolutionary clustering...
At the current time, there are several fundamental changes in the way computing systems are being developed, deployed and used. They are becoming increasingly large, heterogeneous, uncertain, dynamic and decentralised. These complexities lead to behaviours during run time that are difficult to understand or predict. One vision for how to rise to this challenge is to endow computing systems with increased...
We consider a class of mixed integer programs where the problem is convex except for a vector of discrete variables. Two methods based on the Alternating Direction Method of Multipliers (ADMM) are presented. The first, which has appeared in the recent literature, duplicates the discrete variable, with one copy allowed to vary continuously. This results in a simple projection, or rounding, to determine...
A fingerprinting function for hash-based Winternitz one-time signature is proposed. A hash-based one-time signature is a light-weight and quantum-immune alternative to digital signature schemes that typically make use of number theoretic problems. The Winternitz scheme, which is one of the most promising hash-based one-time signatures, realizes the function of digital signatures by utilizing several...
Quantitative risk assessment is a critical first step in risk management and assured design of networked computer systems. It is challenging to evaluate the marginal probabilities of target states/conditions when using a probabilistic attack graph to represent all possible attack paths and the probabilistic cause-consequence relations among nodes. The brute force approach has the exponential complexity...
As a new trend of thought and style today, the application of parametric intelligent design gets many success in the design of building and product, for meeting the development requirement of human beings and social development tendency, proving the real exploration for objective world. Parametric intelligent design isn't merely temporary thing in limited area, it will be having impressed effects...
In the Modern computers for performing the operationof ALU (Arithmetic Logic Unit) like Addition, Subtraction, different types of adders are using for achieving low delay and fastoutput. QSD numbers are using for giving the carry-free additionso that ALU operations can perform in low delay and speed of themodern computer can increase. In the modern digital system fastadder, Subtraction can perform...
For arbitrary precision numbers, reciprocal computing algorithms based on Newton iteration is asymptotically the fastest. In this work we provide a refined algorithm based on the Newton reciprocal algorithm by Brent and Zimmermann in their MCA book. The key techniques used in the refinement are D1 balancing, clear specification, remainder operation, and economical multiplication. The refined algorithm...
In our previous work, well balanced pseudo random signed binary sequence generated by using trace function and Legendre symbol has been researched. Our previous sequence generated by applying primitive polynomial over odd characteristic field Fp, trace function and Legendre symbol. The important features such as period, periodic autocorrelation, and cross-correlation have already been well discussed...
Dynamic checking the integrity of software at run-time is always a hot and difficult spot for trusted computing. In this paper we present a lightweight approach, Control-flow checking using branch sequence signatures (CFCBS), to checking violation of control flow integrity at run-time. Our solution assigns a unique branch sequence signature, which enhances the capability of fault coverage, to each...
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.