On new scheduling policy for the improvement of firm RTDBSs performances Earliest deadline first (EDF) is one of the main scheduling policies used in real-time database systems (RTDBSs) for transactions processing. With EDF, prioritized transactions are not necessarily the most important in the system. Moreover, it is well-known that EDF is not efficient in overload conditions. In this paper, we introduce the notion of transaction importance and present a new priority assignment technique based on both transactions importance and deadlines. This assignment policy leads to a new scheduling policy, called generalized earliest deadline first (GEDF). In order to show the benefits of using GEDF for managing real-time transactions, we have designed an RTDBS simulator and carried out Monte Carlo simulations.

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

real-time database system
transaction processing
success ratio
quality of service


three dimensional evolutionary aerodynamic design optimization with cma-es In this paper, we present the application of evolutionary optimization methods to a demanding, industrially relevant engineering domain, the three-dimensional optimization of gas turbine stator blades. This optimization problem is high-dimensional search and computationally very expensive. We show that, despite of its difficulty, the problem is feasible. Our approach not only successfully optimizes the aerodynamic design but also yields interesting results from an engineering point of view.

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

covariance matrix adaptation
real world application
evolutionary strategies


Balanced discrete fuzzy measures First a balancing property on a fuzzy measure is introduced. After that, the conditions of when an additive fuzzy measure is balanced are given and similar results are presented for 0-1 and S-decomposable fuzzy measures where S is a continuous t-conorm. Moreover, the concept of distance between two additive fuzzy measures is presented and some results related to the distance and the balancing property are developed.

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

aggregation operator
discrete choquet and sugeno integrals
owa operator
weighted mean


\(\epsilon\)- DANTE : an ant colony oriented depth search procedure The \(\epsilon\)-Depth ANT Explorer (\(\epsilon\)- DANTE ) algorithm applied to a multiple objective optimization problem is presented in this paper. This method is a hybridization of the ant colony optimization algorithm with a depth search procedure, putting together an oriented/limited depth search. A particular design of the pheromone set of rules is suggested for these kinds of optimization problems, which are an adaptation of the single objective case. Six versions with incremental features are presented as an evolutive path, beginning in a single colony approach, where no depth search is applied, to the final \(\epsilon\)- DANTE . Versions are compared among themselves in a set of instances of the multiple objective Traveling Salesman Problem. Finally, our best version of \(\epsilon\)- DANTE is compared with several established heuristics in the field showing some promising results.

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

ant colony optimization
multiple objective optimization

swarm intelligence optimization
hybrid algorithms
depth local search


A new algorithm for regularizing one-letter context-free grammars Constructive methods for obtaining regular grammar counterparts for some sub-classes of context-free grammars (CFGs) have been investigated by many researchers. An important class of grammars for which this is always possible is the one-letter CFG. We show in this paper a new constructive method for transforming an arbitrary one-letter CFG to an equivalent regular expression of star-height 0 or 1. Our new result is considerably simpler than a previous construction by Leiss, and we also propose a new normal form for a regular expression with only a single-star occurrence. Through an alphabet factorization theorem, we show how to go beyond the one-letter CFG in a straight-forward way. (C) 2003 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 B I O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

reduction of a context-free grammar
one-letter context-free language


On the relationships between models in protocol verification We formally investigate the relationships between several models that are widely used in protocol verification, namely variants of the inductive model of message traces inspired by Paulson's approach, and models based on rewriting. More precisely, we prove several over-approximation relationships between models, i.e. that one model allows strictly more traces or reachable states than the other. This is common in verification: often an over-approximation is easier to prove correct than the original model, and proving that the over-approximation is safe implies that the original model is safe - provided that the models are indeed in an over-approximation relation. We then show that some over-approximations are not sound with respect to a common formalization of authentication goals based on exchanged messages. The precise formal account that we give on the relation of the models allows us to correct the situation. (C) 2007 Elsevier Inc. 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

formal verification
security protocols
abstraction


Optimized bucketing for NMR spectra: Three case studies The use of nuclear magnetic resonance (NMR) data coupled to chemometric methods has become increasingly popular in the last decade. However, a serious drawback of these approaches is the common misalignments of H-1 NMR spectra. To overcome this problem, bucketing or binning techniques have been used. In this work, an algorithm is proposed to perform an optimized bucketing that yields better results than the conventional bucketing implemented in some commercial software. The improvement proposed here for optimized bucketing deals with the bucket boundaries, which are defined by local minima from average NMR spectrum over all samples. Applicability of the new algorithm, named OBA (optimized bucketing algorithm), is demonstrated for real data sets in comparison to other alignment approaches and conventional bucketing. (C) 2013 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 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

spectral alignment
wine
biodiesel
brain tumor


RATH: A Maple package for finding travelling solitary wave solutions to nonlinear evolution equations A Maple package RATH which outputs entirely automatically tanh-polynomial travelling solitary wave solutions of a given conlinear evolution equation is presented. The effectiveness of RATH is demonstrated by applications to a variety of equations with physical interest as examples. Not only are previously known solutions recovered but in some cases new solutions and more general form of solutions are obtained. (C) 2002 Elsevier Science B.V. All rights reserved.

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

nonlinear evolution equations
solitary wave solutions


An arrhythmia classification system based on the RR-interval signal Objective: This paper proposes a knowledge-based method for arrhythmic beat classification and arrhythmic episode detection and classification using only the RR-interval signal extracted from ECG recordings. Methodology: A three RR-interval sliding window is used in arrhythmic beat classification algorithm. Classification is performed for four categories of beats: normal, premature ventricular contractions, ventricular flutter/fibrillation and 2 heart block. The beat classification is used as input of a knowledge-based deterministic automaton to achieve arrhythmic episode detection and classification. Six rhythm types are classified: ventricular bigeminy, ventricular trigeminy, ventricular couplet, ventricular tachycardia, ventricular flutter/fibrillation and 2 heart block. Results: The method is evaluated by using the MIT-BIH arrhythmia database. The achieved scores indicate high performance: 98% accuracy for arrhythmic beat classification and 94% accuracy for arrhythmic episode detection and classification. Conclusion: The proposed method is advantageous because it uses only the RR-interval signal for arrhythmia beat and episode classification and the results compare well with more complex methods.

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

arrhythmia classification
deterministic automaton

rr-interval signal
knowledge-based system


Discovering semantic associations among Web services based on the qualitative probabilistic network In recent years, the intelligent management and decision of Web services have attracted more and more attention due to the wide applications in various aspects of the real world. With the increase of Web services in an organization, the desired on-line services should be located rapidly requiring not only the syntactic but also the semantic techniques. In addition, aiming at fulfilling complex applications by discovering and composing available services automatically and precisely, it is indispensable to develop an underlying model and the corresponding measure for semantic associations among given Web services. In this paper, by mining the historical invocations of component services, we first construct a semantic model to describe their behavior rules based on the qualitative probabilistic network. Further, we propose a distance measure and the approach to discovering semantic associations among Web services. Preliminary experiments and performance studies show that our methods are feasible. Moreover, high recall and precision can be achieved when our methods are applied to Web service search.

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

web services
qualitative probabilistic network

causal relationship
service invocation
semantic association


Heterogeneous feature structure fusion for classification The external and internal feature structures are jointly optimized for fusion. Two kinds of feature structures are preserved via a unified feature projection. The nonlinear relationship between two kinds of feature structures is revealed. The new feature fusion algorithm shows great promise in four classification problems.

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

internal structure
external structure
object classification


An integrated approach based on execution measures for the continuous improvement of business processes realized by services Organizations are rapidly adopting Business Process Management (BPM) as they focus on their business processes (BPs), seeing them to be key elements in controlling and improving the way they perform their business. Business Process Intelligence (BPI) takes as its focus the collection and analysis of information from the execution of BPs for the support of decision making, based on the discovery of improvement opportunities. Realizing BPs by services introduces an intermediate service layer that enables us to separate the specification of BPs in terms of models from the technologies implementing them, thus improving their modifiability by decoupling the model from its implementation. To provide an approach for the continuous improvement of BPs, based on their realization with services and execution measurement. It comprises an improvement process to integrate the improvements into the BPs and services, an execution measurement model defining and categorizing several measures for BPs and service execution, and tool support for both. We carried out a systematic literature review, to collect existing proposals related to our research work. Then, in close collaboration with business experts from the Hospital General de Ciudad Real (HGCR), Spain, and following design science principles, we developed the methods and artifacts described in this paper, which were validated by means of a case study. We defined an improvement process extending the BP lifecycle with measurement and improvement activities, integrating an execution measurement model comprising a set of execution measures. Moreover, we developed a plug-in for the ProM framework to visualize the measurement results as a proof-of-concept prototype. The case study with the HGCR has shown its feasibility. Our improvement vision, based on BPs realized by services and on measurement of their execution, in conjunction with a systematic approach to integrate the detected improvements, provides useful guidance to organizations.

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

business process management (bpm)
service oriented computing (soc)
continuous process improvement (cpi)
business process intelligence (bpi)
business process execution measurement


Prosthotology: The science of prosthetics and orthotics Purpose - The present field of prosthetics/orthotics is an erratic agglomerate of vague guidelines, skills and knowledge. The author conceived prosthotology to clarify, expand and enlighten prosthetics/orthotics into a science with a solid foundation and clear framework. This paper seeks to present itself as an introduction to the field and its relationship with cybernetics and systems. Design/methodology/approach - Prosthotology achieves this by disregarding the established barriers between the human body, mind and environment. This traditional scheme is replaced by focusing on goals and goal systems instead. A goal system consists of a goal former and a goal achiever. When a goal achiever cannot achieve a goal, it can be amended. If a goal achiever cannot initialise, a prosthesis may provide amendment. If a goal achiever cannot propagate, an orthosis may provide amendment. Findings - This perspective enables one to focus on a person's needs, what exactly is inhibiting these needs, and how best to permit the needs to be granted. It does not assume that, in order to achieve a goal, only the human body can be used. Practical implications - Prosthotology provides direction and advancement for prosthetics and orthotics. It also enhances integration of prosthetics and orthotics with other engineering disciplines. Originality/value - So far one has only scratched the surface of the potential of prosthetics and orthotics, using prosthotology, this potential is obvious and a step closer.

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


Time step restrictions for well-balanced shallow water solutions in non-zero velocity steady states Numerical models based on the conservative formulation of the shallow water equations in finite volumes have recently paid special attention to the convenience of a unified discretization of bed slope source terms and pressure momentum fluxes in order to ensure a correct representation of both in steady states. In cases of steady shallow water flow with non-zero velocity, the discrete balance must include the friction term and the good equilibrium of the discrete solution must be revisited. Besides, there is the question of stability. The presence of relatively large friction terms reduces considerably the stability region of the explicit schemes (with either separate or unified discretization). Implicit formulations strongly help to relax the friction related stability restrictions but are only feasible in the context of separated discretization. Therefore, a strategy to blend both approaches (unified explicit and separated implicit) is presented that ensures both a perfect balance in steady state and numerical stability in unsteady cases in the presence of friction terms. Copyright (C) 2008 John Wiley & Sons, Ltd.

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

finite volumes
friction term
numerical stability

unstructured grids
explicit discretization
implicit discretization
well-balanced solution


A new clustering algorithm based on near neighbor influence It introduces the concept of near neighbor influence. It develops a new clustering algorithm. An improved version of the new clustering algorithm is introduced. A variation of the new clustering algorithm is introduced. The effect of our algorithms is validated by some simulations.

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

near neighbor point set
dissimilarity measure


Robust Authentication Scheme between User and Remote Autonomous Object in Telecommunications System Autonomous objects represent active database objects which can be distributed over the Internet. This paper proposes a robust authentication scheme for the remote autonomous object based on AES (Advanced Encryption Standard) symmetric cryptosystem. Compared with related schemes, the proposed scheme not only resists various security attacks but also provides computation and communication efficiency.

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

network security
autonomous system
cryptography


Approximate Green's functions in boundary integral analysis It is well known that employing a Green's function which satisfies the prescribed conditions on a part of the boundary is advantageous for boundary integral calculations. In this paper, it is shown that an approximate Green's function, one in which the known data is nearly reproduced, can also be highly beneficial in implementations of the boundary-element method. This approximate Green's function approach is developed herein for solving the Laplace equation, and applied to the modeling of void dynamics under electromigration conditions in metallic thin-film interconnects used in integrated circuits.

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

green's function
boundary integral method
symmetric-galerkin approximation


KDA - A KNOWLEDGE-BASED DATABASE ASSISTANT WITH A QUERY GUIDING FACILITY Advanced natural language query systems provide database retrieval facilities as an effective means for encouraging novice users to approach computer database systems. However, in these systems, facilities for guiding novice users in performing the database retrieval tasks, such as formulating valid database queries, refining incomplete database queries, and modifying database query misconstruction, have not yet been provided. In this paper, we provide a knowledge-based database assistant (KDA) which integrates a natural language query system with a skeleton-based query guiding facility. When a user works with the KDA natural language query system, the query guiding facility can supply several kinds of skeletons to guide users in performing database retrieval tasks. A semantic network model S-Net has been introduced to represent the knowledge for natural language query processing and skeleton generation. The methods for implementing the system are also discussed in this paper.

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

natural language query system
semantic network model

database query system
intelligent database front end
knowledge-based system
user interface


Variational multiscale stabilization of high-order spectral elements for the advection-diffusion equation One major issue in the accurate solution of advection-dominated problems by means of high-order methods is the ability of the solver to maintain monotonicity. This problem is critical for spectral elements, where Gibbs oscillations may pollute the solution. However, typical filter-based stabilization techniques used with spectral elements are not monotone. In this paper, residual-based stabilization methods originally derived for finite elements are constructed and applied to high-order spectral elements. In particular, we show that the use of the variational multiscale (VMS) method greatly improves the solution of the transport-diffusion equation by reducing over-and under-shoots, and can be therefore considered an alternative to filter-based schemes. We also combine these methods with discontinuity capturing schemes (DC) to suppress oscillations that may occur in proximity of boundaries or internal layers. Additional improvement in the solution is also obtained when a method that we call FOS (for First-Order Subcells) is used in combination with VMS and DC. In the regions where discontinuities occur, FOS subdivides a spectral element of order p into p(2) subcells and then uses 1st-order basis functions and integration rules on every subcell of the element. The algorithms are assessed with the solution of classical steady and transient 1D, 2D, and pseudo-3D problems using spectral elements up to order 16. (C) 2012 Elsevier Inc. All rights reserved.

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

variational multiscale stabilization (vms)


Enhanced distributed explicit rate allocation for ABR services in ATM networks Rate allocation for available bit-rate (ABR) services in ATM networks has received a considerable amount of attention recently, but important issues such as bandwidth fairness, MCR rate guarantees, and queue control still require further investigation. In light of these concerns, an enhanced rate allocation algorithm is proposed for congestion management using explicit rate feedback control. The algorithm uses fast, exact rate computations and is capable of achieving a variety of MCR-related fairness criteria. The scheme handles transient effects and can function in heterogeneous networks carrying higher priority real-time traffic. Simulation results for a wide range of network scenarios demonstrate that the algorithm effectively controls queue buildups and achieves good fairness. Performance scalability to large networks under challenging conditions is also shown for a given control parameter 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

available bit-rate services
feedback flow control
max-min fairness
weighted fairness


Work exposure and vigilance decrements in closed circuit television surveillance Detection rates for inconspicuous events in real time surveillance are low. Surveillance background contributes to differences in detection. The nature of previous visual analysis experience contributes to detection levels. The type of sample influences the results of ecologically valid vigilance tasks.

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

vigilance decrement
operator performance


A modified hybrid projection method for solving generalized mixed equilibrium problems and fixed point problems in Banach spaces In this paper, we introduce a modified new hybrid projection method for finding the set of solutions of the generalized mixed equilibrium problems and the convex feasibility problems for an infinite family of closed and uniformly quasi-phi-asymptotically nonexpansive mappings. Strong convergence theorems are established in a uniformly smooth and strictly convex Banach space which also enjoys the Kadec-Klee property. Our results improve and extend the corresponding results announced by Qin et al. (2010) and many authors. (C) 2011 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 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


a performance evaluation of pointer-based joins In this paper we describe three pointer-based join algorithms that are simple variants of the nested-loops, sort-merge, and hybrid-hash join algorithms used in relational database systems. Each join algorithm is described and an analysis is carried out to compare the performance of the pointer-based algorithms to their standard, non-pointer-based counterparts. The results of the analysis show that the pointer-based algorithms can provide significant performance gains in many situations. The results also show that the pointer-based nested-loops join algorithm, which is perhaps the most natural pointer-based join algorithm to consider using in an object-oriented database system, performs quite poorly on most medium to large joins.

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

systems
analysis
performance
paper
algorithm
relational database

situated
sorting
hashing
object-oriented database
standardization
performance evaluation
pointers
hybrid


The stochastic opportunistic replacement problem, part I: models incorporating individual component lives We consider an extension of the opportunistic replacement problem, which has been studied by Dickman et al. (The Journal of the Operational Research Society of India, 28:165175, 1991), Andrasson (Optimization of opportunistic replacement activities in deterministic and stochastic multi-component systems, Licentiate thesis, Department of Mathematical Sciences, Chalmers University of Technology and University of Gothenburg, Gteborg, Sweden, 2004), and Almgren et al. (The opportunistic replacement problem: analysis and case studies, Preprint, Department of Mathematical Sciences, Chalmers University of Technology and University of Gothenburg, Gteborg, Sweden, 2011), that allows the individuals of the same component to have non-identical lives. Formulating and solving this problem constitute a first step towards solving the opportunistic replacement problem with uncertain component lives. We show that the problem is NP-hard even with time independent costs, and present two 01 integer programming models for the problem. We show that in model I the integrality requirement on a majority of the variables can be relaxed; this is in contrast to model II and the model from Andrasson (Optimization of opportunistic replacement activities in deterministic and stochastic multi-component systems, Licentiate thesis, Department of Mathematical Sciences, Chalmers University of Technology and University of Gothenburg, Gteborg, Sweden, 2004). We remove all superfluous variables and constraints in model I and show that the remaining constraints are facet inducing. We also utilize a linear transformation of model I to obtain a stronger version of model II, i.e., modelII+, which inherits the polyhedral properties of model I. Numerical experiments show that the solution time of model I is significantly lower than those of both model II and Andrassons model. It is also slightly lower than the solution time of model II+.

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

maintenance optimization
complexity analysis


A new software tool for the analysis of high resolution PTR-TOF mass spectra The High Resolution Proton-Transfer-Reaction Time-of-Flight Mass Spectrometer (HR PTR-TOF-MS) is a powerful analytical tool used by various scientific communities for real-time measurements of volatile organic compounds (VOC). The analysis of HR PTR-TOF-MS data is, however, particularly demanding because of the large amount of complex data being generated. Based on recently developed or described mathematical methods, we have produced a new software tool, the PTR-TOF Data Analyzer, which greatly facilitates the data analysis process. The new software solution allows for i) a combined Poisson counting statistics and dead time correction of ion count rates, ii) accurate mass axis calibration, iii) an iterative residual peak analysis that detects up to 5 isobaric peaks per unit m/z, iv) time series analysis of both low and high mass and time resolution data and v) visualization of analysis results for fast quality assurance checks. After having been successfully tested by a group of users with different application needs, the PTR-TOF Data Analyzer is made generally available to the scientific community. This will improve the user-friendliness of the PTR-TOF-MS technique and facilitate scientific work with this new analytical mass spectrometer. (C) 2013 Elsevier B.V. All rights reserved.

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

ptr-tof data analyzer
ptr-tof-ms
tof data analysis
cumulative peak fitting
iterative residual analysis


Video-based face model fitting using Adaptive Active Appearance Model Active Appearance Model (AAM) represents the shape and appearance of an object via two low-dimensional subspaces, one for shape and one for appearance. AAM for facial images is currently receiving considerable attention from the computer vision community. However, most existing work focuses on fitting an AAM to a single image. For many applications, effectively fitting an AAM to video sequences is of critical importance and challenging, especially considering the varying quality of real-world video content. This paper proposes an Adaptive Active Appearance Model (AAAM) to address this problem, where both a generic AAM component and a subject-specific appearance model component are employed simultaneously in the proposed fitting scheme. While the generic AAM component is held fixed, the subject-specific model component is updated during the fitting process by selecting the frames that can be best explained by the generic model. Experimental results from both indoor and outdoor representative video sequences demonstrate the faster fitting convergence and improved fitting accuracy.

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

active appearance model
model fitting
generic model


EpiflowA paradigm for tracking stereo correspondences ? We propose the epiflow as a novel framework to integrate the motion and stereo epipolar geometries for the tracking of stereo matches. For a given stereo pair, spatio-temporal correspondences in the next stereo pair are established from the solution of an optimization problem that incorporates the epiflow geometrical constraint with the brightness constancy assumption as the photometric similarity measure. Two different implementations are proposed, each utilizing the stereo RANSAC algorithm as a mechanism to gain robustness and efficiency in handling large temporal disparity ranges, identify outliers and estimate the motion of the stereo rig as complementary information. The performance of the proposed methods is demonstrated in experiments with various complex underwater images, and comparison with results from the SIFT method allows the assessment of our novel contributions.

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

motion stereo
epipolar geometry
feature matching and tracking


A numerical method for interface reconstruction of triple points within a volume tracking algorithm A numerical method for the reconstruction of interfaces in finite volume schemes for multiphase flows is presented. The computation of the triple point at the intersection of three materials in two dimensions of space is addressed. The determination of the normal vectors between pairs of materials is obtained with a finite element approximation. A numerical method for the localization of a triple point is described as the minimum of a constrained minimization problem inside an interfacial cell of the discretization. For given volume fractions of materials in the cell, an interior-point/Newton method is used for the reconstruction of the local geometry and the localization of the triple point. Initialization of the Newton method is performed with a derivative-free algorithm. Numerical results are presented for static and pure advection cases to illustrate the efficiency and robustness of the algorithm. (C) 2008 Elsevier Ltd. All rights reserved.

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

interface reconstruction
multiphase flows

triple-point configuration
free surface
constrained optimization


Deterministic Replay for Message-Passing-Based Concurrent Programs The Multicore Communications API (MCAPI) is a new message-passing API that was released by the Multicore Association. MCAPI provides an interface designed for closely distributed embedded systems with multiple cores on a chip and/or chips on a board. Similar to parallel programs in other domains, debugging MCAPI programs is a challenging task due to their nondeterministic behavior. In this article we present a tool that is capable of deterministically replaying MCAPI program executions, which provides valuable insight for MCAPI developers in case of failure.

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

reliability
message race
multicore programs


A finite volume method parallelization for the simulation of free surface shallow water flows We construct a parallel algorithm, suitable for distributed memory architectures, of all explicit shock-capturing finite Volume method for solving the two-dimensional shallow water equations. The finite volume method is based on the very popular approximate Riemann solver of Roe and is extended to second order spatial accuracy by an appropriate TVD technique. The parallel code is applied to distributed memory architectures using domain decomposition techniques and we investigate its performance oil a grid Computer and oil a Distributed Shared Memory supercomputer The effectiveness of the parallel algorithm is considered for specific benchmark test cases. The performance of the realization measured in terms of execution time and speedup factors reveals the efficiency of the implementation. (C) 2009 IMACS. Published by 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 B I O O O O O B I I O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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

shallow water equations
finite volume
domain decomposition

distributed memory parallel architectures


Planning as satisfiability with IPC simple preferences and action costs Planning as Satisfiability (SAT) is currently the best approach for optimally (wrt makespan) solving classical planning problems and the extension of this framework to include preferences is nowadays considered the reference approach to compute "optimal" plans in SAT-based planning. It includes reasoning about soft goals and plans length as introduced in the 2006 and 2008 editions of the International Planning Competitions (IPCs). Despite the fact that the planning as satisfiability with preferences framework has helped to enhance the applicability of the SAT-based approach in planning, the actual approach used within the framework somehow suffers from some main limitations: the metrics, i.e. linear optimization functions defined over goals and/or actions, which account for plan quality issues, are fully reduced to SAT formulas, further increasing the size of (often already) big formulas; moreover, the search for optimal solutions is performed by forcing a heuristic ordering. In this paper we address these issues by reducing the IPC planning problems with soft goals (from IPC-5) and/or action costs (from IPC-6) to optimization problems extending SAT and that can naturally handle the integer "weights" of the metrics, i.e. to Max-SAT and Pseudo-Boolean (PB) problems. Our idea is partially motivated by the approach followed by IPPLAN in the deterministic part of the IPC-5 and by the recent availability of efficient Max-SAT and PB solvers. First, we prove that our approach is correct; then, we implement these ideas in SATPLAN and run a wide experimental analysis on planning problems from IPC-5 and IPC-6, taking as references state-of-the-art planners on these competitions and the previous SAT-based approach. Our analysis shows that our approach is competitive and helps to further widen the set of benchmarks that a SAT-based framework can efficiently deal with. At the same time, as a side effect of this analysis, challenging Max-SAT and PB benchmarks have been identified, as well as the Max-SAT and PB solvers performing best on these planning problems.

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


Handling of first-order Rayleigh scatter in PARAFAC modelling of fluorescence excitation-emission data The use of fluorescence spectroscopy has increased in use in recent years, mainly due to high sensitivity towards organic compounds typically present in, e.g., food products and due to the instrumental development. The extension from measuring single emission or excitation spectra to so-called emission-excitation matrices (EEM) has proven useful, increasing the selectivity between the components in the sample. However, EEMs can be rather complex and the analysis can become complicated due to interferences, scatter, overlapping signals, etc. This paper gives a comparison of several methods to handle the first-order Rayleigh scatter when PARAFAC modeling is used to decompose the three-way fluorescence data. Furthermore, the paper provides suggestion for how to handle scatter in the modeling phase. (c) 2004 Elsevier B.V All rights reserved.

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

weights
constraints
inserting zeros
missing values


"They can't read, but they sure can count" Flawed rules of the journal rankings game Purpose - The purpose of this short paper is to focus on the parallel games of journal rankings and citation counts. Design/methodology/approach - The paper analyses journal ranking and I citation procedures. Findings - Journal rankings can often reflect personal bias, and therefore call be flawed. Originality/value - The paper highlights the differences, in ranking journals and citations, globally.

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

serials
social status
product positioning


Robust preliminary analysis of large-scale linear model for optimal industrial investments Which equipment should be bought for a given sum to increase the profit of an industrial enterprize with a known specification of production within given limits? This problem is described as a large-scale linear program (LP) of a specific structure. An effective preliminary analysis for this structure was proposed in Ioslovich and Makarenkov [On methods of dimensionality reduction in linear programming, Econ. Math. Methods Moscow (in Russian) 11(3) (1975) 316324] which aimed to reduce the size of the problem by detection of the redundant and active constraints. In this paper a robust system is considered, dealing with box-constrained uncertainties in the input coefficients. The analysis is based on robust evaluations of bounds for primal and dual constraints. A robust evaluation of uncertain duals presented in [I. Ioslovich, P.-O. Gutman, Robust redundancy determination and evaluation of the dual variables of linear programming problems in the presence of uncertainty, 1, in, V. Kucera, M. Sebek (Eds.), Proceedings of 3rd IFAC Symposium on Robust Control Design (ROCOND 2000), IFAC, Prague, Czech Republic, Elsevier Science, Amsterdam, 2000, paper 115] is essentially used.

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

industrial planning
large-scale linear programming
evaluation of dual variables
robust reduction


The topological structure of asynchronous computability We give necessary and sufficient combinatorial conditions characterizing the class of decision tasks that can be solved in a wail-free manner by asynchronous processes that communicate by reading and writing a shared memory. We introduce a new formalism for tasks, based on notions from classical algebraic and combinatorial topology, in which a task's possible input and output values are each associated with high-dimensional geometric structures called simplicial complexes. We characterize computability in terms of the topological properties of these complexes. This characterization has a surprising geometric interpretation: a task is solvable if and only if the complex representing the task's allowable inputs can be mapped to the complex representing the task's allowable outputs by a function Satisfying certain simple regularity properties. Our formalism thus replaces the "operational" notion of a wait-free decision task, expressed in terms of interleaved computations unfolding in time, by a static "combinatorial" description expressed in terms of relations among topological spaces. This allows us to exploit powerful theorems from the classic literature on algebraic and combinatorial topology. The approach yields the first impossibility results for several long-standing open problems in distributed computing, such as the "renaming" problem of Attiya et al., and the "k-set agreement" problem of Chaudhuri.

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

algebraic topology
asynchronous distributed computation
homology
simplicial complex
wait-free algorithms


A Class of Fejr Convergent Algorithms, Approximate Resolvents and the Hybrid Proximal-Extragradient Method A new framework for analyzing Fejr convergent algorithms is presented. Using this framework, we define a very general class of Fejr convergent algorithms and establish its convergence properties. We also introduce a new definition of approximations of resolvents, which preserves some useful features of the exact resolvent and use this concept to present an unifying view of the Forward-Backward splitting method, Tsengs Modified Forward-Backward splitting method, and Korpelevichs method. We show that methods, based on families of approximate resolvents, fall within the aforementioned class of Fejr convergent methods. We prove that such approximate resolvents are the iteration maps of the Hybrid Proximal-Extragradient method, which is a generalization of the classical Proximal Point Algorithm.

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

fejr convergence
approximate resolvent
hybrid proximal-extragradient


Plasma RNA Integrity Analysis The detection of cell-free RNA in plasma and serum of human subjects has found increasing applications in the field of medical diagnostics. However, many questions regarding the biology of circulating RNA remain to be addressed. One issue concerns the molecular nature of these circulating RNA species. We have recently developed a simple and quantitative method to investigate the integrity of plasma RNA. Our results have suggested that cell-free RNA in plasma is generally present as fragmented molecules instead of intact transcripts, with a predominance of 5? fragments. In this article, we summarize the basic principles in the experimental design for plasma RNA integrity analysis and highlight some of the important technical considerations for this type of investigation

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


Speech polarity determination: A comparative evaluation The performance of various speech processing applications may be dramatically affected by an inversion of the speech polarity, which depends upon the recording setup. As a consequence, automatically detecting the speech polarity is a necessary preliminary step to guarantee a correct behaviour of such methods. The goal of this paper is two-fold. First a new approach for polarity determination based on the calculation of higher-order statistical moments is introduced. These moments oscillate at the local fundamental frequency with a phase shift which is dependent on the speech polarity. Secondly, a thorough comparative evaluation between the proposed method and three other state-of-the-art techniques is carried out. Experiments are led on a large amount of data with 10 speech corpora. In addition to an analysis in clean conditions, the robustness of these methods to both an additive noise and to reverberation is also investigated.

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

speech analysis
glottal source
phase information


Generating attacks in SysML activity diagrams by detecting attack surfaces In the development process of a secure system is essential to detect as early as possible the systems vulnerable points, the so called attack surfaces, and to estimate how feasible it would be that known attacks breach through them. Even if attack surfaces can be sometimes detected automatically, mapping them against known attacks still is a step apart. Systems and attacks are not usually modelled in compatible formalisms. We develop a practical framework that automates the whole process. We formalize a system as SysML activity diagrams and in the same formalism we model libraries of patterns taken from standard catalogues of social engineering and technical attacks. An algorithm that we define, navigates the systems diagrams in search for its attack surfaces; then it evaluates the possibility and the probability that the detected weak points host attacks among those in the modelled library. We prove the correctness and the completeness of our approach and we show how it works on a use case scenario. It represents a very common situation in the domain of communication and data security for corporations.

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

systems attacks
attack patterns
socio-technical security


A new strategy for parameter optimization to improve phase-dependent locomotion mode recognition Phase-dependent recognition strategy is an effective approach for lower-limb locomotion mode recognition. However, in previous studies, classifiers, feature sets and other parameters for the classification are the same for all the phases. The potential of this method could therefore be limited, as movement characteristics of different phases are not the same. In this paper, we aim to further improve phase-dependent recognition by proposing a new parameter optimization strategy which optimizes classifier, feature set and window size individually for each phase. Seven able-bodied subjects and one transtibial amputee subject are recruited in this research and they are required to perform six kinds of locomotion tasks. Signals recorded from two inertial measurement units and one pressure insole of the measured side are used for feature set calculation. And phase-dependent recognition method with four phases defined is applied for locomotion mode identification. The proposed strategy for parameter optimization is proved to be more efficient than the conventional optimization strategy by providing better overall recognition performance and lower computation burden.

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

locomotion mode recognition
parameter optimization

phase-dependent recognition
wearable sensing system


An efficient multivalued Hopfield network for the traveling salesman problem In this Letter we show that discrete multivalued Hopfield-type neural networks enable a relatively easy formulation of the Traveling Salesman Problem compared to the traditional Hopfield model. Thus, with the multivalued representation the network can be easily confined to feasible solutions, avoiding the need to tune any parameter. An investigation into the performance of the network has led us to define updating rules based on simple effective heuristic algorithms, a technique that can not be usually incorporated into standard Hopfield models. Simulation results for Euclidean Traveling Salesman Problems taken from the data library TSPLIB [11] indicate that this multivalued neural approach is superior to the best neural network currently reported for this problem.

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

neural networks
traveling salesman problem

combinatorial optimization
discrete hopfield model
multivalued neurons


A logical model for relational abstract domains In this article we introduce the notion of Heyting completion in abstract interpretation. We prove that Heyting completion provides a model for Cousot's reduced cardinal power of abstract domains and that it supplies a logical basis to specify relational domains for program analysis and abstract interpretation. We study the algebraic properties of Heyting completion in relation with other well-known domain transformers, like reduced product and disjunctive completion. This provides a uniform algebraic setting where complex abstract domains can be specified by simple logic formulas, or as solutions of recursive abstract domain equations, involving few basic operations for domain construction, all characterized by a clean logical interpretation. We apply our framework to characterize directionality and condensing in downward closed analysis of (constraint) logic programs.

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

abstract interpretation
domains
heyting completion
reduced cardinal power

languages
theory
closure operators
condensing analysis
constraint logic programming
directional types
intuitionistic logic
static analysis


Ein Reifegradmodell fr Unternehmenssteuerungssysteme Die Komplexitt der Unternehmensfhrung in internationalen Unternehmen nimmt stetig zu. IT-gesttzte Unternehmenssteuerungssysteme (USS), die Berichtserstattung, Planung und Konsolidierung umfassen, helfen, diese Herausforderung zu bewerkstelligen. Obwohl USS eine lange Tradition in der Managementforschung haben, ist ihre Gestaltung nach wie vor herausfordernd. Reifegradmodelle (RGM) sind bewhrte Instrumente, um Strken und Schwchen unterschiedlicher Domnen zu identifizieren. Da verfgbare Reifegradmodelle sich auf einzelne USS-Domnen konzentrieren, die IT-Perspektive vernachlssigen und oftmals ein methodisch solides Fundament vermissen lassen, stellt der vorliegende Beitrag ein empirisch fundiertes, algorithmisch konstruiertes Reifegradmodell fr USS vor. Dieses besteht aus drei Teilmodellen fr Berichterstattung, Planung und Konsolidierung, die in einem umfassenden USS-Reifegradmodell zusammengefasst werden. Deren fnf Stufen leiten schlielich die fundierte Evolution von Unternehmenssteuerungssystemen an; dies von einem grundlegenden, vom Gesetzgeber vorgeschriebenen Ansatz (Stufe1), ber einen ausgewogenen Ansatz (Stufe2) hin zu umfassenden USS (Stufe3). Auf Stufe4 weisen USS einen starken strategischen Fokus auf und nutzen auf der fnften und letzten Evolutionsstufe das Potenzial moderner IT.

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

controlling
business intelligence
gestaltungsorientierte forschung
corporate management
management accounting
management control systems
maturity models
design science


inducing shortcuts on a mobile phone interface Due to size restrictions, mobile phone user interfaces are often difficult to use[8]. In this short paper, we investigated inducing shortcuts to replace the sequence of actions required to complete common tasks on a mobile phone. In particular, we used mobile phone interaction data to evaluate several methods for inducing shortcuts. We considered the balance between maximising interface efficiency and shortcuts that remained stable and hence predictable.

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

interaction
mobile phone
efficiency
size
data
interfaces
paper
sequence

method
user oriented machine learning
adaptive user-interface
mobile phone interfaces
user interface
evaluation
action
predict
completeness


when parameter tuning actually is parameter control In this paper, we show that sequential parameter optimization (SPO), a method that was designed for (offline) parameter tuning, can be successfully used as a controller for multistart approaches of evolutionary algorithms (EA). We demonstrate this by replacing the restart heuristic of the IPOP-CMA-ES with the SPO algorithm. Experiments on the BBOB 2010 test cases suggest that the performance is at least competitive while the approach provides more options, e.g. setting more than one parameter at once. Essentially, we argue that SPO is a generalization of the IPOP heuristic and that the distinction between tuning and control is---although often useful---an artificial one.

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


How many servers are best in a dual-priority M / PH / k system? We ask the question, for minimizing mean response time (sojourn time), which is preferable: one fast server of speed 1, or k k slow servers each of speed 1/k 1 / k ? Our setting is the M / PH / k system with two priority classes of customers, high priority and low priority, where PH is a phase-type distribution. We find that multiple slow servers are often preferable, and we demonstrate exactly how many servers are preferable as a function of the load and service time distribution. In addition, we find that the optimal number of servers with respect to the high priority jobs may be very different from that preferred by low priority jobs, and we characterize these preferences. We also study the optimal number of servers with respect to overall mean response time, averaged over high and low priority jobs. Lastly, we ascertain the effect of the service demand variability of high priority jobs on low priority jobs.

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

m / ph / k m / ph / k m / ph / k m / ph / k


A formal approach for the specification and verification of a Trustworthy Human Resource Discovery mechanism in the Expert Cloud Proposing a method for Trustworthy Human Resource Discovery (THRD) in Expert Cloud. Verifying the compositions of THRD by behavioral models and state diagrams. Defining a Kripke structure of the compositions of THRD. Defining the properties of the compositions of THRD by temporal logic languages. Implementing the proposed model by NuSMV model checker.

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

cloud computing
formal verification
trust
resource discovery and model checking


Domain decomposition for coupled Stokes and Darcy flows ? A non-overlapping domain decomposition method is presented to solve a coupled StokesDarcy flow problem in parallel by partitioning the computational domain into multiple subdomains, upon which families of coupled local problems of lower complexity are formulated. The coupling is based on appropriate interface matching conditions. The global problem is reduced to an interface problem by eliminating the interior subdomain variables. The interface problem is solved by an iterative procedure, which requires solving subdomain problems at each iteration. Finite element techniques appropriate for the type of each subdomain problem are used to discretize it. The condition number of the resulting algebraic system is analyzed and numerical tests verifying the theoretical estimates are provided.

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

non-overlapping domain decomposition
coupled porous media and fluid flow
beaversjosephsaffman condition
mixed finite element


Static and free vibration analysis of composite shells by radial basis functions The higher-order shear deformation theory of laminated orthotropic elastic shells of Reddy accounts for parabolic distribution of the transverse shear strains through the thickness of the shell. The Reddy shell theory allows the fulfillment of homogeneous conditions (zero values) at the top and bottom surfaces of the shell. This paper deals with a meshless solution of the Reddy higher order shell theory in static and free vibration analysis. The meshless technique is based on the asymmetric global multiquadric radial basis function method proposed by Kansa. This paper demonstrates that this truly meshless method is very successful in the static and free vibration analysis of laminated composite shells.

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

composite materials
collocation methods
free vibrations


Neuro-fuzzy approach to processing inputs with missing values in pattern recognition problems An approach to dealing with missing data, both during the design and normal operation of a neuro-fuzzy classifier is presented in this paper. Missing values are processed within a general fuzzy min-max neural network architecture utilising hyperbox fuzzy sets as input data cluster prototypes. An emphasis is put on ways of quantifying the uncertainty which missing data might have caused. This takes a form of classification procedure whose primary objective is the reduction of a number of viable alternatives rather than attempting to produce one winning class without supporting evidence. If required, the ways of selecting the most probable class among the viable alternatives found during the primary classification step, which are based on utilising the data frequency information, are also proposed. The reliability of the classification and the completeness of information is communicated by producing upper and lower classification membership values similar in essence to plausibility and belief measures to be found in the theory of evidence or possibility and necessity values to be found in the fuzzy sets theory. Similarities and differences between the proposed method and various fuzzy, neuro-fuzzy and probabilistic algorithms are also discussed. A number of simulation results for well-known data sets are provided in order to illustrate the properties and performance of the proposed approach. (C) 2002 Elsevier Science Inc. All rights reserved.

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


resource allocation in rectangular cc-banyans A resource allocation problem in a reconfigurable multicomputer architecture based on rectangular CC-banyan multistage interconnection network with arbitrary fanout and arbitrary number of levels is studied. Four commonly used problem structures such as ring, pipeline, broadcast and macropipeline are introduced and the mapping problem of these structures on the system model which is camparable to the resource allocation problem, is discussed. Analytic solutions to several mapping questions are presented and a new fault diagnosis method based on the solution to the problem of mapping the ring structure is given.

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

macropipeline
ring
resource allocation
mapping
broadcast
fault diagnosis
pipeline
interconnection network


Moment-independent regional sensitivity analysis: Application to an environmental model Contribution to delta indices (CDI) plot is developed. CDI plot measures the contribution of specific range of inputs to output uncertainty. The proposed technique is moment-independent. Only a set of samples are needed for implementing the CDI plot. The proposed technique is applied to an environmental model.

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

moment-independent
contribution to delta indices plot
delta ratio function
uncertainty reduction
level e model


Bisimulation and cocongruence for probabilistic systems We introduce a new notion of bisimulation, called event bisimulation on labelled Markov processes and compare it with the, now standard, notion of probabilistic bisimulation, originally due to Larsen and Skou. Event bisimulation uses a sub or-algebra as the basic carrier of information rather than an equivalence relation. The resulting notion is thus based on measurable subsets rather than on points: hence the name. Event bisimulation applies smoothly for general measure spaces; bisimulation, on the other hand, is known only to work satisfactorily for analytic spaces. We prove the logical characterization theorem for event bisimulation without having to invoke any of the subtle aspects of analytic spaces that feature prominently in the corresponding proof for ordinary bisimulation. These complexities only arise when we show that on analytic spaces the two concepts coincide. We show that the concept of event bisimulation arises naturally from taking the cocongruence point of view for probabilistic systems. We show that the theory can be given a pleasing categorical treatment in line with general coalgebraic principles. As an easy application of these ideas we develop a notion of "almost sure" bisimulation; the theory comes almost "for free" once we modify Giry's monad appropriately. (c) 2005 Elsevier Inc. All rights reserved.

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

probabilistic bisimulation
cocongruence
labelled markov processes


CFD analyses of complex flows Computational fluid dynamics (CFD) of complex processes and complicated geometries embraces the transport of momentum, heat, and mass including the description of reaction kinetics and thermodynamics. The paper outlines the numerical models available for analyzing these processes and presents examples of such methodology. The unprecedented growth in computer capability has resulted in efficient simulations of most transport phenomena. The aerospace's interest in high-pressure turbulent combustion has created efficient computational tools for analyzing run-away-reactions in the process industries. Practical turbulence models, generalized thermodynamic properties, and extensive chemical kinetics data bases are currently used in three-dimensional, steady-state simulations. However, industrial needs have challenged CFD modelers to improve their flow solvers in order to simulate flows with more complicated physics, such as spray combustion, acoustic waves, transient start-up and shut-down, and flow instabilities. In addition, the practicality and efficiency of numerical simulations are highly dependent on the submodels employed, such as reaction mechanisms and turbulence models. There has been some progress in generalizing CFD tools, but more development is needed. Most of all, more high-quality and critical test data are required to validate the CFD simulations of complex processes. The laminar transport equations have been averaged by various means to locally describe both turbulent and multiphase flows. Spray combustion, stirred-tank reactors, fluidization of catalytic beds, and highly exothermic supercritical reactors are among the several validated examples, which illustrate today's technology. The designer's access to public-domain, open-source software offers powerful methodology for his use. Such software and the variety of available modeling techniques will be inventoried to demonstrate the scope of computational transport methodology. The current state of CFD models will be assessed to address the need for future research. (c) 2005 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

computational transport phenomenon
process models
model validation


Estimation of infrastructure performance models using state-space specifications of time series models We consider state-space specifications of autoregressive moving average models (ARMA) and structural time series models as a framework to formulate and estimate inspection and deterioration models for transportation infrastructure facilities. The framework provides a rigorous approach to exploit the abundance and breadth of condition data generated by advanced inspection technologies. From a managerial perspective, the framework is attractive because the ensuing models can be used to forecast infrastructure condition in a manner that is useful to support maintenance and repair optimization, and thus they constitute an alternative to Markovian transition probabilities. To illustrate the methodology, we develop performance models for asphalt pavements. Pressure and deflection measurements generated by pressure sensors and a falling weight deflectometer, respectively, are represented as manifestations of the pavements elasticity/load-bearing capacity. The numerical results highlight the advantages of the two classes of models; that is, ARMA models have superior data-fitting capabilities, while structural time series models are parsimonious and provide a framework to identify components, such as trend, seasonality and random errors. We use the numerical examples to show how the framework can accommodate missing values, and also to discuss how the results can be used to evaluate and select between inspection technologies.

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

infrastructure performance modeling
state-space models
time series analysis
missing data
maintenance optimization


Simultaneous estimation of muscle fibre conduction velocity and muscle fibre orientation using 2D multichannel surface electromyogram The paper presents a new approach for simultaneous estimation of muscle fibre conduction velocity (MFCV) and muscle fibre orientation (MFO) for motor units (MUs) in two-dimensional (2D) multichannel surface electromyography recordings. This is an important tool for detecting changes and abnormalities in muscle function and structure. In addition, simultaneous estimation of MFO and MFCV avoids the necessity of manual electrode alignment. The proposed method detected propagating MU action potentials (MUAPs) in a running time window as moving components in amplitude maps. Thereafter, estimations were obtained by fitting a three-dimensional function to these maps. The performance was evaluated using synthetic MU signals at 10 dB SNR and authentic biceps brachii measurements. Results demonstrated MFCV and MFO estimates with standard deviations of less than 0.05 m s(-1) and 1degrees for simulated signals, and less than 0.2 m s(-1) and 4degrees for experimental data. However, standard deviations as low as 0.12 m s(-1) and 1.6degrees from real signals were demonstrated. It was concluded that the method performs as well as, or better than, linear array multichannel methods when individual propagating MUAPs can be identified, even if electrodes are not aligned with fibre direction.

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

surface electromyography
multichannel
conduction velocity
fibre orientation


An Effective Self-Adaptive Admission Control Algorithm for Large Web Caches In this paper, we propose an effective Web cache admission control algorithm. By selectively admitting objects into the cache, the proposed algorithm can significantly reduce the amount of disk I/O on a Web cache while maintaining a high hit ratio. The proposed algorithm adaptively adjusts its own admission control parameter, requiring no user-supplied parameters. Through extensive experiments, we show the effectiveness of the proposed algorithm.

O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O 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 study of factors affecting research productivity of Iranian women in ISI Based on the fact that in terms of research productivity, performance of women is weaker than mens, and because little is known on the factors affecting academic womens productivity in Iran, the present article aims to study factors affecting research productivity of Iranian women in ISI. To do this, at first, women who have already had published documents indexed in ISI were identified through Web of Science. Afterwards, in order to collect their view regarding factors affecting womens research productivity, a researcher-made questionnaire was used. To analyze the collected data, the statistical software SPSS (version 17) was used. Both descriptive (Percentage and Frequency) and inferential (ANOVA) statistics were employed to reach valid findings. The findings indicate that the most motivational factors affecting positively publishing scholarly articles by Iranian women are Getting promoted in scientific rank, Intrinsic talents, Perseverance and adventitious knowledge, Feeling of being useful in society, Getting promoted in job, Being encouraged by friends and family, Religious lessons regarding the importance of science, and Attempt to show individual capabilities. Finally, some remarks for the improvement of the current condition are highlighted.

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

bibliometrics
scientific products
scientific collaboration
affecting factors


Fully coupled generalised hybrid-mixed finite element approximation of two-phase two-component flow in porous media. Part II: numerical scheme and numerical results We consider the modeling and simulation of compositional two-phase flow in a porous medium, where one phase is allowed to vanish or appear. The modeling of Marchand et al. (in review) leads to a nonlinear system of two conservation equations. Each conservation equation contains several nonlinear diffusion terms, which in general cannot be written as a function of the gradients of the two principal unknowns. Also the diffusion coefficients are not necessarily explicit local functions of them. For the generalised mixed finite elements approximation, Lagrange multipliers associated to each principal unknown are introduced, the sum of the diffusive fluxes of each component is explicitly eliminated and the static condensation leads to a "global" nonlinear system of equations only in the Lagrange multipliers also including complementarity conditions to cope with vanishing or appearing phases. After time discretisation, this system can be solved at each time step using a semi-smooth Newton method. The static condensation involves "local" nonlinear systems of equations associated to each element, solved also by a semismooth Newton method. The algorithm is successfully applied to 1D and 2D examples of water-hydrogen flow involving gas phase appearance and disappearance.

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

nonlinear systems of partial differential equations


Thorough analysis of quantum mechanical effects on MOS structure characteristics in threshold region Threshold voltage shift due to quantum mechanical effects (QMEs) are studied for both n- and p-MOS structure in the paper. Subband structure and carrier distribution are formulated for both type of MOS structure in effective mass approximation. QMEs on threshold voltage shift are thoroughly analyzed based on the model. Carrier distribution in subbands for both n-MOS and p-MOS are calculated and analyzed from density-of-states point of view. Model results for n- and p-MOS structure are compared with experimental and full-band self-consistent calculation results and show good coincidence. It is proved that at least in threshold region, effective mass approximation has similar accuracy as the full-band self-consistent method to predict the influence of QMEs MOS structure characteristics.

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

mos structure
threshold voltage
qmes
model


A profit sharing scheme for a two-firm joint venture ? Consider the scenario when two firms are setting up a joint venture. One firm has a set of technologies and knowhow for a new product while the other contributes the necessary capital for setting up and running the venture. The key issue that the two firms face in negotiating the joint venture is to determine a fair value for the technologies and knowhow. This paper presents an approach by which each firm bids a price for the technology with an objective to maximize their own profits from the joint venture. Provided that their bids satisfy a cooperation condition, the two firms settle on a price using a simple valuation formula. We analyze the impact of various factors on the decision process and provide numerical results to illustrate the bidding strategies. We conclude that in order to maximize their profits, it is often more important for both firms to increase the chance of cooperation than to increase their own shares of the joint venture.

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


Power-performance simulation and design strategies for single-chip heterogeneous multiprocessors Single chip heterogeneous multiprocessors ( SCHMs) are becoming more commonplace, especially in portable devices where reduced energy consumption is a priority. The use of coordinated collections of processors which are simpler or which execute at lower clock frequencies is widely recognized as a means of reducing power while maintaining latency and throughput. A primary limitation of using this approach to reduce power at the system level has been the time to develop and simulate models of many processors at the instruction set simulator level. High-level models, simulators, and design strategies for SCHMs are required to enable designers to think in terms of collections of cooperating, heterogeneous processors in order to reduce power. Toward this end, this paper has two contributions. The first is to extend a unique, preexisting high-level performance simulator, the Modeling Environment for Software and Hardware ( MESH), to include power annotations. MESH can be thought of as a thread-level simulator instead of an instruction-level simulator. Thus, the problem is to understand how power might be calibrated and annotated with program fragments instead of at the instruction level. Program fragments are finer-grained than threads and coarser-grained than instructions. Our experimentation found that compilers produce instruction patterns that allow power to be annotated at this level using a single number over all compiler-generated fragments executing on a processor. Since energy is power*time, this makes system runtime ( i.e., performance) the dominant factor to be dynamically calculated at this level of simulation. The second contribution arises from the observation that high-level modeling is most beneficial when it opens up new possibilities for organizing designs. Thus, we introduce a design strategy, enabled by the high-level performance power-simulation, which we refer to as spatial voltage scaling. The strategy both reduces overall system power consumption and improves performance in our example. The design space for this design strategy could not be explored without high-level SCHM power-performance simulation.

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

system architectures
integration and modeling
power management
low-power design
energy-aware systems
performance analysis
design aids


Bounding the inefficiency of logit-based stochastic user equilibrium Bounding the inefficiency of selfish routing has become an emerging research subject. A central result obtained in the literature is that the inefficiency of deterministic User Equilibrium (UE) is bounded and the bound is independent of network topology. This paper makes a contribution to the literature by bounding the inefficiency of the logit-based Stochastic User Equilibrium (SUE). In a stochastic environment there are two different definitions of system optimization: one is the traditional System Optimum (SO) which minimizes the total actual system travel time, and the other is the Stochastic System Optimum (SSO) which minimizes the total perceived travel time of all users. Thus there are two ways to define the inefficiency of SUE, i.e. to compare SUE with SO in terms of total actual system travel time, or to compare SUE with SSO in terms of total perceived travel time. We establish upper bounds on the inefficiency of SUE in both situations.

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

selfish routing
inefficiency
stochastic user equilibrium


An Adaptive Tone Mapping Method for Displaying High Dynamic Range Images Bilateral filter based tone mapping for rendering High Dynamic Range (HDR) images can not display all details in dark or highlight areas of an image. In order to solve the problem, we propose a Local Adaptive Bilateral Filter (LABF) method having threefold improvement over the bilateral filter based method. First, since less correlation between luminance and chrominance can produce better performance, we choose YUV color space with less correlation between luminance and chrominance, and only the luminance component Y is compressed. Second, to imitate the human response to light, we adjust the logarithmic base adaptively depending on each pixel's luminance value. This strategy can provide good contrast and detail preservation in dark areas while achieving the compression of high luminance range. Third, we propose an improved center/surround method to enhance visibility in the highlight or relatively darker areas further, which is a non-linear function with a weighted average of surrounding pixel values serving a variable. The experimental results show that the proposed method LABF can obtain satisfactory results on various images with different scene contents.

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

tone mapping
local adaptive
bilateral filter
high dynamic range


Syndrome measurement strategies for the [[7,1,3]] code Quantum error correction (QEC) entails the encoding of quantum information into a QEC code space, measuring error syndromes to properly locate and identify errors, and, if necessary, applying a proper recovery operation. Here we compare three syndrome measurement protocols for the [[7,1,3]] QEC code: Shor states, Steane states, and one ancilla qubit by simulating the implementation of 50 logical gates with the syndrome measurements interspersed between the gates at different intervals. We then compare the fidelities for the different syndrome measurement types. Our simulations show that the optimal syndrome measurement strategy is generally not to apply syndrome measurements after every gate but depends on the details of the error environment. Our simulations also allow a quantum computer programmer to weigh computational accuracy versus resource consumption (time and number of qubits) for a particular error environment. In addition, we show that applying syndrome measurements that are unnecessary from the standpoint of quantum fault tolerance may be helpful in achieving better accuracy or in lowering resource consumption. Finally, our simulations demonstrate that the single-qubit non-fault-tolerant syndrome measurement strategy achieves comparable fidelity to those that are fault tolerant.

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

quantum error correction
quantum fault tolerance
syndrome measurements


Local load balancing for globally efficient routing in wireless sensor networks One of the limitations of wireless sensor nodes is their inherent limited energy resource. Besides maximizing the lifetime of the sensor node, it is preferable to distribute the energy dissipated throughout the wireless sensor network in order to minimize maintenance and maximize overall system performance. Any communication protocol that involves synchronization of peer nodes incurs some overhead for setting tip the communication. We introduce a new algorithm, e3D (energy-efficient Distributed Dynamic Diffusion routing algorithm), and compare it to two other algorithms, namely directed, and random clustering communication. We take into account the setup costs and analyze the energy-efficiency and the useful lifetime of the system. In order to better understand the characteristics of each algorithm and how well e3D really performs, we also compare e3D with its optimum counterpart and an optimum clustering algorithm. The benefit of introducing these ideal algorithms is to show the upper bound on performance at the cost of astronomical prohibitive synchronization costs. We compare the algorithms in terms of system lifetime, power dissipation distribution, cost of synchronization, and simplicity of the algorithm. Our simulation results show that e3D performs comparable to its optimal counterpart while having significantly less overhead.

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

e3d
wireless sensor networks
routing algorithm
diffusion
clustering


Photorealistic scene reconstruction by voxel coloring A novel scene reconstruction technique is presented, different from previous approaches in its ability to cope with large changes in visibility and its modeling of intrinsic scene color and texture information. The method avoids image correspondence problems by working in a discretized scene space whose voxels are traversed in a fixed visibility ordering. This strategy takes full account of occlusions and allows the input cameras to be far apart and widely distributed about the environment. The algorithm identifies a special set of invariant voxels which together form a spatial and photometric reconstruction of the scene, fully consistent with the input images. The approach is evaluated with images from both inward-facing and outward-facing cameras.

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

scene reconstruction
image correspondence

multi-baseline stereo
invariants
voxel representations
occlusion
photorealism


Fuzzy

transforms

method

and

attribute

dependency

in

data

analysis

In

this

paper,

we

present

a

method

based

on

fuzzy

transforms

to

establish

dependencies

between

numerical

attributes

in

datasets.

We

find

the

best

fuzzy

partitions

of

the

attribute

domains

with

respect

to

which

we

determine

the

direct

and

inverse

fuzzy

transforms.

We

use

two

specific

regression

indexes

(which

must

be

smaller

than

a

threshold

deduced

experimentally)

for

evaluating

dependency

between

numerical

attributes.

The

experiments

are

conducted

on

two

well

known

datasets:

El

Nino

and

the

remote

sensing

data

determined

from

US

Forest

Service

(Region

Resource

Information

System,

Our

results

are

quite

in

agreement

with

the

regression

analysis

of

the

same

data.

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

attribute dependence
fuzzy transform
multiple regression


Probabilistic approach for shape optimization problems in contact mechanics Shape optimization problem for rigid stamp interacted with elastic medium is investigated. Additional forces applied to the elastic medium are supposed to be random in considered problem formulation. Probabilistic approach is applied as for formulation as for solution of the optimization problem. As a result the optimal designs of the stamps with circular base are obtained and presented in the paper.

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

probabilistic approach
shape optimization