Real-Time Data Aggregation in Contention-Based Wireless Sensor Networks We investigate the problem of delay constrained maximal information collection for CSMA-based wireless sensor networks. We study how to allocate the maximal allowable transmission delay at each node, such that the amount of information collected at the sink is maximized and the total delay for the data aggregation is within the given bound. We formulate the problem by using dynamic programming and propose an optimal algorithm for the optimal assignment of transmission attempts. Based on the analysis of the optimal solution, we propose a distributed greedy algorithm. It is shown to have a similar performance as the optimal one.

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

performance
sensor networks
data aggregation

algorithms
design
real-time traffic
csma/ca
delay constrained transmission


word sense disambiguation for event trigger word detection This paper describes a method for detecting event trigger words in biomedical text based on a word sense disambiguation (WSD) approach. We first investigate the applicability of existing WSD techniques to trigger word disambiguation in the BioNLP 2009 shared task data, and find that we are able to outperform a traditional CRF-based approach for certain word-types. On the basis of this finding, we combine the WSD approach with the CRF, and obtain significant improvements over the standalone CRF, gaining particularly in recall.

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


composing architectural aspects based on style semantics The lack of architecturally-significant mechanisms for aspectual composition might artificially hinder the specification of stable and reusable design aspects. Current aspect-oriented approaches at the architecture-level tend to mimic programming language join point models while overlooking mainstream architectural concepts such as styles and their semantics. Syntax-based pointcuts are typically used to select join points based on the names of architectural elements, exposing architecture descriptions to pointcut fragility and reusability problems. This paper presents style-based composition, a new flavor of aspect composition at the architectural level based on architectural styles. We propose style-based join point models and provide a pointcut language that supports the selection of join points based on style-constrained architectural models. Stability and reusability assessments of the proposed style-based composition model were carried out through three case studies involving different styles. The interplay of style-based pointcuts and some style composition techniques is also discussed.

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

architectural styles
architectural aspects

pointcut languages
style-based composition


using pen-based computers across the computer science curriculum This paper describes our use of pen-based electronic classrooms to enhance several computer science courses. After presenting our motivation for undertaking this work, and its relevance to the growing interest in using tablet PC's in the classroom, we present an overview of our use of this technology to engage students during class. Finally, we present the students' reaction to the approach as measured through attitude surveys and a focus group.

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

computer science
present
use
motivation
tablet
relevance
paper
attitude
class

groupware
technologies
pen
pen-based computing
survey
computation
tablet pcs
computer science curriculum
focus-group
collaborative computing
student


On the syntactic and functional correspondence between hybrid (or layered) normalisers and abstract machines ? We show how to connect the syntactic and the functional correspondence for normalisers and abstract machines implementing hybrid (or layered) reduction strategies, that is, strategies that depend on subsidiary sub-strategies. Many fundamental strategies in the literature are hybrid, in particular, many full-reducing strategies, and many full-reducing and complete strategies that deliver a fully reduced result when it exists. If we follow the standard program-transformation steps the abstract machines obtained for hybrids after the syntactic correspondence cannot be refunctionalised, and the junction with the functional correspondence is severed. However, a solution is possible based on establishing the shape invariant of well-formed continuation stacks. We illustrate the problem and the solution with the derivation of substitution-based normalisers for normal order, a hybrid, full-reducing, and complete strategy of the pure lambda calculus. The machine we obtain is a substitution-based, eval/apply, open-terms version of Pierre Crgut's full-reducing Krivine machine KN.

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

operational semantics
program transformation
full reduction


A case-based method for service-oriented value chain and sustainable network design The purpose of this research is to present a case-based analytic method for a service-oriented value chain and a sustainable network design considering customer, environmental and social values. Enterprises can enhance competitive advantage by providing more values to all stakeholders in the network. Our model employs a stylized database to identify successful cases of value chain application under similar company marketing conditions, illustrating potential value chains and sustainable networks as references. This work first identifies economic benefits, environmental friendliness and social contribution values based on prior studies. Next, a search engine which is developed based on the rough set theory will search and map similarities to find similar or parallel cases in the database. Finally, a visualized network mapping will be automatically generated to possible value chains. This study applies a case-based methodology to assist enterprises in developing a service-oriented value chain design. For decision makers, this can reduce survey time and inspire innovative works based on previous successful experience. Besides, successful ideas from prior cases can be reused. In addition to customer values, this methodology incorporates environment and social values that may encourage a company to build their value chain in a more comprehensive and sustainable manner. This is a pilot study which attempts to utilize computer-aided methodology to assist in service or value-related design. The pertinent existing solutions can be filtered from an array of cases to engage the advantages from both product-oriented and service-oriented companies. Finally, the visualized display of value network is formed to illustrate the results. A customized service-oriented value chains which incorporates environment and social values can be designed according to different conditions. Also, this system engages the advantages from both product-oriented and service-oriented companies to build a more comprehensive value network. Apart from this, the system can be utilized as a benchmarking tool, and it could remind the decision makers to consider potential value from a more multifaceted perspective. This is the first paper that applied a computer-aided method to design service-oriented value chains. This work also can serve as a decision support and benchmarking system because decision makers can develop different value networks according to various emphasized values. Finally, the visualized display of value network can improve the communication among stakeholders.

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

value chain design
sustainable network design


volume subdivision based hexahedral finite element meshing of domains with interior 2-manifold boundaries We present a subdivision based algorithm for multi-resolution Hexahedral meshing. The input is a bounding rectilinear domain with a set of embedded 2-manifold boundaries of arbitrary genus and topology. The algorithm first constructs a simplified Voronoi structure to partition the object into individual components that can be then meshed separately. We create a coarse hexahedral mesh for each Voronoi cell giving us an initial hexahedral scaffold. Recursive hexahedral subdivision of this hexahedral scaffold yields adaptive meshes. Splitting and Smoothing the boundary cells makes the mesh conform to the input 2-manifolds. Our choice of smoothing rules makes the resulting boundary surface of the hexahedral mesh as C 2 continuous in the limit (C 1 at extra-ordinary points), while also keeping a definite bound on the condition number of the Jacobian of the hexahedral mesh elements. By modifying the crease smoothing rules, we can also guarantee that the sharp features in the data are captured. Subdivision guarantees that we achieve a very good approximation for a given tolerance, with optimal mesh elements for each Level of Detail (LoD).

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

mesh generation
subdivision meshes
3d meshing


Methods for evaluating and creating data quality ? This paper provides a survey of two classes of methods that can be used in determining and improving the quality of individual files or groups of files. The first are edit/imputation methods for maintaining business rules and for imputing for missing data. The second are methods of data cleaning for finding duplicates within files or across files.

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

integer programming
set covering
approximate string comparison
unsupervised and supervised learning


Nonlinear magnetostatic BEM formulation using one unknown double layer charge Purpose - The purpose of this paper is to solve generic magnetostatic problems by BEM, by studying how to use a boundary integral equation (BIE) with the double layer charge as unknown derived from the scalar potential. Design/methodology/approach - Since the double layer charge produces only the potential gap without disturbing the normal magnetic flux density, the field is accurately formulated even by one BIE with one unknown. Once the double layer charge is determined, Biot-Savart's law gives easily the magnetic flux density. Findings - The BIE using double layer charge is capable of treating robustly geometrical singularities at edges and corners. It is also capable of solving the problems with extremely high magnetic permeability. Originality/value - The proposed BIE contains only the double layer charge while the conventional equations derived from the scalar potential contain the single and double layer charges as unknowns. In the multiply connected problems, the excitation potential in the material is derived from the magnetomotive force to represent the circulating fields due to multiply connected exciting currents.

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

boundary integral equation
double layer charge
scalar potential

multiply connected problem
nonlinear magnetostatic analysis
integral equations
electric current


Mathematical modeling of electrical activity of uterine muscle cells The uterine electrical activity is an efficient parameter to study the uterine contractility. In order to understand the ionic mechanisms responsible for its generation, we aimed at building a mathematical model of the uterine cell electrical activity based upon the physiological mechanisms. First, based on the voltage clamp experiments found in the literature, we focus on the principal ionic channels and their cognate currents involved in the generation of this electrical activity. Second, we provide the methodology of formulations of uterine ionic currents derived from a wide range of electrophysiological data. The model is validated step by step by comparing simulated voltage-clamp results with the experimental ones. The model reproduces successfully the generation of single spikes or trains of action potentials that fit with the experimental data. It allows analyzing ionic channels implications. Likewise, the calcium-dependent conductance influences significantly the cellular oscillatory behavior.

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

myometrial ionic currents
uterine excitability
action potential
electrophysiological model


Sweep synchronization as a global propagation mechanism This paper presents a new generic filtering algorithm which simultaneously considers n n conjunctions of constraints as well as those constraints mentioning some variables Yk Y k of the pairs X , Y k ( 1 ? k ? n ) occurring in these conjunctions. The main benefit of this new technique comes from the fact that, for adjusting the bounds of a variable X according to n conjunctions, we do not perform n sweeps in an independent way but rather synchronize them. We then specialize this technique to the non-overlapping rectangles constraint where we consider the case where several rectangles of height one have the same X coordinate for their origin as well as the same length. For this specific constraint we come up with an incremental bipartite matching algorithm which is triggered while we sweep over the time axis. We illustrate the usefulness of this new pruning method on a timetabling problem, where each task cannot be interrupted and requires the simultaneous availability of n distinct persons. In addition each person has his own periods of unavailability and can only perform one task at a time.

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


A structural approach to reversible computation Reversibility is a key issue in the interface between computation and physics, and of growing importance as miniaturization progresses towards its physical limits. Most foundational work on reversible computing to date has focussed on simulations of low-level machine models. By contrast, we develop a more structural approach. We show how high-level functional programs can be mapped compositionally (i.e. in a syntax-directed fashion) into a simple kind of automata which are immediately seen to be reversible. The size of the automaton is linear in the size of the functional term. In mathematical terms, we are building a concrete model of functional computation. This construction stems directly from ideas arising in Geometry of Interaction and Linear Logic-but can be understood without any knowledge of these topics. In fact, it serves as an excellent introduction to them. At the same time, an interesting logical delineation between reversible and irreversible forms of computation emerges from our analysis. (c) 2005 Elsevier B.V. All rights reserved.

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

reversible computation
automata
geometry of interaction

linear combinatory algebra
term-rewriting


UBL: The DNA of next generation e-Business This paper introduces into the evolution of Electronic Data Interchange (EDI) and the Universal Business Language (UBL). an OASIS standard to encode and customize business documents. It shows its peculiarities and also sets it into a broader picture showing where UBL is positioned in relationship to business processes and standards like BPEL and BPMN.

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

universal business language (ubl)
electronic data interchange (edi)
e-business


K-GENI testbed deployment and federated meta operations experiment over GENI and KREONET The classical Internet has confronted many drawbacks in terms of network security, scalability, and performance, although it has strongly influenced the development and evolution of diverse network technologies, applications, and services. Therefore, new innovative research on the Future Internet has been performed to resolve the inherent weaknesses of the traditional Internet, which, in turn, requires new at-scale network testbeds and research infrastructure for large-scale experiments. In this context, K-GENI has been developed as an international programmable Future Internet testbed in the GENI spiral-2 program, and it has been operational between the USA (GENI) and Korea (KREONET) since 2010. The K-GENI testbed and the related collaborative efforts will be introduced with two major topics in this paper: (1) the design and deployment of the K-GENI testbed and (2) the federated meta operations between the K-GENI and GENI testbeds. Regarding the second topic in particular, we will describe how meta operations are federated across K-GENI between GMOC (GENI Meta Operations Center) and DvNOC (Distributed virtual Network Operations Center on KREONET/K-GENI), which is the first trial of an international experiment on the federated network operations over GENI.

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


Conceptions and modeling for transmitted information evaluation by ANN In this paper, the main measure, an amount of information, of the information theory is analyzed and corrected. The three conceptions of the theory on the microstate, dissipation pathways, and self-organization levels with a tight connection to the statistical physics are discussed. The concepts of restricted information were introduced as well as the proof of uniqueness of the entropy function, when the probabilities are rational numbers, is presented. The artificial neural network (ANN) model for mapping the evaluation of transmitted information has been designed and experimentally approbated in the biological area.

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

information theory
entropy
amount of information


FMESP: Framework for the modeling and evaluation of software processes Nowadays, organizations face with a very high competitiveness and for this reason they have to continuously improve their processes. Two key aspects to be considered in the software processes management in order to promote their improvement are their effective modeling and evaluation. The integrated management of these key aspects is not a trivial task, the huge number and diversity of elements to take into account makes it complex the management of software processes. To ease and effectively support this management, in this paper we propose FMESP: a framework for the integrated management of the modeling and measurement of software processes. FMESP incorporates the conceptual and technological elements necessary to ease the integrated management of the definition and evaluation of software processes. From the measurement perspective of the framework and in order to provide the support for the software process measurement at model level a set of representative measures have been defined and validated.

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

software process modeling
software measurement
conceptual framework
software engineering environment


ANTICIPATED FUNCTION SYNCHRONIZATION WITH UNKNOWN PARAMETERS OF DISCRETE-TIME CHAOTIC SYSTEMS In this paper, firstly, the control problem for the chaos synchronization of discrete-time chaotic (hyperchaotic) systems with unknown parameters are considered. Next, back-stepping control law is derived to make the error signals between drive 2D discrete-time chaotic system and response 2D discrete-time chaotic system with two uncertain parameters asymptotically synchronized. Finally, the approach is extended to the synchronization problem for 3D discrete-time chaotic system with two unknown parameters. Numerical simulations are presented to show the effectiveness of the proposed chaos synchronization scheme.

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

backstepping design
fold maps
henon maps


Methods of assessing spinal radiographs in scoliosis are functions of its geometry The most important feature of scoliosis is the lateral curvature of the spine. It can be treated either conservatively or by surgery; however, treatment choice depends mainly on curve progression which is determined by frequent curve assessment. This is a review of methods of curve measurement and proof of the relationship between them.

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

scoliosis
curve progression
curve measurement


Feedback control of natural convection An applicable method is developed for the identification and feedback control of natural convection. The Boussinesq equation is reduced to a small set of ordinary differential equations by means of the KarhunenLove Galerkin procedure [Int. J. Heat Mass Transfer 39 (1996) 3311]. Based on this low-dimensional dynamic model, a feedback control synthesis is constructed by first performing an extended Kalman filter estimate of the velocity and temperature fields to treat the measurement errors and then developing the optimal feedback law by means of the linear quadratic regulator theory. The present method allows for the practical implementation of modern control concepts to many flow systems including natural convection.

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

karhunenlove galerkin procedure
feedback control
natural convection


Demand assigned capacity management (DACM) in IP over optical (IPO) networks The demand assigned capacity management (DACM) problem in IP over optical (IPO) network aims at devising efficient bandwidth replenishment schedules from the optical domain conditioned upon traffic evolution processes in the IP domain. A replenishment schedule specifies the location, sizing, and sequencing of link capacity expansions to support the growth of Internet traffic demand in the IP network subject to economic considerations. A major distinction in the approach presented in this paper is the focus of attention on the economics of "excess bandwidth" in the IP domain, which can be viewed as an inventory system that is endowed with fixed and variable costs and depletes with increase in IP traffic demand requiring replenishment from the optical domain. We, develop mathematical models to address the DACM problem in IPO networks based on a class of inventory management replenishment methods. We apply the technique to IPO networks that implement capacity adaptive routing in the IP domain and networks without capacity adaptive routing. We analyze the performance characteristics under both scenarios, in terms of minimizing cumulative replenishment cost over an interval of time. For the non-capacity adaptive routing scenario, we consider a shortest path approach in the IP domain, specifically OSPF. For the capacity adaptive scenario, we use an online constraint-based routing scheme. This study. represents an application of integrated traffic engineering which concerns collaborative decision making targeted towards network performance improvement that takes into consideration traffic demands, control capabilities, and network assets at different levels in the network hierarchy.

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

bandwidth replenishment
capacity management
integrated traffic engineering
inventory management
ipo

ason
demand assigned capacity management
gmpls
ip over optical networks
mpls
network performance optimization
traffic engineering


Parallel algorithm for finding modules of large-scale coherent fault trees We propose a new parallel algorithm to find all modules of a large fault tree. An experiment is used to compare the linear time algorithm and parallel algorithm. The result shows that our method is efficient in handling large-scale fault trees.

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


Finding relevant clustering directions in high-dimensional data using Particle Swarm Optimization A method based on Particle Swarm Optimization (PSO) is proposed and described for finding subspaces that carry meaningful information about the presence of groups in high-dimensional data sets. The advantage of using PSO is that not only the variables that are responsible for the main data structure are identified but also other subspaces corresponding to local optima. The characteristics of the method are shown on two simulated data sets and on a real matrix coming from the analysis of genomic microarrays. In all cases, PSO allowed to explore different subspaces and to discover meaningful structures in the analyzed data. Copyright (C) 2010 John Wiley & Sons, Ltd.

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

variable selection
particle swarm optimization (pso)
swarm intelligence


Neural network learning of optimal Kalman prediction and control Although there are many neural network (NN) algorithms for prediction and for control, and although methods for optimal estimation (including filtering and prediction) and for optimal control in linear systems were provided by Kalman in 1960 (with nonlinear extensions since then), there has been, to my knowledge, no NN algorithm that learns either Kalman prediction or Kalman control (apart from the special case of stationary control). Here we show how optimal Kalman prediction and control (KPC), as well as system identification, can be learned and executed by a recurrent neural network composed of linear-response nodes, using as input only a stream of noisy measurement data. The requirements of KPC appear to impose significant constraints on the allowed NN circuitry and signal flows. The NN architecture implied by these constraints bears certain resemblances to the local-circuit architecture of mammalian cerebral cortex. We discuss these resemblances, as well as caveats that limit our current ability to draw inferences for biological function. It has been suggested that the local cortical circuit (LCC) architecture may perform core functions (as yet unknown) that underlie sensory, motor, and other cortical processing. It is reasonable to conjecture that such functions may include prediction, the estimation or inference of missing or noisy sensory data, and the goal-driven generation of control signals. The resemblances found between the KPC NN architecture and that of the LCC are consistent with this conjecture.

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

kalman control
recurrent neural network
local cortical circuit


Learning point-to-point movements on an elastic limb using dynamic movement primitives Expansion of the DMP approach for gravitation compensation in elastic robots. Grid-based mixture approach based on bilinear interpolation of learned trajectories. Model-free gravitation compensation in directed limb movements.

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

passive compliance
compliant robotics
reinforcement learning
robot arm
directed limb movement


Audio dual watermarking scheme for copyright protection and content authentication We propose a new multipurpose audio watermarking scheme in which two watermarks are used. For intellectual property protection, audio clip is divided into frames and robust watermark is embedded. At the same time, the feature of each frame is extracted, and it is quantized as semi-fragile watermark. Then, the frame is cut into sections and the semi-fragile watermark bits are embedded into these sections. For content authentication, the semi-fragile watermark extracted from each frame is compared with the watermark generated from the same frame to judge whether the watermarked audio is tampered, and locate the tampered position. Experimental results show that our scheme is inaudibility. The two watermark schemes are all robust to common signal processing operations such as additive noise, resampling, re-quantization and low-pass filtering, and the semi-fragile watermark scheme can achieve tampered detection and location.

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

multipurpose audio watermarking
robust watermark
copyright protection
content authentication


A comparison of path planning strategies for autonomous exploration and mapping of unknown environments To date, a large number of algorithms to solve the problem of autonomous exploration and mapping has been presented. However, few efforts have been made to compare these techniques. In this paper, an extensive study of the most important methods for autonomous exploration and mapping of unknown environments is presented. Furthermore, a representative subset of these techniques has been chosen to be analysed. This subset contains methods that differ in the level of multi-robot coordination and in the grade of integration with the simultaneous localization and mapping (SLAM) algorithm. These exploration techniques were tested in simulation and compared using different criteria as exploration time or map quality. The results of this analysis are shown in this paper. The weaknesses and strengths of each strategy have been stated and the most appropriate algorithm for each application has been determined.

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

autonomous exploration
mapping of unknown environments

path planning for multiple mobile robot systems


Improving reliable multicast using active parity encoding services ? We propose and evaluate novel reliable multicast protocols that combine active repair service (a.k.a. local recovery) and parity encoding (a.k.a. forward error correction or FEC) techniques. We show that, compared to other repair service protocols, our protocols require less buffer inside the network, maintain the low bandwidth requirements of previously proposed repair service/FEC combination protocols, and reduce the amount of FEC processing at repair servers, moving more of this processing to the end-hosts. We also examine repair service/FEC combination protocols in an environment where loss rates differ across domains within the network. We find that repair services are more effective than FEC at reducing bandwidth utilization in such environments. Furthermore, we show that adding FEC to a repair services protocol not only reduces buffer requirements at repair servers, but also reduces bandwidth utilization in domains with high loss, or in domains with large populations of receivers.

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

reliable multicast
forward error correction
repair services


A comparative study on concept drift detectors We evaluated eight different concept drift detectors. A 2k factorial design was used to indicate the best parameters for each method. Tests compared accuracy, evaluation time, false alarm and miss detection rates. A Mahalanobis distance is proposed as a metric to compare drift methods. DDM was the method that presented the best average results in all tested datasets.

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

data streams
time-changing data
comparison


automatic photo pop-up This paper presents a fully automatic method for creating a 3D model from a single photograph. The model is made up of several texture-mapped planar billboards and has the complexity of a typical children's pop-up book illustration. Our main insight is that instead of attempting to recover precise geometry, we statistically model geometric classes defined by their orientations in the scene. Our algorithm labels regions of the input image into coarse categories: "ground", "sky", and "vertical". These labels are then used to "cut and fold" the image into a pop-up model using a set of simple assumptions. Because of the inherent ambiguity of the problem and the statistical nature of the approach, the algorithm is not expected to work on every image. However. it performs surprisingly well for a wide range of scenes taken from a typical person's photo album.

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

single-view reconstruction
image-based rendering
machine learning
image segmentation


H and H2 stabilisers via static output feedback based on coordinate transformations with free variables This article designs H and H2 stabilisers, respectively, for linear time-invariant systems via static output feedback (SOF). A state coordinate transformation of controlled system generates a dummy system with lower dimension, which cannot be directly influenced by the SOF stabiliser. Then the H (H2) stabiliser via SOF may be obtained by solving proper linear matrix inequality (LMI). This LMI is feasible only if the dummy system has a state feedback stabiliser with the same H (H2) index. Meanwhile, a free matrix variable in coordinate transformation can act as the state feedback gain matrix. Hence after the design of dummy system, the SOF stabiliser can be determined if certain LMI is feasible. This method does not concern any conservative reduction or enlargement of matrix inequalities. Numerical examples show the validity of the proposed algorithms.

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

coordinates transformation
optimal control
h control


Observation of linear systems with unknown inputs via high-order sliding-modes A high- order sliding- mode observer is designed for linear time invariant systems with single output and unknown bounded single input. It provides for the global observation of the state and the output under sufficient and necessary conditions of strong observability or strong detectability. The observation is finite- time- convergent and exact in the strong observability case. The accuracy of the proposed observation and identification schemes is estimated via the sampling step or magnitude of deterministic noises. The results are extended to the multi- input multi- output case.

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


A Mathematical Model of Penile Vascular Dysfunction and Its Application to a New Diagnostic Technique A noninvasive diagnostic device was developed to assess the vascular origin and severity of penile dysfunction. It was designed and studied using both a mathematical model of penile hemodynamics and preliminary experiments on healthy young volunteers. The device is based on the application of an external pressure (or vacuum) perturbation to the penis following the induction of erection. The rate of volume change while the penis returns to its natural condition is measured using a noninvasive system that includes a volume measurement mechanism that has very low friction, thereby not affecting the measured system. The rate of volume change (net flow) is obtained and analyzed. Simulations using a mathematical model show that the device is capable of differentiating between arterial insufficiency and venous leak and indicate the severity of each. In preliminary measurements on young healthy volunteers, the feasibility of the measurement has been demonstrated. More studies are required to confirm the diagnostic value of the measurements

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

arterial insufficiency
venous leak
mathematical model
hemodynamics

erectile dysfunction
veno-occlusive mechanism


The spectra of irreducible matrices over completed idempotent semifields Motivated by some spectral results in the characterization of concept lattices we investigate the spectra of reducible matrices over complete idempotent semifields in the framework of naturally-ordered semirings, or dioids. We find non-null eigenvectors for every non-null element in the semifield and conclude that the notion of spectrum has to be refined to encompass that of the incomplete semifield case so as to include only those eigenvalues with eigenvectors that have finite coordinates. Considering special sets of eigenvectors brings out finite complete lattices in the picture and we contend that such structure may be more important than standard eigenspaces for matrices over completed idempotent semifields.

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

matrix spectra
complete idempotent semimodules
spectral order lattices


interactive technologies for health special interest group Health and how to support it with interactive computer systems, networks, and devices is a global and, for many countries, an explicit national priority. Significant interest in issues related to interactive systems for health has been demonstrated repeatedly within SIGCHI. A community focused on health started in 2010, fostering collaboration and dissemination of research findings as well as bridging with practitioners. As part of this community's on-going efforts, we will hold a special interest group session during ACM CHI 2011 to discuss, prioritize, and promote some of these most pressing issues facing the community.

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

fitness
assistive technologies
medicine
telecare
wellness
nutrition
health informatics


Cyclic sequence alignments: Approximate versus optimal techniques The problem of cyclic sequence alignment is considered. Most existing optimal methods for comparing cyclic sequences are very time consuming. For applications where these alignments are intensively used, optimal methods axe seldom a feasible choice. The alternative to an exact and costly solution is to use a close-to-optimal but cheaper approach. In previous works, we have presented three suboptimal techniques inspired on the quadratic-time suboptimal algorithm proposed by Bunke and Buhler. Do these approximate approaches come sufficiently close to the optimal solution, with a considerable reduction in computing time? Is it thus worthwhile investigating these approximate methods? This paper shows that approximate techniques are good alternatives to optimal methods.

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

cyclic string matching
structural pattern analysis


Direct AuAu bonding technology for high performance GaAs/AlGaAs quantum cascade lasers In this paper we investigate chip bonding technology of GaAs/AlGaAs quantum cascade lasers (QCLs). Its results have strong influence on final performance of devices and are essential for achieving room temperature operation. Various solders were investigated and compared in terms of their thermal resistance and induced stress. The spatially resolved photoluminescence technique has been applied for a device thermal analysis. The soldering quality was also investigated by means of a scanning acoustic microscopy. The particular attention has been paid to AuAu die bonding, which seems to be a promising alternative to the choice between hard and soft solder bonding of GaAs/AlGaAs QCLs operating from cryogenic temperatures up to room temperatures. A good quality direct AuAu bonding was achieved for bonding parameters comparable with the ones typical for AuSn eutectic bonding process. High performance room temperature operation of GaAs/AlGaAs QCLs has been achieved with the state-of-the-art parameters.

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

gaas/algaas quantum cascade laser
mounting technology
die-bonding
packaging
scanning accustic microscopy


Harnessing Cloud Technologies for a Virtualized Distributed Computing Infrastructure The InterGrid system aims to provide an execution environment for running applications on top of interconnected infrastructures. The system uses virtual machines as building blocks to construct execution environments that span multiple computing sites. Such environments can be extended to operate on cloud infrastructures, such as Amazon EC2. This article provides an abstract view of the proposed architecture and its implementation; experiments show the scalability of an InterGrid-managed infrastructure and how the system can benefit from using the cloud.

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

cloud computing
grid computing
distributed systems
scheduling
resource management
virtualization
intergrid gateway


A method of MPEG2-TS test stream generation for digital TV software Input of the digital TV software is a transport stream (TS) in MPEG (Moving Picture Expert Group)-2 format, a standard specification for moving picture compression. We propose a method to thoroughly generate MPEG-2 TS test data, namely, a test stream based on the black-box test concept for digital TV software. We also introduce a tool to automate the test stream generation known as Auto-TEst data generator from Protocol standard (ATEP). This empirical study of the application of an ATEP-derived test stream to an actual digital TV software settop box should benefit digital TV software developers as well as other testers.

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

mpeg2-ts test stream
digital tv software test
black-box test


UNIFIED REPRESENTATION OF ZIPF DISTRIBUTIONS Certain discrete probability distributions, used independently from each other in linguistics and other sciences, can be considered as special cases of the distribution based on the Lerch zeta function. We will list the probability functions for some of the most important cases. Moments and estimators are derived for the general Lerch distribution.

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

lerch zeta function
zipf distributions
estimators


Physical quantum algorithms I review the differences between classical and quantum systems, emphasizing the connection between no-hidden variable theorems and superior computational power of quantum computers. Using quantum lattice gas automata as examples, I describe possibilities for efficient simulation of quantum and classical systems with a quantum computer. I conclude with a list of research directions. (C) 2002 Published by Elsevier Science B.V.

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


A slack-diversifying nonlinear fluctuation smoothing rule for job dispatching in a wafer fabrication factory This study proposes a slack-diversifying nonlinear fluctuation smoothing rule to reduce the average cycle time in a wafer fabrication factory. The slack-diversifying nonlinear fluctuation smoothing rule is derived from the one-factor tailored nonlinear fluctuation smoothing rule for cycle time variation (1f-TNFSVCT) by dynamically maximizing the standard deviation of the slack, which has been shown to improve scheduling performance in several previous studies. The effectiveness of the proposed rule has been validated via using it with a simulated data set. Based on the findings in this research we also derived several directions that can be exploited in the future.

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

wafer fabrication
slack
fluctuation smoothing


Linear and compact floating node voltage-controlled variable resistor circuit In this letter, my proposals for a Floating node voltagecontrolled Variable Resistor circuit (FVR) are based upon its advantages as linear and compact. The performance of the proposed circuit was confirmed by PSpice simulation. The simulation results are reported in this letter.

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


The management information systems (MIS) job market late 1970s-late 1990s The rapidly changing information technology (IT) environment continues to pose a challenging dilemma for both management information systems (MIS) managers and MIS educators at all levels, especially the collegiate level. This research examines the content of MIS-related job advertisements over a 20-year period: late 1970s-late 1990s. It is the continuation of a study initially published in The Journal of Computer Information Systems (6) and includes the data that represents the late 1990s timeframe. Results trace the rise and fall in demand for certain IT skills and knowledge and identify the growing strength or stability of others. The study clearly exposes the great diversity in the MIS job market. This diversity is the root cause of the dilemma confronting MIS managers and MIS educators as they try to recruit workers from or prepare students for the changing IT environment.

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

mis job market diversity
mis skills
mis knowledge


Development of a ceramic bolus for the permanent electronic identification of sheep, goat and cattle Retention rate and digestive and performance effects of ceramic boluses (6620 mm, 65 g) enclosing passive transponders (32.53.8 mm) were studied in three experiments. Reading distances of transponders inside and outside the boluses (n=10) did not vary. In the first experiment, a total of 2452 boluses were applied to 74 lambs and 808 ewes, 16 young and 67 adult goats, 1138 calves and 349 cows. Plastic balling guns were used to insert the boluses and their effects were evaluated during 3 years or until slaughter. Time needed for application and recommended live-weights (LW) depended on animal category (sheep, 24 s and >25 kg; goats, 26 s and >20 kg; cattle, 19240 s and >30 kg). Application in calves was possible during the first week of life. Retention rates were 100, 98.8 and 99.7% in sheep, goats and cattle, respectively. The location of boluses in the reticulum was checked with hand-held readers and verified by X-ray in a sample (n=4) of each animal category or directly in cannulated cows (n=3). Transceivers were interfaced with electronic scales for automatic weight recording. Dynamic reading efficiency was 100% in race-ways with a frame antenna (9452 cm). Health and performances were not modified by boluses. An average of 93% of boluses were found in the reticulum at slaughter. Recovery rates and times varied according to animal category (lambs, 100% and 5 s; ewes and goats, 100% and 8 s; fattened calves, 91.3% and 12 s; dairy cows, 72% and 14 s). In the second experiment, two groups of adult ewes (control, n=5; bolus, n=5) were housed in individual pens and fed forage ad libitum. Mean forage intake and nutrient digestibility were not varied by the ceramic boluses. In the third experiment 45 fattening male lambs (20 kg LW) and 20 replacement ewe-lambs (30 kg LW) were used. Fattening lambs were divided into two groups and assigned to the treatments (control, n=25; bolus, n=20) until slaughter (25 kg LW). In spite of the difficulties observed in the force-feeding of boluses in eight lambs (40%), average daily gain and reticulum-rumen mucosa were not altered. Ewe-lambs were also assigned to the treatments in two groups (control, n=10; bolus, n=10) and monitored until first lambing or 1 year old. The weight, body condition score and reproductive performance were not affected by boluses. In conclusion, the use of the ceramic bolus is recommended as a safe and tamper-proof method for electronic identification of ruminants once the animals have reached a weight where successful administration is possible. Moreover, boluses proved to be useful for dynamic reading and automatic weight recording on farm conditions.

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


OWL-Eu: Adding customised datatypes into OWL ? Although OWL is rather expressive, it has a very serious limitation on datatypes; i.e., it does not support customised datatypes. It has been pointed out that many potential users will not adopt OWL unless this limitation is overcome, and the W3C Semantic Web Best Practices and Development Working Group has set up a task force to address this issue. This paper makes the following two contributions: (i) it provides a brief summary of OWL-related datatype formalisms, and (ii) it provides a decidable extension of OWL DL, called OWL-Eu, that supports customised datatypes. A detailed proof of the decidability of OWL-Eu is presented.

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

ontologies
description logics
unary datatype groups


Turning a community into a market: A practice perspective on information technology use in boundary spanning This paper examines how information technology (IT) transforrns relations across fields of practice within organizations. Drawing on Bourdieu's practice theory, we argue that the production of any practice involves varying degrees of embodiment (i.e., relying on personal relationships) and objectification (i.e., relying on the exchange of objects). We subsequently characterize boundary-spanning practices according to their relative degrees of embodiment and objectification. We distinguish between "market-like" boundary-spanning practices, which rely primarily on an objectified mode of practice production, from "community-like" practices, which involve mostly the embodied mode of practice production. IT is then conceptualized as a medium for sharing objects in the production of practices. As such, IT use allows for the sharing of objects without relying on embodied relationships. We use data from an in-depth ethnographic case study to investigate how IT was used to transform community-like boundary-spanning practices within an organization into market-like ones. Moreover, we demonstrate how, as IT was used to support the exchange and combination of depersonalized objects, other aspects of the practice (such as the roles of intermediaries and the nature of meetings) also changed. The related changes in these diverse aspects of a boundary-spanning practice supported the trend toward greater objectification. IT use also increased visibility of the terms associated with object exchange. This increased visibility exposed the inequity of the exchange and encouraged the disadvantaged party to renegotiate the relationship.

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

boundary spanning
information technology use
practice theory

boundary objects
boundary spanners
communities of practice
coordination mechanisms
qualitative methods


Integration of Different Risk Assessment Tools to Improve Stratification of Patients with Coronary Artery Disease Cardiovascular disease (CVD) causes unaffordable social and health costs that tend to increase as the European population ages. In this context, clinical guidelines recommend the use of risk scores to predict the risk of a cardiovascular disease event. Some useful tools have been developed to predict the risk of occurrence of a cardiovascular disease event (e.g. hospitalization or death). However, these tools present some drawbacks. These problems are addressed through two methodologies: (i) combination of risk assessment tools: fusion of nave Bayes classifiers complemented with a genetic optimization algorithm and (ii) personalization of risk assessment: subtractive clustering applied to a reduced-dimensional space to create groups of patients. Validation was performed based on two ACS-NSTEMI patient data sets. This work improved the performance in relation to current risk assessment tools, achieving maximum values of sensitivity, specificity, and geometric mean of, respectively, 79.8, 83.8, and 80.9%. Additionally, it assured clinical interpretability, ability to incorporate of new risk factors, higher capability to deal with missing risk factors and avoiding the selection of a standard CVD risk assessment tool to be applied in the clinical practice.

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

information and knowledge management
management of cardiovascular diseases
decision-support systems


Segmenting ideal morphologies of sewer pipe defects on CCTV images for automated diagnosis Several literatures presented automated systems for detecting or classifying sewer pipe defects based on morphological features of pipe defects. In those automated systems, however, the morphologies of the darker center or some uncertain objects on CCTV images are also segmented and become noises while morphology-based pipe defect segmentation is implemented. In this paper, the morphology-based pipe defect segmentation is proposed and discussed to be an improved approach for automated diagnosis of pipe defects on CCTV images. The segmentation of pipe defect morphologies is first to implement an opening operation for gray-level CCTV images to distinguish pipe defects. Then, Otsu's technique is used to segment pipe defects by determining the optimal thresholds for gray-level CCTV images of opening operation. Based on the segmentation results of CCTV images, the ideal morphologies of four typical pipe defects are defined. If the segmented CCTV images match the definition of those ideal morphologies, the pipe defects on those CCTV images can be successfully identified by a radial basis network (RBN) based diagnostic system. As for the rest CCTV images failing to match the ideal morphologies, the failure causes was discussed so to suggest a regulation for imaging conditions, such as camera pose and light source, in order to obtain CCTV images for successful segmentation. (C) 2008 Elsevier Ltd. All rights reserved.

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

image processing
morphologies of pipe defects


A new fuzzy rule-based classification system for word sense disambiguation Word sense disambiguation (WSD) can be thought of as the most challenging task in the process of machine translation. Various supervised and unsupervised learning methods have already been proposed for this purpose. In this paper, we propose a new efficient fuzzy classification system in order to be applied for WSD. In order to optimize the generalization accuracy, we use rule-weight as a simple mechanism to tune the classifier and propose a new learning method to iteratively adjust the weight of fuzzy rules. Through computer simulations on TWA data as a standard corpus, the proposed scheme shows a uniformly good behavior and achieves results which are comparable or better than other classification systems, proposed in the past.

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

word sense disambiguation
machine translation
classification
generalization accuracy


On the hierarchy of conservation laws in a cellular automaton Conservation laws in cellular automata (CA) are studied as an abstraction of the conservation laws observed in nature. In addition to the usual real-valued conservation laws we also consider more general group-valued and semigroup-valued conservation laws. The (algebraic) conservation laws in a CA form a hierarchy, based on the range of the interactions they take into account. The conservation laws with smaller interaction ranges are the homomorphic images of those with larger interaction ranges, and for each specific range there is a most general law that incorporates all those with that range. For one-dimensional CA, such a most general conservation law haseven in the semigroup-valued casean effectively constructible finite presentation, while for higher-dimensional CA such effective construction exists only in the group-valued case. It is even undecidable whether a given two-dimensional CA conserves a given semigroup-valued energy assignment. Although the local properties of this hierarchy are tractable in the one-dimensional case, its global properties turn out to be undecidable. In particular, we prove that it is undecidable whether this hierarchy is trivial or unbounded. We point out some interconnections between the structure of this hierarchy and the dynamical properties of the CA. In particular, we show that positively expansive CA do not have non-trivial real-valued conservation laws.

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

cellular automata
conservation laws
energy

reversibility
undecidability
dynamical systems
chaos


Positive periodic solutions for the neutral ratio-dependent predatorprey model ? By using a continuation theorem based on coincidence degree theory, we obtain some new sufficient conditions for the existence of positive periodic solutions for the neutral ratio-dependent predatorprey model with Holling type II functional response.

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

predatorprey model
neutral
coincidence degree


Impact of dual-k spacer on analog performance of underlap FinFET Multigate structures have better short channel control than conventional bulk devices due to increased gate electrostatic control. FinFET is a promising candidate among multigate structures due to its ease of manufacturability. The RF performance of FinFET is affected by gate controlled parameters such as transconductance, output conductance and total gate capacitance. In this paper we have used dual-k spacers in underlap FinFETs to improve the gate electrostatic integrity. The inner high-k spacer helps in better screening out the gate sidewall fringing fields, thereby, increasing transconductance and reducing output conductance with increase in total gate capacitance. At 16nm gate lengths, we have observed that, the intrinsic gain of dual-k spacer based FinFET can be increased by more than 100% (>6dB) without affecting cutoff frequency and maximum oscillation frequency, as compared to conventional single spacer based FinFET. Improvement in cutoff frequency by 11% and maximum oscillation frequency by 5% can be achieved, when the gate lengths are scaled down to 12nm, in addition to 2.75 times (8.8dB) increase in intrinsic gain.

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

short channel effect (sce)
dual-k spacer
figures of merit (fom)
electrostatic integrity (ei)


3D depth estimation for visual inspection using in wavelet transform modulus maxima A vision based approach for calculating accurate 3D models of the objects is presented. Generally industrial visual inspection systems capable of accurate 3D depth estimation rely on extra hardware tools like laser scanners or light pattern projectors. These tools improve the accuracy of depth estimation but also make the vision system costly and cumbersome. In the proposed algorithm, depth and dimensional accuracy of the produced 3D depth model depends on the existing reference model instead of the information from extra hardware tools. The proposed algorithm is a simple and cost effective software based approach to achieve accurate 3D depth estimation with minimal hardware involvement. The matching process uses the well-known coarse to fine strategy, involving the calculation of matching points at the coarsest level with consequent refinement up to the finest level. Vector coefficients of the wavelet transform-modulus are used as matching features, where wavelet transform-modulus maxima defines the shift invariant high-level features with phase pointing to the normal of the feature surface. The technique addresses the estimation of optimal corresponding points and the corresponding 2D disparity maps leading to the creation of accurate depth perception model. (c) 2006 Elsevier Ltd. All rights reserved.

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

wavelet transform modulus
coarse to fine
disparity
3d depth


Adaptive FEC-based packet loss resilience scheme for supporting voice communication over ad hoc wireless networks Providing real-time voice support over multihop ad hoc wireless networks (AWNS) is a challenging task. The standard retransmission-based strategies proposed in the literature are poorly matched to voice applications because of timeliness and large overheads involved in transmitting small-sized voice packets. To make a voice application feasible over AWNS, the perceived voice quality must be improved while not significantly increasing the packet overhead. We suggest packet-level media-dependent adaptive forward error correction (FEC) at the application layer in tandem with multipath transport for improving the voice quality. Since adaptive FEC masks packet losses in the network, at the medium access control (MAC) layer, we avoid retransmissions (hence, no acknowledgments) in order to reduce the control overhead and end-to-end delay. Further, we exploit the combined strengths of layered coding and multiple description (MD) coding for supporting error-resilient voice communication in AWNS. We propose an efficient packetization scheme in which the important substream of the voice stream is protected adaptively with FEC depending on the loss rate present in the network and is transmitted over two maximally node-disjoint paths. The less important substream of the voice stream is encoded into two descriptions, which are then transmitted over two maximally node-disjoint paths. The performance of our scheme (packet-level media-dependent adaptive FEC scheme) is evaluated in terms of two parameters: residual packet loss rate (RPLR, packet loss rate after FEC recovery) and average burst length (ABL, average length of consecutive packet losses after FEC recovery) of voice data after FEC recovery. The sets of equations leading to the analytical formulation of both RPLR and ABL are first given for a renewal error process. The values of both these parameters depend on FEC-Offset (r, the distance between original voice frame and piggybacked redundant voice frame) and loss rate present in the network. Then, these parameters are computed for a Gilbert-Elliott (GE) two-state Markov error model and compared with experimental data. Our scheme adaptively selects the FEC-Offset (it chooses r that minimizes RPLR and ABL as much as possible) based on the loss rate feedback obtained from the destination. The proposed scheme achieves significant gains in terms of reduced frame loss rate (FLR), reduced control overhead, and minimum end-to-end delay and almost doubles the perceived voice quality compared to the existing approaches.

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

voice frame
layered coding
forward error correction
packetization scheme
voice quality
multipath transport

ad hoc networks
multiple description coding
multimedia


Introduction of a data schema to support a design repository This paper presents the data schema required to capture fundamental elements of design information in a heterogeneous repository supporting design reuse. Design information captured by the repository can be divided into seven main categories of artifact-, function-, failure-, physical-, performance-, sensory- and media-related information types. Each of the seven types of design information is described in detail. The repository schema is specific to a relational database system driving the implemented design repository; however, the types of design information recorded are applicable to any implementation of a design repository. The aim of this paper is to fully describe the data schema such that it could be recreated or specialized for industrial or research applications. The result is a complete description of fundamental design knowledge to support design reuse and a data schema specification. The data schema has been vetted with the implemented design repository that contains design information for over 100 consumer electro-mechanical products.

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

design repository schema
conceptual design


Distributivity in lattices of fuzzy subgroups The main goal of this paper is to study the finite groups whose lattices of fuzzy subgroups are distributive. We obtain a characterization of these groups which is similar to a well-known result of group theory. (C) 2008 Elsevier Inc. All rights reserved.

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

fuzzy subgroup lattices
subgroup lattices
finite cyclic groups
equivalence relations


on delegation and workflow execution models Workflow systems have long been of interest to computer science researchers due to their practical relevance. Supporting delegation mechanisms in workflow systems is receiving increasing research interest. In this paper, we conduct a comprehensive study of user delegation operations in computerized workflow systems. In a workflow system, the semantics of a delegation operation are largely based on three factors: the underlying workflow execution model, task type and delegation type. We describe three different workflow execution models and examine the effect of various delegation operations in each workflow execution model. We then extend our workflow execution models to examine the effect of various delegation operations in different role-based workflow execution models.

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


On-line anomaly detection and resilience in classifier ensembles Detection of anomalies is a broad field of study, which is applied in different areas such as data monitoring, navigation, and pattern recognition. In this paper we propose two measures to detect anomalous behaviors in an ensemble of classifiers by monitoring their decisions; one based on Mahalanobis distance and another based on information theory. These approaches are useful when an ensemble of classifiers is used and a decision is made by ordinary classifier fusion methods, while each classifier is devoted to monitor part of the environment. Upon detection of anomalous classifiers we propose a strategy that attempts to minimize adverse effects of faulty classifiers by excluding them from the ensemble. We applied this method to an artificial dataset and sensor-based human activity datasets, with different sensor configurations and two types of noise (additive and rotational on inertial sensors). We compared our method with two other well-known approaches, generalized likelihood ratio (GLR) and One-Class Support Vector Machine (OCSVM), which detect anomalies at data/feature level. We found that our method is comparable with GLR and OCSVM. The advantages of our method compared to them is that it avoids monitoring raw data or features and only takes into account the decisions that are made by their classifiers, therefore it is independent of sensor modality and nature of anomaly. On the other hand, we found that OCSVM is very sensitive to the chosen parameters and furthermore in different types of anomalies it may react differently. In this paper we discuss the application domains which benefit from our method.

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

classifier ensemble
decision fusion
human activity recognition


Scheduling unrelated parallel machines to minimize total weighted tardiness This article considers the problem of scheduling a given set of independent jobs on unrelated parallel machines to minimize the total weighted tardiness. The problem is known to be NP-hard in the strong sense. Efficient lower and upper bounds are developed. The lower bound is based on the solution of an assignment problem, while the upper bound is obtained by a two-phase heuristic. A branch-and-bound algorithm that incorporates various dominance rules is presented. Computational experiments are conducted to demonstrate the performance of the proposed algorithm. Scope and purpose Parallel machine scheduling models are important from both the theoretical and practical points of view. From the theoretical point of view, they generalize the single machine scheduling models. From the practical point of view, they are important because the occurrence of a bank of machines in parallel is common in industries. In this article, the unrelated parallel machine total weighted tardiness scheduling problem is examined. The tardiness criterion has many applications in real world. This problem is difficult to solve. A branch-and-bound algorithm that incorporates various dominance rules along with efficient lower and upper bounds is proposed to find an optimal solution.

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


Lock-free deques and doubly linked lists We present a practical lock-free shared data structure that efficiently implements the operations of a concurrent deque as well as a general doubly linked list. The implementation supports parallelism for disjoint accesses and uses atomic primitives which are available in modern computer systems. Previously known lock-free algorithms of doubly linked lists are either based on non-available atomic synchronization primitives, only implement a subset of the functionality, or are not designed for disjoint accesses. Our algorithm only requires single-word compare-and-swap atomic primitives, supports fully dynamic list sizes, and allows traversal also through deleted nodes and thus avoids unnecessary operation retries. We have performed an empirical study of our new algorithm on two different multiprocessor platforms. Results of the experiments performed under high contention show that the performance of our implementation scales linearly with increasing number of processors. Considering deque implementations and systems with low concurrency, the algorithm by Michael shows the best performance. However, as our algorithm is designed for disjoint accesses, it performs significantly better on systems with high concurrency and non-uniform memory architecture.

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

deque
doubly linked list
shared data structure
concurrent


An optimal deployable bandwidth aggregation system ? The explosive increase in data demand coupled with the rapid deployment of various wireless access technologies have led to the increase of number of multi-homed or multi-interface enabled devices. Fully exploiting these interfaces has motivated researchers to propose numerous solutions that aggregate their available bandwidths to increase overall throughput and satisfy the end-users growing data demand. These solutions, however, do not utilize their interfaces to the maximum without network support, and more importantly, have faced a steep deployment barrier. In this paper, we propose an optimal deployable bandwidth aggregation system (DBAS) for multi-interface enabled devices. We present the DBAS architecture that does not introduce any intermediate hardware, modify current operating systems, modify socket implementations, nor require changes to current applications or legacy servers. The DBAS architecture is designed to automatically estimate the characteristics of applications and dynamically schedule various connections and/or packets to different interfaces. We also formulate our optimal scheduler as a mixed integer programming problem yielding an efficient solution. We evaluate DBAS via implementation on the Windows OS and further verify our results with simulations on NS2. Our evaluation shows that, with current Internet characteristics, DBAS reaches the throughput upper bound with no modifications to legacy servers. It also highlights the significant enhancements in the response time introduced by DBAS, which directly enhances the user experience.

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

multiple network interfaces
optimization
multihoming


Dynamic bandwidth allocation in heterogeneous WDM EPONs Several dynamic bandwidth allocation algorithms have been introduced to schedule upstream wavelength channels in wavelength division multiplexing Ethernet passive optical networks (WDM EPONs), but mostly for homogenous WDM EPON networks with the same distance between each optical network unit (ONU) and the optical line terminal. For WDM EPON with heterogeneous round trip times (RTTs), we propose two algorithms for ONU scheduling, called nearest first and early allocation (EA); and a wavelength assignment algorithm, called best fit (BF). Both ONU scheduling algorithms take RTT dissimilarities into account, thus minimizing packet delay and packet drop ratio at ONUs. Additionally, EA can relive the common drawback of offline scheduling, i.e., channel idle time. On the other hand, the BF wavelength assignment is proposed that assigns the best wavelength to each ONU in order to improve network performances in terms of packet queuing delay and packet drop ratio at ONU sides.

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

dynamic bandwidth allocation
nearest first
early allocation
wavelength assignment


A layered framework to study collaboration as a form of knowledge sharing and diffusion Collaboration is presented as a form of knowledge sharing and hence of knowledge diffusion. A layered framework for collaboration studies is proposed. The notions of relative and absolute proper essential node (PEN) centrality are introduced as indicators of a node's importance for diffusion of knowledge through collaboration.

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

layered systems
networks
centrality indicators


Classes of tree languages determined by classes of monoids In this paper finite state recognizers are considered as unary tree recognizers with unary operational symbols. We introduce translation recognizers of a tree recognizer, which are finite state recognizers whose operations are the elementary translations of the underlying algebra of the considered tree recognizer. In terms of translation recognizers we give general conditions under which a class of recognizable tree languages with a given property can be determined by a class of monoids determining the class of string languages having the same property.

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


On a transfer theorem for the P not equal NP conjecture A model of computation is defined over the algebraic numbers and over number fields. This model is non-uniform, and the cost of operations depends on the height of the operands and on the degree of the extension of the rational defined by those operands. A transfer theorem for the P not equal NP Conjecture is proved, namely: P not equal NP in this model over the real algebraic numbers if and only if P not equal NP in the classical setting. (C) 2001 Academic Press.

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

np-completeness
computability over a ring


The design and implementation of a future Internet live TV system over 4G networks The emerging 4G (fourth generation) networks featuring wider coverage, higher transmission bandwidth and easier deployment have a desirable potential to serve ubiquitous and pervasive multimedia applications in creating new user-centric communication services. However, the practical implementation of 4G network to demonstrate such potential, especially for delivering real-time and high-quality video services, is scarce. This paper therefore provides the design and implementation of a future Internet live TV system over 4G networks to achieve cost-effectiveness, instead of using expensive satellite news gathering (SNG) vehicle and costly satellite transmissions in traditional TV stations. To effectively provide live TV services, we apply not only the hybrid duplex modes but also the port-based VLAN on the deployed networks for maximizing bandwidth, minimizing signal interference, and guaranteeing QoS of differentiated services. Performance metrics are applied to demonstrate that the proposed solution is cost-effective and is feasible for live TV services in future Internet.

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

future internet
4g networks
live tv system
vlan


Numerical study of a stochastic particle method for homogeneous gas-phase reactions In this paper, we study a stochastic particle system that describes homogeneous gasphase reactions of a number of chemical species. First, we introduce the system as a Markov jump process and discuss how relevant physical quantities are represented in terms of appropriate random variables. Then, we show how various deterministic equations, used in the literature, are derived from the stochastic system in the limit when the number of particles goes to infinity. Finally, we apply the corresponding stochastic algorithm to a toy problem, a simple formal reaction mechanism, and a real combustion problem. This problem is given by the isothermal combustion of a homogeneous mixture of heptane and air modelled by a detailed reaction mechanism with 107 chemical species and 808 reversible reactions. Heptane as described in this chemical mechanism serves as model-fuel for different types of internal combustion engines. In particular, we study the order of convergence with respect to the number of simulation particles, and illustrate the limitations of the method. (C) 2003 Elsevier Science Ltd. All rights reserved.

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

stochastic particle method
combustion
convergence


A Nitsche stabilized finite element method for frictional sliding on embedded interfaces. Part II: Intersecting interfaces Developed a weighted Nitsche stabilized method for embedded interfaces with junctions. Provided an explicit expression for the method parameter for lower order elements in the presence of junctions. Examples highlight the method capabilities in modeling grain-boundary sliding behavior.

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

frictional contact
grain-boundary sliding
polycrystalline
x-fem


A class of aggregation functions encompassing two-dimensional OWA operators In this paper we prove that, under suitable conditions, Atanassovs K? K ? operators, which act on intervals, provide the same numerical results as OWA operators of dimension two. On one hand, this allows us to recover OWA operators from K? K ? operators. On the other hand, by analyzing the properties of Atanassovs operators, we can generalize them. In this way, we introduce a class of aggregation functions the generalized Atanassov operators that, in particular, include two-dimensional OWA operators. We investigate under which conditions these generalized Atanassov operators satisfy some properties usually required for aggregation functions, such as bisymmetry, strictness, monotonicity, etc. We also show that if we apply these aggregation functions to interval-valued fuzzy sets, we obtain an ordered family of fuzzy sets.

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

generalized k? k ? operators k? k ? k? k ? k ?


Data Structures on Event Graphs We investigate the behavior of data structures when the input and operations are generated by an event graph. This model is inspired by Markov chains. We are given a fixed graph G, whose nodes are annotated with operations of the type insert, delete, and query. The algorithm responds to the requests as it encounters them during a (random or adversarial) walk in G. We study the limit behavior of such a walk and give an efficient algorithm for recognizing which structures can be generated. We also give a near-optimal algorithm for successor searching if the event graph is a cycle and the walk is adversarial. For a random walk, the algorithm becomes optimal.

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


Radar detection algorithm for GARCH clutter model We propose a GARCH model to represent the clutter in radar applications. We fit this model to real sea clutter data and we show that it represents adequately the statistics of the data. Then, we develop a detection test based on this model. Using synthetic and real radar data, we evaluate its performance and we show that the proposed detector offers higher probability of detection for a specified value of probability of false alarm than tests based on Gaussian and Weibull models, especially for low signal to clutter ratios.

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


Particle-based non-photorealistic volume visualization Non-photorealistic techniques are usually applied to produce stylistic renderings. In visualization, these techniques are often able to simplify data, producing clearer images than traditional visualization methods. We investigate the use of particle systems for visualizing volume datasets using non-photorealistic techniques. In our VolumeFlies framework, user-selectable rules affect particles to produce a variety of illustrative styles in a unified way. The techniques presented do not require the generation of explicit intermediary surfaces.

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

non-photorealistic rendering
volume rendering


A framework for sequential multiblock component methods Multiblock or multiset methods are starting to be used in chemistry and biology to study complex data sets. In chemometrics, sequential multiblock methods are popular; that is, methods that calculate one component at a time and use deflation for finding the next component. In this paper a framework is provided for sequential multiblock methods, including hierarchical PCA (HPCA; two versions), consensus PCA (CPCA; two versions) and generalized PCA (GPCA). Properties of the methods are derived and characteristics of the methods are discussed. All this is illustrated with a real five-block example from chromatography. The only methods with clear optimization criteria are GPCA and one version of CPCA. Of these, GPCA is shown to give inferior results compared with CPCA. Copyright (C) 2003 John Wiley Sons, Ltd.

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

multiblock methods
hierarchical pca
consensus pca
generalized pca

multiway methods
stationary phases
reversed phase liquid chromatography


Of the rich and the poor and other curious minds: on open access and "development" Purpose - The paper seeks to reconsider open access and its relation to issues of "development" by highlighting the ties the open access movement has with the hegemonic discourse of development and to question some of the assumptions about science and scientific communication upon which the open access debates are based. The paper also aims to bring out the conflict arising from the convergence of the hegemonic discourses of science and development with the contemporary discourse of openness. Design/methodology/approach - The paper takes the form of a critical reading of a range of published work on open access and the so-called "developing world" as well as of various open access declarations. The argument is supported by insights from post-development studies. Findings - Open access is presented as an issue of moral concern beyond the narrow scope of scholarly communication. Claims are made based on hegemonic discourses that are positioned as a priori and universal. The construction of open access as an issue of unquestionable moral necessity also impedes the problematisation of its own heritage. Originality/value - This paper is intended to open up the view for open access's less obvious alliances and conflicting discursive ties and thus to initiate a politisation, which is necessary in order to further the debate in a more fruitful way.

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

developing countries
sciences
communication technologies
journal publishers