A heuristic procedure for the Capacitated m-Ring-Star problem In this paper we propose a heuristic method to solve the Capacitated m-Ring-Star Problem which has many practical applications in communication networks. The problem consists of finding m rings (simple cycles) visiting a central depot, a subset of customers and a subset of potential (Steiner) nodes, while customers not belonging to any ring must be allocated to a visited (customer or Steiner) node. Moreover, the rings must be node-disjoint and the number of customers allocated or visited in a ring cannot be greater than the capacity Q given as an input parameter. The objective is to minimize the total visiting and allocation costs. The problem is a generalization of the Traveling Salesman Problem, hence it is NP-hard. In the proposed heuristic, after the construction phase, a series of different local search procedures are applied iteratively. This method incorporates some random aspects by perturbing the current solution through a shaking procedure which is applied whenever the algorithm remains in a local optimum for a given number of iterations. Computational experiments on the benchmark instances of the literature show that the proposed heuristic is able to obtain, within a short computing time, most of the optimal solutions and can improve some of the best known results.

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

capacitated m-ring-star problem
heuristic algorithms


Predictive control of a gas-liquid separation plant based on a Gaussian process model Gaussian process models provide a probabilistic non-parametric modelling approach for black-box identification of non-linear dynamic systems. The Gaussian processes can highlight areas of the input space where prediction quality is poor, due to the lack of data or to its complexity, by indicating the higher variance around the predicted mean. Gaussian process models contain noticeably less coefficients to be optimised. This paper demonstrates feasibility of application and realisation of a control algorithm based on a Gaussian process model. The extra information provided by the Gaussian process model is used in predictive control, where optimisation of the control signal takes the variance information into account. The feasibility of Gaussian process model usage for predictive control in industrial practice is demonstrated via the control of a gas-liquid separation plant. (c) 2006 Elsevier Ltd. All rights reserved.

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

model-based predictive control
process control
dynamic systems identification
gas-liquid separation plant


an implementation of an fpga-based embedded gesture recognizer using a data glove A gesture recognizer based on a desktop PC, which uses existing wire/wireless communication modules, has several restrictions such as space limitations, movement limitations, and change in recognition capacity depending on the change in the background lighting conditions when obtaining a user's meaningful gesture data from images. This paper proposes an embedded gesture recognizer that uses a data glove in order to solve these problems. The proposed embedded FPGA (field-programmable gate array)-based gesture recognizer comprises an input module, a recognition module, and a display module. The input module receives the data that is transmitted from a data glove through a UART. The recognition module determines whether one set of data is accurate by performing data calculations with a checksum function after receiving the input data and comparing it to the header byte. This module also analyzes the data from 17 distinct gestures and constructs recognition models, and then it extracts the hand gesture data and compares it to the recognition models to see if the gestures match any of the 17 models. The recognition module then transmits the recognition result to the display module. The display module displays the recognition result on an LCD screen. A data glove manufactured by 5DT was used to obtain the gesture inputs. The FPGA was the XC3S1000FG676 (Xilinx Inc.) and it was designed using VHDL. The experimental results showed a 94\% average recognition rate when using the FPGA-based embedded gesture recognizer and the data glove.

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


uBench: exposing the impact of CUDA block geometry in terms of performance The choice of thread-block size and shape is one of the most important user decisions when a parallel problem is written for any CUDA architecture. The reason is that thread-block geometry has a significant impact on the global performance of the program. Unfortunately, the programmer has not enough information about the subtle interactions between this choice of parameters and the underlying hardware.

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

gpu
benchmarking
fermi
kepler
performance measurement


Efficient processing of requests with network coding in on-demand data broadcast environments On-demand broadcast is an effective wireless data dissemination technique to enhance system scalability and the ability to handle dynamic user access patterns. In traditional on-demand broadcast, only one data item can be retrieved by mobile clients during the course of each broadcast, which limits bandwidth utilization and throughput. In this paper, we consider data broadcast with network coding in on-demand broadcast environments. We analyze the coding problem in on-demand broadcast and transform it into the problem of finding the maximum clique in graph theory. Based on our analysis, we first propose a new coding strategy called AC, which exploits the cached information related to clients and data items requested by them, to implement a flexible coding mechanism. Then, based on AC, we propose two novel coding assisted algorithms called ADC-1 and ADC-2 which consider data scheduling, in addition to network coding. In ADC-1 data scheduling and coding are considered separately, while these two factors are fully integrated in ADC-2. The performance gain of our proposed algorithms over traditional and other coding assisted broadcast algorithms is demonstrated through simulation results. Our algorithms not only reduce request response time but also utilize broadcast channel bandwidth more efficiently.

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


Prognosis of prostate cancer by artificial neural networks In this study, an artificial neural network has been devised that yields a prognostic result indicating whether patients have cancer or not using their free prostate-specific antigen, total prostate-specific antigen and age data. Though this system does not diagnose cancer conclusively, it helps the doctor in deciding whether a biopsy is necessary by providing information about whether the patient has prostate cancer or not. Data from 121 patients who were definitively diagnosed with cancer after biopsy were used in devising the system. The results of the definitive diagnoses of the patients and the results of the ANN that was performed were analysed using confusion matrix and ROC analyses. As a result of ANN, which was implemented on the basis of these analyses, success rates of 94.11% and 94.44% were achieved for prognosis of disease and validity, respectively. The ANN, which yielded these high rates of reliability, will help doctors make quick and reliable diagnoses without any risks and make it a better option to monitor patients with low prostate cancer risk on whom biopsies must not be carried out through a policy of wait and see.

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

artificial neural network
prostate cancer

prostate-specific antigen
prognosis of prostate cancer


Neuropeptide Regulators of Juvenile Hormone Synthesis Juvenile hormones (JH), produced by the corpora allata, have an essential role in growth and development, morphogenesis, and reproductive processes of insects. The output of JH and circulating titer are required to be precisely regulated throughout the insect's life in response to developmental requirements and environmental factors. The synthesis of JH must be periodically turned off and on, or finely tuned, in a highly coordinated way. Except for a few key or intensely studied insect species, the control of synthesis of JH by regulatory peptides remains largely undefined and many of the details remain obscure. Several different classes of neuropeptide are believed to be involved in the regulation of corpus allatum function and hence JH output. In different insect species and at different stages of development, these regulatory peptides may include at least three types of inhibitory allatostatins, at least one type of stimulatory allatotropin, and perhaps several other, as yet largely undefined, additional neuropeptides. The details of how each of these peptides acts to affect JH production and their relationship to each other in the coordination of JH synthesis remain to be established. There are several insect orders for which almost nothing is known concerning the regulation of JH synthesis and the peptides that might be involved. Current proteomic and genomic studies are helping to redress this balance but at the same time posing new questions. Other neuropeptides are implicated in the regulation of JH production, and there is new evidence concerning the mode of action of allatotropins.

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


Spectrally accurate fast summation for periodic Stokes potentials A spectrally accurate method for the fast evaluation of N-particle sums of the periodic Stokeslet is presented. Two different decomposition methods, leading to one sum in real space and one in reciprocal space, are considered. An FFT based method is applied to the reciprocal part of the sum, invoking the equivalence of multiplications in reciprocal space to convolutions in real space, thus using convolutions with a Gaussian function to place the point sources on a grid. Due to the spectral accuracy of the method, the grid size needed is low and also in practice, for a fixed domain size, independent of N. The leading cost, which is linear in N , arises from the to-grid and from-grid operations. Combining this FFT based method for the reciprocal sum with the direct evaluation of the real space sum, a spectrally accurate algorithm with a total complexity of O(NlogN) O ( N log N ) is obtained. This has been shown numerically as the system is scaled up at constant density.

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

viscous flow
stokes equations
potential theory
ewald summation


MODEL SELECTION OF C-SUPPORT VECTOR MACHINES BASED ON MULTI-THREADING GENETIC ALGORITHM Since generalization performance of support vector machines depends a lot on parameter values of kernel functions, it is important to select optimal parameter values. How to finish optimal model selection of C-Support Vector Machines (C-SVM) with satisfiable speed is the main focus of this paper. We can hardly finish training process for large data sets with traditional methods because of long time-consuming cost. To take advantage of multi-threading and genetic algorithms, we studied a hybrid model selection method to select C and sigma of RBF kernel function for C-SVM classifier. This new method not only chooses global optimal parameters, but also saves training time based on parallel computing process. Experimental results show the efficiency and feasibility of the new method.

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

support vector machines
rbf kernel
model selection
classifier


Modelling ranging error of indoor TOA-based position system based on receive signal strength For Time of Arrival (TOA) based indoor position system, the localisation accuracy is significantly affected by the ranging error caused by the severe multipath condition. This paper presents a receive signal strength index (RSSI) based indoor TOA ranging error model, which can be used to estimate the interval of ranging error. In this model, TOA is divided into four classes according to the RSSI of the received data and the error interval of each class can be obtained by analysis and measurement. We described the derivation of the model and then verified it by field testing with commercial available TOA-based localisation system in two typical office environments. Based on the model, we presented a ranging error classification (REC) based indoor TOA localisation algorithm. Result of simulation and field testing shows that the REC algorithm has significantly improved localisation accuracy in the typical indoor environments, comparing with the traditional localisation algorithms.

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

indoor location system
ips
indoor positioning system
rtls


Design of simplified coherent QPSK modem for frequency hopping spread spectrum PSK coherent demodulation has difficulty in achieving high speed carrier extraction and symbol synchronization when implementing to slow FR-SS radio system. On the other hand, implementation to FPGA has the requirement of a small gate size to design because of FPGA cost issue. We developed a QPSK coherent demodulation digital modem for FH-SS radio systems using FPGA by solving problems. The designed modem performs symbol synchronization with no carrier extractions, under the limitation of the small gate size requirement. The modern employs shift arithmetic operation and a comb digital BPF to achieve very good synchronization lock-up performance with small gate size. lit this paper. the symbol synchronization and the carrier tracking scheme are mainly discussed. Analysis of its performance and stability are also explained. The achievement of its very good performance is presented by experimental measurement.

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

spread spectrum
symbol synchronization
coherent demodulation
carrier extraction


Foundations of fuzzy functions and vague algebra based on many-valued equivalence relations, Part III: Constructions of vague algebraic notions and vague arithmetic operations As a continuation of Demirci [(2003b) "Foundations of fuzzy functions and vague algebra based on many-valued equivalence relations, part II: vague algebraic notions", Int. J. Gen. Syst. 32, 157-175], starting from the algebraic concepts in the classical sense, this paper deals with the constructions of vague semigroups, vague monoids, vague groups, vague rings and vague fields on the basis of many-valued equivalence relations. Vague addition operations and vague multiplication operations on the basis of many-valued equivalence relations, which are naturally derived from vague algebraic notions in Demirci [( 2003b) "Foundations of fuzzy functions and vague algebra based on many-valued equivalence relations, part II: vague algebraic notions", Int. J. Gen. Syst. 32, 157-175], and their constructions from the arithmetic operations in the classical sense are also subjects of this paper.

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

fuzzy algebra
fuzzy group
vague group
fuzzy arithmetic
fuzzy function


A fuzzy solution approach for multi objective supplier selection ? In todays severe competitive environment the selection of appropriate suppliers is a significantly important decision for effective supply chain management. Appropriate suppliers reduce purchasing costs, decrease production lead time, increase customer satisfaction and strengthen corporate competitiveness. In this study a multiple sourcing supplier selection problem is considered as a multi objective linear programming problem. Three objective functions are minimization of costs, maximization of quality and maximization of on-time delivery respectively. In order to solve the problem, a fuzzy mathematical model and a novel solution approach are proposed to satisfy the decision makers aspirations for fuzzy goals. The proposed approach can be efficiently used to obtain non-dominated solutions. A numerical example is given to illustrate how the approach is utilized.

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

multiple objective optimization
fuzzy mathematical programming


Combining ontological profiles with context in information retrieval An ontology is a formal conceptualization of a domain, specifying the concepts of the domain and the relations between them. It is however not a straight forward task to use this knowledge for information retrieval purposes. In this paper we describe the concept of an ontological profile, which is a semantic extension of an ontology where each ontology concept is given a description in terms of a vector of weighted keywords. An experiment has been conducted with a prototype search engine using ontological profiles for query expansion. The evaluation shows encouraging results compared to standard keyword based search. Furthermore, we describe the notion of context in an information retrieval setting and address how we can combine semantics and context in search based on query expansion. (C) 2009 Elsevier B.V. All rights reserved.

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

information retrieval
ontological profiles
context


Design considerations in micromachined silicon microphones We present and compare the different designs of micromachined silicon condenser microphones. The aim is to develop the microphones with high sensitivity and low fabrication cost. Slotted and corrugated diaphragms have been designed and fabricated in order to increase the mechanical sensitivity of microphones. At the same time, we developed the fabrication process for the low stress or stress-free multilayers polysilicon used as the microphone diaphragms. To increase the microphone chip density on one wafer and avoid the sticking problem during the wet release process, a new process design using deep reactive ion etching is proposed, which is available in our laboratory.

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

microphones
polysilicon
deep reactive ion etching


Mixed memory Markov models: Decomposing complex stochastic processes as mixtures of simpler ones We study Markov models whose state spaces arise from the Cartesian product of two or more discrete random variables. We show how to parameterize the transition matrices of these models as a convex combination-or mixture-of simpler dynamical models. The parameters in these models admit a simple probabilistic interpretation and can be fitted iteratively by an Expectation-Maximization (EM) procedure. We derive a set of generalized Baum-Welch updates for factorial hidden Markov models that make use of this parameterization. We also describe a simple iterative procedure for approximately computing the statistics of the hidden states. Throughout, we give examples where mixed memory models provide a useful representation of complex stochastic processes.

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


Ontology-based semantic similarity: A new feature-based approach Estimation of the semantic likeness between words is of great importance in many applications dealing with textual data such as natural language processing, knowledge acquisition and information retrieval. Semantic similarity measures exploit knowledge sources as the base to perform the estimations. In recent years, ontologies have grown in interest thanks to global initiatives such as the Semantic Web, offering an structured knowledge representation. Thanks to the possibilities that ontologies enable regarding semantic interpretation of terms many ontology-based similarity measures have been developed. According to the principle in which those measures base the similarity assessment and the way in which ontologies are exploited or complemented with other sources several families of measures can be identified. In this paper, we survey and classify most of the ontology-based approaches developed in order to evaluate their advantages and limitations and compare their expected performance both from theoretical and practical points of view. We also present a new ontology-based measure relying on the exploitation of taxonomical features. The evaluation and comparison of our approachs results against those reported by related works under a common framework suggest that our measure provides a high accuracy without some of the limitations observed in other works.

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

semantic relatedness
feature-based similarity
wordnet


Intelligent Resource Exchanges: Solutions and Pathways in a Workforce Allocation Problem This paper considers the problem of resource allocation in the service industries approached from an agent-based perspective. Agent technologies seem to be well suited to this domain by providing a distributed environment, are network centric, semi-autonomous and collaborative and can communicate with each other to achieve better optimisation with little human intervention. The paper describes the context of this solution, a general power model and several pathways with corresponding example implementations with results and discussion The novelty of the solution resides in the fact that it is a natural and versatile formulation that combines an agent-based model with various artificial intelligence and operations research techniques such as rule-based expressions of allocation strategies and multi-criteria optimisation expressions of allocation objectives.

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

multi-agent planning
e-business agents
case studies and reports on deployments


Equivalent Dynamic Stiffness Mapping technique for identifying nonlinear structural elements from frequency response functions Dealing with strong nonlinear structures with distorted response curves such as jumps and breaks. No need to strictly control the excitation force as the measured data are used in the identification. No need to pre-identify underlying linear parameters of the structure. This technique could be nonparametric by using ordinary polynomials and require no priori information about the nonlinearity, which makes it possible to deal with complex nonlinear structures that may not be well understood.

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

equivalent dynamic stiffness mapping
identification
nonlinear structures
frequency response functions


representative views re-ranking for 3d model retrieval with multi-bipartite graph reinforcement model In this paper, we propose a multi-bipartite graph reinforcement model for representative views re-ranking in 3D model retrieval. Given the views of one query 3D model, all query views are grouped into clusters to generate representative views and corresponding original weights. In the retrieval procedure, labeled positive retrieval results are employed to refine the query information. Each group of views from positive retrieval results and the group of representative query views are employed to construct a bipartite graph, and a multi-bipartite graph reinforcement algorithm is performed on these bipartite graphs to re-rank all views. Then the weights of all representative query views are updated. Experimental results on two 3D model databases are provided to justify the effectiveness of the proposed method.

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


Beyond 6LoWPAN: Web Services in Wireless Sensor Networks To date, Wireless Sensor Networks (WSN) require their own specific methodologies, tools, and technologies. With the rise of 6LoWPAN protocols (i.e., IPv6 over Low Power Wireless Personal Area Networks), WSNs can use IP to share a common network layer with other networks and the Internet for highly interoperable device communication. But additional efforts are necessary to develop new or adapt existing application layer protocols for IP-enabled WSNs. Hence, this paper investigates W3C SOAP Web Services (WS) in the context of WSNs. In particular, it is shown that the Devices Profile for Web Services (DPWS) can be used as an application layer protocol in WSNs. This paper presents an improved DPWS architecture that takes into account the requirements of WSNs. For instance, in order to reduce overhead, messages are scaled down by an optimized data encoding based on the emerging W3C Efficient XML Interchange (EXI) format. Moreover, a novel SOAP-binding on top of the IETF Constrained Application Protocol (CoAP) is introduced for an efficient transport of SOAP messages. The paper evaluates the proposed approaches by dedicated implementations of DPWS, EXI, and the SOAP-over-COAP binding. The results claim that the proposed approaches satisfy the requirements of mote class devices with only tens of KB RAM and ROM.

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

constrained application protocol (coap)
device centric
efficient xml interchange (exi)
service-oriented architecture
service-oriented architectures (soa)


CAIDSA: Computer-aided intelligent diagnostic system for bronchial asthma The objective of this paper is to design an interactive computer-aided intelligent diagnostic system for bronchial asthma (CAIDSA) based on the clinico-epidemiological information. Primarily, a number of disease-related subjective questions pertaining to the epidemiological features are considered to be developed as an intelligent probing system. In this evaluation system, a popping factor, whose values are assigned by medical experts, is defined in such a way that a question is popped subsequently depending upon a patients response to the previous question. And finally, based on the subjective evaluation, the specific type of asthma is identified with its degree of severity in terms of probability. This disease probability is estimated using neural network where the decision rules are set to recommend whether a patient should go for confirmatory tests (clinical tests) or not. If a patient is suspected or even detected, she/he is sent for confirmatory tests on the basis of which the disease is confirmed, and its disease probability is again revised to increase the diagnostic accuracy. In this proposed CAIDSA tool, there is also a scope for learning the diagnostic features for better diagnostic improvement. In fact, the entire schematic diagram of CAIDSA and the outline of the software implementation are pointed out in this work.

O O O O O O B I O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 correlation filter for optical particle counter Particle signals are detected by two parallel measuring chains which consist of a detector and analog to digital converter. We have used OPT101 as photodiode and ADS7870 for A/D converter and the output signal from two parallel measuring chains is processed by on line correlation filter. This filter works as real time systems. A correlation algorithm has been applied for this work. The signal to noise ratio has been increased by applying correlation filter. The gain of the filter has been improved by introducing digital signal processing.

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

particle counter
correlation filter
noise

a/d converter
transimpedance amplifier
snr


Rectangular Layouts and Contact Graphs Contact graphs of isothetic rectangles unify many concepts from applications including VLSI and architectural design, computational geometry, and GIS. Minimizing the area of their corresponding rectangular layouts is a key problem. We study the area-optimization problem and show that it is NP-hard to find a minimum-area rectangular layout of a given contact graph. We present O(n)-time algorithms that construct O(n(2))-area rectangular layouts for general contact graphs and O(n log n)area rectangular layouts for trees. ( For trees, this is an O(logn)-approximation algorithm.) We also present an infinite family of graphs (respectively, trees) that require Omega(n(2)) ( respectively, Omega(n log n)) area. We derive these results by presenting a new characterization of graphs that admit rectangular layouts, using the related concept of rectangular duals. A corollary to our results relates the class of graphs that admit rectangular layouts to rectangle-of-influence drawings.

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

contact graphs
rectangular duals
rectangular layouts


Infinite queueing system with tree structure We focus on invariant measures of an interacting particle system in the case when the set of sites, on which the particles move, has a structure different from the usually considered set Z(d). We have chosen the tree structure with the dynamics that leads to one of the classical particle systems, called the zero range process. The zero range process with the constant speed function corresponds to an infinite system of queues and the arrangement of servers in the tree structure is natural in a number of situations. The main result of this work is a characterisation of invariant measures for some important cases of site-disordered zero range processes on a binary tree. We consider the single particle law to be a random walk on the binary tree. We distinguish four cases according to the trend of this random walk for which the sets of extremal invariant measures are completely different. Finally, we shall discuss the model with an external source of customers and, in this context, the case of totally asymmetric single particle law on a binary tree.

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

invariant measures
zero range process
binary tree
queues


background music reactive games In this paper, we discuss the concept of games that react to their background music. Instead of limiting the player to a fixed set of songs, the background music can be any song chosen from the player's own music collection. Due to the relative simplicity of such existing game titles, we wanted to explore the potential of the concept more broadly in both digital audio and MIDI domains. Mappings between several musical and game parameters were studied by modifying two open-source games to react to their background music. The feedback collected with the game prototypes suggests that players appreciate the concept and find it entertaining. Based on the feedback and our experiments with different mappings, we present a set of design considerations for background music reactive games. The concept can be used to bring new life to existing games, and even a trivial game can be made interesting if the player can affect the game by changing the background music to his or her favorite song.

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

briquolo
asteroids
game design
music games


A nonconforming scheme with high accuracy for the plate bending problem The convergence order O(h2) O ( h 2 ) of the plate bending problem has been derived by the superconvergence methods or constructing new finite elements where shape function space consist of P3 P 3 space so far. In this paper, we can also present the same result of the Adini rectangular element by the interior penalty method. We built a new nonconforming scheme, where the penalty parameter is accurately estimated and the consistency term vanishes. Then, the error estimate can only be determined by the interpolation error.

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

plate bending problem
adini rectangular element
nonconforming scheme
interior penalty method


Tracking and Activity Recognition Through Consensus in Distributed Camera Networks Camera networks are being deployed for various applications like security and surveillance, disaster response and environmental modeling. However, there is little automated processing of the data. Moreover, most methods for multicamera analysis are centralized schemes that require the data to be present at a central server. In many applications, this is prohibitively expensive, both technically and economically. In this paper, we investigate distributed scene analysis algorithms by leveraging upon concepts of consensus that have been studied in the context of multiagent systems, but have had little applications in video analysis. Each camera estimates certain parameters based upon its own sensed data which is then shared locally with the neighboring cameras in an iterative fashion, and a final estimate is arrived at in the network using consensus algorithms. We specifically focus on two basic problems-tracking and activity recognition. For multitarget tracking in a distributed camera network, we show how the Kalman-Consensus algorithm can be adapted to take into account the directional nature of video sensors and the network topology. For the activity recognition problem, we derive a probabilistic consensus scheme that combines the similarity scores of neighboring cameras to come up with a probability for each action at the network level. Thorough experimental results are shown on real data along with a quantitative analysis.

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

activity recognition
camera networks
consensus
tracking


Modeling of skeletal muscle: the influence of tendon and aponeuroses compliance on the forcelength relationship The aim of this study was to investigate the influence of changing elastic properties of tendon and aponeuroses on force production and muscle geometry. A three-dimensional, structural, continuum mechanics model of the cat medial gastrocnemius was used for this purpose. Increasing compliance in tendon and aponeuroses caused a decrease in the peak isometric force and a shift of the forcelength relationship to the right of the length axis (i.e. toward greater muscle lengths). This result can be explained with the stability condition of the forcelength relationship which produced a history dependence of force production that is conceptually in agreement with experimental observations.

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

muscle modeling
muscle forcelength relationship
muscle architecture
finite element analysis
computer simulation


Dynamic configuration management in reliable distributed real-time information systems Large-scale information systems emerging in challenging application fields must meet the high standards of reliability, maintainability and service interruption bound requirements. Their operations are entirely, or partially, of the distributed real-time data object manipulation type. A new architecture for such systems is presented in this paper. The original aspects of the architecture are mainly in two parts: 1) the time-triggered message-triggered object (TMO) structuring of the middleware and the application software of distributed real-time information systems; and 2) the dynamic configuration management subsystem (DCMS), based on the supervisor-based network surveillance (SNS) scheme. The positive impacts of this TMO structuring on maintainability and service interruption bounds are first discussed, with distributed replicated information service systems and other systems as examples. Then, the main discussion dwells on the DCMS architecture-in particular, formal presentation of its key component: the SNS scheme. As a component of DCMS, the network surveillance (NS) subsystem enables fast learning by each interested fault-free node in the system of the faults or repair completion events occurring in other parts of the system. Currently, concrete real-time NS schemes effective in distributed systems based on point-to-point network architectures are scarce. The SNS scheme presented in this paper is a semicentralized real-time NS scheme effective in a variety of point-to-point networks. This scheme is highly scalable. An efficient implementation model for the SNS scheme is presented that can be easily adapted to various commercial operating system kernels. This paper also presents a formal analysis of the SNS scheme, on the basis of the implementation model, to obtain its strongly competitive tight bounds on the fault detection latency. Finally, some DCMS implementation issues are discussed that remain to be addressed in future research.

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

object
information service systems
tmo
configuration management
network surveillance
fault detection latency

distributed computing
real time
time-triggered
message-triggered
point-to-point networks
latency bound
supervisor


design and implementation of a generic library for p2p streaming Practical implementation of new P2P streaming systems requires a lot of coding and is often tedious and costly, slowing down the technology transfer from the research community to real users. GRAPES aims at solving this problem by providing a set of open-source components conceived as basic building blocks for building new P2P streaming applications which have in mind the savvy usage of network resources as well as the Quality of Experience of final users. GRAPES is designed to be usable in different environments and situations, to have a minimum set of pre-requisites and dependencies, and not to impose any particular constraints on applications using it. Our experience shows that GRAPES allows the rapid development of P2P streaming applications by writing a small amount of glue code to connect the desired functionalities. Some examples (including some simple P2P streamers) are also discussed as a means to show code usage.

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


Kernelized Fuzzy Rough Sets Based Yawn Detection for Driver Fatigue Monitoring Driver fatigue detection based on computer vision is considered as one of the most hopeful applications of image recognition technology. The key issue is to extract and select useful features from the driver images. In this work, we use the properties of image sequences to describe states of drivers. In addition, we introduce a kernelized fuzzy rough sets based technique to evaluate quality of candidate features and select the useful subset. Fuzzy rough sets are widely discussed in dealing with uncertainty in data analysis. We construct an algorithm for feature evaluation and selection based on fuzzy rough set model. Two classification algorithms are introduced to validate the selected features. The experimental results show the effectiveness of the proposed techniques.

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

fatigue detection
image recognition
fuzzy rough sets
classification


Teapot: A domain-specific language for writing cache coherence protocols In this paper, we describe Teapot, a domain-specific language for writing cache coherence protocols. Cache coherence is of concern when parallel and distributed systems make local replicas of shared data to improve scalability and performance. In both distributed shared memory systems and distributed file systems, a coherence protocol maintains agreement among the replicated copies as the underlying data are modified by programs running on the system. Cache coherence protocols are notoriously difficult to implement, debug, and maintain. Moreover, protocols are not off-the-shelf, reusable components, because their details depend on the requirements of the system under consideration. The complexity of engineering coherence protocols can discourage users from experimenting with new, potentially more efficient protocols. We have designed and implemented Teapot, a domain-specific language that attempts to address this complexity. Teapot's language constructs, such as a state-centric control structure and continuations, are better suited to expressing protocol code than those of a typical systems programming language. Teapot also facilitates automatic verification of protocols, so hard to find protocol bugs, such as deadlocks, can be detected and fixed before encountering them on an actual execution. We describe the design rationale of Teapot, present an empirical evaluation of the language using two case studies, and relate the lessons that we learned in building a domain-specific language for systems programming.

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

distributed systems
cache coherence
continuations
verification


a design-for-test structure for optimising analogue and mixed signal ic test A new Design-for-Test (DfT) structure based on a configurable operational amplifier, referred to as a "swap amp" is presented that allows access to embedded analogue blocks. The structure has minimal impact on circuit performance and has been evaluated on a custom designed Phase Locked Loop (PLL) structure. A test chip containing faulty and fault free versions of this PLL structure, with and without DfT modifications, has been fabricated and an evaluation of this DfT scheme based on the swap-amp structure carried out. It is shown that for embedded analogue blocks, the DfT strategy can not only improve and simplify analogue and mixed signal IC test, but can also be used for diagnostics.

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

swap amp
mixed signal ic test
embedded analogue blocks
diagnostics
custom designed phase locked loop
configurable operational amplifier
dft modifications

design for testability
operational amplifiers
phase locked loops
design-for-test structure
integrated circuit testing


Multiple-antenna capacity in the low-power regime This paper provides analytical characterizations of the impact on the multiple-antenna capacity of several important features that fall outside the standard multiple-antenna model, namely: i) antenna correlation,. ii) Ricean factors, iii) polarization diversity, and iv) out-of-cell interference; all in the regime of low signal-to-noise ratio. The interplay of rate, bandwidth, and power is analyzed in the region of energy per bit close to its minimum value. The analysis yields practical design lessons for arbitrary number of antennas in the transmit and receive arrays.

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

channel capacity
cochannel interference
fading channels
low-power regime
multiple-antenna arrays
rayleigh fading
ricean fading


an evolutionary dynamic approach for designing wireless sensor networks for real time monitoring The evolution in the microelectronics and embedded systems has expanded the employment of Wireless Sensor Networks (WSNs). The energy limitation of the nodes is a very important restriction of those structures and should be always considered during the network design. The search for energy-efficient WSNs must take into account aspects which are essential for the proper operation of the network, such as area coverage and network connectivity. This paper proposes an evolutionary approach for performing the design of WSNs, considering the dynamic nature of the problem. A genetic algorithm, which aims to maximize the lifetime of the network, is employed for establishing the sequence in which the sensor nodes are activated, ensuring that the minimum coverage (established a priori) and the connectivity constraints are met. Results achieved by the proposed algorithm in a 81-sensor node instance are compared with a former work, in order to validate the approach which is presented here.

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

performance evaluation
evolutionary algorithms


Voice conversion based on feature combination with limited training data We study four spectral features and compare them. We propose to use cepstral and all-pole features simultaneously in voice conversion. We improve GMM-based and DKPLS methods by feature combination strategy. Our proposed methods are robust to over-fitting and over-smoothing.

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

dynamic kernel partial least square regression (dkpls)


rough interface reconstruction using the level set method We present a new level set method for reconstructing interfaces from point aggregations. Although level-set-based methods are advantageous because they can handle complicated topologies and noisy data, most tend to smooth the inherent roughness of the original data. Our objective is to enhance the quality of a reconstructed surface by preserving certain roughness-related characteristics of the original dataset. Our formulation employs the total variation of the surface as a roughness measure. The algorithm consists of two steps: a roughness-capturing flow and a roughness-preserving flow. The roughness capturing step attempts to construct a surface for which the original roughness is captured distance flow is well suited for roughness capturing. Surface reconstruction is enhanced by using a total variation preserving (TVP) scheme for the roughness-preserving flow. The shock filter formulation of Osher and Rudin is exploited to achieve this goal. In practice, we have found that better results are obtained by balancing the TVP term with a smoothing term based on curvature. The algorithm is applied to both fractal surface growth simulations and scanned data sets to demonstrate the efficacy of our approach.

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

shock filter
total variation preserving
level set method
surface reconstruction


Using an adversary simulator to evaluate global EDF scheduling of sporadic task sets on multiprocessors We present a new adversary simulator for Global EDF scheduling of sporadic task sets on multiprocessors. Evaluation shows that the proposed adversary simulator is better than the classic simulator and other classic necessary test. We estimate the uncertainty area regarding Global EDF scheduling.

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


Tableau Calculus for Preference-Based Conditional Logics: PCL and its Extensions We present a tableau calculus for some fundamental systems of propositional conditional logics. We consider the conditional logics that can be characterized by preferential semantics (i.e., possible world structures equipped with a family of preference relations). For these logics, we provide a uniform completeness proof of the axiomatization with respect to the semantics, and a uniform labeled tableau procedure.

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


Using SOM and PCA for analysing and interpreting data from a P-removal SBR This paper focuses on the application of Kohonen self-organizing maps (SOM) and principal component analysis (PCA) to thoroughly analyse and interpret multidimensional data from a biological process. The process is aimed at enhanced biological phosphorus removal (EBPR) from wastewater. In this work, SOM and PCA are firstly applied to the data set in order to identify and analyse the relationships among the variables in the process. Afterwards, K-means algorithm is used to find out how the observations can be grouped, on the basis of their similarity, in different classes. Finally, the information obtained using these intelligent tools is used for process interpretation and diagnosis. In the data set analysed, both techniques yielded similar results regarding the relationships among the variables and the clustering of the observations (i.e., the same groups of observations were identified) and, therefore, identical process interpretation could be made. The cluster analysis allowed relating the observations to process behaviour, clearly distinguishing start-up, desirable and poor process conditions. The results demonstrate that the applied techniques are highly effective to compress multidimensional data sets and to extract relevant information from the process, making the interpretation and diagnosis much easier and evident.

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


Optimal wide-area monitoring and nonlinear adaptive coordinating neurocontrol of a power system with wind power integration and multiple FACTS devices Wide-area coordinating control is becoming an important issue and a challenging problem in the power industry. This paper proposes a novel optimal wide-area coordinating neurocontrol (WACNC), based on wide-area measurements, for a power system with power system stabilizers, a large wind farm and multiple flexible ac transmission system (FACTS) devices. An optimal wide-area monitor (OWAM), which is a radial basis function neural network (RBFNN), is designed to identify the input-output dynamics of the nonlinear power system. Its parameters are optimized through particle swarm optimization (PSO). Based on the OWAM. the WACNC is then designed by using the dual heuristic programming (DHP) method and RBFNNs, while considering the effect of signal transmission delays. The WACNC operates at a global level to coordinate the actions of local power system controllers. Each local controller communicates with the WACNC, receives remote control signals from the WACNC to enhance its dynamic performance and therefore helps improve system-wide dynamic and transient performance. The proposed control is verified by simulation studies on a multimachine power system. (C) 2007 Elsevier Ltd. All rights reserved.

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

facts devices
particle swarm optimization
wind power

adaptive critic designs
radial basis function network
wide-area control


A quantum neural network model We present the algorithms necessary for the implementation of a quantum neural network with learning and classification tasks. A complete implementation for the classification and learning algorithms is given in terms of unitary quantum gates. Such a quantum neural network can be used to perform complex classification tasks or to solve the general problem of binary mapping.

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

quantum algorithms
quantum neural networks


Storage planning and replica assignment in content-centric publish/subscribe networks Content-centric publish/subscribe networking is a flexible communication model that meets the requirements of the content distribution in the Internet, where information needs to be addressed by semantic attributes rather than origin and destination identities. In current implementations of publish/subscribe networks, messages are not stored and only active subscribers receive published messages. However, in a dynamic scenario, where users join the network at various instances, a user may be interested in content published before its subscription time. In this paper, we introduce a mechanism that enables storing in such networks, while maintaining the main principle of loose-coupled and asynchronous communication. Furthermore, we propose a new storage placement and replica assignment algorithm which differentiates classes of content based on their popularity and minimizes the clients response latency and the overall traffic of the network. We also present and compare two replica assignment alternatives and examine their performance when both the locality and the popularity of users request change. The performance of our proposed placement and replica assignment algorithm and the proposed storing mechanism is evaluated via simulations and insights are given for future work. The proposed mechanism is compared with mechanisms from the CDN (Content Delivery Networks) context and performs as close as 1-15% (depending on the conducted experiment) to a greedy (near optimal) approach installing up to 3 times less storage servers in the network and providing the necessary differentiation among the classes of the content. (C) 2011 Elsevier B.V. All rights reserved.

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


Bin packing with fragmentable items: Presentation and approximations We consider a variant of the Bin Packing Problem dealing with fragmentable items. Given a fixed number of bins, the objective is to put all the items into the bins by splitting them in a minimum number of fragments. This problem is useful for modeling splittable resource allocation. In this paper we introduce the problem and its complexity. We give and prove several properties then we present various approximation algorithms and specially a 6 5 -approximation algorithm.

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


A generic IP paging architecture and protocol Mobile communication systems are increasingly adopting Internet Protocol solutions for mobility management. Taking into account that an increasing number of mobile devices communicate actively for only a fraction of the time, location tracking costs must be appropriate for active and idle devices. Compelling all devices to maintain detailed location information in the network causes unnecessary signaling overhead and mobile battery drainage. Contemporary cellular mobile communication systems deploy technology-specific paging, which supports the maintenance of a mobile terminals coarse location information and to request its exact location when a call comes in. IP paging goes beyond that by targeting heterogeneous access in IP-based mobile communication networks, and by contributing towards meeting IP mobility management requirements on the scalability of future systems. This paper describes a generic IP paging architecture and protocol for heterogeneous mobile communication systems that integrates modularly into various IP-based mobility protocols. At the same time efficient integration of various access technologies and associated utilization of technology specific power save mechanisms is supported. The concept facilitates flexible paging area design and the deployment of enhanced paging strategies aimed at optimizing overall signaling costs. The concept is analyzed with regard to its characteristics to save signaling costs and compared with a different paging concept (P-MIP). Design and associated performance characteristics are evaluated based on the topological structure of a domains access network. To enhance power saving efficiency in Wireless-LAN-enabled networks, the integration of the IEEE802.11 access technology with the proposed paging protocol including the efficient utilization of the standards Power Save Mode is described. The complete paging systems delay characteristics are evaluated analytically to estimate dependencies of the session blocking probability on the networks link delay and IEEE802.11 specific power saving parameter settings.

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

internet protocol
mobile communication
paging
heterogeneous access
power save mode


Alveolar Cell Death in Hyperoxia-Induced Lung Injury Exposure to high oxygen concentration causes direct oxidative cell damage through increased production of reactive oxygen species. In vivo oxygen-induced lung injury is well characterized in rodents and has been used as a valuable model of human respiratory distress syndrome. Hyperoxia-induced lung injury can be considered as a bimodal process resulting (1) from direct oxygen toxicity and (2) from the accumulation of inflammatory mediators within the lungs. Both apoptosis and necrosis have been described in alveolar cells (mainly epithelial and endothelial) during hyperoxia. While the in vitro response to oxygen seems to be cell type-dependent in tissue cultures, it is still unclear which are the death mechanisms and pathways implicated in vivo. Even though it is not yet possible to distinguish unequivocally between apo-ptosis, necrosis, or other intermediate form(s) of cell death, a great variety of strategies has been shown to prevent alveolar damage and to increase animal survival during hyperoxia. In this review, we summarize the different cell death pathways leading to alveolar damage during hyperoxia, with particular attention to the pivotal role of mitochondria. In addition, we discuss the different protective mechanisms potentially interfering with alveolar cell death.

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

hyperoxia lung apoptosis necrosis mitochondria


Highly accurate and efficient evaluation of randomising set index functions Randomising set index functions can reduce the number of conflict misses in data caches by spreading the cache blocks uniformly over all sets. Typically, the randomisation functions compute the exclusive ors of several address bits. Not all randomising set index functions perform equally well, which calls for the evaluation of many set index functions. This paper discusses and improves a technique that tackles this problem by predicting the miss rate incurred by a randomisation function, based on profiling information. A new way of looking at randomisation functions is used, namely the null space of the randomisation function. The members of the null space describe pairs of cache blocks that are mapped to the same set. This paper presents an analytical model of the error made by the technique and uses this to propose several optimisations to the technique. The technique is then applied to generate a conflict-free randomisation function for the SPEC benchmarks.

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

conflict misses
randomisation
null space

microprocessor data cache
randomising set index function


nonlinear dynamics modelling for controller evolution The problem of how to acquire a model of a physical robot,which is fit for evolution of controllers that can subsequently be used to control that robot, is considered in the context of racing a radio-controlled toy car around a randomised track. Several modelling techniques are compared, and the specific properties of the acquired models that influence the quality of the evolved controller are discussed. As we aim tominimise the amount of domain knowledge used, we furtherinvestigate the relation between the assumptions about the modelled system made by particular modelling techniques and the suitability of the acquired models as bases for controller evolution. We find that none of the models acquired is good enough on its own, and that a key to evolving robustbehaviour is to evaluate controllers simultaneously on multiple models during evolution. Examples of successfully evolved racing control for the physical car are analysed.

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

neural networks
evolutionary robotics
forward models
system identification
games


Efficient simulation of optical nonlinear cavity circuits Recently, we proposed a node-based framework that can be used to simulate large circuits of nonlinear photonic components both in the time-domain and in the frequency-domain. In that framework, components are described using a flexible and very general node-definition, allowing to simulate circuits that contain a wide variety of components with different physical effects. In this paper, we extend the node-definition of this framework such that the linear coupling between access waveguides and resonance states in optical resonators can be more explicitly incorporated, reducing the simulation time in large-scale cavity circuits.

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

modeling
nanophotonics
integrated circuits


Nonlinear disjunctive programming models for the synthesis of heat integrated distillation sequences In this paper we present nonlinear optimization models for the optimal synthesis of heat integrated distillation sequences. These nonlinear optimization models can overcome problems with singularities that are encountered in the mixed integer nonlinear programming (MINLP) superstructure optimization of distillation columns with nonlinear short-cut models. The proposed optimization models are obtained from a systematic modeling procedure where generalized disjunctive programming models are derived using the state task network (STN) or state equipment network (SEN) superstructure representations. These models are solved with a modified logic-based outer approximation (OA) algorithm, in which the key item is an effective scheme for initialization for setting up the master problem. For heat integration, a disjunctive mixed integer linear programming (MILP) model based on pinch candidate selection is used that can be readily incorporated into the synthesis models. Numerical results are presented for both the state task network and the state equipment network representations, and for the case of no heat integration and with heat integration. As will be shown, robustness and efficiency of the structural optimization is greatly enhanced. (C) 1999 Elsevier Science Ltd. All rights reserved.

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

heat integrated distillation
nonlinear disjunctive programming
nonlinear optimization


Outlier removal for motion tracking by subspace separation Many feature tracking algorithms have been proposed for motion segmentation, but the resulting trajectories are not necessarily correct. In this paper, we propose a technique for removing outliers based on the knowledge that correct trajectories are constrained to be in a subspace of their domain. we first fit an appropriate subspace to the detected trajectories using RANSAC and then remove outliers by considering the error behavior of actual video tracking. Using real video sequences, we demonstrate that our method can be applied if multiple motions exist in the scene. We also confirm that the separation accuracy is indeed improved by our method.

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

feature tracking
outlier removal
subspace separation
ransac


Ergodicity, transitivity, and regularity for linear cellular automata over Z(m) We study the dynamical behavior of D-dimensional linear cellular automata over Z(m). We provide an easy-to-check necessary and sufficient condition for a D-dimensional linear cellular automata over Z(m) to be ergodic and topologically transitive. As a byproduct, we get that for linear cellular automata ergodicity is equivalent to topological transitivity. Finally, we prove that for 1-dimensional linear cellular automata over Z(m), regularity (denseness of periodic orbits) is equivalent to surjectivity. (C) 2000 Elsevier Science B.V. All rights reserved.

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

cellular automata
ergodicity
topological transitivity


perceptually driven interactive geometry remeshing Visual patterns on the surface of an object, such as two dimensional texture, are taken into consideration as part of the geometry remeshing process. Given a parameterized mesh and a texture map, the visual perceptual properties of the texture are first computed using a visual discrimination metric. This precomputation is then used to guide the distribution of samples to the surface mesh. The system automatically distributes few samples to texture areas with strong visual masking properties and more samples to texture areas with weaker visual masking properties. In addition, due to contrast considerations, brighter areas receive fewer samples than do darker surface features. Because of the properties of the human visual system, especially visual masking, the artifacts in the rendered mesh are invisible to the human observer. For a fixed number of polygons, this approach also improves the quality of the rendered mesh since the distribution of the samples is guided by the principles of visual perception. The utility of the system is demonstrated by showing that it can also account for other observable patterns on the surface, besides two dimensional texture, such as those produced by bump mapping, lighting variations, surface reflectance, and interreflections.

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

geometry remeshing
visual masking
visual perception


A robust shock-capturing scheme based on rotated Riemann solvers This paper presents a robust finite volume shock-capturing scheme based on the rotated approximate Riemann solver. A general framework for constructing the rotated Riemann solver is described and a rotated Roe scheme is discussed in detail. It is found that the robustness of the rotated shock-capturing scheme is closely related to the way in which the direction of upwind differencing is determined. When the upwind direction is determined by the velocity-difference vector, the rotated Roe scheme demonstrates a robust shock-capturing capability and the shock instabilities or carbuncle phenomena can be eliminated completely. The dissipation property associated with the linear field of the rotated flux-difference splitting scheme is analyzed, and several test cases are presented to validate the proposed scheme. (C) 2003 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

numerical simulation
hyperbolic conservation laws
flux-difference splitting
shock capturing
shock instability
carbuncle phenomenon


a proposal of encoded computations for distributed massively multiplayer online services This paper deals with Massively Multiplayer Online services, which are used to interact with other user in real time. Although it is possible to distribute the load on the server to users' computers, the distributed services are more vulnerable to cheating such as data theft. We propose a method for concealing data from a user who is authorized to manage the data. The method makes it possible to carry out various kinds of operations with data and program codes concealed. We show that concealed information can not be figured out with the knowledge of original programs or encoding keys which other users have.

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

interactive real-time applications
peer-to-peer


A subjective methodology for risk quantification based on generalized fuzzy numbers Uncertain information and domain experts' knowledge are inevitable in risk analysis of complex systems. Fuzzy reasoning is one of the ways to handle uncertainty. In addition, in order to represent the confidence degree of experts' subjective assessment, generalized fuzzy numbers are used for risk quantification in this paper. Based on the generalized fuzzy numbers arithmetic operation, a simple algorithm is developed to obtain final risk, which is also represented as generalized fuzzy number. A new similarity measure is proposed to determine the risk level. Compared with the previous works, our method is more reasonable. A numerical example is used to show the efficiency of the proposed method.

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

risk analysis
generalized fuzzy numbers
subjective assessment


developing an integrated end-to-end teragrid climate modeling environment The Community Earth System Model (CESM) is a widely used community model for studying the climate system on the Earth. The CESM model is both data and computationally intensive, making it difficult for users to set up and run CESM simulations using local resources. In this paper, we describe an integrated climate modeling environment that supports CESM simulations on the TeraGrid, comprehensive model metadata description, and automatic archival of model data and metadata for easy community access. This system builds upon and integrates several existing efforts -- the Purdue CCSM modeling portal, the Earth System Grid, the Earth System Modeling Framework, and the Earth System Curator. We present the design and implementation of our prototype system as well as an end-to-end usage scenario which is broken down into three workflows: model execution, data publishing, and metadata collection/publishing. The system will be used to support research and education on climate systems. We describe our plan and early efforts to engage users and obtain their feedback.

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

teragrid
cesm
earth system grid
metadata
ccsm

esmf
climate model
purdue ccsm portal
science gateway


Cultivation and engineering of a software metrics program Abstract.This paper reports from a case study of an organization that implements a software metrics program to measure the effects of its improvement efforts. The program measures key indicators of all completed projects and summarizes progress information in a quarterly management report. The implementation turns out to be long and complex, as the organization is confronted with dilemmas based on contradictory demands and value conflicts. The process is interpreted as a combination of a rational engineering process in which a metrics program is constructed and put into use, and an evolutionary cultivation process in which basic values of the software organization are confronted and transformed. The analysis exemplifies the difficulties and challenges that software organizations face when bringing known principles for software metrics programs into practical use. The article discusses the insights gained from the case in six lessons that may be used by Software Process Improvement managers in implementing a successful metrics program.

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

software development
software management


Optimizing multi-dimensional terahertz imaging analysis for colon cancer diagnosis Terahertz reflection imaging (at frequencies ?0.110THz/1012Hz) is non-ionizing and has potential as a medical imaging technique; however, there is currently no consensus on the optimum imaging parameters to use and the procedure for data analysis. This may be holding back the progress of the technique. This article describes the use of various intelligent analysis methods to choose relevant imaging parameters and optimize the processing of terahertz data in the diagnosis of ex vivo colon cancer samples. Decision trees were used to find important parameters, and neural networks and support vector machines were used to classify the terahertz data as indicating normal or abnormal samples. This work reanalyzes the data described in Reid et al. (2011) (Physics in Medicine and Biology, 56, 43334353), and improves on their reported diagnostic accuracy, finding sensitivities of 90100% and specificities of 8690%. This optimization of the analysis of terahertz data allows certain recommendations to be suggested concerning terahertz reflection imaging of colon cancer samples.

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

terahertz
optimization
neural networks
support vector machines
colon cancer


Markov chains with discontinuous drifts have differential inclusion limits In this paper, we study deterministic limits of Markov processes having discontinuous drifts. While most results assume that the limiting dynamics is continuous, we show that these conditions are not necessary to prove convergence to a deterministic system. More precisely, we show that under mild assumptions, the stochastic system is a stochastic approximation algorithm with constant step size that converges to a differential inclusion. This differential inclusion is obtained by convexifying the rescaled drift of the Markov chain. This generic convergence result is used to compute stability conditions of stochastic systems, via their fluid limits. It is also used to analyze systems where discontinuous dynamics arise naturally, such as queuing systems with boundary conditions or with threshold control policies, via mean field approximations.

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

mean field
stability
differential inclusion
queuing systems


the role of mulsemedia in digital content ecosystem design Digital ecosystem is a self-organizing infrastructure for creating digital environment. Similar to natural ecosystems, several digital ecosystems exist. This is due to differentiation and the development of native products and services tailored to specific local needs. Digital content is the core component of any digital ecosystem. As of now, most of the digital content focuses on only two senses. This paper highlights the significance of other senses which are to be incorporated in the creation of digital content to be used in the digital ecosystems.

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

multimedia
real virtuality
web 2.0
ehealth
virtual reality
elearning


Telescopic

projective

methods

for

parabolic

differential

equations

Projective

methods

were

introduced

in

an

earlier

paper

[C.W.

Gear,

I.G.

Kevrekidis,

Projective

Methods

for

Stiff

Differential

Equations:

problems

with

gaps

in

their

eigenvalue

spectrum,

NEC

Research

Institute

Report

available

from

Abbreviated

version

to

appear

in

SISC]

as

having

potential

for

the

efficient

integration

of

problems

with

a

large

gap

between

two

clusters

in

their

eigenvalue

spectrum,

one

cluster

containing

eigenvalues

corresponding

to

components

that

have

already

been

damped

in

the

numerical

solution

and

one

corresponding

to

components

that

are

still

active.

In

this

paper

we

introduce

iterated

projective

methods

that

allow

for

explicit

integration

of

stiff

problems

that

have

a

large

spread

of

eigenvalues

with

no

gaps

in

their

spectrum

as

arise

in

the

semi-discretization

of

PDEs

with

parabolic

components.

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


Using partwhole relations for automatic deduction of compound-internal relations in GermaNet This paper provides a deduction-based approach for automatically classifying compound-internal relations in GermaNet, the German version of the Princeton WordNet for English. More specifically, meronymic relations between simplex and compound nouns provide the necessary input to the deduction patterns that involve different types of compound-internal relations. The scope of these deductions extends to all four meronymic relations modeled in version 6.0 of GermaNet: component, member, substance, and portion. This deduction-based approach provides an effective method for automatically enriching the set of semantic relations included in GermaNet.

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

meronymy
holonymy
german wordnet
compounds
compound-internal relations


Active Learning and Effort Estimation: Finding the Essential Content of Software Effort Estimation Data Background: Do we always need complex methods for software effort estimation (SEE)? Aim: To characterize the essential content of SEE data, i.e., the least number of features and instances required to capture the information within SEE data. If the essential content is very small, then 1) the contained information must be very brief and 2) the value added of complex learning schemes must be minimal. Method: Our QUICK method computes the euclidean distance between rows (instances) and columns (features) of SEE data, then prunes synonyms (similar features) and outliers (distant instances), then assesses the reduced data by comparing predictions from 1) a simple learner using the reduced data and 2) a state-of-the-art learner (CART) using all data. Performance is measured using hold-out experiments and expressed in terms of mean and median MRE, MAR, PRED(25), MBRE, MIBRE, or MMER. Results: For 18 datasets, QUICK pruned 69 to 96 percent of the training data (median = 89 percent). K 1 nearest neighbor predictions (in the reduced data) performed as well as CART's predictions (using all data). Conclusion: The essential content of some SEE datasets is very small. Complex estimation methods may be overelaborate for such datasets and can be simplified. We offer QUICK as an example of such a simpler SEE method.

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


Chemical processes monitoring based on weighted principal component analysis and its application Conventional principal component analysis (PCA)-based methods employ the first several principal components (PCs) which indicate the most variances information of normal observations for process monitoring. Nevertheless, fault information has no definite mapping relationship to a certain PC and useful information might be submerged under the retained PCs. A new version of weighted PCA (WPCA) for process monitoring is proposed to deal with the situation of useful information being submerged and reduce missed detection rates of T-2 statistic. The main idea of WPCA is building conventional PCA model and then using change rate of T-2 statistic along every PC to capture the most useful information in process, and setting different weighting values for PCs to highlight useful information when online monitoring. Case studies on Tennessee Eastman process demonstrate the effectiveness of the proposed scheme and monitoring results are compared with conventional PCA method. (C) 2012 Elsevier B.V. All rights reserved.

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

chemical process monitoring
fault detection
fault diagnosis


The multiparametric 01-integer linear programming problem: A unified approach We designed an algorithm for the multiparametric 01-integer linear programming (ILP) problem with the perturbation of the constraint matrix, the objective function and the right-hand side vector simultaneously considered. Our algorithm works by choosing an appropriate finite sequence of non-parametric mixed integer linear programming (MILP) problems in order to obtain a complete multiparametrical analysis. The algorithm may be implemented by using any software capable of solving MILP 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

integer programming
parametric programming


A survey of Jensen type inequalities for functions of selfadjoint operators in Hilbert spaces The main aim of the present paper is to survey different inequalities for convex functions of selfadjoint operators in Hilbert spaces which have appeared recently in the literature. Applications for some particular convex functions of interest are also given.

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

positive operators
jensens inequality
functions of selfadjoint operators


towards energy-aware scheduling in data centers using machine learning As energy-related costs have become a major economical factor for IT infrastructures and data-centers, companies and the research community are being challenged to find better and more efficient power-aware resource management strategies. There is a growing interest in "Green" IT and there is still a big gap in this area to be covered. In order to obtain an energy-efficient data center, we propose a framework that provides an intelligent consolidation methodology using different techniques such as turning on/off machines, power-aware consolidation algorithms, and machine learning techniques to deal with uncertain information while maximizing performance. For the machine learning approach, we use models learned from previous system behaviors in order to predict power consumption levels, CPU loads, and SLA timings, and improve scheduling decisions. Our framework is vertical, because it considers from watt consumption to workload features, and cross-disciplinary, as it uses a wide variety of techniques. We evaluate these techniques with a framework that covers the whole control cycle of a real scenario, using a simulation with representative heterogeneous workloads, and we measure the quality of the results according to a set of metrics focused toward our goals, besides traditional policies. The results obtained indicate that our approach is close to the optimal placement and behaves better when the level of uncertainty increases.

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

simulation
machine learning
scheduling
data center


Coexpression and coregulation analysis of time-series gene expression data in estrogen-induced breast cancer cell Estrogen is a chemical messenger that has an influence on many breast cancers as it helps cells to grow and divide. These cancers are often known as estrogen responsive cancers in which estrogen receptor occupies the surface of the cells. The successful treatment of breast cancers requires understanding gene expression, identifying of tumor markers, acquiring knowledge of cellular pathways, etc. In this paper we introduce our proposed triclustering algorithm ?-TRIMAX that aims to find genes that are coexpressed over subset of samples across a subset of time points. Here we introduce a novel mean-squared residue for such 3D dataset. Our proposed algorithm yields triclusters that have a mean-squared residue score below a threshold ?.

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

time series gene expression data
tricluster
mean-squared residue
eigengene
affirmation score
gene ontology
kegg pathway
transfac


Interruption modelling in medium voltage electrical networks Failures frequently occur in developing countries' electrical energy distribution networks. This paper proposes an approach to network reliability through modelling the interruptions on medium voltage lines. This modelling is based on a representative feeder sampling of a source station in an urban area. In order to determine the probability law governing these interruptions, statistical techniques were used: density estimation using the kernel method and approximation by the least squares. The results we obtained show that, from the quality of the equipment and their maintenance, interruptions for a given network follow a truncated and shifted gamma distribution or a truncated normal law. For the managers of such systems, these results would allow, amongst other things, reduction in the probability of failure, thus improving operational safety on electricity distribution with medium voltage lines.

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

interruption
medium voltage
probability law