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.
In this paper design of multiplier-less nonuniform filterbank transmultiplexer (ML NUFB TMUX) is presented. Nonuniform filter bank transmultiplexer (NUFB TMUX) is preferred when applications with different data rates are to be multiplexed. If filter coefficients can be represented in canonic signed digit (CSD) format with minimum number of signed power of two (SPT) terms, hardware complexity can be...
To deploy highly efficient video coding technologies on different hardware platform, complexity adjustable algorithms are required. One of the significant resource consumers is motion estimation (ME). This paper proposes a complexity adjustable algorithm for ME to remedy this issue. First, we build a mathematic model to indicate that macroblocks (MBs) with intensive motion are worthier of finer searching...
OGC (open geospatial consortium) has developed the implementation specifications especially WMS (Web map service) and WFS (Web feature service) which facilitate GIS data dissemination including the map image distribution for visualization and online GIS data exchange. WPS (Web processing service) is also one of the OGC specifications for processing service which allow GIS functions available on the...
In this paper we introduce a Java library for developing and testing genetic algorithms. The software architecture is aimed at addressing common issues regarding system memory and garbage collection in Java programming. In order to validate our solution, a comparison with other frameworks is provided.
The travelling salesman problem (TSP) is one of the extensively studied optimization problem. The numerous direct applications of the TSP bring life to the research area and help to direct future work. To solve this problem many techniques have been developed. Genetic algorithm is one among those which solves this problem by using the processes observed in natural evolution to solve various optimizations...
This paper presents an imitation mechanism and a study of its behavior in spatial grid-based configurations. The imitation mechanism replicates external signals without associating with objects, as in higher-level imitation; it is therefore a model of proto-imitation where agents imitate unconditionally the agents they happen to interact with. We study the mechanism in 2D space to understand how it...
Association rule mining based on support and confidence generates a large number of rules. However, post analysis is required to obtain interesting rules as many of the generated rules are useless. We pose mining association rules as multi-objective optimization problem where objective functions are rule interestingness measures and use NSGA-II, a well known multi-objective evolutionary algorithm...
In this study we discuss a method for evolution of quasigroups with desired properties based on genetic algorithms. Quasigroups are a well-known combinatorial design equivalent to the more familiar Latin squares. One of their most important properties is that all possible elements of certain quasigroup occur with equal probability. The quasigroups are evolved within a framework of a simple hash function...
Differential evolution (DE) algorithm is a heuristic approach that gains more interest in today's research. It finds the true global minimum regardless of the initial parameter values, fast convergence, and using few control parameters. DE algorithm is a population based algorithm like genetic algorithm using similar operators; crossover, mutation and selection. This paper addresses the restrictive...
Underwater wireless sensor networks (UWSNs) are prone to message loss due to their poor link condition with high bit error rate (BER). Retransmission-based mechanisms such as ARQ can be used for the reliability, however, they are not suitable for UWSNs due to the inherent long propagation delay of UWSNs. Therefore, a forward error correction (FEC) mechanism might be an alternative in order to guarantee...
In asynchronous wireless relay networks, the spacetime codes (STC) applied should be delay-tolerant. Although several delay-tolerant STC have been presented, they are limited by high decoding complexity, low rate and/or low diversity gain. To overcome these limitations, a new class of delay-tolerant STC, called shift group-decodable space-time block codes (STBC), with code rate 1 for arbitrary transmit...
Being one of the most important breakthroughs in communication fields, network coding (NC) allows the nodes in the network to code the incoming data as well as transmitting, which enhances the efficiency of network greatly. Especially, for data based wireless sensor networks (WSN) with huge information exchange operations, NC can improve the broadcast efficiency by combining different incoming data...
A Bit-Error-Rate (BER) performance evaluation is presented for mu-Law companded QPSK modulated Mobile WiMax (IEEE802.16e) employing tail-biting convolutional coding (TBCC). The Down Link (DL) Partially Used Subcarrier (PUSC) deployment has been considered for this investigation. Equalized symbol power transmissions for uncompanded and mu-Law companded WiMax scenarios employing mu = 0.1, 1, 3, 10,...
In today's world of globalization, local language storage and retrieval is essential for the developing nations like India. As our country is diversified by languages and only 10% of population is aware of English language, this diversity of languages is becoming barrier to understand and acquainted in digital world. It has been found that when services are provided in local languages, it has been...
Peptide computing is a novel way of computing that uses the interaction between peptides and antibodies as a computational model. Since several copies of peptides and antibodies can interact at the same time, this computing model is massively parallel and highly non-deterministic in nature. Due to these advantages this computational model helps us to solve some of the very hard combinatorial problems...
Hyper-heuristics are increasingly used in function and combinatorial optimization. Rather than attempt to solve a problem using a fixed heuristic, a hyper-heuristic approach attempts to find a combination of heuristics that solve a problem (and in turn may be directly suitable for a class of problem instances). Hyper-heuristics have been little explored in data mining. Here we apply a hyper-heuristic...
Single Row Facility Layout Problem (SRFLP) consists of arranging a number of rectangular facilities with varying length on one side of a straight line to minimize the weighted sum of the distance between all facility pairs. In this paper we use a Particle Swarm Optimization (PSO) algorithm to solve the SRFLP. We first employ a new coding and decoding technique to efficiently map discrete feasible...
The projective geometry (PG) based low density parity check (LDPC) codes are gaining popularity due to their ease of encoding and decoding by the simple majority logic technique. These codes have a flurry of other useful properties, making them ideal candidates/codes for error correction for future wireless applications. This paper brings out a detailed study on the performance of PG codes for different...
A fast mode decision algorithm is proposed to solve the computation complexity for enhancement hierarchical-B pictures with adaptive inter-layer prediction in H.264/AVC scalable extension, scalable video coding. This method exploits the evaluated modes of the co-located reference macroblocks, which include the best and other abandoned modes, to compose a new candidate group for the current macroblock...
The following topics are dealt with: neural networks; equalisation; mobile and cellular communications; optical communications; data security; human factors in communications; coding and modulation; optical networks; database and optimisation; time-frequency analysis; computer vision and recognition; audio and speech processing; wireless networks; watermarking; digital filters; network coding and...
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.