Image-based three-dimensional model reconstruction for Chinese treasureJadeite Cabbage with Insects This paper presents a novel 3D reconstruction system for the famous Chinese treasure, Jadeite Cabbage with Insects, from uncalibrated image sequences. There are two major challenges for this 3D model reconstruction problem. The first is the difficult image registration problem due to the semi-diaphaneity and the highly specular property of jadeite materials. Secondly, the unknown camera information, including the intrinsic (calibration) and extrinsic (position and orientation) parameters, to be recovered from the uncalibrated image sequences makes the 3D reconstruction problem very challenging. The proposed 3D modeling process first recovers the camera information as well as sparse 3D structure by using a robust structure from motion algorithm. Then an approximate 3D object model is recovered from the silhouettes at the corresponding multiple views by using the visual hull technique. The final process refines the 3D model by further integrating the 3D information extracted from dense correspondences between image patches of different views. In the proposed 3D reconstruction system, we successfully combine the structure from motion and visual hull techniques to accomplish this challenging task of reconstructing an accurate 3D model for jadeite object from uncalibrated multi-view images. Finally, we assess the 3D reconstruction results for the Chinese jadeite treasure and simulated data by using the proposed 3D reconstruction system.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

3d modeling
structure from motion
image registration

robust estimation
projective reconstruction
metric upgrade
optical flow computation
3d digital preservation
3d reconstruction of jadeite material


Analysis of internally cooled structures using a higher order theory This paper presents the results of a study on the thermo-mechanical behavior of internally cooled silicon nitride structures. Silicon nitride is under consideration for elevated temperature aerospace engine applications, and techniques for lowering the operating temperature of structures composed of this material are under development. Lowering the operating temperature provides a large payoff in terms of fatigue life and may be accomplished through the use of thermal barrier coatings (TBCs) and the novel concept of included cooling channels. Herein, an in depth study is performed on the behavior of a flame-impinged silicon nitride plate with a TBC and internal channels cooled by forced air. The analysis is performed using the higher order theory for functionally graded materials (HOTFGM), which has been developed through NASA Glenn Research Center funding over the past several years. HOTFGM was chosen over the traditional finite element approach in order to facilitate examination of functionally graded silicon nitride structures for which HOTFGM is ideally suited. To accommodate the analysis requirements of the internally cooled plate problem, two crucial enhancements were made to the two-dimensional Cartesian-based version of HOTFGM, namely, incorporation of internal boundary capabilities and incorporation of convective boundary conditions. Results indicate the viability and large benefits of cooling the plate via forced air through cooling channels. Furthermore, cooling can positively impact the stress and displacement fields present in the plate, yielding an additional payoff in terms of fatigue life. Results illustrating the benefits associated with particular cooling channel arrangements and functionally grading the silicon nitride material are also presented. Finally, a spin off capability resulted from inclusion of internal boundaries within HOTFGM; the ability to simulate the thermo-elastic response of structures with curved surfaces. This new capability is demonstrated, and through comparison with an analytical solution, shown to be viable and accurate.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

thermal analysis
deformation
elasticity
ceramics
parametric study


Reversible letter-to-sound/sound-to-letter generation based on parsing word morpology This paper describes a bi-directional letter/sound generation system based on a strategy combining data-driven techniques with a rule-based formalism. Our approach provides a hierarchical analysis of a word, including stress pattern, morphology and syllabification. Generation is achieved by a probabilistic parsing technique, where probabilities are trained from a parsed lexicon. Our training and testing corpora consisted of spellings and pronunciations for the high frequency portion of the Brown Corpus (10,000 words). The phonetic labels are augmented with markers indicating morphology and stress. We will report on two distinct grammars representing a historical perspective. Our early work with the first grammar inspired us to modify the grammar formalism, leading to greater constraint with fewer rules. We evaluated our performance on letter-to-sound generation in terms of whole word accuracy as well as phoneme accuracy. For the unseen test set, we achieved a word accuracy of 69.3% and a phoneme accuracy of 91.7% using a set of 52 distinct phonemes. While this paper focuses on letter-to-sound generation, our system is also capable of generation in the reverse direction, as reported elsewhere (Meng et al., 1994a). We believe that our formalism will be especially applicable for entering unknown words orally into a recognition system.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

reversible letter/sound generation
phonological parsing


Learning-based multiresolution transforms with application to image compression ? In Harten's framework, multiresolution transforms are defined by two operators. The predictor operator predicts finer levels of information from coarser ones. Goal is to minimize the details: the difference between the exact and predicted values. We use statistical learning tools to design a more accurate prediction operator. With this approach we obtain improvements over standard multiresolution transforms.

O B I O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I

statistical learning theory
linear regression
signal decompositions
image decompositions


PoweRGen: A power-law based generator of RDFS schemas As the amount of RDF datasets available on the Web has grown significantly over the last years, scalability and performance of Semantic Web (SW SW ) systems are gaining importance. Current RDF RDF benchmarking efforts either consider schema-less RDF RDF datasets or rely on fixed RDFS RDFS schemas. In this paper, we present the first RDFS RDFS schema generator, termed PoweRGen , which takes into account the features exhibited by real SW SW schemas. It considers the power-law power - law functions involved in (a) the combined in- and out-degree distribution of the property graph (which captures the domains and ranges of the properties defined in a schema) and (b) the out-degree distribution of the transitive closure (TC TC ) of the subsumption graph (which essentially captures the class hierarchy). The synthetic schemas generated by PoweRGen respect the power-law power - law functions given as input with an accuracy ranging between 89 and 96%, as well as, various morphological characteristics regarding the subsumption hierarchy depth, structure, etc.

O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Automobile wheel clearance estimation using magnetism With development and miniaturization of magnetic sensors for several years, it is now possible to imagine new applications using magnetic measures for monitoring and diagnostics. In this article this new way of research and development is presented with a concrete example concerning monitoring of wheels in an automobile. Our approach consists in using the low magnetic field created by the metallic elements of the wheel in order to localize them with low-cost high-sensitivity miniature magnetic sensors. The measures are made via a sensor network set up on a vehicle around the wheel. Then we use a physical model of the wheel in order to interpret the signals we get from the sensors. This method shows the interest of the magnetic measurement for monitoring in automobile. In this paper we present the magnetic signal created by a wheel, the mechanical model of the wheel and we present how we use them for an application: the real-time estimation of the distance between wheels and chassis (wheel clearance).

B O B O O B O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O B O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B

magnetism automobile clearance monitoring sensor


Model for cost estimation in a finite-capacity stochastic environment based on shop floor optimization combined with simulation In recent years several researchers suggested cost estimation models that consider limited capacity. These researchers ignored the stochastic nature of the shop floor. This paper presents a cost estimation model that takes into account the stochastic environment. It is based on marginal analysis the difference between the total cost without the new order and the total cost with the new order. The proposed model is based on the integration of simulation and optimization. Data generated by the simulation is inserted into the optimization procedure that finds good feasible solutions quickly. A significant advantage of the proposed stochastic cost estimation over an existing deterministic approach is shown. A computational study is performed to test different factors affecting the proposed model.

O O B I O O O O O O O O O B O O B O O O O O O B I O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O B O O O O B O O O O B O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O


Simulation of polymer molding filling process with an adaptive weld line capturing algorithm A simulation of mold filling with multi-inlets or an insert in the cavity is pursued with an improved Level Set Method. The governing equations for the melt and the air in the cavity are united into one system of Navier-Stokes equations and solved by the finite volume method on the collocated grid. The level set and the reinitialization equation, which is revised according to Sussman et al. to keep mass conservation, are solved by the finite difference method, in which the spatial derivatives are discretized by the 5th-order Weighted Essentially Non-Oscillatory (WENO) scheme, and the temporal derivatives are discretized by the 3rd-order Total Variation Diminishing Runge-Kutta (TVD-R-K) scheme. The validity of the advection scheme is verified by some benchmark problems. An effective algorithm for capturing the position of the weld line is proposed. The cases with different positions and quantities of inlets and different shapes of the insert in different positions are discussed. The positions of the interface at different time, the length and position of the weld line and the press distribution are given and corresponding analysis are made. Numerical results show that the dynamic description of fusion process can be implemented vividly when the cavity has multi-inlets or an insert inside, and the position of the melt at each time step can be determined precisely. Different position and size of the insert lead to different position and length of the weld line. A smaller size insert corresponds to a relatively shorter weld line, while as the width of the insert increases, the length of the weld line increases correspondingly.

O O O O O O O O O B I O O O O O B I O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O B I O O O O O O O O O O O O B I O O

mold filling
level set
weno scheme
weld line


CLASSES OF TWO-DIMENSIONAL LANGUAGES AND RECOGNIZABILITY CONDITIONS The paper deals with some classes of two-dimensional recognizable languages of "high complexity", in a sense specified in the paper and motivated by some necessary conditions holding for recognizable and unambiguous languages. For such classes we can solve some open questions related to unambiguity, finite ambiguity and complementation. Then we reformulate a necessary condition for recognizability stated by Matz, introducing a new complexity function. We solve an open question proposed by Matz, showing that all the known necessary conditions for recognizability of a language and its complement are not sufficient. The proof relies on a family of languages defined by functions.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O


Low temperature nanoimprint lithography using silicon nitride molds Nanoimprint lithography has been performed at low temperatures using low stress chemical vapour deposited silicon nitride (SixNy) as a mold material, with no sticking problems and hence no need for a release agent or surfactant. Imprint temperature, and the effect of quenching have been investigated and it is found that temperatures as low as 50C can be used successfully for imprint. Imprint profile due to resist overflow at these temperatures is discussed. Low temperature imprint is important for patterning substrates or polymer-based materials that are intolerant to high temperatures. A low temperature process could also be an advantage for alignment when the mold and substrate have different thermal expansion coefficients.

O O B I O B I I B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

nanoimprint lithography
silicon nitride molds
low temperature imprint
imprint profile


A multi-domain vertical alignment liquid crystal display to improve the VT property The voltagetransmittance (VT) property is important for the liquid crystal displays (LCDs). In this work, we propose a sub-pixel structure with two common electrodes of a multi-domain vertical alignment (MVA) mode. The sub-pixel is divided into two sub-areas and different common electrode voltages are applied to it. The optimal voltage difference of the common electrodes between sub-area 1 and sub-area 2 is proposed. The simulated results on the plotted displays and the voltagetransmittance property of the LCD, which has 1:1 sub-area ratio, have been carried out. The results show that the structure can form MVA liquid crystal display mode, such as 8-domain VA mode. It can improve the VT property at large oblique viewing angle and make the transmittance difference between the normal direction and the oblique direction viewing angle less than that of conventional 4-domain MVA mode.

O O O O O O O O O O B I O O B I O O O O O O O B O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O B O


Development of a decision support system for machining center selection The machining centers are key resources for manufacturing companies in their dealing with their fierce competitive market environments. However, although selecting the most appropriate machining center is a very important decision for manufacturing companies, the availability of wide-range of types and models makes the selection process a complex and difficult task. In this study, a decision support system (DSS), namely MACSEL, is developed to help the decision makers in their machining center selection decisions. Several issues and applicability of the MACSEL is illustrated with case problems in the paper. Within the developed DSS, to select the feasible set of machining centers fifteen questions are placed in the elimination (pre-selection) module. The developed DSS uses fuzzy analytical hierarchy process (FAHP) or fuzzy technique for order preference by similarity to ideal solution (FTOPSIS), which are extended versions of multi-criteria decision making approaches, to rank the feasible machining centers. In the DSS, FAHP is used if a detailed pair-wise weighting of the hierarchically structured criteria is wanted. On the other hand, when a simpler separate weighting of each criterion is be considered as enough, FTOPSIS is used.

O O O B I I O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

machining center selection
decision support system


modeling aventurescent gems with procedural textures In this paper we present the results of an investigation on how one can model aventurescence, an interesting and optically appealing property of some gemstones. Our goal was to find a method that is both efficient and reasonably realistic, and that can still be used in the context of a global illumination rendering system.

O O O O B I O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


High-performance Java codes for computational fluid dynamics The computational science community is reluctant to write large-scale computationally-intensive applications in Java due to concerns over Java's poor performance, despite the claimed software engineering advantages of its object-oriented features. Naive Java implementations of numerical algorithms can perform poorly compared to corresponding Fortran or C implementations. To achieve high performance, Java applications must be designed with good performance as a primary goal. This paper presents the object-oriented design and implementation of two real-world applications from the field of computational fluid dynamics (CFD): a finite-volume fluid flow solver (LAURA, from NASA Langley Research Center) and an unstructured mesh adaptation algorithm (2D_TAG, from NASA Ames Research Center). This work builds on our previous experience with the design of high-performance numerical libraries in Java. We examine the performance of the applications using the currently available Java infrastructure and show that the Java version of the flow solver LAURA performs almost within a factor of 2 of the original procedural version. Our Java version of the mesh adaptation algorithm 2D-TAG performs within a factor of 1.5 of its original procedural version on certain platforms. Our results demonstrate that object-oriented software design principles are not necessarily inimical to high performance. Copyright (C) 2003 John Wiley Sons, Ltd.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

scientific computing
object-oriented
benchmarks


Location estimation for indoor autonomous vehicle navigation by omni-directional vision using circular landmarks on ceilings ? A novel approach to location estimation by omni-directional vision for autonomous vehicle navigation in indoor environments using circular landmark information is proposed. A circular-shaped landmark is attached on a ceiling and an omni-directional camera is equipped on a vehicle to take upward-looking omni-directional images of the landmark. This way of image taking reduces possible landmark shape occlusion and image noise creation, which come from the existence of nearby objects or humans surrounding the vehicle. It is shown that the perspective shape of the circular landmark in the omni-directional image may be approximated by an ellipse by analytic formulas with good shape-fitting effect and fast computation speed. The parameters of the ellipse are then used for estimating the location of the vehicle with good precision for navigation guidance. Both simulated and real images were tested and good experimental results confirm the feasibility of the proposed approach.

B I O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

autonomous land vehicle
omni-directional vision
omni-directional camera
omni-directional image
circular-shaped landmark
indoor environment


Efficient parallel implementation of Ewald summation in molecular dynamics simulations on multi-core platforms We present a multi-step computation method to implement the Ewald summation for long-range electrostatic interactions in molecular dynamic simulations on a multi-core machine. Our methodology is based on the OpenMP programming model. It partitions computations of real-space summation among threads so that the global force of a single particle cannot be modified by more than one thread simultaneously. It requires neither a private copy of the force array for each thread nor an inspector at runtime. Compared with some other methods that can parallelise reduction operations on a force-array, our method achieves relatively higher speedups and lower L2 cache miss and bus utilisation ratios.

O O O O B I O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

parallel computing
array reduction
openmp model
long-range coulombic interactions


MLPA-conservation mechanism in wireless sensor network environments Transmission using excess power not only shortens the lifetime of sensor nodes, but also introduces interference. Packets should ideally be transmitted with moderate power. This study proposes a multi-level power adjustment (MLPA) mechanism for a wireless sensor network to prolong the lifetime of individual nodes and the overall network. In this study, we constructed an analytical model of the MLPA mechanism with m distinct power levels (m-LPA). For m-LPA, the closed-form expression of the optimal power setting was determined and the mean transmission power was minimized to one-third of the original fixed-transmission power. We found that the average power consumption of our proposed mechanism is 33.93% higher than that of fixed-transmission power. Thus, each node can extend the lifetime by 2.5 times. We have shown the relations between m and density in simulation results. Although the mechanism worked smoothly in this study, the sensors do not need to handle the distance and interference problem.

O O O B I I O O O O O O O O O B O O O O O O B O O O O O O O O O O O O O B I O O O O B I I O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O

lifetime
wireless sensor network
power adjustment
transmission power
interference


Topology of surfaces modelling bridges and tunnels in 3D-GIS Bridges and tunnels are semantically meaningful objects in Geographical Information Systems (GIS), playing an important role in terms of reachability between locations. From a topological point of view, bridges and tunnels on surfaces are captured by the notion of a handle. In this paper, we extend an existing axiomatic characterization of 3D surfaces, which guarantees consistency between geometry and topology, to the case of handles. Furthermore, we present a method which verifies the occurrence of handles in surfaces, thereby contributing to the semantic-topological consistency in GIS. We close the gap between the global topological definition of handles in surfaces and the local definition of semantical handle objects in GIS tunnels, bridges, arcades. Our method bases on a classification of cycles in two types. We give an efficient algorithm for discriminating both using standard methods from graph theory. This classification in addition contributes to the correctness of editing operations in GIS.

B O B O B O B O O B O B O O O O O O O O O O O O O O O O O O O O O O O O O B O B O B O O O O O O O O O O O O O O O O O O O B O O O O O O B O O O O B O O O O O O O O O O B O B O O O O O O O O O O O O O O O O O O B O B O O O O O O O O O O B B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

handles topology surfaces bridges tunnels


Guidelines on the aesthetic quality of UML class diagrams In the past, formatting guidelines have proved to be a successful method to improve the readability of source code. With the increasing success of visual specification languages such as UML for model-driven software engineering visual guidelines are needed to standardize the presentation and the exchange of modeling diagrams with respect to human communication, understandability and readability. In this article, we introduce a new and encompassing taxonomy of visual guidelines capturing the aesthetic quality of UML class diagrams. We propose these guidelines as a framework to improve the aesthetic quality and thus the understandability of UML class diagrams. To validate this claim, we describe in detail a controlled experiment carried out as a pilot study to gather preliminary insights on the effects of some of the guideline rules on the understandability of UML class diagrams.

O O O B I O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O B I I O O O O O O O O O O B I O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I

aesthetic quality
uml class diagrams
software engineering

layout guidelines
modeling tools
automatic layout


A SURVEY OF CLUSTERING ENSEMBLE ALGORITHMS Cluster ensemble has proved to be a good alternative when facing cluster analysis problems. It consists of generating a set of clusterings from the same dataset and combining them into a final clustering. The goal of this combination process is to improve the quality of individual data clusterings. Due to the increasing appearance of new methods, their promising results and the great number of applications, we consider that it is necessary to make a critical analysis of the existing techniques and future projections. This paper presents an overview of clustering ensemble methods that can be very useful for the community of clustering practitioners. The characteristics of several methods are discussed, which may help in the selection of the most appropriate one to solve a problem at hand. We also present a taxonomy of these techniques and illustrate some important applications.

O O O O O O B I O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


resolving query translation ambiguity using a decaying co-occurrence model and syntactic dependence relations Bilingual dictionaries have been commonly used for query translation in cross-language information retrieval (CLIR). However, we are faced with the problem of translation selection. Several recent studies suggested the utilization of term co-occurrences in this selection. This paper presents two extensions to improve them. First, we extend the basic co-occurrence model by adding a decaying factor that decreases the mutual information when the distance between the terms increases. Second, we incorporate a triple translation model, in which syntactic dependence relations (represented as triples) are integrated. Our evaluation on translation accuracy shows that translating triples as units is more precise than a word-by-word translation. Our CLIR experiments show that the addition of the decaying factor leads to substantial improvements of the basic co-occurrence model; and the triple translation model brings further improvements.

O B B O O O O O B O O O O O O O O O O O B B O O O O B O O O O O O O O B O O O O O O O O O O O O O O B O O O O O O O O O O O O B O O O O B O O O B I O O B O O O O O O O O O B B O O O O O O O O O O O B O B B O O O O O O O O B O O O B O B O O O O O O O O B O O O O O O O O B O O O B B O O O

precise
distance
translation
accuracy
clir
factor
mutual information
paper
model
evaluation
query

select
statistical model
dependencies
ambiguities
parse
query translation
co-occurrence
cross language information retrieval
experience
extensibility
integrability


Adaptive selection of heuristics for assigning time slots and rooms in exam timetables This paper presents an iterative adaptive approach which hybridises bin packing heuristics to assign exams to time slots and rooms. The approach combines a graph-colouring heuristic, to select an exam in every iteration, with bin-packing heuristics to automate the process of time slot and room allocation for exam timetabling problems. We start by analysing the quality of the solutions obtained by using one heuristic at a time. Depending on the individual performance of each heuristic, a random iterative hyper-heuristic is used to randomly hybridise the heuristics and produce a collection of heuristic sequences to construct solutions with different quality. Based on these sequences, we analyse the way in which the bin packing heuristics are automatically hybridised. It is observed that the performance of the heuristics used varies depending on the problem. Based on these observations, an iterative hybrid approach is developed to adaptively choose and hybridise the heuristics during solution construction. The overall aim here is to automate the heuristic design process, which draws upon an emerging research theme which is concerned with developing methods to design and adapt heuristics automatically. The approach is tested on the exam timetabling track of the second International Timetabling Competition, to evaluate its ability to generalise on instances with different features. The hyper-heuristic with low-level graph-colouring and bin-packing heuristics approach was found to generalise well over all the problem instances and performed comparably to the state of the art approaches.

O O O B O O O O O O O O O O O O O O O O O O B I B O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O B I B O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O


Pinned demand paging based on the access frequency of video files in video servers In this paper, we present an ameliorative demand-paging algorithm called PDPAF (i.e., pinned demand paging based on the access frequency of video files), to efficiently utilize the limited buffer space in a VOD (video-on-demand) server. It excludes the limitation of the disk bandwidth, and raises the hit ratio of video pages in the buffer, thereby increasing the total number of concurrent clients. Furthermore, we also propose an admission control algorithm to decide whether a new request can be admitted. Finally, we conduct extensive experiments to compare PDPAF with other algorithms on the average waiting time and the maximal number of concurrent requests, and the simulation results validate the superiority of our approach.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


The relationship among different covering approximations This paper studies covering-based rough sets by means of characteristic functions of sets. We consider covering-based rough sets from both constructive and axiomatic approaches. The relationship among four types of covering-based rough sets is discussed. We also outline the topologies induced by different covering approximations.

O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O

binary relation
approximation
rough set
neighborhood


A Delay-Efficient Algorithm for Data Aggregation in Multihop Wireless Sensor Networks Data aggregation is a key functionality in wireless sensor networks (WSNs). This paper focuses on data aggregation scheduling problem to minimize the delay (or latency). We propose an efficient distributed algorithm that produces a collision-free schedule for data aggregation in WSNs. We theoretically prove that the delay of the aggregation schedule generated by our algorithm is at most 16R + Delta - 14 time slots. Here, R is the network radius and Delta is the maximum node degree in the communication graph of the original network. Our algorithm significantly improves the previously known best data aggregation algorithm with an upper bound of delay of 24D + 6 Delta + 16 time slots, where D is the network diameter (note that D can be as large as 2R). We conduct extensive simulations to study the practical performances of our proposed data aggregation algorithm. Our simulation results corroborate our theoretical results and show that our algorithms perform better in practice. We prove that the overall lower bound of delay for data aggregation under any interference model is max{log n; R}, where n is the network size. We provide an example to show that the lower bound is (approximately) tight under the protocol interference model when r(I) = r, where r(I) is the interference range and r is the transmission range. We also derive the lower bound of delay under the protocol interference model when r = 3r.

O O O O O B O O O B O O B O O O O O O B O O O O O O O B B O O O O B O O O O O O O O O O O O O O O B O O O O O O O B O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O B O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O


A heuristic algorithm for cube packing with time schedule Packing problem has been proved to be an NP-hard problem. Many algorithms such as simulation annealing algorithm, genetic algorithm and other heuristic algorithms have been proposed to solve two-dimensional and three-dimensional packing problem. To solve the cube packing problem with time schedule, this paper first introduces some concepts such as packing level, space distance and average neighbor birth order and then proposes a greedy algorithm. The algorithm tries every feasible corner greedily to calculate the space utilization, packing level, space distance, average neighbor birth order of this placement, and chooses the best placement according to these criteria. Theoretical analysis indicates that the time complexity of this algorithm is O(A(2)B(2)C(2)T(2)n(5)). The experiments show that the average space utilization of non-guillotine cutting test cases is 98.81%, and the average space utilization of guillotine cutting test cases achieves 99.87%. Furthermore, optimal solutions of more than half cases are achieved by this algorithm. The experimental results show that this algorithm can solve the problem of cube packing with time schedule effectively and efficiently.

O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O B I O O O O O O O O B I B I O B I I I O O O O O O O O O O O O O O O O O O B I B I B I I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O

cube packing problem
time schedule
packing level
space distance
average neighbor birth order


Assessing Internet access and use in a medically underserved population: implications for providing enhanced health information services Background:? The relationship between health information seeking, patient engagement and health literacy is not well understood. This is especially true in medically underserved populations, which are often viewed as having limited access to health information.

O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

information and communication technologies


Quantitative Structure-Activity Relationship (QSAR) modeling of juvenile hormone activity: Comparison of validation procedures Four regression methods are used to fit QSAR models for a large set of juvenile hormone mimetic compounds, using a diverse set of descriptors. The proper application of cross-validation is summarized and applied to both the model selection and verification steps, with comparison to the use of a holdout sample. Implementation of the evaluation of a model's predictive ability at the correct point in the procedure is emphasized. A recent regression methodology, the elastic net, is shown to produce a reduced set of predictors while retaining predictive ability. (C) 2006 Elsevier B.V. All rights reserved.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O

model validation
ridge regression
marginal soft threshold
modified gram-schmidt orthogonalization


Multiple asymmetric traveling salesmen problem with and without precedence constraints: Performance comparison of alternative formulations In this paper, we investigate the performances of 32 formulations for the multiple asymmetric traveling salesman problem (mATSP) from the viewpoint of their tightness and solvability using commercial software. These formulations are either new or are generalizations of those proposed in the literature for the ATSP, including a transformation of the mATSP to an equivalent ATSP formulation. In particular, our results based on the latter strategy reveal that the superiority of the original mATSP formulation over an equivalent transformed ATSP model depends upon the type of formulation used for conducting such a transformation. We also extend our study to the case where precedence relationships exist among the cities. We address two situations in this context. In the first case, a sequential processing order is enforced between a pair of cities only if they both lie on the tour of a particular salesman. The second case involves a more general precedence in which a sequential processing order between certain pairs of cities is enforced regardless of whether the designated pairs are visited by the same or by different salesmen. Our computational experiments demonstrate that the flow-based models afford the tightest LP relaxations. Additionally, the formulations that model the different variants of the mATSP directly, rather than by transforming them to equivalent ATSP problems, are generally faster to solve and are more robust.

B I I I I O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

multiple asymmetric traveling salesmen problem


Optimal parameters study for sample entropy-based atrial fibrillation organization analysis Sample entropy (SampEn) is a nonlinear regularity index that requires the a priori selection of three parameters: the length of the sequences to be compared, m, the patterns similarity tolerance, r, and the number of samples under analysis, N. Appropriate values for m, r and N have been recommended and widely used in the literature for the application of SampEn to some physiological time series, such as heart rate, hormonal data, etc. However, no guidelines exist for the selection of that values in other cases. Therefore, an optimal parameters study should be required for the application of SampEn to not previously analyzed biomedical signals. In the present work, a thorough analysis on the optimal values for m, r and N is presented within the context of atrial fibrillation (AF) organization estimation, computed from surface electrocardiogram recordings. Recently, the evaluation of AF organization through SampEn, has revealed clinically useful information that could be used for a better treatment of this arrhythmia. The present study analyzed optimal SampEn parameter values within two different scenarios of AF organization estimation, such as the prediction of paroxysmal AF termination and the electrical cardioversion outcome in persistent AF. As a result, interesting recommendations about the selection of m, r and N, together with the relationship between N and the sampling rate (fs) were obtained. More precisely, (i) the proportion between N and fs should be higher than 1s and fs?256Hz, (ii) overlapping between adjacent N-length windows does not improve AF organization estimation with respect to the analysis of non-overlapping windows, and (iii) values of m and r maximizing successful classification for the analyzed AF databases should be considered within a range wider than the proposed in the literature for heart rate analysis, i.e. m=1 and m=2 and r between 0.1 and 0.25 times the standard deviation of the data.

O O O O O O B I O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

atrial fibrillation
electrocardiogram
sample entropy

main atrial wave
parameters selection
nonlinear analysis


A game theoretic analysis of network design with socially-aware users In many scenarios network design is not enforced by a central authority, but arises from the interactions of several self-interested agents. This is the case of the Internet, where connectivity is due to Autonomous Systems' choices, but also of overlay networks, where each user client can decide the set of connections to establish. Recent works have used game theory, and in particular the concept of Nash equilibrium, to characterize stable networks created by a set of selfish agents. The majority of these works assume that users are completely non-cooperative, leading, in most cases, to inefficient equilibria. To improve efficiency, in this paper we propose two novel socially-aware network design games. In the first game we incorporate a socially-aware component in the users' utility functions, while in the second game we use additionally a Stackelberg (leader-follower) approach, where a leader (e.g., the network administrator) architects the desired network buying an appropriate subset of network's links, driving in this way the users to overall efficient Nash equilibria. We provide bounds on the Price of Anarchy and other efficiency measures, and study the performance of the proposed schemes in several network scenarios, including realistic topologies where players build an overlay on top of real Internet Service Provider networks. Numerical results demonstrate that (1) introducing some incentives to make users more socially-aware is an effective solution to achieve stable and efficient networks in a distributed way, and (2) the proposed Stackelberg approach permits to achieve dramatic performance improvements, designing almost always the socially optimal network. (C) 2010 Elsevier B.V. All rights reserved.

O O O O O B I O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

network design
game theory
nash equilibrium


Sensing technologies for precision specialty crop production With the advances in electronic and information technologies, various sensing systems have been developed for specialty crop production around the world. Accurate information concerning the spatial variability within fields is very important for precision farming of specialty crops. However, this variability is affected by a variety of factors, including crop yield, soil properties and nutrients, crop nutrients, crop canopy volume and biomass, water content, and pest conditions (disease, weeds, and insects). These factors can be measured using diverse types of sensors and instruments such as field-based electronic sensors, spectroradiometers, machine vision, airborne multispectral and hyperspectral remote sensing, satellite imagery, thermal imaging, RFID, and machine olfaction system, among others. Sensing techniques for crop biomass detection, weed detection, soil properties and nutrients are most advanced and can provide the data required for site specific management. On the other hand, sensing techniques for diseases detection and characterization, as well as crop water status, are based on more complex interaction between plant and sensor, making them more difficult to implement in the field scale and more complex to interpret. This paper presents a review of these sensing technologies and discusses how they are used for precision agriculture and crop management, especially for specialty crops. Some of the challenges and considerations on the use of these sensors and technologies for specialty crop production are also discussed.

B O O O B I O O O O O O O O O O B O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O B O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O B I O O O O

specialty crop
precision agriculture
sensing
review


dating example for information architecture This paper provides the documented explanations of our submitted poster to CHI 2003 about the process of Information Architecture (IA). The general theme of CHI 2003 was to deliver an innovative way of presenting IA in order to better the IA community through a given theme or use of a metaphor. Our poster, IA Dating Example for Information Architecture, explains how IA is related to everyone's daily lives. In this document, we describe the similarities of IA in the web field and in dating in each step of the IA process.

B O O B I O O O O O O O O O O O B I O O O O B I B O O O O B I O O O O O O O O B O O O O O B O O O O O O O O O O O O B B O O B I O O B O O O O O O O O O O O O O O B O O O O O O B O O O O O B O

dating
ia
chi 2003
information architecture

multimedia and web design
student posters
the art institute of atlanta
conference posters
conference submissions


On Simsun and Double Simsun Permutations Avoiding a Pattern of Length Three A permutation sigma is an element of G(n) is simsun if for all k, the subword of sigma restricted to {1, ... , k} does not have three consecutive decreasing elements. The permutation sigma is double simsun if both sigma and sigma(-1) are simsun. In this paper, we present a new bijection between simsun permutations and increasing 1-2 trees, and show a number of interesting consequences of this bijection in the enumeration of pattern-avoiding simsun and double simsun permutations. We also enumerate the double simsun permutations that avoid each pattern of length three.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

simsun permutation
double-simsun
pattern-avoiding
increasing 1-2 tree


Performance of dense digital surface models based on image matching in the estimation of plot-level forest variables Recent research results have shown that the performance of digital surface model extraction using novel high-quality photogrammetric images and image matching is a highly competitive alternative to laser scanning. In this article, we proceed to compare the performance of these two methods in the estimation of plot-level forest variables. Dense point clouds extracted from aerial frame images were used to estimate the plot-level forest variables needed in a forest inventory covering 89 plots. We analyzed images with 60% and 80% forward overlaps and used test plots with off-nadir angles of between 0 and 20. When compared to reference ground measurements, the airborne laser scanning (ALS) data proved to be the most accurate: it yielded root mean square error (RMSE) values of 6.55% for mean height, 11.42% for mean diameter, and 20.72% for volume. When we applied a forward overlap of 80%, the corresponding results from aerial images were 6.77% for mean height, 12.00% for mean diameter, and 22.62% for volume. A forward overlap of 60% resulted in slightly deteriorated RMSE values of 7.55% for mean height, 12.20% for mean diameter, and 22.77% for volume. According to our results, the use of higher forward overlap produced only slightly better results in the estimation of these forest variables. Additionally, we found that the estimation accuracy was not significantly impacted by the increase in the off-nadir angle. Our results confirmed that digital aerial photographs were about as accurate as ALS in forest resources estimation as long as a terrain model was available.

O O O O O O O O B I O O O O O O O O O O O O O O O O O B I O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

image matching
surface model
airborne laser scanning

dense point cloud
plot-level forest variables


TEFIS: A single access point for conducting multifaceted experiments on heterogeneous test facilities A few years ago, an experimental facility composed of networking gear and simulation tools was sufficient for testing the main features of a prototype before the final product could be launched to the Internet market. This paradigm has certainly changed, but the lack of platforms enabling the realistic assessment of the different facets of a product, including cross-cutting trials across different testbeds, poses strong limitations for researchers and developers. In light of this, we present an open platform that offers a versatile combination of heterogeneous experimental facilities called TEstbed for Future Internet Services (TEFIS). TEFIS provides a single access point for conducting cutting-edge experiments on testbeds that supply different capabilities, including testbeds dedicated to network performance, software performance, grid computing, and living labs. We shall show that TEFIS covers the entire life-cycle of a multifaceted experiment, with the advantage that a single testrun can seamlessly execute across different experimental facilities. In order to demonstrate the potential and versatility of the TEFIS platform, we describe the deployment of four distinct experiments and provide a set of results highlighting the benefits of using TEFIS. The experiments described in this article cover: (i) the experimentation with an open API called OPENER (which is an open and programmable environment for managing experimentation with SDN applications); (ii) an application for skiers and tourists at the Megve ski resort in France; (iii) an application that can dynamically adapt the Quality of Experience (QoE) of multimedia services for mobile users; and (iv) an augmented reality workspace for remote education and learning purposes based on videoconferencing.

O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O B O O O O O B O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

experimental
testbeds
versatility
living labs


A user pattern learning strategy for managing users' mobility in UMTS networks Third-generation mobile systems provide access to a wide range of services and enable mobile users to communicate regardless of their geographical location and their roaming characteristics. Due to the growing number of mobile users, global connectivity, and the small size of cells, one of the most critical issues regarding these networks is location management. In recent years, several strategies have been proposed to improve the performance of the location management procedure in 3G mobile networks. In this paper, we present a user pattern learning strategy (UPL) using neural networks to reduce the location update signaling cost by increasing the intelligence of the location procedure in UMTS. This strategy associates to each user a list of cells where she is likely to be with a given probability in each time interval. The implementation of this strategy has been subject to extensive tests. The results obtained confirm the efficiency of UPL in significantly reducing the costs of both location updates and call delivery procedures when compared to the UMTS standard and with other strategies well-known in the literature.

O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

mobility management
umts neural networks


A near-optimal similarity join algorithm and performance evaluation Similarity join, a basic operation for multi-media databases, amounts to combinations of all pairs of points, with the distance between each pair bounded by a given parameter In this paper, properties of index-based join algorithms are studied and a highly efficient and near-optimal similarity join algorithm is proposed. Our algorithm utilizes the Breadth-First strategy, and guides the join computation and I/O access through the cache content. In contrast with many other proposed join algorithms, our algorithm is advantageous due to the essential independence of the ordering strategies and the minimal cache capacity requirement. As a result, a more precise plan for the sequence of join computations and I/O access can be realized. Generally, processing and accessing each page can be done with only one attempt. Qualitative and quantitative analysis of the performance of the algorithm is provided. Although only R-tree (a common index structure) based similarity join is discussed in this paper, the idea can be generalized to implement other join algorithms without substantial difficulties. Experiments based on our analysis indicate that the new algorithm yields superior performances across a wide range of dimensions and sizes of databases. (C) 2003 Elsevier Inc. All rights reserved.

O O B I O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

r-tree
ordering strategy
sequencing strategy


Chaos-genetic algorithms for optimizing the operating conditions based on RBF-PLS model A novel genetic algorithm (GA) including chaotic variable named chaos-genetic algorithm (CGA) was proposed. Due to the nature of chaotic variable, i.e. pseudo-randomness, ergodicity and irregularity, the evolutional process of CGA makes the individuals of subgenerations distributed ergodically in the defined space and circumvents the premature of the individuals of subgenerations. The performance of CGA was demonstrated through two examples and compared with that by the traditional genetic algorithms (TGA). The results showed the superior performances of CGA over TGA, and moreover, the probability of finding the global optimal value by using CGA is larger than that by using TGA. To illustrate the performance of CGA further, it was employed to optimize the operating conditions of aromatic hydrocarbon isomerization (AHI) process modeled by the radial basis functions (RBF) coupled with partial least squares (PLS) approach. Satisfactory results were obtained. Further, a generalized methodology, which employs RBF-PLS approach to model the complex chemical process based upon practical observation data and subsequently applies CGA to find the optimal operating conditions, was suggested too. (C) 2003 Elsevier Science Ltd. All rights reserved.

O O O O O O O O O O B O O O O O O B I O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O B I I O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

chaotic variable
radial basis functions
partial least squares
model


Strong formulations of robust mixed 0-1 programming We introduce strong formulations for robust mixed 0-1 programming with uncertain objective coefficients. We focus on a polytopic uncertainty set described by a ``budget constraint'' for allowed uncertainty in the objective coefficients. We show that for a robust 0-1 problem, there is an alpha-tight linear programming formulation with size polynomial in the size of an alpha-tight linear programming formulation for the nominal 0-1 problem. We give extensions to robust mixed 0-1 programming and present computational experiments with the proposed formulations.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

robust optimization
polyhedra
modeling
computation


High-order kinetic flux vector splitting schemes in general coordinates for ideal quantum gas dynamics A class of high-order kinetic flux vector splitting schemes are presented for solving ideal quantum gas dynamics based on quantum statistical mechanics. The collisionless quantum Boltzmann equation approach is adopted and both Bose-Einstein and Fermi-Dirac gases are considered. The formulas for the split flux vectors are derived based oil the general three-dimensional distribution function in velocity space and formulas for lower dimensions can be directly deduced. General curvilinear coordinates are introduced to treat practical problems with general geometry. High-order accurate schemes using weighted essentially nori-oscillatory methods are implemented. The resulting high resolution kinetic flux Splitting schemes are tested for 1D shock tube flows and shock wave diffraction by a 2D wedge and by a circular cylinder in ideal quantum gases. Excellent results have been obtained for all examples computed. (C) 2007 Elsevier Inc. All rights reserved.

O O O O O O O B I O B I I O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

quantum gas dynamics
kfvs scheme
high resolution scheme


A flood-based information flow analysis and network minimization method for gene regulatory networks Biological networks tend to have high interconnectivity, complex topologies and multiple types of interactions. This renders difficult the identification of sub-networks that are involved in condition- specific responses. In addition, we generally lack scalable methods that can reveal the information flow in gene regulatory and biochemical pathways. Doing so will help us to identify key participants and paths under specific environmental and cellular context.

O O B I O O B I O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O

information flow
gene regulatory networks
network minimization


testing versus estimation of graph properties The topic of tolerant property testing, that of distinguishing input instances that are far from satisfying a property from those that are close enough to satisfying it (as opposed to distinguishing the far instances only from the satisfying instances), has recently become an active topic of research in the field of combinatorial property testing [13]. In the general setting, there exist properties that are testable but not tolerantly testable [10]. However, we show here that in the setting of the dense graph model, all testable properties are not only tolerantly testable, but also admit a constant query size algorithm that estimates the distance from the property up to any fixed additive constant.In the course of the construction of this algorithm we develop a framework for extending Szemerdi's Regularity Lemma, both as a prerequisite for formulating what kind of information about the input graph will provide us with the correct estimation, and as the means for efficiently gathering this information. This work is also connected to the question of finding a combinatorial characterization of the testable graph properties, and to the question of efficiently finding a regular partition.

O O O O B I O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O

graph properties
property testing
regularity lemma


estimating the confidence of conditional functional dependencies Conditional functional dependencies (CFDs) have recently been proposed as extensions of classical functional dependencies that apply to a certain subset of the relation, as specified by a pattern tableau . Calculating the support and confidence of a CFD (i.e., the size of the applicable subset and the extent to which it satisfies the CFD)gives valuable information about data semantics and data quality. While computing the support is easier, computing the confidence exactly is expensive if the relation is large, and estimating it from a random sample of the relation is unreliable unless the sample is large. We study how to efficiently estimate the confidence of a CFD with a small number of passes (one or two) over the input using small space. Our solutions are based on a variety of sampling and sketching techniques, and apply when the pattern tableau is known in advance, and also the harder case when this is given after the data have been seen. We analyze our algorithms, and show that they can guarantee a small additive error; we also show that relative errors guarantees are not possible. We demonstrate the power of these methods empirically, with a detailed study using both real and synthetic data. These experiments show that it is possible to estimate the CFD confidence very accurately with summaries which are much smaller than the size of the data they represent.

O O O O B I I B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Reliable user-level rollback recovery implementation for multithreaded processes on windows The existing user-level checkpointing schemes support only a limited portion of multithreaded programs because they are derived from the schemes for single-threaded applications. This paper addresses the impact of thread suspension point on rollback recovery, and presents a checkpointing scheme for multithreaded processes. Unlike the existing schemes in which the checkpointer suspends every working thread, our scheme employs a distinctive strategy that every working thread suspends itself. This technique manages to avoid the suspension point in the API code or kernel code, ensuring correct rollback recovery. Our scheme supports inter-thread synchronization and thread lifetime. Copyright (C) 2006 John Wiley & Sons, Ltd.

O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O


Identification of Rhetorical Roles for Segmentation and Summarization of a Legal Judgment Legal judgments are complex in nature and hence a brief summary of the judgment, known as a headnote, is generated by experts to enable quick perusal. Headnote generation is a time consuming process and there have been attempts made at automating the process. The difficulty in interpreting such automatically generated summaries is that they are not coherent and do not convey the relative relevance of the various components of the judgment. A legal judgment can be segmented into coherent chunks based on the rhetorical roles played by the sentences. In this paper, a comprehensive system is proposed for labeling sentences with their rhetorical roles and extracting structured head notes automatically from legal judgments. An annotated data set was created with the help of legal experts and used as training data. A machine learning technique, Conditional Random Field, is applied to perform document segmentation by identifying the rhetorical roles. The present work also describes the application of probabilistic models for the extraction of key sentences and composing the relevant chunks in the form of a headnote. The understanding of basic structures and distinct segments is shown to improve the final presentation of the summary. Moreover, by adding simple additional features the system can be extended to other legal sub-domains. The proposed system has been empirically evaluated and found to be highly effective on both the segmentation and summarization tasks. The final summary generated with underlying rhetorical roles improves the readability and efficiency of the system.

O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O B I O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O

document segmentation
rhetorical roles
conditional random field


On the optimal frame-length configuration on real passive RFID systems The majority of the anti-collision protocols proposed for passive RFID systems are based on frame slotted aloha (FSA). They assume a classical result in FSA-based protocols which states that the theoretical identification throughput is optimized when the number of competing tags in coverage equals the number of slots in the frame. However, this is not exact in real RFID systems, as the so-called capture effect is neglected. The capture effect occurs when a tag identification signal is successfully decoded from a collision slot. This paper analyzes the identification performance of real RFID systems, taking into account not only the capture effect, but also the requirements imposed by the de facto standard EPCglobal Class-1 Gen-2. The analysis is addressed by discrete time Markov chains. From the analysis, a set of relevant results is extracted: the frame-length values that, configured into the readers studied, guarantee the best identification performance (maximum throughput). The analytical results have been confirmed by means of simulations and by a set of measurements performed on a real passive RFID system. Results closely match the analysis predictions, which demonstrate a notable impact of the configuration on the performance.

O O O O O O O O B O O O O O O O O O O B O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O B I O O O B I O O O O O O O O O O O O O O O O O O O O O B O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O


Quantitative relationships between molecular structures, environmental temperatures and octanol-air partition coefficients of polychlorinated biphenyls A quantitative model that incorporates information on both environmental temperatures (T) and molecular structures, for logarithm of octanol-air partition coefficient to base 10 (log K-OA) of polychlorinated biphenyls (PCBs) was developed. Partial least squares (PLS) analysis together with 16 theoretical molecular structural descriptors was used to develop the Quantitative relationships between structures, environmental temperatures and properties (QRSETP) model. The cross-validated Q(cum)(2) value for the optimal QRSETP model is 0.976, indicating a good predictive ability for log K-OA of PCBs at different environmental temperatures. T, E-LUMO (the energy of the lowest unoccupied molecular orbital), molecular size or average molecular polarizability (alpha), and the net atomic charges on chlorine, hydrogen and carbon atoms of PCB molecules, are major factors governing log K-OA. The lower the E-LUMO, the greater the intermolecular interactions between octanol and PCB molecules, and thus the greater the log K-OA values. Because of intermolecular dispersive forces, the more chlorine atoms in PCB molecules, the greater the molecular size or alpha, the greater the log K-OA. The largest negative net atomic charge on a carbon atom (q(C)(-)) and molecular size or average molecular polarizability (alpha) are major factors governing temperature dependence of log K-OA. PCB molecules with low q(C)(-) values and more chlorines (big size or alpha) tend to have strong temperature dependence, due to intermolecular electrostatic interactions and dispersive forces, respectively. (C) 2002 Elsevier Science Ltd. All rights reserved.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O B I I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O B O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O


Stokes equations with small parameters in half plane The stationary and instationary abstract Stokes problems are studied in half plane. The equations contain an abstract operator and small parameters. The uniform well-posedness of these problems in vector-valued Lp L p spaces are derived.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

differential equations with small parameters

maximal lp l p regularity lp l p lp l p l p


Visualising high-dimensional data in time and space: ideas from the Orca project Environmental data are frequently high-dimensional with measurements of multiple chemical constituents, plant or animal species, or meteorological variables. Environmental data are also frequently structured with interest in the patterns of variation over time and space. We describe some new data visualization methods from the Orca project that allow the analyst to reduce the dimension of the data without obscuring its basic structure and illustrate these on air pollution data. (C) 2002 Elsevier Science B.V. All rights reserved.

O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Positive solutions of periodic boundary value problems for impulsive differential equations In this paper, we discuss the existence of positive solutions of periodic boundary value problems for second-order impulsive equations. The existence and multiplicity of positive solutions are established and the proof is based upon fixed point theorems in cone. (C) 2009 Elsevier Ltd. All rights reserved.

O O O B I I I O B I I O O O O O O O O O O O B I I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

impulsive differential equations
periodic boundary value problems


Impairment-aware ordered scheduling in dual-header optical burst switched networks Optical burst switching (OBS) is a promising technology for bridging the gap between optical wavelength switching and optical packet switching. Optical signal transmission quality is subject to various types of physical impairment introduced by optical fibers, switching elements, or other network components. The signal degradation due to physical impairment may be significant enough such that the bit-error rate of received signals is unacceptably high at the destination, rendering the signal to not usable. In this article, based on earlier study, we study the burst-scheduling problem in OBS networks using two control packets for each data burst, taking into account physical impairment effects. We propose a burst-scheduling algorithm that accommodates incoming bursts by primary path routing, deflection routing, and burst scheduling. We design an admission control mechanism to use network resources efficiently. At an OBS node, the proposed algorithm schedules bursts for transmission by searching for available resources as well as verifying signal quality. Our simulation results demonstrate that the proposed algorithm is effective in terms of reducing the burst-blocking probability.

O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

optical burst switching
burst scheduling

dual-header obs
physical impairment-aware scheduling


Performance comparison of several non-linear equalizers in the context of mobile telecommunications This paper provides a comparative study of several nonlinear blind equalizers in terms of computational requirements and of the transient performance, which is the main criterion to be considered in the context of time-varying channels. Computational requirements are estimated as the number of real additions and multiplications associated with the training algorithm, whereas the transient performance is evaluated in terms of convergence time. The impact of local minima on the tracking ability is carefully evaluated, in terms of a suitable criterion proposed in the paper. Simulations involve both single-layer (linear and polynomial filters), as well as multilayer structures (radial basis function, recurrent network, multilayer perceptron). These techniques are applied to the blind equalization of mobile terrestrial and satellite channels. Guidelines are established for the choice of a suitable structure as the major trade-off to be achieved in a mobile context is between computational effort and robustness of tracking capability (with respect to local minima effects).

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Nonlinear inverse optimization approach for determining the weights of objective function in standing reach tasks This paper presents a nonlinear inverse optimization approach to determine the weights for the joint displacement function in standing reach tasks. This inverse optimization problem can be formulated as a bi-level highly nonlinear optimization problem. The design variables are the weights of a cost function. The cost function is the weighted summation of the differences between two sets of joint angles (predicted posture and the actual standing reach posture). Constraints include the normalized weights within limits and an inner optimization problem to solve for joint angles (predicted standing reach posture). The weight linear equality constraints, obtained through observations, are also implemented in the formulation to test the method. A 52 degree-of-freedom (DOF) human whole body model is used to study the formulation and visualize the prediction. An in-house motion capture system is used to obtain the actual standing reach posture. A total of 12 subjects (three subjects for each percentile in stature of 5th percentile female, 50th percentile female, 50th percentile male and 95th percentile male) are selected to run the experiment for 30 tasks. Among these subjects one is Turkish, two are Chinese, and the rest subjects are Americans. Three sets of weights for the general standing reach tasks are obtained for the three zones by averaging all weights in each zone for all subjects and all tasks. Based on the obtained sets of weights, the predicted standing reach postures found using the direct optimization-based approach have good correlation with the experimental results. Sensitivity of the formulation has also been investigated in this study. The presented formulation can be used to determine the weights of cost function within any multi-objective optimization (MOO) problems such as any types of posture prediction and motion prediction. (C) 2012 Elsevier Ltd. All rights reserved.

O B I O O O O B O B I O B I I O O O O O B I O O O O B O O O O O O B I I O B I O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O B I I O O O O O O O O O B O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O

objective function
weights
inverse optimization
standing reach tasks


Confidence interval for a coefficient of quartile variation An approximate confidence interval is proposed for a robust measure of relative dispersionthe coefficient of quartile variation. The proposed method provides an alternative to interval estimates for other measures of relative dispersion.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I

coefficient of dispersion
coefficient of variation
interquartile range


A simplified GLRAM algorithm for face recognition In this paper we propose a new face recognition method based on the generalized low rank approximations of matrices (GLRAM). First, we investigate the GLRAM and its associated coupled subspace analysis and then propose a new simplified algorithm, which is named as SGLRAM aiming at deriving the projection matrices for GLRAM. We implement all these algorithms (GLRAM SGLRAM) for face recognition on the ORL and YaleB databases and the experiments show that the SGLRAM can produce comparable high performance compared to the approached of two-dimensional principal component analysis (2DPCA) and GLRAM. However, it will cost much less time than the GLRAM in training and save more space than the 2DPCA in testing.

O O O O O B I O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Exploiting multiple description coding for intermediate recovery in wireless mesh networks Guarding against channel errors in wireless networks has been a challenging research problem, specially when transmitting time-constrained contents, like streaming video or image. Multiple description coding (MDC) is an effective means to combat bursty packet losses over wireless channels, and it is especially promising for the applications where retransmission is unacceptable. In MDC, a frame is broken into several equally important descriptions which can be sent over multiple paths to the destination. Meshed multipath routing over wireless mesh networks and MDC, when combined together, could make video/image transmission more error-resilient by providing opportunities to recover erroneous video packets at the intermediate nodes along the route. In this work, we propose to combine MDC and meshed multipath routing in such a way that multiple descriptions are sent over different paths in the network and are merged at the intermediate nodes for possible recovery of corrupted descriptions. The routing uses the idea that when multiple descriptions join at intermediate points it can help in partial recovery of lost or corrupted descriptions by using the link error information. This approach reduces the possibility of error propagation, thereby improving the overall image/video quality at the destination. In order to achieve high gain in terms of peak signal-to-noise ratio (PSNR), we investigate an optimum spatial interleaving based MDC scheme that maximizes the intermediate recovery possibility for a given recovery filter design. We also explore the choice of an optimum number of descriptions for merging at an intermediate merging point that maximizes the PSNR gain. Our simulation study shows that, by introducing recovery possibility even at one intermediate node, it is possible to achieve a PSNR gain of around 56dB using our coding, routing, and recovery strategies.

O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

multi description coding
image transmission
multi-hop wireless networks
cross-layer approach


A novel statistical distortion model based on mixed Laplacian and uniform distribution of Mpeg-4 FGS The Laplacian Distribution has been widely used to characterize the distribution of DCT coefficients in a great deal of research on statistical attributes of DCT for the reason that Laplacian distribution can achieve a good balance between the simplification of the model and fidelity to the real empirical data. But in our research, we found that there is a large discrepancy between the real data and the distortion model based on Laplacian distribution. Furthermore, the higher the rate, the larger the distortion. In this paper we proposed a new distortion model based on mixed Laplacian and Uniform distributions. Experimental results show that the MLQ distortion model can approximate the real empirical data and has a higher degree of accuracy than the conventional distortion model based on Laplacian distribution. Compared with the conventional distortion model based on Laplacian distribution, the new model can decrease the MSE distortion by 2-6 units. The MLQ distortion model can represent the relationship of rate and distortion of the Mpeg-4 FGS enhancement layer with a higher degree of accuracy.

O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O B O O O O O O O B O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O B O O O O O O O O O B O O O O O O O O O O O O B O O O O O B O O O O O O O O B O O O O O O O O O O O O

mpeg 4 fgs
bit plane
scalable coding
statistical model


HEAP: A packet authentication scheme for mobile ad hoc networks ? ?? In mobile ad hoc networks (MANETs) and wireless sensor networks (WSNs), it is easy to launch various sophisticated attacks such as wormhole, man-in-the-middle and denial of service (DoS), or to impersonate another node. To combat such attacks from outsider nodes, we study packet authentication in wireless networks and propose a hop-by-hop, efficient authentication protocol, called HEAP. HEAP authenticates packets at every hop by using a modified HMAC-based algorithm along with two keys and drops any packets that originate from outsiders. HEAP can be used with multicast, unicast or broadcast applications. We ran several simulations to compare HEAP with existing authentication schemes, such as TESLA, LHAP and Lu and Poochs algorithm. We measured metrics such as latency, throughput, packet delivery ratio, CPU and memory utilization and show that HEAP performs very well compared to other schemes while guarding against outsider attacks.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

nmac
hmac
hop-by-hop packet authentication
manet security


simultaneous multilingual search for translingual information retrieval We consider the problem of translingual information retrieval, where monolingual searchers issue queries in a different language than the document language(s) and the results must be returned in the language they know, the query language. We present a framework for translingual IR that integrates document translation and query translation into the retrieval model. The corpus is represented as an aligned, jointly indexed "pseudo-parallel" corpus, where each document contains the text of the document along with its translation into the query language. The queries are formulated as multilingual structured queries, where each query term and its translations into the document language(s) are treated as synonym sets. This model leverages simultaneous search in multiple languages against jointly indexed documents to improve the accuracy of results over search using document translation or query translation alone. For query translation, we compared a statistical machine translation (SMT) approach to a dictionary-based approach. We found that using a Wikipedia-derived dictionary for named entities combined with an SMT-based dictionary worked better than SMT alone. Simultaneous multilingual search also has other important features suited to translingual search, since it can provide an indication of poor document translation when a match with the source document is found. We show how close integration of CLIR and SMT allows us to improve result translation in addition to IR results.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O B I O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Mobile cloud computing: A survey Despite increasing usage of mobile computing, exploiting its full potential is difficult due to its inherent problems such as resource scarcity, frequent disconnections, and mobility. Mobile cloud computing can address these problems by executing mobile applications on resource providers external to the mobile device. In this paper, we provide an extensive survey of mobile cloud computing research, while highlighting the specific concerns in mobile cloud computing. We present a taxonomy based on the key issues in this area, and discuss the different approaches taken to tackle these issues. We conclude the paper with a critical analysis of challenges that have not yet been fully met, and highlight directions for future work.

B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


what does business and industry expect from computer science graduates today? In developing a curriculum that produces graduates that are readily accepted in today's business and industry the question arises, What courses in a student's background are most vital? To address this question a questionnaire was constructed and sent to 500 businesses and industries in South Carolina, North Carolina, Tennessee, Georgia, Virginia, and Florida. This short paper reports the rather startling findings of this survey.

O O B O O O O B I O O O O O B O O O O O O O O O B O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O B O O O O O O O B

computer science
paper
survey
questionnaire
business
curriculum


Improving reliability of a shared supplier with competition and spillovers Study spillover effect on competing manufacturers incentives to improve a suppliers reliability. Develop a two-stage model with supplier improvement, random supply and demand, and competition. Characterize manufacturers equilibrium inventory decision. Characterize sufficient conditions of existence of equilibrium of manufacturers improvement efforts. Explore impact of market characteristics on manufacturers improvement efforts.

O B O O O O O O O O O B O O O O O O O O O B O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

reliability
spillover
supplier improvement


Improved

version

of

parallel

programming

interface

for

distributed

data

with

multiple

helper

servers

We

present

an

improved

version

of

the

Parallel

Programming

Interface

for

Distributed

Data

with

Multiple

Helper

Servers

library,

which

provides

a

common

application

programming

interface

that

is

based

on

the

most

frequently

used

functionality

of

both

and

GA.

Compared

with

the

previous

version,

the

library

introduces

multiple

helper

servers

to

facilitate

global

data

structures,

and

allows

programmers

to

make

heavy

use

of

large

global

data

structures

efficiently.

Program

title:

Catalogue

identifier:

Program

summary

Program

obtainable

from:

CPC

Program

Library,

Queen?s

University,

Belfast,

N.

Ireland

Licensing

provisions:

Standard

CPC

licence,

No.

of

lines

in

distributed

program,

including

test

data,

etc.:

No.

of

bytes

in

distributed

program,

including

test

data,

etc.:

Distribution

format:

tar.gz

Programming

language:

Fortran,

C

Computer:

Many

parallel

systems

Operating

system:

Various

Has

the

code

been

vectorised

or

parallelised?:

Yes.

processors

used

RAM:

Mbytes

Classification:

External

routines:

Global

Arrays

or

Catalogue

identifier

of

previous

version:

Journal

reference

of

previous

version:

Comput.

Phys.

Comm.

Does

the

new

version

supersede

the

previous

version?:

Yes

Nature

of

problem:

Many

scientific

applications

require

management

and

communication

of

data

that

is

global,

and

the

standard

protocol

provides

only

low-level

methods

for

the

required

one-sided

remote

memory

access.

Solution

method:

The

Parallel

Programming

Interface

for

Distributed

Data

(PPIDD)

library

provides

an

interface,

suitable

for

use

in

parallel

scientific

applications,

that

delivers

communications

and

global

data

management.

The

library

can

be

built

either

using

the

Global

Arrays

(GA)

toolkit,

or

a

standard

library.

This

abstraction

allows

the

programmer

to

write

portable

parallel

codes

that

can

utilise

the

best,

or

only,

communications

library

that

is

available

on

a

particular

computing

platform.

Reasons

for

new

version:

In

the

previous

version,

functionality

in

global

data

structure

was

mainly

implemented

by

passive

one-sided

operations.

In

real

applications

which

make

heavy

use

of

global

data

structures,

very

poor

performance

was

observed.

Summary

of

revisions:

Multiple

helper

servers

are

introduced

to

facilitate

the

manipulation

and

management

of

global

data

structure.

Mutual

exclusion

is

also

implemented

by

the

help

of

a

data

server,

and

becomes

much

more

robust

and

efficient.

In

addition,

flexible

options

are

provided

to

choose

different

settings

for

helper

servers.

Significant

improvement

has

been

seen

in

performance

tests.

Running

time:

Problem-dependent.

The

test

provided

with

the

distribution

takes

only

a

few

seconds

to

run.

O O O B O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O