striping in disk array rm2 enabling the tolerance of double disk failures There is a growing demand in high reliability beyond what current RAID can provide and there are various levels of user demand for data reliability. An efficient data placement scheme called RM2 has been proposed in \cite{Park95}, which makes a disk array system tolerable against double disk failures. In this paper, we consider how to choose an optimal striping unit for RM2 particularly when no workload information is available except read/write ratio. A disk array simulator for RM2 has been developed for experimental works. It is shown that RM 2 has an optimal striping unit of two and half tracks in the case of disk read operations, and one third of a single track if any disk write operations are involved.

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

data placement
striping
reliability
disk array


A study on the classified model and the agent collaboration model for network configuration fault management This study presents the management model to manage network configuration fault in system and diagnosis and recovery algorithm through collaboration among the agents. The management model comprises three stages of detection, diagnosis, and recovery, and each uses a set of rule in Rule-Based Reasoning database to diagnose and recover the network configuration fault. And, it also presents the effective network configuration managing algorithm in system by overcoming the fault which cannot be figured out by system alone, and diagnosing and recovering it under consideration of network condition, by means of the collaboration among a number of agents distributed in network on management domain.

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

network configuration fault of system
rule-based reasoning
fault detection
fault diagnosis
fault recovery
knowledge-based management
agent collaboration


Biomedical knowledge navigation by literature clustering There is an urgent need for a system that facilitates surveys by biomedical researchers and the subsequent formulation of hypotheses based on the knowledge stored in literature. One approach is to cluster papers discussing a topic of interest and reveal its sub-topics that allow researchers to acquire an overview of the topic. We developed such a system called McSyBi. It accepts a set of citation data retrieved with PubMed and hierarchically and non-hierarchically clusters them based on the titles and the abstracts using statistical and natural language processing methods. A novel point is that McSyBi allows its users to change the clustering by entering a MeSH term or UMLS Semantic Type, and therefore they can see a set of citation data from multiple aspects. We evaluated McSyBi quantitatively and qualitatively: clustering of 27 sets of citation data (40643 different papers) and scrutiny of several resultant clusters. While non-hierarchical clustering provides us with an overview of the target topic, hierarchical clustering allows us to see more details and relationships among citation data. McSyBi is freely available at http://textlens.hgc.jp/McSyBi/.

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

text-mining
automatic labeling
summarization


Adaptive overcurrent relay coordination for off-peak loading in interconnected power system Use SCADA system for adaptive relay protection. Off-peak load current and fault current are considered for relay coordination. Propose an adaptive relay protection method for off-peak loading power system.

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

scada
overcurrent relay
relay coordination


Generalized high speed ItohTsujii multiplicative inversion architecture for FPGAs Among all finite field operations, finite field inversion is the most computationally intensive operation. Yet, it is an essential component of several public-key cryptographic algorithms such as elliptic curve cryptography. For hardware implementations over extended binary fields, the ItohTsujii inversion algorithm (ITA) is the most efficient. In this paper we propose acceleration techniques for ITA on FPGA platforms. We first propose a generalization of the parallel ITA which uses exponentiation by 2n and 2n, where n?1 n ? 1 . Parallel ITA has several drawbacks which limit its speed. We propose a novel technique supported with theoretical analysis to overcome the drawbacks. The technique reduces the critical delay of the ITA architecture without increasing the clock cycle requirement. Experimental results are presented to show that the proposed technique outperforms reported results.

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


At the crossroads of evolutionary computation and music: Self-programming synthesizers, swarm orchestras and the origins of melody This paper introduces three approaches to using Evolutionary Computation (EC) in Music (namely, engineering, creative and musicological approaches) and discusses examples of representative systems that have been developed within the last decade, with emphasis on more recent and innovative works. We begin by reviewing engineering applications of EC in Music Technology such as Genetic Algorithms and Cellular Automata sound synthesis, followed by an introduction to applications where EC has been used to generate musical compositions. Next, we introduce ongoing research into EC models to study the origins of music and detail our own research work on modelling the evolution of melody.

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

self-programming audio synthesizers
cellular automata music
generative music
evolution of music
adaptive behaviour
cultural evolution


Teaching programming by teaching principles of reusability1 Teaching how to program is difficult, but we believe it can be made easier by concentrating on principles of software reusability. Our teaching strategy is based on a conceptual model of reusability that explains how features of programming languages support the creation of reusable software. The strategy has several advantages because it promotes a deep but practical understanding, and allows objective comparison and assessment. This paper outlines our approach in detail, and discusses our experience.

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


AN EMOTION-PROCESSING SYSTEM BASED ON FUZZY INFERENCE AND ITS SUBJECTIVE OBSERVATIONS The history of the development of emotion psychology, especially the two theories concerning mired emotions adopted in this research, is briefly explained. Also discussed are the image codes linked to the mired emotional words and the way to realize a mechanism using fuzzy inference, in which the internal emotion of a simulated person reacts on a sequence of inputted terms and evokes some emotional change. It is shown that the fuzzy inference technique is very useful and applicable even to such a flexible human life system as emotion. In the next section, the relevant part of the theory for the subjective observation model (Yanaru et al. [1]) to the application of the emotion-processing system is briefly explained. The construction methodology of the system, which has two functions, is described; one function is that the evoked emotion is transitive depending on the observation, and the other is that the aggregated emotion by the several subjective observations settles to the objective emotion. In conclusion, some attractive results obtained from the simulated emotion-processing system are shown: what kinds of emotions are evoked and how the emotional transition is done by subjective observations, when a poem is used for the input signal.

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

emotion psychology
subjective observation model
fuzzy inference


A new optimization phase for scientific workflow management systems Proposal of a novel optimization phase to the common scientific workflow life cycle. Development of an automated optimization framework implementing the optimization phase. Plugin mechanism to support the development of arbitrary optimization methods. Implementation of a Genetic Algorithm-based parameter optimization plugin. Optimization of two use cases to demonstrate ease of use and computational efficiency.

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

e-science
workflow optimization
taverna
genetic algorithm


Random Spanning Trees and the Prediction of Weighted Graphs We investigate the problem of sequentially predicting the binary labels on the nodes of an arbitrary weighted graph. We show that, under a suitable parametrization of the problem, the optimal number of prediction mistakes can be characterized (up to logarithmic factors) by the cutsize of a random spanning tree of the graph. The cutsize is induced by the unknown adversarial labeling of the graph nodes. In deriving our characterization, we obtain a simple randomized algorithm achieving in expectation the optimal mistake bound on any polynomially connected weighted graph. Our algorithm draws a random spanning tree of the original graph and then predicts the nodes of this tree in constant expected amortized time and linear space. Experiments on real-world data sets show that our method compares well to both global (Perceptron) and local (label propagation) methods, while being generally faster in practice.

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

online learning
learning on graphs
graph prediction


Linear circuits, two-variable logic and weakly blocked monoids Following recent works that connect two-variable logic to circuits and monoids, as well as recent techniques for obtaining algebraic and logical characterizations of threshold circuits, we present an algebraic and logical characterization of the language recognition power of uniform linear threshold circuits. More specifically, for numerical predicate sets 93 satisfying a certain closure property, we characterize the class of languages recognized by FO[<, (sic)]-uniform linear threshold circuits as exactly those which are recognized by a particular class of two-variable formulas that use majority quantifiers and (sic) predicates, and are exactly those which can be recognized by a particular class of weakly blocked products of typed monoids. This correspondence will hold for any numerical predicate set which is FO[<]-closed and whose predicates do not depend on the input length. (C) 2013 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

bounded-depth circuits
linear ciruits
two-variable logic


software agents to support mobile services The paper discusses mobile services (m-services) in the wireless world. This world has its own features that make it different from the wired world. For instance, new communication channels need to be used, new user-friendly services need to be suggested, and new types of computing resources need to be involved. The paper also discusses the use of software agents in addressing those features.

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


A load balanced parallel ground visualization tool We propose in this paper, a parallel implementation of a ground visualization algorithm. Our input data consist in a Digital Elevation Model (DEM) covering a rectangular region, together with a raster image of the same area (the texture). The goal of the algorithm is to compute in parallel, images of the DEM from any point of view while mapping the texture onto the surface. The main originality of our approach concerns the distribution of the data, leading to a load-balanced and scalable parallel algorithm. We use a workload estimation to partition the output image, and then redistribute the input data according to this division. Special attention is paid on the data structures used for minimizing the cost of communications.

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

parallelism
3d visualization
texture-mapping
load balancing
data repartition


quantum algorithms using the curvelet transform The curvelet transform is a directional wavelet transform over R n , which is used to analyze functions that have singularities along smooth surfaces (Candes and Donoho, 2002). I demonstrate how this can lead to new quantum algorithms. I give an efficient implementation of a quantum curvelet transform, together with two applications: a single-shot measurement procedure for approximately finding the center of a ball in R n , given a quantum-sample over the ball; and, a quantum algorithm for finding the center of a radial function over R n , given oracle access to the function. I conjecture that these algorithms succeed with constant probability, using one quantum-sample and O(1) oracle queries, respectively, independent of the dimension n -- this can be interpreted as a quantum speed-up. To support this conjecture, I prove rigorous bounds on the distribution of probability mass for the continuous curvelet transform. This shows that the above algorithms work in an idealized "continuous" model.

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

fourier transform
wavelets
oracle problems
quantum computation
radial functions


Automated web service query service A data providing web service returns a collection of objects without any side effects. The Web Service MEDiator (WSMED) system provides general SQL query capabilities. To make any data providing system into a data providing web service WSMED includes a web service generator that automatically deploys the operations required to access a data source. The web service generator is used also for defining the web service interface to WSMED itself to provide SQL query functionality to query and join any data providing web services. Search of any data providing web service from a browser can be done without any need for installing software.

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

views of web service operations
web service queries
adaptive parallelisation
query optimisation


Can Malaysian firms improve organizational/innovation performance via SCM? Purpose - The purpose of this paper is to empirically test a framework which identifies the relationships between supply chain management (SCM) practices, operational performance and innovation performance of Malaysian manufacturing and service firms. Design/methodology/approach - Data for the study were collected from a sample of 163 Malaysian manufacturing and service firms. The research model was tested using structural equation modeling. Findings - The results show that SCM practices in both the upstream and downstream supply chain have a direct and significant impact on organizational and innovation performance of Malaysian firms. Innovation improvement caused by SCM also results in better organizational performance. The findings also reveal that manufacturing and service firms in Malaysia do not have a significant difference in their SCM practices. Research limitations/implications - The time sequence of the association between the variables could not be concluded given that cross-sectional data were used. This study also focuse only on Malaysian firms. Practical implications - This paper shows the importance of SCM practices and how they directly influence organizational and innovation performance. This result will be encouraging to firms in other developing countries. This paper has developed and validated a multi-dimensional construct of SCM practices, and this tool can assist decision makers of Malaysian firms to evaluate the efficiency of their current SCM practices. Originality/value - The paper presents one of the few studies which empirically validates the relationships between SCM practices and organizational and innovation performances. The study also focuses on a developing country which is in transition from being manufacturing focused to service focused.

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

supply chain management
organizational performance
malaysia
developing countries


Aperiodic Tilings with One Prototile and Low Complexity Atlas Matching Rules We give a constructive method that can decrease the number of prototiles needed to tile a space. We achieve this by exchanging edge-to-edge matching rules for a small atlas of permitted patches. This method is illustrated with Wang tiles, and we apply our method to present via these rules a single prototile that can only tile a"e(3) aperiodically, and a pair of square tiles that can only tile a"e(2) aperiodically.

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


THE INFLUENCE OF THE INFORMATION-SYSTEMS DEVELOPMENT APPROACH ON MAINTENANCE This is an exploratory field study that examines the influence of selected system development methodologies on maintenance time. A number of factors related to the early stages of information systems development and to information systems maintenance were investigated: development methodology, maintenance time and its allocation, number of users, their understanding and involvement, system documentation, software quality, system characteristics, project controllability system size and age, organization of the maintenance function, use of tools, ability of personnel, stability of organization, and others. The survey findings do not support the proposition that the application of modern information systems development methodology decreases maintenance time. However, some benefits are identified. Time spent on emergency error correction, as well as the number of system failures, decreased significantly with the application of modem methodology Systems developed with modern methodologies seem to facilitate making greater changes in functionality as the systems age.

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

software maintenance
software engineering
systems development
systems analysis
systems maintenance


Defining and measuring the productivity of programming languages The goal of programming support systems is to make it possible for application developers to produce software faster, without any degradation in software quality. However, it is essential that this goal must not be achieved at the cost of performance: programs written in a high-level language and intended to solve large problems on highly parallel machines must not be egregiously less efficient than the same applications written in a lower-level language. Because this has been a traditional stumbling block for high-level languages, metrics for productivity analysis must explore the trade-off between programming effort and performance. To that end, we propose the use of two dimensionless ratios, relative power and relative efficiency, to measure the productivity of programming interfaces. In this paper we define these concepts, describe their application, and explore various ways for measuring them, including both empirical strategies and expert opinion. Rather than combine these metrics into a single number representing a universal productivity, we propose that they be represented graphically in at least two dimensions so that the trade-offs between abstraction and performance are clearly depicted. However, we also introduce a single problem-dependent parameter that allows us to reason about the relative productivity of two languages for a given problem.

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

productivity measurement
performance metrics
programming language effectiveness


Fractional-order derivative spectroscopy for resolving simulated overlapped Lorenztian peaks In this paper, by using the Haar wavelet as a tool, we design a fractional-order differential filter to develop the fractional-order derivative spectroscopy (FDS), and then we use it to resolve the overlapped Lorentzian peaks. Resolutions are directly characterized by spectral parameters extracted from the overlapped peaks. Comparison results between our method and the Peakfit software indicate the FDS can be used to resolve overlapped Lorentzian peaks effectively and satisfactorily. Crown Copyright (C) 2011 Published by Elsevier B.V. All rights reserved.

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

overlapped lorentzian peaks
haar wavelet


An Adaptive Write Buffer Management Scheme for Flash-Based SSDs Solid State Drives (SSD's) have shown promise to be a candidate to replace traditional hard disk drives. The benefits of SSD's over HDD's include better durability, higher performance, and lower power consumption, but due to certain physical characteristics of NAND flash, which comprise SSD's, there are some challenging areas of improvement and further research. We focus on the layout and management of the small amount of RAM that serves as a cache between the SSD and the system that uses it. Of the techniques that have previously been proposed to manage this cache, we identify several sources of inefficient cache space management due to the way pages are clustered in blocks and the limited replacement policy. We find that in many traces hot pages reside in otherwise cold blocks, and that the spatial locality of most clusters can be fully exploited in a limited time period, so we develop a hybrid page/block architecture along with an advanced replacement policy, called BPAC, or Block-Page Adaptive Cache, to exploit both temporal and spatial locality. Our technique involves adaptively partitioning the SSD on-disk cache to separately hold pages with high temporal locality in a page list and clusters of pages with low temporal but high spatial locality in a block list. In addition, we have developed a novel mechanism for flash-based SSD's to characterize the spatial locality of the disk I/O workload and an approach to dynamically identify the set of low spatial locality clusters. We run trace-driven simulations to verify our design and find that it outperforms other popular flash-aware cache schemes under different workloads. For instance, compared to a popular flash aware cache algorithm BPLRU, BPAC reduces the number of cache evictions by up to 79.6% and 34% on average.

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

measurement
nand flash memory
flash-aware cache


Integrating craft materials and computation ? Traditionally, the notion of home crafting connotes the use of low-tech materials and techniques; but increasingly, the once-distinct worlds of crafting and computational media have become integrated, to the mutual benefit of both cultures. In this paper, we discuss a wide range of recurring issues in the integration of crafts and computation, drawing upon a variety of related research projects. In particular, we explore the ways in which attention to computational crafts can encourage a productive re-examination of such notions as programming languages, computer architectures, and peripheral devices.

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

computation and crafts
hypergami
hyperspider
computationally enriched craft items


Absolute conductivity reconstruction in magnetic induction tomography using a nonlinear method Magnetic induction tomography (MIT) attempts to image the electrical and magnetic characteristics of a target using impedance measurement data from pairs of excitation and detection coils. This inverse eddy current problem is nonlinear and also severely ill posed so regularization is required for a stable solution. A regularized Gauss-Newton algorithm has been implemented as a nonlinear, iterative inverse solver. In this algorithm, one needs to solve the forward problem and recalculate the Jacobian matrix for each iteration. The forward problem has been solved using an edge based finite element method for magnetic vector potential A and electrical scalar potential V, a so called A, A - V formulation. A theoretical study of the general inverse eddy current problem and a derivation, paying special attention to the boundary conditions, of an adjoint field formula for the Jacobian is given. This efficient formula calculates the change in measured induced voltage due to a small perturbation of the conductivity in a region. This has the advantage that it involves only the inner product of the electric fields when two different coils are excited, and these are convenient computationally. This paper also shows that the sensitivity maps change significantly when the conductivity distribution changes, demonstrating the necessity for a nonlinear reconstruction algorithm. The performance of the inverse solver has been examined and results presented from simulated data with added noise.

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

conductivity measurement
eddy currents
electromagnetic tomography
inverse problems


A hybrid condensed finite element model with GPU acceleration for interactive 3D soft tissue cutting To meet the requirement of computer-aided medical operations, apart from the real-time deformation, it is also necessary in the design to simulate the tissue cutting and suturing in a surgery simulation. In this paper, we present a model on topology change and deformation of soft tissue, referred to as the hybrid condensed finite element model, based on the volumetric finite element method. The most important advantage of our model is its ability to achieve an interactive frame rate for the topology change in surgical simulation on standard PC platform. This is achieved through two innovations. One is to apply the condensation technique, by fully calculating the volumetric deformation in the operation part while only calculating the surface nodes in the non-operation part. Secondly, the major calculation work in the Conjugate Gradient solver for cutting and deformation is migrated from the CPU to the contemporary GPU to promote the calculation. Test examples have been given to show the feasibility and efficiency of the model. Copyright (C) 2004 John Wiley Sons, Ltd.

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

soft tissue cutting and deformation
the gpu computation


Analysis of water seepage in a pavement system using the particulate approach A particulate model has been developed to analyze the effects of transient and steady state seepage of water through a randomly-packed coarse-grained soil as an alternative to conventional seepage analysis based on continuum models. In this model, the soil skeleton and the pore water are volumetrically coupled in the transient and steady-state conditions. The concept of relative density has been used to define different compaction levels of the soil layers forming a pavement filter system and observe the seepage response to compaction. First, MonteCarlo simulation is used to randomly pack discrete spherical particles from a specified particle size distribution (PSD) to achieve a desired relative density based on the theoretical minimum and maximum void ratios. Then, a water pressure gradient is applied across one two-layer unit to trigger water seepage. The interstitial pore water motion is idealized using NavierStokes (NS) equations with provision to incorporate the drag forces acting between the pore fluid and soil particles. The NS equations are discretized using finite differences and applied to discrete elements in a staggered, structured grid. The model predicted hydraulic conductivities are validated using widely used equations. Critical water velocities, hydraulic gradients and flow within the randomly-packed soil layers are identified under both steady state and transient conditions. Significantly critical transient conditions are observed prior to reaching the steady-state conditions. Moreover, any localized poorly-compacted areas are seen to be subjected to excessive hydraulic gradients and hence, higher likelihood of erosion. Since, the reported research effort involves modeling of the very properties that cause instability of earthen structures such as seepage induced piping, internal erosion and uplift in a particulate medium, it can be envisioned that the current results would provide insight into issues concerning the malfunction of earthen structures.

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

finite difference
navierstokes equations
volumetric compatibility
staggered grid
critical localized conditions


Optimal switching between controlled subsystems with free mode sequence The problem of optimal switching and control of nonlinear switching systems with controlled subsystems is investigated in this study where the mode sequence and the switching times between the modes are unspecified. An approximate dynamic programming based method is developed which provides a feedback solution for unspecified initial conditions and different final times. The convergence of the proposed algorithm is proved. Versatility of the method and its performance are illustrated through different numerical examples.

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

optimal switching
approximate dynamic programming


VIRTEC: An example of a Brazilian virtual organization In response to increasing international competition, enterprises have been investigating new integration processes to maintain their competitive position. In this context, the virtual enterprise (VE) represents an appropriate cooperation alternative and competitive advantage for small and medium enterprises (SMEs). An analysis of the Brazilian context of SMEs indicates that many small high technology enterprises have failed for lack of technical and and management competencies. In general, virtual enterprises and their cooperation-based form of organization can be considered adequate to overcome these deficiencies and to support the formation of high technology-based enterprises. This paper describes the VIRTEC project, a pioneering Brazilian virtual organization, within the approach of the global virtual business framework. This report begins with an outline of the context of Brazilian SMEs, providing the setting of the project. This is followed by a description of the project itself, including its various steps. The paper concludes by listing the benefits achieved to date.

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

virtual organization
virtual enterprise
management competencies


A Hybrid Control Approach for Non-invasive Medical Robotic Systems In this paper, a hybrid supervisory control approach adopted for a non-invasive medical robot called Focused Ultrasound Surgical Robot-Breast Surgery (FUSBOT-BS) is elaborated. The system was built for the use in the breast surgery with high intensity focused ultrasound (HIFU) as the means of the treatment. A number of different control strategies such as PID and model-based control were incorporated into a family of controllers to create the hybrid control. Depending on the objective, the supervisory control determines the type of controller used for the specified task so as to maximize the advantages of each of the controllers. Before it was implemented into the actual robotic system the then proposed control approach was modeled and simulated using MatlabA (R). This control approach was developed based on a review of popular control approaches used in medical robotic systems, in order to look at the feasibility of having a uniform control strategy for a spectrum of medical robotic system. With unified control strategy it is possible to have a safety standard regulation for the medical robotic systems which is currently difficult to be done because of various control strategies adopted by each of the medical robotic systems.

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

hybrid control
medical robotic systems
high intensity focused ultrasound


Robust and accurate filtered spherical harmonics expansions for radiative transfer We present a novel application of filters to the spherical harmonics (PN) expansion for radiative transfer problems in the high-energy-density regime. The filter we use is based on non-oscillatory spherical splines and a filter strength chosen to (i) preserve the equilibrium diffusion limit and (ii) vanish as the expansion order tends to infinity. Our implementation is based on modified equations that are derived by applying the filter after every time step in a simple first-order time integration scheme. The method is readily applied to existing codes that solve the PN equations. Numerical results demonstrate that the solution to the filtered PN equations are (i) more robust and less oscillatory than standard PN solutions and (ii) more accurate than discrete ordinates solutions of comparable order. In particular, the filtered P7 solution demonstrates comparable accuracy to an implicit Monte Carlo solution for a benchmark hohlraum problem in 2D Cartesian geometry.

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


Determination of relative agrarian technical efficiency by a dynamic over-sampling procedure guided by minimum sensitivity In this paper, a dynamic over-sampling procedure is proposed to improve the classification of imbalanced datasets with more than two classes. This procedure is incorporated into a Hybrid algorithm (HA) that optimizes Multi Layer Perceptron Neural Networks (MLPs). To handle class imbalance, the training dataset is resampled in two stages. In the first stage, an over-sampling procedure is applied to the minority class to partially balance the size of the classes. In the second, the HA is run and the dataset is over-sampled in different generations of the evolution, generating new patterns in the minimum sensitivity class (the class with the worst accuracy for the best MLP of the population). To evaluate the efficiency of our technique, we pose a complex problem, the classification of 1617 real farms into three classes (efficient, intermediate and inefficient) according to the Relative Technical Efficiency (RTE) obtained by the Monte Carlo Data Envelopment Analysis (MC-DEA). The multi-classification model, named Dynamic Smote Hybrid Multi Layer Perceptron (DSHMLP) is compared to other standard classification methods with an over-sampling procedure in the preprocessing stage and to the threshold-moving method where the output threshold is moved toward inexpensive classes. The results show that our proposal is able to improve minimum sensitivity in the generalization set (35.00%) and obtains a high accuracy level (72.63%).

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

neural networks
sensitivity
accuracy
hybrid algorithm
imbalanced datasets
smote

multi-classification
dea-montecarlo
oversampling method
aps


Acquisition of time-varying 3D foot shapes from video The 3D scanning of time-varying objects based on multi-view geometry has been a hot topic in computer vision in recent years. This paper presents an active approach to acquiring 3D shapes of moving foot from multi-view video sequences based on the explicit marker points woven in socks. The reference 3D model of foot is firstly recovered from the starting frames in the multi-view video clips, and then the markers in each view are traced as a whole based on a continuous motion vector field built from the reference 3D model. The missing vertices in the candidate 3D model caused by self-occlusion, non-uniform illumination and random noises are reliably estimated and reconstructed in 3D space by minimizing the changes of differential features in 3D geometry of the reference model. The experimental results show that our method can robustly recover the 3D model of foot in complex background even if there is a relatively large movement between the adjacent frames, with an acceptable accuracy of the resulting 3D model.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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-varying shapes
3d foot modeling
feature tracking
multi-view geometry


On the concentration of the number of solutions of random satisfiability formulas Let Z(F) be the number of solutions of a random k-satisfiability formula F with n variables and clause density ?. Assume that the probability that F is unsatisfiable is for some . We show that (possibly excluding a countable set of exceptional ?'s) the number of solutions concentrates, i.e., there exists a non-random function such that, for any , we have with high probability. In particular, the assumption holds for all , which proves the above concentration claim in the whole satisfiability regime of random 2-SAT. We also extend these results to a broad class of constraint satisfaction problems. 2013 Wiley Periodicals, Inc. Random Struct. Alg., 45, 362382, 2014

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

constraint satisfaction problems
satisfiability
concentration

counting
sharp threshold
interpolation method


Polyhedral Structure of the 4-Node Network Design Problem This article studies the polyhedral structure of the 4-node network design problem (NDP). Using a theorem from the previous work of this author, the facets of the 4-node NDP can be translated into facets of larger size problems. The knowledge of complete polyhedral description of the 4-node NDP is important because it implies complete knowledge of 4-partition-based facets of larger NDPs. After reviewing the previously known facets of the 4-node NDP, a new class of facets is derived. An enumerative methodology is presented for determining whether a given set of inequalities provides a complete polyhedral description. By implementing this methodology in a computer code, it is determined that the known facets of the 4-node NDP indeed provide a complete polyhedral description of the problem. Working of the proof methodology is illustrated with examples, and the results of the computer enumeration are reported. (C) 2009 Wiley Periodicals, Inc. NETWORKS, Vol. 54(3),139-149 2009

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

facet inequality
multicommodity
integer programming
k-partition


Hybrid models in agent-based environmental decision support Providing informational support in decision making is one of the priority directions of research in the sphere of public health management. Modern approaches suggest wide usage of intelligent data mining methods and Web-services, but just a few enable to study a complex system from an interdisciplinary point of view. In this paper an agent-based decision support system (ADSS), which embodies the principles of the interdisciplinary approach and facilitates multi-focal view and examination of the EnvironmentPublic health system, is introduced. The detailed design of the system with the emphasis on the roles, scenarios and its implementation is presented. The data mining procedures used for data preparation, modeling and simulation, which include statistics, methods of artificial intelligence and hybrid models in form of cascade committee machines, are described. Then, the advantages of the proposed hybrid models against singular modeling methods are demonstrated. Finally, a case study for a selected region is presented and its results are discussed.

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

human health
environmental pollution
decision support systems
multi-agent systems


A hierarchical fuzzygenetic multi-agent architecture for intelligent buildings online learning, adaptation and control In this paper, we describe a new application domain for intelligent autonomous systemsintelligent buildings (IB). In doing so we present a novel approach to the implementation of IB agents based on a hierarchical fuzzy genetic multi-embedded-agent architecture comprising a low-level behaviour based reactive layer whose outputs are co-ordinated in a fuzzy way according to deliberative plans. The fuzzy rules related to the room resident comfort are learnt and adapted online using our patented fuzzygenetic techniques (British patent 99-10539.7). The learnt rule base is updated and adapted via an iterative machine-user dialogue. This learning starts from the best stored rule set in the agent memory (Experience Bank) thereby decreasing the learning time and creating an intelligent agent with memory. We discuss the role of learning in building control systems, and we explain the importance of acquiring information from sensors, rather than relying on pre-programmed models, to determine user needs. We describe how our architecture, consisting of distributed embedded agents, utilises sensory information to learn to perform tasks related to user comfort, energy conservation, and safety. We show how these agents, employing a behaviour-based approach derived from robotics research, are able to continuously learn and adapt to individuals within a building, whilst always providing a fast, safe response to any situation. In addition we show that our system learns similar rules to other offline supervised methods but that our system has the additional capability to rapidly learn and optimise the learnt rule base. Applications of this system include personal support (e.g. increasing independence and quality of life for older people), energy efficiency in commercial buildings or living-area control systems for space vehicles and planetary habitation modules.

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

intelligent buildings
agents
online learning


A new application of Hes variational iteration method for the solution of the one-phase Stefan problem In this paper, we will use the variational iteration method to find an approximate solution of a one-phase Stefan problem. This problem consists in finding the distribution of temperature in the domain and the position of a moving interface. The problem under consideration is at first approximated with a system of differential equations in a domain with known boundary, and next, the system constructed in this way is solved by the variational iteration method. The validity of the approach is verified by comparing the results obtained with an analytical solution.

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

stefan problem
variational iteration method


Children, Robots and... the Parental Role The raison dtre of this article is that many a spry-eyed analyst of the works in intelligent computing and robotics fail to see the essential concerning applications development, that of expressing their ultimate goal. Alternatively, they fail to state it suitably for the lesser-informed public eye. The author does not claim to be able to remedy this. Instead, the visionary investigation offered couples learning and computing with other related fields as part of a larger spectre to fully simulate people in their embodied image. For the first time, the social roles attributed to the technical objects produced are questioned, and so with a humorous illustration.

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

cognitive epistemology
communicative reciprocity
reductio ad absurdum
relation
variant machine intelligence


detecting code clones in binary executables Large software projects contain significant code duplication, mainly due to copying and pasting code. Many techniques have been developed to identify duplicated code to enable applications such as refactoring, detecting bugs, and protecting intellectual property. Because source code is often unavailable, especially for third-party software, finding duplicated code in binaries becomes particularly important. However, existing techniques operate primarily on source code, and no effective tool exists for binaries. In this paper, we describe the first practical clone detection algorithm for binary executables. Our algorithm extends an existing tree similarity framework based on clustering of characteristic vectors of labeled trees with novel techniques to normalize assembly instructions and to accurately and compactly model their structural information. We have implemented our technique and evaluated it on Windows XP system binaries totaling over 50 million assembly instructions. Results show that it is both scalable and precise: it analyzed Windows XP system binaries in a few hours and produced few false positives. We believe our technique is a practical, enabling technology for many applications dealing with binary code.

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


Changing people's attitudes: personal views (Reprinted from Computer Standards and Interfaces, vol 10, pg 29-36, 1990) A workshop session at the INSITS conference in Braunschweig in 1989, considered the need for and ways of changing people's attitudes to IT standardisation. The workshop concluded that it was perceptions, more than attitudes, that needed changing. This paper, however, argues that there are in fact wrong attitudes to standardisation which are frequently encountered in the IT community, and that means of changing suds attitudes deserve serious attention. A number of wrong attitudes are identified, and means are discussed of countering them directly, evading their harmful effects, or if necessary diverting them to advance rather than impede standardisation. (C) 1999 Elsevier Science B.V. All rights reserved.

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

professional status of standards making within it

incentives to support and use it standards


Quality documentation and records management: a survey of Turkish universities Purpose - The purpose of this paper is to assess the records system of a Turkish public university, using the example of Hacettepe University in order to develop records management programs in Turkish universities. Design/methodology/approach - A survey method is used in this research; data are gathered through literature reviews, legal analysis, questionnaires, and interviews. Analyzing the information gathered concerning the differences and commonalities of the systems will allow researchers to develop solutions for records management. Findings - The paper finds that institutional processes in Turkish public universities relating to records are not able to meet legal and administrative requirements, and this inadequacy resulted from erroneous applications, insufficient legal regulations, lack of quality-based administrative structure, ineffective records management systems, and unqualified staff. Originality/value - This paper uses analysis techniques specific to the records management and quality management fields in order to provide information about the administrative systems needed for quality-based systems documentation.

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

records management
quality management
universities


On fuzzy pseudo-metric spaces This paper attempts to endow the fuzzy pseudo-metric in the sense of George and Veeramani with many-valued topological structures. It is shown that George and Veeramani's fuzzy pseudo-metric can be characterized by a family of compatible ordinary pseudo-metrics called pseudo-metric chain in this paper. Then, two kinds of many-valued topological structures-fuzzifying topology and fuzzifying uniformity-are generated by this fuzzy pseudo-metric, and their properties are also investigated. (C) 2009 Elsevier B.V. All rights reserved.

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

fuzzy pseudo-metric
generalized neighborhood system
fuzzifying topology
fuzzifying uniformity


Testing fuzzy hypotheses based on fuzzy test statistic A new approach for testing fuzzy parametric hypotheses based on fuzzy test statistic is introduced. First, we define some models representing the extended versions of the simple, the one-sided and the two-sided crisp hypotheses to the fuzzy ones. Then, we provide a confidence interval for interested parameter, and using alpha-cuts of the fuzzy null hypothesis, we construct the related fuzzy test statistic. Finally, by introducing a credit level, we can decide to accept or reject the fuzzy hypothesis. The method is applied to test the fuzzy hypotheses for the mean of a normal distribution, the variance of a normal distribution, and the mean of a Poisson distribution.

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

credit level
fuzzy hypothesis
fuzzy test statistic


A simulation analysis of the impact of FAHP-MAUT triage algorithm on the Emergency Department performance measures Emergency Department (ED) crowding is a major problem in the U.S. like in many other countries worldwide. This problem is adversely affecting the safety of the patients who rely on receiving a timely treatment in EDs. As a part of solving this problem, a triage process is utilized. Triage is a pre-hospital process by which patients are sorted according to the severity of their illnesses or injuries. Improvements to this process would affect the patient flow positively, and in turn would enhance patient satisfaction and quality of care. In a previous study, we developed a triage algorithm that uses Fuzzy Analytic Hierarchy Process (FAHP) and Multi-Attribute Utility Theory (MAUT) to rank the patients according to their characteristics: chief complaint, age, gender, pain level, and vital signs. The main purpose of this study is to compare two triage systems using Discrete Event Simulation (DES); one system uses the typical Emergency Severity Index (ESI), and the other uses the FAHP and MAUT algorithm. Overall, there was no strong statistical evidence that either system would do better than the other for all the performance measures when the average is taken across all ESI levels. On the other hand, the collected simulated data by each ESI level showed that the FAHP-MAUT algorithm tends to balance the time-to-bed (TTB) and length of stay (LOS) for ESI levels 2-5. In terms of the percentage of tardy patients, FAHP-MAUT system significantly outperforms the ESI system for ESI levels 4 and 5; 34% vs. 61% and 25% vs. 70%, respectively. Both systems were performing about equally for ESI level 1 and level 3 patients; 25% vs. 26% and 64% vs. 67%. respectively. While ESI system slightly outperforms FAHP-MAUT system for ESI level 2 patients, 56% vs. 66%. Based on these results, we recommend using FAHP-MAUT not only because it performs better in terms of minimizing the number of patients with longer than the allotted upper limits of wait times, but also it reduces potential bias and errors in decision making in clinical settings; and thus, it can be used as the basis of an expert system to advise triage nurses. (C) 2012 Elsevier Ltd. All rights reserved.

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

discrete event simulation (des)
emergency department (ed)
emergency severity index (esi)
fuzzy analytic hierarchy process (fahp)
multi-attribute utility theory (maut)


Updating attribute reduction in incomplete decision systems with the variation of attribute set In rough set theory, attribute reduction is a challenging problem in the applications in which data with numbers of attributes available. Moreover, due to dynamic characteristics of data collection in decision systems, attribute reduction will change dynamically as attribute set in decision systems varies over time. How to carry out updating attribute reduction by utilizing previous information is an important task that can help to improve the efficiency of knowledge discovery. In view of that attribute reduction algorithms in incomplete decision systems with the variation of attribute set have not yet been discussed so far. This paper focuses on positive region-based attribute reduction algorithm to solve the attribute reduction problem efficiently in the incomplete decision systems with dynamically varying attribute set. We first introduce an incremental manner to calculate the new positive region and tolerance classes. Consequently, based on the calculated positive region and tolerance classes, the corresponding attribute reduction algorithms on how to compute new attribute reduct are put forward respectively when an attribute set is added into and deleted from the incomplete decision systems. Finally, numerical experiments conducted on different data sets from UCI validate the effectiveness and efficiency of the proposed algorithms in incomplete decision systems with the variation of attribute set.

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

rough set
attribute reduction
incomplete decision systems
positive region


On the implication of multivalued dependencies in partial database relations The implication of multivalued dependencies (MVDs) in relational databases has originally and independently been defined in the context of some fixed finite universe by Delobel, Fagin, and Zaniolo. Biskup observed that the original axiomatisation for MVD implication does not reflect the fact that the complementation rule is merely a means to achieve database normalisation. He proposed two alternative ways to overcome this deficiency: i) an axiomatisation that does represent the role of the complementation rule adequately, and ii) a notion of MVD implication in which the underlying universe of attributes is left undetermined together with an axiomatisation of this notion. In this paper we investigate multivalued dependencies with null values (NMVDs) as defined and axiomatised by Lien. We show that Lien's axiomatisation does not adequately reflect the role of the complementation rule, and extend Biskup's findings for MVDs in total database relations to NMVDs in partial database relations. Moreover, a correspondence between (minimal) axiomatisations in fixed universes that do reflect the property of complementation and (minimal) axiomatisations in undetermined universes is shown.

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

multivalued dependency
null value
inference
minimality


QoS-centric stateful resource management in information systems There is little resource management and Quality of Service (QoS) guarantee in the "best-effort" model underlying existing information systems, leaving information systems vulnerable to exploits and denial-of-service attacks. To overcome these problems, an engineering approach to QoS-centric stateful resource management in information systems is presented in this paper. System engineering principles are first used to identify various scales and levels of resources in information systems. QoS attributes of resources are then discussed. We also introduce the topological and algebraic structures of propagating QoS attributes across levels and scales of various resources for service contracting and admission control. We use a control-theoretic structure to specify QoS-guarantee functions for managing individual resources, including functions of admission control, scheduling & control, QoS conformance monitoring, and state probing and testing, along with scheduling techniques and statistical process control (SPC) techniques to support these functions.

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

information systems
quality of service
resource management


Parallel search for maximum satisfiability The predominance of multicore processors has increased the interest in developing parallel Boolean Satisfiability (SAT) solvers. As a result, more parallel SAT solvers are emerging. Even though parallel approaches are known to boost performance, parallel approaches developed for Boolean optimization are scarce. This paper proposes parallel search algorithms for Maximum Satisfiability (MaxSAT) and introduces PWBO, a new parallel solver for partial MaxSAT. Using two threads, an unsatisfiability-based algorithm is used to search on the lower bound of the optimal solution, while at the same time a linear search is performed on the upper bound of the optimal solution. Moreover, learned clauses are shared between threads during the search. For a larger number of threads two different strategies are proposed. The first strategy performs a portfolio approach by searching on the lower and upper bound values of the optimal solution using different encodings of cardinality constraints for each thread. The second strategy splits the search space considering different upper bound values of the optimal solution for each thread. Experimental results show that the techniques proposed in the paper enable PWBO to improve when increasing the number of threads.

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

parallel search
maximum satisfiability
cardinality constraints


Quantified symmetry for entorhinal spatial maps General navigation requires a spatial map that is not anchored to one environment. The firing fields of the grid cells found in the rat dorsolateral medial entorhinal cortex (dMEC) could be such a map. dMEC firing fields are also thought to be modeled well by a regular triangular grid (a grid with equilateral triangles as units). We use computational means to analyze and validate the regularity of the firing fields both quantitatively (using summary statistics for geometric and photometric regularity) and qualitatively (using symmetry group analysis). Upon quantifying the regularity of real dMEC firing fields, we find that there are two types of grid cells. We show rigorously that both are nearest to triangular grids using symmetry analysis. However, type III grid cells are far from regular, both in firing rate (highly non-uniform) and grid geometry. Type III grid cells are also more numerous. We investigate the implications of this for the role of grid cells in path integration.

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

hippocampus
neural coding
spatial cognition


Anchoring of semiotic symbols This paper presents arguments for approaching the anchoring problem using semiotic symbols. Semiotic symbols are defined by a triadic relation between forms, meanings and referents, thus having an implicit relation to the real world. Anchors are formed between these three elements rather than between traditional symbols and sensory images. This allows an optimization between the form (i.e. the traditional symbol) and the referent. A robotic experiment based on adaptive language games illustrates how the anchoring of semiotic symbols can be achieved in a bottom-up fashion. The paper concludes that applying semiotic symbols is a potentially valuable approach toward anchoring.

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

anchoring problem
adaptive language games

symbol grounding problem
physical grounding
semiotics


Data extraction module-A supplementary tool for the AMMOS_ProtLig software package Data Extraction Module is a supplementary tool for the software package AMMOS_ProtLig (Automated Molecular Mechanics Optimization tool for in silico Screening of Protein-Ligand interactions). The purpose of the module is to facilitate further analyses of the results after AMMOS ProtLig application. Data Extraction Module automatically processes the output files after post-docking optimization with AMMOS_ProtLig. The module retrieves the ligand and the protein data files of a protein-ligand complex, specified according to user preferences. Data Extraction Module is developed as an open-source graphical application for Microsoft Windows and Linux operating systems. The applicability of the module has been tested on five protein-ligand complexes with different physicochemical properties and topology. Data Extraction Module reduces the user's involvement and accelerates the process of data extraction by 5 to 10, depending on the size of the protein-ligand complex. (C) 2012 Elsevier Ltd. All rights reserved.

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

virtual ligand screening
post-docking optimization
ammos_protlig
protein-ligand complex


utility based channel assignment mechanism for multi radio mesh networks We address the channel assignment problem in a multi-radio mesh network that involves assigning channels to radio interfaces for eliminating the effect of wireless interference. Due to the insufficient number of frequency channels and available radios per node, interference is still present which limits the available bandwidth on wireless links and eventually decrease the achievable throughput. In this paper we investigate the effect of considering the diverse delivery probability of the wireless links on the channel assignment solutions. We show that it is possible to classify the wireless links and omit some of them to benefit from a more diverse-channel solution. We propose a new channel assignment aiming to minimize the interference over high performance links. Finally a performance study is carried to assess the effectiveness of our proposed algorithm. Evaluations show that the multi-channel network obtained from our proposed algorithm achieves significant improvement in terms of reducing the interference and increasing the network capacity.

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

wireless
channel assignment
mesh network


self-modifying cartesian genetic programming In nature, systems with enormous numbers of components (i.e. cells) are evolved from a relatively small genotype. It has not yet been demonstrated that artificial evolution is sufficient to make such a system evolvable. Consequently researchers have been investigating forms of computational development that may allow more evolvable systems. The approaches taken have largely used re-writing, multi- cellularity, or genetic regulation. In many cases it has been difficult to produce general purpose computation from such systems.In this paper we introduce computational development using a form of Cartesian Genetic Programming that includes self-modification operations. One advantage of this approach is that ab initio the system can be used to solve computational problems. We present results on a number of problems and demonstrate the characteristics and advantages that self-modification brings.

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


Scaling-invariant boundary image matching using time-series matching techniques In this paper we address the scaling-invariant problem in boundary image matching. Supporting the invariant property against the horizontal or vertical image scaling is very important in boundary image matching to get more intuitive and more accurate matching results. We note that supporting the scaling-invariance is a challenging problem since the number of possible scaling factors is infinite. In this paper we solve this scaling-invariant problem in the time-series domain instead of the image domain. We first define the scaling distance between boundary images and present an interpolation-based method to compute that distance in the time-series domain. We then propose the notion of scaling-invariant distance between boundary images, which is the minimum distance among all possible scaling distances of two images. We use this scaling-invariant distance as the similarity measure in scaling-invariant boundary image matching. Computing the scaling-invariant distance, however, is very difficult or almost impossible, and we instead present how to compute its upper and lower bounds on the given scaling range. Using these lower and upper bounds we also propose divide-and-conquer algorithms to determine the scaling-invariant similarity between boundary images. Finally, we propose sequential and index-based matching methods, respectively, that perform the scaling-invariant boundary image matching correctly. Experimental results show that our scaling-invariant matching gets more intuitive results than the previous (scaling-variant) matching. In addition, compared with the simple sequential scan, our index-based matching method improves performance by one or two orders of magnitude.

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

data mining
time-series matching
similarity search
scaling-invariant


End-to-end quality of service seen by applications: A statistical learning approach The focus of this work is on the estimation of quality of service (QoS) parameters seen by an application. Our proposal is based on end-to-end active measurements and statistical learning tools. We propose a methodology where the system is trained during short periods with application flows and probe packets bursts. We learn the relation between QoS parameters seen by the application and the state of the network path, which is inferred from the interarrival times of the probe packets bursts. We obtain a continuous non intrusive QoS monitoring methodology. We propose two different estimators of the network state and analyze them using NadarayaWatson estimator and Support Vector Machines (SVM) for regression. We compare these approaches and we show results obtained by simulations and by measures in operational networks.

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

statistical learning
nadarayawatson
support vector machines
qos


Analysis of the time-Schwarz DDM on the heat PDE We developed a parallel time domain decomposition method to solve systems of ODEs based on the Aitken-Schwarz domain decomposition method only in time (Linel P, Tromeur-Dervout D. Aitken-Schwarz and schur complement methods for time domain decomposition. In: Parallel computing: from multicores and GPU's to Petascale. Advances in parallel computing, vol. 19; 2010. p. 75-82). The method transforms the initial time value problem into a time boundary values problem. This paper details the proof of the pure linear convergence of this DDM in case of linear system of ODEs and provides an optimized MPI parallel implementation when a regular size splitting of the time interval is performed. Then an extension of the method to the linear heat partial derivative equation is provided with a special care on boundary conditions to impose. A Fourier convergence analysis of this Schwarz DDM in time for this problem allows to limit the acceleration by Aitken's technique to Fourier low modes only. (C) 2012 Elsevier Ltd. All rights reserved.

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

time domain decomposition
boundary values problem

aitken's acceleration of the convergence


towards a formal model for task allocation via coalition formation This paper focuses on the problem of generating coalition structures for task allocation via coalition formation. It provides a unified formal framework for constructing those coalitions structures. The framework takes as input a set of coalitions whose structures are abstract, a conflict relation between the coalitions, and a preference relation between the coalitions and returns the coalitions structures. Three semantics for coalitions structures will be proposed: a basic semantics which will return a unique coalition structure, stable semantics and preferred semantics. These two last may return several coalitions structures at the same time.

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


Multilayered image representation: Application to image compression The main contribution of this work is a new paradigm for image representation and image compression. We describe a new multilayered representation technique for images. An image is parsed into a superposition of coherent layers: piecewise smooth regions layer, textures layer, etc. The multilayered decomposition algorithm consists in a cascade of compressions applied successively to the image itself and to the residuals that resulted from the previous compressions. During each iteration of the algorithm, we code the residual part in a lossy way: we only retain the most significant structures of the residual part, which results in a sparse representation. Each layer is encoded independently with a different transform, or basis, at a different bitrate, and the combination of the compressed layers can always be reconstructed in a meaningful way. The strength of the multilayer approach comes from the fact that different sets of basis functions complement each others: some of the basis functions will give reasonable account of the large trend of the data, while others will catch the local transients, or the oscillatory patterns. This multilayered representation has a lot of beautiful applications in image understanding, and image and video coding. We have implemented the algorithm and we have studied its capabilities.

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

adaptive coding
cosine transforms
image coding
multilayered coding
wavelet transforms


Matching renewable energy supply and demand in green datacenters ? In this paper, we propose GreenSlot, a scheduler for parallel batch jobs in a datacenter powered by a photovoltaic solar array and the electrical grid (as a backup). GreenSlot predicts the amount of solar energy that will be available in the near future, and schedules the workload to maximize the green energy consumption while meeting the jobs deadlines. If grid energy must be used to avoid deadline violations, the scheduler selects times when it is cheap. Evaluation results show that GreenSlot can increase solar energy consumption by up to 117% and decrease energy cost by up to 39%, compared to conventional schedulers, when scheduling three scientific workloads and a data processing workload. Based on these positive results, we conclude that green datacenters and green-energy-aware scheduling can have a significant role in building a more sustainable IT ecosystem.

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


applying patterns to build a lightweight middleware for embedded systems Today, patterns are used in several domains (distributed applications, security, software requirements, architecture...). Our purpose is double: first, to know if existing patterns can be applied in the particular domain of embedded systems middleware, second, to establish the grounding towards a patterns language for that domain. In this paper, we describe how to design and build a lightweight middleware for embedded systems with well known patterns such as Composite, Proxy, Visitor, Observer, Publish/Subscribe, Leasing, Evictor or Configurator. The patterns we selected and implemented allow keeping the memory footprint reduced. Yet, they were relevant to address the need of creating topology views of Networked Embedded Systems (NES), to monitor and to manage them. As a result, the middleware is modular, flexible, extensible, and lightweight (< 128 kb) according to targeted embedded systems requirements. In addition, this paper describes a concrete case study, illustrating how to select appropriate patterns to build a dedicated middleware in order to interconnect numerous small devices.

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


interdisciplinary application tracks in an undergraduate computer science curriculum The Computer Science Department at Winona State University revised its curriculum to include an interdisciplinary approach adapted to the study of computer science. The new curriculum consists of a traditional Computer Science option and an Applied Computer Science option consisting of four separate tracks, namely: bioinformatics, computer information systems, geographic information technology, and human computer interaction. This paper describes the design strategy and implementation plan as well as the content of our multi-track Applied Computer Science curriculum.

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

bioinformatics
computer information systems
interdisciplinary
human computer interaction
geographic information technology
applied computer science

geographic information systems
multi-track curriculum


Semi-supervised multiview embedding for hyperspectral data classification In this paper, a method for semi-supervised multiview feature extraction based on the multiset regularized kernel canonical correlation analysis (kCCA) is proposed for the classification of hyperspectral images. The covariance matrix of this type of data is naturally composed of distinct blocks of spectral channels, which in turn compose the hypercube. To reduce the dimensionality of the data and extract discriminant features taking advantage of this particular structure, a multiview feature extraction method is applied prior to the classification. The proposed scheme exploits both the labels (as a distinct view on the data) and unlabeled pixels into the computation of cross-correlations and regularizations terms. First, we propose a technique to automatically obtain the segmentation of the spectral profile, based on the correlation between channels. Then, the multiset kernel canonical correlation analysis is applied to find a latent space which represents mutually correlated projected views and labels. Experiments on three real hyperspectral images with two linear classifiers and comparisons to state-of-the-art feature extraction methods show the benefits of this approach, which provides classification accuracies equal or superior to those obtained by training classifiers on the original input space but with only a fraction of the original data dimensionality.

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

feature extraction
kernel canonical correlation analysis
hyperspectral images
classification

semi-supervised learning
multiview learning


Accepting splicing systems In this paper, we propose a novel approach to splicing systems, namely we consider them as accepting devices. Two ways of iterating the splicing operation and two variants of accepting splicing system are investigated. Altogether, we obtain four models, which are compared with each other as well as with the generating splicing systems from the computational power point of view. Several decision problems concerning the accepting splicing systems are discussed. (C) 2010 Elsevier B.V. All rights reserved.

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

formal languages
accepting splicing system


Neural recognition system for swine cough Coughing is one of the most frequent presenting symptoms of many diseases affecting the airways and the lungs of humans and animals. The aim of this paper is to build up an intelligent alarm system that can be used for the early detection of cough sounds in piggeries. Registration of coughs from different pigs in a metallic chamber was done in order to analyse the acoustical signal. A new approach is presented to distinguish cough sounds from other sounds Like grunts, metal clanging and noise using neural networks (NN) as classification method. Other signals (grunts, metal clanging, etc.) could also be detected. Self-organising maps are used for visualisation of data relationships. Several types of NN are compared with statistical methods for the classification of the cough sounds. The early detection of coughs can be used for the construction of an intelligent alarm that can inform about the presence of a possible viral infection. (C) 2001 IMACS. Published by Elsevier Science B.V. All rights reserved.

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

self-organising maps
intelligent systems
sound analysis


Behavior of underexpanded plasma jet in strong magnetic field A visual study of underexpanded plasma jet was conducted to reveal the detailed behavior in the strong magnetic field. The images of the jet were taken by a digital single-lens reflex camera through viewing windows. The distribution of optical intensity obtained from the raw data was compared to that of the typical emission line intensity. The profile of the optical intensity agrees well with that of the emission intensity. It is illustrated that the typical structure of underexpanded jet such as Mach disk is also affected obviously by the magnetic field. The radial distribution of number density was determined by using the image analysis based on the Abel-inversion. The converted data clarify the jet behavior that is hidden on the ordinary observation. The density obtained from numerical analysis for a simple gas was also compared with the number density. It is confirmed from the comparison with numerical results that the radial profile of number density can be utilized for understanding the plasma jet behavior under the strong magnetic field.

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

plasma
jet
magnetic field
image analysis


The Choquet integral with respect to a level dependent capacity We present a generalization of Choquet integral in which the capacity depends also on the value of the aggregated variables. We show that as particular cases of our generalization of Choquet integral there are the Sugeno integral, the Sipos integral and the Cumulative Prospect Theory functional. We also show that many concepts such as Mobius transform, importance index, interaction index, k-order capacities and OWA operators, introduced in the research about Choquet integral, can be generalized in the considered context. (C) 2011 Elsevier B.V. All rights reserved.

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

choquet integral
level dependent capacity
sugeno integral
cumulative prospect theory functional
owa

aggregation functions
level dependent bicapacity


Realising social justice in the water sector: 1 The present work is directed to the analysis, design and construction of web-based systems capable of catalysing processes of stakeholder participation in such ways as to realise changes that are judged by these stakeholders as positive in the water sectors of both the human and the natural economies. The thesis is advanced that the judgement that is so passed is a recognition on the part of the stakeholders of a realisation of social justice. This paper is thus given over in its first part to an analysis of the origins and the nature of social justice in this sector. it is emphasised that, although the resources of hydroinformatics in this endeavour are largely based upon quantitative assessments, the ways in which these translate through stakeholder participation into experiences of social justice are essentially qualitative. Thus, although we are currently concerned for the most part with a hydroinformatics of the quantities, this now has to be extended into a hydroinformatics of the qualities.

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

social justice
stakeholder participation

numerical modelling
software as a service


BUILDING RECOGNITION BASED ON INDIRECT LOCATION OF PLANAR LANDMARK IN FLIR IMAGE SEQUENCES A novel method is proposed to deal with the problem of building recognition in forward-looking infrared (FLIR) image sequences. Two computational models are deduced in this paper: one is the perspective transformation model, through which an image is transformed perspectively from downward-looking state to forward-looking state; the other is the indirect location model, through which the position of a building is computed in an FLIR image. In addition, in order to illustrate the application scope of our method, the error analysis is presented. The proposed approach is validated by extensive experiments, with images taken in different weather conditions, seasons and at different times. Superior recognition results were obtained on three FLIR image sequences we collected.

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

building recognition
indirect location
planar landmark
flir image sequences
perspective transformation
error analysis


Repairing MIP infeasibility through local branching Finding a feasible solution to a generic mixed-integer linear program (MIP) is often a very difficult task. Recently, two heuristic approaches called feasibility pump and local branching have been proposed to address the problem of finding a feasible solution and improving it, respectively. In this paper we introduce and analyze computationally a hybrid algorithm that uses the feasibility pump method to provide, at very low computational cost, an initial (possibly infeasible) solution to the local branching procedure. The overall procedure is reminiscent of Phase I of the two phase simplex algorithm, in which the original LP is augmented with artificial variables that make a known infeasible starting solution feasible and then the augmented model is solved to iteratively reduce that infeasibility by driving the values of the artificial variables to zero. As such, our approach can also to used to find (heuristically) a minimum-cardinality set of constraints whose removal converts an infeasible MIP into a feasible onea very important piece of information in the analysis of infeasible MIP models. Often, in practical applications finding a good feasible solution is the main order of business. At this purpose, local search methods generally start by a feasible solution and eventually improve it until a fixed point is reached and the algorithm is aborted. Sometimes, however, finding such a first feasible solution is hard and can be unnecessary since an initial slightly infeasible solution can be repaired to become feasible and eventually improved. We propose to integrate in the above spirit two recent algorithms for general-purpose MIPsnamely feasibility pump and local branchingwhich were originally proposed to separately cope with the issues of finding an initial feasible solution and improve it.

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

mixed-integer programs
heuristics
feasible solutions