The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
We consider the problem of PSK-n signal reception over linear radio channel in the presence of strong intersymbol interference. Particularly we provide results of probability of error estimation within the problem. It's shown that probability of error depends on initial shift of signal constellation and recommendations for the initial shift are provided.
We present a direct comparison between the predicted and measured probability density functions (PDF) of the reaction progress variable and conditioned values of the scalar dissipation rates (SDR) in premixed turbulent flames. The predictions are based on simulations of premixed flames using the linear-eddy model (LEM), parameterised by a wide range of integral length scales and turbulent Reynolds...
In this paper, we propose a parameter-free image reconstruction algorithm that is based on the maximum a posteriori (MAP) estimation method and so called "integrate-out" approach for determining the prior distribution. The resulting objective function is minimized using the majorize-minimize optimization technique. The proposed algorithm avoids the computational burden associated with using...
In this paper, we use the maximum a posteriori (MAP) method to develop an algorithm that reconstructs subsurface images from GPR datasets. The prior probability density function we have chosen is novel and enforces sparsity. The negative of the objective function resulting from the MAP method is minimized using a majorize-minimize algorithm. An advantage of the proposed method over the popular L1-regularized...
The gateway queuing performance depends on the marking/dropping probability function chosen. This function plays an important role in managing the gateway buffer. It maps the current congestion level to marking/dropping probability that is applied to each arriving packet. Active queue management mechanisms drop arriving packets probabilistically before the gateway buffer gets full. Fast Congestion...
This paper proposes a novelty neural network model by using generalized kernel functions for the hidden layer of a feed forward network (Generalized Radial Basis Functions, GRBF), where the architecture, weights and node typology are learned through an evolutionary programming algorithm. This new kind of model is compared with the corresponding models with standard hidden nodes: Product Unit Neural...
In this paper, the conventional JPDAM (joint probabilistic data association for merged measurements) algorithm for modelling merged observations, is applied to the automotive environment. As every sensor has limited resolution, the JPDAM should be used instead of the JPDA algorithm, which does not model the effects of measurement merging. As the JPDAM algorithm is more complicated, these effect are...
Nowadays, Internet congestion is indicated by dropping packets when the routers buffers are full, or by dropping packets according to an AQM mechanism such as RED. Many mechanisms have been proposed to eliminate or minimize the effect of packet loss and tackle the consequential inefficiency due the retransmission of the dropped packets. Fast congestion notification (FN), that has been evaluated through...
The effectiveness of queue management mechanisms relies on how good their control decisions will help in satisfying their goals regarding congestion avoidance and control. These decisions are implemented and compelled during the design of the packet mark probability and the mark activation functions. The design of fast congestion notification (FN) drop/mark probability function enables the two control...
A probabilistic analytical framework for decentralized load balancing (LB) strategies for heterogeneous distributed-computing systems (DCSs) is presented with the overall goal of maximizing the service reliability in the presence of random failures. The service reliability of a DCS is defined as the probability of successfully serving a specified workload before all the computing nodes fail permanently...
High-order techniques have been proposed for obtaining high accuracy and rapid convergence in numerical solutions of integral equations for electromagnetics. Results obtained for structures with smooth surfaces exhibit relatively low errors, and the rate of decrease in the error improves with reduced cell sizes as either the basis function or the representation order increases. Recent publications...
This paper introduces the problem of determining through distributed consensus the fastest mixing Markov chain with a desired sparsity pattern. In contrast to the centralized optimization-based problem formulation, we develop a novel distributed relaxation by constructing a dynamical system over the cross product of an appropriately patterned set of stochastic matrices. In particular, we define a...
We extend the probabilistic key-based approach for wireless sensor networks concerning the slow rekeying and path key reestablishment processes. By introducing a novel, energy efficient, distributed, and faster scheme, we attempt to replace the existing ordinary rekeying method of probabilistic key management scheme through a deterministic algorithm that works on both the base station and on each...
Today's radio frequency regulation is undergoing fundamental changes. There is a high demand for radio frequency spectrum for data communication but no blank spots in the frequency assignments plan. Under the approach of coexistence and cognitive radio, spectrum is made available to systems if a license holder is not using it at a given geographic location or time. In this case multiple systems can...
We consider the planted (l, d) motif search problem, which consists of finding a substring of length l that occurs in a set of input sequences {s1, s2, hellip, sn} with maximum Hamming distance, d, around the similar substring. In this paper, we present an experimental comparison between voting algorithm and its modification for planted motif on simulated data from (9, d) to (15, d) in case of challenging...
In this paper, we present an alternative way for constructing a topological space in information systems. We use the theory of rough set and show that the topology is a quasi discrete-topology. We apply this topology to characterize the roughness property of a set involving dependency of attributes and apply the notions of base and sub-base to attribute reduction and rough membership function.
The purpose of this paper is devoted to revealing interconnection between rough sets and soft sets. We use the constructive and descriptive approaches of rough set theory and present a direct proof that Pawlakpsilas and Iwinskipsilas rough sets can be considered as soft sets.
We present a method of synthesizing ternary Galois field (GF(3)) based reversible/quantum logic circuits without any ancillary trits/qutrits and hence without any garbage outputs. We realize multi input ternary Toffoli gate and square functions of GF(3) variables using linear ion trap realizable Muthukrishnan-Stroud (M-S) gates and shift gates in the absence of ancillary qutrits. Then based on the...
We give a complete solution to the problem of finding the nth derivative and the nth anti-derivative, where n is a real number or a symbol, of elementary and special classes of functions. In general, the solutions are given through unified formulas in terms of the Fox H-function which in many cases can be simplified for less general functions. In this work, we consider the class of the power-logarithmic...
This paper proposes two different methods in order to improve the performance of traffic sign detection process. These methods are used for efficient and robust detection of red or blue colored, circular, octagonal, rectangular and triangular traffic signs. Proposed methods use both color and shape features of the traffic signs. Both of the methods gather the color and edge information of the image...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.