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.
An indicator-based particle swarm optimization algorithm with local search (IBPSO-LS) is proposed. IBPSO-LS with O(nN2) computational complexity integrates preference information of the decision maker into multi-objective PSO, and the local search is used to approach the Pareto-optimal solutions quickly so as to yield a computationally efficient and convergent procedure. Meanwhile, a mutation operator...
In a proxy re-encryption (PRE) scheme, a semi-trusted proxy is given special information that allows it to transform cipher texts encrypted under Alice's public key into the different cipher texts that can be decrypted by Bob's secret key. In 2006, Green and Ateniese proposed identity-based proxy re-encryption schemes, in which cipher texts are transformed from one identity to another. Based on this,...
We present a global scheduling framework for synchronous data flow (SDF) streaming applications on MPSoCs, based on optimized computation and contention-free routing. The global scheduling of processors computing and communication transactions are formulated as constraint based problem, to avoid the scheduling overhead in TDMA-like heuristic schemes. A public domain constraint solver is exploited...
Confusion network (CN), a compact representation of lattice, has been arousing more and more attention in the area of speech recognition. In the paper, a novel lattice segmentation based CN generation method is proposed for remarkably reducing time complexity. Confidence based lattice segmentation algorithm is designed to cut lattices. The experimental results on a Chinese continuous speech database...
In this paper, a novel fast block-matching algorithm (BMA) for motion estimation is proposed, named fast block-matching motion estimation algorithm based on artificial immune system (AIS). This algorithm inspired from immunology can effectively overcome the inherent drawback of being liable to get trapped in local optima in traditional fast BMAs such as TSS and DS. In the meantime, we proposed an...
In this paper, a new subspace semi-blind adaptive multiuser detection based on a hybrid of Kalman filter and subspace estimation is proposed for MC-CDMA uplink. It is shown that the detector can be expressed as an anchored signal in the signal subspace and coefficients can be estimated by the Kalman filter. The spreading sequences of all known users are exploited to develop a new efficient semi-blind...
In this paper, a new semi-blind multiuser detection algorithm based on subspace constrained least mean-squared (LMS) is proposed for multicarrier code division multiple access (MC-CDMA) uplink system. This proposed detector makes use of the spreading sequences of all known users to impose multiple constraints on the minimum output energy (MOE) multiuser detection so that the interference within the...
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.