low power vlsi sequential circuit architecture using critical race control This paper describes a new architecture for VLSI sequential circuits and a method to control the critical races that appears subsequently in their feedback loops. This architecture reduces the number of gates resulting in lower power consumption and smaller area of implementation without incurring significant speed penalty. The critical races are controlled by introducing a delay difference between the sections of the loop. This is implemented by scaling the transmission gates already present in the circuit. This method which sizes transistors in close proximity is insensitive to variations in internal and external operating conditions. The paper presents low-power implementation of conventional circuits and of new circuits providing a higher level of integration. When used with asynchronous circuits this architecture enables the operation of circuits that are unusable using present 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 B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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


Cost evolution model to design optical switching fabrics with wavelength converters Optical switching is expected to provide high degree of flexibility in future Internet networking. Exploitation of sub-wavelength domain based on emerging optical technology is attractive from a functional and performance perspective but its feasibility must be proven also in relation to the costs of components. In this paper a new methodology to compare optical switching matrices based on different wavelength converters sharing strategies is presented, which introduces component cost evolution in time. The methodology is applied to compare different switch configurations by taking into account possible evolution in component costs relationship in relation to technology availability. Design guidelines are drawn based on extensive simulations.

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

wavelength conversion
evolution cost model


Enhanced neural gas network for prototype-based clustering In practical cluster analysis tasks, an efficient clustering algorithm should be less sensitive to parameter configurations and tolerate the existence of outliers. Based on the neural gas (NG) network framework, we propose an efficient prototype-based clustering (PBC) algorithm called enhanced neural gas (ENG) network. Several problems associated with the traditional PBC algorithms and original NG algorithm such as sensitivity to initialization, sensitivity to input sequence ordering and the adverse influence from outliers can be effectively tackled in our new scheme. In addition, our new algorithm can establish the topology relationships among the prototypes and all topology-wise badly located prototypes can be relocated to represent more meaningful regions. Experimental results1on synthetic and UCI datasets show that our algorithm possesses superior performance in comparison to several PBC algorithms and their improved variants, such as hard c-means, fuzzy c-means, NG, fuzzy possibilistic c-means, credibilistic fuzzy c-means, hard/fuzzy robust clustering and alternative hard/fuzzy c-means, in static data clustering tasks with a fixed number of prototypes.

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

prototype-based clustering
c-means
minimum description length (mdl)
topology formation
relocation
survey


A simple numerical solution to the Ward-Tordai equation for the adsorption of non-ionic surfactants A simple numerical scheme for solving the equation of Ward and Tordai (1946) for the diffusion-controlled adsorption of non-ionic surfactants to interfaces is proposed and pseudo-code, as well as C++ source code, is provided. The scheme utilises the trapezium rule of numerical integration and the accuracy and robustness of the method is enhanced by the bisection method of root-finding. The scheme is efficient and flexible in that it can be used with any adsorption isotherm and is readily modified for solving the problem of adsorption onto a convex interface. This scheme is not suggested for the adsorption onto a concave interface and the confusions that have previously arisen in relation to this problem are discussed. (C) 2009 Elsevier Ltd. All rights reserved.

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

diffusion-controlled adsorption
non-ionic surfactants
dynamic surface tension


Kernel machine-based rank-lifting regularized discriminant analysis method for face recognition To address two problems, namely nonlinear problem and singularity problem, of linear discriminant analysis (LDA) approach in face recognition, this paper proposes a novel kernel machine-based rank-lifting regularized discriminant analysis (KRLRDA) method. A rank-lifting theorem is first proven using linear algebraic theory. Combining the rank-lifting strategy with three-to-one regularization technique, the complete regularized methodology is developed on the within-class scatter matrix. The proposed regularized scheme not only adjusts the projection directions but tunes their corresponding weights as well. Moreover, it is shown that the final regularized within-class scatter matrix approaches to the original one as the regularized parameter tends to zero. Two public available databases, namely FERET and CMU PIE face databases, are selected for evaluations. Compared with some existing kernel-based LDA methods, the proposed KRLRDA approach gives superior performance.

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

face recognition
nonlinear problem
singularity problem


Zone indexing: Optimizing the balance between searching and indexing in a loosely structured overlay ? While structured peer-to-peer systems are efficient in terms of overhead, they still lack the unstructured systems flexibility and ability to support a wide range of complex queries. This paper examines systems supporting complex queries, deterministic operation, and a fair load distribution between nodes. The aim is to minimize the bandwidth and node load using an optimal level of indexing. The paper first theoretically examines the optimal balance of search and index messages using a search/index space model. This balance is fundamentally determined by the frequency of search requests and index updates. Based on this study, the paper proposes a novel loosely structured peer-to-peer system, Zone indexing, that can balance between index update traffic and search traffic in order to minimize the bandwidth overhead. Nodes are organized into a ring structure. The ring is divided into overlapping zones, within which index updates are distributed. We present an overlay maintenance algorithm with low-cost join and leave operations and a high churn resistance. We further propose a method to dynamically adjust the zone size in order to maintain optimal performance when the network size or user behavior changes. Additionally, we propose a method to limit the search delay by introducing parallel searching. The proposed solutions are evaluated mathematically and the analysis is verified with simulation.

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

peer-to-peer
search algorithm
index algorithm


Onsets Coincidence for Cross-Modal Analysis Cross-modal analysis offers information beyond that extracted from individual modalities. Consider a nontrivial scene, that includes several moving visual objects, some of which emit sounds. The scene is sensed by a camcorder having a single microphone. A task for audio-visual analysis is to assess the number of independent audio-associated visual objects (AVOs), pinpoint the AVOs' spatial locations in the video and isolate each corresponding audio component. We describe an approach that helps handle this challenge. The approach does not inspect the low-level data. Rather, it acknowledges the importance of mid-level features in each modality, which are based on significant temporal changes in each modality. A probabilistic formalism identifies temporal coincidences between these features, yielding cross-modal association and visual localization. This association is further utilized in order to isolate sounds that correspond to each of the localized visual features. This is of particular benefit in harmonic sounds, as it enables subsequent isolation of each audio source. We demonstrate this approach in challenging experiments. In these experiments, multiple objects move simultaneously, creating motion distractions for one another, and produce simultaneous sounds which mix.

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

correlators
cross-sensor fusion
machine vision
multimodal analysis
multisensor fusion


An age-structured model for the AIDS epidemic Recent research has shown that the incubation period of HIV, the virus that leads to AIDS, is clearly age dependent. This paper describes a model that takes as input an age-profile from the homosexual population and outputs the changing profiles over time of the susceptible, HIV infectives and AIDS cases. Where possible comparisons have been made with European data, in particular from the Greater London region and France. The model can be adapted to incorporate the effects of campaigns such as government-sponsored AIDS prevention programmes. In particular, it is possible to determine which age-groups need to be targeted for a campaign to be most effective. Similarly, the model could be helpful in mounting age-dependent treatment programmes.

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


Variation of reaction dynamics for OH hydrogen abstraction from glycine between ab initio levels of theory The variation in reaction dynamics of OH hydrogen abstraction from glycine between HF, MP2, CCSD(T), M05-2X, BHandHLYP, and B3LYP levels was demonstrated. The abstraction mode shows distinct patterns between these five levels and determines the barrier height, and the spin density transfer between OH radical and glycine. These differences are mainly resulted from the spin density distribution and geometry of the alpha carbon during the abstraction. The captodative effect which is commonly believed as one of the major factors to stabilize the caron-centered radical can only be observed in DFT levels but not in HF and MP2 levels. Difference in the abstraction energy were found in these calculation levels, by using the result of CCSD(T) as reference, B3LYP, BHandHLYP, and M05-2X underestimated the reaction barrier about 5.1, 0.1, and 2.4 kcal mol(-1), while HF and MP2 overestimated 19.1 kcal mol(-1) and 1.6 kcal mol(-1), respectively. These differences can be characterized by the vibration mode of imaginary frequency of transition states, which indicates the topology around transition states and determines reaction barrier height. In this model system, BHandHLYP provides the best prediction of the energy barrier among those tested methods.

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

(alpha)carbon-centered radical
reaction pathway


Improving nearest neighbor classification with cam weighted distance Nearest neighbor (NN) classification assumes locally constant class conditional probabilities, and suffers from bias in high dimensions with a small sample set. In this paper, we propose a novel cam weighted distance to ameliorate the curse of dimensionality. Different from the existing neighborhood-based methods which only analyze a small space emanating from the query sample, the proposed nearest neighbor classification using the cam weighted distance (CamNN) optimizes the distance measure based on the analysis of inter-prototype relationship. Our motivation comes from the observation that the prototypes are not isolated. Prototypes with different surroundings should have different effects in the classification. The proposed cam weighted distance is orientation and scale adaptive to take advantage of the relevant information of inter-prototype relationship, so that a better classification performance can be achieved. Experiments show that CamNN significantly outperforms one nearest neighbor classification (1-NN) and k k -nearest neighbor classification (k k -NN) in most benchmarks, while its computational complexity is comparable with that of 1-NN classification.

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


optimization of morphological data in numerical taxonomy analysis using genetic algorithms feature selection method Studies in Numerical Taxonomy are carried out by measuring characters as much as possible. The workload over scientists and labor to perform measurements will increase proportionally with the number of variables (or characters) to be used in the study. However, some part of the data may be irrelevant or sometimes meaningless. Here in this study, we introduce an algorithm to obtain a subset of data with minimum characters that can represent original data. Morphological characters were used in optimization of data by Genetic Algorithms Feature Selection method. The analyses were performed on an 18 character*11 taxa data matrix with standardized continuous characters. The analyses resulted in a minimum set of 2 characters, which means the original tree based on the complete data can also be constructed by those two characters.

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

morphological data
optimization
genetic algorithms


Model-driven coordinated management of data centers Management of computing infrastructure in data centers is an important and challenging problem, that needs to: (i) ensure availability of services conforming to the Service Level Agreements (SLAs); and (ii) reduce the Power Usage Effectiveness (PUE), i.e. the ratio of total power, up to half of which is attributed to data center cooling, over the computing power to service the workloads. The cooling energy consumption can be reduced by allowing higher-than-usual thermostat set temperatures while maintaining the ambient temperature in the data center room within manufacturer-specified server redline temperatures for their reliable operations. This paper proposes: (i) a Coordinated Job, Power, and Cooling Management (JPCM) policy, which performs: (a) job management so as to allow for an increase in the thermostat setting of the cooling unit while meeting the SLA requirements, (b) power management to reduce the produced thermal load, and (c) cooling management to dynamically adjust the thermostat setting; and (ii) a Model-driven coordinated Management Architecture (MMA), which uses a state-based model to dynamically decide the correct management policy to handle events, such as new workload arrival or failure of a cooling unit, that can trigger an increase in the ambient temperature. Each event is associated with a time window, referred to as the window-of-opportunity, after which the temperature at the inlet of one or more servers can go beyond the redline temperature if proper management policies are not enforced. This window-of-opportunity monotonically decreases with increase in the incoming workload. The selection of the management policy depends on their potential energy benefits and the conformance of the delays in their actuation to the window-of-opportunity. Simulations based on actual job traces from the ASU HPC data center show that the JPCM can achieve up to 18% energy-savings over separated power or job management policies. However, high delay to reach a stable ambient temperature (in case of cooling management through dynamic thermostat setting) can violate the server redline temperatures. A management decision chart is developed as part of MMA to autonomically employ the management policy with maximum energy-savings without violating the window-of-opportunity, and hence the redline temperatures. Further, a prototype of the JPCM is developed by configuring the widely used Moab cluster manager to dynamically change the server priorities for job assignment. (C) 2010 Elsevier B.V. All rights reserved.

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

data center
coordinated management
job management
power management
cooling management


Fast SDP relaxations of graph cut clustering, transduction, and other combinatorial problems The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent developement, the relaxation of combinatorial problems to semi-definite programs ( SDP), has gained considerable attention over the last decade (Helmberg, 2000; De Bie and Cristianini, 2004a). Although SDP problems can be solved in polynomial time, for many relaxations the exponent in the polynomial complexity bounds is too high for scaling to large problem sizes. This has hampered their uptake as a powerful new tool in machine learning. In this paper, we present a new and fast SDP relaxation of the normalized graph cut problem, and investigate its usefulness in unsupervised and semi-supervised learning. In particular, this provides a convex algorithm for transduction, as well as approaches to clustering. We further propose a whole cascade of fast relaxations that all hold the middle between older spectral relaxations and the new SDP relaxation, allowing one to trade off computational cost versus relaxation accuracy. Finally, we discuss how the methodology developed in this paper can be applied to other combinatorial problems in machine learning, and we treat the max-cut problem as an example.

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

convex transduction
semi-definite programming
semi-supervised learning
combinatorial optimization
max-cut


An operational decision model for lead-time and price quotation in congested manufacturing systems This paper considers the problem of determining the lead-time and price to be quoted to a single order in a make-to-order manufacturing setting. The manufacturing system consists of several processing centers all subject to random failures and repairs. Because of a time window constraint on the delivery of the order, the latter has to be split among several processing centers to meet the constraint imposed on its delivery date. The assignment of lots to the processing centers is based on minimizing the operating cost associated with the entire order (i.e., its price). Two major cases are studied: the case of rushed order and the case of regular order. Each case has two options: Partial deliveries allowed and partial deliveries not allowed. Exact and heuristic algorithms are developed for each situation. Numerical results are used to draw conclusions and test the performance of the heuristics.

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

production planning
scheduling
lot sizing
stochastic
optimization


Fuzzy preference-based multi-objective optimization method Multiobjective evolutionary computation is still quite young and there are many open research problems. This paper is an attempt to design a hybridized Multiobjective Evolutionary Optimization Algorithm with fuzzy logic called Fuzzy Preference-Based Multi-Objective Optimization Method (FPMOM). FPMOM as an integrated components of Multiobjective Optimization Technique, Evolutionary Algorithm and Fuzzy Inference System able to search and filter the pareto-optimal and provide a good trade-off solution for the multiobjective problem using fuzzy inference method to choose the user intuitive based specific trade-off requirement. This paper will provide a new insight into the behaviourism of interactive Multiobjective Evolutionary Algorithm optimization problems using fuzzy inference method.

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

multiobjective
optimization
evolutionary algorithm
fuzzy inference


Mass preserving discontinuous Galerkin methods for Schrdinger equations We construct, analyze and numerically validate a class of mass preserving, direct discontinuous Galerkin (DDG) schemes for Schrdinger equations subject to both linear and nonlinear potentials. Up to round-off error, these schemes preserve the discrete version of the mass of the continuous solution. For time discretization, we use the CrankNicolson for linear Schrdinger equations, and the Strang splitting for nonlinear Schrdinger equations, so that numerical mass is still preserved at each time step. The DDG method when applied to linear Schrdinger equations is shown to have the optimal (k+1 k + 1 )th order of accuracy for polynomial elements of degree k. The numerical tests demonstrate both accuracy and capacity of these methods.

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

schrdinger equation
numerical flux
mass conservation
strang splitting method


A conservative discretization of the PoissonNernstPlanck equations on adaptive Cartesian grids In this paper we present a novel hybrid finite-difference/finite-volume method for the numerical solution of the nonlinear PoissonNernstPlanck (PNP) equations on irregular domains. The method is described in two spatial dimensions but can be extended to three dimensional problems as well. The boundary of the irregular domain is represented implicitly via the zero level set of a signed distance function and quadtree data structures are used to systematically generate adaptive grids needed to accurately capture the electric double layer near the boundary. To handle the nonlinearity in the PNP equations efficiently, a semi-implicit time integration method is utilized. An important feature of our method is that total number of ions in the system is conserved by carefully imposing the boundary conditions, by utilizing a conservative discretization of the diffusive and, more importantly, the nonlinear migrative flux term. Several numerical experiments are conducted which illustrate that the presented method is first-order accurate in time and second-order accurate in space. Moreover, these tests explicitly indicate that the algorithm is also conservative. Finally we illustrate the applicability of our method in the study of the charging dynamics of porous supercapacitors.

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

nonlinear poissonnernstplanck equation
non-graded adaptive grid
quadtree data structure
second-order discretization
arbitrary geometries
level-set


A NOTE ON ANALYTIC SIGNALS WITH NONLINEAR PHASE Instantaneous frequency, defined as the derivative of the phase of a complex analytic representation of the signal, is a basic concept and plays an important role in communication and information processing. It is not unusual to expect that the instantaneous frequency of an analytic signal is nonnegative. In this note, we exhibit new families of analytic signals with band-limited amplitudes and positive nonlinear instantaneous frequencies. The structures of analytic signals with band-limited amplitude and rational as well as linear plus periodic instantaneous frequencies have been analyzed.

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


object-oriented composition untangled Object-oriented languages come with pre-defined composition mechansims, such as inheritance, object composition, or delegation, each characterized by a certain set of composition properties, which do not themselves individually exist as abstractions at the language level. However, often non-standard composition semantics is needed, with a mixture of composition mechanisms. Such non-standard semantics are simulated by complicated architectures that are sensitive to requirement changes and cannot easily be adapted without invalidating existing clients. In this paper, we propose compound references , a new abstraction for object references, that allows us to provide explicit linguistic means for expressing and combining individual composition properties on-demand. The model is statically typed and allows the programmer to express a seamless spectrum of composition semantics in the interval between object composition and inheritance. The resulting programs are better understandable, due to explicity expressed design decisions, and less sensitive to requirement changes.

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

sensitive interval inheritance abstraction language design object delegation model paper programmer

requirements
program
simulation
semantic
architecture
standardization
linguistics
object-oriented
compositing
combinational
change
object oriented language


Spatial reasoning under imprecision using fuzzy set theory, formal logics and mathematical morphology In spatial reasoning, in particular for applications in image understanding, structure recognition and computer vision, a lot of attention has to be paid to spatial relationships and to the imprecision attached to information and knowledge to be handled. Two main components are knowledge representation and reasoning. We show in this paper that the fuzzy Set framework associated to the formalism provided by mathematical morphology and formal logics allows its to derive appropriate representations and reasoning tools. (C) 2005 Elsevier Inc. All rights reserved.

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

spatial reasoning
imprecision
spatial relationships

fuzzy sets
fuzzy mathematical morphology
morpho-logics
fusion
decision making
image interpretation
model-based recognition


evaluating web usability using small display devices Usability is an important issue studied by many researchers and practitioners. Specifically, we are interested in evaluating web usability using small display devices. In this paper we evaluate different type of navigation using small display devices: links, folio and search. In order to evaluate it, we propose a laboratory prototype.

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

usability testing
field-testing
pda
laboratory testing


Calculation of electronic properties in AlxGa1?x delta-doped systems The calculation of the electronic energy levels of n-type ?-doped quantum wells in a AlGaAs matrix is presented. Many-body effects in the two-dimensional electron gas are taken into account by using a local-density Thomas-Fermi approach. Special consideration is taken into when the values of the Al molar fraction x?0.45, and the ternary alloy becomes an indirect gap material. The results suggest that in this case the AlxGa1?xAs can support two-dimensional conduction channels associated to the delta-doping, with carrier densities exceeding 1013cm?2.

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


Strategies to Exploit Non-Quadratic Local Stability Analysis An original solution to overcome infeasible global quadratic conditions for stability of continuous-time nonlinear models via a Takagi-Sugeno (TS) representation has recently appeared. By changing the paradigm of global stability for something less restrictive a nice solution providing an estimation of the stability domain (local asymptotic conditions) is found, as it is usually the case for nonlinear models for which stability and/or stabilization cannot be reached globally. Strategies to get better estimations with lower computational cost are hereby presented to fully exploit the new approach; some hard nonlinear problems are thus systematically solved. Since the proposed conditions are expressed as linear matrix inequalities (LMIs) they can be efficiently solved by convex optimization techniques. Illustrative examples are provided to show the efficiency of the new technique which outperforms available stability analysis by escaping the quadratic framework.

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

takagi-sugeno models
nonquadratic stability
local asymptotic stability
lyapunov function
linear matrix inequality (lmi)


OPTIMAL SELECTION OF SAMPLING LOCATIONS AND C-CHART PARAMETERS This paper presents a method for designing a statistical process central program over the attributes of a multi-stage discrete part manufacturing system. The objective of the program is to minimize the sum of the costs of bad quality, inspection, searching for special causes of variation, process adjustment, and reworking of rejected items. The costs are affected by two interacting levels of decision, macro and micro. The macro level selects the points in the process at which quality control is exercised, referred to here as quality control windows. The micro level determines the control chart parameters, namely frequency of sampling, the sample size, and the chart range.

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

statistical process control
optimum allocation of inspection effort
economic control chart parameters


Learning and diagnosis of individual and class conceptual perspectives: an intelligent systems approach using clustering techniques In a classroom, a teacher attempts to convey his or her knowledge to the students. and thus it is important for the teacher to obtain formative feedback about how well students are understanding the new material. By gaining insight into the students' understanding and possible misconceptions. the teacher will be able to adjust the teaching and to supply more useful learning materials as necessary. Therefore. the diagnosis of formative student evaluations is critical for teachers and learners, as is the diagnosis of patterns in the overall learning by a class in order to inform a teacher about the efficacy of his or her teaching. This paper investigates what might be called the "class learning diagnosis problem" by embedding important concepts in a test and analyzing the results with a hierarchical coding scheme. Based on previous research. the part-of and type-of relationships among concepts are used to construct a concept hierarchy that may then be coded hierarchically. All concepts embedded in the test items then can be formulated into concept matrices, and the answer sheets of the learners in a class are then analyzed to indicate particular types of concept errors. The trajectories of concept errors are studied to identify both individual misconceptions students might have as well as patterns of misunderstanding in the overall class. In particular, a clustering algorithm is employed to distinguish student groups who might share similar misconceptions. These approaches are implemented as an integrated module in a previously developed system and applied to two real classroom data sets, the results of which show the practicability of this proposed method. (C) 2004 Elsevier Ltd. All rights reserved.

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


lower bounds for algebraic computation trees A topological method is given for obtaining lower bounds for the height of algebraic computation trees, and algebraic decision trees. Using this method we are able to generalize, and present in a uniform and easy way, almost all the known nonlinear lower bounds for algebraic computations. Applying the method to decision trees we extend all the apparently known lower bounds for linear decision trees to bounded degree algebraic decision trees, thus answering the open questions raised by Steele and Yao [20]. We also show how this new method can be used to establish lower bounds on the complexity of constructions with ruler and compass in plane Euclidean geometry.

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

trees geometry complexity method computation


End-to-end fair rate optimization in wired-cum-wireless networks In this paper, we address the end-to-end rate optimization problem in a wired-cum-wireless network, where CSMA/CA based wireless LANs extend a wired backbone and provide access to mobile users. The objective is to achieve proportional fairness amongst the end-to-end sessions in the network. Since the network contains wireless links whose attainable throughput is a (non-convex and non-separable) function of MAC protocol parameters, the problem requires joint optimization at both the transport and the link layers. A dual-based algorithm is proposed in this paper to solve this cross-layer rate optimization problem. It is implemented in the distributed manner, and works at the link layer to adjust scheduling rates for the wireless links in the basic service sets, and at the transport layer to adjust end-to-end session rates. We prove rigorously that the proposed algorithm converges to the globally optimal rates. Simulation results are provided to support our conclusions. (C) 2008 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 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

cross-layer rate control
wired-cum-wireless networks


Behavior-Oriented Data Resource Management in Medical Sensing Systems Wearable sensing systems have recently enabled a variety of medical monitoring and diagnostic applications in wireless health. The need for multiple sensors and constant monitoring leads these systems to be power hungry and expensive with short operating lifetimes. We introduce a novel methodology that takes advantage of contextual and semantic properties in human behavior to enable efficient design and optimization of such systems from the data and information point of view. This, in turn, directly influences the wireless communication and local processing power consumption. We exploit intrinsic space and temporal correlations between sensor data while considering both user and system contextual behavior. Our goal is to select a small subset of sensors that accurately capture and/or predict all possible signals of a fully instrumented wearable sensing system. Our approach leverages novel modeling, partitioning, and behavioral optimization, which consists of signal characterization, segmentation and time shifting, mutual signal prediction, and a simultaneous minimization composed of subset sensor selection and opportunistic sampling. We demonstrate the effectiveness of the technique on an insole instrumented with 99 pressure sensors placed in each shoe, which cover the bottom of the entire foot, resulting in energy reduction of 72% to 97% for error rates of 5% to 17.5%.

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

algorithm
performance
wearable medical systems
energy optimization
physiological behavior modeling
behavioral sensing


Videogames decoupled discrete event simulation Real-time graphic applications and specifically videogames, follow a paradigm of continuous simulation that couples the simulation phase and the rendering phase. This paradigm can be inefficient (inadequate computer power distribution) or it can produce incorrect simulations (disordered events execution or events lost). The use of a decoupled discrete paradigm avoids incorrect simulations, besides it improves the simulation quality and efficiency. GDESK is a discrete decoupled simulation kernel that can be integrated in any videogame or real-time graphic application to change its simulation paradigm to a discrete decoupled one. Once GDESK is integrated inside the videogame, it becomes into a set of objects being communicated by messages. Messages are modeled using discrete events. GDESK manages the messages exchange process (events synchronization, messages sending and reception process, etc.).

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


A finite volume approach to simulation of polymer melt flow in channels Purpose - Numerical simulation of polymer injection processes has become increasingly common in mould design. In industry, such a task is accomplished mainly by using commercial packages. Owing to the complexities inherent of this class of problems, most commercial codes attempt to combine realistic rheological descriptions with simplified numerical models. In spite of the apparent success, such approaches are not able to capture important aspects of the flow topology. The present work aims to describe a more elaborate mathematical model based on finite volumes which is able to provide both accurate solutions and further insights on the physics of the polymer flow. Design/methodology/approach - The mathematical model comprises the momentum and energy equations and a Poisson equation for pressure to impose the incompressibility constraint. The governing equations are discretized using the finite volume method based on central, second-order accurate formulas for both convection and diffusion terms. Artificial dissipation terms are added externally in order to control the odd-even decoupling problem. Findings - The numerical model was conceived within the framework of a generalized Newtonian formulation. The capability of the numerical scheme is illustrated by simulations using three distinct constitutive relations to approach the non-Newtonian behaviour of the polymer melt: isothermal power-law, modified Arrhenius power-law and cross models. Originality/value - This paper extends the computational strategies previously developed to Newtonian fluids to account for more complex constitutive relations. The velocity and temperature coupled solution for polymer melts using only second-order accurate formulas constitute also a relevant contribution.

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


Enhanced adaptive grey-prediction self-organizing fuzzy sliding-mode controller for robotic systems A grey-prediction self-organizing fuzzy controller (GPSOFC) has been proposed to control robotic systems. It solves the problems caused by the inappropriate selection of parameters in a self-organizing fuzzy controller (SOFC) and eliminates the dynamic coupling effects between degrees of freedom (DOFs) in robotic systems. However, its stability is difficult to demonstrate. To overcome the stability issue, this study developed an enhanced adaptive grey-prediction self-organizing fuzzy sliding-mode controller (EAGSFSC) for robotic systems. The EAGSFSC not only solves the problem of a GPSOFC implementation by determining the stability of the system but also applies an adaptive law to modify the fuzzy consequent parameter of a fuzzy logic controller for manipulating a robotic system to improve its control performance. The stability of the EAGSFSC was proven using the Lyapunov stability theorem. To confirm the suitability of the proposed method, this study applied the EAGSFSC to manipulate a 6-DOF robot to determine its control performance. Experimental results showed that the EAGSFSC achieved better control performance than the GPSOFC as well as the SOFC for robotic motion control. (C) 2013 Elsevier Inc. All rights reserved.

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

grey-prediction
self-organizing fuzzy controller
sliding-mode
sliding surface


representing document as dependency graph for document clustering In traditional clustering methods, a document is often represented as "bag of words" (in BOW model) or n-grams (in suffix tree document model) without considering the natural language relationships between the words. In this paper, we propose a novel approach DGDC (Dependency Graph-based Document Clustering algorithm) to address this issue. In our algorithm, each document is represented as a dependency graph where the nodes correspond to words which can be seen as meta-descriptions of the document; whereas the edges stand for the relations between pairs of words. A new similarity measure is proposed to compute the pairwise similarity of documents based on their corresponding dependency graphs. By applying the new similarity measure in the Group-average Agglomerative Hierarchial Clustering (GAHC) algorithm, the final clusters of documents can be obtained. The experiments were carried out on five public document datasets. The empirical results have indicated that the DGDC algorithm can achieve better performance in document clustering tasks compared with other approaches based on the BOW model and suffix tree document model.

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

document clustering
dependency graph
similarity measure


Computational complexity of counting problems on 3-regular planar graphs A variety of counting problems on 3-regular planar graphs are considered in this paper. We give a sufficient condition which guarantees that the coefficients of a homogeneous polynomial can be uniquely determined by its values on a recurrence sequence. This result enables us to use the polynomial interpolation technique in high dimension to prove the #P-completeness of problems on graphs with special requirements. Using this method, we show that #3-Regular Bipartite Planar Vertex Covers is #P-complete. Furthermore, we use Valiant's Holant Theorem to construct a holographic reduction from it to #2,3-Regular Bipartite Planar Matchings, establishing the #P-completeness of the latter. Finally, we completely classify the problems #Planar Read-twice 3SAT with different ternary symmetric relations according to their computational complexity, by giving several more applications of holographic reduction in proving the #P-completeness of the corresponding counting problems. (c) 2007 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 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


Highly available and heterogeneous continuous media storage systems A number of recent technological trends have made data intensive applications such as continuous media (audio and video) servers a reality. These servers store and retrieve large volumes of data using magnetic disks. Servers consisting of multiple nodes and large arrays of heterogeneous disk drives have become a fact of life for several reasons. First, magnetic disks might fail. Failed disks are almost always replaced with newer disk models because the current technological trend for these devices is one of annual increase in both performance and storage capacity. Second, storage requirements are ever increasing, forcing servers to be scaled up progressively. In this study, we present a framework to enable parity-based data protection for heterogeneous storage systems and to compute their mean lifetime. We describe the tradeoffs associated with three alternative techniques: independent subservers, dependent subservers, and disk merging. The disk merging approach provides a solution for systems that require highly available secondary storage in environments that also necessitate maximum flexibility.

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

continuous media servers
fault tolerance
high availability
magnetic disk replacement
streaming media servers


Bargaining strategies designed by evolutionary algorithms This paper explores the possibility of using evolutionary algorithms (EAs) to automatically generate efficient and stable strategies for complicated bargaining problems. This idea is elaborated by means of case studies. We design artificial players whose learning and self-improving capabilities are powered by EAs, while neither game-theoretic knowledge nor human expertise in game theory is required. The experimental results show that a co-evolutionary algorithm (CO-EA) selects those solutions which are identical or statistically approximate to the known game-theoretic solutions. Moreover, these evolved solutions clearly demonstrate the key game-theoretic properties on efficiency and stability. The performance of CO-EA and that of a multi-objective evolutionary algorithm (MOEA) on the same problems are analyzed and compared. Our studies suggest that for real-world bargaining problems, EAs should automatically design bargaining strategies bearing the attractive properties of the solution concepts in game theory.

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


Greening wireless communications: Status and future directions In recent years, concerns on energy consumption and greenhouse pollution due to the operation of wireless devices have triggered a vast amount of research work on the so called green wireless technologies, leading to new, energy-aware proposals. Even for the case of battery powered devices, where energy conservation is a key design goal, new approaches have been proposed, based on a better understanding of the cost-performance trade-offs introduced by energy efficient operation, while increasingly focusing on emerging communication technologies, e.g., body sensor networks, MIMO or LTE. This paper presents a survey of the recent proposals for green wireless communications, with a view to understanding the most relevant sources of inefficient energy consumption and how these are tackled by current solutions. We introduce a classification of the existing mechanisms based on their operational time-scale, discuss the most important techniques employed to date from this perspective, analyze the employed evaluation methodologies and undertake a quantitative comparison of their performance gains. Following this analysis, we identify the key challenges yet to be addressed by the research community, as well as several possible future directions towards greener communications. (C) 2012 Elsevier B.V. All rights reserved.

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

wireless networks
energy efficiency
power consumption


Multifocus Image Fusion Scheme Using Feature Contrast of Orientation Information Measure in Lifting Stationary Wavelet Domain In this paper, a novel image fusion algorithm based on orientation information measure and lifting stationary wavelet transform (LSWT) is proposed, aiming at solving the fusion problem of multifocus images. In order to select the coefficients of the fused image properly, the selection principles for different subbands are discussed, respectively. For choosing the low frequency subband coefficients, a new sum-modified-Laplacian (NSML) of the orientation information measure is proposed and used as the focus measure to fuse the low frequency subband. When choosing the high frequency subband coefficients, a novel feature contrast of the orientation information measure, which can effectively restrain the influence of noise and can be used as the activity-level measurement to select coefficients from the sharpness parts of the high frequency subimages, is proposed. Experimental results indicate that the proposed fusion approach cannot only extract more important visual information from source images, but also effectively avoid the introduction of artificial information. It significantly outperforms the traditional fusion methods in fusion multifocus clean images and multifocus noisy images, in terms of both visual quality and objective evaluation.

O B I O O B I O B I I O O O O O O O O O O B I 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 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 B I O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 fusion
orientation information measure
feature contrast

lifting stationary wavelet transform (lswt)


Supporting the annotation of chronic obstructive pulmonary disease (COPD) phenotypes with text mining workflows Chronic obstructive pulmonary disease (COPD) is a life-threatening lung disorder whose recent prevalence has led to an increasing burden on public healthcare. Phenotypic information in electronic clinical records is essential in providing suitable personalised treatment to patients with COPD. However, as phenotypes are often hidden within free text in clinical records, clinicians could benefit from text mining systems that facilitate their prompt recognition. This paper reports on a semi-automatic methodology for producing a corpus that can ultimately support the development of text mining tools that, in turn, will expedite the process of identifying groups of COPD patients.

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

corpus annotation
phenotype curation
automatic annotation workflows
ontology linking
corpora for clinical text mining


Analysis of global exponential stability and periodic solutions of neural networks with time-varying delays ? In this paper, a general class of recurrent neural networks with time-varying delays is studied. Some novel and sufficient conditions are given to guarantee the global exponential stability of the equilibrium point and the existence of periodic solutions for such delayed neural networks. Comparing with some previous literature, in which the time-varying delays were assumed to be differentiable and their derivatives were simultaneously required to be not greater than 1, the restrictions on the time-varying delays are removed. Therefore, our results obtained here improve and extend some previously related results. Finally, two numerical examples are provided to illustrate our theorems.

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

neural networks
global exponential stability
periodic solutions

time-varying delays
nonsingular m-matrix


An ontology-based comparative anatomy information system This paper describes the design, implementation, and potential use of a comparative anatomy information system (CAIS) for querying on similarities and differences between homologous anatomical structures across species, the knowledge base it operates upon, the method it uses for determining the answers to the queries, and the user interface it employs to present the results. The relevant informatics contributions of our work include (1) the development and application of the structural difference method, a formalism for symbolically representing anatomical similarities and differences across species; (2) the design of the structure of a mapping between the anatomical models of two different species and its application to information about specific structures in humans, mice, and rats; and (3) the design of the internal syntax and semantics of the query language. These contributions provide the foundation for the development of a working system that allows users to submit queries about the similarities and differences between mouse, rat, and human anatomy; delivers result sets that describe those similarities and differences in symbolic terms; and serves as a prototype for the extension of the knowledge base to any number of species. Additionally, we expanded the domain knowledge by identifying medically relevant structural questions for the human, the mouse, and the rat, and made an initial foray into the validation of the application and its content by means of user questionnaires, software testing, and other feedback. The anatomical structures of the species to be compared, as well as the mappings between species, are modeled on templates from the Foundational Model of Anatomy knowledge base, and compared using graph-matching techniques. A graphical user interface allows users to issue queries that retrieve information concerning similarities and differences between structures in the species being examined. Queries from diverse information sources, including domain experts, peer-reviewed articles, and reference books, have been used to test the system and to illustrate its potential use in comparative anatomy studies. 157 test queries were submitted to the CAIS system, and all of them were correctly answered. The interface was evaluated in terms of clarity and ease of use. This testing determined that the application works well, and is fairly intuitive to use, but users want to see more clarification of the meaning of the different types of possible queries. Some of the interface issues will naturally be resolved as we refine our conceptual model to deal with partial and complex homologies in the content. The CAIS system and its associated methods are expected to be useful to biologists and translational medicine researchers. Possible applications range from supporting theoretical work in clarifying and modeling ontogenetic, physiological, pathological, and evolutionary transformations, to concrete techniques for improving the analysis of genotypephenotype relationships among various animal models in support of a wide array of clinical and scientific initiatives.

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

ontology
comparative anatomy
protg
homology
graph matching
graph similarity
isomorphism
foundational model of anatomy


Design a Wind Speed Prediction Model Using Probabilistic Fuzzy System Generation of wind is a very complicated process and influenced by large numbers of unknown factors. A probabilistic fuzzy system based prediction model is designed for the short-term wind speed prediction. By introducing the third probability dimension, the proposed prediction model can capture both stochastic and the deterministic uncertainties, and guarantee a better prediction in complex stochastic environment. The effectiveness of this intelligent wind speed prediction model is demonstrated by the simulations on a group of wind speed data. The robust modeling performance further discloses its potential in the practical prediction of wind speed under complex circumstance.

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

probabilistic fuzzy inference
probabilistic fuzzy logic system
probabilistic fuzzy set
probabilistic modeling


A Multi-Versioning Scheme for Intention Preservation in Collaborative Editing Systems Although the multi-version approach to consistency maintenance has been widely discussed and implemented in database systems, version control systems, and asynchronous groupware systems, its potential in real-time groupware systems is largely unexplored. Intention preservation is an important aspect of consistency maintenance in real-time collaborative editing systems, where multiple users cooperate with each other by concurrently editing the same document. The multi-version approach is supposed to be able to preserve individual users' concurrent conflicting intentions. In this article, we propose a new multi-versioning scheme that can preserve not only concurrent conflicting intentions but also contextual intentions while achieving convergence of the document under editing. By extending an existing multi-versioning scheme to a general one that specifies the conditions for convergence, we decouple the discussion of convergence from that of intention preservation. By constraining the general scheme, we arrive at the novel scheme that guarantees to preserve users' intentions. The correctness of the scheme has been formally verified. The design of an algorithm for consistent version composition and identification has been discussed in detail.

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

consistency maintenance
groupware
intention preservation

cscw
distributed systems
group editors
multi-versioning
real-time


An optimized texture-by-numbers synthesis method and its visual applications The framework of texture-by-numbers (TBN) synthesizes images of global-varying patterns with intuitive user control. Previous TBN synthesis methods have difficulties in achieving high-quality synthesis results and efficiency simultaneously. This paper proposes a fast TBN synthesis method based on texture optimization, which uses global optimization to solve the controllable non-homogeneous texture synthesis problem. Our algorithm produces high quality synthesis results by combining texture optimization into TBN framework with two improvements. The initialization process is adopted to generate the initial output of the global optimization algorithm, which speeds up the algorithm's convergence rate and enhances synthesis quality. Besides distance metrics to measure image similarities are specifically designed for different images to better match human visual perception for structural patterns and a user study is conducted to verify the effectiveness of the metrics. To further improve the synthesis speed, the algorithm is entirely implemented on GPU based on CUDA architecture. The optimized TBN method is applied to various visual applications including not only traditional TBN applications, but also image in-painting and texture-based flow visualization. The experimental results show that our method synthesizes images of higher or comparable qualities with higher efficiency than other state-of-art synthesis methods.

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


Constructing an object-oriented architecture for Web application testing The variety of existing web application frameworks has lead to the development of a wide range of Web applications for both the Internet and intranets. Web applications are constructed based on various frameworks ranging from simple HTML-based forms to complicated distributed-object computations based on Java and CORBA. Web software enables programmers to choose a proper framework for their own Web applications. The prevalence of Web-based applications has also led to the need to adapt software testing frameworks and tools for them, This study presents a software testing architecture that integrates several common but enhanced testing tools as a sub-architecture to fit a common Web application framework. The architecture reuses several software patterns and architectures from traditional testing environments. A Web application testing environment prototype is also constructed to demonstrate the feasibility of the proposed architecture.

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

web application testing
software testing

software architecture
framework reuse
object-orientation


Refinery advanced process control planning system The process of enhancing a refinery's performance through advanced control usually requires extensive analysis on the plant to determine factors that are constraining the plant from reaching optimum production conditions. An advanced control planning environment (APCO) was developed using mixed integer-programming methodology. It was supported by a friendly graphical user interface (GUI), to make it easy and accessible to refinery planning engineers. Advanced process control benefits programmed into advanced process control optimizer (APCO) are based on benefits already computed for a major refinery in Kuwait. In here, APCO has been customized to adapt a simplified flowsheet model for a 60000-barrel per day refinery. A number of case studies are included to demonstrate the capabilities of APCO. The case studies reflect situations encountered by decision-makers in refineries. These include single and multiyear plans, as well as self-funded and unit capacity limiting plans. APCO facilitates developing and evaluating different economical scenarios. Results show that analysis of APC benefits and their interaction among units would uncover APC implementations that are otherwise not considered by simplified payback period analysis. (C) 2002 Elsevier Science Ltd. All rights reserved.

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

optimization
refining
mixed integer programming


An architecture for distributed environment sensing with application to robotic cliff exploration Future planetary exploration missions will use cooperative robots to explore and sample rough terrain. To succeed robots will need to cooperatively acquire and share data. Here a cooperative multi-agent sensing architecture is presented and applied to the mapping of a cliff surface. This algorithm efficiently repositions the systems' sensing agents using an information theoretic approach and fuses sensory information using physical models to yield a geometrically consistent environment map. This map is then distributed among the agents using an information based relevant data reduction scheme. Experimental results for cliff face mapping using the JPL Sample Return Rover (SRR) are presented. The method is shown to significantly improve mapping efficiency over conventional methods.

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

visual exploration
information theory
data fusion
robot communication


Hybrid models in decision making under uncertainty: The case of training provider evaluation This paper provides a novel design for two hybrid models in modeling decision making under uncertainty: AHP-Fuzzy PROMETHEE and AHP-Fuzzy TOPSIS. The analytic hierarchy process' (AHP) excellent ability in problem structuring allows weights of criteria to be easily gathered from experts in the decision problem. Nonetheless, the pairwise comparisons required are immense, thus inducing decision making fatigue as the number of evaluation objects and criteria increase. We show that the number of pairwise comparisons can be reduced by integrating PROMETHEE or TOPSIS into AHP. The former two techniques are distance based methods. PROMETHEE allows the evaluators to choose a set of preference function and calculates the distance between the evaluator's judgment and his limits. TOPSIS, on the other hand, computes the distance of a judgment from the best and worst cases. Fuzzy linguistics are incorporated into PROMETHEE and TOPSIS, thus effectively modeling decision making subjectivity - aside from eliminating the need for evaluators to specify their preference limits in PROMETHEE. These techniques are applied in a strategic outsourcing decision of a company that seeks to evaluate their training providers. The final results indicate that both AHP-Fuzzy TOPSIS and AHP-Fuzzy PROMETHEE achieved consistent results and arrived at the same ranking order.

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

fuzzy mcdm
service outsourcing
decision analysis


Tracking Control of a Class of Differential Inclusion Systems via Sliding Mode Technique The tracking problem for a class of differential inclusion systems is investigated. Using global sliding mode control approach, a tracking control is proposed such that the output of a differential inclusion system tracks the desired trajectory asymptotically. An extensive reaching law is proposed to achieve the chattering reduction. Finally, an example is given to illustrate the validity of the proposed design.

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

tracking
differential inclusion systems
global sliding mode control
chattering reduction
an extensive reaching law


Key website factors in e-business strategy The design of a quality website, as part of e-business strategy, has become a key element for success in the online market. This article analyzes the main factors that must be taken into account when designing a commercial website, concentrating on the Aceros de Hispania company and its business model. We have studied the features which determine website quality: accessibility, speed, navigability, content, and we have calculated the Web Assessment Index (WAI) proposed by Miranda and Baegil [Miranda, F. J., & Baegil, T. M. (2004). Quantitative evaluation of commercial websites: An empirical study of Spanish firms. International Journal of Information Management, 24(4), 313328]. The results obtained provide several lessons which should be borne in mind when designing a commercial e-strategy. Firstly, it can be observed that Internet popularity and search engine positioning facilitate entry to practically inaccessible markets. Secondly, the navigability makes users feel comfortable and secure when browsing it, which increases the probability of a transaction being completed. Finally, the information provided on the website must be accurate, informative, updated and relevant to customers requirements. Like Aceros de Hispania, any company, thanks to the Internet, will be able to overcome the barriers which would impede its successful worldwide development in the offline market.

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

website accessibility navigability content speed


Double sweep preconditioner for optimized Schwarz methods applied to the Helmholtz problem This paper presents a preconditioner for non-overlapping Schwarz methods applied to the Helmholtz problem. Starting from a simple analytic example, we show how such a preconditioner can be designed by approximating the inverse of the iteration operator for a layered partitioning of the domain. The preconditioner works by propagating information globally by concurrently sweeping in both directions over the subdomains, and can be interpreted as a coarse grid for the domain decomposition method. The resulting algorithm is shown to converge very fast, independently of the number of subdomains and frequency. The preconditioner has the advantage that, like the original Schwarz algorithm, it can be implemented as a matrix-free routine, with no additional preprocessing.

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

helmholtz equation
preconditioners
iterative solvers
acoustic scattering
short-wave problem
finite element method


Pad Assignment for Die-Stacking System-in-Package Design Wire bonding is currently the most popular method for connecting signals between dies in system-in-package (SiP) design. Pad assignment, which assigns inter-die signals to die pads so as to facilitate wire bonding, is an important physical design problem for SiP design because the quality of a pad assignment solution affects both the cost and the performance of an SiP design. In this paper, we study a pad assignment problem, which prohibits the generation of illegal crossings and aims to minimize the total signal wirelength, for die-stacking SiP design. We first consider the two-die cases and die-stacks with a bridging die, and present a minimum-cost flow-based approach to optimally solve them in polynomial time. We then describe an approach, which uses a modified left-edge algorithm and an integer linear programming technique, for pyramid die-stacks with no bridging die. Finally, we discuss extensions of the two approaches to handle additional design constraints. Encouraging experimental results are shown to support our approaches.

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


a genetic approach for wireless mesh network planning and optimization Wireless Mesh Networks (WMNs) are gaining an increasingly important role in next generation last mile access. They offer more flexibility compared to traditional networks but on the expense of a complex structure. Thus, planning and optimization of WMNs is a challenge. In this paper we focus on routing and channel assignment in WMNs for throughput maximization using genetic algorithms. Genetic algorithms provide a good solution for large-scale WMNs in relatively small computation time. The results prove the effectiveness of the genetic operators and show the advantages of a genetic optimization. However, these operators have to be configured carefully to avoid local optima. We will show the influence of the selection principles as well as evaluation functions on the optimization.

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

routing
optimization
genetic algorithms
planning
wireless mesh networks


New efficiency results for makespan cost sharing In the context of scheduling, we study social cost efficiency for a cost-sharing problem in which the service provider's cost is determined by the makespan of the served agents' jobs. For identical machines, we give surprisingly simple cross-monotonic cost-sharing methods that achieve the essentially best efficiency Moulin mechanisms can guarantee. Still, our methods match the budget-balance of previous (yet rather intricate) results. Subsequently, we give a generalization for arbitrary jobs. Finally, we return to identical jobs in order to perform a fine-grained analysis. We show that the universal worst-case efficiency bounds from [T. Roughgarden, M. Sundararajan, New trade-offs in cost-sharing mechanisms, in: Proceedings of the 38th ACM Symposium on Theory of Computing, 2006] are overly pessimistic. (C) 2008 Elsevier B.V. All rights reserved.

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

mechanism design
cost-sharing
cross-monotonicity


Quadrature using 64-bit IEEE arithmetic for integrands over [0,1] with a singularity at 1 We present a detailed study of some problems encountered when quadrature over 10, 11 is attempted with integrands that have a singularity at 1. Methods designed to increase the accuracy of such quadratures, for example, the application of periodising transformations, are examined in the context of the representational limitations of 64-bit IEEE arithmetic near 1 in [0.1]. A heuristic is proposed for the forecasting of a lower bound on the irremovable error due to these limitations. We conclude by affirming the commonly accepted procedure that where possible, integrals should be symbolically transformed so that my remaining singularity occurs at 0. (c) 2005 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 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

automatic quadrature
64-bit ieee arithmetic
extrapolation


A characterization of eventual Byzantine agreement We investigate eventual Byzantine agreement (EBA) in the crash and omission failure modes. The emphasis is on characterizing optimal EBA protocols in terms of the states of knowledge required by the processors in order to attain EBA. It is well known that common knowledge among the nonfaulty processors is a necessary and sufficient condition for attaining simultaneous Byzantine agreement (SBA). We define a new variant that we call continual common knowledge and use it to provide necessary and sufficient conditions for attaining EBA. Using this characterization, we provide a technique that allows us to start with any EBA protocol and convert it to an optimal EBA protocol using a two-step process.

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

eventual byzantine agreement
common knowledge

fault-tolerance
continual common knowledge
optimal protocol


Multivariate Poisson regression with covariance structure In recent years the applications of multivariate Poisson models have increased, mainly because of the gradual increase in computer performance. The multivariate Poisson model used in practice is based on a common covariance term for all the pairs of variables. This is rather restrictive and does not allow for modelling the covariance structure of the data in a flexible way. In this paper we propose inference for a multivariate Poisson model with larger structure, i.e. different covariance for each pair of variables. Maximum likelihood estimation, as well as Bayesian estimation methods are proposed. Both are based on a data augmentation scheme that reflects the multivariate reduction derivation of the joint probability function. In order to enlarge the applicability of the model we allow for covariates in the specification of both the mean and the covariance parameters. Extension to models with complete structure with many multi-way covariance terms is discussed. The method is demonstrated by analyzing a real life data set.

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

data augmentation
multivariate reduction

em algorithm
markov chain monte carlo
crime data


Virtual user approach for group recommender systems using precedence relations We describe virtual user strategy and then examine its properties. The experimental results show that virtual strategy achieve better Precision and Recall. We propose incremental algorithms to update virtual user profile. A new measure called monotonicity is introduced to judge the efficiency of a recommender system. Virtual-user profile + Monotonicity yield recommendations having higher accuracy on benchmark datasets.

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


A Self-Organizing Pulse-Coupled Network of Sub-Threshold Oscillating Spiking Neurons In this paper, an artificial sub-threshold oscillating spiking neuron is presented and its response phenomena to an input spike-train are analyzed. In addition, a dynamic parameter update rule of the neuron for achieving synchronizations to the input spike-train having various spike frequencies is presented. Using an analytical two-dimensional return map, local stability of the parameter update rule is analyzed. Furthermore, a pulse-coupled network of the neurons is presented and its basic self-organizing function is analyzed. Fundamental comparisons are also presented.

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

spiking neuron model
synchronization
pulse-coupled neural network
self-organization


Neighbourhood sampling in bagging for imbalanced data Various approaches to extend bagging ensembles for class imbalanced data are considered. First, we review known extensions and compare them in a comprehensive experimental study. The results show that integrating bagging with under-sampling is more powerful than over-sampling. They also allow to distinguish Roughly Balanced Bagging as the most accurate extension. Then, we point out that complex and difficult distribution of the minority class can be handled by analyzing the content of a neighbourhood of examples. In our study we show that taking into account such local characteristics of the minority class distribution can be useful both for analyzing performance of ensembles with respect to data difficulty factors and for proposing new generalizations of bagging. We demonstrate it by proposing Neighbourhood Balanced Bagging, where sampling probabilities of examples are modified according to the class distribution in their neighbourhood. Two of its versions are considered: the first one keeping a larger size of bootstrap samples by hybrid over-sampling and the other reducing this size with stronger under-sampling. Experiments prove that the first version is significantly better than existing over-sampling bagging extensions while the other version is competitive to Roughly Balanced Bagging. Finally, we demonstrate that detecting types of minority examples depending on their neighbourhood may help explain why some ensembles work better for imbalanced data than others.

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


Retrieval by spatial similarity: an algorithm and a comparative evaluation We present an algorithm for retrieval by spatial similarity of symbolic images. The proposed algorithm is based on graph-matching and is invariant to scaling, rotation and translation, recognizes multiple rotation variants and can deal with multiple instances of a symbolic object in an image. It is particularly suitable for a query by sketch approach, in that it requires that at least objects in the query have to be present in the database image. Our approach is proposed in comparison with other two well-known algorithms. Peculiarities are analyzed and motivated. Results of a comparative evaluation on a test dataset of symbolic images are presented and discussed. (C) 2004 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 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 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

spatial arrangement
similarity retrieval


Electrical admittance method for estimating fluid removal during artificial dialysis Because the conductivity of blood changes remarkably during artificial dialysis, sometimes by more than 20%, changes in tissue admittance at low frequency are caused by changes not only in the extracellular fluid volume but also in blood conductivity. Therefore the changes in blood conductance due to artificial dialysis must be considered for the estimation of water removal by the admittance method. An accurate bio-impedance measurement system was developed. Measurement error was less than 1% at low frequency and 10% at high frequency. A new electrical bio-admittance method (NAM) was evaluated for the continuous measurement of removed fluid volume, using a three parallel-compartment tissue model, consisting of intracellular, interstitial and blood compartments, which takes into account the blood conductivity change. NAM used the equivalent conductivity calculated from the leg admittances of patients, measured at 1 min intervals during various artificial dialysis procedures. The actual amount of excess water removed by ultra-filtration agreed with the NAM-estimated amount within an error of 20%. NAM was also applied to estimate the intra- and extracellular fluid changes. The results were consistent with the physiological changes known to occur during the various forms of dialysis.

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

admittance method
artificial dialysis
extracellular fluid
fluid removal


Improved algorithms for polynomial-time decay and time-decay with additive error We consider the problem of maintaining polynomial and exponential decay aggregates of a data stream, where the weight of values seen from the stream diminishes as time elapses. These types of aggregation were discussed by Cohen and Strauss (J. Algorithms 1(59), 2006), and can be used in many applications in which the relative value of streaming data decreases since the time the data was seen. Some recent work and space efficient algorithms were developed for time-decaying aggregations, and in particular polynomial and exponential decaying aggregations. All of the work done so far has maintained multiplicative approximations for the aggregates. In this paper we present the first O(log N) space algorithm for the polynomial decay under a multiplicative approximation, matching a lower bound. In addition, we explore and develop algorithms and lower bounds for approximations allowing an additive error in addition to the multiplicative error. We show that in some cases, allowing an additive error can decrease the amount of space required, while in other cases we cannot do any better than a solution without additive error.

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

sliding window
stream statistic
decay functions


a robust algorithm for approximate compatible observability don't care (codc) computation Compatible Observability Don't Cares (CODCs) are a powerful means to express the flexibility present at a node in a multi-level logic network. Despite their elegance, the applicability of CODCs has been hampered by their computational complexity. The CODC computation for a network involves several image computations, which require the construction of global BDDs of the circuit nodes. The size of BDDs of circuit nodes is unpredictable, and as a result, the CODC computation is not robust. In practice, CODCs cannot be computed for large circuits due to this limitation.In this paper, we present an algorithm to compute approximate CODCs (ACODCs). This algorithm allows us to compute compatible don't cares for significantly larger designs. Our ACODC algorithm is scalable in the sense that the user may trade off time and memory against the accuracy of the ACODCs computed. The ACODC is computed by considering a subnetwork rooted at the node of interest, up to a certain topological depth, and performing its don't care computation. We prove that the ACODC is an approximation of its CODC.We have proved the soundness of the approach, and performed extensive experiments to explore the trade-off between memory utilization, speed and accuracy. We show that even for small topological depths, the ACODC computation gives very good results. Our experiments demonstrate that our algorithm can compute ACODCs for circuits whose CODC computation has not been demonstrated to date. Also, for a set of benchmark circuits whose CODC computation yields an average 28\% reduction in literals after optimization, our ACODC computation yields an average 22\% literal reduction. Our algorithm has runtimes which are about 25x and memory utilization which is 33x better that of the CODC computation of SIS.

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

network
benchmark
approximation
computation
reduction
flexibility
paper
user
robust
accuracy
size
demonstrate
image
logic
algorithm
computational complexity
global
circuits

applications
scalability
design
experience
timing
practical
runtime
exploration
logic synthesis
sound
optimality
multi-level logic optimization
memorialized


mpeg-4-based adaptive remote rendering for video games This paper proposes a complete framework for remote rendering of 3D and complex 2D applications. The retained approach is based on standardized video encoding and interactivity streaming methods and was developed within the framework of the Kusanagi project. The complete architecture of the gaming platform is described and especially we have developed an advanced "lobby server" which acts as an interface between the users and the applications and manages the resources sharing. This server component is also designed in order to build a strongly pervasive environment allowing users to run their 3D applications everywhere and on every device. In this perspective, the MPEG-4 format support is one of the main features that permits to diffuse easily and rapidly our solution. In addition, our gaming platform has been tested by a panel of beta testers. The users experience feedbacks are summarized and give relevant information for the future works. To improve the adaptability of our system, an optimized encoding an streaming method is proposed and the simulation results show that we can significantly improve the user QoE without adding complexity on the server side.

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


measure-based metasearch We propose a simple method for converting many standard measures of retrieval performance into metasearch algorithms. Our focus is both on the analysis of retrieval measures themselves and on the development of new metasearch algorithms. Given the conversion method proposed, our experimental results using TREC data indicate that system-oriented measures of overall retrieval performance (such as average precision) yield good metasearch algorithms whose performance equals or exceeds that of benchmark techniques such as CombMNZ and Condorcet.

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

yield method benchmark analysis performance retrieval data metasearch

precise
measurement
systems
experimentation
developer
standardization
algorithm
retrieval evaluation
conversation