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.
Conditional replenishment algorithm (CRA) was proposed to improve the quality of a hybrid 3DTV system with mixed resolution. Since CRA generates additional information which includes inter-view vectors, it is needed to efficiently encode the information. This paper proposes a method to apply differential pulse code modulation (DPCM) to the inter-view vectors so as to improve the coding efficiency...
Relations which allow to estimate the influence of vector measuring errors on algorithm TRIAD accuracy of orientation determination are suggested. Connection between the algebraic and geometrical methods of errors analysis is received.
An acoustic echo canceler (AEC) is often employed to remove the acoustic echoes generated in hands-free communication systems. The AEC cancels the acoustic echoes by approximating the echo-path with the use of an adaptive filter and subtracting the pseudo echoes generated by the filter from the observed signal. The conventional adaptive algorithm for updating the filter, however, fails in estimation...
Community detection and influence analysis are significant notions in social networks. We exploit the implicit knowledge of influence-based connectivity and proximity encoded in the network topology, and propose a novel algorithm for both community detection and influence ranking. Using a new influence cascade model, the algorithm generates an influence vector for each node, which captures in detail...
Community detection is one of the most important problems in social network analysis in the context of the structure of the underlying graphs. Many researchers have proposed their own methods for discovering dense regions in social networks. Such methods are only designed with links of the underlying social network. However, with the development of recent applications, rich edge content can be available...
The Knapsack Problems (KPs) is a well-known combinatorial optimization problem. It has a variety of practical applications. We propose the algorithm to solve both 0–1 Knapsack problem (KP) and Multidimensional Knapsack Problem (MKP) by fusing the Binary Particle Swarm Optimization (BPSO) and Simulated Annealing (SA) with maximum profit objective. The main contribution is to develop a novel approach...
The present contribution deals with the statistical tool of Independent Component Analysis (ICA). The focus is on Fas-tICA, arguably the most popular algorithm in the domain of ICA. Despite its success, it is observed that FastICA occasionally yields outcomes that do not correspond to any solutions of ICA. These outcomes are called spurious solutions. In this work, we give a thorough and rigorous...
This contribution deals with the generalized symmetric FastICA algorithm in the domain of Independent Component Analysis (ICA). The generalized symmetric version of FastICA has the potential to achieve the optimal separation performance by allowing the usage of different nonlinearity functions in its parallel implementations of one-unit FastICA. In spite of this appealing property, a rigorous study...
Reversible logic; transforms logic signal in a way that allows the original input signals to be recovered from the produced outputs, has attracted great attention because of its application in diverse areas such as quantum computing, low power computing, nanotechnology, DNA computing, quantum dot cellular automata, optical computing. In this paper, we design low power binary comparators using reversible...
Continuous K-nearest skyline query (CKNSQ) is an important type of the spatio-temporal queries. Given a query time interval [ts, te] and a moving query object q, a CKNSQ is to retrieve the K-nearest skyline points of q at each time instant within [ts, te]. Different from the previous works, our work devotes to overcoming the past assumption that each object is static with certain dimensional values...
In text document clustering documents are represented as feature vectors where features can be either words or phrases. Documents can belong to different topics when categorized by humans; however it is noted that obtaining one to one mapping between the features and the topics is almost impossible since the same features can and will be used in documents in different topics. Such common features...
During the last decade, static analyzers of source code have improved greatly. Today, precise analyzers that propagate values for the program's variables, for instance with interval arithmetic, are used in the industry. The simultaneous propagation of sets of values, while computationally efficient, is a source of approximations, and ultimately of false positives. When the loss of precision is detrimental...
Concept drift, which refers to non stationary learning problems over time, has increasing importance in machine learning and data mining. Many concept drift applications require fast response, which means an algorithm must always be (re)trained with the latest available data. But the process of data labeling is usually expensive and/or time consuming when compared to acquisition of unlabeled data,...
With the development of the Internet, web service generates a large amount of log information, how to mine user preferred browsing paths from web log information is an important research area. Current researches mainly focus on the mining of user preferred browsing paths, however, they do not delve into the personalization of preferred paths and paths lack semantic information. To provide personalized...
A permutation of a sequence of events is a common construction in many testing environments. Covering all possible permutations has clearly an exponential behavior, so one can ask for partial (easier) requirement, to cover all possible orders: permutations induced on of a small cardinality subset of elements. In our paper we show better (both lower and upper) bounds on this event sequencing testing...
The underwater acoustic (UWA) communication has been regarded as one of the most challenging wireless communications due to the unique properties, such as limited bandwidth, extended multipath delay, medium inhomogeneities, rapid time-variation and large Doppler shifts. Cooperative relaying technique is a promising technique to provide high rate data transmission. However, literature on cooperative...
In the field of video coding, inter-frame prediction plays an important role in improving compression efficiency. This task is achieved by finding a predictor for each block such that the residual data can be close to zero as much as possible. For recent video coding standards, motion vectors are required for a decoder to locate the predictors during video reconstruction. Block matching algorithms...
There are two major problems that people usually have to face when they carry out optimal control designs in state space system or descriptor system. One is no state derivative considered in cost functional, the other is that some systems cannot easily design optimal control in either state space system or generalized system frameworks. To overcome the problems, a novel state derivative space system...
We study the steady-state performances of four convexly constrained mixture algorithms that adaptively combine outputs of two adaptive filters running in parallel to model an unknown system. We demonstrate that these algorithms are universal such that they achieve the performance of the best constituent filter in the steady-state if certain algorithmic parameters are chosen properly. We also demonstrate...
It is shown that the proposed lower bound by the authors in 2010 is greater than or equal to the BCH bound for any cyclic codes. Discussion of relationship between the proposed bound and the Hartmann-Zeng bound is also given. For these discussions three improved algorithms from the authors' algorithm are described.
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.