On the Convergence of a Full Discretization Scheme for the Stochastic Navier-Stokes Equations We mainly investigate the error approximation of stochastic Navier-Stokes equations driven by white noise. Herein the discretization about space is studied by finite element method, and in time it holds the backward Euler scheme. To obtain the optimal error estimations, the main error is divided into three parts. The proofs of the first two parts are based on the corresponding deterministic case. The third part which contains stochastic error is researched by the relevant norms and integrals.

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

stochastic navier-stokes equations
discrete scheme
numerical analysis


A robust adaptive beamformer with a blocking matrix using coefficient-constrained adaptive filters This paper proposes a new robust adaptive beamformer applicable to microphone arrays. The proposed beamformer is a generalized sidelobe canceller (GSC) with a variable blocking matrix using coefficient-constrained adaptive filters (CCAFs). The CCAFs, whose common input signal is the output of a fixed beamformer, minimize leakage of the target signal into the interference path of the GSC. Each coefficient of the CCAFs is constrained to avoid mistracking. In the multiple-input canceller, leaky adaptive filters are used to decrease undesirable target-signal cancellation. The proposed beamformer can allow large look-direction error with almost no degradation in interference-reduction performance and can be implemented with a small number of microphones. The maximum allowable look-direction error can be specified by the user. Simulation results show that the proposed beamformer, when designed to allow about 20 degrees of look-direction error, can suppress interference by more than 17 dB.

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

beamforming
microphone array
adaptive signal processing
noise reduction


Oil spill response planning with consideration of physicochemical evolution of the oil slick: A multiobjective optimization approach This paper addresses the optimal planning of oil spill response operations under economic and responsive criteria, with consideration of oil weathering process. The economic criterion is measured by total cost, while the measure of responsiveness is the time span of the entire response operations. A bi-criterion, multiperiod mixed-integer linear programming (MILP) model is developed that simultaneously predicts the optimal time trajectories of oil volume and slick area, transportation profile, response resource utilization levels, cleanup schedule, and coastal protection plan. The MILP model integrates with the prediction of an oil weathering model that accounts for oil physicochemical properties, spilled amount, hydrodynamics, and weather conditions. The multi-objective optimization model is solved with the epsilon-constraint method and produces a Pareto optimal curve that reveals how the optimal total cost and response operations change under different specifications of responsiveness. We present two illustrative examples for oil spill incidents in the Gulf of Mexico and New England. (C) 2011 Elsevier Ltd. All rights reserved.

B I I B O O O O O O O O O O O O O O O O O O B 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 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 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


fast dual-vdd buffering based on interconnect prediction and sampling This paper presents fast algorithms for power-optimal interconnect synthesis based on interconnect prediction and sampling considering dual V dd buffers. We present three pruning techniques including interconnect prediction based pruning ( pre-buffer slack pruning and predictive min-delay pruning ) and sampling ( 3D sampling ), of which 3D sampling is effective but the other two improve both efficiency and accuracy of sampling. We also show that the key to runtime reduction is to reduce the number of propagated options, while the sophisticated data-structures which have good amortized complexity do not necessarily reduce runtime. We obtain an empirically linear time algorithm with less than 1\% of delay and power increase but over 50x speedup compared with the most efficient algorithm for dual V dd buffer insertion. In addition, we further enhance the power-optimal buffered tree construction by introducing routing grid reduction. We apply our speedup techniques to buffered tree construction algorithm. Experimental results show that we obtain over 100x speedup compared with the most efficient existing algorithms for dual V dd buffered tree construction.

O O O O O B O O O O O O O O O O B 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 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


resolution enhancement of facial image based on top-down learning This paper proposes a new method of synthesizing a highresolution facial image from a low-resolution facial image based on top-down learning. A face is represented by a linear combination of prototypes of shape and texture. With the shape and texture information about the pixels in a given low-resolution facial image, we can estimate optimal coefficients for a linear combination of prototypes of shape and those of texture by solving least square minimization. Then high-resolution facial image can be synthesized by using the optimal coeffcients for linear combination of the high-resolution prototypes.The encouraging results of the proposed method show that our method can be used to increase the performance of the face recognition by applying our method to enhance the low-resolution facial images captured at surveillance systems.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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

low-resolution
image reconstruction
pattern recognition
face reconstruction
image enhancement
morphable face model


Explicit error bounds for lazy reversible Markov chain Monte Carlo We prove explicit, i.e., non-asymptotic, error bounds for Markov Chain Monte Carlo methods, Such as the Metropolis algorithm, The problem is to compute the expectation (or integral) off with respect to a measure pi which can be given by a density rho with respect to another measure. A straight simulation of the desired distribution by a random number generator is in general not possible. Thus it is reasonable to use Markov chain sampling with a burnin. We study such an algorithm and extend the analysis of Lovasz and Simonovits [L Lovasz, M. Simonovits, Random walks in a convex body and an improved Volume algorithm, Random Structures Algorithms 4 (4) (1993) 359-412] to obtain an explicit error bound. (C) 2008 Elsevier Inc. All rights reserved.

B I I O B B B I I I O O O O O O O O B I I 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

markov chain monte carlo
metropolis algorithm
explicit error bounds
reversible
lazy


Some numerical problems in discrete geometry What is the smallest square which contains ten pairwise disjoint congruent open disks of unit diameter? It is conjectured that the minimum side is 3.373.... This paper proves that the side is at least 3.334. (C) 1999 Elsevier Science Ltd. All rights reserved.

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


Urban activity pattern classification using topic models from online geo-location data Geo-location data from social media has potential for activity-travel analysis. Identifies the limitations of geo-location data for activity-based modeling. Adopts a data-driven approach (topic model) for activity pattern classification. Extends the topic model to capture user-specific activity patterns. Extends to account for missing activities a major issue of social media data.

O B I I 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 B I I O O O O O O O O O O O O O O O O O O O B I O

activity pattern classification
social media

activity-based modeling
social computing
location-based data
big data
topic modeling
machine learning


NMR and NQR study of Si-doped (6,0) zigzag single-walled aluminum nitride nanotube as n or P -semiconductors Density functional theory (DFT) calculations were performed to investigate the electronic structure properties of pristine and Si-doped aluminum nitride nanotubes as n or P-semiconductors at the B3LYP/6-31G* level of theory in order to evaluate the influence of Si-doped in the (6,0) zigzag AlNNTs. We extended the DFT calculation to predict the electronic structure properties of Si-doped aluminum nitride nanotubes, which are very important for production of solid-state devices and other applications. To this aim, pristine and Si-doped AlNNT structures in two models (Si-N and Si-Al) were optimized, and then the electronic properties, the isotropic (CSI) and anisotropic (CSA) chemical shielding parameters for the sites of various Al-27 and N-14 atoms, NQR parameters for the sites of various of Al-27 and N-14 atoms, and quantum molecular descriptors were calculated in the optimized structures. The optimized structures, the electronic properties, NMR and NQR parameters, and quantum molecular descriptors for the Si-N and Si-Al models show that the Si-N model is a more reactive material than the pristine or Si-Al model.

B 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 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 B 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 B 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 O B 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

aluminum nitride nanotubes
quantum molecular descriptors
dft
nmr
nqr


On Nakhleh's Metric for Reduced Phylogenetic Networks We prove that Nakhleh's metric for reduced phylogenetic networks is also a metric on the classes of tree-child phylogenetic networks, semibinary tree-sibling time consistent phylogenetic networks, and multilabeled phylogenetic trees. We also prove that it separates distinguishable phylogenetic networks. In this way, it becomes the strongest dissimilarity measure for phylogenetic networks available so far. Furthermore, we propose a generalization of that metric that separates arbitrary phylogenetic networks.

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

biology and genetics
graph algorithms
network problems


The EVE approach: View synchronization in dynamic distributed environments The construction and maintenance of data warehouses (views) in large-scale environments composed of numerous distributed and evolving information sources (ISs) such as the WWW has received great attention recently. Such environments are plagued with changing information because ISs tend to continuously evolve by modifying not only their content but also their query capabilities and interface and by joining or leaving the environment at any time. We are the first to introduce and address the problem of schema changes of ISs, while previous work in this area, such as incremental view maintenance, has mainly dealt with data changes at ISs. In this paper, we outline our solution approach to this challenging new problem of how to adapt views in such evolving environments. We identify a new view adaptation problem for view evolution in the context of ISs schema changes, which we call View Synchronization. We also outline the Evolvable View Environment (EVE) approach that we propose as framework for solving the view synchronization problem, along with our decisions concerning the key design issues surrounding EVE. The main contributions of this paper are: 1) we provide an E-SQL view definition language with which the view definer can direct the view evolution process, 2) we introduce a model for information source description which allows a large class of ISs to participate in our system dynamically, 3) we formally define what constitutes a legal view rewriting, 4) we develop replacement strategies for affected view components which are designed to meet the preferences expressed by E-SQL, 5) we prove the correctness of the replacement strategies, and 6) we provide a set of view synchronization algorithms based on those strategies. A prototype of our EVE system has successfully been built using Java, JDBC, Oracle, and MS Access.

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 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 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 I 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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

data warehouses
view maintenance
view adaptation
view synchronization
evolving information sources

query rewriting
view definition language distributed
and source evolution.


Solving the likelihood equations Given a model in algebraic statistics and data, the likelihood function is a rational function on a projective variety. Algebraic algorithms are presented for computing all critical points of this function, with the aim of identifying the local maxima in the probability simplex. Applications include models specified by rank conditions on matrices and the Jukes-Cantor models of phylogenetics. The maximum likelihood degree of a generic complete intersection is also determined.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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

maximum likelihood degree
syzygies
phylogenetic trees


crossed lines This paper provides a brief description of the interactive film Crossed Lines .

telephone interface
interactive story
interactive narrative
interactive video
interactive drama


An improved approach to find membership functions and multiple minimum supports in fuzzy data mining Fuzzy mining approaches have recently been discussed for deriving fuzzy knowledge. Since items may have their own characteristics, different minimum supports and membership functions may be specified for different items. In the past, we proposed a genetic-fuzzy data-mining algorithm for extracting minimum supports and membership functions for items from quantitative transactions. In that paper. minimum supports and membership functions of all items are encoded in a chromosome Such that it may be not easy to converge. In this paper, an enhanced approach is proposed, which processes the items in a divide-and-conquer strategy. The approach is called divide-and-conquer genetic-fuzzy mining algorithm for items with Multiple Minimum Supports (DCFMMS), and is designed for finding minimum supports, membership functions, and fuzzy association rules. Possible solutions are evaluated by their requirement satisfaction divided by their suitability of derived membership functions. The proposed GA framework maintains multiple populations, each for one item's minimum support and membership functions. The final best minimum supports and membership functions in all the populations are then gathered together to be used for mining fuzzy association rules. Experimental results also show the effectiveness of the proposed approach. (C) 2009 Elsevier Ltd. All rights reserved.

O O O O O B I O B I 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 B I 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 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 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 B I 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

data mining
multiple minimum supports
membership functions

fuzzy set
genetic algorithm
genetic-fuzzy mining


Encoding and Constructing 1-Nested Phylogenetic Networks with Trinets Phylogenetic networks are a generalization of phylogenetic trees that are used in biology to represent reticulate or non-treelike evolution. Recently, several algorithms have been developed which aim to construct phylogenetic networks from biological data using triplets, i.e. binary phylogenetic trees on 3-element subsets of a given set of species. However, a fundamental problem with this approach is that the triplets displayed by a phylogenetic network do not necessarily uniquely determine or encode the network. Here we propose an alternative approach to encoding and constructing phylogenetic networks, which uses phylogenetic networks on 3-element subsets of a set, or trinets, rather than triplets. More specifically, we show that for a special, well-studied type of phylogenetic network called a 1-nested network, the trinets displayed by a 1-nested network always encode the network. We also present an efficient algorithm for deciding whether a dense set of trinets (i.e. one that contains a trinet on every 3-element subset of a set) can be displayed by a 1-nested network or not and, if so, constructs that network. In addition, we discuss some potential new directions that this new approach opens up for constructing and comparing phylogenetic networks.

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 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 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 B O O B O O O O O O O O O O O B I 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 O O O O O O O O O O O O O O O O O


Automatic 3D model reconstruction of cutting tools from a single camera Collision detection by machining simulation requires the 3D models of rotating cutters. However, the 3D models of a cutter and holder are not always available. In this paper, a new method is proposed to design an automatic vision-based 3D modeling system, which is able to quickly reconstruct the 3D model of a cutter and holder when they are installed onto the spindle. Only a single camera is mounted on the machine tool to capture the image of the rotating cutter and holder. By viewing the rotating cutter and holder as an object of surface of revolution, the contour of the imaged cutter and holder can be used to reconstruct the 3D model as a stack of circular cross-sections. Then the complete generating function of the cutter and holder can be recovered from the cross-sections. Finally, the 3D model of the cutter is built by rotating the generating function around the spindle axis. The effectiveness and accuracy of the proposed method are verified by experiments on-machine using 12 kinds of cutters and holders, which can satisfy the requirement of collision detection. (c) 2010 Elsevier B.V. All rights reserved.

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 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


Short-term planning and scheduling in multipurpose batch chemical plants: a multi-level approach This paper deals with short-term planning/scheduling problems when the product demands are driven by customer orders. This type of problem is, in general difficult to be solved, once the orders are subject to changes in short periods. In this paper is proposed a multi-level decomposition procedure, containing at least two levels. At the planning level, demands are adjusted, a raw material delivery plan is defined and a capacity analysis is performed. Therefore, time windows for each operation are defined. At the scheduling level, an MILP model is developed. In order to reduce scheduling problem dimension, it is performed an analysis of equipment contention profile, enabling to model only situations where a decision variable is requested. (C) 2000 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 O O O O O O O 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

short-term planning
scheduling of batch plants


Traveling salesman problem of segments In this paper, we present a polynomial time approximation scheme (PTAS) for a variant of the traveling salesman problem (called segment TSP) in which a traveling salesman tour is sought to traverse a set of n epsilon-separated segments in two dimensional space. Our results are based on an interesting combinatorial result which bounds the total number of entry points in an optimal TSP tour and a generalization of Arora's technique(5) for Euclidean TSP (of a set of points). The randomized version of our algorithm takes O(n(2)(log n)(O(1/e2))) time to compute a (1 + epsilon)-approximation with probability greater than or equal to 1/2, and can be derandomized with an additional factor of O(n(2)).

B I I O O O O O O O O B I I I 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 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

algorithm
traveling salesman problem
polynomial time approximation scheme


Local meshing plane analysis as a source of information about the gear quality In the paper the application of the local meshing plane concept is discussed and applied for detecting of tooth degradation due to fatigue, and for overall gear quality assessment. Knowing the kinematic properties of the machine (i.e. gear tooth numbers) it is possible to modify the diagnostic signal in such a manner that its fragments will be linked to different rotating parts. This allows for presentation of either raw or processed gearbox signal in a form of three dimensional map on the plane pinion teethgear teeth, called local meshing plane. The meshing plane in Cartesian coordinates z1z2 allows for precise location and assessment of gear faults in terms of meshing quality of consecutive tooth pairs. Although the method was applied to simulated signals generated by the gearbox model, similar results were obtained for the measurement signals recorded during the back-to-back test stand experiment. The described method could be used for assessing the manufacturing quality of gears, the assembly quality as well as for the gear failure evaluation during normal exploitation.

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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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

gearbox diagnosis
nonstationary signal
fault diagnosis
gearbox modelling


Improved Cross Authentication Model Based on Threshold Method in Wireless Network A novel cross authentication model is proposed based on (t, n) threshold method in Layered and Grouped Structure (LGS) wireless multi-hop network, the issues of cross authentication and secure communication between nodes in different trusted domains are settled. With no CA, new scheme of cross certificate being issued and validated is designed, by which, the node identification can be authenticated in different trusted domains.

O B I O O O B I O B I 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 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

wireless network
cross authentication
threshold method


On optimal solution error covariances in variational data assimilation problems The problem of variational data assimilation for a nonlinear evolution model is formulated as an optimal control problem to find unknown parameters such as distributed model coefficients or boundary conditions. The equation for the optimal solution error is derived through the errors of the input data (background and observation errors), and the optimal solution error covariance operator through the input data error covariance operators, respectively. The quasi-Newton BFGS algorithm is adapted to construct the covariance matrix of the optimal solution error using the inverse Hessian of an auxiliary data assimilation problem based on the tangent linear model constraints. Preconditioning is applied to reduce the number of iterations required by the BFGS algorithm to build a quasi-Newton approximation of the inverse Hessian. Numerical examples are presented for the one-dimensional convectiondiffusion model.

O B I I I O B I I 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

variational data assimilation
optimal solution error covariances

parameter estimation
hessian preconditioning


Asymptotics for the number of walks in a Weyl chamber of type B We consider lattice walks in confined to the region with fixed (but arbitrary) starting and end points. These walks are assumed to be such that their number can be counted using a reflection principle argument. The main results are asymptotic formulas for the total number of walks of length n with either a fixed or a free end point for a general class of walks as n tends to infinity. As applications, we find the asymptotics for the number of k-non-crossing tangled diagrams as well as asymptotics for two k-vicious walkers models subject to a wall restriction. 2012 Wiley Periodicals, Inc. Random Struct. Alg., 45, 261305, 2014

B 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 B O O O O O O O O O O O O O O O O O O O O


efficient meta-level control in bounded-rational agents An important issue for complex agents operating in open real-time environments is how to sequence execution and computation actions without consuming too many resources. An empirical approach to this meta-level control problem is presented. We show that explicit meta-level control leads to significant improvement in agent performance.

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

action selection and planning
agent architectures
rational agency


Tactile Synthesis and Perceptual Inverse Problems Seen from the Viewpoint of Contact Mechanics A contact-mechanics analysis was used to explain a tactile illusion engendered by straining the fingertip skin tangentially in a progressive wave pattern resulting in the perception of a moving undulating surface. We derived the strain tensor field induced by a sinusoidal surface sliding on a finger as well as the field created by a tactile transducer array deforming the fingerpad skin by lateral traction. We found that the first field could be well approximated by the second. Our results have several implications. First, tactile displays using lateral skin deformation can generate tactile sensations similar to those using normal skin deformation. Second, a synthesis approach can achieve this result if some constraints on the design of tactile stimulators are met. Third, the mechanoreceptors embedded in the skin must respond to the deviatoric part of the strain tensor field and not to its volumetric part. Finally, many tactile stimuli might represent, for the brain, an inverse problem to be solved, such specific examples of "tactile metameres" are given.

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 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

tactile synthesis
contact mechanics
lateral skin deformation

human factors
theory
computational tactile perception
tactile transducers arrays
tactile sensing
haptics


A simplified variable step-size LMS algorithm for Fourier analysis and its statistical properties ? A simplified VSS-LMS (SVSS-LMS) algorithm is proposed for Fourier analysis. Its performance is comparable to most of the seven typical VSS-LMS algorithms. In-depth performance analysis is provided for the proposed algorithm. Simulations are conducted to confirm the performance and the analytical 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 B I O O O O O O O O O O O O O O O O O

adaptive fourier analyzer
discrete fourier coefficient (dfc)
variable step-size (vss) lms
convergence


Streamlining long latency instructions for seamlessly combined out-of-order and in-order execution In the current day wide-issue processors, the size of the instruction scheduling window (also called Issue Queue (IQ)) is limited mainly by the hardware complexity to design the logic, and thus limits the number of instructions scanned every cycle to extract instruction level parallelism (ILP). To exacerbate the problems, instructions depending on long latency load operations continue to reside in the IQ until their source operands are ready. Thus, such delayed instructions block any new instructions from entering the IQ even if potentially they are ready for execution. The growing disparity in processor and memory speeds is further aggravating the delay in dislodging instructions from IQ. To alleviate the problem, in this paper we propose a novel technique to streamline instructions in separate buffers according to the chain of dependencies. Each instruction is streamlined behind a parent instruction while it waits for the source operand to be supplied by the long latency memory operations. These instructions are segregated from the IQ and thus the pressure on IQ is relieved which enables flow of potentially executable instructions in the pipeline. Our analysis of SPEC2000 programs reveals that instructions dependent on load cache misses or their dependents, typically have their first source operand ready within 515% of their total wait time in the IQ. Based on the observations, the long latency memory dependent instructions are streamlined into in-order buffers when their first operand is ready. In the proposed architecture, instructions from both the conventional IQ and the heads of the streamline buffers can be selected for execution, while the wakeup logic complexity remains same as in the conventional design. Our results show that the performance speedup of 32-entry IQ supplemented by 32 in-order buffers is 15.7% and 2% for FP and integer benchmark respectively, which is very much comparable to that of a conventional 64-entry IQ. A 64-entry IQ design can gain performance over a 32-entry IQ, albeit with a large overhead in circuit delay complexity of wakeup logic, while streamline buffers can gain performance over 32-entry IQ without any such overhead.

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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 B I O O O O O O O O O O

long latency instructions
streamline buffers

wide-issue processors
dynamic scheduling
out-of-order processing


On topological properties of the Choquet weak convergence of capacity functionals of random sets In view of the recent interests in random sets in information technology, such as models for imprecise data in intelligent systems, morphological analysis in image processing, we present, in this paper, some contributions to the foundation of random set theory, namely, a complete study of topological properties of capacity functionals of random sets, generalizing weak convergence of probability measures. These results are useful for investigating the concept of Choquet weak convergence of capacity functionals leading to tractable criteria for convergence in distribution of random sets. The weak topology is defined on the space of all capacity functionals on R. We show that this topological space is separable and metrizable. (C) 2006 Elsevier Inc. All rights reserved.

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 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

random closed set
capacity functional
choquet integral


Improving the characterization of the alternative hypothesis via minimum verification error training with applications to speaker verification Speaker verification is usually formulated as a statistical hypothesis testing problem and solved by a log-likelihood ratio (LLR) test. A speaker verification system's performance is highly dependent on modeling the target speaker's voice (the null hypothesis) and characterizing non-target speakers voices (the alternative hypothesis). However, since the alternative hypothesis involves unknown impostors, it is usually difficult to characterize a priori. In this paper, we propose a framework to better characterize the alternative hypothesis with the goal of optimally distinguishing the target speaker from impostors. The proposed framework is built on a weighted arithmetic combination (WAC) or a weighted geometric combination (WGC) of useful information extracted from a set of pre-trained background models. The parameters associated with WAC or WGC are then optimized using two discriminative training methods, namely, the minimum verification error (MVE) training method and the proposed evolutionary MVE (EMVE) training method, such that both the false acceptance probability and the false rejection probability are minimized. Our experiment results show that the proposed framework outperforms conventional LLR-based approaches.

O O O O O O O O B I I I O O O B I B I O O O O O O B I 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

hypothesis testing
minimum verification error training
speaker verification


Derivation of a simplified relation for assessing aortic root pressure drop incorporating wall compliance Aging and some pathologies such as arterial hypertension, diabetes, hyperglycemia, and hyperinsulinemia cause some geometrical and mechanical changes in the aortic valve microstructure which contribute to the development of aortic stenosis (AS). Because of the high rate of mortality and morbidity, assessing the impact and progression of this disease is essential. Systolic transvalvular pressure gradient (TPG) and the effective orifice area are commonly used to grade the severity of valvular dysfunction. In this study, a theoretical model of the transient viscous blood flow across the AS is derived by taking into account the aorta compliance. The derived relation of the new TPG is expressed in terms of clinically available surrogate variables (anatomical and hemodynamic data). The proposed relation includes empirical constants which need to be empirically determined. We used a numerical model including an anatomically 3D geometrical model of the aortic root including the sinuses of Valsalva for their identification. The relation was evaluated using clinical values of pressure drops for cases for which the modified Gorlin equation is problematic (low flow, low gradient AS).

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 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

aortic stenosis
aortic valve
pathologies

pressure gradient relation
three-dimensional global model
fluidstructure interaction


application and statistic testing of the 5-adic summation-shrinking generator The paper describes the software application of a scheme of stream cipher named N-adic Summation-Shrinking Generator (NSumSG). The statistic testing proves the pseudo-randomness of the output bits of the NSumSG and applicability of the NSumSG as a real stream cipher.

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 I O O O O O O O O O O O O O O O O O O O O

pseudorandom generator
encryption and decryption


Shared buffer implementations of signal processing systems using lifetime analysis techniques There has been a proliferation of block-diagram environments fur specifying and prototyping digital signal processing (DSP) systems. These include tools from academia such as Ptolemy and commercial tools such as DSPCanvas from Angeles Design Systems, signal processing work system (SPW) from Cadence, and COSSAP from Synopsys, The block diagram languages used in these environments are usually based on dataflow semantics because various subsets of dataflow have proven to be good matches for expressing and modeling signal processing systems. In particular, synchronous dataflow (SDF) has been found to be a particularly good match for expressing multirate signal processing systems. One of the key problems that arises during synthesis from an SDF specification is scheduling. Past work on scheduling from SDF has focused on optimization of program memory and buffer memory under a model that did not exploit sharing opportunities. In this paper, we build on our previously developed analysis and optimization framework for looped schedules to formally tackle the problem of generating optimally compact schedules for SDF graphs. We develop techniques for computing these optimally compact schedules in a manner that also attempt to minimize buffering memory under the assumption that buffers will be shared. This results in schedules whose data memory usage is drastically lower than methods in the past have achieved. The method we use is that of lifetime analysis; we develop a model for buffer lifetimes in SDF graphs and develop scheduling algorithms that attempt to generate schedules that minimize the maximum number of live tokens under the particular buffer lifetime model. We develop several efficient algorithms for extracting the relevant lifetimes from the SDF schedule. We then use the well-known firstfit heuristic for packing arrays efficiently into memory. We report extensive experimental results on applying these techniques to several practical SDF systems and show improvements that average 50% over previous techniques, with some systems exhibiting up to an 53% improvement over previous techniques.

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 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 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

dynamic programming dynamic storage allocation


Graphical User Interfaces for Business Information Systems Proponents of computer graphics foresee them having a dramatic impact on decision maker productivity. The availability of inexpensive graphic computer technology permits organizations to rely extensively on graphics for standard information presentations. Despite the claims of the proponents, however, there is little substantial evidence linking the use of graphics with increased management productivity and/or higher quality decisions. Moreover, the use of powerful graphics capabilities by end users, unskilled in graphics design, presents the likelihood that information presentations will suffer rather than improve as computer generated graphics grow in popularity. This article discusses typical and atypical applications of computer graphics for presenting business information. Existing evidence relating the use of graphics with improvements in user productivity is discussed. Much of the article is focused on computer graphics design within the organization including: who should do design, the conceptual foundations of good graphics design, and a set of guidelines and cautions applicable to the design of quality graphics. The article concludes with a list of suggested research topics.

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 O B 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 B O O O O 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 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 B O O O O O O O O O O

user interface
interface
human information processing
spatial management
icons
color
graphic design
dual brain
mis
graphics research
business charts


a program stability measure This paper contributes to the understanding of program structures in terms of its stability and reliability in a quantitative sense. Distinctions are made between the logical structure of a program and the information structure of a program. The general characteristics of a good program will not be discussed in this paper other than citing relevent references. The term stability is defined as the resistance to the amplification of changes that has been made to a given program. The information structure of a program is based on the sharing of information between the components of the program.

O O B O O B 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 O O O O O O B O O O O B 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 O O O O O O B O O O O O O O B O O O O O O O O

sharing stability general structure paper reliability

measurement understandability informal change component


Real-time recognition of cyclic strings by one-way and two-way cellular automata This paper discusses real-time language recognition by 1-dimensional one-way cellular automata (OCAs) and two-way cellular automata (CAs), focusing on limitations of the parallel computation power. To clarify the limitations, we investigate real-time recognition of cyclic strings of the form u(k) with u is an element of {0, 1}(+) and k greater than or equal to 2. We show a version of pumping lemma for recognizing cyclic strings by OCAs, which can be used for proving that several languages are not recognizable by OCAs in real time. The paper also discusses the real-time language recognition of CAs by prefix and postfix computation, in which every prefix or postfix of an input string is also accepted, if the prefix or postfix is in the language. It is shown that there are languages L subset of or equal to Sigma(+) such that L is not recognizable by OCA in real-time and the reversal of L and the concatenation LSigma* are recognizable by CA in real-time.

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 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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

parallel language recognition
prefix recognition


Bayesian estimation of Dirichlet mixture model with variational inference An analytically tractable solution for Bayesian estimation of the Dirichlet mixture model. Relative convexity of the multivariate log-inverse-gamma function is proved and utilized. The free energy function is approximated by a single lower-bound to guarantee convergence. The method outperforms the ML based method and the VI based method, moreover, it is comparable to the sampling based method. The performances are demonstrated with important multimedia signal processing applications.

B I O O O O O B I 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

bayesian estimation
variational inference
relative convexity

extended factorized approximation
dirichlet distribution
gamma prior
mixture modeling
lsf quantization
multiview depth image enhancement


assessing regret-based preference elicitation with the utpref recommendation system Product recommendation and decision support systems must generally develop a model of user preferences by querying or otherwise interacting with a user. Recent approaches to elicitation using minimax regret have proven to be very powerful in simulation. In this work, we test both the effectiveness of regret-based elicitation, and user comprehension and acceptance of minimax regret in user studies. We report on a study involving 40 users interacting with the UTPref Recommendation System, which helps students navigate and find rental accommodation. UTPref maintains an explicit (but incomplete) generalized additive utility (GAI) model of user preferences, and uses minimax regret for recommendation. We assess the following general questions: How effective is regret-based elicitation in finding optimal or near-optimal products? Do users understand and accept the minimax regret criterion in practice? Do decision-theoretically valid queries for GAI models result in more accurate assessment than simpler, ad hoc queries? On the first two issues, we find that the minimax regret decision criterion is effective, understandable, and intuitively appealing. On the third issue, we find that simple, semantically ambiguous query types perform as well as more demanding, semantically valid queries for GAI models. We also assess the relative difficulty of specific query types.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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


Fast algorithms for uniform semi-unification Uniform semi-unification is a simple combination of matching and unification defined as follows: given two terms s and t, do there exist substitutions ? and ? such that s??=t?? We present two algorithms for this problem based on Huets unification closure method, one producing (possibly) non-principal solutions, and one producing principal solutions. For both we provide a precise analysis of correctness and asymptotic complexity. Under the uniform cost RAM model (counting assignment, comparison, and arithmetic operations as primitive) our first algorithm is asymptotically as fast as Huets method, O(n?(n)), where ? is the functional inverse of Ackermanns function. Under a model which counts assignments and comparisons of pointers, and arithmetic operations on bits, the cost is O(n2?(n)2). Producing principal solutions is more complex, however, and our second algorithm runs in O(n2?(n)2) and under these two models.

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 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


Star-free languages are Church-Rosser congruential The class of Church-Rosser congruential languages has been introduced by McNaughton, Narendran, and Otto in 1988. A language L is Church-Rosser congruential (belongs to CRCL), if there is a finite, confluent, and length-reducing semi-Thue system S such that L is a finite union of congruence classes modulo S. To date, it is still open whether every regular language is in CRCL. In this paper, we show that every star-free language is in CRCL. In fact, we prove a stronger statement: for every star-free language L there exists a finite, confluent, and subword-reducing semi-Thue system S such that the total number of congruence classes modulo S is finite and such that L is a union of congruence classes modulo S. The construction turns out to be effective. (C) 2012 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

string rewriting
church-rosser system
star-free language
aperiodic monoid
local divisor


Bisection algorithms for approximating quadratic Bezier curves by G(1) are splines To describe the tool path of a CNC machine, it is often necessary to approximate curves by G(1) arc splines with the number of are segments as small as possible. Ahn et al. have proposed an iterative algorithm for approximating quadratic Bezier curves by G(1) are splines with fewer are segments than the biarc method. This paper gives the formula of the upper bound for are segments used by their algorithm. Based on the formula, two kinds of bisection algorithms for approximating quadratic Bezier curves by G(1) arc splines are presented. Results of some examples illustrate their efficiency. (C) 2000 Elsevier Science Ltd. All rights reserved.

B I O O B I I O O O O O O O O O O O B 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 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 B I O O B I I O O B I O O O O O O O O O O O O O O O O O

cnc
quadratic bezier curves
arc splines
bisection algorithms


Cloud covering denoising through image fusion ? This paper presents a solution to the cloud removal problem, based in a recently developed image fusion methodology consisting in applying a 1-D pseudo-Wigner distribution (PWD) transformation to the source images and on the use of a pixel-wise cloud model. Both features could also be interpreted as a denoising method centered in a pixel-level measure. Such procedure is able to process sequences of multi-temporal registered images affected with spatial-variant noise. The goal consists in providing a 2-D clean image, after removing the spatial-variant noise disturbing the set of multi-temporal registered source images. This is achieved by taking as reference a statistically parameterized model of a cloud prototype. Using this model, a pixel-wise measure of the noise degree of the source images can be calculated through their PWDs. This denoising procedure enables to choose the noise-free pixels from the set of given source images. The applicability of the method to the cloud removal paradigm is illustrated with different sets of artificial and natural cloudy or foggy images, partially occluded by clouds in different regions. Another advantage of the present approach is its reduced computational cost, once the 1-D case has been preferred instead of a full 2-D implementation of the PWD.

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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Neural network for the prediction and supplement of tidal record in Taichung Harbor, Taiwan Accurate tidal prediction and supplement is an important task in determining constructions and human activities in coastal and oceanic areas. The harmonic tidal level is conventionally used to predict tide levels. However, determination of the tidal components using the spectral analysis requires a long-term tidal level record (more than one year [Handbook of coastal and ocean engineering 1 (1990) 534]). In addition, calculating the coefficients abbreviated of tide component using the least-squares method also requires a large database of tide measurements. This paper presents an application of the artificial neural network for predicting and supplementing the long-term tidal-level using the short term observed data. On site, tidal-level data at Taichung Harbor in Taiwan will be used to test the performance of the artificial neural network model. The results show that the tidal levels over a long duration can be efficiently predicted or supplemented using only a short-term tidal record.

O O O O 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 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 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 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

tidal prediction and supplement
spectral analysis
artificial neural network


Generalized River Crossing Problems Three men, each with a sister, must cross a river using a boat that can carry only two people in such a way that a sister is never left in the company of another man if her brother is not present. This very famous problem appeared in the Latin book Problems to Sharpen the Young, one of the earliest collections of recreational mathematics. This paper considers a generalization of such river crossing problems and provides a new formulation that can treat wide variations. The main result is that, if there is no upper bound on the number of transportations (river crossings), a large class of subproblems can be solved in polynomial time even when the passenger capacity of the boat is arbitrarily large. The authors speculated this fact at FUN 2012. On the other hand, this paper also demonstrates that, if an upper bound on the number of transportations is given, the problem is NP-hard even when the boat capacity is three, although a large class of subproblems can be solved in polynomial time if the boat capacity is two.

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 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

polynomial-time algorithms
np-hard
graphs
edgeexpansion
reachability
hypercube


Bag of words for semantic automatic medical image annotation A medical report contains many elements such as medical images accompanied by text descriptions. We present in this paper a new approach for semantic automatic annotation of medical images. The proposed approach uses the bag of words model to represent the visual content of the medical image combined with text descriptors based on term frequencyinverse document frequency technique and reduced by latent semantic to extract the co-occurrence between text and visual terms. In a first phase, we are interested in indexing texts and extracting all relevant terms using a thesaurus containing medical subject headings and concepts. In a second phase, medical images are indexed while recovering areas of interest which are invariant to change in scale such as light and tilt. To annotate a new medical image, we use the bag of words model to recover the feature vector. Indeed, we use the vector space model to retrieve similar medical images from the training database. The computation of the relevance value of an image according to a query image is based on the cosine function. To evaluate the performance of our proposed approach, we present an experiment carried out on five types of radiological imaging. The results showed that our approach works efficiently, especially with more images taken from the radiology of the skull.

B I I 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 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 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 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 B O O O

automatic medical image annotation
radiology
latent semantic
bag of words


PXR ligand classification model with SFED-weighted WHIM and CoMMA descriptors Understanding which type of endogenous and exogenous compounds serve as agonists for the nuclear pregnane X receptor (PXR) would be valuable for drug discovery and development, because PXR regulates a large number of genes related to xenobiotic metabolism. Although several models have been proposed to classify human PXR activators and non-activators, models with better predictability are necessary for practical purposes in drug discovery. Grid-weighted holistic invariant molecular (G-WHIM) and comparative molecular moment analysis (G-CoMMA) type 3D descriptors that contain information about the solvation free energy of target molecules were developed. With these descriptors, prediction models built using decision tree (DT)-, support vector machine (SVM)-, and Kohonen neural network (KNN)-based models exhibited better predictability than previously proposed models. Solvation free energy density-weighted G-WHIM and G-CoMMA descriptors reveal new insights into PXR ligand classification, and incorporation with machine learning methods (DT, SVM, KNN) exhibits promising results, especially SVM and KNN. SVM- and KNN-based models exhibit accuracy around 0.90, and DT-based models exhibit accuracy around 0.8 for both the training and test sets.

O O O O O O B O B 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 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

pregnane x receptor
whim
comma
machine learning


Graphical

interactive

generation

of

gravity

and

magnetic

fields

This

paper

presents

a

MATLAB

(R)

based

geopotential

field

generator

called

GamField

that

constructs

and

visualizes

subsurface

sources

in

space

and

computes

their

gravity

and

magnetic

effects.

GamField

also

computes

anomaly

gradients

and

remanent

magnetization

effects.

The

user

inputs

Cartesian

prisms

along

with

their

physical

properties

to

fabricate

subsurface

sources.

Examples

illustrating

the

utility

of

GamField

for

synthetic

anomaly

generation

of

gravity

and

magnetic

fields

are

shown.

(C)

Elsevier

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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

gravity anomaly computation
magnetic anomaly computation
matlab (r)


3D-freehand-pose initialization based on operator's cognitive behavioral models Tracking, recognition and interaction based on 3D freehand are a part of our virtual assembly system, in which monocular camera is used to input online freehand videos and the hand pose tracker requires a reliable initial pose in the first frame. A novel approach to initializing 3D pose and position of freehand is put forward in this paper visualization of 3D hand model and modeling the operators' cognitive behaviors. Our approach is composed of three phases: hand posture recognition, coarse-tuning and fine-tuning. The operator moves his/her hand onto the to meet the needs of our virtual assembly system. The main contribution of this paper is that the three core techniques are for the first time integrated together, including human-computer interaction (HCI) in the process of initializing, projection of the 3D hand model in the period of coarse-tuning time. Then, the computer repeatedly fine-tunes the 3D hand model until the projection of the 3D hand model is completely superimposed onto the operator's hand image. We focus on exploring and modeling cognitive behavior of operator's hand upon which we design our initialization algorithm. Our research shows that cognitive behavioral models are not only beneficial to reducing cognitive loads for operators, because it makes the computers cater for the changes of the operators' hand poses, but also helpful to address high dimensionality of articulated 3D hand model. Our experimental results also show that the approach presented in this paper is easier, more pleasurable and satisfactory experience for the operators. Our initialization system has successfully been applied to our 3D freehand tracking system and a simulation virtual assembly system.

O B 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 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 B 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 B O O O O O O O O O O O O O O O O O

initialization
visualization
cognitive behavioral models

3d freehand pose model
features extraction


Package Fingerprints: A visual summary of package interface usage Object-oriented languages such as Java, Smalltalk, and C++ structure their programs using packages. Maintainers of large systems need to understand how packages relate to each other, but this task is complex because packages often have multiple clients and play different roles (class container, code ownership, etc.). Several approaches have been proposed, among which the use of cohesion and coupling metrics. Such metrics help identify candidate packages for restructuring; however, they do not help maintainers actually understand the structure and interrelationships between packages. In this paper, we use pre-attentive processing as the basis for package visualization and see to what extent it could be used in package understanding. We present the Package Fingerprint, a 2D visualization of the references made to and from a package. The proposed visualization offers a semantically rich, but compact and zoomable views centered on packages. We focus on two views (incoming and outgoing references) that help users understand how the package under analysis is used by the system and how it uses the system. We applied these views on four large systems: Squeak, JBoss, Azureus, and ArgoUML. We obtained several interesting results, among which, the identification of a set of recurring visual patterns that help maintainers: (a) more easily identify the role of and the way a package is used within the system (e.g., the package under analysis provides a set of layered services), and (b) detect either problematic situations (e.g., a single package that groups together a large number of basic services) or opportunities for better package restructuring (e.g., removing cyclic dependencies among packages). The visualization generally scaled well and the detection of different patterns was always possible. The proposed visualizations and patterns proved to be useful in understanding and maintaining the different systems we addressed. To generalize to other contexts and systems, a real user study is required.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 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 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 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


Framework for integrated mechanical design automation ? Engineering design is an iterative process with a fundamental need for the consistent management and propagation of product dependencies. Constraint-based design provides a unified framework to meet this critical need, but there are known issues due to the complexity of the problem within three-dimensional space. This paper presents results from a decade of research into graph theory and numerical solution techniques to address issues such as user comprehension and multiplicity of solutions. The proposed solution, Extended Variational Design Technology (VGX), utilizes an innovative Drag and Drop user interaction paradigm to improve comprehension performance, and usability. It is also demonstrated that VGX technology can provide common mathematical foundation to support flexible and integrated product design, assembly and analysis.

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

three-dimensional constraint-based product design


efficient multiple-click models in web search Many tasks that leverage web search users' implicit feedback rely on a proper and unbiased interpretation of user clicks. Previous eye-tracking experiments and studies on explaining position-bias of user clicks provide a spectrum of hypotheses and models on how an average user examines and possibly clicks web documents returned by a search engine with respect to the submitted query. In this paper, we attempt to close the gap between previous work, which studied how to model a single click, and the reality that multiple clicks on web documents in a single result page are not uncommon. Specifically, we present two multiple-click models: the independent click model (ICM) which is reformulated from previous work, and the dependent click model (DCM) which takes into consideration dependencies between multiple clicks. Both models can be efficiently learned with linear time and space complexities. More importantly, they can be incrementally updated as new click logs flow in. These are well-demanded properties in reality. We systematically evaluate the two models on click logs obtained in July 2008 from a major commercial search engine. The data set, after preprocessing, contains over 110 thousand distinct queries and 8.8 million query sessions. Extensive experimental studies demonstrate the gain of modeling multiple clicks and their dependencies. Finally, we note that since our experimental setup does not rely on tweaking search result rankings, it can be easily adopted by future studies.

O O O O B B O O O O B B B B I O O O O O O B O B 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 O B O O O O O O B O O B O O O O O 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 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 B 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 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 O O O 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 B O O O O O O O O B O

implicit feedback
web
model
paper
user
search
dependencies
users
space
interpretation
data
flow
demonstrate
queries
future
query

statistical models
paging
efficiency
experience
timing
bias
evaluation
posit
eye tracking
experimentation
search engine
click log analysis
web search
documentation


Extracting role hierarchies from authentication data flows Current Web-based applications use XML-based formats to represent user descriptions exchanged between parties of a distributed computation. This paper introduces some techniques for extracting frequent patterns of user attributes from this XML flow. Then, patterns are used for bottom-up construction of a role ontology, which is then passed to an ontology engineer for a final pruning. The result is a user ontology built by combining topdown and bottom-up approaches, supporting extraction and validation of knowledge about 'typical' users particularly suitable for fine grained access control applications.

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 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


Leveraging Zipf's Law for Traffic Offloading Internet traffic has Zipf-like properties at multiple aggregation levels. These properties suggest the possibility of offloading most of the traffic from a complex controller (e.g., a software router) to a sitnple forwarder (e.g., a commodity switch), by letting the forwarder handle a very limited set of flows; the heavy hitters. As the volume of traffic from a set of flows is highly dynamic, maintaining a reliable set of heavy hitters over time is challenging. This is especially true when we face a volume limit in the non-offloaded traffic in combination with a constraint in the size of the heavy hitter set or its rate of change. We propose a set selection strategy that takes advantage of the properties of heavy hitters at different time scales. Based on real Internet traffic traces, we show that our strategy is able to offload most of the traffic while limiting the rate of change of the heavy hitter set, suggesting the feasibility of alternative router designs.

O O O O O O O O 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 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 O O 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

software defined network
design
measurement
performance


Prediction of workpiece elastic deflections under cutting forces in turning One of the problems faced in turning processes is the elastic deformation of the workpiece due to the cutting forces resulting in the actual depth of cut being different than the desirable one. In this paper, a cutting mechanism is described suggesting that the above problem results in an over-dimensioned part. Consequently, the problem of determining the workpiece elastic deflection is addressed from two different points of view. The first approach is based on solving the analytical equations of the elastic line, in discretized segments of the workpiece, by considering a stored modal energy formulation due to the cutting forces. Given the mechanical properties of the workpiece material, the geometry of the final part and the cutting force values, this numerical method can predict the elastic deflection. The whole approach is implemented through a Microsoft Excel workbook. The second approach involves the use of artificial neural networks (ANNs) in order to develop a model that can predict the dimensional deviation of the final part by correlating the cutting parameters and certain workpiece geometrical characteristics with the deviations of the depth of cut. These deviations are calculated with reference to final diameter values measured with precision micrometers or on a CMM. The verification of the numerical method and the development of the ANN model were based on data gathered from turning experiments conducted on a CNC lathe. The results support the proposed cutting mechanism. The numerical method qualitatively agrees with the experimental data while the ANN model is accurate and consistent in its predictions.

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 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 B I 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 O 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 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

elastic deflection
cutting forces
elastic line
artificial neural networks


Adaptive response time control for metadata matching in information dissemination systems ? Information dissemination is of increasing importance to our society. Existing work mainly focuses on delivering information from sources to sinks in a timely manner based on established subscriptions, with the assumption that those subscriptions are persistent. However, the bottleneck of many information dissemination systems is actually the matching process to continuously reevaluate such subscriptions between numerous sources and numerous sinks, in response to dynamically varying information attributes at runtime. In this paper, we propose an adaptive control architecture to meet the response time constraints on metadata matching in an example information dissemination system. Our adaptive controller features a rigorous design based on well-established control theory for guaranteed control accuracy and system stability. Furthermore, our controller can adapt to changes in the system model without reconfiguration and profiling. Empirical results on a physical testbed demonstrate that our controller has more accurate control and improved system quality of service than both an open-loop solution and a typical heuristic solution.

O B I 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 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 B I O O O O B I 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

information dissemination
response time
metadata matching
adaptive control


Modelling analysis of human optic nerve fibre excitation based on experimental data The aim of the study is to determine which of the existing myelinated mammalian nerve fibre models better fits experimental data resulting from electrical stimulation of the human optic nerve and from propagation velocity measured on primates. The macroscopic electric potential is computed in a 3D, inhomogeneous and anisotropic nerve model. The Chiu-Sweeney (CS) and the Schwarz-Wesselink (SW) membrane descriptions are then considered. Variations in parameters that are not well established (encapsulation-tissue thickness, nerve-fascicle conductivity, geometric and electrochemical fibre cable parameters) are taken into account Results demonstrate that the SW model predictions are in better agreement with the experimental data than those of the CS model, although thresholds are still too high. When channel densities are varied, the SW model turns out to be more robust than the CS model. For a suitable leakage channel density value (about 8% of the original one), the SW model predicts a conduction velocity of 11.4 ms(-1) and an excitation threshold of 0.055 mA (for 0.1 ms pulse duration), which is in very good agreement with experimental values (11 ms(-1) and 0.055 mA). Potassium current in the SW model is necessary for stability. Introduction of a potassium-like current can restore stability in the CS system.

O O O B 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 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

self-sizing spiral cuff electrode
finite elements method
fibre model


Interactive examination of surface quality on car bodies The use of reflection lines and specular high lights for the quality control of car body surfaces is an important issue in the development process of a car. The interactive examination is based on standard graphics tools such as the SceneViewer of OpenInventor which simulates reflection lines by using striped environment maps. The interpolation of texturing and shading values is critical and requires high quality meshes. Thus, element shape and size are essential. In this paper we present a new technique for the tessellation of trimmed surfaces. The result of the algorithm is a 2-manifold mesh with a low triangle count and a triangulation pattern which is best suited for the visualization.

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

nurbs surfaces
mesh generation
hardware supported quality control


Design and simulation of a GaN/AlGaN quantum cascade laser for terahertz emission Our study indicates that there are significant advantages in developing THz quantum cascade lasers (QCLs) with GaN-based quantum well (QW) structures. While the ultrafast longitudinal optical (LO) phonon scattering in AlGaN/GaN QWs can be used for the rapid depopulation of the lower laser state, the large LO-phonon energy (?90meV) can effectively reduce the thermal population of the lasing states. Our investigation shows that GaN-based THz QCLs can potentially be operating cw at room temperature.

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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 cascade laser
terahertz emission


A decision aid for intensity-modulated radiation-therapy plan selection in prostate cancer based on a prognostic Bayesian network and a Markov model The prognosis of cancer patients treated with intensity-modulated radiation-therapy (IMRT) is inherently uncertain, depends on many decision variables, and requires that a physician balance competing objectives: maximum tumor control with minimal treatment complications. In order to better deal with the complex and multiple objective nature of the problem we have combined a prognostic probabilistic model with multi-attribute decision theory which incorporates patient preferences for outcomes. The response to IMRT for prostate cancer was modeled. A Bayesian network was used for prognosis for each treatment plan. Prognoses included predicting local tumor control, regional spread, distant metastases, and normal tissue complications resulting from treatment. A Markov model was constructed and used to calculate a quality-adjusted life-expectancy which aids in the multi-attribute decision process. Our method makes explicit the tradeoffs patients face between quality and quantity of life. This approach has advantages over current approaches because with our approach risks of health outcomes and patient preferences determine treatment decisions.

O O O O O O O O O B I 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 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 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

bayesian network
markov model
prostate cancer

multi-attribute decision theory
radiotherapy


to obtain orthogonal feature extraction using training data selection Feature extraction is an effective tool in data mining and machine learning. Many feature extraction methods have been investigated recently. However, few methods can achieve orthogonal components. Non-orthogonal components distort the metric structure of original data space and contain reductant information. In this paper, we propose a feature extraction method, named as incremental orthogonal basis analysis (IOBA), to cope with the challenging endeavors. First, IOBA learns orthogonal components for original data, not only theoretically but also numerically. Second, an innovative way of training data selection is proposed. This selection scheme helps IOBA pick up numerically orthogonal components from training patterns. Third, by designing a self-adaptive threshold technique, no prior knowledge about the number of components is necessary to use IOBA. Moreover, without solving eigenvalue and eigenvector problems, IOBA not only saves large computing loads, but also avoids ill-conditioned problems. Results of experiments show the efficiency of the proposed IOBA.

O O O O O O O O O O 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 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 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


top issues in providing successful undergraduate research experiences Undergraduate research is becoming increasingly common in colleges and universities, and, to support this, there is a need to have best practices and forums for promoting exchange of ideas. In particular, a working group at a recent National Science Foundation (NSF) Computer and Information Science and Engineering (CISE) Research Experiences for Undergraduates (REU) sites PI's meeting identified four important issues in undergraduate research: 1) how to design a good research project, 2) how to prepare students for research, 3) how to measure outcomes of undergraduate research and 4) incentives for undergraduates to publish as result of their participation in research. The panelists have all served as PIs or Co-PIs on NSF REU projects in computing and have mentored many undergraduates in a large variety of research projects both in REU settings as well as during the regular academic year. They will each address one of the issues identified above, and share their expertise in addressing the issue, providing solid guidance to anyone interested in promoting undergraduate research. A significant amount of time will be set aside for audience participation and discussion.

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 B I 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 B I O O O O O O O O O O O O O O


attaining soft real-time constraint and energy-efficiency in web servers M/M/1 queues have been traditionally used to model several systems like phone calls at a call center, banking services and so on. However, recent studies showed that it does not model properly a web server system. In this paper we investigate the impact of this assumption in providing timeliness constraint in an energy-efficient web server. Although energy efficiency is a key issue, it should not be attained at the expense of a poor quality of service. The work proposed here describes a technique that uses queueing theory results to balance energy consumption and adequate application response times in heterogeneous CPU-intensive server clusters. Moreover, we investigate the I/O impact on a purely CPU-oriented energy saving strategy. This proposal shows that the assumption of a Poisson process is a good approximation to model a web server.

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 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 B I O O O O O O O O O O O O O O O O O O O O

quality of service
web servers
queueing theory
energy saving


cooperative sensing with transmit diversity based on randomized stbc in cr networks In this paper, a cognitive radio (CR) network composed of K secondary users who cooperatively sense a channel using the k -out-of- K fusion rule to determine the presence of the primary user is studied. The sensing-throughput tradeoff problem is investigated in a realistic environment where both the sensing channels and reporting channels are characterized by fading channels. It is observed that taking into consideration the probability of reporting error in the CR network increases the sensing time and reduces the maximum average throughput of the secondary users. To mitigate the effect of the probability of reporting error, a transmit diversity based cooperative spectrum sensing method using randomized space-time block coding (RSTBC) is proposed. Simulations results show that the spatial diversity gain induced by RSTBC significantly decreases the sensing time and improves the throughput of the secondary users.

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

cognitive radio networks
optimization
sensing throughput tradeoff


A methodology to design a fuzzy logic based supervision of Hybrid Renewable Energy Systems Hybrid Renewable Energy Systems (HRES) are increasingly used to improve the grid integration of wind power generators. The goal of this work is to propose a methodology to design a fuzzy logic based supervision of this new kind of production unit. A graphical modeling tool is proposed to facilitate the analysis and the determination of fuzzy control algorithms adapted to complex hybrid systems. To explain this methodology, the association of wind generators, decentralized generators and storage systems are considered for the production of electrical power. The methodology is divided in six steps covering the design of a supervisor from the system work specifications to an optimized implementation of the control. The performance of this supervisor is shown with the help of simulations. Finally, the application of this methodology to the supervision of different topologies of HRES is also proposed to bring forward the systematic dimension of the approach. (C) 2010 IMACS. Published by Elsevier B.V. All rights reserved.

O O O O O O O O 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

energy management system
hybrid power integration
power management
fuzzy logic supervision


REPRESENTATIONAL TRAJECTORIES IN CONNECTIONIST LEARNING The paper considers the problems involved in getting neural networks to learn about highly structured task domains. A central problem concerns the tendency of networks to learn only a set of shallow (non-generalizable) representations for the task, i.e., to 'miss' the deep organizing features of the domain. Various solutions are examined, including task specific network configuration and incremental learning. The latter strategy is the more attractive, since it holds out the promise of a task-independent solution to the problem. Once we see exactly how the solution works, however, it becomes clear that ft is limited to a special class of cases in which (1) statistically driven undersampling is (luckily) equivalent to task decomposition, and (2) the dangers of unlearning are somehow being minimized. The technique is suggestive nonetheless, for a variety of developmental factors may yield the functional equivalent of both statistical AND 'informed' undersampling in early learning.

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 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 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

connectionism
development
recurrent networks
catastrophic forgetting


The challenge of non-ergodicity in network neuroscience Ergodicity can be assumed when the structure of data is consistent across individuals and time. Neural network approaches do not frequently test for ergodicity in data which holds important consequences for data integration and intepretation. To demonstrate this problem, we present several network models in healthy and clinical samples where there exists considerable heterogeneity across individuals. We offer suggestions for the analysis, interpretation, and reporting of neural network data. The goal is to arrive at an understanding of the sources of non-ergodicity and approaches for valid network modeling in neuroscience.

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 I O B

functional neuroimaging
traumatic brain injury


Oppositional krill herd algorithm for optimal location of distributed generator in radial distribution system This paper presents KH algorithm to solve renewable DG allocation problem. OBL strategy in integrated with KH algorithm to improve solution quality. Three renewable sources, namely biomass, wind and solar energy are used. OKH algorithm is implemented on small, medium and large radial system. Proposed OKH method outperforms other approaches.

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 O O O O O

radial distribution system
krill herd algorithm

renewable distributed generators
energy loss reduction
oppositional krill herd algorithm


SIFT Match Verification by Geometric Coding for Large-Scale Partial-Duplicate Web Image Search Most large-scale image retrieval systems are based on the bag-of-visual-words model. However, the traditional bag-of-visual-words model does not capture the geometric context among local features in images well, which plays an important role in image retrieval. In order to fully explore geometric context of all visual words in images, efficient global geometric verification methods have been attracting lots of attention. Unfortunately, current existing methods on global geometric verification are either computationally expensive to ensure real-time response, or cannot handle rotation well. To solve the preceding problems, in this article, we propose a novel geometric coding algorithm, to encode the spatial context among local features for large-scale partial-duplicate Web image retrieval. Our geometric coding consists of geometric square coding and geometric fan coding, which describe the spatial relationships of SIFT features into three geo-maps for global verification to remove geometrically inconsistent SIFT matches. Our approach is not only computationally efficient, but also effective in detecting partial-duplicate images with rotation, scale changes, partial-occlusion, and background clutter. Experiments in partial-duplicate Web image search, using two datasets with one million Web images as distractors, reveal that our approach outperforms the baseline bag-of-visual-words approach even following a RANSAC verification in mean average precision. Besides, our approach achieves comparable performance to other state-of-the-art global geometric verification methods, for example, spatial coding scheme, but is more computationally efficient.

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 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 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 B I I O B I I 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 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

verification
image retrieval
geometric square coding
geometric fan coding

algorithms
experimentation
partial duplicate
large scale
rotation-invariant


MAD trees and distance-hereditary graphs For a graph G with weight function w on the vertices, the total distance of G is the sum over all unordered pairs of vertices x and y of w(x)w(y) times the distance between x and y. A MAD tree of G is a spanning tree with minimum total distance. We develop a linear-time algorithm to find a MAD tree of a distance-hereditary graph; that is, those graphs where distances are preserved in every connected induced subgraph.

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 B O O O O O O O O O O O B 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

minimum average distance
distance-hereditary graphs


Global convergence of a reactiondiffusion predatorprey model with stage structure and nonlocal delays In this paper, a LotkaVolterra type reactiondiffusion predatorprey model with stage structure for the prey and nonlocal delays due to gestation of the predator is investigated. In the case of a general domain, sufficient conditions are obtained for the global convergence of positive solutions of the proposed problem by using the energy function method. Numerical simulations are carried out to illustrate the main results.

B I O O B O O O B I 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 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

stage structure
reactiondiffusion
global convergence


Cartographic generalization of roads in a local and adaptive approach: A knowledge acquistion problem This paper presents a local and adaptive approach to road generalization, where different algorithms may be successively applied to each part of a road. The specific problem addressed is how to acquire and formalize cartographic knowledge in order to guide the application of the algorithms during the process. Our approach requires toolboxes of algorithms to transform and analyse the data, as well as an engine to chain them together. First, we present the toolboxes used in our experiments for road generalization. Then, we present two different engines, as well as the knowledge-acquisition processes used to determine them. The first engine, named GALBE, is an empirically determined process, where the application of algorithms is mainly based on a single criterion: the coalescence. The second engine, which is more complex, uses multiple measures to describe the road. The choice of which algorithm to use given a particular set of measures is determined from examples using supervised learning techniques. Results obtained with both engines are presented.

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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

cartographic generalization
knowledge acquistion


Intelligent task planning and action selection of a mobile robot in a multi-agent system through a fuzzy neural network approach This paper proposes an intelligent task planning and action selection mechanism for a mobile robot in a robot soccer system through a fuzzy neural network approach. The proposed fuzzy neural network system is developed through the two dimensional fuzzification of the soccer field. A five layer fuzzy neural network system is trained through error back propagation learning algorithm to impart a strategy based action selection. The action selection depends on the field configuration, and the emergence of a particular field configuration results from the game dynamics. Strategy of the robot changes when the configuration of the objects in the field changes. The proposed fuzzy neural network structure is flexible to accommodate all possible filed configurations. Simulation results indicate that the proposed approach is simple and has the capability in coordinating the multi-agent system through selection of sensible actions.

O B I O O O O O O O O O O O O O B I I O O O O O O B I O O O O O O O O O O B I 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 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 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

robot soccer
fuzzy neural network
task planning

multi-agent system
fuzzy sets
intelligent action selection