Docking and MD study of histamine H4R based on the crystal structure of H1R Histamine H4 receptor (H4R), a member of histamine receptor family, which belongs to class A of G-protein coupled receptors (GPCRs), has been reported to play a critical role in histamine-induced chemotaxis in mast cells and eosinophils. Recently, the crystal structure of human histamine H1 receptor (H1R) was reported, which facilitates structure-based drug discovery of histamine receptor significantly. In the current work, the homology models of H4R and H3R are first constructed based on the crystal structure of H1R. Clobenpropit is then docked into the binding pocket of H4R and two different binding modes can be identified. In order to select a reasonable binding mode, several other ligands including agonists and antagonists are docked into H4R, and the results reveal that all ligands share one preferable binding mode: the protonated NH tightly interacts with Asp3.32 and the imidazole NH interacts with Glu5.46. By comparing H3R and H4R, we find that Glu5.20 and Thr6.55 in H4R involve in the selectivity of H4R. Then, we perform molecular dynamics (MD) simulations for H4R in complex with its compounds. MD results indicate that the preferable docking mode is more stable. Finally, we dock agonist histamine into H1R and H4R, and then perform 20ns MD simulations for the complexes. H1R or H4R bound with histamine show strong conformational changes from TM5, TM6 and TM7, outward movement of intracellular part of TM6, and conformational change of Tyr7.53, which is consistent with the recent crystal structures of active GPCRs. Our results reveal the mechanism of selectivity and activation for H4R, which is important for developing selective antagonists and agonists for H4R.

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


Progressive lossless compression of volumetric data using small memory load Nowadays, applications dealing with volumetric datasets, Medical applications being a typical representative, have become possible even on low cost computers due to a rapid increase of computer memory and processing power. However, even today, dealing with volumetric datasets creates two considerable problems: slow visualization and large file sizes. While recently, due to significant progress in graphics hardware, real-time or near real-time volume visualization has become possible, volume compression still remains a problematic issue. This paper introduces a new method for lossless compression of volumetric datasets. It is based on quadtree encoding. The method consists of three steps: during initialization, so-called division quadtree is built. The smallest unit of the division quadtree is called basic macro-block. During the processing phase, Boolean intersection is built on pairs of quadtrees, and the differences are stored. In the last phase, the variable length encoding is applied to reduce the entropy among the differences. Proposed method supports progressive visualization, what is especially important when a transfer trough the internet is needed. To test the efficiency of this method it was compared to popular octree encoding scheme. The results proved that data coherence is exploited more sufficiently using proposed quadtree approach. Additional advantage of this approach is that the algorithm does not need a lot of memory space. Only two quadtrees of two consecutive slices need be loaded in the memory at the same time. This feature makes this algorithm extremely attractive for possible hardware implementation. This paper introduces a new method for the compression of volumetric datasets. It is based on quadtree encoding. This method consists of three steps: during initialization, a so-called division quadtree is built. The smallest, unit of the division quadtree is called a basic macro-block. A Boolean intersection is built on pairs of quadtrees during the processing phase and the differences are stored. In the last phase, variable length encoding is applied to reduce entropy among the differences. This method has been compared with the popular octree-based method and gives, in general, better compression results. In addition, this method can be realized using small on-board memory.

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

progressive visualization
quadtree encoding


Procedural Texture Synthesis for Zoom-Independent Visualization of Multivariate Data Simultaneous visualization of multiple continuous data attributes in a single visualization is a task that is important for many application areas. Unsurprisingly, many methods have been proposed to solve this task. However, the behavior of such methods during the exploration stage, when the user tries to understand the data with panning and zooming, has not been given much attention. In this paper, we propose a method that uses procedural texture synthesis to create zoom-independent visualizations of three scalar data attributes. The method is based on random-phase Gabor noise, whose frequency is adapted for the visualization of the first data attribute. We ensure that the resulting texture frequency lies in the range that is perceived well by the human visual system at any zoom level. To enhance the perception of this attribute, we also apply a specially constructed transfer function that is based on statistical properties of the noise. Additionally, the transfer function is constructed in a way that it does not introduce any aliasing to the texture. We map the second attribute to the texture orientation. The third attribute is color coded and combined with the texture by modifying the value component of the HSV color model. The necessary contrast needed for texture and color perception was determined in a user study. In addition, we conducted a second user study that shows significant advantages of our method over current methods with similar goals. We believe that our method is an important step towards creating methods that not only succeed in visualizing multiple data attributes, but also adapt to the behavior of the user during the data exploration stage.

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

i.3.3 [computer graphics]: picture/image generation


Laying a foundation for laser-plasma modeling for the national ignition facility Three multi-dimensional plasma simulation models for simulating parametric instabilities occurring in laser-produced plasmas are presented. These models are based on a common framework, henceforth referred to as reduced-description, in which the electromagnetic field is represented by three separate temporal envelopes in order to model parametric instabilities with high-frequency and low-frequency daughter waves. Because the temporal envelope representation is used, the explicit dependence on the laser time scale is removed from the simulations models. The time step of the simulation is then restricted by either the electron timescale or the ion timescale, depending on whether parametric instabilities that result in high-frequency daughter waves are important. These simulation models are the basic building blocks of a comprehensive, ongoing model development program at Los Alamos National Laboratory, and have been implemented in multi-dimension on the Accelerated Strategic Computing Initiative (ASCI) parallel computer. Test simulations of stimulated Raman scattering (SRS), stimulated Brillouin scattering (SBS), the Langmuir decay instability (LDI), and the interaction thereof, are presented. (C) 2000 Published by Elsevier Science B.V. Ali rights reserved.

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

parametric instabilities
stimulated brillouin scattering
stimulated raman scattering
langmuir decay instability

massively parallel
fully kinetic
reduced-description
two-dimensional
particle-in-cell


Single-photon detection of THz-waves using quantum dots We demonstrate two mechanisms of single photon detection in the THz spectral region by using gate-voltage-induced lateral GaAs/AlGaAs quantum dots (QDs). Firstly, a QD in strong magnetic fields (B=34 T) is operated as a single electron transistor (SETs). THz-photons (1.81.5 THz) excite the QD via cyclotron resonance, and electrical polarization is thereby induced within the QD. The polarization, in turn, affects the SET conductance. Secondly, a SET with parallel double QDs is operated without magnetic fields, where GHz-photons (about 500 GHz) excite and ionize one of the QDs, which is, in turn, probed by the other QD to change the SET conductance.

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

single-photon detection
thz-waves
submillimetre wave
semiconductor quantum dot


Comparison of Tree-Child Phylogenetic Networks Phylogenetic networks are a generalization of phylogenetic trees that allow for the representation of nontreelike evolutionary events, like recombination, hybridization, or lateral gene transfer. While much progress has been made to find practical algorithms for reconstructing a phylogenetic network from a set of sequences, all attempts to endorse a class of phylogenetic networks (strictly extending the class of phylogenetic trees) with a well-founded distance measure have, to the best of our knowledge and with the only exception of the bipartition distance on regular networks, failed so far. In this paper, we present and study a new meaningful class of phylogenetic networks, called tree-child phylogenetic networks, and we provide an injective representation of these networks as multisets of vectors of natural numbers, their path multiplicity vectors. We then use this representation to define a distance on this class that extends the well-known Robinson-Foulds distance for phylogenetic trees and to give an alignment method for pairs of networks in this class. Simple polynomial algorithms for reconstructing a tree-child phylogenetic network from its path multiplicity vectors, for computing the distance between two tree-child phylogenetic networks and for aligning a pair of tree-child phylogenetic networks, are provided. They have been implemented as a Perl package and a Java applet, which can be found at http://bioinfo.uib.es/similar to recerca/phylonetworks/mudistance/.

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

tree-child phylogenetic network
phylogenetic tree
partition distance
network alignment


Reduced Reconfigurable Logic Circuit Design Based on Double Gate CNTFETs Using Ambipolar Binary Decision Diagram This letter describes the design methodology for reduced reconfigurable logic circuits based on double gate carbon nanotube field effect transistors (DG-CNTFETs) with ambipolar propoerty. Ambipolar Binary Decision Diagram (Am-BDD) which represents the cornerstone for automatic pass transistor logic (PTL) synthesis flows of ambipolar devices was utilized to build DG-CNTFET based n-input reconfigurable cells in the conventional approach. The proposed method can reduce the number of ambipolar devices for 2-inputs reconfigurable cells, incorporating the simple Boolean algebra in the Am-BDD compared with the conventional approach. As a result, the static 2-inputs reconfigurable circuit with 16 logic functions can be synthesized by using 8 DG-CNTFETs although the previous design method needed 12 DG-CNTFETs for the same purpose.

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

reconfigurable logic design
ambipolar device
double gate cntfet


Ab initio molecular dynamics simulation on the formation process of He@C-60 synthesized by explosion The applications of endohedral non-metallic fullerenes are limited by their low production rate. Recently, an explosive method developed in our group shows promise to prepare He@C-60 at fairly high yield, but the mechanism of He inserting into C-60 cage at explosive conditions was not clear. Here, ab initio molecular dynamics analysis has been used to simulate the collision between C-60 molecules at high-temperature and high-pressure induced by explosion. The results show that defects formed on the fullerene cage by collidsion can effectively decrease the reaction barrier for the insertion of He into C-60, and the self-healing capability of the defects was also observed.

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

ab initio molecular dynamics
collision
explosion


Insights from von Neumann analysis of high-order flux reconstruction schemes The flux reconstruction (FR) approach unifies various high-order schemes, including collocation based nodal discontinuous Galerkin methods, and all spectral difference methods (at least for a linear flux function), within a single framework. Recently, an infinite number of linearly stable FR schemes were identified, henceforth referred to as VincentCastonguayJamesonHuynh (VCJH) schemes. Identification of VCJH schemes offers significant insight into why certain FR schemes are stable (whereas others are not), and provides a simple prescription for implementing an infinite range of linearly stable high-order methods. However, various properties of VCJH schemes have yet to be analyzed in detail. In the present study one-dimensional (1D) von Neumann analysis is employed to elucidate how various important properties vary across the full range of VCJH schemes. In particular, dispersion and dissipation properties are studied, as are the magnitudes of explicit time-step limits (based on stability considerations). 1D linear numerical experiments are undertaken in order to verify results of the 1D von Neumann analysis. Additionally, two-dimensional non-linear numerical experiments are undertaken in order to assess whether results of the 1D von Neumann analysis (which is inherently linear) extend to real world problems of practical interest.

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

flux reconstruction
dispersion
dissipation

high-order methods
nodal discontinuous galerkin method
spectral difference method


ROBUST ESTIMATION OF TRIFOCAL TENSORS USING NATURAL FEATURES FOR AUGMENTED REALITY SYSTEMS Augmented reality deals with the problem of dynamically augmenting or enhancing the real world with computer generated virtual scenes. Registration is one of the most pivotal problems currently limiting AR applications. In this paper, a novel registration method using natural features based on online estimation of trifocal tensors is proposed. This method consists of two stages: offline initialization and online registration. Initialization involves specifying four points in two reference images respectively to build the world coordinate system on which a virtual object will be augmented. In online registration, the natural feature correspondences detected From the reference views are tracked in the current frame to build the feature triples. Then these triples are Used to estimate the corresponding trifocal tensors in the image sequence by which the four specified points are transferred to compute the registration matrix for augmentation. The estimated registration matrix will be used as an initial estimate for a nonlinear optimization method that minimizes the actual residual errors based on the Levenberg-Marquardt (LM) minimization method, thus making the results more robust and stable. This paper also proposes a robust method for estimating the trifocal tensors, where a modified RANSAC algorithm is used to remove outliers. Compared with standard RANSAC, our method can significantly reduce, computation complexity, while overcoming the disturbance of mismatches. Some experiments have been carried out to demonstrate the validity of the proposed approach.

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

augmented reality
registration
trifocal tensors


Richard Rufus's Theory of Mixture Richard Rufus of Cornwall offered a novel solution to the problem of mixture raised by Aristotle. The puzzle is that mixts or mixed bodies (blood, flesh, wood, etc.) seem to be unexplainable through logic, even though the world is full of them. Rufus's contribution to this long-standing theoretical debate is the development of a modal interpretation of certain Averroistic doctrines. Rufus's account, which posits that the elemental forms in a mixt are in accidental potential, avoids many of the problems that plagued non-atomistic medieval theories of mixture. This paper is an initial examination of Rufus' account.

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

richard rufus
mixture
mixt
accidental potential

combination
potential
elements
medieval chemistry
aristotelian science
averroes


verification of coordinated exception handling An important challenge faced by the developers of fault-tolerant distributed systems is to build fault tolerance mechanisms that are reliable. To achieve the desired levels of reliability, the development of mechanisms for detecting and handling errors should be rigorous or formal. In this paper, we present an approach to modeling and verifying fault-tolerant distributed systems that use exception handling as the main fault tolerance mechanism. The proposed approach is based on a formal model for specifying the structure of a system in terms of cooperating participants that handle exceptions in a coordinated manner. We use a medical control system as a case study to validate the proposed approach.

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

distributed systems
coordinated exception handling


Infragranular layers lead information flow during slow oscillations according to information directionality indicators The recurrent circuitry of the cerebral cortex generates an emergent pattern of activity that is organized into rhythmic periods of firing and silence referred to as slow oscillations (ca 1 Hz). Slow oscillations not only are dominant during slow wave sleep and deep anesthesia, but also can be generated by the isolated cortical network in vitro, being a sort of default activity of the cortical network. The cortex is densely and reciprocally connected with subcortical structures and, as a result, the slow oscillations in situ are the result of an interplay between cortex and thalamus. Due to this reciprocal connectivity and interplay, the mechanism responsible for the initiation of waves in the corticothalamocortical loop during slow oscillations is still a matter of debate. It was our objective to determine the directionality of the information flow between different layers of the cortex and the connected thalamus during spontaneous activity. With that purpose we obtained multilayer local field potentials from the rat visual cortex and from its connected thalamus, the lateral geniculate nucleus, during deep anaesthesia. We analyzed directionality of information flow between thalamus, cortical infragranular layers (5 and 6) and supragranular layers (2/3) by means of three information theoretical indicators: transfer entropy, symbolic transfer entropy and transcript mutual information. These three indicators coincided in finding that infragranular layers lead the information flow during slow oscillations both towards supragranular layers and towards the thalamus.

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

transfer entropy
transcript mutual information
information directionality
cerebral cortex
thalamus
slow oscillations

ordinal patterns
transcripts
symbolic transfer entropy
local field potential
lgn
cortical rhythms
information processing
up states


Discovering patterns of missing data in survey databases: An application of rough sets Databases for data mining often have missing values. Missing data are often mistreated in data mining and valuable knowledge related to missing data is often overlooked. This study discusses patterns of missing data in survey databases. It proposes a framework of rough set rule induction method that enables the data miner to obtain association rules of patterns of missing data in a survey database. Through an experiment on a real-world data set, we demonstrate the approach to discovering knowledge about missing data.

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

data mining
missing values
survey
association rules
rough sets
rule induction


A unifying look at clustering in mobile ad hoc networks In recent years, a significant number of clustering schemes have been proposed in the literature. Most of them treat cluster initialization and cluster maintenance differently as if they were two entirely different undertakings. The main contribution of this work is a unifying way of looking at clustering in MANET. We make an important point: there is no difference between cluster initialization and cluster maintenance, and one algorithm should gracefully blend into the other. To illustrate the feasibility of this concept, we propose a novel tree-based clustering, algorithm for MANET based on a number of properties of diameter-2 graphs. The algorithm is cluster-centric and, unlike the vast majority of algorithms in the literature, works in the presence of node mobility. Extensive simulation results show the effectiveness of our algorithm when compared to other clustering schemes proposed in the recent literature. Copyright (C) 2004 John Wiley Sons, Ltd.

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

mobile ad hoc networks
cluster initialization
cluster maintenance


analysis of hop-distance relationship in spatially random sensor networks In spatially random sensor networks, estimating the Euclidean distance covered by a packet in a given number of hops carries a high importance for various other methods such as localization and distance estimations. The inaccuracies in such estimations motivate this study on the distribution of the Euclidean distance covered by a packet in spatially random sensor networks in a given number of hops. Although a closed-form expression of distance distribution cannot be obtained, highly accurate approximations are derived for this distribution in one dimensional spatially random sensor networks. Using statistical measures and numerical examples, it is also shown that the presented distribution approximation yields very high accuracy even for small number of hops. A discussion on how these principles can be extended to the analysis of the same problem in two dimensional networks is also provided.

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

distance
sensor networks
accuracy
examples
analysis
approximation

network
measurement
statistics
probability distribution
estimates
relationships
method
express
hop distance
euclidean distance
multihop propagation
distributed
randomization
locality


investigating the impact of sequential selection in the (1,4)-cma-es on the noisy bbob-2010 testbed Sequential selection, introduced for Evolution Strategies (ESs) with the aim of accelerating their convergence, consists in performing the evaluations of the different offspring sequentially, stopping the sequence of evaluations as soon as an offspring is better than its parent and updating the new parent to this offspring solution. This paper investigates the impact of the application of sequential selection to the (1,4)-CMA-ES on the BBOB-2010 noisy benchmark testbed. The performance of the (1,4 s )-CMA-ES, where sequential selection is implemented, is compared to the baseline algorithm (1,4)-CMA-ES. Independent restarts for the two algorithms are conducted till a maximum of 10 4 D function evaluations per trial was reached, where D is the dimension of the search space. The results show that the sequential selection within the (1,4 s )-CMA-ES clearly outperforms the baseline algorithm (1,4)-CMA-ES by at least 12\% on 7 functions in 20D whereas no statistically significant worsening can be observed. Moreover, the (1,4 s )-CMA-ES shows shorter expected running times on 6 functions of up to 32\% compared to the function-wise best algorithm of the BBOB-2009 benchmarking (in 20D and for a target value of 10 -7 ).

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


Process plan and part routing optimization in a dynamic flexible job shop scheduling environment: an optimization via simulation approach This paper presents an optimization via simulation approach to solve dynamic flexible job shop scheduling problems. In most real-life problems, certain operation of a part can be processed on more than one machine, which makes the considered system (i.e., job shops) flexible. On one hand, flexibility provides alternative part routings which most of the time relaxes shop floor operations. On the other hand, increased flexibility makes operation machine pairing decisions (i.e., the most suitable part routing) much more complex. This study deals with both determining the best process plan for each part and then finding the best machine for each operation in a dynamic flexible job shop scheduling environment. In this respect, a genetic algorithm approach is adapted to determine best part processing plan for each part and then select appropriate machines for each operation of each part according to the determined part processing plan. Genetic algorithm solves the optimization phase of solution methodology. Then, these machine-operation pairings are utilized by discrete-event system simulation model to estimate their performances. These two phases of the study follow each other iteratively. The goal of methodology is to find the solution that minimizes total of average flowtimes for all parts. The results reveal that optimization via simulation approach is a good way to cope with dynamic flexible job shop scheduling problems, which usually takes NP-Hard form.

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

optimization via simulation
genetic algorithm
dynamic flexible job shop scheduling


A feature-based approach for dense segmentation and estimation of large disparity motion We present a novel framework for motion segmentation that combines the concepts of layer-based methods and feature-based motion estimation. We estimate the initial correspondences by comparing vectors of filter outputs at interest points, from which we compute candidate scene relations via random sampling of minimal subsets of correspondences. We achieve a dense, piecewise smooth assignment of pixels to motion layers using a fast approximate graphcut algorithm based on a Markov random field formulation. We demonstrate our approach on image pairs containing large inter-frame motion and partial occlusion. The approach is efficient and it successfully segments scenes with inter-frame disparities previously beyond the scope of layer-based motion segmentation methods. We also present an extension that accounts for the case of non-planar motion, in which we use our planar motion segmentation results as an initialization for a regularized Thin Plate Spline fit. In addition, we present applications of our method to automatic object removal and to structure from motion.

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

ransac
layer-based motion
metric labeling problem
graph cuts
periodic motion


Supervised methods for detection and segmentation of tissues in clinical lumbar MRI Lower back pain (LBP) is widely prevalent all over the world and more than 80% of the people suffer from LBP at some point of their lives. Moreover, a shortage of radiologists is the most pressing cause for the need of CAD (computer-aided diagnosis) systems. Automatic localization and labeling of intervertebral discs from lumbar MRI is the first step towards computer-aided diagnosis of lower back ailments. Subsequently, for diagnosis and characterization (quantification and localization) of abnormalities like disc herniation and stenosis, a completely automatic segmentation of intervertebral discs and the dural sac is extremely important. Contribution of this paper towards clinical CAD systems is two-fold. First, we propose a method to automatically detect all visible intervertebral discs in clinical sagittal MRI using heuristics and machine learning techniques. We provide a novel end-to-end framework that outputs a tight bounding box for each disc, instead of simply marking the centroid of discs, as has been the trend in the recent past. Second, we propose a method to simultaneously segment all the tissues (vertebrae, intervertebral disc, dural sac and background) in a lumbar sagittal MRI, using an auto-context approach instead of any explicit shape features or models. Past work tackles the lumbar segmentation problem on a tissue/organ basis, and which tend to perform poorly in clinical scans due to high variability in appearance. We, on the other hand, train a series of robust classifiers (random forests) using image features and sparsely sampled context features, which implicitly represent the shape and configuration of the image. Both these methods have been tested on a huge clinical dataset comprising of 212 cases and show very promising results for both disc detection (98% disc localization accuracy and 2.08mm mean deviation) and sagittal MRI segmentation (dice similarity indices of 0.87 and 0.84 for the dural sac and the inter-vertebral disc, respectively).

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

computer-aided diagnosis
intervertebral disc segmentation
dural sac segmentation


Finding paths of length k in O*(2(k)) time We give a randomized algorithm that determines if a given graph has a simple path of length at least k in O(2(k) . poly(n)) time. Our method extends a recent O(2(3k/2). poly(n)) <= 0 (2.83(k) . poly(n)) algorithm of Koutis. (C) 2008 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

randomized algorithms
parameterized algorithms
graph algorithms
group algebra


Using off-the-shelf tools for terabyte-scale waveform recording in intensive care: Computer system design, database description and lessons learned ? Until now, the creation of massive (long-term and multichannel) waveform databases in intensive care required an interdisciplinary team of clinicians, engineers and informaticians and, in most cases, also design-specific software and hardware development. Recently, several commercial software tools for waveform acquisition became available. Although commercial products and even turnkey systems are now being marketed as simple and effective, the performance of those solutions is not known. The additional expense upfront may be worthwhile if commercial software can eliminate the need for custom software and hardware systems and the associated investment in teams and development. We report the development of a computer system for long-term large-scale recording and storage of multichannel physiologic signals that was built using commercial solutions (software and hardware) and existing hospital IT infrastructure. Both numeric (1Hz) and waveform (62.5500Hz) data were captured from 24 SICU bedside monitors simultaneously and stored in a file-based vital sign data bank (VSDB) during one-year period (total DB size is 4.21TB). In total, vital signs were recorded from 1175 critically ill patients. Up to six ECG leads, all other monitored waveforms, and all monitored numeric data were recorded in most of the cases. We describe the details of building blocks of our system, provide description of three datasets exported from our VSDB and compare the contents of our VSDB with other available waveform databases. Finally, we summarize lessons learned during recording, storage, and pre-processing of physiologic signals.

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

raid redundant array of independent disks


Evaluating exact VARMA likelihood and its gradient when data are incomplete A detailed description of an algorithm for the evaluation and differentiation of the likelihood function for VARMA processes in the general case of missing values is presented. The method is based on combining the Cholesky decomposition method for complete data VARMA evaluation and the Sherman-Morrison-Woodbury formula. Potential saving for pure VAR processes is discussed and formulae for the estimation of missing values and shocks are provided. A theorem on the determinant of a low rank update is proved. Matlab implementation of the algorithm is in a companion article.

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

vector autoregressive moving average model


A contribution to the real-time simulation of coupled finite element models of machine tools A numerical comparison In this paper the real-time simulation of finite element (FE) models of machine tools on a multi-processor architecture is presented. The simulation model is based on several FE component models that are connected by non-linear couplings. These couplings allow relative motions of the components in a wide range. The coupled linear FE models are decomposed at the non-linear coupling nodes and each component is solved locally. The linear structure of the components can be used for efficient simulation methods and the components can be distributed to several processors for a parallel computation. Methods that differ in numerical accuracy and stability, computational effort and real-time capacity will be presented. By means of a complex example, it will be illustrated that a parallel, stable computation can be realized time-deterministically.

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

component-based modeling
partitioned simulation
local integration
real-time simulation


exploring the effects of group size and display configuration on visual search Visual search is the subject of countless psychology studies in which people search for target items within a scene. The bulk of this literature focuses on the individual with the goal of understanding the human perceptual system. In life, visual search is performed not only by individuals, but also by groups -- a team of doctors may study an x-ray and a team of analysts may study a satellite photograph. In this paper, we examine the issues one should consider when searching as a group. We present the details of an experiment designed to investigate the impact of group size on visual search performance, and how different display configurations affected that performance. We asked individuals, pairs, and groups of four people to participate in a baggage screening task in which these teams searched simulated x-rays for prohibited items. Teams conducted these searches on single monitors, a row of four monitors, and on a single horizontal display. Our findings suggest that groups commit far fewer errors in visual search tasks, although they may perform slower than individuals under certain conditions. The interaction between group size and display configuration turned out to be an important factor as well.

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

visual search
horizontal display
group size

multi-monitor interfaces
shared-display groupware


Automatic word naming recognition for an on-line aphasia treatment system ? One of the most common effects among aphasia patients is the difficulty to recall names or words. Typically, word retrieval problems can be treated through word naming therapeutic exercises. In fact, the frequency and the intensity of speech therapy are key factors in the recovery of lost communication functionalities. In this sense, speech and language technology can have a relevant contribution in the development of automatic therapy methods. In this work, we present an on-line system designed to behave as a virtual therapist incorporating automatic speech recognition technology that permits aphasia patients to perform word naming training exercises. We focus on the study of the automatic word naming detector module and on its utility for both global evaluation and treatment. For that purpose, a database consisting of word naming therapy sessions of aphasic Portuguese native speakers has been collected. In spite of the different patient characteristics and speech quality conditions of the collected data, encouraging results have been obtained thanks to a calibration method that makes use of the patients word naming ability to automatically adapt to the patients speech particularities.

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


A polynomial time algorithm for obtaining a minimum vertex ranking spanning tree in outerplanar graphs The minimum vertex ranking spanning tree problem is to find a spanning tree of G whose vertex ranking is minimum. This problem is NP-hard and no polynomial time algorithm for solving it is known for non-trivial classes of graphs other than the class of interval graphs. This paper proposes a polynomial time algorithm for solving the minimum vertex ranking spanning tree problem on outerplanar graphs.

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


Comments on: a new aggregation method in a fuzzy environment - Discussion This paper: (1) examines the results of Ref. [1] [Decision Support Systems 25 (Feb. 1999)] and points out its errors and shortcomings, and (2) extends its method to a more general case. (C) 2002 Elsevier Science B.V. All rights reserved.

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

aggregation operator
situation assessment


Fraud detection in online consumer reviews ? Increasingly, consumers depend on social information channels, such as user-posted online reviews, to make purchase decisions. These reviews are assumed to be unbiased reflections of other consumers' experiences with the products or services. While extensively assumed, the literature has not tested the existence or non-existence of review manipulation. By using data from Amazon and Barnes & Noble, our study investigates if vendors, publishers, and writers consistently manipulate online consumer reviews. We document the existence of online review manipulation and show that the manipulation strategy of firms seems to be a monotonically decreasing function of the product's true quality or the mean consumer rating of that product. Hence, manipulation decreases the informativeness of online reviews. Furthermore though consumers understand the existence of manipulation, they can only partially correct it based on their expectation of the overall level of manipulation. Hence, vendors are able to change the final outcomes by manipulating online reviewers. In addition, we demonstrate that at the early stages, after an item is released to the Amazon market, both price and reviews serve as quality indicators. Thus, at this stage, a higher price leads to an increase in sales instead of a decrease in sales. At the late stages, price assumes its normal role, meaning a higher price leads to a decrease in sales. Finally, on average, there is a higher level of manipulation on Barnes & Noble than on Amazon.

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

online word of mouth
self-selection
time-series


Numerical studies on the effect of lowering temperature on the oxygen transport during brain hypothermia resuscitation There have been arguments about the advantage and shortcoming of hypothermia on the brain resuscitation during circulation arrest. People usually accepted that hypothermia may decrease the cerebral oxygen demands, which is beneficial for the patient to sustain longer time when subjected to a hypoxia. However, there are also quite a few disputes claiming that the blood viscosity would increase with the reduction of temperature, which may lead to an increase of cerebral vascular resistance and thus worsen the hypoxia state. To resolve this critical issue, a heat transfer model was established to characterize the thermal response of brain tissue during hypothermia resuscitation. Combined with this model, a compartmental model taking account of the temperature effect was further developed to analyze the transient oxygen partial pressure (PO2) distribution over the successive branches of the vascular network during circulation arrest. Using the morphological and physiological data of a sheep brain, effects of lowering temperature on the oxygen consumption dynamics were studied. Calculations indicated that the lower the temperature, the slower the decreasing rate for the PO2. Although immediately lowering the brain temperature may induce an evident increase in blood viscosity and subsequently a decrease in blood flow rate, which is responsible for oxygen delivery, it seems to always result in a monotonic increase of PO2. The results show a good qualitative accord with the experimental data. They also present better understanding on the transient oxygen transport in brain hypothermia during circulation arrest.

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

heat transfer
brain hypothermia resuscitation
circulation arrest
oxygen transport
oxygen consumption dynamics
compartmental model


Quantitative prediction of vasopressin secretion using a computational population model of rat magnocellular neurons The goal of this study was to create a realistic and quantitative simulation of vasopressin (AVP) secretion under iso-osmotic and short-term challenged plasma osmolality. The relationship between AVP concentration ([AVP]) and plasma osmolality was computed using a sophisticated and integrated model that chronologically simulates (1) the overall firing rate of the hypothalamus magnocellular neuronal (MCN) population, (2) the propagation of the spike activity down the axons, (3) the fatigue and facilitation mechanisms of AVP release at the axon terminals and (4) the [AVP] pharmacodynamics based on the trains of AVP release. This global simulation predicted that the differential MCN sensitivity to dynorphin would be the most critical mechanism underlying the individual variability of MCN firing behaviors (silence, irregular, phasic and continuous firing patterns). However, at the level of the MCN population, the simulation predicted that the dynorphin factor must be combined with the distribution of the resting membrane potentials among the MCNs to obtain a realistic overall firing rate in response to a change in osmolality. Moreover, taking advantage of the integrated model, the simulation predicted that the selective removal of the frequency-dependent facilitation of AVP secretion has a major impact on the overall [AVP]-to-osmolality relationship (mean absolute change of 2.59pg/ml); the action potential propagation failure, while critical, has a smaller quantitative impact on the overall [AVP] (0.58pg/ml). The present integrated model (from a single MCN to a quantitative plasma [AVP]) improves our knowledge of the mechanisms underlying overall MCN firing and AVP excitation-secretion coupling.

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

hydromineral homeostasis
supraoptic nucleus
kappa-opioid receptor
excitation-secretion coupling
mathematical model


OmniCon: a Mobile IP-based vertical handoff system for wireless LAN and GPRS links Wi-Fi based hotspots offer mobile users broadband wireless Internet connectivity in public work spaces and corporate/university campuses. Despite the aggressive deployment of these hotspots in recent years, highspeed wireless Internet access remains restricted to small geographical areas due to the limited physical coverage of wireless LANs. On the other hand, despite their lower throughput, cellular networks have a significantly wider coverage and are thus much more available. Recognizing that 2.5G or 3G cellular networks can effectively complement wireless LANs, we set out to develop a vertical handoff system that allows mobile users to seamlessly fall back to such cellular networks as the general packet radio service (GPRS) or 3G whenever wireless LAN connectivity is not available. The resulting handoff mechanism allows a network connection of a mobile node to operate over multiple wireless access networks in a way that is transparent to end user applications. In this paper, we present the design, implementation, and evaluation of a fully operational vertical handoff system, called OmniCon, which enables mobile nodes to automatically switch between wireless LAN and GPRS, based on wireless LAN availability, by introducing a simple extension to the existing Mobile IP implementation. We discuss the design issues in the proposed vertical handoff system for heterogeneous networks, including connection setup problems due to network address translation, and the disparity in link characteristics between wireless LANs and GPRS. A detailed performance evaluation study of the OmniCon prototype demonstrates its ability to migrate active network connections between these two wireless technologies with low handoff latency and close to zero packet loss. Copyright (C) 2006 John Wiley & Sons, Ltd.

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

vertical handoff
gprs
wireless lan
network address translation


robust visual reranking via sparsity and ranking constraints Visual reranking has become a widely-accepted method to improve traditional text-based image search engines. Its basic principle is that visually similar images should have similar ranking scores. While existing methods are different in specifics, almost all of them are based on explicit or implicit pseudo-relevance feedback (PRF). Explicit PRF-based approaches, including classification-based and clustering-based reranking, suffer from the difficulty of selecting reliable positive and negative samples. Implicit PRF-based approaches, such as graph-based and Bayesian visual reranking, deal with such unreliability by making use of the initial ranking in a soft manner, but have limited capability of promoting relevant images and lowering down irrelevant images. In this paper, we propose l 1 square loss optimization based on sparsity and ranking constraints to detect confident samples which are most likely to be relevant to a query. Based on the discovered confident samples, we present an adaptive kernel-based scheme to rerank the images. The success of our proposed method comes from another important observation that irrelevant images, whether initially positioned at the top or bottom, are usually less-popular and more diverse than relevant images. Therefore, it is robust against outlier images and suitable when relevant images are multi-modally distributed. The experimental results demonstrate significant improvement of our method over several existing reranking approaches on both MSRA-MM V1.0 and Web Queries datasets.

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

l1 loss
image search reranking
non-negativity


Design and Implementation of Context-Aware Musuem Guide Agents This paper presents an agent-based system for building and operating context-aware services in public spaces, including museums The system provides users with agents and detects the locations of users and deploys location-aware user-assistant agents at computers near the their current locations by using active RFID-tags When a visitor moves between exhibits in a museum. this dynamically deploys his/her agent at the computers close to the exhibits by using mobile agent technology It annotates the exhibits in his/her personalized form and navigate him/her user to the next exhibits along his/her mutes It also introduces user movement as a natural approach to interacting between users and agents To demonstrate the utility and effectiveness of the system. we constructed location/user-aware visitor-guide services and experimented them for two weeks in a public museum.

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

user navigation
context-aware service
rfid


Comparison of Three Multiplex Immunoassays for Detection of Antibodies to Extractable Nuclear Antibodies Using Clinically Defined Sera We set out to determine the agreement of three multiplex immunoassays for the detection of autoantibodies involved in connective tissue disease using clinically defined sera. Usefulness of the immunoassays will be defined by correlation to disease state. Using the immunoassays from Inova Diagnostics, Biomedical Diagnostics (BMD), and AtheNA, reactivity, to Smith (Sm), ribonucleic protein (RNP), SSA (Ro), SSB (La), Scl-70, and dsDNA or chromatin, we tested 273 clinically defined sera consisting of 57 systemic lupus erythrematosus (SLE) sera, 69 rheumatoid arthritis (RA) sera, 47 sera defined as various other connective tissue diseases, and 100 normal donor sera. Samples were also tested for anti-nuclear antibody (ANA) oN HEp-2 cells by IFA for analysis of discrepant results. Inova, BMD, and AtheNA assays demonstrated 57%, 89%, and 80% concordance, respectively, in the 47 connective tissue disease sera. The BMD assay was the most sensitive in detecting Scl-70. The immunoassays did not correlate well in the 57 SLE-defined sera; however, each had a variety of antibodies positive for each serum. The AtheNA assay demonstrated the highest degree of nonspecificity. Inova, BMD, AtheNA, and the Inova ANA HEp-2 IFA demonstrated 97%, 98%, 97%, and 99% specificity, respectively, using normal sera. Thus, all three assays showed a 97% or better negative predictive value. Positive correlation varied from 83% to 98%. Antibodies in SLE sera did not compare well among the three immunoassays. Significant variation in specificity and sensitivity due to individual characteristics of each assay was demonstrated, with the BMD assay showing the highest correlation with clinical diagnosis

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

systemic lupus erythematosus
extractable nuclear antibody testing
multiplex microspheres
luminex


applying metaheuristic techniques to search the space of bidding strategies in combinatorial auctions Many non-cooperative settings that could potentially be studied using game theory are characterized by having very large strategy spaces and payoffs that are costly to compute. Best response dynamics is a method of searching for pure-strategy equilibria in games that is attractive for its simplicity and scalability (relative to more analytical approaches). However, when the cost of determining the outcome of a particular set of joint strategies is high, it is impractical to compute the payoffs of all possible responses to the other players actions. Thus, we study metaheuristic approaches--genetic algorithms and tabu search in particular--to explore the strategy space. We configure the parameters of metaheuristics to adapt to the problem of finding the best response strategy and present how it can be helpful in finding Nash equilibria of combinatorial auctions which is an important solution concept in game theory.

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

tabu search
game theory
combinatorial auctions


Challenges of strategic supply chain planning and modeling The increasing number of applications of supply chain network optimization models to strategic planning has created new challenges for model practitioners and their clients. These challenges are discussed in the context of four categories of modeling and organizational imperatives. (C) 2003 Elsevier Ltd. All rights reserved.

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

theory of industrial organization
stochastic programming


Can agents measure up? A comparative study of an agent-based and on-line optimization approach for a drayage problem with uncertainty Experiments studying the behavior of agent-based methods over varying levels of uncertainty in comparison to traditional optimization methods are generally absent from the literature. In this paper we apply two structurally distinct solution approaches, an on-line optimization and an agent-based approach, to a drayage problem with time windows under two types of uncertainty. Both solution approaches are able to respond to dynamic events. The on-line optimization approach utilizes a mixed integer program to obtain a feasible route at 30-s intervals. The second solution approach deploys agents that engage in auctions to satisfy their own objectives based on the information they perceive and maintain locally. Our results reveal that the agent-based system can outperform the on-line optimization when service time duration is highly uncertain. The on-line optimization approach, on the other hand, performs competitively with the agent-based system under conditions of job-arrival uncertainty. When both moderate service time and job-arrival uncertainties are combined, the agent system outperforms the on-line optimization; however, in the case of extremely high combined uncertainty, the on-line optimization outperforms the agent-based approach.

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

pick-up and delivery problem with time windows


Unprovability of the logical characterization of bisimulation We quickly review labelled Markov processes (LMP) and provide a counterexample showing that in general measurable spaces, event bisimilarity and state bisimilarity differ in LMP. This shows that the Hennessy-Milner logic proposed by Desharnais does not characterize state bisimulation in non-analytic measurable spaces. Furthermore we show that, under current foundations of Mathematics, such logical characterization is unprovable for spaces that are projections of a coanalytic set. Underlying this construction Mere is a proof that stationary Markov processes over general measurable spaces do not have semi-pullbacks. (C) 2011 Elsevier Inc. All rights reserved.

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

labelled markov process
probabilistic bisimulation
modal logic
nonmeasurable set


Improving the management of product lines by performing domain knowledge extraction and cross product line analysis Increase in market competition is one of the main reasons for developing and maintaining families of systems, termed Product Lines (PLs). Managing those PLs is challenging, let alone the management of several related PLs. Currently, those PLs are managed separately or their relations are analyzed assuming explicit specification of dependencies or use of an underlying terminology. Such assumptions may not hold when developing the PLs in different departments or companies applying various engineering processes. In this work we call for utilizing the knowledge gained from developing and maintaining different PLs in the same domain in order to recommend on improvements to the management of PLs. The suggested approach conducts domain knowledge extraction and cross PL analysis on feature diagrams the main aid for modeling PL variability. The domain knowledge is extracted by applying similarity metrics, clustering, and mining techniques. Based on the created domain models, the approach performs cross PL analysis that examines relations in the domain models and generates improvement recommendations to existing PLs and overall management recommendations (e.g., merging or splitting PLs). The approach outcomes were evaluated by humans in a domain of mobile phones. The evaluation results may provide evidence that the outcomes of the approach in general and its recommendations in particular meet human perception of the given domain. We conclude that through domain knowledge extraction and cross PL analysis the suggested approach may generate recommendations useful to the management of individual PLs, as well as to the overall management of different PLs in the same domain.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 product line engineering
variability management
domain analysis
feature modeling


Wie das Internet der Dinge neue Geschftsmodelle ermglicht Bis 2020 werden mehr als 50Mrd. Gerte mit dem Internet verbunden sein. Mit Hilfe Cyber-Physikalischer Systeme, die die reale mit der virtuellen Welt integrieren, knnen Prozesse automatisiert und wertvolle Erkenntnisse gewonnen werden. Dies ermglicht neue Geschftsmodelle auf Basis intelligenter Produkte und Dienstleistungen.

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

smart services intelligente produkte und dienstleistungen


On stochastic bounds for monotonic processor sharing networks We consider a network of processor sharing nodes with independent Poisson arrival processes. Nodes are coupled through their service capacity in that the speed of each node depends on the number of customers present at this and any other node. We assume the network is monotonic in the sense that removing a customer from any node increases the service rate of all customers. Under this assumption, we give stochastic bounds on the number of customers present at any node. We also identify limiting regimes that allow to test the tightness of these bounds. The bounds and the limiting regimes are insensitive to the service time distribution. We apply these results to a number of practically interesting systems, including the discriminatory processor sharing queue, the generalized processor sharing queue, and data networks whose resources are shared according to max-min fairness.

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

processor sharing networks
stochastic bounds


evolving cooperative behavior in a power market This paper presents an evolutionary algorithm to develop cooperative strategies for power buyers in a deregulated electrical power market. Cooperative strategies are evolved through the collaboration of the buyer with other buyers defined by the different group memberships. The paper explores how buyers can lower their costs by using the algorithm that evolves their group sizes and memberships. The algorithm interfaces with PowerWorld Simulator to include in the technical aspect of a power system network, particularly the effects of the network constraints on the power flow. Simulation tests on an IEEE 14-bus transmission network are conducted and power buyer strategies are observed and analyzed.

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

evolutionary algorithm
cooperative behavior
power market


Dynamic behaviour of connectionist speech recognition with strong latency constraints This paper describes the use of connectionist techniques in phonetic speech recognition with strong latency constraints. The constraints are imposed by the task of deriving the lip movements of a synthetic face in real time from the speech signal, by feeding the phonetic string into an articulatory synthesiser. Particular attention has been paid to analysing the interaction between the time evolution model learnt by the multi-layer perceptrons and the transition model imposed by the Viterbi decoder, in different latency conditions. Two experiments were conducted in which the time dependencies in the language model (LM) were controlled by a parameter. The results show a strong interaction between the three factors involved, namely the neural network topology, the length of time dependencies in the LM and the decoder latency.

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


An internet of thingsbased personal device for diabetes therapy management in ambient assisted living (AAL) Diabetes therapy management in AAL environments, such as old people and diabetes patients homes, is a very difficult task since many factors affect a patients blood sugar levels. Factors such as illness, treatments, physical and psychological stress, physical activity, drugs, intravenous fluids and change in the meal plan cause unpredictable and potentially dangerous fluctuations in blood sugar levels. Right now, operations related to dosage are based on insulin infusion protocol boards, which are provided by physicians to the patients. These boards are not considering very influential factors such as glycemic index from the diet, consequently patients need to estimate the dosage leading to dose error, which culminates in hyperglycemia and hypoglycemia episode. Therefore, right insulin infusion calculation needs to be supported by the next generation of personal-care devices. For this reason, a personal device has been developed to assist and consider more factors in the insulin therapy dosage calculation. The proposed solution is based on Internet of things in order to, on the one hand, support a patients profile management architecture based on personal RFID cards and, on the other hand, provide global connectivity between the developed patients personal device based on 6LoWPAN, nurses/physicians desktop application to manage personal health cards, glycemic index information system, and patients web portal. This solution has been evaluated by a multidisciplinary group formed by patients, physicians, and nurses.

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

diabetes
insulin therapy
internet of things
6lowpan
rfid
aal


A new model of computation for learning vision modules from examples This paper addresses an important class of mimicry problems, where the goal is to construct a computer program which is functionally equivalent to an observed behaviour. Computer vision research can be considered such a challenge, where a researcher attempts to impart human visual abilities to a computer. Unfortunately this has proved a difficult task, not least because our vision processes occur mostly at a subconscious level. It is therefore useful to study the general mimicry problem in order to develop tools which may assist computer vision research. This paper formalises a mimicry problem as one in which a computer learning system (L) constructs a solution from a given program structure (i.e. template or outline) by posing questions to an Oracle. The latter is an entity which, when given an input value, produces the corresponding output of the function which is to be mimicked. In order to define a program's structure, particularly one which can be extracted from any computer program automatically, a new model of computation is developed. Based on this a fast algorithm which determines the best questions to pose to the Oracle is then described. Thus L relieves the human programmer of the difficulties faced in choosing the examples from which to learn. This is important because a human programmer might inadvertently choose biased, redundant or otherwise unhelpful examples. Results are shown which demonstrate the utility of a complete learning system (L) based on this work. This paper represents background theory and initial algorithms which further work will extend into powerful automatic learning systems, examples of which are found in [36] and [38].

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

machine learning
theoretical computing
automatic program refinement


Hierarchical-granularity holonic modelling Design criteria for distributed and pervasive intelligent systems, such as Multi Agent Systems (MAS), are generally led by the functional decomposition of the given application-dependent knowledge. Consequently, changes either in the problem semantics or in the granularity level description may have a significant impact on the overall system re-engineering process. In order to tackle better these issues, a novel framework called Hierarchical-Granularity Holonic Model (HGHM) is introduced as a holon-based approach to distributed intelligent systems modelling. A holon is an agent endowed with special features. Seen from the outside, a holon behaves like an intelligent agent; seen from the inside, it appears to be decomposable into other holons. This property allows for modelling complex distributed systems at multiple hierarchical-granularity levels by exploiting the different abstraction layers at which the design process is carried out. The major benefit of the proposed approach against traditional holonic systems and MAS is that the entire HGHM-based architecture can be derived directly from the problem ontology as a hierarchical composition of self-similar, modular blocks. This helps designers focussing more on knowledge representation at different granularity levels which is a very basic process, as in topdown problem decomposition. Starting from the literature on holonic systems, a theoretical model of HGHM is introduced and an architectural model is derived accordingly. Finally, a customized application for the case study of distributed indoor air quality monitoring systems is commented and improvements in terms of system design with respect to well-established solutions are considered.

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

hierarchical-granularity holonic model
knowledge-based approach


APPLICATION OF THE PARTITIONING METHOD TO SPECIFIC TOEPLITZ MATRICES We propose an adaptation of the partitioning method for determination of the Moore-Penrose inverse of a matrix augmented by a block-column matrix. A simplified implementation of the partitioning method on specific Toeplitz matrices is obtained. The idea for observing this type of Toeplitz matrices lies in the fact that they appear in the linear motion blur models in which blurring matrices (representing the convolution kernels) are known in advance. The advantage of the introduced method is a significant reduction in the computational time required to calculate the Moore-Penrose inverse of specific Toeplitz matrices of an arbitrary size. The method is implemented in MATLAB, and illustrative examples are presented.

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

partitioning method
toeplitz matrices
matlab


Mixture discrepancy for quasi-random point sets There are various discrepancies that are measures of uniformity for a set of points on the unit hypercube. The discrepancies have played an important role in quasi-Monte Carlo methods. Each discrepancy has its own characteristic and some weakness. In this paper we point out some unreasonable phenomena associated with the commonly used discrepancies in the literature such as the L-p-star discrepancy, the center L-2-discrepancy (CD) and the wrap-around L-2-discrepancy (WD). Then, a new discrepancy, called the mixture discrepancy (MD), is proposed. As shown in this paper, the mixture discrepancy is more reasonable than CD and WD for measuring the uniformity from different aspects such as the intuitive view, the uniformity of subdimension projection, the curse of dimensionality and the geometric property of the kernel function. Moreover, the relationships between MD and other design criteria such as the balance pattern and generalized wordlength pattern are also given. (C) 2012 Elsevier Inc. All rights reserved.

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

curse of dimensionality
generalized wordlength pattern
mixture discrepancy

centered l-2-discrepancy
quasi-monte carlo methods
uniform design


Code orthogonalizing filter based adaptive array antenna using common correlation matrix of time domain signals for multicarrier DS/CDMA systems In this paper, we propose the code: orthogonalizing filter (COF) based adaptive array antenna using sample matrix inversion with common correlation matrix (CCM-SMI) of time domain signals for multicarrier DS/CDMA systems. The conventional array antenna system calculates the weight using the correlation matrix of individual subcarrier's signals. On the other hand, our proposed system calculates the weight using the correlation matrix of time domain signals before FFT operation, so it can reduce the calculation time and the complexity of weight calculation than the conventional scheme, to maintain the system performance. Moreover, we consider the code orthogonalizing filter to reduce the demerit of adaptive array antenna system using sample matrix inversion algorithm with common correlation matrix that requires heavy computational complexity while the signal environment frequently changes. Our proposed system obtains more accurate channel response vector using COF than that of the conventional CCM-SMI based on the matched filter, without increasing the matrix size. The performance is evaluated in term of bit error probability. From the analysis and simulation results, it is shown that our proposed scheme achieves better BER performance than that of the conventional system.

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

adaptive array antenna
common correlation matrix

mc-ds/cdma
code orthogonalizing filter (cof)
sample matrix inversion (smi)


towards reliable osgi framework and applications Upcoming ubiquitous computing systems are required to operate in dynamic, diverse, unverified, and unpredictable operating environment. The OSGi (Open Service Gateway initiative) framework employs the service-oriented approach and the java classloader architecture for the runtime service deployment, that are well suited to the dynamic environment envisioned for home networking and ubiquitous computing. However, the current OSGi framework does not provide full reliability measures, especially for failure conditions such as network, device, and application failures. This paper analyzes software reliability issues in OSGi framework and proposes a proxy-based reliable extensions. The design concept is implemented and partly tested on an open source OSGi platform, Oscar, for the smart home residential gateway test-bed.

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

service oriented architecture (soa)
proxy-based


Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers This paper reports on a new solution approach for the well-known multi-mode resource-constrained project scheduling problem (MRCPSP). This problem type aims at the selection of a single activity mode from a set of available modes in order to construct a precedence and a (renewable and non-renewable) resource feasible project schedule with a minimal makespan. The problem type is known to be NP-hard and has been solved using various exact as well as (meta-)heuristic procedures. The new algorithm splits the problem type into a mode assignment and a single mode project scheduling step. The mode assignment step is solved by a satisfiability (SAT) problem solver and returns a feasible mode selection to the project scheduling step. The project scheduling step is solved using an efficient meta-heuristic procedure from literature to solve the resource-constrained project scheduling problem (RCPSP). However, unlike many traditional meta-heuristic methods in literature to solve the MRCPSP, the new approach executes these two steps in one run, relying on a single priority list. Straightforward adaptations to the pure SAT solver by using pseudo boolean non-renewable resource constraints has led to a high quality solution approach in a reasonable computational time. Computational results show that the procedure can report similar or sometimes even better solutions than found by other procedures in literature, although it often requires a higher CPU time.

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


Supporting decision-making in software engineering with process simulation and empirical studies Decision-making is a complex and important task in software engineering. The current state-of-the-practice is rather non-systematic as it typically relies upon personal judgment and experience without using explicit models. Empirical studies can help but they are costly to conduct and, to some extent, context dependent. Typically it is not efficient or even possible to conduct empirical studies for a large number of context parameter variations. Process simulation offers decision support as well, but currently suffers from a lack of empirical knowledge on the determinants of underlying system dynamics. In this paper we present an assessment of empirical knowledge and simulation techniques for the area of quality assurance planning. There is a strong interdependency between process simulation and empirical models for decision-making in this area: (a) profound empirical knowledge enables process simulation to support decision-making, and (b) the analysis of simulation results can point out situations and factors for which conducting empirical studies would be most worthwhile. This paper discusses critically some of the most important challenges for decision-making in the area of quality assurance planning.

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

decision-making support
software quality planning


finding a minimum circuit in a graph Finding minimum circuits in graphs and digraphs is discussed. An almost minimum circuit is a circuit which may have only one edge more than the minimum. An 0(n 2 ) algorithm is presented to find an almost minimum circuit. The straightforward algorithm for finding a minimum circuit has an 0(ne) behavior. It is refined to yield an 0(n 2 ) average time algorithm. An alternative method is to reduce the problem of finding a minimum circuit to that of finding a triangle in an auxiliary graph. Three methods for finding a triangle in a graph are presented. The first has an 0(e 3/2 ) worst case bound ( (n) for planar graphs); the second takes 0(n 5/3 ) time on the average; the third has an 0(n log7 ) worst case behavior. For digraphs, recent results of Bloniarz, Fisher and Meyer are used to obtain an algorithm with 0(n 2 logn) average behavior.

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

yield graph case method algorithm behavior circuits


Finite element simulation of blood flow in the cerebral artery The purpose of the paper is to develop a numerical simulation system for the clinical study of a cerebral aneurysm. This paper presents the system, which consists of three processes: pre-processing, numerical simulation and post-processing. In the pre-processing process, the three-dimensional solid model was constructed from the computed tomography (CT) angiography raw data. The finite element method (FEM) is used in order to simulate flow in a complicated geometry. The simulation is conducted to investigate hemodynamics of blood flow in the carotid siphon under real flow conditions measured by Doppler ultrasound velocimetry technique. The results are visualized for a better understanding of the flow characteristics such as distributions of the flow pattern and the wall shear stress in the carotid siphon.

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

cerebral aneurysms
medical imaging data
pre-and post-processing


International mobility of researchers in robotics, computer vision and electron devices: A quantitative and comparative analysis We investigated author information in scientific articles by approximately 7,000 researchers for a quantitative analysis of researchers international mobility. From top journals, we traced the movements of more than 2,200 researchers in the research domains of robotics, computer vision and electron devices. We categorized countries characteristics for the balance between the inflow and the outflow of researchers moving internationally. Flow patterns of international mobility confirm that the United States, China and India exhibit the greatest global flows of researchers, with Singapore and Hong Kong attracting remarkable numbers of researchers from other countries. International mobility focusing on institutions reveals that universities in Singapore receive as many foreign researchers as do research universities in the United States. Furthermore, firms and international collaborative research institutes act as alternative receivers to the universities in the electron devices research domain.

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

international mobility
quantitative analysis

flow pattern of researchers
institutional-level analysis


Diameter-sufficient conditions for a graph to be super-restricted connected ? A vertex-cut X X is said to be a restricted cut of a graph G G if it is a vertex-cut such that no vertex u u in G G has all its neighbors in X X . Clearly, each connected component of G?X G ? X must have at least two vertices. The restricted connectivity ??(G) ? ? ( G ) of a connected graph G G is defined as the minimum cardinality of a restricted cut. Additionally, if the deletion of a minimum restricted cut isolates one edge, then the graph is said to be super-restricted connected. In this paper, several sufficient conditions yielding super-restricted-connected graphs are given in terms of the girth and the diameter. The corresponding problem for super-edge-restricted-connected graph is also studied.

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


Reducing the negative effects of sales promotions in supply chains using genetic algorithms This paper considers the detrimental effect of promotions on the supply chain (SC), one of the main causes of the bullwhip effect. A genetic algorithm (GA) is proposed to reduce these negative effects. In order to validate the GA, it is used to determine the optimal ordering policy in an online version of the MIT beer distribution game. Subsequently, the GA is applied in a number of experiments involving deterministic and random demand and lead times combined with sales promotions. It is shown how GAs can be used to dampen the impact of the bullwhip effect and can be used to assist supply managers in predicting reorder quantities along the supply chain.

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

artificial intelligence
efficiency
forecasting


Simulation of a flapping flexible filament in a flowing soap film by the immersed boundary method This paper reports the computer simulation of a flapping flexible filament in a flowing soap film using the immersed boundary method. Our mathematical formulation includes filament mass and elasticity, gravity, air resistance, and the two wires that bound the flowing soap film. The incompressible viscous Navier-Stokes equations, which are used to describe the motion of the soap film and filament in our formulation, are discretized on a fixed uniform Eulerian lattice while the filament equations are discretized on a moving Lagrangian array of points which do not necessarily coincide with the fixed Eulerian mesh points of the fluid computation. The interaction between the filament and the soap film is handled by a smoothed approximation to the Dirac delta function. This delta function approximation is used not only to interpolate the fluid velocity and to apply force to the fluid (as is commonly done in immersed boundary computations), but also to handle the mass of the filament, which is represented in our calculation as delta function layer of fluid mass density supported along the immersed filament. Because of this nonuniform density, we need to use a multigrid method for solving the discretized fluid equations. This replaces the FFT-based method that is commonly used in the uniform-density case. Our main results are as follows. (i) The sustained flapping of the filament only occurs when filament mass is included in the formulation of the model; within a certain range of mass, the more the mass of the filament, the bigger the amplitude of the flapping. (ii) When the length of filament is short enough (below some critical length), the filament always approaches its straight (rest) state, in which the filament points downstream; but when the length is larger, the system is bistable, which means that it can settle into either state (rest state or sustained flapping) depending on the initial conditions. This numerical result we observed in computer simulation is the same as that of the laboratory experiment even though the Reynolds number of the computations is lower than that of the laboratory experiment by two orders of magnitude. (C) 2002 Elsevier Science (USA).

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

immersed boundary method
multigrid method

flapping filament
flag-in-wind
bistability
computational fluid dynamics


methodology for the development of executable system architecture This research is an endeavor to provide an approach that will help in managing complexities of a system architecture at abstract level and allow the architect to visually analyze the proposed system. Convergence of three established modeling tools, ontology, UML, and CPN, will be used to demonstrate the dual functionality (static and dynamic) of the methodology proposed. Ontology and UML are used to model static view of system architecture whereas dynamic/executable model is developed in CPN. Proposed methodology uses OWL ontology to define domain terminology in a domain model and establishes contextual relationship among those terms. As the domain knowledge is modeled in ontology which is machine interpretable and support automated inference. So, an architect can reuse the existing domain model and save time and effort. The proposed methodology uses UML for the specification of behavior and provides the steps to map static view of system architecture modeled in Ontology and UML to dynamic view modeled in CPN. The transformation of static model into executable model will help in conducting behavior analysis of systems architecture.

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