Statistical synchronization among participants in real-time multimedia conferencing

In this paper, an algorithm to determine the set of packets generated continuously and periodically from different participants that are arriving at a node either for mixing at the master of a conference, or for simply playing back at a regular participant of a conference, is proposed. The essence of the algorithm is to estimate the expected packet arrival time (or reference time) for each participant. With the reference time at hand, the maximum jitter and the optimum waiting time for a mixer to wait packets from all participants can be determined. An enhancement to improve synchronization which deals with the estimation of the time offsets between the individual periods of the sources and the period of the receiver is also presented. The error of the proposed algorithm is enumerated by the Chernoff bound and demonstrated by simulation and is shown to be acceptable in practical application. The algorithm can also be employed when traffic sources operate with different periods.     

Fast numerically stable computation of orthogonal Fourier?Mellin moments

An efficient algorithm for the computation of the orthogonal Fourier-Mellin moments (OFMMs) is presented. The proposed method computes the fractional parts of the orthogonal polynomials, which consist of fractional terms, recursively, by eliminating the number of factorial calculations. The recursive computation of the fractional terms makes the overall computation of the OFMMs a very fast procedure in comparison with the conventional direct method. Actually, the computational complexity of the proposed method is linear O(p) in multiplications, with p being the moment order, while the corresponding complexity of the direct method is O(p²). Moreover, this recursive algorithm has better numerical behaviour, as it arrives at an overflow situation much later than the original one and does not introduce any finite precision errors. These are the two major advantages of the algorithm introduced in the current work, establishing the computation of the OFMMs to a very high order as a quite easy and achievable task. Appropriate simulations on images of different sizes justify the superiority of the proposed algorithm over the conventional algorithm currently used     

Line balancing in a just-in-time production environment: balancing multiple U-lines

The introduction of multiple, independent production lines has helped many firms to increase their production flexibility, provide for redundancy when equipment breaks down, reduce idle time and labor costs, and achieve many other benefits. This paper introduces and formalizes the multiple U-line balancing problem. Optimal solution methodologies are provided for Type I (minimize the number of stations for a given cycle time), Type II (minimize the cycle time for a given number of stations), and cost-minimization line-balancing problems. A branch-and-bound algorithm is also developed for the situation in which equipment requirements are dependent on the line configuration and the task assignment to stations. Computational results indicate that the greatest benefit of exploiting multiple lines occurs for smaller cycle-time problems that require higher output.     

Efficient Management of Persistent Knowledge

Although computer speed has steadily increased and memory is getting cheaper, the need for storage managers to deal efficiently with applications that cannot be held into main memory is vital. Dealing with large quantities of clauses implies the use of persistent knowledge and thus, indexing methods are essential to access efficiently the subset of clauses relevant to answering a query. We introduce PerKMan, a storage manager that uses G-trees, and aims at efficient manipulation of large amounts of persistent knowledge. PerKMan may be connected to Prolog systems that offer an external C language interface. As well as the fact that the storage manager allows different arguments of a predicate to share a common index dimension in a novel manner, it indexes rules and facts in the same manner. PerKMan handles compound terms efficiently and its data structures adapt their shape to large dynamic volumes of clauses, no matter what the distribution. The storage manager achieves fast clause retrieval and reasonable use of disk space.     

Distance determination by the gamma-ray time-of-flight method

The time-of-flight method is studied using coincident annihilation gamma rays with an energy of 511 keV to find the distance from a surface at which they are scattered back for detection. The gamma rays have a good penetration ability, which makes the method suitable for industrial circumstances in which the range is rendered opaque to light by flue gas and aerosols. An accuracy of 1 cm over a distance of 2 m can be obtained by increasing the averaging time by the square of the lengthening factor. The density of the surface can be studied by recording the width of the distribution of the surface measurements. This measurement needs a prolonged averaging time, but the thickness of the slag layer on top of a steel melt can be measured with a maximum error of 1.5 cm at short distances, for example     

Time‐dependent heat transfer coefficient of a wall

A time‐dependent coefficient of heat transfer is proposed for the computation of thermal power required, so that a room temperature reaches a desired value within a given time. A mathematical formulation of the room heating transient phenomenon is constructed in a dimensionless form. Using an integral approximate solution an analytical expression for this coefficient is provided and it is verified by diagrams adopted by DIN 4701. Copyright © 2003 John Wiley & Sons, Ltd.     

Enhancing cognitive radio systems with robust reasoning

Cognitive radio systems dynamically reconfigure the algorithms and parameters they use, in order to adapt to the changing environment conditions. However, reaching proper reconfiguration decisions presupposes a way of knowing, with high enough assurance, the capabilities of the alternate configurations, especially in terms of achievable transmission capacity and coverage. The present paper addresses this problem, firstly, by specifying a complete process for extracting estimations of the capabilities of candidate configurations, in terms of transmission capacity and coverage, and, secondly, by enhancing these estimations with the employment of a machine learning technique. The technique is based on the use of Bayesian Networks, in conjunction with an effective learning and adaptation strategy, and aims at extracting and exploiting knowledge and experience, in order to reach robust (i.e. stable and reliable) estimations of the configurations' capabilities. Comprehensive results of the proposed method are presented, in order to validate its functionality. Copyright © 2007 John Wiley & Sons, Ltd.     

An optimal algorithm for the boundary of a cell in a union of rays

In this paper we study a cell of the subdivision induced by a union ofn half-lines (or rays) in the plane. We present two results. The first one is a novel proof of theO(n) bound on the number of edges of the boundary of such a cell, which is essentially of methodological interest. The second is an algorithm for constructing the boundary of any cell, which runs in optimal (n logn) time. A by-product of our results are the notions of skeleton and of skeletal order, which may be of interest in their own right.This work was partly supported by CEE ESPRIT Project P-940, by the Ecole Normale Supérieure, Paris, and by NSF Grant ECS-84-10902.This work was done in part while this author was visiting the Ecole Normale Supérieure, Paris, France.     

Algorithms for processing the group K nearest-neighbor query on distributed frameworks

Distributed and Parallel Databases - Given two datasets of points (called Query and Training), the Group (K) Nearest-Neighbor (GKNN) query retrieves (K) points of the Training with the smallest sum...     

Interfacial polymerization of pyrrole and in situ synthesis of polypyrrole/silver nanocomposites

We present a new synthetic approach leading to the formation of polypyrrole architectures in submicron level and to silver/polypyrrole nanocomposites via an interfacial polymerization in a water/chloroform interface. The oxidizing agent was either Ag(I) or Fe(III). In the first case, silver nanoparticles resulted. The mean diameter of the polypyrrole structures is in the range of 200-300 nm according to the addition or not of various surfactants. The progress of the reaction was studied by UV-visible spectroscopy, which also revealed the formation of a polaron band during the growth of the oligomers. The crystal structure of the polymers was examined by X ray diffractometry and all samples appeared to be amorphous, while the samples were further characterized by thermogravimetric analysis and FT-IR spectroscopy.