The FLAME approach: From dense linear algebra algorithms to high-performance multi-accelerator implementations Parallel accelerators are playing an increasingly important role in scientific computing. However, it is perceived that their weakness nowadays is their reduced programmability in comparison with traditional general-purpose CPUs. For the domain of dense linear algebra, we demonstrate that this is not necessarily the case. We show how the libflame library carefully layers routines and abstracts details related to storage and computation, so that extending it to take advantage of multiple accelerators is achievable without introducing platform specific complexity into the library code base. We focus on the experience of the library developer as he develops a library routine for a new operation, reduction of a generalized Hermitian positive definite eigenvalue problem to a standard Hermitian form, and configures the library to target a multi-GPU platform. It becomes obvious that the library developer does not need to know about the parallelization or the details of the multi-accelerator platform. Excellent performance on a system with four NVIDIA Tesla C2050 GPUs is reported. This makes libflame the first library to be released that incorporates multi-GPU functionality for dense matrix computations, setting a new standard for 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

dense linear algebra libraries
graphics processors
runtime systems
high performance computing


Decidability of bounded second order unification It is well-known that first order unification is decidable, whereas second order (and higher order) unification is undecidable. Bounded second order unification is second order unification under the restriction that only a bounded number of bound variables in the instantiating terms for second order variables is permitted, however, the size of the instantiation is not restricted. In this paper, a decision algorithm for bounded second order unification is described. This is the first nontrivial decidability result for second order unification, where the signature is not restricted and there are no restrictions on the occurrences of variables. This supports the claim that bounded second order unification is easier than context unification, whose decidability is currently an open question. (C) 2003 Elsevier Inc. All rights reserved.

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

second order unification
lambda calculus
context unification
automated deduction
rewriting
higher order unification
logics in artificial intelligence


Convergence analysis and optimal scheduling for multiple concatenated codes An interesting practical consideration for decoding of serial or parallel concatenated codes with more than two components is the determination of the lowest complexity component decoder schedule which results in convergence. This correspondence presents an algorithm that finds such an optimal decoder schedule. A technique is also given for combining and projecting a series of three-dimensional extrinsic information transfer (EXIT) functions onto a single two-dimensional EXIT chart. This is a useful technique for visualizing the convergence threshold for multiple concatenated codes and provides a design tool for concatenated codes with more than two components.

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

exit chart
multiple concatenated codes
optimal scheduling


WRIS.TEQ: multi-mineralic waterrock interaction, mass-transfer and textural dynamics simulator Waterrock interactions in sediments are driven by the state of disequilibrium that persists among solids and solutes due to changing temperature and stress conditions, and advective and diffusive influx and efflux of solutes. Waterrock interactions bring about changes to sediment composition and texture through a complex chemical reaction network. These reactions can be divided into two types: solidsolute and solutesolute. Reactions of solids and solute are kinetic, i.e., they depend on compositions of solids and water, temperature, pore water pressure, and stress. Speciation among solutes are described by thermodynamic relations that depend on water composition and temperature. Both reaction mechanisms, mediated by pore water, are strongly interdependent. WRIS.TEQ is a comprehensive ReactionTransportMechanical (RTM) simulator that accounts for multi-mineralic waterrock interaction mechanisms of kinetics and thermodynamics, and mass transfer due to advection and diffusion. Moreover, the simulator's dynamic compositional and textural model based on a composite-media approach allows self-consistent evolution of sediment composition and texture due to waterrock interactions. Thus, the program can be used to make reliable predictions of sediment alteration due to waterrock interactions at the level it was previously not possible. This article describes the fundamentals of waterrock interaction and composite medium models used in the simulator WRIS.TEQ, and how the program is constructed. The utility of the program is demonstrated by simulated diagenetic alteration of sediments composed of complex mineralogy and heterogeneity.

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


Fuzzy Equilibrium Logic: Declarative Problem Solving in Continuous Domains In this article, we introduce fuzzy equilibrium logic as a generalization of both Pearce equilibrium logic and fuzzy answer set programming. The resulting framework combines the capability of equilibrium logic to declaratively specify search problems, with the capability of fuzzy logics to model continuous domains. We show that our fuzzy equilibrium logic is a proper generalization of both Pearce equilibrium logic and fuzzy answer set programming, and we locate the computational complexity of the main reasoning tasks at the second level of the polynomial hierarchy. We then provide a reduction from the problem of finding fuzzy equilibrium logic models to the problem of solving a particular bilevel mixed integer program (biMIP), allowing us to implement reasoners by reusing existing work from the operations research community. To illustrate the usefulness of our framework from a theoretical perspective, we show that a well-known characterization of strong equivalence in Pearce equilibrium logic generalizes to our setting, yielding a practical method to verify whether two fuzzy answer set programs are strongly equivalent. Finally, to illustrate its application potential, we show how fuzzy equilibrium logic can be used to find strong Nash equilibria, even when players have a continuum of strategies at their disposal. As a second application example, we show how to find abductive explanations from Lukasiewicz logic theories.

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

answer set programming
equilibrium logic
fuzzy logics
lukasiewicz logic


An intelligent multi-constraint finite capacity-based lot release system for semiconductor backend assembly environment This paper presents an intelligent multi-constraint finite capacity-based lot release system which has been designed, developed and implemented to solve the lot release problems in a discrete manufacturing environment with huge product mix and multitude of capacity constraints. This system releases lots by firstly prioritising them according to a multi-attribute lot prioritization criteria, and then by applying predefined multiple capacity constraints to the sorted queue of lots. Finally the finite resource capacity is allocated to them sequentially. This system is designed to be adaptable and re-configurable in response to the dynamic changes in the manufacturing environment. The system can be configured to operate in both an automatic and manual lot release modes. When the system is triggered under the automatic lot release mode, it will perform lot releases automatically based on the latest lot orders information and the predefined configuration, parameters and capacity constraints. It facilitates the auto generation of lot release schedule during night shifts when the production control personnel is off duty, as the system can be triggered through scheduled task provided by the computer's operating system. The manual release mode is designed to cater for fine adaptation of the lot release schedule generated by the system through potential human intervention, through which, a user is allowed to adjust the lot release schedule, in response to some last minute urgent requests from the customers and unexpected events from the shop floor. Detailed reporting tools that provide a snapshot of the lot release results controlled by the various capacity constraints are available for analysis and further refinement of the lot release schedule. This system has been successfully implemented in a few Semiconductor Backend Assembly companies, and in most of these implementations, with direct integration to their existing manufacturing systems such as the Enterprise Resource Planning (ERP) and Manufacturing Execution System (MES).

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

lot release
semiconductor backend assembly

finite capacity
multi-constraint
adaptable and re-configurable


Transit network design by Bee Colony Optimization We study the transit network design problem. We propose the simple greedy algorithm for generating the initial solution. We develop the model based on the Bee Colony Optimization (BCO) metaheuristic to discover the best transit network topology. The numerical experiments are performed on the known benchmark problems. The obtained numerical results show that the proposed approach can find high-quality solutions.

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

bee colony optimization (bco)
swarm intelligence


Bayesian method for NLOS mitigation in single moving sensor Geo-location The problem of locating mobile sensors has received considerable attention, particularly in the field of wireless communications. It is well-known that the presence of non-line-of-sight (NLOS) errors in the geo-location problem leads to severe degradation in the localization performance. In this paper, we propose a robust Bayesian method to mitigate the NLOS errors in location estimation of a single moving sensor, whereby the localization is performed using time-of-arrival (TOA) measurements. This method is based on the Markov chain Monte Carlo (MCMC) approach. Numerical simulations results illustrate the promising results of our method in a mixed line-of-sight (LOS) and NLOS environment.

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


Assessing performance and uncertainty in developing carpet reverse logistics systems The US carpet industry is striving to reach a 40% diversion rate from landfills by 2012, according to a memorandum of understanding signed by industry and government officials in 2002. As a result, they are interested in methods of setting up a reverse logistics (RL) system which will allow them to manage the highly variable return flows. In this paper, we simulate such a carpet RL supply chain and use a designed experiment to analyze the impact of the system design factors as well as environmental factors impacting the operational performance of the RL system. First, we identify the relative importance of various network design parameters. We then show that even with the design of an efficient RL system, the use of better recycling technologies, and optimistic growth in recycling rates, the return flows cannot meet demand for nearly a decade. We conclude by discussing possible management options for the carpet industry to address this problem, including legal responses to require return flows and the use of market incentives for recycling.

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

reverse logistics
recycling
carpet industry

simulation
design of experiments
performance analysis


Numerical simulation of incompressible fluid flow using locally solenoidal elements In this paper, we present a numerical study of the performance of a discontinuous Calerkin formulation for the Navier-Stokes equations. This method is characterized by the fact that the velocity field is approximated using piecewise polynomial functions that are totally discontinuous across interelement boundaries and which are pointwise divergence-free on each element (locally solenoidal). In particular, numerical results are presented for two well-known benchmark problems. (c) 2006 Elsevier Ltd. All rights reserved.

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

incompressible flow
discontinuous galerkin method


Variable selection by Random Forests using data with missing values ? Variable selection has been suggested for Random Forests to improve data prediction and interpretation. However, the basic element, i.e. variable importance measures, cannot be computed straightforward when there are missing values in the predictor variables. Possible solutions are multiple imputation, complete case analysis and the use of a self-contained importance measure that is able to deal with missing values. Simulation and application studies have been conducted to investigate the properties of these procedures when combined with two popular variable selection methods. Findings and recommendations: Complete case analysis should not be used as it led to inaccurate variable selection. Multiple imputation is the method of choice if the selection of a variable is supposed to reflect its potential relevance in a complete data setting. However, Random Forests are commonly used without any preprocessing of the data as they are known to implicitly deal with missing values. In such a case, the application of the self-contained importance measure permits the selection of variables that are of relevance in these actual prediction models.

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

random forests
variable importance
variable selection
multiple imputation
complete case analysis


Formal verification techniques based on Boolean satisfiability problem This paper exploits Boolean satisfiability problem in equivalence checking and model checking respectively. A combinational equivalence checking method based on incremental satisfiability is presented. This method chooses the candidate equivalent pairs with some new techniques, and uses incremental satisfiability algorithm to improve its performance. By substituting the internal equivalent pairs and converting the equivalence relations into conjunctive normal form (CNF) formulas, this approach can avoid the false negatives, and reduce the search space of SAT procedure. Experimental results on ISCAS'85 benchmark circuits show that, the presented approach is faster and more robust than those existed in literature. This paper also presents an algorithm for extracting of unsatisfiable core, which has an important application in abstraction and refinement for model checking to alleviate the state space explosion bottleneck. The error of approximate extraction is analyzed by means of simulation. An analysis reveals that an interesting phenomenon occurs, with the increasing density of the formula, the average error of the extraction is decreasing. An exact extraction approach for MU subformula, referred to as pre-assignment algorithm, is proposed. Both theoretical analysis and experimental results show that it is more efficient.

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

equivalence checking
incremental satisfiability
model checking


Lines Pinning Lines A line l is a transversal to a family F of convex polytopes in R(3) if it intersects every member of F. If, in addition, l is an isolated point of the space of line transversals to F, we say that F is a pinning of l. We show that any minimal pinning of a line by polytopes in R(3) such that no face of a polytope is coplanar with the line has size at most eight. If in addition the polytopes are pairwise disjoint, then it has size at most six.

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

geometric transversal
helly-type theorem
line geometry


Vector-city vector distance transform This paper will examine the current chamfer and vector distance transforms for encoding objects as distance fields. A new vector distance transform is introduced which uses the city-block chamfer distance transform as a basis. Detailed error analysis using real CT data is presented, demonstrating the improved accuracy of the new approach over existing methods. The production of a subvoxel accurate distance field is also demonstrated by employing an improved classification. Distance fields are shown for skull and chess piece datasets. (C) 2001 Academic Press.

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

chamfer distance transform
vector distance transform
euclidean distance
subvoxel accuracy
voxelization


McCockerel measuring individual punishment and reciprocity in a simple value-laden dilemma game In our study we intend to gain insight into the behavior of individuals in conflict situations which can be interpreted as sanctions. There are hardly any models of sanctions in the literature which can be compared with our idea. An experiment is modeled to analyze the behavior of individuals in a situation similar to a sequential prisoners' dilemma. Contingent decisions give us the chance to measure punishment and sanctions using one-shot games. Our approach is similar to an extended model by Bolton et al. [measuring motivations for the reciprocal responses: Observed in a simple dilemma game, Pre-print no. 34, University Magdeburg, 1997], which analyzed reciprocity in a single framework with the help of a questionnaire. In our paper we concentrate on whether the attitude towards fairness coincides with the attitude towards the application of sanctions. We will also observe whether fairness, gender and the effect of the economic education have an influence on the degree of punishment used. Results seem to indicate that the role assigned to each participant strongly influences her/his actions towards her/his counterpart. We suppose the reason for this behavior is that less experienced individuals think more positively about the payoffs for their competitors, while individuals with a higher level of economic education behave significantly more selfishly. Our objectives are to gain more insight into behavior in dilemma situations and also seek better explanations for individual decisions. Some of the results could help to understand problems concerned with sanctions.

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

game theory
simple dilemma games
experimental economics


A reliable method of determining wound healing rate Several wound healing rate measures have been introduced with the main goal of enabling quantification of the effects of various therapeutic modalities on the healing of open wounds. Different definitions of wound healing rate render comparison of clinical results difficult. The goal of the present study was to propose a measure of wound healing rate that is independent of initial wound extent and to present a method of wound healing rate prediction. Comparisons were made of wound healing rate defined as absolute area healed per day, percentage of initial area healed per day and advance of the wound margin towards the wound centre per day. Analysis was performed on 300 wound cases. A disadvantage of wound healing measures that either use absolute area healed per day or percentage of initial area healed per day is their very limited use for comparing healing rates of wounds with different initial sizes. This disadvantage was overcome by incorporating a wound perimeter; thus obtaining a measure of the advance of the wound margin towards the wound centre. A definition of healing rate expressed as the greatest average wound margin distance from the wound centre divided by the time to complete wound closure is proposed. Because not all wounds are closed in the observation period, the time to complete wound closure has to be predicted. A method of wound healing rate prediction is presented based on a delayed exponential model the parameters of which are obtained from at least five weekly wound area measurements. Paired t-tests between actual time needed to complete wound closure and the predicted time resulted in p = 0.062 after four, 0.484 after five and 0.900 after six weeks of observation.

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


Public funding in the academic field of nanotechnology: a multi-agent based model This paper simulates research networks in nanotechnology in Germany and the US. Agent-based modelling is used to analyse how public third-party funding influences the diffusion of a high technology by four different ways of funding. This diffusion is measured by the emerging number of nanoscientists. Next to the size of the national research systems and the number of scientists, the spread of nanotechnology is measured by interdisciplinarity and the probability of changing ones disciplinary identity. The model is proper for the investigation of other high-technologies. Different ways of funding researchers can, according to the study results, influence the pattern of diffusion of a new technology in academia, in particular in the bigger research system of the US. While results are not significant for Germany, the way of funding researchers has significant effects in the US, with star scientists playing a crucial role for the distribution of public funding.

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


Comparing different approaches for solving optimizing models with significant nonlinearities The property of saddle-path instability often arises in economic models derived from optimizing behavior by individual agents. In the case when underlying functional forms are nonlinear, it is likely that the stable and unstable arms defining the saddle-path dynamics will also have nonlinear properties. While closed-form analytic solutions can always be derived for linearized deterministic versions of these models, it will be necessary to use numerical techniques to derive the dynamic properties of calibrated versions of the associated nonlinear models. There are a range of different approaches by which it is possible to solve the dynamics of nonlinear models with the saddle-path property. Alternative solution methods using numerical techniques are discussed. In all cases, the success of the solution can be assessed by evaluating whether or not the chosen solution gives a time-path for each variable that goes from the chosen initial condition to (a small neighborhood of) the steady-state. Unfortunately, however, there is generally no way of evaluating whether intermediate points on the path between the initial condition and the steady-state are close approximations to the "true" solution. In order to evaluate the "goodness-of-fit" along the entire dynamic path, it is necessary to have a closed-form solution of the entire solution path. This can only be achieved in special cases. For one special case, we demonstrate how it is possible to construct a model with complex-valued eigenvalues with large imaginary parts and hence significant cycles. Such a model can be employed as a benchmark to compare the properties of solutions derived using a range of solution algorithms. (C) 2008 IMACS. Published by 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

saddle-path instability
computational techniques
nonlinear dynamics
complex-valued eigenvalues


a comparative analysis of parallel disk-based methods for enumerating implicit graphs It is only in the last five years that researchers have begun to use disk-based search techniques on a large scale. The primary examples of its use come from symbolic algebra and from artificial intelligence. In the field of parallel search, disk-based search has been forced on researchers because the historical growth in the amount of RAM per CPU core has now stopped. Indeed, the current trend toward multi-core CPUs now threatens to take us backwards. This article makes an original contribution to the design of disk-based parallel search algorithms. It presents a survey of disk-based techniques side-by-side, for the first time. This allows researchers to choose from a menu of techniques, and also to create new hybrid algorithms from the building blocks presented here.

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


An algorithm for checking whether the toric ideal of an affine monomial curve is a complete intersection Let K be an arbitrary field and {d(1),...,d(n)} a set of all-different positive integers. The aim of this work is to propose and evaluate an algorithm for checking whether or not the toric ideal of the affine monomial curve {(t(d1),..., t(dn)) vertical bar t epsilon K } subset of A(K)(n) is a complete intersection. The algorithm is based on new results regarding the toric ideal of the curve, and it can be seen as a generalization of the classical result of Herzog for n = 3. Computational experiments show that the algorithm is able to solve large-size instances. (c) 2007 Elsevier Ltd. All rights reserved.

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

toric ideals
combinatorial optimization
graph theory


a survival modeling approach to biomedical search result diversification using wikipedia In this paper, we propose a probabilistic survival model derived from the survival analysis theory for measuring aspect novelty. The retrieved documents' query-relevance and novelty are combined at the aspect level for re-ranking. Experiments conducted on the TREC 2006 and 2007 Genomics collections demonstrate the effectiveness of the proposed approach in promoting ranking diversity for biomedical information retrieval.

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


using evolving storage structures for data storage Different data storage structures suit different data management scenarios, therefore, a universal data storage structure is not possible. Furthermore, each data storage structure has different resource consumption because of their unique execution complexity. Self-tuning data management systems need a mechanism to select appropriate data storage structure and to adapt it with changing data management requirements. We propose Evolving Storage Structures for self-tuning data management system that supports customization and adaptation with changing data management needs.

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

self-tuning
cellular dbms architecture
evolution


Target recognition via 3D object reconstruction from image sequence and contour matching This paper proposes an automatic target recognition (ATR) system based on the three-dimensional (3D) reconstruction of the target from an image sequence. The main contribution of this work is twofold: (1) we present a modified voxel coloring reconstruction algorithm and (2) we employ the 3D reconstructed target model to generate the front and side target templates at zero depression angle to be used in the target recognition process. Target recognition is performed by matching the generated templates to a library using a subpixel contour matching algorithm. Experimental results on simulated scenes show the accuracy of the approach presented in this paper.

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

automatic target recognition
voxel coloring reconstruction

three-dimensional object reconstruction
template matching


Application of a total variation diminishing scheme to electromagnetic hybrid particle-in-cell plasma simulation A discretization procedure for a total variation diminishing (TVD) scheme is introduced to an electromagnetic hybrid particle-in-cell (PIC) plasma simulation code in order to improve the numerical stability and resolution when calculating the plasma flow field in which magnetic field discontinuities (for example, RankineHugoniot jump conditions for shock waves) are generated. In the hybrid PIC code used in this study, ions are treated as particles and electrons are assumed to be an inertia-less (mass-less) fluid. In the numerical results of one-dimensional test simulations, the TVD scheme significantly prevents non-physical, numerical oscillations, which would ordinarily be produced in the solution when the convection term of the magnetic induction equation in the hybrid PIC code is discretized by central difference schemes at magnetic field discontinuities. Furthermore, a two-dimensional simulation of the global structure of a collision-less bow shock, which is suitable for practical use, makes it possible to clearly capture the bow shock by using the hybrid PIC code with the TVD scheme.

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

particle-in-cell code
electromagnetic hybrid plasma code
space plasma physics


Finite multidimensional behaviors We study finitely generated and finite systems defined by linear partial difference equations with constant coefficients in a Noetherian ring. The two notions coincide for finite rings, and we show that all finite systems exhibit certain periodicity properties. For the particular case of systems over the ring of integers modulo m > 1, which is important in coding theory, a method is given for determining the number of trajectories, using Grobner basis techniques.

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

discrete multidimensional systems
behavioral approach
systems over rings
finiteness conditions
periodic solutions
grobner bases


Spectral

alignment

of

multi-temporal

cross-sensor

images

with

automated

kernel

canonical

correlation

analysis

In

this

paper

we

present

an

approach

to

perform

relative

spectral

alignment

between

optical

cross-sensor

acquisitions.

The

proposed

method

aims

at

projecting

the

images

from

two

different

and

possibly

disjoint

input

spaces

into

a

common

latent

space,

in

which

standard

change

detection

algorithms

can

be

applied.

The

system

relies

on

the

regularized

kernel

canonical

correlation

analysis

transformation

(kCCA),

which

can

accommodate

nonlinear

dependencies

between

pixels

by

means

of

kernel

functions.

To

learn

the

projections,

the

method

employs

a

subset

of

samples

belonging

to

the

unchanged

areas

or

to

uninteresting

radiometric

differences.

Since

the

availability

of

ground

truth

information

to

perform

model

selection

is

limited,

we

propose

a

completely

automatic

strategy

to

select

the

hyperparameters

of

the

system

as

well

as

the

dimensionality

of

the

transformed

(latent)

space.

The

proposed

scheme

is

fully

automatic

and

allows

the

use

of

any

change

detection

algorithm

in

the

transformed

latent

space.

A

synthetic

problem

built

from

real

images

and

a

case

study

involving

a

real

cross-sensor

change

detection

problem

illustrate

the

capabilities

of

the

proposed

method.

Results

show

that

the

proposed

system

outperforms

the

linear

baseline

and

provides

accuracies

close

the

ones

obtained

with

a

fully

supervised

strategy.

We

provide

a

MATLAB

implementation

of

the

proposed

method

as

well

as

the

real

cross-sensor

data

we

prepared

and

employed

at

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

change detection
relative spectral alignment
canonical correlation analysis

cross-sensor
kernel methods
feature extraction


broad scale predictive modeling and marketing optimization in retail sales The challenge of predicting retail sales on a product-by-product basis throughout a network of retail stores has been researched intensively by applied econometricians and statisticians for decades. The principal tools of analysis have been linear regression with Bayesian inspired adjustments to stabilize demand curve estimates. The scale of such analytics can be challenging as retailers often work with more than 100,000 products (SKUs) and typically operate networks of hundreds of brick and mortar stores. Department and grocery stores are excellent examples but fast food restaurants also require such detailed predictive modeling systems. Depending on the objectives of the company, predictions may be required for blocks of time spanning a week or more, or, as in the case of fast food operators, predictions are required for each 15-minute time interval of the operating day. The authors have modernized industry standard approaches to such predictive modeling by leveraging advanced data mining techniques. These techniques are more adept in detecting nonlinear response and accommodating interactions and automatically sifting through hundreds if not thousands of potential factors influencing sales outcomes. Results show that conventional statistical models miss a substantial fraction of the explainable variance while the new methods dominate in terms of performance and speed of model development. Accurate prediction is required for reliable planning and logistics, and optimization. Optimization with respect to pricing, promotion and assortment can be asked for relative to a variety of objectives (e.g. revenue, profits) and short term and long-term optimization may result in different decisions being taken. A unique challenge for retailers is the large number of constraints to which complex retail organizations are subject. Contracts and special understandings with valued suppliers severely constrain a retailer's flexibility. For example, certain products may not be promotable (or discounted) in isolation, and others (say from competitors) may not be promoted jointly, and the costs of goods sold may well depend on the quantities contracted. We discuss how we have resolved such challenges via a cycle of prediction and simulation to develop a flexible high-speed system for handling arbitrary constraints, arbitrary objectives, and achieve new levels of predictive accuracy and reliability.

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

supply-chain optimization
large-scale data mining
smart pricing.
inventory management
predictive analytics


Implementation and Optimization of an Enhanced PWD Metric for H.264/AVC on a TMS320C64 DSP A common method for selecting the best prediction mode based on block matching algorithm is to compare, for each source block, the associated distortions among the available prediction candidates. The human visual perception is sensitive to luminance contrast rather than absolute luminance values. In fact, the human eyes ability to detect the magnitude difference between an object and its background depends on the background luminance average value. The Perceptually Weighted Distortion (PWD) is a new distortion measure that can produce better image quality. In this paper, we propose to add a new feature to the PWD by introducing another diagonal component that yields to a significant quality improvement. The enhanced PWD metric actually outperforms the original PWD and the SAD metric, according to the experimental results, especially in the aspect of reducing block artifacts. An increase in terms of implementation complexity will be noticed as a result of this contribution. Therefore, optimized implementation of the Enhanced PWD exploiting the C64 DSP-Core assets will be presented. In fact, Standard Assembly (SA) is used to implement the different Enhanced PWD functions in order to exploit efficiently the C64 internal architecture and resources. Experimental results show more than 85% improvement in terms of cycle cost compared to C code.

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

perceptually weighted distortion
tms320c64
standard assembly


Advection-diffusion lattice Boltzmann scheme for hierarchical grids In this paper we describe an extension of a recently developed lattice Boltzmann method for solving the advection-diffusion equation. Our proposed approach allows to couple grids of different grid resolutions and includes a staggered timestepping scheme, interpolations in space and time and finally a scaling step ensuring the continuity of the desired macroscopic quantities across the grid interface. After validating the basic lattice Boltzmann method on a uniform grid by a convergence study of analytic problems we demonstrate the consistency of our approach by solving benchmark problems and comparing results on uniform grids and multiply locally refined grids. (c) 2007 Elsevier Ltd. All rights reserved.

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

lattice boltzmann method
hierarchical grids


Predicting

dopamine

receptor

binding

affinity

of

n-(omega-(4-(2-methoxyphenyl)piperazin-1-yl)alkyl)carboxamides:

Computational

approach

using

topological

descriptors

Relationship

between

the

topological

indices

and

Dopamine

receptor

binding

affinity

of

N-(omega-(4-(2-Methoxyphenyl)piperazin-1-yl)alkyl)carboxamides

has

been

investigated.

Three

topological

indices

the

Wiener's

Index-

a

distance-based

topological

descriptor,

Zagreb

group

parameter-

an

adjacency

based

topological

descriptor

and

eccentric

connectivity

index-

an

adjacency-cum-distance

based

topological

descriptor

were

used

for

the

present

investigations.

A

data

set

comprising

of

differently

substituted

was

selected

for

the

present

studies.

The

values

of

the

Wiener's

index,

Zagreb

group

parameter

and

eccentric

connectivity

index

for

each

of

the

analogues

comprising

the

data

set

were

computed

using

an

in

house

computer

program.

Resultant

data

was

subsequently

analyzed

and

suitable

models

were

developed

after

identification

of

active

ranges.

Subsequently,

a

biological

activity

was

assigned

to

each

analogue

using

these

models,

which

was

then

compared

with

the

reported

Dopamine

receptor

binding

affinity.

The

degree

of

predictability

of

these

models

was

found

to

vary

from

a

minimum

of

to

a

maximum

of

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

topological indices
eccentric connectivity index
zagreb group parameter

wiener's index
d-3 binding affinity
parkinson's disease : pd


an oversampling approach for los-toa estimation in interleaved ofdma Line-of-sight (LoS) time-of-arrival (ToA) is one of key parameters for network-based localization techniques. Its estimation accuracy depends on the bandwidth of transmitted signals. This paper aims to investigate the LoS-ToA estimation for an interleaved OFDMA based network, where the signal bandwidth is not sufficiently wide to offer the acceptable estimation accuracy. In this situation, an over-sampling approach is proposed to improve the resolution. Moreover, the proposed scheme does not require modification of mobile communications systems. It is found that the proposed approach can significantly improve the ToA estimation performance, and offer adequate accuracy even for the low signal-to-noise ratio (SNR) range.

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


A Monte Carlo method for solving unsteady adjoint equations Traditionally, solving the adjoint equation for unsteady problems involves solving a large, structured linear system. This paper presents a variation on this technique and uses a Monte Carlo linear solver. The Monte Carlo solver yields a forward-time algorithm for solving unsteady adjoint equations. When applied to computing the adjoint associated with Burgers equation, the Monte Carlo approach is faster for a large class of problems while preserving sufficient accuracy.

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

adjoint equation
monte carlo linear solver


Bayesian dynamic linear modeling for exploring the impact of recent financial crisis on Japan Credit Default Swap market This paper investigates the effects of recent subprime financial crisis on Japan Credit Default Swap (CDS) market. We first analyze the relationship between the log return series of the reference rates of a CDS contract and the hazard rate. This provides a theoretical foundation for the use of correlation of the log CDS returns as a representation of credit risk correlation. In the dynamic Bayesian linear modeling framework, we consider an algorithm that allow us to obtain dynamic Bayesian updates for the correlation among the reference rates of an underlying CDS contract. Data from the Japan CDS market is analyzed using the proposed methodology. An empirical analyses on the data segmented by different economic environments are carried out. Results indicate that the estimated implied default correlation captures market structure very well and provides useful information for credit risk management.

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


A generalized Takagi-Sugeno-Kang recurrent fuzzy-neural filter for adaptive noise cancelation This paper presents a recurrent fuzzy-neural filter for adaptive noise cancelation. The cancelation task is transformed to a system-identification problem, which is tackled by use of the dynamic neuron-based fuzzy neural network (DN-FNN). The fuzzy model is based on Takagi-Sugeno-Kang fuzzy rules, whose consequent parts consist of linear combinations of dynamic neurons. The orthogonal least squares method is employed to select the number of rules, along with the number and kind of dynamic neurons that participate in each rule. Extensive simulation results are given and performance comparison with a series of other dynamic fuzzy and neural models is conducted, underlining the effectiveness of the proposed filter and its superior performance over its competing rivals.

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

dynamic neurons
adaptive noise cancelation


A software application for rapid risk assessment in integrated supply chains We proposed a framework for rapid risk assessment in integrated supply chains. We used fuzzy logic to reduce the uncertainty inherent in the supply chain risks. We proposed risk priority matrix, a 22 matrix used for risk aggregation. We developed a software tool to implement the proposed framework. A case study from a real manufacturing was used to assess the proposed framework.

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

rapid risk assessment
fuzzy logic
risk priority matrix
integrated supply chains


An empirical re-sampling method on intrinsic mode function to deal with speed variation in machine fault diagnostics To implement traditional order tracking in practice requires rotational speed information. However, it may be difficult in some cases to mount an appropriate monitoring device to obtain reliable speed information. In this paper, a novel empirical re-sampling of intrinsic mode functions obtained from empirical mode decomposition is explored, so that the approximation of order tracking effects without rotational speed is possible. The newly introduced intrinsic cycle concept in the intrinsic mode function simplifies linking of the resultant spectra to signal variations, and is therefore beneficial for condition monitoring of rotating machines. In the paper the rationale behind the technique is first explained. Secondly, the effectiveness of the technique is demonstrated on a dynamic gear simulation model. Lastly, the technique is applied to experimental data from a gearbox test rig. Both the simulation and experimental studies corroborate the usefulness of the proposed technique.

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

empirical mode decomposition (emd)
intrinsic mode function (imf)
re-sampling
rotating machinery


Timefrequency filtering-based autofocus Autofocus is very important to the imaging of air-borne synthetic aperture radar (SAR). There have been many kinds of the autofocus technique, which could fall into two categories according to whether the phase error is approximated with a parametric model or not. On the condition that prominent points exist in the image, the non-parametric methods have superiority over the parametric ones in dealing with high-order phase errors due to their high precision and appropriate computational complexity. As will be shown in this paper, the signal-to-clutter ratio (SCR) plays a pivotal roll in this kind of autofocus. The timefrequency filtering is introduced because of its extraordinary performance in raising the SCR of time-variant signals. Since the main part of the phase error is quadratic, the short-time fractional Fourier domain (STFRFD) filtering is utilized, and then a novel autofocus method termed timefrequency filtering-based autofocus (TFFA) is proposed. Theoretical analysis and simulations show the validity of this approach.

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

timefrequency filtering-based autofocus
short-time fractional fourier transform


Cascading random walks In this paper, we discuss a simple, Monte Carlo algorithm for the problem of checking whether a Quantified Boolean Formula (QBF) in Conjunctive Normal Form (CNF), with at most two literals per clause has a model. The term k-CNF is used to describe boolean formulas in CNF, with at most k literals per clause and the problem of checking whether a given k-CNF formula is satisfiable is called the k-SAT problem. A QBF is a boolean formula, accompanied by a quantifier string which imposes a linear ordering on the variables of that formula. The problem of finding a model for a QBF formula in CNF, with at at most k literals per clause is called the QkSAT problem. The QkSAT problem is PSPACE-complete, for k >= 3. However, the Q2SAT problem can be decided in polynomial time; the graph-based procedure, discussed in [1], is the first such algorithm for this problem. This procedure requires the construction of a global implication graph, corresponding to the input formula and searching for certain paths in this graph. Hence the complete set of clauses must be part of the input. We propose an incremental, randomized approach for the Q2SAT problem that is essentially local in nature, in that the complete clausal set need not be provided at any time, in the presence of a verifier. We show that the randomized algorithm can be analyzed as a one-dimensional random walk, with one reflecting barrier and one absorbing barrier. On a Q2SAT instance with m clauses on n variables, our coin-flipping algorithm runs in time O(n(2) (.) V(m, n)), where V(m, n) is the time required to verify that a given model satisfies the formula. Additionally, if the instance is satisfiable, the probability that our algorithm fails to find a model is less than one half. The design and analysis of a randomized algorithm for a problem, is important from both the theoretical and the practical perspectives. Randomized approaches tend to be simple and elegant, thereby making the process of checking correctness, effortless as well. The randomized approach discussed in this paper lays the groundwork for analyzing a number of problems related to 2CNF formulas and directed graphs. We remark that our work in this paper is the first randomized algorithm for a class of QBFs.

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


Modelling and analysis of a single-species system with stage structure and harvesting This paper studies the asymptotic behavior of a single-species model with stage structure and harvesting. For the constant, variable, and periodic harvesting effort, we obtain conditions for the global stability of the equilibria, permanence of the system and global attractivity of the periodic solution, respectively. (C) 2002 Elsevier Science Ltd. All rights reserved.

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

stage structure
global stability
permanence
global attractivity


Efficient heuristics for energy-aware routing in networks with bundled links Current networks are typically over-provisioned to ensure low delays, redundancy and reliability. These Quality of Service (QoS) guarantees are typically achieved using high end, high power network equipments. Their use, however, has led to concerns regarding green house gas emissions, which garnered a lot of attention recently and have resulted in a number of global initiatives aim at reducing the carbon footprint of Internet Service Providers (ISPs). These initiatives have motivated ISPs and researchers to design novel network algorithms and hardware that scale the usage or active time of a network according to traffic load. To this end, this paper considers the problem of shutting down a subset of bundled links during off-peak periods in order to minimize energy expenditure. Unfortunately, identifying the cables that minimize this objective is an NP-complete problem. Henceforth, we propose several practical heuristics based on Dijkstras algorithm and Yens k-shortest paths algorithm. We evaluated our heuristics on the Abilene network with both real and synthetic traffic matrices and several larger random topologies with various loads. Our results show that the proposed heuristics to be effective and efficient. Moreover, our approaches could potentially reduce the energy usage of cables used in the Abilene network by up to 56.7%, assuming the traffic demands recorded on September 5, 2004.

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


Three-dimensional finite element study of a single pile response to multidirectional lateral loadings incorporating the simplified state-dependent dilatancy model Waves and winds can induce lateral loads on piles, which are often multidirectional. The objective of this study is to investigate the response of a single pile subjected to unidirectional and multidirectional lateral loadings using the finite element analysis program ABAQUS. A simplified version of the state-dependent dilatancy model was implemented and embedded into the program to simulate the behavior of the soil around the pile. The results of the analyses indicate that the lateral resistance of the pile along one horizontal direction under multidirectional loading is lower than that under unidirectional loading. The degree of reduction of the resistance increases with the aspect ratio of the displacement path at the pile head. The directions of the force increment vector and the displacement increment vector are generally non-coaxial under multidirectional loading. The soil-pile interaction and soil responses under multidirectional loading are also significantly different than those under unidirectional loading.

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

finite element
multidirectional lateral loadings

three-dimensional
soil-pile interaction
state-dependent dilatancy


On the connectivity of close to regular multipartite tournaments If x is a vertex of a digraph D , then we denote by d+(x) d + ( x ) and d-(x) d - ( x ) the outdegree and the indegree of x, respectively. The global irregularity of a digraph D is defined by ig(D)=max{d+(x),d-(x)}-min{d+(y),d-(y)} i g ( D ) = max { d + ( x ) , d - ( x ) } - min { d + ( y ) , d - ( y ) } over all vertices x and y of D (including x=y x = y ) and the local irregularity of a digraph D is il(D)=max|d+(x)-d-(x)| i l ( D ) = max | d + ( x ) - d - ( x ) | over all vertices x of D . Clearly, il(D)?ig(D) i l ( D ) ? i g ( D ) . If ig(D)=0 i g ( D ) = 0 , then D is regular and if ig(D)?1 i g ( D ) ? 1 , then D is almost regular. A c-partite tournament is an orientation of a complete c -partite graph. Let V1,V2,,Vc V 1 , V 2 , , V c be the partite sets of a c -partite tournament such that |V1|?|V2|???|Vc| | V 1 | ? | V 2 | ? ? ? | V c | . In 1998, Yeo proved

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


mpi/openmp hybrid parallel inference for latent dirichlet allocation In recent years, probabilistic topic models have been applied to various kinds of data including text data, and its effectiveness has been demonstrated. Latent Dirichlet Allocation (LDA) is one of the well-known topic models. Variational Bayesian inference or collapsed Gibbs sampling is often employed to estimate parameters in LDA; however, these inference methods require high computational cost for large-scale data. Therefore, high efficiency technology is needed for this purpose. In this paper, we make use of parallel computation technology for the sake of efficient collapsed Gibbs sampling inference for LDA. We assume to use a shared memory cluster (SMP cluster), which is widely used in recent years. In prior work of parallel inference for LDA, either MPI or OpenMP has been used alone. On the other hand, for a SMP cluster it is more suitable to adopt hybrid parallelization that uses message passing for communication between SMP nodes and loop directives for parallelization within each SMP node. In this paper, we developed a MPI/OpenMP hybrid parallel inference method for LDA, and achieved remarkable speedup under various settings of a SMP cluster.

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


Investigation of multi-modal interface features for adaptive automation of a humanrobot system The objective of this research was to assess the effectiveness of using a multi-modal interface for adaptive automation (AA) of human control of a simulated telerobotic (remote-control, semi-autonomous robotic) system. We investigated the use of one or more sensory channels to cue dynamic control allocations to a human operator or computer, as part of AA, and to support operator system/situation awareness (SA) and performance. It was expected that complex auditory and visual cueing through system interfaces might address previously observed SA decrements due to unannounced or unexpected automation-state changes as part of adaptive system control. AA of the telerobot was based on a predetermined schedule of manual- and supervisory-control allocations occurring when operator workload changes were expected due to the stages of a teleoperation task. The task involved simulated underwater mine disposal and 32 participants were exposed to four types of cueing of task-phase and automation-state changes including icons, earcons, bi-modal (combined) cues and no cues at all. Fully automated control of the telerobot combined with human monitoring produced superior performance compared to completely manual system control and AA. Cueing, in general, led to better performance than none, but did not appear to completely eliminate temporary SA deficits due to changes in control and associated operator reorienting. Bi-modal cueing of dynamic automation-state changes was more supportive of SA than modal (single sensory channel) cueing. The use of icons and earcons appeared to produce no additional perceived workload in comparison no cueing. The results of this research may serve as an applicable guide for the design of humancomputer interfaces for real telerobotic systems, including those used for military tactical operations, which support operator achievement and maintenance of SA and promote performance in using AA.

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

situation awareness
multi-modal interface design
humanrobot interaction


Sliced and Radon Wasserstein Barycenters of Measures This article details two approaches to compute barycenters of measures using 1-D Wasserstein distances along radial projections of the input measures. The first method makes use of the Radon transform of the measures, and the second is the solution of a convex optimization problem over the space of measures. We show several properties of these barycenters and explain their relationship. We show numerical approximation schemes based on a discrete Radon transform and on the resolution of a non-convex optimization problem. We explore the respective merits and drawbacks of each approach on applications to two image processing problems: color transfer and texture mixing.

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

optimal transport
wasserstein distance
barycenter of measures


a conversation model for resolving conflicts among distributed office activities In many cases, office workers perform their tasks based on certain plans. In a cooperative environment, where many individuals establish their plans, conflicts between these plans will inevitably arise. A reason for conflicts between different plans is, for instance, the competition for shared resources such as special equipment or a reservation for a meeting room. In such cases, plans may prevent each other from being executed as intended, which reduces the overall performance of an organization. There are two main problems tackled by our approach: First, to detect potential conflicts between several individual plans as early as possible and, second, to relieve the actors in an organization as much as possible from their burden to settle conflicts. In our approach, conflicts are settled by an agreement among agents in conflict. The agreement is reached by a computer-mediated conversation (negotiation) between the agents. One key factor for the detection of conflicts among individually created plans and for guiding the conflict resolution process are the temporal relationships between actions in conflict. The role of temporal constraints for coordinating distributed activities will be described in detail.

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

conflict resolution
conflict
performance
competition
temporal
model
actors
role
negotiation
organization
detection
relationships
meeting
factor
process
distributed
conversation

coordination activation agent computation mediator constraint sharing environments cooperation resource action


Fuzzy nearest neighbor algorithms: Taxonomy, experimental analysis and prospects A review on the state-of-the-art of fuzzy nearest neighbor classification is proposed. Fuzzy sets theory and several extensions are analyzed as tools to improve the performance of the nearest neighbor classifier. A taxonomy of the existing methods is proposed. A full experimental study is carried out comparing the performance of the methods.

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

fuzzy nearest neighbor
nearest neighbor
taxonomy
classification


on the general motion planning problem with two degrees of freedom We show that, under reasonable assumptions, any collision-avoiding motion planning problem for a moving system with two degrees of freedom can be solved in time &Ogr; (&lgr; s ( n ) log 2 n ), where n is the number of collision constraints imposed on the system, s is a fixed parameter depending e.g. on the maximum algebraic degree of these constraints, and &lgr; s ( n ) is the (almost linear) maximum length of ( n , s ) Davenport Schinzel sequences. This follows from an upper bound of &Ogr; (&lgr; s ( n )) that we establish for the combinatorial complexity of a single connected component of the space of all free placements of the moving system. Although our study is motivated by motion planning, it is actually a study of topological, combinatorial, and algorithmic issues involving a single face in an arrangement of curves. Our results thus extend beyond the area of motion planning, and have applications in many other areas.

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

collision
applications
general
complexity
space
motion planning
arrangement
component


A new model for context-aware transactions in mobile services With the ubiquity of handheld devices (such as smart phones and PDAs) and the availability of a wide range of mobile services (such as mobile banking, road traffic updates, and weather forecast), people can nowadays access information and conduct online transactions virtually anywhere and anytime. In such flexible, dynamic but less reliable environment, transaction management technology is believed to provide service reliability and data consistency. Indeed, in mobile and ubiquitous environments where devices as well as services can seamlessly join and leave the ubiquitous network; transaction management can be very helpful during the recovery of services from failure. Current transaction models and commit protocols do not take into account context information. However, in mobile environments, it is imperative to consider context information in the commit of a transactioni.e., a transaction can be successfully completed if it meets the required context. In this paper, we propose a new model for context-aware transactions and their performance management in mobile environments. Unlike conventional transactions, context-aware transactions adapt to the required context. By context, we mean the services context as well as the users context that includes users needs and preferences. This paper designs and develops the proposed transaction model and evaluates its performance in terms of time and message complexities as well as transactions throughput.

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

context-aware transaction
mobile and ubiquitous services
transaction properties


Real-time brake torque estimation for internal combustion engines Presented is a real-time engine brake torque estimation model where the instantaneous measured engine speed serves as the model input. The model is comprised of notch filters executed in the crank-angle domain to extract mean engine speed and the nth frequency component from the instantaneous engine speed signal in real-time. Here n denotes the number of engine cylinders. Moreover, the engine brake torque estimation is separated into two parts: steady-state and transient. It will be shown that the nth harmonic (in units of periods per engine cycle) of engine speed and mean engine speed are sufficient to estimate the engine brake torque. The steady-state portion of the model is developed using orthogonal least-squares estimation and results in a model with 15 regressors for our particular case. The transient portion is identified using a time domain identification method. Validation of the engine brake torque model is provided using a computational engine model for a 6-cylinder heavy duty diesel engine. Transient engine speed and torque conditions in the presence of sensor noise are evaluated as well as cylinder power imbalance scenarios.

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

internal combustion engine
crank-domain modeling


Application of spreading activation techniques in information retrieval This paper surveys the use of Spreading Activation techniques on Semantic Networks in Associative Information Retrieval. The major Spreading Activation models are presented and their applications to IR is surveyed. A number of works in this area are critically analyzed in order to study the relevance of Spreading Activation for associative IR.

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

spreading activation
semantic networks
associative information retrieval

information storage and retrieval
information processing
knowledge representation


E-file adoption: A study of U.S. taxpayers intentions The United States Congress has set ambitious goals for the diffusion of e-government initiatives. One of congress goals for the 2007 tax year was for 80% of tax and informational returns to be filed electronically (IRS., 2004). In 2008, 90 million Americans choose to e-file (IRS., 2009); however, Congress goal of 80% adoption has still fallen short. This paper integrates the Unified Theory of Acceptance and Use of Technology (UTAUT) model, online trust, perceived risk, and optimism bias into a comprehensive model of e-file adoption. To empirically test the model a survey is administered to 260 United States taxpayers. Structural equation modeling is used to evaluate relationships between these concepts and intention to use. Results indicate performance expectancy, social influence, facilitating conditions, and optimism bias all have a significant impact on e-file intention. Trust in the internet and trust in the e-file provider were shown to significantly influence perceived risk. Implications for practice and research are discussed.

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


Cancer Immunomics Cancer remains one of the leading causes of death worldwide. Thus, to identify any useful biomarkers is still a need. We performed cancer immunomics to identify autoantibody signatures produced in response to the presence of either breast or colorectal cancer. SERological proteome analysis (SERPA) was performed by two-dimensional (2-D) electrophoresis separation, immunoblotting, image analysis, and mass spectrometry. Alternatively, to identify the antigens recognized by the autoantibodies of cancer patients, we developed an approach combining 2-D immunoaffinity chromatography, enzymatic digestion of the isolated antigens, nano flow separation of the resulting peptides, and identificatio

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

autoantibodies
autoantibody
cancer immunomics
mass spectrometry
proteome

autoantibody signature
autoantigen
biomarker
proteomics
serological proteome analysis


Informatics approaches to functional MRI odor mapping of the rodent olfactory bulb - OdorMapBuilder and OdorMapDB The present study applies informatics tools to aid and extend fMRI analysis of the coding mechanism of neural signals in the rodent olfactory system. Odour stimulation evokes unique spatial patterns of activity in the glomerular layer of the mammalian olfactory bulb (OB). An open-source software program, OdorMapBuilder, has been developed to process the high resolution anatomical and functional MRI images of the OB and to generate single two-dimensional flat map, called Odor maps, that describe the spatial activity patterns in the entire glomerular layer. Odor maps help identify the spatial activity patterns from the tremendous amount of fMRI data and they serve the olfactory signals in the Odor response to a given odor stimulation. Based on the fMRI technology OdorMApBuilder provides comparable odor maps on the intra-subject basis, a significant step towards the detailed analyses of the effects of odor types and/or concentrations. In addition, a new database, OdorMapDB, is developed to provide a repository for the generated odor maps,., Web, interfaces. to the database are provided for the data entry, modification and retrieval., OdorMapDB is based on the EAV/CR (entity-attribute-value with classes land relationships) architecture and it is integrated with two other SenseLab olfactory databases: the olfactory receptor and odor databases. Both OdorMapBuilder and OdorMapDB should serve as useful tools and resources for the field and help facilitate experimental research in understanding the olfactory system and the mechanism for smell perception.

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

odor map
spatial activity pattern
java
web-based database
neuroinformatics


On the distribution of linear combinations of independent Gumbel random variables The distribution of linear combinations of independent Gumbel random variables is of great interest for modeling risk and extremes in the most different areas of application. In this paper we develop near-exact approximations for the distribution of linear combination of independent Gumbel random variables based on a shifted generalized near-integer gamma distribution and on the distribution of the difference of two independent generalized integer gamma distributions. These near-exact distributions are computationally appealing and numerical studies confirm their accuracy, as assessed by a proximity measure used in related studies. We illustrate the proposed approximations on applied problems in networks engineering, computational biology, and flood risk management.

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


Survivable Path Computation in PCE-Based Multi-domain Networks We propose an optimal scheme for finding end-to-end shortest disjoint paths with a given sequence of domains in path computation element-based multi-domain networks. We compute the shortest path over multiple domains in the forward direction and compute the disjoint path in the backward direction. The scheme has lower time and message complexity compared to contemporary schemes for finding optimal survivable paths across domains. We prove the optimality of the proposed scheme. To further simplify the implementations in practical scenarios, we also provide heuristic algorithms. Simulation results exhibit superior performance of the proposed optimal and heuristic algorithms compared to existing approaches.

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

multi-domain networks
optimal disjoint path computation
pce


A fast near-optimum block truncation coding method using a truncated K-means algorithm and inter-block correlation Block truncation coding (BTC) is an efficient image compression method which finds application in diverse fields. The basic problem can be viewed as a two-level quantization process. However, efficient ways for optimal threshold determination have not been discovered so far. We propose a fast BTC algorithm based on a truncated K-means algorithm, utilizing the image inter-block correlation and the fact that K-means algorithm converges very fast in this case. This produces near-optimum solution with significantly improved speed over other methods. Simulation results confirm such advantages.

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

k-means algorithm
image content correlation


event-driven processor power management Energy-efficient computing as a research area has been receiving increasing attention in recent years due to rising energy costs and environmental awareness. In this paper, we present an approach to increasing the energy efficiency of modern multi-core computers, which is suitable for scenarios with varying load characteristics often found in private and small office/home office (SOHO) machines. The approach is based on a closer integration of the operating system scheduler and frequency governor, while shifting the mode of operation from time-driven to event-driven. We discuss theoretical as well as practical considerations, and describe experiments for both desktop and server systems. Based on a fully functional implementation within the Linux kernel, it is shown that our approach is feasible and allows for power savings of up to 10\% while delivering a performance comparable to disabled power management and being more energy-efficient than the traditional time-driven variant.

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


Fast image inpainting based on coherence transport High-quality image inpainting methods based on nonlinear higher-order partial differential equations have been developed in the last few years. These methods are iterative by nature, with a time variable serving as iteration parameter. For reasons of stability a large number of iterations can be needed which results in a computational complexity that is often too large for interactive image manipulation. Based on a detailed analysis of stationary first order transport equations the current paper develops a fast noniterative method for image inpainting. It traverses the inpainting domain by the fast marching method just once while transporting, along the way, image values in a coherence direction robustly estimated by means of the structure tensor. Depending on a measure of coherence strength the method switches continuously between diffusion and directional transport. It satisfies a comparison principle. Experiments with the inpainting of gray tone and color images show that the novel algorithm meets the high level of quality of the methods of Bertalmio et al. (SIG-GRAPH '00: Proc. 27th Conf. on Computer Graphics and Interactive Techniques, New Orleans, ACM Press/Addison-Wesley, New York, pp. 417-424, 2000), Masnou (IEEE Trans. Image Process. 11(2):68-76, 2002), and Tschumperle (Int. J. Comput. Vis. 68(1):65-82, 2006), while being faster by at least an order of magnitude.

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

image inpainting
coherence direction
structure tensor
fast marching

disocclusion
hyperbolic equation
eikonal equation
skeleton


An optimal algorithm for two robots path planning problem on the grid Introducing a new concept, time collision cell, for coordinating multi-robots. Introducing a new concept, parking cell, for coordinating multi-robots. Proposing an optimal algorithm for solving minmax path planning for two robots.

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

multi-robot path planning
minmax problem


blind calibration of sensor networks This paper considers the problem of blindly calibrating sensor response using routine sensor network measurements. We show that as long as the sensors slightly oversample the signals of interest, then unknown sensor gains can be perfectly recovered. Remarkably, neither a controlled stimulus nor a dense deployment is required. We also characterize necessary and sufficient conditions for the identification of unknown sensor offsets. Our results exploit incoherence conditions between the basis for the signals and the canonical or natural basis for the sensor measurements. Practical algorithms for gain and offset identification are proposed based on the singular value decomposition and standard least squares techniques. We investigate the robustness of the proposed algorithms to model mismatch and noise on both simulated data and on data from current sensor network deployments.

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

sensor networks
sensor
exploit
identification
data
deployment
calibration
response
model
paper
noise
practical
blind

measurement
simulation
signaling
sampling
standardization
singular value decomposition (svd)
least-squares
algorithm
robust


Partition belief median filter based on DempsterShafer theory for image processing A novel median-type filter controlled by evidence fusion is proposed for removing noise from images. The fusion of evidence based on the DempsterShafer evidence theory, providing a way to deal with the uncertainty in the evidence fusion, indicates to what extent a noise is considered. The filter proposed here is obtained as a weighted sum of the current pixel value and the output of the median filter, and the weight is set based on the belief value of the input signal sequence. The efficient step-like function is used to partition the belief space, and the least mean square (LMS) algorithm is applied to obtain the optimal weight for each block. Moreover, to improve the performance, the new filter is recursively implemented. Experimental results have demonstrated that the proposed filter can outperform many well-accepted median-based filters in preserving image details while effectively suppressing impulsive noises, and it also works satisfactorily in reducing Gaussian as well as the mixture of Gaussian and impulsive noise.

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

impulsive noise
evidence theory
least mean square


Workshop on Internet Economics (WIE2009) Report On September 23, 2009, CAIDA hosted a virtual Workshop on Internet Economics [3] to bring together network technology and policy researchers, commercial Internet facilities and service providers, and communications regulators to explore a common goal: framing a concrete agenda for the emerging but empirically stunted field of Internet infrastructure economics. With participants stretching from Washington D.C. to Queensland, Australia, we used the electronic conference hosting facilities supported by the California Institute of Technology (CalTech) EVO Collaboration Network [2]. This report describes the workshop discussions and presents relevant open research questions identified by participants.

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

legal aspects
management
network management


Site-specific management zones based on the Rasch model and geostatistical techniques Delineation of management zones (MZ), i.e. areas within the field which represent subfield regions of similar production potential, is the first stage to implement site-specific management. During the last years different algorithms have been proposed to define MZ, with different results. In this work, the use of an objective method, the formulation of the Rasch model, which synthesizes data with different units into a uniform analytical framework, is considered to get representative measures of soil fertility potential which could be used to delimit MZ. To illustrate the method, a case study was conducted in a experimental field using five soil properties: clay, sand and silt content, and deep (ECd) and shallow (ECs) soil apparent electrical conductivity (approximately 090 and 030cm depths, respectively). Two main results were obtained after applying this method: (1) a classification of all locations according to the soil fertility potential, which was the value of the Rasch measure and (2) the influence on the soil fertility of each individual soil property, being ECs the most influential and silt content the less influential property. Later, from the measures of soil fertility potential at sampled points, estimates were carried out using the ordinary kriging technique. Consequently, kriged estimates were utilized to map soil fertility potential and MZ were delimited using an equal-size classification method, which practically coincided with the MZ determined by a unsupervised classification. It is also shown the possibility of using probability maps to delimit MZ or provide information for hazard assessment of soil fertility in a field.

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


Modelling process and optimization of EMC filters for power electronics applications Purpose - The frequency simulation and optimisation of electromagnetic compatibility (EMC) filter is often computation time consuming. The purpose of this paper is to propose an approach for easy and fast modelling and optimization of power electronics structures. Design/methodology/approach - The paper proposes an approach for easy and fast modelling and optimization of power electronics structures. It focuses on the EMC filter design. To achieve this task time simulation, FFT and automatic frequency modelling are combined. Findings - An automatic frequency modelling is proposed and also gives automatically the model gradients. Therefore, the model can be used to optimize the EMC filter, but also can help in choosing its topology. Several optimization algorithms are used and compared. Research limitations/implications - The power electronics load is supposed to be a set of predefined harmonic sources, obtained by time simulation + FFT before the optimisation process. Practical implications - The frequency model allows for the rapid designing and comparing of several structures or modelling hypothesis with regard to the parasitic elements and circuit imperfections. Originality/value - The frequency model is automatically generated, and sizing criteria on the component (e.g. inductors, capacitor) can be added in an analytical form, for example, to deal with volume or mass criteria.

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

automatic frequency modelling
electromagnetic compatibility
filter design
optimization

electric power systems
power electronics filters
optimum design


ESPResSo++: A modern multiscale simulation package for soft matter systems The redesigned Extensible Simulation Package for Research on Soft matter systems (ESPResSo++) is a free, open-source, parallelized, object-oriented simulation package designed to perform many-particle simulations, principally molecular dynamics and Monte Carlo, of condensed soft matter systems. In addition to the standard simulation methods found in well-established packages, ESPResSo++ provides the ability to perform Adaptive Resolution Scheme (AdResS) simulations which are multiscale simulations of molecular systems where the level of resolution of each molecule can change on-the-fly. With the main design objective being extensibility, the software features a highly modular C++kernel that is coupled to a Python user interface. This makes it easy to add new algorithms, setup a simulation, perform online analysis, use complex workflows and steer a simulation. The extreme flexibility of the software allows for the study of a wide range of systems. The modular structure enables scientists to use ESPResSo++ as a research platform for their own methodological developments, which at the same time allows the software to grow and acquire the most modern methods. ESPResSo++ is targeted for a broad range of architectures and is licensed under the GNU General Public License.

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

molecular dynamics
monte carlo
simulation
soft matter
extensible