Recovery of surface parameters from stepped-frequency radar returns This paper discusses a method for using the reflected signal from a stepped-frequency radar system to obtain the electrical permittivity and conductivity in a thin layer at the flat surface of a (possibly inhomogeneous) body. The method is based on a band-limited version of geometrical optics. (C) 1999 IMACS/Elsevier Science B.V. All rights reserved.

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

inverse problem
sea ice
progressing wave expansion


Geometric retrieval for grid points in the RAM model We consider the problem of d-dimensional searching (d >= 3) for four query types: range, partial range, exact match and partial match searching. Let N be the number of points, s be the number of keys specified in a partial match and partial range query and t be the number of points retrieved. We present a data structure with worst case time complexities O(t + log(d-2) N), O(t + (d - s) + log(s) N), O( d + root log N) and O(t + (d - s) + s root log N) for each of the aforementioned query types respectively. We also present a second, more concrete solution for exact and partial match queries, which achieves the same query time but has different space requirements. The proposed data structures are considered in the RAM model of computation.

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

multi-dimensional data structures
indexing
spatial data
grid model
file systems


Delay-dependent stability analysis and controller synthesis for discrete-time T-S fuzzy systems with time delays Based on a novel delay-dependent piecewise Lyapunov-Krasovskii functional (DPLYF), this paper presents delay-dependent stability analysis and synthesis methods for discrete-time Takagi-Sugeno (T-S) fuzzy systems with time delays. It is shown that the stability and stabilization with some required performance can be established for the closed loop control system if there exists a DPLKF and that the DPLKF and the corresponding controller can be obtained by solving a set of linear matrix inequalities (LMIs). New algorithms have also been developed to obtain the maximum value of the allowable constant delay and the suboptimal performance upper bound. An example is finally presented to demonstrate the efficiency and advantage of the proposed methods.

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

delay-dependent
lyapunov-krasovskii functional
optimization
piecewise controller
time-delay system


Sensing and gait planning of quadruped walking and climbing robot for traversing in complex environment In this paper, a general study on improving adaptability of quadruped walking and climbing robot in complex environment is presented. First, a sensing system composed of range and gyroscope sensors in a novel arrangement is developed. By combining the sensing signals and the internal state of the robot, the surface geometry of the environment is sufficiently reconstructed in real-time. Secondly, a planning algorithm for the robot to overcome the reconstructed environment is conducted. Based on the reshaped surface, the planning algorithm not only provides the exact body trajectory and foot positions but also the adaptability of the robot in a specific environment. A method to improve the adaptability of the walking and climbing robot is also introduced. Thanks to the adherent ability of the robot, the center of gravity of the robot is allowed to move outside the support polygon to increase the reach-ability of the next swing leg. Finally, the effectiveness of the proposed approach is verified by the performances of the experiments in complex environments using a quadruped walking and climbing robot named MRWALLSPECT IV.

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

walking and climbing robot
sensing
planning


Probability fold change: A robust computational approach for identifying differentially expressed gene lists Identifying genes that are differentially expressed under different experimental conditions is a fundamental task in microarray studies. However, different ranking methods generate very different gene lists, and this could profoundly impact follow-up analyses and biological interpretation. Therefore, developing improved ranking methods are critical in microarray data analysis. We developed a new algorithm, the probabilistic fold change (PFC), which ranks genes based on a confidence interval estimate of fold change. We performed extensive testing using multiple benchmark data sources including the MicroArray Quality Control (MAQC) data sets. We corroborated our observations with MAQC data sets using qRT-PCR data sets and Latin square spike-in data sets. Along with PFC, we tested six other popular ranking algorithms including Mean Fold Change (FC), SAM, t-statistic (T), Bayesian-t (BAYT), Intensity-Conditional Fold Change (CFC), and Rank Product (RP). PFC achieved reproducibility and accuracy that are consistently among the best of the seven ranking algorithms while other ranking algorithms would show weakness in some cases. Contrary to common belief, our results demonstrated that statistical accuracy will not translate to biological reproducibility and therefore both quality aspects need to be evaluated.

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

dna microarray
gene expression
gene-ranking algorithm


Combining frequency and time domain approaches to systems with multiple spike train input and output A frequency domain approach and a time domain approach have been combined in an investigation of the behaviour of the primary and secondary endings of an isolated muscle spindle in response to the activity of two static fusimotor axons when the parent muscle is held at a fixed length and when it is subjected to random length changes. The frequency domain analysis has an associated error process which provides a measure of how well the input processes can be used to predict the output processes and is also used to specify how the interactions between the recorded processes contribute to this error. Without assuming stationarity of the input, the time domain approach uses a sequence of probability models of increasing complexity in which the number of input processes to the model is progressively increased. This feature of the time domain approach was used to identify a preferred direction of interaction between the processes underlying the generation of the activity of the primary and secondary endings. In the presence of fusimotor activity and dynamic length changes imposed on the muscle, it was shown that the activity of the primary and secondary endings carried different information about the effects of the inputs imposed on the muscle spindle. The results presented in this work emphasise that the analysis of the behaviour of complex systems benefits from a combination of frequency and time domain methods.

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

multiple spike trains
neural coding
maximum likelihood
canonical coherence
multivariate point processes


The role of Chinese universities in enterpriseuniversity research collaboration In this paper the role of Chinese universities in enterpriseuniversity research collaboration is investigated. This study focuses on a special aspect of the collaborationco-authored articles. The two cases are analyzed: (1) research collaboration between Baosteel Group Corporation and Chinese universities; (2) research collaboration between China Petroleum & Chemical Corporation and Chinese universities. The co-authorship data over the period 19982007 were searched from CNKI database, the largest Chinese publication and citation database. The main findings are as follows: the number of articles co-authored by enterprise and university scientists has been increasing rapidly; the share of co-authored articles has been growing; the authors from universities are more possible to be the first authors; as a whole, enterpriseuniversity co-authored articles tend to receive more citations and get downloaded more frequently; a mathematical orientation emerges in the enterpriseuniversity articles. To reveal and describe such a trend the methods of keywords analysis and co-occurrence analysis are applied. The Chinese governments policy instruments and substantial supports for pushing and improving enterpriseuniversity research collaboration are introduced and analyzed.

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

chinese universities
mathematical orientation


research and implementation of management software for san based on clustering technology We present a new SAN architecture by introducing the advantage of clustering technology into traditional SAN system, and discuss the implement of this system. Furthermore, a mathematical model and the corresponding algorithm are developed for representing related backup task. A scheduling algorithm is also developed on the basis of the quasi ordering for related backup task in timing submittal. Experiment results show that this algorithm can improve the performance of scheduling and executing related backup tasks.

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

san
related backup task
clustering technology


Fluid registration of diffusion tensor images using information theory We apply an information -theoretic cost metric, the symmetrized Kullback-Leibler (sKL) divergence, or J-divergence, to fluid registration of diffusion tensor images. The difference between diffusion tensors is quantified based on the sKL-divergence of their associated probability density functions (PDFs). Three-dimensional DTI data from 34 subjects were fluidly registered to an optimized target image. To allow large image deformations but preserve image topology, we regularized the flow with a large -deformation diffeomorphic mapping based on the kinematics of a Navier-Stokes fluid. A driving force was developed to minimize the J-divergence between the deforming source and target diffusion functions, while reorienting the flowing tensors to preserve fiber topography. In initial experiments, we showed that the sKL-divergence based on full diffusion PDFs is adaptable to higher-order diffusion models, such as high angular resolution diffusion imaging (HARDI). The sKL-divergence was sensitive to subtle differences between two diffusivity profiles, showing promise for nonlinear registration applications and multisubject statistical analysis of HARDI data.

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

high angular resolution diffusion imaging (hardi)


Robust and practical analog-to-digital conversion with exponential precision Beta-encoders with error correction were introduced by Daubechies, DeVore, Gunturk and Vaishampayan as an alternative to pulse-code modulation (PCM) for analog-to-digital conversion. An N-bit beta-encoder quantizes a real number by computing one of its N-bit truncated beta-expansions where beta is an element of (1, 2) determines the base of expansion. These encoders have (almost) optimal rate-distortion properties like PCM; furthermore, they exploit the redundancy of beta-expansions and thus they are robust with respect to quantizer imperfections. However, these encoders have the shortcoming that the decoder needs to know the value of the base of expansion beta, a gain factor in the circuit used by the encoder, which is an impractical constraint. We present a method to implement beta-encoders so that they are also robust with respect to uncertainties of the value of beta. The method relies upon embedding the value of beta in the encoded bitstream. We show that this can be done without a priori knowledge of beta by the transmitting party. Moreover the algorithm still works if the value of beta changes (slowly) during the implementation.

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

analog-to-digital (a/d) conversion
beta-encoders
beta-expansions
quantization
sampling
sigma-delta


social group suggestion from user image collections Photo-sharing services have attracted millions of people and helped construct massive social networks on the Web. A popular trend is that users share their image collections within social groups, which greatly promotes the interactions between users and expands their social networks. Existing systems have difficulties in generating satisfactory social group suggestions because the images are classified independently and their relationship in a collection is ignored. In this work, we intend to produce suggestions of suitable photo-sharing groups from a user's personal photo collection by mining images on the Web and leveraging the collection context. Both visual content and textual annotations are integrated to generate initial prediction of the events or topics depicted in the images. A user collection-based label propagation method is proposed to improve the group suggestion by modeling the relationship of images in the same collection as a sparse weighted graph. Experiments on real user images and comparisons with the state-of-the-art techniques demonstrate the effectiveness of the proposed approaches.

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


Heuristics for determining a patrol path of an unmanned combat vehicle We consider a problem of finding a path of an unmanned combat vehicle that patrols a given area by visiting a given set of checkpoints with the objective of minimizing possibility of enemy's infiltration. In this study, we focus on a situation in which the possibility of enemy's infiltration at (through) each checkpoint is increased nonlinearly as time passes and the checkpoint may be patrolled multiple times during a planning horizon. We develop two-phase heuristics in which an initial path is constructed in the first phase and then it is improved in the second phase. For evaluation of the performance of the proposed heuristics, computational experiments are performed on randomly generated problem instances, and results show that the heuristics give good solutions in a reasonably short time. (C) 2012 Elsevier Ltd. All rights reserved.

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


exploiting locality for query processing and compression in scientific databases Improvements in the efficiency of scientific simulations have lead to requirements of large databases. The data captured in such simulations is of large scale and poses challenges in storage, transfer and query processing. However, the data are collected every fraction of a second, storing some redundant information. Thus, the temporal and spatial locality of the data gives us an opportunity to store and transfer over networks efficiently. The data locality also helps in efficiently processing complex analytical queries that are popular in scientific databases. Many scientific data analysis queries involve more than one object/body of interest. Processing such queries pose super-linear computational complexity. In this paper, we propose preliminary solutions to some of these problems along with initial results. Mainly, we try to exploit the spatial and temporal proximity of the data to achieve high levels of compression for efficient storage and analytical query processing.

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


Audio-visual event recognition in surveillance video sequences In the context of the automated surveillance field, automatic scene analysis and understanding systems typically consider only visual information, whereas other modalities, such as audio, are typically disregarded. This paper presents a new method able to integrate audio and visual information for scene analysis in a typical surveillance scenario, using only one camera and one monaural microphone. Visual information is analyzed by a standard visual background/foreground (BG/FG) modelling module, enhanced with a novelty detection stage and coupled with an audio BG/FG modelling scheme. These processes permit one to detect separate audio and visual patterns representing unusual unimodal events in a scene. The integration of audio and visual data is subsequently performed by exploiting the concept of synchrony between such events. The audio-visual (AV) association is carried out on-line and without need for training sequences, and is actually based on the computation of a characteristic feature called audio-video concurrence matrix, allowing one to detect and segment AV events, as well as to discriminate between them. Experimental tests involving classification and clustering of events show all the potentialities of the proposed approach, also in comparison with the results obtained by employing the single modalities and without considering the synchrony issue.

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

multimodal background modelling and foreground detection


Control of pH processes using fuzzy modeling of titration curve Model-based pH control is a difficult problem due to its inherent nonlinearity and time-varying characteristics, This is specially the case when the pH regulation of streams consisting hundreds of constituents with varying concentrations is desired. The pH process can be modeled by using conservation laws and neutrality condition. An alternative to this mechanistic modeling is using nonlinear empirical modeling such as fuzzy modeling. This paper proposes a new approach of fuzzy modeling of titration curves, which can be used for control purposes. The Takagi-Sugeno model was used for the modeling of titration curve. Two control algorithms, which are designed based on the titration curve, namely, Strong Acid Equivalent (SAE) and Multiple Model, Switching and Tuning (MMST) have been used. The efficacy of the proposed approach is demonstrated via simulation and experimental study of a pH control system. (c) 2006 Elsevier 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

linguistic modeling
fuzzy numbers
ph process control
hybrid modeling


Deterministic integration algorithms for stochastic response computations of FE-systems An algorithm for the computation of the covariance matrix of the the stochastic response of linear and non-linear structures is introduced. General deterministic loading perturbed by discrete white noise is treated. The merits of the algorithm are most pronounced when dealing with large FE-models but is also competitive for MDOF-systems. The covariance matrix is represented by employing the KarhunenLove expansion. The corresponding deterministic KarhunenLove vectors can be integrated using the preferred deterministic step-by-step integration schemes, e.g. Newmark algorithm or other suitable deterministic schemes. Hence the procedure is not restricted to special integration procedures. A relatively small number m?n of KarhunenLove vectors is, even for large FE-models, sufficient to represent accurately the covariance matrix which is generally a full symmetric quadratic matrix of dimension?2n, where n denotes the number of DOF of the FE-model. Hence space reduction is introduced right from the beginning, leading to a feasible, and moreover efficient algorithm for large FE-models.

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

stochastic response
covariance matrix
karhunenlove expansion

large fe-models
white noise excitation
jacobi-transformation


Class-dependent rough-fuzzy granular space, dispersion index and classification A new rough-fuzzy model for pattern classification based on granular computing is described in the present article. In this model, we propose the formulation of class-dependent granules in fuzzy environment. Fuzzy membership functions are used to represent the feature-wise belonging to different classes, thereby producing fuzzy granulation of the feature space. The fuzzy granules thus generated possess better class discriminatory information that is useful in pattern classification with overlapping classes. Neighborhood rough sets are used in the selection of a subset of granulated features that explore the local/contextual information from neighbor granules. The model thus explores mutually the advantages of class-dependent fuzzy granulation and neighborhood rough set. The superiority of the proposed model to other similar methods is established with seven completely labeled data sets, including a synthetic remote sensing image, and two partially labeled real remote sensing images collected from satellites. Various performance measures, including a new method of dispersion estimation, are used for comparative analysis. The new measure called dispersion score quantifies the nature of distribution of the classified patterns among different classes so that lower is the dispersion, better is the classifier. The proposed model learns well even with a lower percentage of training set that makes the system fast. The model is seen to have lowest dispersion measure (i.e., misclassified patterns are confined to minimum number of classes) compared to others; thereby reflecting well the overlapping characteristics of a class with others, and providing a strong clue for the class-wise performance improvement with available higher-level information. The statistical significance of the proposed model is also supported by the ?2 ? 2 test.

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

fuzzy information granulation
rough neighborhood sets
rough-fuzzy granular computing
soft computing
pattern recognition


Extracting new patterns for cardiovascular disease prognosis Cardiovascular diseases constitute one of the main causes of mortality in the world, and machine learning has become a powerful tool for analysing medical data in the last few years. In this paper we present an interdisciplinary work based on an ambulatory blood pressure study and the development of a new classification algorithm named REMED. We focused on the discovery of new patterns for abnormal blood pressure variability as a possible cardiovascular risk factor. We compared our results with other classification algorithms based on Bayesian methods, decision trees, and rule induction techniques. In the comparison, REMED showed similar accuracy to these algorithms but it has the advantage of being superior in its capacity to classify sick people correctly. Therefore, our method could represent an innovative approach that might be useful in medical decision support for cardiovascular disease prognosis.

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

cardiovascular diseases
machine learning
blood pressure variability
classification
medical decision support
prognosis


Reasoning with the finitely many-valued ?ukasiewicz fuzzy Description Logic SROIQ SROIQ ? Fuzzy Description Logics are a formalism for the representation of structured knowledge affected by imprecision or vagueness. They have become popular as a language for fuzzy ontology representation. To date, most of the work in this direction has focused on the so-called Zadeh family of fuzzy operators (or fuzzy logic), which has several limitations. In this paper, we generalize existing proposals and show how to reason with a fuzzy extension of the logic SROIQ SROIQ , the logic behind the language OWL 2, under finitely many-valued ?ukasiewicz fuzzy logic. We show for the first time that it is decidable over a finite set of truth values by presenting a reasoning preserving procedure to obtain a non-fuzzy representation for the logic. This reduction makes it possible to reuse current representation languages as well as currently available reasoners for ontologies.

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

fuzzy ontologies
logic for the semantic web


assistive music browsing using self-organizing maps Music listening is an important activity for many people. Advances in technology have made possible the creation of music collections with thousands of songs in portable music players. Navigating these large music collections is challenging especially for users with vision and/or motion disabilities. In this paper we describe our current efforts to build effective music browsing interfaces for people with disabilities. The foundation of our approach is the automatic extraction of features for describing musical content and the use of self-organizing maps to create two-dimensional representations of music collections. The ultimate goal is effective browsing without using any meta-data. We also describe different control interfaces to the system: a regular desktop application, an iPhone implementation, an eye tracker, and a smart room interface based on Wii-mote tracking.

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

sound analysis
assistive technologies
eye tracking
music information retrieval
content-aware user interfaces


Strong convergence of the modified Ishikawa iterative method for infinitely many nonexpansive mappings in Banach spaces In this paper, we introduce a new modified Ishikawa iterative process for computing fixed points of an infinite family nonexpansive mapping in the framework of Banach spaces. Then, we establish the strong convergence theorem of the proposed iterative scheme under some mild conditions which solves a variational inequality. The results obtained in this paper extend and improve on the recent results of Qin et al. [Strong convergence theorems for an infinite family of nonexpansive mappings in Banach spaces. Journal of Computational and Applied Mathematics 230 (1) (2009) 121-127], Cho et al. [Approximation of common fixed points of an infinite family of nonexpansive mappings in Banach spaces, Computers and Mathematics with Applications 56 (2008) 2058-2064] and many others. (C) 2010 Elsevier Ltd. 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 B I B I O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O B I O O O 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

nonexpansive mapping
strong convergence
infinite family


From mobile phones to responsible devices Mobile phones have evolved from simple voice terminals into highly-capable, general-purpose computing platforms. While people are becoming increasingly more dependent on such devices to perform sensitive operations, protect secret data, and be available for emergency use, it is clear that phone operating systems are not ready to become mission-critical systems. Through a pair of vulnerabilities and a simulated attack on a cellular network, we demonstrate that there are a myriad of unmanaged mechanisms on mobile phones, and that control of these mechanisms is vital to achieving reliable use. Through such vectors, mobile phones introduce a variety of new threats to their own applications and the telecommunications infrastructure itself. In this paper, we examine the requirements for providing effective mediation and access control for mobile phones. We then discuss the convergence of cellular networks with the Internet and its impact on effective resource management and quality of service. Based on these results, we argue for user devices that enable predictable behavior in a network-where their trusted computing bases can protect key applications and create predictable network impact. Copyright (C) 2010 John Wiley & Sons, Ltd.

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

cellular security
vulnerability analysis


multi-objective feature selection in music genre and style recognition tasks Feature selection is an important prerequisite for music classification which in turn is becoming more and more ubiquitous since entering the digital music age. Automated classification into genres or even personal categories is currently envisioned even for standard mobile devices. However, classifiers often fail to work well with all available features, and simple greedy methods often fail to select good feature sets, making feature selection for music classification a natural field of application for evolutionary approaches in general, and multi-objective evolutionary algorithms in particular. In this work, we study the potential of applying such a multi-objective evolutionary optimization algorithm for feature selection with different objective sets. The result is promising, thus calling for deeper investigations of this approach.

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


A pseudorandom generator from any one-way function Pseudorandom generators are fundamental to many theoretical and applied aspects of computing. We show how to construct a pseudorandom generator from any one-way function. Since it is easy to construct a one-way function from a pseudorandom generator, this result shows that there is a pseudorandom generator if and only if there is a one-way function.

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

one-way function
cryptography
complexity theory


Leveraging information sharing to configure supply chains As supply chains evolve beyond the confines of individual organizations, information sharing has become the holy grail in supply chain technology. Although the value of information sharing is well recognized, there is little research on how to use it to configure supply chains. This paper proposes a parameterized model to capture information sharing in a supply chain. By changing the parameters of this model, we actually adjust the degree of information sharing and create new supply chain configurations. Configurations are the means of responding to events or changes in supply chains in a timely manner. A complete example is used to demonstrate this methodology. We also perform simulation experiments to compare configurations and to understand the effect of information sharing on supply chain performance. Thus, we show how to achieve supply chain configurability by leveraging information sharing. A supply chain architecture which allows agility, adaptability and alignment of partner interests is also proposed based on this methodology.

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

information sharing
supply chain configurability
configurations
simulation

coordination
information flows
supply chain event management


Experimental identification of turbulent fluid forces applied to fuel assemblies using an uncertain model and fretting-wear estimation This paper is devoted to the identification of stochastic loads applied to fuel assemblies using an uncertain computational model and experimental measurements of responses. The stochastic loads applied to the structure are induced by a turbulent flow. The structure is made up of a nonlinear complex dynamical system. The experimental responses of the structure are obtained from strain sensors located on the structure. There are several sources of uncertainties in this experimental identification problem of the stochastic loads: uncertainties on the nonlinear dynamical computational model of the structure (fuel assemblies), uncertainties on the parameters of the mathematical model of the stochastic loads themselves and finally, measurements errors. All these sources of uncertainties are identified and taken into account in the identification process of the stochastic loads. Then, the stochastic nonlinear dynamical computational model of fuel assemblies on which the identified stochastic loads are applied yields interesting results concerning the robustness of the estimation of the fretting-wear of the fuel rods.

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

uncertain stochastic loads
uncertain nonlinear dynamical system


Actuarial Assessment of Risk among Sex Offenders The appraisal of risk among sex offenders has seen recent advances through the advent of actuarial assessments. Statistics derived from Relative Operating Characteristics (ROCs) permit the comparison of predictive accuracies achieved by different instruments even among samples that exhibit different base rates of recidivism. Such statistics cannot, however, solve problems introduced when items from actuarial tools are omitted, when reliability is low, or when there is high between-subject variability in the duration of the follow-up. We present empirical evidence suggesting that when comprehensive actuarial tools (VRAG and SORAG) are scored with high reliability, without missing items, and when samples of offenders have fixed and equal opportunity for recidivism, predictive accuracies are maximized near ROC areas of 0.90. Although the term dynamic has not been consistently defined, such accuracies leave little room for further improvement in long-term prediction by dynamic risk factors. We address the mistaken idea that long-term, static risk levels have little relevance for clinical intervention with sex offenders. We conclude that highly accurate prediction of violent criminal recidivism can be achieved by means of highly reliable and thorough scoring of comprehensive multi-item actuarial tools using historical items (at least until potent therapies are identified). The role of current moods, attitudes, insights, and physiological states in causing contemporaneous behavior notwithstanding, accurate prediction about which sex offenders will commit at least one subsequent violent offense can be accomplished using complete information about past conduct.

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


Intracortical vs. thalamocortical processing of spatial working memory Working memory processes contain not only maintenance but manipulation of the working memory contents. The system of the mediodorsal (MD) nucleus and the prefrontal cortex is considered to contribute to some aspects of the working memory processes. This article studies computationally the characteristics of the integrated cortical and thalamocortical system. The model circuit is operated in the thalamocortical mode, in which the thalamocortical inputs can control the cortical working memory representation. Our simulation shows that transient excitatory inputs to the MD relay cells can erase the working memory representation through the intracortical processes, especially the cross-directional inhibition.

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

intracortical
spatial working memory
thalamocortical


AFOPro: a nutrient management decision support system for the United States ? AFOPro is a response to the need to track nitrogen (N), phosphorus (P) and potassium (K) in livestock manure generated by the confined animal feeding operations (CAFOs) as well as in commercial fertilizer, and applied as nutrient sources in agricultural fields in the United States. This system may be used by planners that include consultants, state agency personnel, extension specialists, and producers/owners to make allocation decisions optimum for an agricultural field to meet the crop needs, while minimizing the possible impacts on the watersheds. AFOPro has four basic modules: (1) AFOPro Core, a nutrient management decision module; (2) AFOPro Web, a web module for updating the knowledge base; (3) AFOPro Spatial, a spatial module interfacing with a geographic information system to generate spatial information regarding agricultural fields; and (4) AFOPro PI Calculator, a module for calculating state-specific phosphorus indices (PI) for agricultural fields. AFOPro is flexible, transparent, interactive, and supports 16 states of the United States as of July 2003.

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

decision support system
nutrient management
afopro
united states

animal feeding operation
phosphorus index


A NOVEL SOFT COMPUTING APPROACH TO COMPONENT FAULT DETECTION AND ISOLATION OF CNC X-AXIS DRIVE SYSTEM We propose a novel soft computing (SC) based approach to design fault detection and isolation (FDI) systems for industrial plants, in particular a highly nonlinear CNC X-axis drive system's component fault detection. The aim of this paper is twofold. One is to present a general description of various concepts such as the novel fuzzy-neuro architecture that uses fuzzy clustering to build a nominal model, fuzzy decision-making subsystems, a central processing unit for estimation of fault location, and finally RBF neural networks to estimate fault size. The other aim is to apply proposed method to diagnosis of component faults of a CNC X-axis drive system amid significant noise levels. Simulation results demonstrate the significance of the proposed approach.

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

fault detection and isolation (fdi)
soft computing (sc)
fuzzy decision-making systems
cnc x-axis drive systems


Notions of hyperbolicity in monoids We introduce a notion of hyperbolicity in monoids which is a restriction of that suggested by Duncan and Gilman. One advantage is that the notion gives rise to efficient algorithms for dealing with certain questions: for example, the word problem can be solved in time O(n log n). We also introduce a new way of defining automatic monoids which provides a uniform framework for the discussion ofthese concepts. Hyperbolic monoids (in the sense introduced here) turn out to be biautomatic. (C) 2009 Elsevier B.V. All rights reserved.

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

hyperbolic monoid
automatic monoid
biautomatic monoid


Portable security transaction protocol The Portal Security Transaction Protocol (PSTP) is a new signature technology that adds signature semantics to one-time password technology. PSTP was developed to secure transactions in the financial services industry; however, PSTP may be applicable to signatures in other spaces. PSTP technology provides high signature strength of mechanism without requiring asymmetric key pairs deployed to client machines. PSTP provides cryptographic after-the-fact evidence of a transaction event in a secured log.

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

authentication
one-time password
pki
financial institution
bank
non-repudiation
key management
security protocols
data integrity
entropy
consequential evidence


Coloring the square of the Kneser graph KG ( 2 k + 1 , k ) and the Schrijver graph SG ( 2 k + 2 , k ) The Kneser graph KG ( n , k ) is the graph whose vertex set consists of all k k -subsets of an n n -set, and two vertices are adjacent if and only if they are disjoint. The Schrijver graph SG ( n , k ) is the subgraph of KG ( n , k ) induced by all vertices that are 2-stable subsets. The square G2 G 2 of a graph G G is defined on the vertex set of G G such that distinct vertices within distance two in G G are joined by an edge. The span ?(G) ? ( G ) of G G is the smallest integer m m such that an L(2,1) L ( 2 , 1 ) -labeling of G G can be constructed using labels belonging to the set {0,1,,m} { 0 , 1 , , m } . The following results are established. (1) ? ( KG 2 ( 2 k + 1 , k ) ) ? 3 k + 2 for k?3 k ? 3 and ? ( KG 2 ( 9 , 4 ) ) ? 12 ; (2) ? ( SG 2 ( 2 k + 2 , k ) ) = ? ( SG ( 2 k + 2 , k ) ) = 2 k + 2 for k?4 k ? 4 , ? ( SG 2 ( 8 , 3 ) ) = 8 , ? ( SG ( 8 , 3 ) ) = 9 , ? ( SG 2 ( 6 , 2 ) ) = 9 , and ? ( SG ( 6 , 2 ) ) = 8 .

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

chromatic number
l(2
1) l ( 2
1 ) -labeling l(2
1 ) l(2
1 ) l ( 2
1 )
graph square


Fractional semilinear differential inclusions In this paper, we first present a version of Filippovs Theorem for fractional semilinear differential inclusions of the form,

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

fractional differential inclusions
fractional derivative
fractional integral
fixed point
compactness
absolute retract


The effect of synergy enhancement on information technology portfolio selection This paper investigates how firms can use synergy to optimize their information technology portfolios. We begin by developing a framework for the portfolio selection by identifying three types of information technology synergy. Next, we use this framework to examine the impact of different types of synergy on the portfolio selection. Analytical models are developed to illustrate the roles of different types of the synergy, and analytical and computational methods are used to investigate the impact of the synergy. The analysis in this paper provides conditions in which synergy enhancement results in a more efficient or a less efficient portfolio. Our study establishes that firms with higher risk thresholds are more likely to obtain more efficient information technology portfolios by enhancing synergy, whereas firms with lower risk thresholds are less likely to benefit from enhancing synergy.

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

it portfolio management
it synergy
modeling
analytic


A local adaptive image descriptor The local binary pattern (LBP) is a robust but computationally simple approach in texture analysis. However, LBP performs poorly in the presence of noise and large illumination variation. Thus, a local adaptive image descriptor termed as LAID is introduced in this proposal. It is a ternary pattern and is able to generate persistent codes to represent microtextures in a given image, especially in noisy conditions. It can also generate stable texture codes if the pixel intensities change abruptly due to the illumination changes. Experimental results also show the superiority of the proposed method over other state-of-the-art methods.

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


Spacetime receivers for GSM radio interfaces in subway tunnel environments In this paper, we investigate how to increase the capacity of GSM (Global System for Mobile communications) radio interfaces in subway tunnel environments by means of antenna arrays and SpaceTime (ST) receivers. We address the modeling, both theoretically and experimentally, of the multiple-antenna wireless channels encountered in subway tunnels. We demonstrate that propagation is conveniently modeled by a flat-fading channel, but there exist strong spatial correlations among channel components that decrease capacity and affect receivers' performance. Different spacetime GSM receiving strategies have also been investigated. We first consider ST equalization techniques that only account for the noise and the controlled Intersymbol Interference (ISI) introduced by the modulation format employed in GSM. Then, we analyze the performance of receivers that incorporate ST coding capabilities and show the superior performance of iterative MAP (Maximum a Posteriori) receivers that interchange soft information among the equalizer and the ST decoder. All receivers are evaluated with experimental channels measured in the subway of Paris. Copyright 2002 John Wiley & Sons, Ltd.

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

spacetime receivers
gsm radio interfaces

multiple-input multiple-output (mimo) channels

iterative maximum a posteriori (map) decoding


Multi-Objective Handover in LTE Macro/Femto-Cell Networks One of the key elements in the emerging, packet-based long term evolution (LTE) cellular systems is the deployment of multiple femtocells for the improvement of coverage and data rate. However, arbitrary overlaps in the coverage of these femtocells make the handover operation more complex and challenging. As the existing handover strategy of LTE systems considers only carrier to interference plus noise ratio (CINR), it often suffers from resource constraints in the target femtocell, thereby leading to handover failure. In this paper, we propose a new efficient, multi-objective handover solution for LTE cellular systems. The proposed solution considers multiple parameters like signal strength and available bandwidth in the selection of the optimal target cell. This results in a significant increase in the handover success rate, thereby reducing the blocking of handover and new sessions. The overall handover process is modeled and analyzed by a three-dimensional Markov chain. The analytical results for the major performance metrics closely resemble the simulation results. The simulation results show that the proposed multi-objective handover offers considerable improvement in the session blocking rates, session queuing delay, handover latency, and goodput during handover.

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

long term evolution (lte)
multi-objective
queuing analysis


Periodic boundary value problem for first-order impulsive functional differential equations ? This paper discusses the periodic boundary value problem for a class of first-order impulsive functional differential equations. We establish several existence results under weaker hypotheses by using the LeraySchauder alternative, the lower and upper solution method and the monotone iterative technique. The corresponding results in the literature are improved or extended, some examples are also given to illustrate the advantage of the results.

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


Document ranking for variable bit-block compression signatures Variable bit-block compression (VBC) signature is extended for document ranking. Two different extensions were experimented: the weighted VBC (WVBC) scheme and the aggregate VBC (AVBC) scheme. For both, analytical bounds of the additional storage for the term frequencies were derived. The upper and lower bounds of WVBC signatures were better than the corresponding bounds for AVBC signatures. In general, these bounds are functions of the word size (in bits) of the term frequencies. Therefore, term frequencies were scaled to reduce the word size. Experiments showed that the additional storage cost is closer to the lower than the upper bound for both WVBC and AVBC signatures. In addition, WVBC signatures were better than AVBC signatures in terms of storage and retrieval speed. Logarithmic scaling was found to be significantly better than linear scaling, in measuring the agreement of document ranking against the case without scaling, using the Kendall rank-order correlation. If a 75% ranking performance is acceptable, then the additional storage of the term frequencies is only 3.4% of all the indexed documents.

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

information retrieval
signature file
indexing and document ranking


Contemporary cybernetics, systems and management science - New initiatives in building human-computer interfaces Purpose - This paper aims to review current advances in development of human-computer interfaces. Design/methodology/approach - A general review and survey of selected research and development topics. Findings - Illustrates the multi- and trans-disciplinary natures of studies in cybernetics, systems and management science with a view to further research and development activity. Practical iinplications - The choice of reviews provides the awareness of the current trends in these areas of endeavour. Originality/value - The reviews are selected from a global database and give a studied assessment of current research and development initiatives.

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

computers
interface management
research methods


Numerical simulations of miscible fluids on a rotating Hele-Shaw cell with effects of Coriolis forces The effects of Coriolis forces to interfacial stabilities on miscible rotating Hele-Shaw flows are investigated by means of highly accurate numerical schemes. Two major influences on the interfaces, i.e. the stabilization of circumferential fingerings and the unstable body distortion of droplets, are observed. These two phenomena can be represented by two characteristic measurements, i.e. interfacial length and radius of gyration, respectively. Without an additional injection, the miscible interface is found to be more stable at higher Coriolis factors, based on both the judgments of growths in interfacial length and the radius of gyration. However, with an additional injection, a visible body distortion with suppressed interfacial fingerings at higher Coriolis factors leads to inconsistent developments in these two characteristic measurements. The stabilized effect of interfacial fingering delays and weakens the growth in interfacial length at higher Coriolis factors, while faster and greater growth in the radius of gyration is observed because of the significant body distortion. As a result, the effects of the Coriolis forces on the miscible interfacial instabilities should be addressed with great caution. Copyright (c) 2005 John Wiley & Sons, Ltd.

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

rotating hele-shaw cell
fingering instabilities


A method of inclusion of security constraints with distributed optimal power flow In this paper, we propose that the SCOPF (Security Constrained Optimal Power Flow) be solved in a decentralized framework, consisting of regions, using a price-based mechanism. We first solve the distributed OPF problem to determine the maximum secure simultaneous transfer capability of each tie-line between adjacent regions by taking only the security constraints imposed on the tie-lines into account. And then, the regional SCOPF is performed using the conventional LP approach. A description of the inclusion of security constraints with the distributed OPF algorithm will be given, followed by a case study for the 3-region IEEE 24-Bus reliability test system.

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

security-constrained opf
interior-point method


How to assess the success of National Spatial Data Infrastructures? In the information age, information has become of vital importance to the economic and social development of a country. Especially geographic information is of increasing importance for the successful execution of (public) tasks. Spatial data infrastructures (SDIs) facilitate the collection, maintenance, dissemination, and use of spatial information. Due to the continuous change of the components of the SDI, the organisational component needs to change accordingly to enable the further development of an SDI. The authors used organisational theory to develop a means to assess the success of a National SDIs organisational context. This paper works out indicators and key conditions enabling the further development of an NSDI, accounting for its stepwise development. Crucial aspects from an organisational perspective in NSDI development are the existence of a vision, leadership, communication strategy, coherence and intention of the geographic community to initiate new innovations. The extent to which these aspects are present in an SDI initiative determines its stage of development, and as a result the success of that SDI. The NSDI characteristics of The Netherlands and the United States are used to test the proposed framework.

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

spatial data infrastructures
nsdi
organisational theory
development


Concept, analysis, and demonstration of a novel delay network exhibiting stochastic resonance induced by external noise Analysis of the performance degradation in Collins network with noisy input. Proposal of delay network which is effective in the noisy input situation. Evaluation of the delay network with analysis, numerical simulation and experiment.

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

sub-threshold signal
arrayed system
inout correlation


A comprehensive approach for the development of modular software architecture description languages Research over the past decade has revealed that modeling software architecture at the level of components and connectors is useful in a growing variety of contexts. This has led to the development of a plethora of notations for representing software architectures, each focusing on different aspects of the systems being modeled. In general, these notations have been developed without regard to reuse or extension. This makes the effort in adapting an existing notation to a new purpose commensurate with developing a new notation from scratch. To address this problem, we have developed an approach that allows for the rapid construction of new architecture description languages (ADLs). Our approach is unique because it encapsulates ADL features in modules that are composed to form ADLs. We achieve this by leveraging the extension mechanisms provided by XML and XML schemas. We have defined a set of generic, reusable ADL modules called xADL 2.0, useful as an ADL by itself, but also extensible to support new applications and domains. To support this extensibility, we have developed a set of reflective syntax-based tools that adapt to language changes automatically, as well as several semantically-aware tools that provide support for advanced features of xADL 2.0. We demonstrate the effectiveness, scalability, and flexibility of our approach through a diverse set of experiences. First, our approach has been applied in industrial contexts, modeling software architectures for aircraft software and spacecraft systems. Second, we show how xADL 2.0 can be extended to support the modeling features found in two different representations for modeling product-line architectures. Finally, we show how our infrastructure has been used to support its own development. The technical contribution of our infrastructure is augmented by several research contributions: the first decomposition of an architecture description language into modules, insights about how to develop new language modules and a process for integrating them, and insights about the roles of different kinds of tools in a modular ADL-based infrastructure.

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

design
architecture description languages
xadl 2.0
archstudio 3


near-/sub-threshold dll-based clock generator with pvt-aware locking range compensation A near-/sub-threshold programmable clock generator is proposed in this paper. The major challenge of the ultra-low voltage (ULV) circuits is that the lock-in range of the delay line is easily affected by the environmental variations. In the proposed clock generator, there is a PVT compensation unit which consists of a set of delay line and a PVT detector. The unit is responsible for adjusting the lock-in range of clock generator to guarantee successful clock lock. In addition, the variation-aware logic design is performed in the clock generator, which improves the reliability on process variation. Also, the adoption of pulse-circulating scheme suppresses process induced output clock jitter. Furthermore, it has the ability to generate the output clock with frequency from 1/8 to 4 times of the reference clock. The clock generator has been designed using UMC 65nm CMOS technology. The frequencies of reference clock are 625 KHz at 0.2V and 5MHz at 0.5V. The power consumptions are 0.18?W and 5.17?W, respectively, at 0.2V and 0.5V. The core area of this clock generator is 0.01mm 2 .

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


Towards a framework for developing semantic relatedness reference standards Our objective is to develop a framework for creating reference standards for functional testing of computerized measures of semantic relatedness. Currently, research on computerized approaches to semantic relatedness between biomedical concepts relies on reference standards created for specific purposes using a variety of methods for their analysis. In most cases, these reference standards are not publicly available and the published information provided in manuscripts that evaluate computerized semantic relatedness measurement approaches is not sufficient to reproduce the results. Our proposed framework is based on the experiences of medical informatics and computational linguistics communities and addresses practical and theoretical issues with creating reference standards for semantic relatedness. We demonstrate the use of the framework on a pilot set of 101 medical term pairs rated for semantic relatedness by 13 medical coding experts. While the reliability of this particular reference standard is in the moderate range; we show that using clustering and factor analyses offers a data-driven approach to finding systematic differences among raters and identifying groups of potential outliers. We test two ontology-based measures of relatedness and provide both the reference standard containing individual ratings and the R program used to analyze the ratings as open-source. Currently, these resources are intended to be used to reproduce and compare results of studies involving computerized measures of semantic relatedness. Our framework may be extended to the development of reference standards in other research areas in medical informatics including automatic classification, information retrieval from medical records and vocabulary/ontology development.

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

semantic relatedness
reference standards
reliability


Efficiency decomposition approach: A cross-country airline analysis In this paper a two-phase data envelopment analysis approach is proposed in order to examine in a separated way the operational and financial performances for airlines. Empirical results are based on panel data from Brazilian and American airlines, using data from 34 observations (within the period from 1997 to 2006), and shows that for the emergent market, operational performance is always much better than the financial one, showing that the resources optimization has been the main concern for these companies. Also, results for this market show that improving the operational efficiency does not necessarily generate an improvement in financial efficiency. Future research should ascertain whether or not these results replicate in companies other than airlines. (C) 2011 Elsevier Ltd. All rights reserved.

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

data envelopment analysis
operational performance


Degree constrained minimum spanning tree problem: a learning automata approach Degree-constrained minimum spanning tree problem is an NP-hard bicriteria combinatorial optimization problem seeking for the minimum weight spanning tree subject to an additional degree constraint on graph vertices. Due to the NP-hardness of the problem, heuristics are more promising approaches to find a near optimal solution in a reasonable time. This paper proposes a decentralized learning automata-based heuristic called LACT for approximating the DCMST problem. LACT is an iterative algorithm, and at each iteration a degree-constrained spanning tree is randomly constructed. Each vertex selects one of its incident edges and rewards it if its weight is not greater than the minimum weight seen so far and penalizes it otherwise. Therefore, the vertices learn how to locally connect them to the degree-constrained spanning tree through the minimum weight edge subject to the degree constraint. Based on the martingale theorem, the convergence of the proposed algorithm to the optimal solution is proved. Several simulation experiments are performed to examine the performance of the proposed algorithm on well-known Euclidean and non-Euclidean hard-to-solve problem instances. The obtained results are compared with those of best-known algorithms in terms of the solution quality and running time. From the results, it is observed that the proposed algorithm significantly outperforms the existing method.

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

degree-constrained minimum spanning tree problem


Assessing information technologies for health. Editorial Objectives. To provide an editorial introduction to the 2006 IMIA Yearbook of Medical Informatics with an overview of it content and contributors. Methods,. A brief overview of the main theme of ''Assessing Information Technology for Health Care", and on outline of the purposes, readership, content, new format, and acknowledgment of contributions for the 2006 IMIA Yearbook Results: Assessing information technology (IT) in biomedicine and health cafe is emphasized in a number of survey and review articles. Synopses of a selection of best papers-for the past 12 months are included, as are original papers on the history of medical informatics by pioneers in the field, and selected research and education programs. Information about IMIA and its constituent societies is given, as well as the authors, reviewers, and advisors to the Yearbook. Conclusions: The 2006 IMIA Yearbook of Medical Informatics highlights as it theme one of the most significant yet difficult aspects of information technology in health: the assessment of IT as part of the complex enterprise of biomedical research and practice. It is being published in a new format with a wide range of original survey and review articles.

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

2006 imia yearbook of medical informatics

it assessment for health
surveys of biomedical informatics
reviews of biomedical informatics
history of biomedical informatics
imia and its societies


An identifying function approach for determining parameter structure of statistical learning machines This paper presents an identifying function (IF) approach for determining parameter structure of statistical learning machines (SLMs). This involves studying three related aspects: structural identifiability (SI), parameter redundancy (PR) and reparameterization. Firstly, by employing the Rank Theorem in Riemann geometry, we derive an efficient identifiability criterion by calculating the rank of the derivative matrix (DM) of IF. Secondly, we extend the previous concept of IF to local IF (LIF) for examining local parameter structure of SLMs, and prove that the KullbackLeibler divergence (KLD) is such a proper LIF, thus relating the LIF approach to several existing criteria. Lastly, an analytical approach for solving minimal reparameterization in parameter-redundant models is established. The dimensionality of the minimal reparameterization can be used to characterize the intrinsic parameter dimensionality of model. We compare the IF approach with existing criteria and discuss its pros/cons from theoretical and application viewpoints. Several model examples from the literature are presented to study their parameter structure.

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

identifying function
structural identifiability
kullbackleibler divergence
parameter redundancy
reparameterization


Space-time mapping and tiling: a helpful combination Tiling is a well-known technique for sequential compiler optimization, as well as for automatic program parallelization. However, in the context of parallelization, tiling should not be considered as a stand-alone technique, but should be applied after a dedicated parallelization phase, in our case after space-time mapping. We show how tiling can benefit from space-time mapping, and we derive an algorithm for computing tiles which can minimize the number of communication startups, taking the number of physically available processors into account. We also present how the use of a simple cost model reduces real execution time. Copyright (C) 2004 John Wiley Sons, Ltd.

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

automatic parallelization
loop transformation
space-time mapping
polyhedron model
loop optimization


Feature extraction, condition monitoring, and fault modeling in semiconductor manufacturing systems Reliable feature extraction, condition monitoring, and fault modeling are critical to understanding equipment degradation and implementing the proper maintenance decisions in manufacturing processes. Semiconductor manufacturing machines are highly sophisticated systems, consisting of multiple interacting components operating in highly variable operating conditions. This complicates performance monitoring since equipment condition must often be inferred through concurrent interpretation of multiple sensor readings originating from potentially very different subsystems of the tool. This paper presents an integrated approach to feature extraction, condition monitoring, and fault modeling applied to a set of standard built-in sensors on a modern 300-mm technology industrial Plasma Enhanced Chemical Vapor Deposition (PECVD) tool. Linear Discriminant Analysis was utilized to determine the set of dynamic features that are the most sensitive to different tool conditions brought about by chamber cleaning or various faults. Gaussian Mixture Models of the dynamic feature distributions were used to statistically quantify changes of these features as the condition of the tool changed. In addition, four highly detrimental faults were analyzed to demonstrate the fault modeling methodology. Data collected over 8 months from a PECVD tool being operated by a major microelectronics manufacturer was used to verify the methodology. Top sensitive features from various faults observed in this period were examined and physical connections to the chamber condition were interpreted through their behavior. (C) 2012 Elsevier B.V. All rights reserved.

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

condition monitoring
linear discriminant analysis

gaussian mixture model
multivariate gaussian


Writing academic papers: lost in translation? The process of writing for publication is a challenging one. It moves us from the spoken and written word into a realm that requires us to provide supporting evidence to develop an argument in a logical and progressive way. In English language journals, as elsewhere, the quality of the written word is a determining factor in the likelihood of a paper being accepted for publication. By reading past issues of a targeted journal, drawing on the expertise of colleagues and responding positively to feedback, it is possible to significantly enhance your prospects of publication.

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


discovering functional dependencies for multidimensional design Nowadays, it is widely accepted that the data warehouse design task should be largely automated. Furthermore, the data warehouse conceptual schema must be structured according to the multidimensional model and as a consequence, the most common way to automatically look for subjects and dimensions of analysis is by discovering functional dependencies (as dimensions functionally depend on the fact) over the data sources. Most advanced methods for automating the design of the data warehouse carry out this process from relational OLTP systems, assuming that a RDBMS is the most common kind of data source we may find, and taking as starting point a relational schema. In contrast, in our approach we propose to rely instead on a conceptual representation of the domain of interest formalized through a domain ontology expressed in the DL-Lite Description Logic. We propose an algorithm to discover functional dependencies from the domain ontology that exploits the inference capabilities of DL-Lite , thus fully taking into account the semantics of the domain. We also provide an evaluation of our approach in a real-world scenario.

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

functional dependencies
multidimensional design


Influence functions for a linear subspace method We propose the discriminant score for a CLAFIC method. We derive the influence functions for the score and its average. Because we can enhance the classifier in the CLAFIC method with them. We show the effectiveness of our approach through a clear simulation study.

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

cross-validation
perturbation analysis
single-case diagnostics


HAH manuscripts: A holistic paradigm for classifying and retrieving historical Arabic handwritten documents Technologies for reading and searching digital documents have helped academic researchers; however, truly effective search engines for handwritten documents have not been developed. Recently, there is a growing need to access historical Arabic handwritten manuscripts (HAH manuscripts) that are stored in large archives; therefore, managing tools for automatic searching, indexing, classifying and retrieval of HAH manuscripts are required. The peculiar characteristics of Arabic handwriting have added an extra challenging dimension in developing such systems. This paper presents a novel holistic technique for classifying and retrieving HAH manuscripts. The classification of HAH manuscripts is performed in several steps. First, the HAH manuscripts image is segmented into words, and then each word is segmented into its connected parts. Due to the existing overlap between the adjacent connected parts of a single word, we developed a stretching algorithm to increase the gap between them and thus improve their segmentation. Second, several structural and statistical features, which are devised for Arabic text, are extracted from these connected parts and then combined to represent a word with one consolidated feature vector. Finally, a neural network is used to learn and classify the input vectors into word classes. These classes are then utilized to retrieve HAH manuscripts. The extraction of structural and statistical features from the individual connected parts, as compared to the extraction of these features from the whole word, improved the performance of the system significantly.

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

segmentation of historical arabic handwritten documents


Accuracy in the diagnostic prediction of acute appendicitis based on the Bayesian network model Objectives: The diagnosis of acute appendicitis is difficult, and a diagnostic error will often lead to either a perforation or the removal of a normal appendix. In this study, we constructed a Bayesian network model for the diagnosis of acute appendicitis and compared the diagnostic accuracy with other diagnostic models, such as the naive Bayes model, an artificial neural network model, and a logistic regression model. Methods: The data from 169 patients, who suffered from acute abdominal pain and who were suspected of having an acute appendicitis, were analyzed in this study. Nine variables were used for the evaluation of the accuracy of the four models for the diagnosis of an acute appendicitis. The naive Bayes model, the Bayesian network model, an artificial neural network model, and a logistic regression model were used in this study for the diagnosis of acute appendicitis. These four models were validated by using the ".632 + bootstrap method" for resampling. The levels of accuracy of the four models for diagnosis were compared by the error rates and by the areas under the receiver operating characteristic curves. Results: Through the course of illness, 50.9% (86 of 169) of the patients were diagnosed as having an acute appendicitis. The error rate was the lowest in the Bayesian network model, as compared with the other diagnostic models. The area under the receiver operating characteristic curve analysis also showed that the Bayesian network model provided the most reliable results. Conclusion: The Bayesian network model provided the most accurate results in comparison to other models for the diagnosis of acute appendicitis.

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

artificial neural network
bayesian network
diagnostic prediction


Recent advances in models for thermal oxidation of silicon Recent advances are presented in the models for thermal oxidation that have been been introduced by Rao and co-workers. The level-set formulation for movement of the Si-SiO2 interface has been improved by the application of an efficient velocity-projection scheme for noninterface points. A penalty formulation has been introduced to enforce positive concentrations in the presence of discontinuities. The annealing-induced expansion of SiO2 has been established as an important effect and a phenomenological relation has been identified for it. Inelastic volumetric strains have been proposed, evolution equations have been specified, and the underlying thermodynamics has been elucidated. The enhanced strain finite-element method has been applied to the inhomogeneous expansion of interface elements that have silicon and SiO2 parts to them. (C) 2001 Elsevier Science.

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

diffusion
level-set methods
continuum mechanics of solids
thermodynamics of solids
finite elements


Analytical approach to layout generation of datapath cells This paper addresses the problem of layout automation of datapath cells. It presents an analytical approach to transistor placement under full custom design style and demonstrates that it can be applied to practical datapath designs. The presented approach is based on a mathematical model which employs a mixed integer linear programming technique. The placement algorithm adopts the custom design techniques commonly used by datapath layout designers in generating hand-crafted designs. An important aspect of the presented method is the efficient management of the complexity of the underlying mathematical model which makes it applicable to real designs. The authors implemented the presented datapath design technique as an experimental software tool running in the industrial environment. The generated layout results are competitive with manual designs provided by experienced layout designers.

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

datapath synthesis
integrated circuit layout automation
layout synthesis and optimization
module generation


A multiobjective spatial fuzzy clustering algorithm for image segmentation Multiobjective spatial fuzzy clustering for image segmentation is proposed. The non-local spatial information of an image is introduced into fitness functions. The final solution is chosen by a cluster index with non-local spatial information. The proposed method can automatically evolve the number of clusters. Experiments on noisy images demonstrate the superiority of the proposed method.

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

multiobjective optimization
non-local spatial information
cluster validity measure


The 22 minimal dichotomy decompositions of the K5 K 5 -distance In this note, we exhibit the 22 minimal dichotomy decompositions of the K5 K 5 -distance.The proof of exhaustivity is simple and relatively short. A simple checking of the solutions gives an immediate validation of two conjectures concerning the dimensionality (known result for five points) and principal component analysis (unknown result).

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

dimensionality
principal component analysis

space of l1 l 1 -type l1 l 1 l1 l 1 l 1
equilateral distance
hypercube


Utilizing unreliable public resources for higher profit and better SLA compliance in computing utilities Computing utilities are emerging as an important part of the infrastructure for outsourcing computer services. Fundamental to outsourcing is the notion of quality of service, which is defined by service level agreements (SLAs) between the computing utilities and clients. One of the major objectives of computing utilities is to maximize their net profit while maintaining customer loyalty. To achieve this objective, the computing utilities should meet or exceed their SLA constraints most of the time. Defining the SLAs conservatively might be one way of easily achieving these goals. However, by tuning the SLA parameters conservatively the computing utility might under utilize its resources with a resultant loss of revenue. Therefore, we can see two main issues with SLA management: designing SLAs competitively so that expected revenue for the computing utility is maximized and maintaining the operating conditions such that SLAs are satisfied with very high probability. In this paper, we show that inducting unreliable public resources into a computing utility enables more competitive SLAs while maintaining higher levels of run time compliances as well as maximizing profit. Our scheduling algorithms assume that idle cycles from public resources are available in plenty, therefore, the performance gains do not incur any additional financial cost. However, there is communication overhead when public resources from a wide area network is included. This overhead is kept to the minimum by enabling the scheduler work without any monitoring on the public resources.

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

resource management
service level agreement
public computing utility


Building Web services middleware with predictable execution times Predictability of execution has seldom been considered important in the design of Web services middleware. However, with the paradigm shift brought by cloud computing and with offerings of Platforms and Infrastructure as services, execution level predictability is mandating an increased importance. Existing Web services middleware are optimised for throughput with unconditional acceptance of requests and execution in a best-effort manner. While achieving perceived levels of throughput, they also result in highly unpredictable execution times. This paper presents a generic set of guidelines, algorithms and software engineering techniques that enable service execution to complete within a given deadline. The proposed algorithms accept requests for execution based on their laxity and executes them to meet requested deadlines. An introduced admission control mechanism results in a large range of laxities, enabling more requests to be scheduled together by phasing out their execution. Specialised development libraries and operating systems empower them with increased control over execution. Two widely used Web services middleware products were enhanced using these techniques. The two systems are compared with their unmodified versions to measure the predictability gain achieved. Empirical evidence confirms that the enhancements made enable these systems to achieve more than 90% of the deadlines under any type of traffic, while the unmodified versions achieve less than 10% of the deadlines in high traffic conditions. Predictability of execution achieved through these techniques, would open up new application areas such as industrial control systems, avionics, robotics and financial trading systems to the use of Web services as a middleware platform.

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

web services
middleware
predictability of execution

real-time systems
earliest deadline first
scheduling


Dynamically populating large urban environments with ambient virtual humans Creating an interactive simulation of a large urban environment populated With virtual humans poses a number of interesting challenges, ranging from how to initialise tire virtual humans in the correct locations to maintaining a real-time simulation. When considering a large environment it is beneficial to investigate automatic techniques that create and simulate virtual humans using the available computing resources effectively. In this paper; two contributions towards the population of a large environment are described. The first presents two methods that use an automatic analysis of tire urban environment to determine tire required population densities throughout the scene. These methods ensure that the virtual humans are distributed such that main high streets consistently exhibit a higher number of virtual humans than other areas. The methods presented here achieve above 90% correlation to the predicted population densities for the environment, which outperforms tire state of the art. The second contribution concerns the optimisation of the two methods to facilitate their applicability to large environments. The methods presented are modified to insert virtual humans dynamically into the behaviour system when required. The approach limits the required computing resources whilst achieving above 75% correlation to the predicted population values. Copyright (C) 2008 John Wiley & Sons, Ltd.

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


dynamic database replica provisioning through virtualization Data replication is a popular technique for providing good performance, high availability and fault tolerance in distributed database systems. We investigate data replication in a virtualized environment, focusing on provisioning when the master database server is heavily loaded or when it fails. We show that using virtualization, provisioning of the backup replica can be done quickly, thereby reducing service interruption time. We also show that this provisioning can efficiently support load balancing and failover in a virtualized environment.

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


Adaptive multi-chart and multiresolution mesh representation ? Irregular and regular connectivity is achieved using halfedge and multiple charts. The mesh resolution is adaptively controlled on both the CPU and the GPU. Stellar operators are used to simplify, refine and change the mesh connectivity. Applications of our mesh representation are presented in mesh editing and rendering.

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

computational manifolds
geometric representation
triangle meshes