Hidden semi-Markov model-based methodology for multi-sensor equipment health diagnosis and prognosis This paper presents an integrated platform for multi-sensor equipment diagnosis and prognosis. This integrated framework is based on hidden semi-Markov model (HSMM). Unlike a state in a standard hidden Markov model (HMM), a state in an HSMM generates a segment of observations, as opposed to a single observation in the HMM. Therefore, HSMM structure has a temporal component compared to HMM. In this framework, states of HSMMs are used to represent the health status of a component. The duration of a health state is modeled by an explicit Gaussian probability function. The model parameters (i.e., initial state distribution, state transition probability matrix, observation probability matrix, and health-state duration probability distribution) are estimated through a modified forwardbackward training algorithm. The re-estimation formulae for model parameters are derived. The trained HSMMs can be used to diagnose the health status of a component. Through parameter estimation of the health-state duration probability distribution and the proposed backward recursive equations, one can predict the useful remaining life of the component. To determine the value of each sensor information, discriminant function analysis is employed to adjust the weight or importance assigned to a sensor. Therefore, sensor fusion becomes possible in this HSMM based framework. The validation of the proposed framework and methodology are carried out in real world applications: monitoring hydraulic pumps from Caterpillar Inc. The results show that the increase of correct diagnostic rate is indeed very promising. Furthermore, the equipment prognosis can be implemented in the same integrated framework.

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

diagnosis
prognosis
equipment health
sensor fusion


GEOMETRIC STREAMING ALGORITHM WITH A SORTING PRIMITIVE We solve several fundamental geometric problems under a new streaming model recently proposed by Ruhl et al.(2,15) In this model, in one pass the input stream can be scanned to generate an output stream or be sorted based on a user-defined comparator; all intermediate streams must be of size O(n). We obtain the following geometric results for any fixed constant epsilon > 0: We can construct 2D convex hulls in O(1) passes with O(n(epsilon)) extra space. We can construct 3D convex hulls in O(1) expected number of passes with O(n(epsilon)) extra space. We can construct a triangulation of a simple polygon in O(1) expected number of passes with O(n(epsilon)) extra space, where n is the number of vertices on the polygon. We can report all k intersections of a set of 2D line segments in O(1) passes with O(n(epsilon)) extra space, if an intermediate stream of size O(n+k) is allowed. We also consider a weaker model, where we do not have the sorting primitive but are allowed to choose a scan direction for every scan pass. Here we can construct a 2D convex hull from an x-ordered point set in O(1) passes with O(n(epsilon)) extra space.

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


Statistical summability (C, 1) for sequences of fuzzy real numbers and a Tauberian theorem Statistical convergence for sequences of fuzzy real numbers has been studied by various authors. In this paper we study the concept of statistical summability (C, 1) for fuzzy real numbers which for real numbers was introduced by Moricz [18]. We also construct some interesting examples.

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

statistical convergence
tauberian theorem


Network monitoring for energy efficiency in large-scale networks: the case of the Spanish Academic Network The energy consumption due to information technologies is large and there are many ongoing efforts to cut it down. Previous studies have shown that there is a significant percentage of hosts which are left switched on in office buildings at night and weekend, whose energy consumption is significant. This motivates the development of techniques that can detect switched-on hosts in a simple and scalable way. This paper proposes detection techniques based on network traffic monitoring. The results show that such techniques can effectively detect switched-on hosts in small-medium campus networks and also in large country-wide networks that serve more than one million users. Interestingly, the proposed techniques can be implemented using the existing network monitoring infrastructure, specially for large networks, at a negligible additional investment.

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

energy saving
energy-aware networks
switched-on hosts
firewall supplantation
traffic measurement


Inclusion of signal analysis in a hybrid medical decision support system Objectives: Signal analysis has played an important role in cardiac diagnosis, both as a separate entity and in conjunction with clinical parameters. Hybrid systems are an effective method for developing higher-order decision models in which biomedical signal data can be incorporated. Methods: The hybrid system components include a knowledge-based system that utilizes approximate reasoning techniques, a neural network model based on a potential function approach the supervised learning that uses the general class of Cohen orthogonal functions as potential functions, and a signal analysis component that relies on continuous chaotic modeling to produce a degree of variability in the time series. The hybrid system is illustrated in an application for differentiation among different types of dementia. Results: Application of this method to cardiac diagnosis shows that chaotic parameters alone contribute significantly to correct classification while the addition of clinical parameters increases the sensitivity, specificity, and accuracy. Applications to electroencephalogram analysis indicate that the second-order difference plots display significant differences for the different types of EEG waves identifiable by frequency, both in shape and degree of dispersion. Hence,the identification of these waves, and the duration of their occurrence, may provide suitable variables for chaotic analysis. Conclusions: Results from studies in cardiology demonstrate that using chaotic measures for ECG analysis provide useful information for classification. Sensitivity, specificity, and accuracy are increased if these methods are combined with other clinical parameters in a hybrid system. This approach has been extended to new applications based on EEG analysis combined with other relevant information.

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


Null subspace-based damage detection of structures using vibration measurements A damage detection method of mechanical system based on subspace identification concepts and statistical process techniques is presented. The aim is to propose a method that is sensitive to small-sized structural damages and suitable for on-line monitoring. Measured time-responses of structures subjected to artificial or environmental vibrations are assembled to form the Hankel matrix, which is further factorised by performing singular-value decomposition to obtain characteristic subspaces. It may be demonstrated that the structural responses are mainly located in the active subspace defined by the first principal components, which is orthonormal to the null subspace defined by the remaining principal components. If no structural damage occurs, the orthonormality relation between the subspaces remains valid with small residues when consecutive data sets are compared, and these residues may be evaluated by the proposed damage indicators. The method is validated using an experimental mock-up of an airplane subjected to different levels of damages simulated. It is also applied in environmental vibration testing of a street lighting device to monitor structural fatigue evolution.

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

structural health monitoring
stochastic subspace identification
null subspace analysis
fatigue vibration testing


Feature extraction algorithm based on dual-scale decomposition and local binary descriptors for plant leaf recognition Plant leaf recognition is very important and necessary to agricultural information and ecological protection. Unfortunately, the robustness and discriminability of the existing methods are insufficient. This paper describes a novel plant leaf recognition method. In order to extract distinctive features from plant leaf images and reduce the probability of disruption by occlusion, clutter, or noise, a novel feature extraction algorithm based on dual-scale decomposition and local binary descriptors is proposed. The dual-scale decomposition consists of two phases. In the first phase, a plant leaf image is decomposed into several subbands with an adaptive lifting wavelet scheme. In the second phase, each subband is filtered using a group of variable-scale Gaussian filters. Local binary descriptors are extracted from the filtered subbands to capture both shape and texture characteristics, and then the histograms of the local binary descriptors at different scales and different subbands are determined and regarded as features. In order to improve the robustness and discriminability of plant leaf recognition further, a fuzzy k-nearest neighbors' classifier is introduced for matching. Experimental results show that the proposed approach yields a better performance in terms of the classification accuracies compared with the state of the art methods. It is also shown that this method is relatively robust to noise, occlusion and smoothing.

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

dual-scale decomposition
local binary pattern
fuzzy k-nearest neighbors' classifier
plant recognition


Ubiquitous device personalization and use: The next generation of IP multimedia communications Service usage in emerging ubiquitous environments includes seamless and personalized usage of public and private devices discovered in the vicinity of a user. In our work, we describe an architecture for device discovery, device configuration, and the transfer of active sessions between devices. The presented architecture uses the Session Initiation Protocol (SIP) as a standardized, widely used signaling protocol for IP-based multimedia services. Our solution includes support of simple existing devices, split of sessions between devices, user-control of location-based behavior, and handling of security and privacy concerns. We present the implementation and show the feasibility of our work with analytical evaluation and measurements.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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
standardization
measurement
location-based services
ubiquitous computing
internet multimedia
mobile communications


Designing argumentation for conceptual development If Virtual Learning Environments are to support real learning, they must promote effective teaching-learning processes and interactions. In this paper we describe a collaborative, computer-based framework for argumentation that supports the dialogue process in ways which stimulate belief revision leading to conceptual change and development in science. This pedagogy is specified as a prescriptive 'dialogue game', which models features of the tutorial process. Within this scheme, the learner adopts the role of an 'explainer' whilst the system plays a facilitating role, and these participants collaborate to develop a shared explanatory model of a qualitative, causal domain. The design framework includes an abstract world model of a qualitative causal system, some 'commonsense' reasoning rules, an interaction language and dialogue strategies and tactics, that are co-ordinated within a facilitating dialogue game. A prototype CoLLeGE (Computer based Lab for Language Games in Education) system implements the framework and operates as a dialogue modelling work-bench for demonstrating, investigating and developing the approach. An empirical study showed that students revised their beliefs and improved their explanatory models, and held to their revised and improved conceptions in a delayed post-test. In using CoLLeGE to simulate these dialogues, we found that the tutor's low-level tactical pedagogies emerged and developed reactively during the dialogues, in response to conceptual difficulties experienced by the students. (C) 2000 Elsevier Science Ltd. All rights reserved.

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

learning in virtual environments
teaching in virtual environments
theories of learning and virtuality
the changing role of the learner


Verification of Linear Duration Properties over Continuous-Time Markov Chains Stochastic modelling and algorithmic verification techniques have been proved useful in analysing and detecting unusual trends in performance and energy usage of systems such as power management controllers and wireless sensor devices. Many important properties are dependent on the cumulated time that the device spends in certain states, possibly intermittently. We study the problem of verifying continuous-time Markov Chains (CTMCs) against Linear Duration Properties (LDP), that is, properties stated as conjunctions of linear constraints over the total duration of time spent in states that satisfy a given property. We identify two classes of LDP properties, Eventuality Duration Properties (EDP) and Invariance Duration Properties (IDP), respectively referring to the reachability of a set of goal states, within a time bound; and the continuous satisfaction of a duration property over an execution path. The central question that we address is how to compute the probability of the set of infinite timed paths of the CTMC that satisfy a given LDP. We present algorithms to approximate these probabilities up to a given precision, stating their complexity and error bounds. The algorithms mainly employ an adaptation of uniformisation and the computation of volumes of multidimensional integrals under systems of linear constraints, together with different mechanisms to bound the errors.

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

model checking
continuous-time markov chains
markovian reward models


DECISION TREE WITH BETTER CLASS PROBABILITY ESTIMATION Traditionally, the performance of a classifier is measured by its classification accuracy or error rate. In fact, probability-based classifiers also produce the class probability estimation (the probability that a test instance belongs to the predicted class). This information is often ignored in classification, as long as the class with the highest class probability estimation is identical to the actual class. In many data mining applications, however, classification accuracy and error rate are not enough. For example, in direct marketing, we often need to deploy different promotion strategies to customers with different likelihood (class probability) of buying some products. Thus, accurate class probability estimations are often required to make optimal decisions. In this paper, we firstly review some state-of-the-art probability-based classifiers and empirically investigate their class probability estimation performance. From our experimental results, we can draw a conclusion: C4.4 is an attractive algorithm for class probability estimation. Then, we present a locally weighted version of C4.4 to scale up its class probability estimation performance by combining locally weighted learning with C4.4. We call our improved algorithm locally weighted C4.4, simply LWC4.4. We experimentally test LWC4.4 using the whole 36 UCI data sets selected by Weka. The experimental results show that LWC4.4 significantly outperforms C4.4 in terms of class probability estimation.

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

class probability estimation
locally weighted learning
classification

c4.4
locally weighted c4.4
conditional log likelihood
auc


A non-singular fundamental solution for boundary element analysis of thick plates on Winkler foundation under generalized loading This paper introduces a new generalized non-singular fundamental solution for boundary element analysis of thick plates on a Winkler elastic foundation for different cases of characteristic equation roots including the case with equal roots, where the corresponding kernel functions have been derived using a practical approach. The terms of kernel functions in domain loading integrals have been reduced to boundary integrals for cases with uniformly and linearly distributed loading. Boundary integral expressions have also been derived for generalized loading cases with line shear forces and bending moments acting on arbitrary curves defined on the plate midplane. Different case studies, with known analytical solutions, were analysed using the developed theory, and it has been shown that the given formulations provide a very accurate solution for different types of loading.

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

reissner plates
soil
boundary integral equation


A robust approach to empirical PDF estimate This paper presents a robust approach to estimate the probability density function (PDF) from a sample data set. The approach is induced from entropy maximization using Renyi's quadratic entropy, and turns out to be equivalent to the support vector machines (SVM). Therefore, the approach has good properties of the support vector machines as a statistical function estimation method.

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

support vector machines
probability density function


Novel Pipelined Architecture for Efficient Evaluation of the Square Root Using a Modified Non-Restoring Algorithm The square root is a basic arithmetic operation in image and signal processing. We present a novel pipelined architecture to implement N-bit fixed-point square root operation on an FPGA using a non-restoring pipelined algorithm that does not require floating-point hardware. Pipelining hazards in its hardware realization are avoided by modifying the classic non-restoring algorithm, thus resulting in a 13% improved latency. Furthermore, the proposed architecture is flexible allowing modification as per individual application needs. It is demonstrated that the proposed architecture is approximately four times faster than its popular counterparts and at the same time it consumes 50% less energy for envelope detection at 268MHz sampling rate.

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

fixed-point arithmetic
non-restoring algorithm
field-programmable gate array (fpga)


Scattering and multi-scattering in trees and meshes, with local routing and without buffering In interconnection networks, messages must go through a sequence of intermediate nodes before reaching their final destinations. In general, these intermediate nodes have the possibility to store a message during several rounds. This allows the node to wait for a link that gets the message closer to its destination to be free. This is the store-and-forward model. However, intermediate storage is often difficult to realize. In this paper, we consider a communication model in which intermediate nodes do not need store the in-transit messages. The messages must leave the router immediately. Under this model, we study communication operations that involve many messages, such as scattering and multi-scattering. This allows us to give optimal or near-optimal scattering and algorithms. In addition, we use shortest-paths local routing functions in the networks under consideration. This is a realistic hypothesis when dealing with parallel systems. These features are significant of what we do: provide general powerful and efficient algorithms that can be adapted in real machines.

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


TACO: a toolkit for AMPL control optimization We describe a set of extensions to the AMPL modeling language to conveniently model mixed-integer optimal control problems for ODE or DAE dynamic processes. These extensions are realized as AMPL user functions and suffixes and do not require intrusive changes to the AMPL language standard or implementation itself. We describe and provide TACO, a Toolkit for AMPL Control Optimization that reads AMPL stub.nl files and detects the structure of the optimal control problem. This toolkit is designed to facilitate the coupling of existing optimal control software packages to AMPL. We discuss requirements, capabilities, and the current implementation. Using the example of the multiple shooting code for optimal control MUSCOD-II, a direct and simultaneous method for DAE-constrained optimal control, we demonstrate how the problem information provided by the TACO toolkit is interfaced to the solver. In addition, we show how the MS-MINTOC algorithm for mixed-integer optimal control can be used to efficiently solve mixed-integer optimal control problems modeled in AMPL. We use the AMPL extensions to model three control problem examples and we discuss how those extensions affect the representation of optimal control problems. Solutions to these problems are obtained by using MUSCOD-II and MS-MINTOC inside the AMPL environment. A collection of further AMPL control models is provided on the web site http://?mintoc.?de. MUSCOD-II and MS-MINTOC have been made available on the NEOS Server for Optimization, using the TACO toolkit to enable input of AMPL models.

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


Hardware Emulation of Wideband Correlated Multiple-Input Multiple-Output Fading Channels A low-complexity hardware emulator is proposed for wideband, correlated, multiple-input multiple-output (MIMO) fading channels. The proposed emulator generates multiple discrete-time channel impulse responses (CIR) at the symbol rate and incorporates three types of correlation functions of the subchannels via Kronecker product: the spatial correlation between transmit or receive elements, temporal correlation due to Doppler shifts, and inter-tap correlation due to multipaths. The Kronecker product is implemented by a novel mixed parallel-serial (mixed P-S) matrix multiplication method to reduce memory storage and to meet the real-time requirement in high data-rate, large MIMO size, or long CIR systems. We present two practical MIMO channel examples implemented on an Altera Stratix III EP3SL150F FPGA DSP development kit: a 2-by-2 MIMO WiMAX channel with a symbol rate of 1.25 million symbols/second and a 2-by-6 MIMO underwater acoustic channel with 100-tap CIR. Both examples meet real-time requirement using only 1214% of hardware resources of the FPGA.

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

wimax channel
underwater acoustic channel

correlated mimo fading channel
channel emulator
fpga implementation


ABOUT SOME UNUSUAL MENTAL STATES Introduced by John H. Clark, the Map of Mental States is a geometrical model of a human mental life. In spite of its simplicity, it takes into account the most essential variables characterizing the mind. Deals with three important types of mental life which can be represented on the Map: mystical states, mental illnesses and drug states. The exact numerical positions of the states have been established on the Map, for the most known mystical path, for some mental illnesses and for two typical drugs. Rectilinear and curvilinear distances between corresponding states have been calculated and perspectives of such a study have been shown.

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


Representation and reasoning of context-dependant knowledge in distributed fuzzy ontologies Most of current knowledge based systems manage impressive amounts of information (especially distributed fuzzy information). In addition to widely pointed-out integration and maintenance difficulties, other common problem is overwhelming of users with much more information than the strictly necessary for fulfilling a task. This issue has been pointed out with the name of information overload. Use of context knowledge has been envisioned as an appropriate solution to deal with this information overload matter. In this paper, we present a distributed fuzzy context-domain relevance (DFCDR) model for representation in fuzzy ontologies relevance relations between fuzzy context ontology and distributed fuzzy domain ontologies. In fact, the DFCDR model is a distributed fuzzy extension of the context-domain relevance (CDR) model.

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

knowledge representation and reasoning
context-aware systems
distributed ontologies
description logics


Absorbing boundary conditions and optimized Schwarz waveform relaxation We show here how the formalism, introduced by B. Engquist and A. Majda for absorbing boundary conditions, is a powerful tool to produce absorbing boundary layers and Schwarz waveform relaxation algorithms, when coupled with best approximation. The demonstration is given on the advection diffusion equation, but the ideas apply also to hyperbolic problems.

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


A Real-time Interface Simulator for Operator Training: A Proposed Architecture Operator training systems are essential tools for industrial systems, particularly for those where human error has an impact on the safety of materials and personnel and/or may cause significant financial losses. The work presented here is part of a major research project concerned with the study of operator behavior when facing safety-critical situations. The application concerns the supervisory control of an electricity distribution substation. This paper focuses on the first phase of the project; the development of a real-time operator training system that simulates the supervisory control system. The simulator promotes the operator's immersion into a virtual replica of the real working environment. The simulator's architecture, based upon a set of formal models interconnected to form the simulation engine, is presented. The models were constructed using the colored Petri nets formalism. The modular architecture allows for remote interaction via the web and offers two interfaces with the plant control system: a virtual reality representation of the human-machine interface and a supervisory system representation. This paper presents and discusses the architecture of the Operator Training Simulator.

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

operator training simulator
virtual reality
petri nets

simulation engine architecture
human interfaces
industrial automation


New Binomial Bent Functions Over the Finite Fields of Odd Characteristic The p-ary function F(x) mapping GF(p(4k)) to GF(p) and given by f(x) = Tr(4k) (x(p3k+p2k-pk+1) + x(2)) is proven to be a weakly regular bent function and the exact value of its Walsh transform coefficients is found. This is the first proven infinite class of nonquadratic generalized bent functions over the fields of an arbitrary odd characteristic. The proof is based on a few new results in the area of exponential sums and polynomials over finite fields that may also be interesting as independent problems.

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

walsh transform
weakly regular bent function

p-ary bent function
polynomial over finite field
root


Using convex nonlinear relaxations in the global optimization of nonconvex generalized disjunctive programs In this paper we present a framework to generate tight convex relaxations for nonconvex generalized disjunctive programs. The proposed methodology builds on our recent work on bilinear and concave generalized disjunctive programs for which tight linear relaxations can be generated, and extends its application to nonlinear relaxations. This is particularly important for those cases in which the convex envelopes of the nonconvex functions arising in the formulations are nonlinear (e. g. linear fractional terms). This extension is now possible by using the latest developments in disjunctive convex programming. We test the performance of the method in three typical process systems engineering problems, namely, the optimization of process networks, reactor networks and heat exchanger networks. (C) 2012 Elsevier Ltd. All rights reserved.

O O 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 B I I O O O O O O O O O O O O B I I O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 disjunctive programs
nonlinear relaxations


'Adaptive link adjustment' applied to the fixed charge transportation problem The fixed charge transportation problem (FCTP) is a classic challenge for combinatorial optimization; it is based on the well-known transportation problem (TP), and is one of the prime examples of an NP-complete variant of the TP, of general importance in a wide range of transportation network design problems. Many techniques have been applied to this problem, and the most effective so far (in terms of near-optimal results in reasonable time on large instances) are evolutionary algorithm based approaches. In particular, an EA proposed by Eckert and Gottlieb has produced the best performance so far on a set of specific benchmark instances. We introduce a new scheme, which has more general applicability, but which we test here on the FCTP. The proposed scheme applies an adaptive mutation process immediately following the evaluation of a phenotype. It thereby adapts automatically to learned information encoded in the chromosome. The underlying encoding approach is to encode an ordering of elements for interpretation by a constructive algorithm (such as with the Link and Node Biased encoding for spanning trees, and the Random Keys encoding which has been applied to both scheduling and graph problems), however the main adaptive process rewards links in such a way that genes effectively encode a measure of the number of times their associated link has appeared in selected solutions. Tests are done which compare our approach with Eckert and Gottlieb's results on benchmark FCTP instances, and other approaches.

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

fixed charge transportation problem
evolutionary algorithm


The detection of impedance cardiogram characteristic points using wavelet transform A novel impedance cardiograph event detection method using wavelet transform is proposed. When compared to the C and E points in the pressurevolume loop, the wavelet method performs significantly better than the traditional method (P<0.05) in the B and X points detection even after the addition of 20% artificial noise into the test signal. Nevertheless, the SVs estimated by ICG are poorly correlated with values measured by the conductance catheter.

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

wavelet transform
event detection
conductance catheter


Boosted multi-class semi-supervised learning for human action recognition Human action recognition is a challenging task due to significant intra-class variations, occlusion, and background clutter. Most of the existing work use the action models based on statistic learning algorithms for classification. To achieve good performance on recognition, a large amount of the labeled samples are therefore required to train the sophisticated action models. However, collecting labeled samples is labor-intensive. To tackle this problem, we propose a boosted multi-class semi-supervised learning algorithm in which the co-EM algorithm is adopted to leverage the information from unlabeled data. Three key issues are addressed in this paper. Firstly, we formulate the action recognition in a multi-class semi-supervised learning problem to deal with the insufficient labeled data and high computational expense. Secondly, boosted co-EM is employed for the semi-supervised model construction. To overcome the high dimensional feature space, weighted multiple discriminant analysis (WMDA) is used to project the features into low dimensional subspaces in which the Gaussian mixture models (GMM) are trained and boosting scheme is used to integrate the subspace models. Thirdly, we present the upper bound of the training error in multi-class framework, which is able to guide the novel classifier construction. In theory, the proposed solution is proved to minimize this upper error bound. Experimental results have shown good performance on public datasets.

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

semi-supervised learning
adaboost.mh
co-em


Information extraction from Web pages using presentation regularities and domain knowledge World Wide Web is transforming itself into the largest information resource making the process of information extraction (IE) from Web an important and challenging problem. In this paper, we present an automated IE system that is domain independent and that can automatically transform a given Web page into a semi-structured hierarchical document using presentation regularities. The resulting documents are weakly annotated in the sense that they might contain many incorrect annotations and missing labels. We also describe how to improve the quality of weakly annotated data by using domain knowledge in terms of a statistical domain model. We demonstrate that such system can recover from ambiguities in the presentation and boost the overall accuracy of a base information extractor by up to 20%. Our experimental evaluations with TAP data, computer science department Web sites, and RoadRunner document sets indicate that our algorithms can scale up to very large data sets.

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

information extraction
web
domain knowledge
statistical domain model

page segmentation
grammar induction
pattern mining
semantic partitioner
metadata


Tensor correlation filter based class-dependence feature analysis for face recognition Recently, class-dependence feature analysis (CFA), which is based on the design of correlation filters in the frequency domain, has been developed for robust face recognition. Traditional CFA designs correlation filters by using two-dimensional (2D) Fourier transforms of the images. In this paper, we propose a tensor correlation filter based CFA (TCF-CFA) method to generalize traditional CFA by encoding the image data as tensors. Experimental results on four benchmark face databases show the effectiveness and robustness of TCF-CFA for face recognition.

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

tensor correlation filter
face recognition


Tautomerism in chemical information management systems Tautomerism has an impact on many of the processes in chemical information management systems including novelty checking during registration into chemical structure databases; storage of structures; exact and substructure searching in chemical structure databases; and depiction of structures retrieved by a search. The approaches taken by 27 different software vendors and database producers are compared. It is hoped that this comparison will act as a discussion document that could ultimately improve databases and software for researchers in the future.

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

tautomerism
chemical information management
registration
software vendors
database producers

tautomer
chemical structure representation
substructure search


Optimal spatial filtering for brain oscillatory activity using the Relevance Vector Machine Over the past decade, various techniques have been proposed for localization of cerebral sources of oscillatory activity on the basis of magnetoencephalography (MEG) or electroencephalography recordings. Beamformers in the frequency domain, in particular, have proved useful in this endeavor. However, the localization accuracy and efficacy of such spatial filters can be markedly limited by bias from correlation between cerebral sources and short duration of source activity, both essential issues in the localization of brain data. Here, we evaluate a method for frequency-domain localization of oscillatory neural activity based on the relevance vector machine (RVM). RVM is a Bayesian algorithm for learning sparse models from possibly overcomplete data sets. The performance of our frequency-domain RVM method (fdRVM) was compared with that of dynamic imaging of coherent sources (DICS), a frequency-domain spatial filter that employs a minimum variance adaptive beamformer (MVAB) approach. The methods were tested both on simulated and real data. Two types of simulated MEG data sets were generated, one with continuous source activity and the other with transiently active sources. The real data sets were from slow finger movements and resting state. Results from simulations show comparable performance for DICS and fdRVM at high signal-to-noise ratios and low correlation. At low SNR or in conditions of high correlation between sources, fdRVM performs markedly better. fdRVM was successful on real data as well, indicating salient focal activations in the sensorimotor area. The resulting high spatial resolution of fdRVM and its sensitivity to low-SNR transient signals could be particularly beneficial when mapping event-related changes of oscillatory activity.

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

meg inverse problem
cortical rhythms
source localization
bayesian approaches


Population Adaptation for Genetic Algorithm-based Cognitive Radios Genetic algorithms are best suited for optimization problems involving large search spaces. The problem space encountered when optimizing the transmission parameters of an agile or cognitive radio for a given wireless environment and set of performance objectives can become prohibitively large due to the high number of parameters and their many possible values. Recent research has demonstrated that genetic algorithms are a viable implementation technique for cognitive radio engines. However, the time required for the genetic algorithms to come to a solution substantially increases as the system complexity grows. In this paper, we present a population adaptation technique for genetic algorithms that takes advantage of the information from previous cognition cycles in order to reduce the time required to reach an optimal decision. Our simulation results demonstrate that the amount of information from the previous cognition cycle can be determined from the environmental variation factor, which represents the amount of change in the environment parameters since the previous cognition cycle.

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


An approach to biological computation: Unicellular core-memory creatures evolved using genetic algorithms A novel machine language genetic programming system that uses one-dimensional core memories is proposed and simulated. The core is compared to a biochemical reaction space, and in imitation of biological molecules, four types of data words (Membrane, Pure data, Operator, and Instruction) are prepared in the core. A program is represented by a sequence of Instructions. During execution of the sore, Instructions are transcribed into corresponding Operators, and Operators modify, create, or transfer Pure data. The core is hierarchically partitioned into sections by the Membrane data, and the data transfer between sections by special channel Operators constitutes a tree data-flow structure among sections in the core. In the experiment, genetic algorithms are used to modify program information. A simple machine learning problem is prepared for the environment data set of the creatures (programs), and the fitness value of a creature is calculated from the Pure data excreted by the creature, Breeding of programs that can output the predefined answer is successfully carried out. Several future plans to extend this system are also discussed.

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

membrane
biological computation
machine language genetic programming
genetic algorithms

core memory
unicellular creature
algorithmic complexity


Power spectral analysis of EEG in a multiple-bedroom, multiple-polygraph sleep laboratory Objectives: We describe the methods for power spectral analysis (PSA) of sleep electroencephalogram (EEG) data at a large clinical and research sleep laboratory. The multiple-bedroom, multiple-polygraph design of the sleep laboratory poses unique challenges for the quantitative analysis of the data. This paper focuses on the steps taken to ensure that our PSA results are not biased by the particular bedroom or polygraph from which the data were acquired. Methods: After describing the data acquisition system hardware, we present our signal amplitude calibration procedure and our methods for performing PSA. We validate the amplitude calibration procedure in several experiments using PSA to establish tolerances for data acquisition from multiple bedrooms and polygraphs. Results: Since it is not possible to acquire identical digitized versions of an EEG signal using different sets of equipment, the best that can be achieved is data acquisition that is polygraph-independent within a known tolerance. We are able to demonstrate a tolerance in signal amplitude of 0.25% when digitizing data from different bedrooms. When different data acquisition hardware is used, the power tolerance is approximately 3% for frequencies from 1 to 35 Hz. The power tolerance is between 3 and 7% for frequencies below 1 Hz and frequencies between 35 and 50 Hz. Additional data demonstrate that variability due to the hardware system is small relative to the inherent variability of the sleep EEG. Conclusion: The PSA results obtained in one location can be replicated elsewhere (subject to known tolerances) only if the data acquisition system and PSA method are adequately specified.

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

sleep eeg
power spectral analysis
quantitative analysis


De-motivators for software process improvement: an analysis of practitioners' views We present a study of software practitioners' de-motivators for software process improvement (SPI). The aim of this study is to understand the nature of the issues that de-motivate software practitioners for SPI, so that SPI managers can better manage these de-motivators. This study compares what the SPI literature reports as the factors that hinder SPI success with software practitioners' perception of the factors that de-motivate them. Focus groups are used to elicit the perceptions of over 200 software practitioners. Our findings show that software practitioners confirm what the literature reports as the major issues that de-motivate them for SPI. These issues are related to resistance to change, lack of evidence, imposed SPI initiatives, resource constraints and commercial pressures. Our findings also show that there are differences in de-motivators for SPI across staff groups and that these differences are related to the role that software practitioners have in software development generally. We offer these findings as insight to aid SPI managers to design more targeted SPI strategies. (C) 2002 Elsevier Science Inc. All rights reserved.

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

software process improvement
practitioners


Modeling and simulations of drop pinch-off from liquid crystal filaments and the leaky liquid crystal faucet immersed in viscous fluids An energy-based, phase field model is developed for the coupling of two incompressible, immiscible complex fluid phases, in particular a nematic liquid crystal phase in a viscous fluid phase. The model consists of a system of coupled nonlinear partial differential equations for conservation of mass and momentum, phase transport, and interfacial boundary conditions. An efficient and easy-to-implement numerical scheme is developed and implemented to extend two benchmark fluid mechanical problems to incorporate a liquid crystal phase: filament breakup under the influence of capillary force and the gravity-driven, dripping faucet. We explore how the distortional elasticity and nematic anchoring at the liquid crystal-air interface modify the capillary instability in both problems. For sufficiently weak distortional elasticity, the effects are perturbative of viscous fluid experiments and simulations. However, above a Frank elasticity threshold, the model predicts a transition to the beads-on-a-string phenomenon associated with polymeric fluid filaments.

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


research on vrp using advanced probability learning based evolutionary algorithm Vehicle routing optimization problem with time constraint is researched in this paper and a hybrid optimization algorithm-PBIL combined with ant algorithm is proposed and applied to VRP. The objective function is to minimize the cost and reduce the loss caused by customers' time restriction. The probability matrix of PBIL algorithm is modified with the positive feedback and information disappearing mechanisms of ant algorithm. Also, the probability statistics for the road traffic status distributed is considered in decision-making for the vehicles' routing. The hybrid intelligent evolutionary algorithm is tested on Jingyuanda Logistics Company and the good validity, accuracy, and stability performance are fully proved.

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


BPELDebugger: An effective BPEL-specific fault localization framework Context: Business Process Execution Language (BPEL) is a widely recognized executable service composition language, which is significantly different from typical programming languages in both syntax and semantics, and especially shorter in program scale. How to effectively locate faults in BPEL programs is an open and challenging problem. Objective: In this paper, we propose a fault localization framework for BPEL programs. Method: Based on BPEL program characteristics, we propose two fault localization guidelines to locate the integration and interaction faults in BPEL programs. Our framework formulates the BPEL fault localization problem using the popular fault localization problem settings, and synthesizes BPEL-specific fault localization techniques by reuse of existing fault localization formulas. We use two realistic BPEL programs and three existing fault localization formulas to evaluate the feasibility and effectiveness of the proposed fault localization framework and guidelines. Result: Experiment results show that faults can be located with the fewest code examining efforts. That is, the fault-relevant basic block is assigned the highest suspiciousness score by our fault localization method. The experiment results also show that with the use of the proposed fault localization guidelines, the code examining efforts to locate faults are extraordinarily reduced. Conclusion: We conclude that the proposed framework is feasible in synthesizing effective fault localization techniques, and our fault localization guidelines are very effective to enhance existing fault localization techniques in locating faults in BPEL programs. (C) 2013 Elsevier B.V. All rights reserved.

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

bpel
fault localization
integration and interaction faults

service compositions
fault localization guidelines


Safe recursion revisited I: Categorical semantics for lower complexity ? The objective of this paper is to prove that the initial Pola setting, with both inductive and coinductive data, is sound for polynomial size (PSIZE). Explicitly this means all programs written in Pola have their output size bounded by a polynomial in their input size. The paper describes the polarized categorical semantics for Pola and establishes the result by providing categorical models for various fragments of Pola which have explicit size bound information built into the maps. To obtain PSIZE soundness for Pola with just inductive data, the semantics in sized sets suffices. Sized sets are sets equipped with a size map which associates to each element a size. Size is usually just a natural number but, more generally, the size could be an element of a size rig. A polarized category consists of an opponent and a player category joined by a module. Sized sets can be used to create a polarized category by letting the opponent and module maps be bounded by polynomials while the player category consists of maps bounded by a constant. This gives a Pola setting with inductive data and immediately establishes the PSIZE soundness of the initial Pola setting. The main technical difficulty of the paper is to provide a semantics which correctly models coinductive data as well. For this amortized sets are introduced: these are set in which a higher-order size function is associated to each element, which given a size returns a size. This is amortized as one is concerned with the asymptotic behavior of these functions. While amortized sets have coinductive data they are not affine closed: a final step, using equivalence relations, is required to obtain a model which includes this aspect of Pola structure. While PSIZE by itself is a very weak bound it is a crucial step in establishing polynomial space (PSPACE) and polynomial time (PTIME) bounds for these settings.

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


Iterative water-filling for Gaussian vector multiple-access channels This correspondence proposes an efficient numerical algorithm to compute the optimal input distribution that maximizes the sum capacity of a Gaussian multiple-access channel with vector inputs and a vector output. The numerical algorithm has an iterative water-filling interpretation. The algorithm converges from any starting point, and it reaches within 1/2 nats per user per output dimension from the sum capacity after just one iteration. The characterization of sum capacity also allows an upper bound and a lower bound for the entire capacity region to be derived.

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

channel capacity
convex optimization
gaussian channels
multiuser channels
multiple-access channels
multiple-access communications
multiple-antenna systems
optimization methods
power control
water-filling


On a lightwave network topology using Kautz digraphs In this paper, the properties of Kautz digraphs are studied to evaluate their suitability as topology for optical networks. The properties are compared to those of other topologies proposed in the literature and it has been shown these topologies have better performance in terms of queuing delay in a multihop network. For a given degree of each node and a given diameter of the network, a Kautz digraph supports more nodes than other topologies, like shufflenet or that of using a de Bruijn digraph, and seems to be an attractive design for the physical topology as well.

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

wdm network
routing algorithm
blocking probability
logical topology


Active thrust on retaining walls of narrow backfill width When the backfill behind a retaining wall is narrow, the analytical methods commonly used for evaluating active thrust, such as the method of Coulomb or that of Rankine, are inappropriate. This is because the thrust wedge cannot develop in the shape and size predicted by these methods. To address, this paper presents an analytical method to obtain a solution for the active thrust exerted by backfill of narrow width on gravity retaining walls, using the limit equilibrium method with planar slip surfaces. Three different failure mechanisms of the thrust wedge are examined, called, respectively, Mechanism 1 (with the thrust wedge formed by a single block), Mechanism 2 (where the thrust wedge is composed of two rigid blocks, one slipping with respect to the other) and Mechanism 3 (which considers three blocks). The paper discusses when the problem has an analytical solution in terms of roots, showing that Mechanism 2 is governed by a cubic equation and Mechanism 3 by a system of a cubic and a quartic equation. More complex mechanisms with four or more blocks are described by systems with equations of higher degrees which do not have an analytical solution in the form of roots. A semi-analytical solution is also given for locating the point of application of the active thrust.

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

active earth force
cantilever walls
lateral pressure
active condition


Design of a low power consumption pulse-shaping 1 : 4 interpolation FIR filter for W-CDMA applications This paper presents the design and simulation of a power efficient 1:4 interpolation FIR filter with partitioned look Up Table (LUT) structure. Using the symmetry of the filter coefficients and the contents of the LUT the area of the proposed filter is minimized. The two filters share the partitioned LUT and activate the LUT selectively to realize the low power operation. Experimental results suggest that the proposed filter reduces the power consumption by 25% and simultaneously reduces the gate area by 7% compared to the previously proposed single-architecture dual-channel filter.

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


Integrated cognitive architectures: a survey This article aims to present an account of the state of the art research in the field of integrated cognitive architectures by providing a review of six cognitive architectures, namely Soar, ACT-R, ICARUS, BDI, the subsumption architecture and CLARION. We conduct a detailed functional comparison by looking at a wide range of cognitive components, including perception, memory, goal representation, planning, problem solving, reasoning, learning, and relevance to neurobiology. In addition, we study the range of benchmarks and applications that these architectures have been applied to. Although no single cognitive architecture has provided a full solution with the level of human intelligence, important design principles have emerged, pointing to promising directions towards generic and scalable architectures with close analogy to human brains.

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

integrated cognitive architectures
soar
icarus
bdi
subsumption architecture
clarion


MOSFET threshold voltage: Definition, extraction, and some applications This paper exploits a universal current-based definition of the threshold voltage (VT) and discusses some direct methods to measure it. The consistency, accuracy, and sensitivity of the extraction procedures to second-order effects are examined through numerical simulations and experimental measurements. In addition to three procedures based on dc current measurements we propose an automatic VT-extractor circuit which allows the direct determination of the threshold voltage with minimum influence of second-order effects.

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

mosfet characterization
parameter extraction
threshold voltage extractor circuit


behavioral characterization of multiprocessor memory systems: a case study The speed and efficiency of the memory system is a key limiting factor in the performance of supercomputers. Consequently, one of the major concerns when developing a high-performance code, either manually or automatically, is determining and characterizing the influence of the memory system on performance in terms of algorithmic parameters. Unfortunately, the performance data available to an algorithm designer such as various benchmarks and, occasionally, manufacturer-supplied information, e.g. instruction timings and architecture component characteristics, are rarely sufficient for this task. In this paper, we discuss a systematic methodology for probing the performance characteristics of a memory system via a hierarchy of data-movement kernels. We present and analyze the results obtained by such a methodology on a cache-based multi-vector processor (Alliant FX/8). Finally, we indicate how these experimental results can be used for predicting the performance of simple Fortran codes by a combination of empirical observations, architectural models and analytical techniques.

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

task
efficiency
characterization
memory system
performance
paper
component
processor
influence
methodology
factor
code
architecture
instruction
data
algorithm
multiprocessor

probe
movement
benchmark
high-performance
design
hierarchies
timing
model
informal
combinational
predict
observability
cache
vectorization
experimentation
case studies
behavior
supercomputer
kernel


Completeness results for omega-regular algebras We present algebras that axiomatise the equational theories of two variants of omega-regular expressions. The first algebra simplifies a two-sorted infinitary axiomatisation by Wagner. Its completeness is established relatively to Wagner's completeness result. The second one is based on one-sorted algebras proposed by Park and Cohen. Its completeness is derived from our first result.

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

regular algebra
regular languages
omega-regular algebra
omega-regular languages


exploring the design space for a shared-cache multiprocessor In the near future, semiconductor technology will allow the integration of multiple processors on a chip or multichip-module (MCM). In this paper we investigate the architecture and partitioning of resources between processors and cache memory for single chip and MCM-based multiprocessors. We study the performance of a cluster-based multiprocessor architecture in which processors within a cluster are tightly coupled via a shared cluster cache for various processor-cache configurations. Our results show that for parallel applications, clustering via shared caches provides an effective mechanism for increasing the total number of processors in a system, without increasing the number of invalidations. Combining these results with cost estimates for shared cluster cache implementations leads to two conclusions: 1) For a four cluster multiprocessor with single chip clusters, two processors per cluster with a smaller cache provides higher performance and better cost/performance than a single processor with a larger cache and 2) this four cluster configuration can be scaled linearly in performance by adding processors to each cluster using MCM packaging techniques.

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

applications
cache memory
design space
performance
paper
processor
cache
cost estimates
parallel
packaging
architecture
future
multiprocessor
cluster

combinational
exploration
sharing
partition
shared cache
technologies
systems
implementation
module
configurability
effect
cost
resource
integrability


code compression as a variable in hardware/software co-design We present a new way to practice and view handware/software co-design: rather than raising the level of abstraction in order to exploit the highest possible degree of optimization, we use code compression i.e. we practice co-design at the bit-level. Through our novel architecture combined with our compression methodology this results in optimization of all major design goals/constraints. In particular, we present a compression methodology that deploys what we call a post-cache architecture (i.e. the detached decompression unit is located between the CPU and the instruction cache). We present a design methodology that allows the designer to control parameters like speed, power, and area through the choice of compression parameters. In addition we show that our compression methodology (using a Markov Model) is more efficient than the widely used Huffman compression scheme.

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

cache
order
use
methodology
abstraction
exploit
architecture
design
power
code compression
model
control
compression
scheme

variability
software
efficiency
locatability
optimality
goals
design methodologies
hardware
constraint
practical
instruction caches


privacy-aware regression modeling of participatory sensing data Many participatory sensing applications use data collected by participants to construct a public model of a system or phenomenon. For example, a health application might compute a model relating exercise and diet to amount of weight loss. While the ultimately computed model could be public, the individual input and output data traces used to construct it may be private data of participants (e.g., their individual food intake, lifestyle choices, and resulting weight). This paper proposes and experimentally studies a technique that attempts to keep such input and output data traces private, while allowing accurate model construction. This is significantly different from perturbation-based techniques in that no noise is added. The main contribution of the paper is to show a certain data transformation at the client side that helps keeping the client data private while not introducing any additional error to model construction. We particularly focus on linear regression models which are widely used in participatory sensing applications. We use the data set from a map-based participatory sensing service to evaluate our scheme. The service in question is a green navigation service that constructs regression models from participant data to predict the fuel consumption of vehicles on road segments. We evaluate our proposed mechanism by providing empirical evidence that: i) an individual data trace is generally hard to reconstruct with any reasonable accuracy, and ii) the regression model constructed using the transformed traces has a much smaller error than one based on additive data-perturbation schemes.

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


Probabilistic Analysis of Probe Reliability in Differential Gene Expression Studies with Short Oligonucleotide Arrays Probe defects are a major source of noise in gene expression studies. While existing approaches detect noisy probes based on external information such as genomic alignments, we introduce and validate a targeted probabilistic method for analyzing probe reliability directly from expression data and independently of the noise source. This provides insights into the various sources of probe-level noise and gives tools to guide probe design.

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

applications
biology and genetics
parameter learning
probabilistic algorithms


Elliptic curve cryptosystems over small fields of odd characteristic In this paper it is shown how to speed up the multiplication step on elliptic curves defined over small odd characteristic finite fields. The method used is a generalization of a recent method of Muller and Solinas. Various implementation issues are discussed and described with the use of timings from an implementation of the methods.

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


Tree structure for efficient data mining using rough sets In data mining, an important goal is to generate an abstraction of the data. Such an abstraction helps in reducing the space and search time requirements of the overall decision making process. Further, it is important that the abstraction is generated from the data with a small number of disk scans. We propose a novel data structure, pattern count tree (PC-tree), that can be built by scanning the database only once. PC-tree is a minimal size complete representation of the data and it can be used to represent dynamic databases with the help of knowledge that is either static or changing. We show that further compactness can be achieved by constructing the PC-tree on segmented patterns. We exploit the flexibility offered by rough sets to realize a rough PC-tree and use it for efficient and effective rough classification. To be consistent with the sizes of the branches of the PC-tree, we use upper and lower approximations of feature sets in a manner different from the conventional rough set theory. We conducted experiments using the proposed classification scheme on a large-scale hand-written digit data set. We use the experimental results to establish the efficacy of the proposed approach.

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

pc-tree
single database scan
dynamic mining
segment pc-tree
rough pc-tree


An average inverse power ratio method for the damping estimation from a frequency response function The well-known bandwidth method, especially the half-power bandwidth method [1], [3]and[4] (Bishop and Gladwell, 1963; Nashif et al., 1985; Yin, 2008) is probably the simplest method for the damping estimation from a frequency response function (FRF). This method is quite efficient for simple model test cases when modes are well separated. However, the determination of the two frequencies corresponding to a given power ratio value requires numerical interpolations of experimental discrete data of frequency response functions. In this paper, an average inverse power ratio method is proposed. The average value is computed at two frequencies symmetrically located from a peak amplitude frequency. Then the damping ratio can be estimated by using a formula similar to that of the bandwidth method. In this way, the damping estimation becomes straightforward from the FRF data. This new method could be useful for engineers in practice due to its extreme simplicity.

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

damping estimation
bandwidth
power ratio


Building robust wireless LAN for industrial control with the DSSS-CDMA cell phone network paradigm Wireless LAN for Industrial Control (IC-WLAN) provides many benefits, such as mobility, low deployment cost, and ease of reconfiguration. However, the top concern is robustness of wireless communications. Wireless control loops must be maintained under persistent adverse channel conditions, such as noise, large-scale path loss, fading, and many electromagnetic interference sources in industrial environments. The conventional IEEE 802.11 WLANs, originally designed for high bandwidth instead of high robustness, are therefore inappropriate for IC-WLAN. A solution lies in the Direct Sequence Spread Spectrum (DSSS) technology: By deploying the largest possible processing gain (slowest bit rate) that fully exploits the low data rate feature of industrial control, much higher robustness can be achieved. We hereby propose using DSSS-CDMA to build IC-WLAN. We carry out fine-grained physical layer simulations and Monte Carlo comparisons. The results show that DSSS-CDMA IC-WLAN provides much higher robustness than IEEE 802.11/802.15.4 WLAN, so that reliable wireless industrial control loops become feasible. We also show that deploying larger processing gain is preferable to deploying more intensive convolutional coding. The DSSS-CDMA IC-WLAN scheme also opens up a new problem space for interdisciplinary study, involving real-time scheduling, resource management, communication, networking, and control.

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

real-time and embedded systems
reliability and robustness
wireless communication


Geometry and kinematics of the Mecanum wheel Mecanum wheels are used when omnidirectional movability of a vehicle is desired. That means that the vehicle can move along a prescribed path and at the same time rotate arbitrarily around its center. A Mecanum wheel consists of a set of rolls arranged around the wheel axis. In this paper we describe in detail the geometry of these rolls. We derive simple canonical parameterizations of the roll generating curve and the roll surface itself. These parametric representations reveal the geometry of the roll. With their help we can easily find an approximation of the roll surface by a torus for manufacture purposes. Based on the roll parametrization we study the kinematics of a vehicle featured with Mecanum wheels. (C) 2008 Elsevier B.V. All rights reserved.

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


adaptive intra cluster routing for wireless sensor networks Scientists have listed down ten emerging technologies that will change the world's future and Wireless Sensor Network (WSN) is one of them. A lot of work is in progress to make this technology more effective by having research in this field. This network is composed of sensing nodes which are energy limited so energy efficiency is one of the most critical design issues. To have energy efficient network, efficient routing plays very important role. In this paper, Adaptive Intra Cluster routing (AICR) is proposed which is the best solution to the problem offered by traditional routing algorithms. Comparative study of AICR is done with MultiHop Router [1] by simulating. Simulation results have revealed that AICR is 17\% more energy efficient and has increased network lifetime up to 12\%.

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

adaptive routing
cluster formation
cluster head


A goal programming model for partner selection decisions in international joint ventures The formation of International Joint Ventures (IJVs) has become a widely used mode of international expansion. The selection of the appropriate partner constitutes one of the major factors of success for the IJV. There have been several research efforts, which were concerned with the study of criteria needed for the selection of a partner but not with the development of an appropriate quantitative model. The objective of this paper is to present a quantitative model, based on the goal programming technique, which uses appropriate criteria to evaluate potential candidates and leads to the selection of the optimal partner.

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

goal programming
partner selection decisions
international
joint ventures


Ab initio studies on the reactivity of the CF3OCH2O radical: Thermal decomposition vs. reaction with O-2 Hydrofluoroethers are being considered as potential candidates for third generation refrigerants. The present investigation involves the ab initio quantum mechanical study of the decomposition mechanism of CF3OCH2O radical formed from a hydrofluoroether, CF3OCH3 (HFE-143a) in the atmosphere. The geometries of the reactant, products and transition states involved in the decomposition pathways are optimized and characterized at the DFT (B3LYP) level of theory using 6-311G(d,p) basis set. Energy calculations have been performed at the G2(MP2) and G2M (CC, MP2) level of theory. Two prominent decomposition channels, C-O bond scission and reaction with atmospheric O-2 have been considered for detailed investigation. Studies performed at the G2(MP2) level reveals that the decomposition channel involving C-O bond scission occurs with a barrier height of 23.8 kcal mol(-1) whereas the oxidative pathway occurring with O-2 proceeds with an energy barrier of 7.2 kcal mol(-1). On the other hand the corresponding values at G2M(CC, MP2) are 24.5 and 5.9 kcal mol(-1) respectively. Using canonical transition state theory (CTST) rate constants for the two pathways considered are calculated at 298 K and 1 atm pressure and found to be 5.9x10(-6) s(-1) and 2.3x10-5 s(-1) respectively. The present study concludes that reaction with O-2 is the dominant path for the consumption of CF3OCH2O in the atmosphere. Transition states are searched and characterized on the potential energy surfaces involved in both of the reaction channels. The existence of transition state on the corresponding potential energy surface is ascertained by performing intrinsic reaction coordinate (IRC) calculation.

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


Comparative performance analysis of ordering strategies in atomic broadcast algorithms In this paper, we present the results of a comparative analysis of Atomic Broadcast algorithms. The analysis was done by using an analytical method to compare the performance of five different classes of Atomic Broadcast algorithms. The five classes of Atomic Broadcast algorithms are determined by the mechanisms used by the algorithms to define the delivery order. To evaluate the performance of algorithms, the analysis relies on contention-aware metrics to provide a measure for both their latency and their throughput. The results thus obtained yield interesting insight into the performance tradeoffs of different Atomic Broadcast algorithms, thus providing helpful information to algorithms and systems designers.

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

distributed algorithms
total order
contention-aware metrics


Analysis and Fault Modeling of Actual Resistive Defects in ATMEL eFlash Memories The embedded Flash (eFlash) technology can be subject to defects creating functional faults. In this paper, we first generalize the electrical model of the ATMEL TSTAC eFlash memory technology proposed in [10]. The model is composed of two layers: a functional layer representing the Floating Gate (FG) and a programming layer able to determine the channel voltage level controlling the Fowler-Nordheim tunneling effect. The proposed model is validated by means of simulations and comparisons with ATMEL silicon data. Then, we present a complete analysis of actual resistive defects (open and short) that may affect the ATMEL TSTAC eFlash array by considering the proposed model on a hypothetical 4??4 array. This analysis highlights the interest of the proposed model to provide a realistic set of fault models that has to be tested, thus enhancing existing solutions for TSTAC eFlash testing.

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

nand array
fowler-nordheim tunneling effect
coupling effect
spice model
resistive-open defects
resistive-short defects


A methodology to learn ontological attributes from the Web Class descriptors such as attributes, features or meronyms are rarely considered when developing ontologies. Even WordNet only includes a reduced amount of part-of relationships. However, these data are crucial for defining concepts such as those considered in classical knowledge representation models. Some attempts have been made to extract those relations from text using general meronymy detection patterns; however, there has been very little work on learning expressive class attributes (including associated domain, range or data values) at an ontological level. In this paper we take this background into consideration when proposing and implementing an automatic, non-supervised and domain-independent methodology to extend ontological classes in terms of learning concept attributes, data-types, value ranges and measurement units. In order to present a general solution and minimize the data sparseness of pattern-based approaches, we use the Web as a massive learning corpus to retrieve data and to infer information distribution using highly contextualized queries aimed at improving the quality of the result. This corpus is also automatically updated in an adaptive manner according to the knowledge already acquired and the learning throughput. Results have been manually checked by means of an expert-based concept-per-concept evaluation for several well distinguished domains showing reliable results and a reasonable learning performance.

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

ontology learning
web mining
knowledge acquisition


A note on low-correlation zone signal sets In this correspondence, we present a connection between designing low-correlation zone (LCZ) sequences and the results of correlation of sequences with subfield decompositions presented in a recent book by the first two authors. This results in LCZ signal sets with huge sizes over three different alphabetic sets: finite field of size q, integer residue ring modulo q, and the subset in the complex field which consists of powers of a primitive qth root of unity. We show a connection between these sequence designs and "completely noncyclic" Hadamard matrices and a construction for those sequences. We also provide some open problems along this direction.

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

hadamard matrices ofcompletely noncyclic type


Latent topic model for audio retrieval A topic model named Gaussian-LDA is introduced for audio retrieval, which integrates topic modeling and clustering in a framework. The variational inference method is adopted to train the parameters of Gaussian-LDA. It is beneficial to model audio data using latent topic model in the task of audio retrieval. The Gaussian-LDA demonstrates better performance than LDA and other compared methods.

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


Cubic Boolean functions with highest resiliency We classify those cubic m-variable Boolean functions which are (m - 4)-resilient. We prove that there are four types of such functions, depending on the structure of the support of their Walsh spectra. We are able to determine, for each type, the Walsh spectrum and, then, the nonlinearity of the corresponding functions. We also give the dimension of their linear space. This dimension equals m - k where k = 3 for the first type, k = 4 for the second type, k = 5 for the third type, and 5 less than or equal to k less than or equal to 9 for the fourth type.

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

boolean function
cubic function
hamming weight
reed-muller code
resilient function
stream cipher
symmetric cryptography


Design of ultra wideband trapezoidal shape slot antenna with circular polarization A CPW-feed printed slot antenna with circular polarization characteristics is presented in this paper. The basic structure of the antenna is a rectangular slot excited by a 50? CPW line terminated on a trapezoidal shaped tuning stub. Perturbations in the form of circular stubs are applied in the slot to realize circular polarization. The measured impedance bandwidth (S11<?10dB) for the initial design is 4.4GHz (from 2.2GHz to 6.6GHz) while the 3-dB axial ratio bandwidth is 1.77GHz (from 4GHz to 5.77GHz) which is 36.23% at the center frequency of 4.88GHz. The basic structure of the antenna was further modified to enhance the impedance bandwidth to reach well beyond 12GHz while increasing the ARBW to 44.3% (from 4.3GHz to 6.75GHz). The proposed antenna in its final version has a measured peak gain of about 5dB throughout the useful band and nearly stable radiation pattern.

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

monopole antenna
cpw-feed
ultra wideband system


Construction of quadrilateral subdivision surfaces with prescribed G1 G 1 boundary conditions We present a scheme that combines the subdivision technique and the geometric partial differential equations method which provides us an efficient algorithm for designing high-quality surfaces with arbitrary topology structure. We use several fourth-order geometric partial differential equations to construct CatmullClarks subdivision surfaces with prescribed G1 G 1 boundary conditions where a mixed finite element method is based on the modified CatmullClarks subdivision scheme. Our approach can uniformly handle surface construction both with specified boundary normals and with interior sharp edges, which is a powerful tool for designing the shape of surfaces.

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

catmullclarks subdivision surface
g1 g 1 continuity g1 g 1 g1 g 1 g 1


Design and performance analysis of leader election and initialization protocols on ad hoc networks Leader election and initialization are two fundamental problems in mobile ad hoc networks (MANETs). The leader can serve as a coordinator in the MANETs and the initialization protocol can assign each host a sequential, unique, and short ID. As we know, no research on initialization for IEEE 802.11-based MANETs has been done. Here, we propose two contention-based leader election and initialization protocols for IEEE 802.11-based single-hop MANETs. We also provide an efficient approach to evaluate the performance of the proposed protocols, such that the performance can be evaluated in polynomial time. The evaluation results provide a guideline to set the size of the contention window and thus improve the performance of the proposed leader election and initialization protocols. The results can also be used as a guideline to set the size of the contention window for any contention-based protocol. Simulation results justify that the evaluation results provide a good guideline to set the size of the contention window. 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

initialization leader election
mobile ad hoc network (manet)


ontology-driven software engineering This workshop represents the 6th in a series of OOPSLA workshops focusing on the impact of semantics on the development and re-engineering of software systems. These workshops include three on 'Semantics of Enterprise Integration' (2001-2003), one on 'Legacy Transformation' (2004) and one on 'Semantic-Based Systems Development' (2007).

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

model development and transformation
ontology


Early detection of all-zero 44 4 4 blocks in High Efficiency Video Coding The value range of 44 4 4 quantized DCT coefficients in HEVC is analyzed. Two sufficient conditions to early detect all-zero 44 4 4 blocks in HEVC are derived. A prediction algorithm is designed to early detect all-zero 44 4 4 blocks. The proposed prediction algorithm keeps video quality and bit rates unchanged. Exhaustive experiments demonstrate the efficiency of the proposed algorithm.

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

zero coefficients
quantization
fast encoding
compression efficiency