Fast AT: A simple procedure for quasi direct orientation Over the past two decades, the development of Global Navigation Satellite System (GNSS) technology, inertial navigation technology and Inertial Navigation Systems (INS) and their application to sensor orientation in photogrammetry and remote sensing has led to more precise, accurate, reliable and cost efficient orientation and calibration methods and procedures. Today, most airborne photogrammetric and remote sensing systems are equipped with GNSS receivers and inertial sensors. To a large extent and more or less independently from the imaging geometry and sensor type, orientation is performed with the direct and integrated methods. In this paper we introduce a new orientation method that we call Fast AT for frame images. The new method combines image measurements, ground control and aerial control observations in novel quantitative and qualitative ways. Depending on project specifications, Fast AT can be a robust alternative to direct orientation and, at the very least, a fast quality control tool for any orientation task. We analyze the performance of Fast AT with analogue and digital frame imagery and draw conclusions on its general properties.

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


One-pass wavelet decompositions of data streams We present techniques for computing small space representations of massive data streams. These are inspired by traditional wavelet-based approximations that consist of specific linear projections of the underlying data. We present general "sketch"-based methods for capturing various linear projections and use them to provide pointwise and rangesum estimation of data streams. These methods use small amounts of space and per-item time while streaming through the data and provide accurate representation as our experiments with real data streams show.

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

wavelets
randomized algorithms
approximate queries


Abstract geometrical computation 1: Embedding black hole computations with rational numbers The Black hole model of computation provides super-Turing computing power since it offers the possibility to decide in finite (observer's) time any recursively enumerable (R.E.) problem. In this paper, we provide a geometric model of computation, conservative abstract geometrical computation, that, although being based on rational numbers (and not real numbers), has the same property: it can simulate any Turing machine and can decide any R.E. problem through the creation of an accumulation. Finitely many signals can leave any accumulation, and it can be known whether anything leaves. This corresponds to a black hole effect.

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

abstract geometrical computation
black hole model

energy conservation
malament-hogarth space-time
super-turing computation
turing universality
zeno phenomena


Implementation of parallel plasma particle-in-cell codes on PC cluster Plasma particle-in-cell (PIC) codes model the interaction of charged particles with the surrounding fields, and they have been implemented on many advanced parallel computers. Recently, many PC clusters which consist of inexpensive PCs have been developed to do parallel computing, and we also build such a PC cluster. In this paper, we present the implementation of a parallel plasma PIC code on our PC cluster using MPI, PGHPF and JavaMPI. (C) 2001 Elsevier Science B.V. All rights reserved.

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


The informing nature of talk & text: Discourse analysis as a research approach in information science In Information Science (IS), as well as other disciplines, discourse analysis has been used to extend the range of contextual data gathered using other research approaches. This form of textual analysis can enrich our understanding of complex information practices and contexts, particularly in relation to the ways that society and individuals construct understandings of various phenomena. However, not all discourse analysis approaches are the same; linguistic, Foucouldian, and psycho-social discourse analysis practices vary in their intent and their application. This panel will provide an overview of the discourse analysis methodology, including how the approach is conducted in various disciplines. By focusing on three projects by IS scholars that use discourse analysis, the range of data collection and analysis possibilities including benefits and limitations of the approach will be explored. The panel will also discuss how discourse analysis can be used in mixed methods studies, or with research participants engaged in other methods, to extend the research knowledge in the discipline.

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


The effect of control strength on the synchronization in pinning control questions This paper investigates the effects of control strength on nonlinearly coupled systems in the process of synchronization, where the coupling strength is an invariable constant. Under the assumption of an asymmetric and reducible coupling matrix, two comparable sufficient conditions are obtained by using the Lyapunov direct method. Moreover, a rough bound for the control strength is presented. A simple simulation is also given to show the validity of the theorems. This work improves the current results that we have.

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

pinning control
synchronization
control strength


Local search based metaheuristics for the robust vehicle routing problem with discrete scenarios A robust version of the vehicle routing with uncertain travel times is studied. Uncertainties are given as a set of discrete scenarios. A mixed integer model (MIP), a local search and four meta-heuristics are developed. The meta-heuristics retrieve the optimal solutions of the MIP on small problems. Results are reported up to 100 customers for the meta-heuristics.

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

greedy randomized adaptive search procedure


Applying multiple perspectives to the BPO decision: a case study of call centres in Australia Information Technology enabled Business Process Outsourcing (BPO) is a growing phenomenon, yet little research has been conducted to understand the factors that determine its appropriateness for organisations and what capabilities they should seek in potential suppliers. A multi-perspective approach to the BPO decision, encompassing the transaction, the organisation and its context, is proposed and a set of supplier capabilities to deliver upon it is outlined. A case study of outsourced call centres in Australia, based upon interviews with three suppliers and three clients, suggests such a multi-perspective approach is useful but that the interaction between the factors shaping the BPO decision is more complex than envisaged. The case also suggests that a common set of capabilities is sought from suppliers - though it is narrower than first proposed.

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

business process outsourcing
capabilities
information technology


a file system supporting cooperation between programs File systems coordinate simultaneous access of files by concurrent client processes. Although several processes may read a file simultaneously, the file system must grant exclusive access to one process wanting to write the file. Most file systems consider processes to be antagonistic: they prevent one process from taking actions on a file that have any chance to harm to another process already using the file. If several processes need to cooperate in a more sophisticated manner in their use of a file, they must communicate explicitly among themselves. The next three sections describe the file system procedures used by clients for using and sharing files. Section Two discusses how a client gains access to a file and how a client can respond if the file system asks it to give up a file it is using. Section Three discusses the mechanism by which a client might ask to be notified that a file is available for some access. Section Four discusses a controlled type of file access that lets clients read and write the same file at the same time. Section Five comprises three examples of the cooperative features of the file system taken from the Xerox Development Environment. Section Six discusses the subtleties of writing the call-back procedures that clients provide to the file system to implement interprocess cooperation. Section Seven discusses the implementation of this file system.

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

sharing
development environment
use
examples
systems
implementation
cooperation
process
access
read
writing

communication
coordination
program
procedure
concurrency
timing
feature
file systems
action


Graph visualization techniques for web clustering engines One of the most challenging issues in mining information from the World Wide Web is the design of systems that present the data to the end user by clustering them into meaningful semantic categories. We show that the analysis of the results of a clustering engine can significantly take advantage of enhanced graph drawing and visualization techniques. We propose a graph-based user interface for Web clustering engines that makes it possible for the user to explore and visualize the different semantic categories and their relationships at the desired level of detail.

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

visualization techniques and methodologies


Towards interoperability of i* models using iStarML Goal-oriented and agent-oriented modelling provides an effective approach to the understanding of distributed information systems that need to operate in open, heterogeneous and evolving environments. Frameworks, firstly introduced more than ten years ago, have been extended along language variants, analysis methods and CASE tools, posing language semantics and tool interoperability issues. Among them, the i* framework is one the most widespread. We focus on i*-based modelling languages and tools and on the problem of supporting model exchange between them. In this paper, we introduce the i* interoperability problem and derive an XML interchange format, called iStarML, as a practical solution to this problem. We first discuss the main requirements for its definition, then we characterise the core concepts of i* and we detail the tags and options of the interchange format. We complete the presentation of iStarML showing some possible applications. Finally, a survey on the i* community perception about iStarML is included for assessment purposes.

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

agent orientation
requirements engineering
i*


Automatic generation of clinical algorithms within the state-decision-action model To propose a methodology to automatically induce state-decision-action diagrams from health-care databases and electronic health records in order to show health-care professionals an explicit representation of the past health-care procedures carried out in a health-care organization and to use these representations to study the deviations with respect to official and predefined protocols and clinical algorithms. The methodology is based on two data and knowledge structures: episode of care database and set of rules. These two structures contain, respectively, patient data from health-care centres and the translation rules which are used to adapt the data of the episode of care database to the terminology we want the resulting state-decision-action diagram to have. The data expressed in the new terminology is used to generate the final state-decision-action diagram by means of a machine learning method. We have performed several tests on the treatment of hypertension with data from the SAGESSA Health-care Group in Spain. The state-decision-action diagrams obtained have been analyzed at the level of their ability to predict correct treatments and at the level of their adherence to the clinical algorithms published by four official health-care organizations. The state-decision-action diagrams obtained represent an average 94.6% of the treatments in the database, only excluding some atypical cases. Moreover, these diagrams show a high level of adherence to the treatment proposed by the National Heart Foundation of Australia and the Spanish Society for Hypertension with about 90.4% of coincident treatment. A new methodology has been developed and validated which automatically induces state-decision-action diagrams which can be used as a graphical representation of the health-care procedures carried out in health-care organizations. The methodology is also a tool to study the adherence of these health-care procedures to the official standards.

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

procedural knowledge induction
knowledge representation
state-decision-actions diagrams


Effects of the amplifier location in interchannel soliton collisions in periodic dispersion maps in the presence of third order dispersion We analyze the effects of third order dispersion in wavelength division multiplexed dispersion-managed soliton transmission systems using an ordinary differential equations model obtained by the variational method. Interchannel soliton collisions in this type of transmission systems produce shifts of their center frequencies which result in a timing jitter at the receiver that can severely impair signal transmission. We investigate how the third order dispersion term affects the collision-induced residual frequency shifts as the amplifier location within a period of the dispersion map is varied. The validity of the model employed in the analysis is assessed by comparing the variational results with direct simulations of the partial differential equations for specific cases, finding excellent agreement. (C) 2010 IMACS. Published by Elsevier B.V. All rights reserved.

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

optical solitons
dispersion management
wavelength division multiplexing
optical fiber communication


Camel: collective-aware message logging The continuous progress in the performance of supercomputers has made possible the understanding of many fundamental problems in science. Simulation, the third scientific pillar, constantly demands more powerful machines to use algorithms that would otherwise be unviable. That will inevitably lead to the deployment of an exascale machine during the next decade. However, fault tolerance is a major challenge that has to be overcome to make such a machine usable. With an unprecedented number of parts, machines at extreme scale will have a small mean-time-between-failures. The popular checkpoint/restart mechanism used in todays machines may not be effective at that scale. One promising way to revamp checkpoint/restart is to use message-logging techniques. By storing messages during execution and replaying them in case of a failure, message logging is able to shorten recovery time and save a substantial amount of energy. The downside of message logging is that memory footprint may grow to unsustainable levels. This paper presents a technique that decreases the memory pressure in message-logging protocols by only storing the necessary messages in collective-communication operations. We introduce Camel, a protocol that has a low memory overhead for multicast and reduction operations. Our results show that Camel can reduce memory footprint in a molecular dynamics benchmark for more than 95% on 16,384 cores.

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


Improving point correspondence in cephalograms by using a two-stage rectified point transform A two-stage rectified point correspondence for cephalograms is proposed. Correspondence is improved by constraining the variance of point transformations. Dental landmarks are classified into three categories to improve correspondence. Users can flexibly add and remove landmarks without intensive image pretraining.

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

cephalometric landmarking
cephalogram correspondence
point transform correspondence
sift
cephalometry


A modular numerical method for implicit 0D/3D coupling in cardiovascular finite element simulations Implementation of boundary conditions in cardiovascular simulations poses numerical challenges due to the complex dynamic behavior of the circulatory system. The use of elaborate closed-loop lumped parameter network (LPN) models of the heart and the circulatory system as boundary conditions for computational fluid dynamics (CFD) simulations can provide valuable global dynamic information, particularly for patient specific simulations. In this paper, the necessary formulation for coupling an arbitrary LPN to a finite element NavierStokes solver is presented. A circuit analogy closed-loop LPN is solved numerically, and pressure and flow information is iteratively passed between the 0D and 3D domains at interface boundaries, resulting in a time-implicit scheme. For Neumann boundaries, an implicit method, regardless of the LPN, is presented to achieve the desired stability and convergence properties. Numerical procedures for passing flow and pressure information between the 0D and 3D domains are described, and implicit, semi-implicit, and explicit quasi-Newton formulations are compared. The issue of divergence in the presence of backflow is addressed via a stabilized boundary formulation. The requirements for coupling Dirichlet boundary conditions are also discussed and this approach is compared in detail to that of the Neumann coupled boundaries. Having the option to select between Dirichlet and Neumann coupled boundary conditions increases the flexibility of current framework by allowing a wide range of components to be used at the 3D0D interface.

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

lumped parameter network
neumann
dirichlet

boundary condition
backflow stabilization
patient-specific blood flow
navierstokes fem solver
multi-domain method
multi-scale modeling


On the logic of TLA(+) TLA(+) is a language intended for the high-level specification of reactive, distributed, and in particular asynchronous systems. Combining the linear-time temporal logic TLA and classical set-theory, it provides an expressive specification formalism and supports assertional verification.

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

temporal logic
specification
verification


An optimized approach to histogram computation on GPU A histogram is a compact representation of the distribution of data in an image with a full range of applications in diverse fields. Histogram generation is an inherently sequential operation where every pixel votes in a reduced set of bins. This makes finding efficient parallel implementations very desirable but challenging, because on graphics processing units thousands of threads may be atomically updating a short number of histogram bins. Under these circumstances, collisions among threads will be very frequent and such collisions will serialize thread execution, seriously damaging the performance. In this paper we propose a highly optimized approach to histogram calculation, which tackles such performance bottlenecks. It uses histogram replication for eliminating position conflicts, padding to reduce bank conflicts, and an improved access to input data called interleaved read access. Our so-called -per-block approach to histogram calculation has been successfully compared to the main state-of-the-art works using four histogram-based image processing kernels and two real image databases. Results show that our proposal is between 1.4 and 15.7 faster than every previous implementation for histograms of up to 4,096 bins.

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


On ? ? -divergence based nonnegative matrix factorization for clustering cancer gene expression data Nonnegative matrix factorization (NMF) has been proven to be a powerful clustering method. Recently Cichocki and coauthors have proposed a family of new algorithms based on the ? ? -divergence for NMF. However, it is an open problem to choose an optimal ? ? . In this paper, we tested such NMF variant with different ? ? values on clustering cancer gene expression data for optimal ? ? selection experimentally with 11 datasets. Our experimental results show that ?=1 ? = 1 and 2 are two special optimal cases for real applications.

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

nonnegative matrix factorization
gene expression data
clustering


Simplified multi-objective genetic algorithms for stochastic job shop scheduling Job shop scheduling with multi-objective has been extensively investigated; however, multi-objective stochastic job shop scheduling problem is seldom considered. In this paper, a simplified multi-objective genetic algorithm (SMGA) is proposed for the problem with exponential processing time. The objective is to minimize makespan and total tardiness ratio simultaneously. In SMGA, the chromosome of the problem is ordered operations list, an effective schedule building procedure is proposed, a novel crossover is used, and a simplified binary tournament selection and a simple external archive updating strategy are adopted. SMGA is finally tested on some benchmark problems and compared with some methods from literature. Computational results demonstrate that the good performance of SMGA on the problem.

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

exponential processing time
external archive
genetic algorithm


mechanisms that enforce bounds on packet lifetimes For reliable transport protocol operation the lifetime of packets should not exceed an assumed maximum packet lifetime (MPL). A packet's lifetime is spent in nodes and crossing links. Time spent in nodes and on simple links is easily found. Other links or logical links may lose, duplicate, delay, and reorder data and do not provide transittime information. We present a link-transit-time protocol for bounding the transit time of packets that cross such links.

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

timer-based protocols
link-layer protocols
subnetworks
network-layer protocols
transit-time protocols
three-way handshake
internetwork gateways
packet switching
transport protocols


Investigating design issues in household environments This paper argues that the current involvement of end users in the design of technological artefacts is too superficial. It is common to involve people in requirements generation, but rarely in product inception or design. A study is reported involving five households in central Scotland, who were each visited on three occasions, using a new investigative framework. Illustrative examples are provided of the strengths and weaknesses of the methods used. Despite the latter, it is demonstrated that the general public can both generate and critique design ideas and that valuable contributions to understanding people's relationships with technologies can be expected both from children and from the elderly.

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

home studies
home workshop
technology tour
user-centred design


New definition of locally convex L-topological vector spaces In this paper, a new definition of locally convex L-topological vector spaces is given. The relationship between this new definition and the previous definition of locally convex L-topological vector spaces given by Yan and Fang in 1999 is investigated. Moreover, the concept of generalized L-fuzzy semi-norm is introduced. By using a family of generalized L-fuzzy semi-norms, a characterization of the new locally convex L-topological vector spaces is presented. Finally, as applications of this characterization, the Hausdorff separation property, convergence of molecule nets and boundedness of L-fuzzy sets in locally convex L-topological vector spaces are studied. (C) 2008 Elsevier B.V. All rights reserved.

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

locally convex l-topological vector spaces


Image-Based Modeling of the Human Eye Rendering realistic organic materials is a challenging issue. The human eye is an important part of nonverbal communication which, consequently, requires specific modeling and rendering techniques to enhance the realism of virtual characters. We propose an image-based method for estimating both iris morphology and scattering features in order to generate convincing images of virtual eyes. In this regard, we develop a technique to unrefract iris photographs. We model the morphology of the human iris as an irregular multilayered tissue. We then approximate the scattering features of the captured iris. Finally, we propose a real-time rendering technique based on the subsurface texture mapping representation and introduce a precomputed refraction function as well as a caustic function, which accounts for the light interactions at the corneal interface.

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

three-dimensional graphics and realism
image-based rendering
physically based modeling


Multidimensional scaling for group memory visualization1 We describe an attempt to overcome information overload through information visualization in a particular domain, group memory. A brief review of information visualization is followed by a brief description of our methodology. We discuss our system, which uses multidimensional scaling (MDS) to visualize relationships between documents, and which we tested on 60 subjects, mostly students. We found three important (and statistically significant) differences between task performance on an MDS-generated display and on a randomly generated display. With some qualifications, we conclude that MDS speeds up and improves the quality of manual classification of documents and that the MDS display agrees with subject perceptions of which documents are similar and should be displayed together.

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

visualization
multidimensional scaling
group memory

organizational memory
collaborative computing
group support systems


information distance based fitness and diversity metrics Commensurate indicators of diversity and fitness with desirable metric properties are derived from information distances based on Shannon entropy and Kolmogorov complexity. These metrics measure various useful distances: from an information theoretic characterization of the phenotypic behavior of a candidate model in the population to that of an ideal model of the target system's input-output relationship (fitness); from behavior of one candidate model to that of another (total information diversity); from the information about the target provided by one model to that provided by another (target relevant information diversity); from the code of one model to that of another (genotypic representation diversity); etc. Algorithms are cited for calculating the Shannon entropy based metrics from discrete data and estimating analogs thereof from heuristically binned continuous data; references are cited to methods for estimating the Kolmogorov complexity based metric. Not in the paper, but at the workshop, results will be shown of applying these algorithms to several synthetic and real world data sets: the simplest known deterministic chaotic flow; symbolic regression test functions; industrial process monitoring and control variables; and international political leadership data. Ongoing work is outlined.

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

distance fitness metric complexity diversity entropy

evolutionary computation
mutual information
machine learning
interaction information
algorithmic information


Superconvergence results on mildly structured triangulations Many results on superconvergence for recovered gradients of piecewise linear Galerkin approximations on triangular mesh partitions to the weak solutions of elliptic boundary value problems in two dimensions have been proved in recent years. These were obtained first for ?-regular (fully-structured) partitions in which the mid-points of the diagonals of all quadrilaterals formed by pairs of adjacent elements are coincident. This condition was then relaxed to allow for strongly-regular meshes, in which the distance between the above mid-points is O(h2), h being the mesh size parameter. In this paper these conditions are weakend still further to the case of globally mildly structured meshes, where the mid-point distance is O(h1+?), 0<?<1, and to meshes of this type where locally ?=0. After a review of recovery and gradient superconvergence, a unified approach is presented in terms of a generic gradient recovery operator which possesses specific properties on rectangular domains. Then the well-known classic theorem of Oganesyan and Rukhovets is extended to the case of mildly structured triangulations of polygonal approximations of C3(d) domains. A class of gradient recovery operators is described on these mildly structured meshes and, using the extended OganesyanRukhovets theorem, superconvergence is proved. We also obtain global superconvergence results for the recovered gradients over plane polygonal domains patchwise partitioned by fully-structured meshes. A feature of our results is that they allow local refinements of such meshes without loss of superconvergence. For the sake of completeness we have referenced the works of others in order to demonstrate the place of our work in the field.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 of photonic band gap optical fibers using finite elements In this paper, we study anew class of optical fibers to be utilized in future optics and optoelectronics. These so-called photonic band gap (PBG) waveguides can be classified into a fundamentaly different way to all optical waveguides and possess radically different guiding properties due to PBG guidance, as opposed to guidance by total internal reflection.

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


Customer segmentation and strategy development based on customer lifetime value: A case study The more a marketing paradigm evolves, the more long-term relationship with customers gains its importance. CRM, a recent marketing paradigm, pursues long-term relationship with profitable customers. It can be a starting point of relationship management to understand and measure the true value of customers since marketing management as a whole is to be deployed toward the targeted customers and profitable customers, to foster customers' full profit potential. Corporate success depends on an organization's ability to build and maintain loyal and valued customer relationships. Therefore, it is essential to build refined strategies for customers based on their value. In this paper, we propose a framework for analyzing customer value and segmenting customers based on their value. After segmenting customers based on their value, strategies building according to customer segment will be illustrated through a case study on a wireless telecommunication company.

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

customer lifetime value
customer segmentation


Simulation and optimization of sludge hygienization research irradiator This paper presents an approach to optimize a computational fluid dynamics problem coupled with radiation physics for sludge hygienization research irradiator. This was implemented by mapping results of computational fluid dynamics using recurrent artificial neural network with simplified dose rate evaluation using modified Sievert integral. This methodology led to considerable reduction of computation time while maintaining enough accuracy to validate the experimental results as well as suggest an optimum placement of source pencils using reference point based multi-objective optimization. (C) 2011 Elsevier Ltd. All rights reserved.

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

sludge flow
recurrent neural network
multi-objective optimization


Study

on

the

influences

of

quantum

well

structure

on

the

performance

of

organic

light

emitting

devices

In

this

paper,

six

organic

light

emitting

devices

with

different

quantum

well

cycles

and

different

position

of

well

structures

have

been

demonstrated.

These

well

structures

were

composed

by

N,N?-diphenyl-N,N?-bis(1-napthyl)-1,1?-biphenyl-4,4?-diamine

and

aluminum,

or

aluminum

and

2,9-dimethyl-4,7-diphenyl-1,10-phenanthroline.

The

device

with

one

cycles

well

structure

as

electron

transporting

layer

exhibits

the

highest

brightness

and

current

efficiency

of

The

current

efficiency

improved

owing

to

carrier

confinement

and

higher

exciton

formation

probability

in

the

well

layer.

Results

illustrated

that

using

proper

period

of

well

structure

could

improve

the

current

efficiency

of

organic

light

emitting

device

and

using

well

structure

as

electron

transporting

layer

are

better

than

as

hole-transporting

layer.

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

organic well structure
electroluminescence


A characterization of universal stability in the adversarial queuing model We study universal stability of directed and undirected graphs in the adversarial queuing model for static packet routing. In this setting, packets are injected in some edge and have to traverse a predefined path before leaving the system. Restrictions on the allowed packet trajectory provide a way to analyze stability under different packet trajectories. We consider five packet trajectories, two for directed graphs and three for undirected graphs, and provide polynomial time algorithms for testing universal stability when considering each of them. In each case we obtain a different characterization of the universal stability property in terms of a set of forbidden subgraphs. Thus we show that variations of the allowed packet trajectory lead to nonequivalent characterizations. Using those characterizations we are also able to provide polynomial time algorithms for testing stability under the NTG-lis (Nearest To Go-Longest In System) protocol.

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

interconnection networks
adversarial queueing theory
greedy scheduling protocols
network stability
graph algorithms


Bipolar disorders in the Arab world: a critical review Bipolar disorders are common psychiatric disorders that affect 15% of the population worldwide. Major advances in the epidemiology, pathophysiology, and treatment of the disorders have recently occurred. The majority of published reports, however, originate from the Western hemisphere, mostly Europe and the United States. There is a shortage of data from the Arab world on bipolar disorders. In an era of globalization and rapid communication, it is not clear to what extent research findings pertaining to one part of the world are by necessity applicable to other parts. Psychiatric disorders are known to be affected by the culture in which they occur, and knowledge of variations in illness presentation in different ethnic groups is also increasing. However, knowledge of variations affecting Arab populations remains quite limited. This paper provides a critical review of the literature on bipolar affective disorders in the Arab world, pointing to major gaps in knowledge and future opportunities to fill these gaps.

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


Tree polynomials and non-associative Grobner bases In this article the basic notions of a theory of Grobner bases for ideals in the non-associative, non-commutative algebra K{X} with a unit freely generated by a set X over a field K are discussed. The monomials in this algebra can be identified with the set of isomorphism classes of X-labelled finite, planar binary rooted trees where X is the set of free algebra generators. The elements of K{X} are called tree polynomials. We describe a criterion for a system of polynomials to constitute a Grobner basis. It can be seen as a non-associative version of the Buchberger criterion. A formula is obtained for the generating series of a reduced Grobner basis for the ideal of non-associative and non-commutative relations of an algebra relative to a system of algebra generators and an admissible order on the monomials. If the algebra is graded it specializes to a general Hilbert series formula in terms of generators and relations. We also report on new results concerning non-associative power series like exp, log and the Hausdorff series log(e(x)e(y)) and on problems related to Hopf algebras of trees. Reduced Grobner bases for closed ideals in tree power series algebras K {{X}} are considered. (c) 2005 Elsevier Ltd. All rights reserved.

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

planar binary rooted trees
ideals
grobner bases
hilbert series
tree power series

non-associative exponential and logarithm


RSD: A Metric for Achieving Range-Free Localization beyond Connectivity Wireless sensor networks have been considered as a promising tool for many location-dependent applications. In such deployments, the requirement of low system cost prohibits many range-based methods for sensor node localization; on the other hand, range-free approaches depending only on radio connectivity may underutilize the proximity information embedded in neighborhood sensing. In response to these limitations, this paper introduces a proximity metric called RSD to capture the distance relationships among 1-hop neighboring nodes in a range-free manner. With little overhead, RSD can be conveniently applied as a transparent supporting layer for state-of-the-art connectivity-based localization solutions to achieve better accuracy. We implemented RSD with three well-known algorithms and evaluated using two outdoor test beds: an 850-foot-long linear network with 54 MICAz motes, and a regular 2D network covering an area of 10,000 square feet with 49 motes. Results show that our design helps eliminate estimation ambiguity with a subhop resolution, and reduces localization errors by as much as 35 percent. In addition, simulations confirm its effectiveness for large-scale networks and reveal an interesting feature of robustness under unevenly distributed radio path loss.

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

wireless sensor networks
localization
neighborhood sensing
rsd


Systematic identification of transcriptional and post-transcriptional regulations in human respiratory epithelial cells during influenza A virus infection Respiratory epithelial cells are the primary target of influenza virus infection in human. However, the molecular mechanisms of airway epithelial cell responses to viral infection are not fully understood. Revealing genome-wide transcriptional and post-transcriptional regulatory relationships can further advance our understanding of this problem, which motivates the development of novel and more efficient computational methods to simultaneously infer the transcriptional and post-transcriptional regulatory networks.

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

regulatory network in epithelial cells
dimension reduction
dynamic bayesian network
constrained lasso


Signal Detection Performance of Overlapped FFT Scheme with Additional Frames Consisting of Non-continuous Samples in Indoor Environment Overlapped FFT has been proposed as a signal detection scheme in dynamic spectrum access to reduce the variance of the noise and improve the detection probability. However, the improvement of the detection probability in the conventional overlapped FFT is bounded with the upper limit of the overlap ratio. This paper proposes a new overlapped FFT scheme using additional frames. In the proposed scheme, in addition to the original FFT frames, new frames that consist of multiple subframes with non-continuous samples are constructed and included. It can realize the increase of the number of the FFT frames and the improvement of the detection probability compared with the conventional scheme. Numerical results through computer simulation show that the proposed scheme improves the detection probability by up to 0.07. On indoor channel models the proposed scheme also improves the detection probability. In addition, it is clarified that as the delay spread increases the detection probability reduces due to the correlation between the frames.

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


generating a privacy footprint on the internet As a follow up to characterizing traffic deemed as unwanted by Web clients such as advertisements, we examine how information related to individual users is aggregated as a result of browsing seemingly unrelated Web sites. We examine the privacy diffusion on the Internet, hidden transactions, and the potential for a few sites to be able to construct a profile of individual users. We define and generate a privacy footprint allowing us to assess and compare the diffusion of privacy information across a wide variety of sites. We examine the effectiveness of existing and new techniques to reduce this diffusion. Our results show that the size of the privacy footprint is a legitimate cause for concern across the sets of sites that we study.

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


Type-2 fuzzy logic control of a flexible-joint manipulator A type-2 fuzzy logic controller (FLC) is proposed in this article for robot manipulators with joint elasticity and structured and unstructured dynamical uncertainties. The proposed controller is based on a sliding mode control strategy. To enhance its real-time performance, simplified interval fuzzy sets are used. The efficiency of the control scheme is further enhanced by using computationally inexpensive input signals independently of the noisy torque and acceleration signals, and by adopting a trade off strategy between the manipulator's position and the actuators' internal stability. The controller is validated through a set of numerical experiments and by comparing it against its type-1 counterpart. It is shown through these experiments the higher performance of the type-2 FLC in compensating for larger magnitudes of uncertainties with severe nonlinearities.

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

intelligent control
uncertain systems
robotic manipulator
type-2 fuzzy logic
flexible joints


Contaminant source characterization in water distribution systems using binary signals This paper presents a simulation optimization-based method for identification of contamination source characteristics in a water distribution system using filtered data from threshold-based binary water quality signals. The effects of quality and quantity of the data on the accuracy of the source identification methodology are investigated. This study also addresses the issue of non-uniqueness in contaminant source identification under various data availability conditions. To establish the robustness and applicability of the methodology, numerous scenarios are investigated for a wide range of contamination incidents associated with two different networks. Results indicate that, even though use of lower resolution sensors lead to more non-unique solutions, the true source location is always included among these solutions.

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

contaminant warning system
evolutionary algorithms
non-uniqueness
water quality sensors


Adaptive timeliness of consensus in presence of crash and timing faults The ? ? -timed uniform consensus is a stronger variant of the traditional consensus and it satisfies the following additional property: every correct process terminates its execution within a constant time ? ? (? ? -timeliness), and no two processes decide differently (uniformity). In this paper, we consider the ? ? -timed uniform consensus problem in presence of fc f c crash processes and ft f t timing-faulty processes, and propose a ? ? -timed uniform consensus algorithm. The proposed algorithm is adaptive in the following sense: it solves the ? ? -timed uniform consensus when at least ft+1 f t + 1 correct processes exist in the system. If the system has less than ft+1 f t + 1 correct processes, the algorithm cannot solve the ? ? -timed uniform consensus. However, as long as ft+1 f t + 1 processes are non-crashed, the algorithm solves (non-timed) uniform consensus. We also investigate the maximum number of faulty processes that can be tolerated. We show that any ? ? -timed uniform consensus algorithm tolerating up to ft f t timing-faulty processes requires that the system has at least ft+1 f t + 1 correct processes. This impossibility result implies that the proposed algorithm attains the maximum resilience about the number of faulty processes. We also show that any ? ? -timed uniform consensus algorithm tolerating up to ft f t timing-faulty processes cannot solve the (non-timed) uniform consensus when the system has less than ft+1 f t + 1 non-crashed processes. This impossibility result implies that our algorithm attains the maximum adaptiveness.

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

distributed algorithm
timeliness property
crash fault
timing fault


The Etiology of Anomalous Sexual Preferences in Men People discover rather than choose their sexual interests. The process of discovery typically begins before the onset of puberty and is associated with an increase in the secretion of sex hormones from the adrenal glands. However, the determinants of the direction of sexual interest, in the sense of preferences for the same or opposite sex, are earlier. These preferences, although not manifest until much later in development, appear to be caused by the neural organizational effects of intrauterine hormonal events. Variations in these hormonal events likely have several causes and two of these appear to have been identified for males. One cause is genetic and the other involves the sensitization of the maternal immune system to some aspect of the male fetus. It is presently unclear how these two causes relate to each other. The most important question for future research is whether preferences for particular-aged partners and parts of the male courtship sequence share causes similar to those of erotic gender orientation.

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

paraphilia
sex offenders
neural development
pedophilia
homosexuality


A new reducing transformation for global optimization (with Alienor method) Purpose - To propose a new reducing transformation that allows the calculation of the absolute minimum of a function that depends on a large number of variables to be performed quickly. Design/methodology/approach - The methodology depends on the building of alpha-dense curve in a compact of R-n that allows the approximate at any point of this compact with a desired precision. This approach allows global optimization problems that depend on a large number of variables, be tackled quickly and precisely. Findings - It was found that this new method for densifying a space R-n (compact) by means of simple parametric curve (a space filling curve) could be used to deal with global optimization problems of some several hundreds or thousands of variables in some seconds or minutes. The technique is being based on the cosine function. Research limitations/implications - The results depend on the use of a computer system or "micro-calculator". Practical implications - This is an "economic" method and the technique which uses the cosine function allows the reduction of the calculation time and avoids calculus errors. It has the practical advantages that coupled with a transformation eliminating local minima, it permits the solution of global optimization problems of more than 1,000 variables in less than 1 min. Originality/value - The method is innovative and shown to be accurate and fast even with a function of a large number of variables.

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


An inspection model with minimal and major maintenance for a system with deterioration and Poisson failures A new condition-based maintenance model for a system, subject to deterioration-failures and to Poisson-failures, is presented. After an inspection, based on the degree of deterioration, a minimal maintenance or a major maintenance is performed, or no action is taken. Deterioration failures are restored by major repair; Poisson failures are restored by minimal repair. Major maintenance or major repair restores the system to "good as new," while minimal maintenance restores the system one stage. Generalized stochastic Petri Nets are used to represent and analyze the model, which represents a condition-based maintenance strategy. Based on maximization of the system throughput, an optimal inspection policy within this strategy and optimal inter-inspection time are obtained. The effects of inspection, maintenance, and repair parameters are investigated. For a given inspection parameter, a 3-region diagram identifies the effectiveness of an inspection policy based on minimal maintenance, major maintenance, and major repair parameters.

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

generalized stochastic petri nets
inspection
major maintenance
major repair
minimal maintenance

condition-based maintenance
deterioration failure
flexible manufacturing cell
poisson failure


Comparing the sizes of nondeterministic branching read-k-times programs ? We compare the complexities of Boolean functions for nondeterministic syntactic read-k-times branching and branching read-sk-times programs. It is shown that for each natural number k, k?2, there exists a sequence of Boolean functions such that the complexity of computation of each function of this sequence by nondeterministic syntactic branching read-k-times programs is exponentially larger (with respect to the number of variables of the Boolean function) than by nondeterministic branching read- -times programs, where C is a constant independent of k. Besides, it is shown that for each natural numbers N and k(N), where and is a constant independent of k and N, there exists a Boolean function in N variables such that the complexity of this function for nondeterministic syntactic read-k-times branching programs is exponentially larger (with respect to N) than for nondeterministic syntactic read- -times branching programs.

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


facilitating reuse in hardware models with enhanced type inference High-level hardware modeling is an essential, yet time-consuming, part of system design. However, effective component-based reuse in hardware modeling languages can reduce model construction time and enable the exploration of more design alternatives, leading to better designs. While component overloading and parametric polymorphism are critical for effective component-base reuse, no existing modeling language supports both. The lack of these features creates overhead for designers that discourages reuse, negating any benefits of reuse. This paper presents a type system which supports both component overloading and parametric polymorphism. It proves that performing type inference for any such system is NP-complete and presents a heuristic that works efficiently in practice. The result is a type system and type inference algorithm that can encourage reuse, reduce design specification time, and lead to better designs.

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

polymorphism
type inference
component overloading

component reuse
liberty simulation environment (lse)


Metaheuristic optimization algorithms for texture classification using multichannel approaches This paper proposes the use of the ratio of wavelet extrema numbers taken from the horizontal and vertical counts respectively as a texture feature, which is called aspect ratio of extrema number (AREN). We formulate the classification problem upon natural and synthesized texture images as an optimization problem and develop a coevolving approach to select both scalar wavelet and multiwavelet feature spaces of greater discriminatory power. Sequential searches and genetic algorithms (GAs) are comparatively investigated. The experiments using wavelet packet decompositions with the innovative packet-tree selection scheme ascertain that the classification accuracy of coevolutionary genetic algorithms (CGAs) is acceptable enough.

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

texture classification genetic algorithms (gas)

coevolutionary genetic algorithms (cgas)


A survey of fuzzy logic monitoring and control utilisation in medicine Intelligent systems have appeared in many technical areas, such as consumer electronics, robotics and industrial control systems. Many of these intelligent systems are based on fuzzy control strategies which describe complex systems mathematical models in terms of linguistic rules. Since the 1980s new techniques have appeared from which fuzzy logic has been applied extensively in medical systems. The justification for such intelligent systems driven solutions is that biological systems are so complex that the development of computerised systems within such environments is not always a straightforward exercise. In practice, a precise model may not exist for biological systems or it may be too difficult to model. In most cases fuzzy logic is considered to be an ideal tool as human minds work from approximate data, extract meaningful information and produce crisp solutions. This paper surveys the utilisation of fuzzy logic control and monitoring in medical sciences with an analysis of its possible future penetration.

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

fuzzy logic
fuzzy control
medicine
survey


the bits and flops of the n-hop multilateration primitive for node localization problems The recent advances in MEMS, embedded systems and wireless communication technologies are making the realization and deployment of networked wireless microsensors a tangible task. Vital to the success of wireless microsensor networks is the ability of microsensors to ``collectively perform sensing and computation''. In this paper, we study one of the fundamental challenges in sensor networks, node localization. The collaborative multilateration presented here, enables ad-hoc deployed sensor nodes to accurately estimate their locations by using known beacon locations that are several hops away and distance measurements to neighboring nodes. To prevent error accumulation in the network, node locations are computed by setting up and solving a global non-linear optimization problem. The solution is presented in two computation models, centralized and a fully distributed approximation of the centralized model. Our simulation results show that using the fully distributed model, resource constrained sensor nodes can collectively solve a large non-linear optimization problem that none of the nodes can solve individually. This approach results in significant savings in computation and communication, that allows fine-grained localization to run on a low cost sensor node we have developed.

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

communication
network
sensor
task
simulation
approximation
computation
model
paper
distance
wireless
technologies
deployment
distributed
cost
resource
global
embedded systems

tangibility
measurement
challenge
estimates
centrality
sensor networks
distributed localization
errors
locality
collaboration
sensor net-works
ad-hoc localization
locatability
optimality
wireless communication
senses
ad-hoc


Integrating the IS functions after mergers and acquisitions: Analyzing business-IT alignment We examine 22 mergers and acquisitions to examine business-IS strategies employed. M&A outcomes are successful when strategies are aligned and not aligned. M&A often uses emergent strategy formation, not normative strategy formation.

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

systems integration
positivist case study
business-is strategic alignment


Surveying Users' Perception of Academic Library Services Quality: A Case Study in Universiti Malaysia Pahang (UMP) Library Global competition among academic institutions has compelled university libraries to transform their conventional services and traditional roles to a more sophisticated, all-round service provider that can deliver their best services to their users. University libraries must cater the expansion of information sources, the high demand of users and information application as well as high student enrolments and competition among service sectors. The ability of an academic library to fulfill its user expectations will yield user satisfaction for its services. Primarily, research on assessing users' perception on the level of service quality focuses on finding ways to meet or exceed users' expectations. This study nevertheless aimed to measure students' perception and their satisfaction level of services provided by the UMP library and customized a new measuring tool on service quality and perspectives of library users based on the LibQUAL Model. A customized survey instrument was developed based on the model, consisting of 30 items measuring the level of four service dimensions and user satisfaction with an additional five items examining user satisfaction on general services. The Cronbach's alpha range is from 0.813 to 0.942, which was adequately greater than the recommended value of 0.7, thus exhibiting good internal reliability of the constructs. The result of the study reported positive values for both gap analyses in all service quality dimensions. Based on 382 respondent feedbacks, results showed that the perceived service quality level exceeded users' acceptable level on minimum service and desired service. Specifically, the users are satisfied with the services provided. Results from this study serveas a guide for effective decision making by the library in its administration and resource allocation to ensure accomplishment of the library's vision and mission.

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

academic library services
user satisfaction
libqual model


a rest protocol and composite format for interactive web documents Documents allow end-users to encapsulate information related to a collaborative business process into a package that can be saved, emailed, digitally signed, and used as the basis of interaction in an activity or an ad hoc workflow. While documents are used incidentally today in web applications, for example in HTML presentations of content stored otherwise in back-end systems, they are not yet the central artifact for developers of dynamic, data intensive web applications. This paper unifies the storage and management of the various artifacts of web applications into an Interactive Web Document (IWD). Data content, presentation, behavior, attachments, and digital signatures collected throughout the business process are unified into a single composite web resource. We describe a REST-based protocol for interacting with IWDs and a standards-based approach to packaging their multiple constituent artifacts into IWD archives based on the Open Document Format standard.

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

web application
odf
document-centric
xforms
rich internet application
scxml
collaboration


On \((\overline{\in},\overline{\in} \vee \overline{q})\)-fuzzy ideals of BCI-algebras The concepts of \((\overline{\in},\overline{\in} \vee \overline{q})\)-fuzzy (p-, q- and a-) ideals of BCI-algebras are introduced and some related properties are investigated. In particular, we describe the relationships among ordinary fuzzy (p-, q- and a-) ideals, (?,?? q)-fuzzy (p-, q- and a-) ideals and \((\overline{\in},\overline{\in} \vee \overline{q})\)-fuzzy (p-,q- and a-) ideals of BCI-algebras. Moreover, we prove that a fuzzy set? of a BCI-algebra X is an \((\overline{\in},\overline{\in} \vee \overline{q})\)-fuzzy a-ideal of X if and only if it is both an \((\overline{\in},\overline{\in} \vee \overline{q})\)-fuzzy p-ideal and an \((\overline{\in},\overline{\in} \vee \overline{q})\)-fuzzy q-ideal. Finally, we give some characterizations of three particular cases of BCI-algebras by these generalized fuzzy ideals.

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


Contraflow transportation network reconfiguration for evacuation route planning Given a transportation network having source nodes with evacuees and destination nodes, we want to find a contraflow network configuration (that is, ideal direction for each edge) to minimize the evacuation time. Contraflow lane reversal is considered a potential remedy to reduce congestion during evacuations in the context of homeland security and natural disasters (for example, hurricanes). This problem is computationally challenging because of the very large search space and the expense of calculating the evacuation time on a given network. To our knowledge, this paper presents the first macroscopic approaches for the solution of a contraflow network reconfiguration incorporating road capacity constraints, multiple sources, congestion, and scalability. We formally define the contraflow problem based on graph theory and provide a framework of computational structure to classify our approaches. A Greedy heuristic is designed to produce high-quality solutions with significant performance. A Bottleneck Relief heuristic is developed to deal with large numbers of evacuees. We evaluate the proposed approaches both analytically and experimentally using real-world data sets. Experimental results show that our contraflow approaches can reduce the evacuation time by 40 percent or more.

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

optimization
graph algorithms
heuristics design


Content-based image retrieval using color and texture fused features This paper presents a method to extract color and texture features of an image quickly for content-based image retrieval (CBIR). First, HSV color space is quantified rationally. Color histogram and texture features based on a co-occurrence matrix are extracted to form feature vectors. Then the characteristics of the global color histogram, local color histogram and texture features are compared and analyzed for CBIR. Based on these works, a CBIR system is designed using color and texture fused features by constructing weights of feature vectors. The relevant retrieval experiments show that the fused features retrieval brings better visual feeling than the single feature retrieval, which means better retrieval results. (c) 2010 Elsevier Ltd. All rights reserved.

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


TGF? Plasmid Construction and Delivery for the Prevention of Type 1 Diabetes Studies of animals with spontaneous autoimmune diabetes have revealed that autoreactive T cells that mediate islet ? cell destruction can be manipulated by the administration of Th2 cytokines. Using gene delivery to express the targeted protein, we can overcome the need for frequent administration of cytokines on account of their short half-lives. In this study, the effect of hTGF? gene delivery was evaluated both in vitro and in vivo using an adenovirus vector (Ad) constructed with an hTGF? cDNA. In vitro transfection assays of the construct in HepG2, ? cell lines, and islets showed good expression levels of hTGF? and activation of smad3. Ad-hTGF? enhanced differentiation and proliferation in the ? cell line or islets without causing apoptosis. Of interest, Ad-hTGF? transduction in CD4+CD25? T cells resulted in a significant enhanced expression of CD25 and a regulatory T cellspecific transcription factor, Foxp3. To evaluate in vivo efficacy, Ad-hTGF? was intravenously injected into 7-week-old NOD mice and compared to the transduction using the vector only. The Ad-hTGF? group had persistent gene expression for longer than 5 weeks, and high TGF? serum level was secreted. There was no difference in the degree of insulitis between the Ad-hTGF? group and controls. Although we found favorable in vitro results, such as decrease in islet apoptosis, enhanced proliferation and differentiation, and increase in the level of CD4+CD25+ regulatory T cells, there was no difference in reduction of the development of T1D between controls and Ad-hTGF?-injected mice. Nevertheless, if we find the appropriate mode and timing of TGF? gene transduction, Ad-hTGF? gene therapy might be useful in therapeutic cytokine delivery for the treatment of T1D.

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


automatic reuse of process patterns in process modeling Process pattern concept was proposed as a promising approach to reuse process knowledge. However, their general and practical use has been handicapped by the lack of formalization and supporting tools. In order to facilitate process patterns reuse, we aim at an (semi)automatic approach that can assure correct patterns' applications and reduce process modeling time. In our previous works, we developed a UML-based meta-model allowing pattern-based process modeling. In this paper, we present a set of reuse operators that enable automatic applications of process patterns for generating and (re)structuring process models. These operators are defined with operational semantics and implemented in a prototype of pattern-based process modeling tool.

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


clock tree synthesis with pre-bond testability for 3d stacked ic designs This paper proposes comprehensive solutions to the clock tree synthesis problem that provides pre-bond testability for 3D IC designs. In 3D ICs, it is essential to stack only good dies by testing the individual dies before stacking. For the clock signaling, the pre-bond testing requires a complete 2D clock tree on each die. The previous work enables the prebond testability by allocating specially designed resources called TSV-buffers and redundant trees with transmission gates. We proposes viable solutions to the two fundamental problems of the previous work: (1) using much less buffer resources by preventing (potentially 'bad') TSV-buffers with a new tree topology generation algorithm; (2) completely removing the transmission gate control lines by using a specially designed component called self controlled clock transmission gate (SCCTG). Compared to the existing 3D tree topology generation algorithms, solution 1 can use 56\%--88\% less number of TSVs, 53\%--67\% less number of buffers, 22\%--65\% less total wirelength, and 26\%--43\% less clock power for the benchmark circuits with dense sink placements. Moreover, solution 2 reduces the total wirelength of all the benchmark circuits by 17\% and 23\% on average for the 2-die and 4-die stacked 3D ICs, respectively.

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


Performance of different metaheuristics in EEG source localization compared to the CramrRao bound The problem of electroencephalographic (EEG) source localization involves an optimization process that can be solved through metaheuristics. In this paper, we evaluate the performance in localizing EEG dipole sources using simulated annealing (SA), genetic algorithm (GA), particle swarm optimization (PSO), and differential evolution (DE). The evaluation is performed in terms of the metaheuristics' operational parameters and the signal-to-noise ratio (SNR). Here, the objective function in the optimization problem is the concentrated likelihood function (CLF), while the CramrRao bound is proposed as benchmark. Under these conditions, the metaheuristics' best performances are achieved when the variance of their corresponding dipole source estimates is close to the CRB. Therefore, we exhaustively evaluate the variances of the source estimates obtained through each metaheuristic for the case of realistically simulated EEG data. Our results showed that no significant variations on the performance were introduced by changes in the metaheuristics' operational parameters, specially in one-dipole estimation. For two-dipole estimation, the performance of GA and DE was better than in other metaheuristics, but DE required a fine adjustment of its parameters in order to work. In all cases, the performance decayed as the SNR decreased, while SA and PSO seemed to be very sensitive to the correlation between the sources. Overall, GA was the most attractive technique in terms of performance and computational cost.

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

electroencephalography
dipole source localization
maximum likelihood


An Adaptive Threshold Framework for Event Detection Using HMM-Based Life Profiles When an event occurs, it attracts attention of information sources to publish related documents along its lifespan. The task of event detection is to automatically identify events and their related documents from a document stream, which is a set of chronologically ordered documents collected from various information sources. Generally, each event has a distinct activeness development so that its status changes continuously during its lifespan. When an event is active, there are a lot of related documents from various information sources. In contrast when it is inactive, there are very few documents, but they are focused. Previous works on event detection did not consider the characteristics of the event's activeness, and used rigid thresholds for event detection. We propose a concept called life profile, modeled by a hidden Markov model, to model the activeness trends of events. In addition, a general event detection framework, LIPED, which utilizes the learned life profiles and the burst-and-diverse characteristic to adjust the event detection thresholds adaptively, can be incorporated into existing event detection methods. Based on the official TDT corpus and contest rules, the evaluation results show that existing detection methods that incorporate LIPED achieve better performance in the cost and F1 metrics, than without.

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

algorithm
design
experimentation
topic detection
hidden markov models
clustering


Neural pattern recognition and multivariate data: water typology of the Para??ba do Sul River, Brazil Modelling environmental processes is a complicated task, for the number of variables involved is usually high. This paper considers the use of neural pattern recognition to analyze structures within large data sets related to the study of ecological phenomena. The purpose is to use the information obtained with the aid of an unsupervised clustering step in a pattern recognition algorithm to obtain insight into the processes occurring along the period of observation. Once the processes are identified, more reliable models can be derived. The method proved to be helpful to highlight the major fluctuations in river water chemistry, and to identify complementary characteristics relevant to understanding the processes involved in the transport of dissolved nutrients in the Para??ba do Sul River basin outlet.

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


SDN Based Mobile Networks: Concepts and Benefits Mobile Internet traffic is expected to grow faster than the fixed Internet traffic in a near future. Since, todays broadband networks are approaching theoretical limits in terms of spectral efficiency per link, mobile operators are compelled to seek for new solutions that will be able to accommodate the expected traffic growth and improve their position in the competitive market. Addressing those challenges with current inflexible, not scalable and complex architecture is very hard, if possible at all. Software defined networking (SDN) is a new networking architecture paradigm that holds great promise to overcome many of mentioned limitations and provides required improvements in performance by decoupling control functions from underlying physical infrastructure. In this paper, we explain key reasons for transition to SDN based mobile networks and briefly describe several proposals of design scenario. Special emphasis is placed on SDNs contribution to more efficient inter-cell interference management, traffic control and network virtualization.

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

mobile networks
sdn
traffic control
network virtualization


Coordinated fuzzy control of robotic arms with actuator nonlinearities and motion constraints In this paper, a coordinated fuzzy control is developed for robotic arms with actuator hysteresis and motion constraint. To accurately compensate the hysteresis phenomena from the electromechanical devices, the modeling of actuator hysteresis is first integrated into the dynamics of multiple arms system. Then, the adaptive control scheme is introduced to reduce the harmful effects from unknown nonlinearities. Subsequently, the issue of the motion constraint is taken into account to facilitate the application in the condition of potential collisions. Furthermore, the stability analysis is carried out to guarantees the motion and internal forces in the robotic arms converge to the desired values. Simultaneously, the predetermined motion boundary is ensured to be never violated. Finally, comparative results are presented to illustrate the proposed schemes effectiveness.

O O O 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 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 B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 arms
actuator hysteresis
motion constraint


The Fibrin Intermediate, Its Place in the Fibrinogen-Fibrin Transformation Our preceding study indicated that, in course of coagulation of human fibrinogen by thrombin, substantial production of the fibrin intermediate (?-profibrin) lacking only one fibrinopeptide A (FPA) precedes the formation of ?-fibrin monomer lacking both FPAs. The plateau concentration of ?-profibrin (20% of initial fibrinogen) appearing in reactions indicated, however, that the second FPA is released four times faster than the first. The study reported here confirms those findings, and provides new insight into the significance of differing rate constants for the production of ?-profibrin and its conversion to ?-fibrin. The intermediate could be isolated in a distinct electrophoretic band by electrophoresing partial thrombin digests at high concentrations. Its identity was verified by digesting it with CNBr and by demonstrating that its N-terminal domain, the NDSK fragment, both lacks an FPA and contains an FPA, unlike the NDSKs of the bands from fibrin which contained no FPA or the fibrinogen band that lacked no FPA. The single step isolation also enabled us to confirm the 1520% plateau level of ?-profibrin in course of thrombin reactions, well below the 37% maximum that would be expected if release of the first and second FPA proceeded independently with no difference in rate. The 37% maximum is observed in reactions with atroxin, and it is suggested that the abundant production of ?-profibrin underlies the therapeutic utility of atroxin as a defibrinating agent. Gel chromatography procedures were optimized for isolation of ?-profibrin/fibrin mixtures free of fibrinogen, the final step of which involves literal use of agarose gel as a filter to remove fibrin aggregates from the fibrinogen free fractions (aggregates are left behind in gel filtration, rather than their moving ahead in gel chromatography). Unlike human fibrinogen, rabbit fibrinogen does not yield much ?-profibrin in course of its conversion to fibrin, less than 10% as determined by electrophoresis and comparison with abundant production with atroxin. This low production of ?-profibrin conformed with conclusions from our early studies on the generalized Shwartzman reaction in rabbits, and we now infer that the low production of ?-profibrin and rapid conversion to fibrin by rabbit fibrinogen underlies the unparalleled susceptibility of these animals toward fibrinoid formation in the generalized Shwartzman reaction.

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

fibrin intermediate
profibrin
shwartzman reaction


Ontology selection ranking model for knowledge reuse Ontology reuse is recommended as a key factor to develop cost-effective and high-quality ontologies because it could reduce development costs by avoiding rebuilding existing ontologies. Selecting the desired ontology from existing ontologies is essential for ontology reuse. Until now, much research on ontology selection has focused on lexical-level support. However, in these cases, it is almost impossible to find an ontology that includes all the concepts matched by the search terms at the semantic level. Finding an ontology that meets users needs requires a new ontology selection and ranking mechanism based on semantic similarity matching. We propose an ontology selection and ranking model consisting of selection standards and metrics based on better semantic matching capabilities. The model we propose presents two novel features different from previous research models. First, it enhances the ontology selection and ranking method practically and effectively by enabling semantic matching of taxonomy or relational linkage between concepts. Second, it identifies what measures should be used to rank ontologies in the given context and what weight should be assigned to each selection measure.

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

ontology selection
information retrieval


Dynamic quality characteristics modelling based on brittleness theory in complex manufacturing processes To comprehensively and quantitatively analyse the influencing factors of dynamic quality characteristics in complex manufacturing processes, depending on the brittleness analysis of dynamic quality characteristics based on man-machine-environment influencing factors, this paper established a man-machine-environment brittleness model of dynamic quality characteristics based on the brittleness theory of complex system. According to the brittleness relation among the brittleness factors of dynamic quality characteristics (BFDQCs) in this model, a key man-machine-environment influencing factor identification method of dynamic quality characteristics was proposed by the definition of brittle risk degree, brittle coupling degree and brittle degree among BFDQCs. Finally, a case study for applicability was presented. The result showed that the proposed method was available, and can provide guidance for the analysis of dynamic quality characteristics and support for product reliability in complex manufacturing processes.

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

manufacturing processes
dynamic quality characteristics
modelling
brittleness theory


A comparative study of K-Nearest Neighbour, Support Vector Machine and Multi-Layer Perceptron for Thalassemia screening In this paper, we investigate the feasibility of two typical techniques of Pattern Recognition in the classification for Thalassemia screening. They are the Support Vector Machine (SVM) and the K-Nearest Neighbour (KNN). We compare SVM and KNN with a Multi-Layer Perceptron (MLP) classifier. We propose a two-classifier system based on SVM. The first layer is used to differentiate between pathological and non-pathological cases while the second layer is used to discriminate between two different pathologies (alpha-thalassemia carrier against beta-thalassemia carrier) from the first output layer (pathological cases). Using the parameters sensitivity (percentage of pathologic cases correctly classified) and specificity (percentage of non-pathologic cases correctly classified), the results obtained with this analysis show that the MLP classifier gives slightly better results than SVM although the amount of data available is limited. Both techniques enable thalassemia carriers to be discriminated from healthy subjects with 95% specificity, although the sensitivity of MLP is 92% while that of SVM is 83%. (C) 2003 Elsevier B.V. All rights reserved.

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

k-nearest neighbour (knn)
multi layer perceptron (mlp)
support vector machine (svm)
principal component analysis (pca)
artificial neural networks


PNNI Augmented Routing (PAR) and Proxy-PAR ATM networks are often used to carry IP traffic, but IP over ATM techniques suffer from complex and error-prone configuration. PNNI Augmented Routing (PAR) is an extension to PNNI to simplify IP support. In addition, a very lightweight interface called Proxy-PAR enables ATM-attached IP devices to operate without a full PAR implementation. PAR and Proxy-PAR provide a service discovery system for IP devices attached to ATMPNNI networks. PAR and Proxy-PAR are standards from the ATM Forum, and are referenced by the IETF. This paper shows how PAR and Proxy-PAR can complement solutions, such as ILMI-based Server Discovery, Classical IP and ARP over ATM, and Next-Hop Resolution Protocol, or even replace existing solutions, for instance where a distributed address resolution mechanism is preferable to a centralized one. This is then described in the context of three different types of networks: a campus, a backbone, and a mobile network.

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

pnni augmented routing
service discovery
address resolution

ip/atm integration
automatic configuration