A structural approximation method to generate the optimal auto-sleep schedule for computer systems This paper addresses a problem of energy reduction on computer systems, namely the problem of determining the optimal auto-sleep schedule on which the system is changed into a low-power state. For this problem, we provide a stochastic model for a computer system with autosleep function. In our modeling framework, user requests arrive at the system in accordance with a general renewal process and are served by generally distributed service times. To obtain the optimal auto-sleep schedule minimizing the expected power consumption per unit time in the steady state, the phase-type approximation is applied to the renewal arrival process. In numerical examples, we investigate accuracy of the phase-type approximation through a simulation study. (C) 2003 Elsevier Ltd. All rights reserved.

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

auto-sleep schedule
power saving
phase-type distribution
em algorithm


Algorithms for detecting and analysing autocatalytic sets Autocatalytic sets are considered to be fundamental to the origin of life. Prior theoretical and computational work on the existence and properties of these sets has relied on a fast algorithm for detectingself-sustaining autocatalytic sets in chemical reaction systems. Here, we introduce and apply a modified version and several extensions of the basic algorithm: (i) a modification aimed at reducing the number of calls to the computationally most expensive part of the algorithm, (ii) the application of a previously introduced extension of the basic algorithm to sample the smallest possible autocatalytic sets within a reaction network, and the application of a statistical test which provides a probable lower bound on the number of such smallest sets, (iii) the introduction and application of another extension of the basic algorithm to detect autocatalytic sets in a reaction system where molecules can also inhibit (as well as catalyse) reactions, (iv) a further, more abstract, extension of the theory behind searching for autocatalytic sets.

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

autocatalytic sets
algorithms
origin of life


Safety Achieved by the Safe Failure Fraction (SFF) in IEC 61508 The present paper examines the effect of safe failure fraction (SFF) constraints on hazardous-event rates, and discusses the validity of the SFF constraints in IEC 61508. First, the safe states are categorized into three types of states, and overall systems involving safety-related systems are classified into six types of systems based on the safe-state categorization, and the completeness of trips. Next, state-transition models for the systems where the effect of SFF is the greatest are presented, and the hazardous-event rates are analysed for the systems. Then, it is found that, when the effect of the SFF constraints is positive, it is negligible; and when it is negative, it is not negligible for safety. Thus, we recommend that the application of the SFF constraints to the standard should be put on hold.

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

functional safety
safe state
safety integrity level
trip


High-performance implementation and analysis of the linkmap program Linkage analysis uses information from family pedigrees to map genes and locate disease genes on particular chromosomes. A recombination fraction denoted as theta is estimated as a measure of crossing over between two loci. Genetic linkage calculations are very time-consuming particularly for large family pedigrees. a large number of theta values, and an increased number of markers. This paper reports the implementation of a dynamic master-slave scheme for the parallelization of the Link-map program on a high-performance cluster such as the Origin 2000 (O2K) consisting of 56 R 12000 processors. The Link-map program is one of four programs in the LINKAGE/FASTLINK legacy package widely used by the medical research community. Implementations issues are addressed and results are compared with previous results on a cluster of DEC Alphas, and with the sequential execution on the O2K machine. (C) 2001 Elscvier Science (USA).

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

task graphs
task allocation
high-performance computing


Finding paths in graphs avoiding forbidden transitions Let v be a vertex of a graph G; a transition graphT(v) of v is a graph whose vertices are the edges incident with v. We consider graphs G with prescribed transition systemsT={T(v)|v?V(G)} . A path P in G is called T-compatible, if each pair uv,vw of consecutive edges of P form an edge in T(v). Let be a given class of graphs (closed under isomorphism). We study the computational complexity of finding T-compatible paths between two given vertices of a graph for a specified transition system . Our main result is that a dichotomy holds (subject to the assumption P?NP). That is, for a considered class , the problem is either (1) NP-complete, or (2) it can be solved in linear time. We give a criterionbased on vertex induced subgraphswhich decides whether (1) or (2) holds for any given class .

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

compatible path
edge-colored graph
forbidden pairs
np-completeness
linear time algorithm


Normative framework and computational models for simulating and assessing command and control processes We present a normative methodology and computational framework to assess the effectiveness and efficiency of command and control (C2) organizations. Our process is based on quantitative representations of the organization and mission, and utilizes normative models of team and individual decision making. Our assessment methodology has been applied to evaluate the benefits of the Sensing and Patrolling Enablers Yielding Effective Security systema ground-based decentralized C3I system comprised of emerging and existing sensing, SA/C2, and Shaping technologies. To facilitate the assessment analysis, our models have been implemented using a computational agent framework for the Distributed Dynamic Decision making (DDD) virtual simulation platform.

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

computational command and control models


zippered polygon meshes from range images Range imaging offers an inexpensive and accurate means for digitizing the shape of three-dimensional objects. Because most objects self occlude, no single range image suffices to describe the entire object. We present a method for combining a collection of range images into a single polygonal mesh that completely describes an object to the extent that it is visible from the outside. The steps in our method are: 1) align the meshes with each other using a modified iterated closest-point algorithm, 2) zipper together adjacent meshes to form a continuous surface that correctly captures the topology of the object, and 3) compute local weighted averages of surface positions on all meshes to form a consensus surface geometry. Our system differs from previous approaches in that it is incremental; scans are acquired and combined one at a time. This approach allows us to acquire and combine large numbers of scans with minimal storage overhead. Our largest models contain up to 360,000 triangles. All the steps needed to digitize an object that requires up to 10 range scans can be performed using our system with five minutes of user interaction and a few hours of compute time. We show two models created using our method with range data from a commercial rangefinder that employs laser stripe technology.

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

mesh
geometry
range images
object
imaging
polygon
shape
minimal
method
user interaction
storage
data
image
algorithm
surface
consensus

point
surface reconstruction
collect
computation
topologies
timing
model
polygon mesh
structured light range scanner
combinational
locality
technologies
systems
surface fitting
continuation


Directional View Interpolation for Compensation of Sparse Angular Sampling in Cone-Beam CT In flat detector cone-beam computed tomography and related applications, sparse angular sampling frequently leads to characteristic streak artifacts. To overcome this problem, it has been suggested to generate additional views by means of interpolation. The practicality of this approach is investigated in combination with a dedicated method for angular interpolation of 3-D sinogram data. For this purpose, a novel dedicated shape-driven directional interpolation algorithm based on a structure tensor approach is developed. Quantitative evaluation shows that this method clearly outperforms conventional scene-base interpolation schemes. Furthermore, the image quality trade-offs associated with the use of interpolated intermediate views are systematically evaluated for simulated and clinical cone-beam computed tomography data sets of the human head. It is found that utilization of directionally interpolated views significantly reduces streak artifacts and noise, at the expense of small introduce image blur.

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

aliasing
computed tomography (ct)
reconstruction


ACME: A scalable parallel system for extracting frequent patterns from a very long sequence Modern applications, including bioinformatics, time series, and web log analysis, require the extraction of frequent patterns, called motifs, from one very long (i.e., several gigabytes) sequence. Existing approaches are either heuristics that are error-prone, or exact (also called combinatorial) methods that are extremely slow, therefore, applicable only to very small sequences (i.e., in the order of megabytes). This paper presents ACME, a combinatorial approach that scales to gigabyte-long sequences and is the first to support supermaximal motifs. ACME is a versatile parallel system that can be deployed on desktop multi-core systems, or on thousands of CPUs in the cloud. However, merely using more compute nodes does not guarantee efficiency, because of the related overheads. To this end, ACME introduces an automatic tuning mechanism that suggests the appropriate number of CPUs to utilize, in order to meet the user constraints in terms of run time, while minimizing the financial cost of cloud resources. Our experiments show that, compared to the state of the art, ACME supports three orders of magnitude longer sequences (e.g., DNA for the entire human genome); handles large alphabets (e.g., English alphabet for Wikipedia); scales out to 16,384 CPUs on a supercomputer; and supports elastic deployment in the cloud.

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


Design and performance analysis of quasi-orthogonal space-time block codes for four antennae In this letter, a novel general design method of quasi-orthogonal space-time block codes for four antennae is presented. Comparison with the design method proposed by Jafarkhani, this method enlarges the number of quasi-orthogonal space-time block codes. The performance of these codes is also analyzed and the simulation results show that it is similar to even better than that of the codes proposed by Jafarkhani.

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

space-time block codes
quasi-orthogonal space-time block codes
full rate


Effects of mean piston speed, equivalence ratio and cylinder wall temperature on performance of an Atkinson engine The performance of an air standard Atkinson cycle is analyzed using finite-time thermodynamics. In the model, the linear relation between the specific heat ratio of the working fluid and its temperature, the friction loss computed according to the mean velocity of the piston, the internal irreversibility described by using the compression and expansion efficiencies and the heat transfer loss are considered. The relations between the power output and the compression ratio and between the power output and the thermal efficiency are derived by detailed numerical examples. The results show that if the compression ratio is less than a certain value, the power output decreases with increasing mean piston speed, while if the compression ratio exceeds a certain value, the power output first increases and then starts to decrease with increasing mean piston speed. With further increase in the compression ratio, the increase of mean piston speed results in decreasing the power output. Throughout the compression ratio range, the power output increases with increasing cylinder wall temperature while it first increases and then starts to decrease with the increase of equivalence ratio. The conclusions of this investigation are of importance when considering the designs of actual Atkinson engines. (C) 2010 Elsevier Ltd. All rights reserved.

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

friction
internal irreversibility
performance
thermodynamics


Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes We investigate normed commutative context-free processes (Basic Parallel Processes). We show that branching bisimilarity admits the bounded response property: in the Bisimulation Game, Duplicator always has a response leading to a process of size linearly bounded with respect to the Spoilers process. The linear bound is effective, which leads to decidability of branching bisimilarity. For weak bisimilarity, we are able merely to show existence of some linear bound, which is not sufficient for decidability. We conjecture however that the same effective bound holds for weak bisimilarity as well. We suppose that further elaboration of novel techniques developed in this paper may be sufficient to demonstrate decidability.

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

branching bisimulation equivalence
commutative context-free graphs
equivalence checking


An English auction scheme in the online transaction environment Internet technology in the recent years has progressed with great strides, and has transcended physical boundaries to achieve a global community. It has been an efficient tool in the development of modern communication, electronic commerce, and various living applications. Under an Internet environment, a reliable and high-performing English auction scheme is presented in the research involving three parties, namely the Registration Manager, Auction Manager, and Bidder. The Registration Manager identifies and authenticates the bidder. The Auction Manager issues the bidding rights and maintains order during the auction. The proposed scheme has the following features: anonymity, traceability, no framing, unforgeability, non-repudiation, fairness, public verifiability, unlinkability among different auction rounds, linkability in a round of auction, efficiency of bidding, one-time registration, and easy revocation. Given the Internet environment, significant importance is attached to time costs in transmitting bidding data. Hence, the bulletin board method is used to enable both the registration and auction managers to declare the necessary parameters. Furthermore, the elliptic curve cryptosystem, owing to its low computational amount and small key size, is applied to the scheme. Consequently, the auction-manager server load can be effectively reduced, while simultaneously significantly increasing bidding efficiency.

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

elliptic curve cryptosystem
english auction
bulletin board
anonymity
public verifiability


Optimal overload response in sensor networks A single commodity network that models the information flow in an arbitrary topology sensor field that collects and forwards information to a backbone through certain designated gateway nodes is considered. Resilient operation in overload stress situations caused by unpredictable traffic or topology variations is investigated. That amounts to studying the network in instability mode, where the traffic load distribution is outside the throughput region. A fluid model is adopted where superflows model traffic forwarding and backlog formations at the network level. Quantitative performance metrics of the overload including throughput, lexicographic minimization, most balanced allocation, and amount of lost traffic due to buffer overflow are considered to capture the information loss process due to overflow in the network. Optimal superflows with respect to these metrics are characterized and a distributed asynchronous algorithm that computes such superflows is given. The characterization of the optimal superflow amounts to obtaining a structural decomposition of the network in a sequence of disjoint subregions with decreasing overload such that traffic flows only from regions of higher overload to regions of lower overload. The optimal superflow represents the smoothest trajectory to overflow, followed by the network in case of instability.

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

most balanced allocation
overload response
sensor networks

distributed algorithms
lexicographic optimization
lost traffic minimization
network control
throughput maximization


OGIR: an ontology-based grid information retrieval framework Purpose - A grid information retrieval model has benefits for sharing resources and processing mass information, but cannot handle conceptual heterogeneity without integration of semantic information. The purpose of this research is to propose a concept-based retrieval mechanism to catch the user's query intentions in a grid environment. This research re-ranks documents over distributed data sources and evaluates performance based on the user judgment and processing time. Design/methodology/approach - This research uses the ontology lookup service to build the concept set in the ontology and captures the user's query intentions as a means of query expansion for searching. The Globus toolkit is used to implement the grid service. The modification of the collection retrieval inference (CORI) algorithm is used for re-ranking documents over distributed data sources. Findings - The experiments demonstrate that this proposed approach successfully describes the user's query intentions evaluated by user judgment. For processing time, building a grid information retrieval model is a suitable strategy for the ontology-based retrieval model. Originality/value - Most current semantic grid models focus on construction of the semantic grid, and do not consider re-ranking search results from distributed data sources. The significance of evaluation from the user's viewpoint is also ignored. This research proposes a method that captures the user's query intentions and re-ranks documents in a grid based on the CORI algorithm. This proposed ontology-based retrieval mechanism calculates the global relevance score of all documents in a grid and displays those documents with higher relevance to users.

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

electronic libraries
document management
document delivery
semantics
information searches


The stationary distribution of a Markovian process arising in the theory of multiserver retrial queueing systems In this paper, we introduce a bivariate Markov process {X(t), t greater than or equal to 0} = {(C(t), Q(t)), t greater than or equal to 0} whose state space is a lattice semistrip E = {0, 1, 2, 3} x Z(+). The process {X(t), t greater than or equal to 0} can be seen as the joint process of the number of servers and waiting positions occupied, and the number of customers in orbit of a generalized Markovian multiserver queue with repeated attempts and state dependent intensities. Using a simple approach, we derive closed form expressions for the stationary distribution of {X(t), t greater than or equal to 0} when a sufficient condition is satisfied. The stationary analysis of the M/M/2/2 + 1 and M/M/3/3 queues with linear retrial rates is studied as a particular case in this process. (C) 1999 Elsevier Science, Ltd. All rights reserved.

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

multiserver queue
stationary distribution


schema disruption in tree-structured chromosomes We study if and when the inequality dp(H) ? rel?(H) holds for schemas H in chromosomes that are structured as trees. The disruption probability dp(H) is the probability that a random cut of a tree limb will separate two fixed nodes of H. The relative diameter rel?(H) is the ratio (max distance between two fixed nodes in H) / (max distance between two tree nodes), and measures how close together are the fixed nodes of H. Inequality dp(H) ? rel?(H) is of significance in proving Schema Theorems for non-linear chromosomes, and so bears upon the success we can expect from genetic algorithms. For linear chromosomes, dp(H) ?rel?(H). Our results include the following. There is no constant c such that dp(H) ? c rel?(H) holds for arbitrary schemas and trees. This is illustrated in trees with eccentric, stringy shapes. Matters improve for dense, ball-like trees, explained herein. Inequality dp(H) ? rel?(H) always holds in such trees, except for certain atypically large schemas. Thus, the more compact are our tree-structured chromo-somes, the better we can expect our genetic algorithms to work.

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

schema disruption probability
alternative chromosomes
schema theory


Hierarchical ANN system for stuttering identification The presented work covers the issue of applying neural networks to the recognition and categorization of non-fluent and fluent utterance records. Speech samples containing three types of stuttering episodes (blocks before words starting with plosives, syllable repetitions, and sound-initial prolongations) were applied. The proposed system, built with hierarchical neural network framework, was used and then evaluated with respect to its ability to recognize and classify disfluency types in stuttered speech. The purpose of the first network was to reduce the dimension of vector describing the input signals. The result of the analysis was the output matrix consisting of neurons winning in a particular time frame. This matrix was taken as an input for the next network. Various types of MLP networks were examined with respect to their ability to classify utterances correctly into two, non-fluent and fluent, groups. Good examination results were accomplished and classification correctness exceeded 84-100% depending on the disfluency type. (C) 2012 Elsevier Ltd. All rights reserved.

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

artificial neural network
kohonen network
multilayer perceptron


finding image exemplars using fast sparse affinity propagation In this paper, we propose a novel approach to organize image search results obtained from state-of-the-art image search engines in order to improve user experience. We aim to discover exemplars from search results and simultaneously group the images. The exemplars are delivered to the user as a summary of search results instead of the large amount of unorganized images. This gives the user a brief overview of search results with a small amount of images, and helps the user to further find the images of interest. We adopt the idea of affinity propagation and design a fast sparse affinity propagation algorithm to find exemplars that best represent the image search results. Experiments on real-world data demonstrate the effectiveness of our method both visually and quantitatively.

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


DeAliaser: Alias Speculation Using Atomic Region Support Alias analysis is a critical component in many compiler optimizations. A promising approach to reduce the complexity of alias analysis is to use speculation. The approach consists of performing optimizations assuming the alias relationships that are true most of the time, and repairing the code when such relationships are found not to hold through runtime checks. This paper proposes a general alias speculation scheme that leverages upcoming hardware support for transactions with the help of some ISA extensions. The ability of transactions to checkpoint and roll back frees the compiler to pursue aggressive optimizations without having to worry about recovery code. Also, exposing the memory conflict detection hardware in transactions to software allows runtime checking of aliases with little or no overhead. We test the potential of the novel alias speculation approach with Loop Invariant Code Motion (LICM), Global Value Numbering (GVN), and Partial Redundancy Elimination (PRE) optimization passes. On average, they are shown to reduce program execution time by 9% in SPEC FP2006 applications and 3% in SPEC INT2006 applications over the alias analysis of a state-of-the-art compiler.

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

algorithms
design
performance
transactional memory
compiler optimization


dominance hierarchies and social diversity in multi-agent systems In this study, we investigate self-organizing social hierarchies in multi-agent systems. Agents occupy the nodes of a small-world network and interact exclusively with other agents in their local neighbourhood. Here, the interactions represent competition for a limited resource. Monte-Carlo simulations show that the changes in a network's structure can alter the steady-state attributes for fixed reward/penalty mechanisms. The results suggest that the expected phase transition from a homogeneous to a hierarchical society depends on: (a) the relative strengths of the feedback mechanisms employed, (b) the underlying communication topology, and (c) whether previously dominated agents are replaced in the population by agents with higher social status. A key contribution of this paper is the coherent picture painted of the relationship between social differentiation and spatial structure in a multi-agent system.

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

hierarchy
multi-agent systems
small-world network
self-organization
socio-physics


A prediction interval-based approach to determine optimal structures of neural network metamodels Neural networks have been widely used in literature for metamodeling of complex systems and often outperform their traditional counterparts such as regression-based techniques. Despite proliferation of their applications, determination of their optimal structure is still a challenge, especially if they are developed for prediction and forecasting purposes. Researchers often seek a tradeoff between estimation accuracy and structure complexity of neural networks in a trial and error basis. On the other hand, the neural network point prediction performance considerably drops as the level of complexity and amount of uncertainty increase in systems that data originates from. Motivated by these trends and drawbacks, this research aims at adopting a technique for constructing prediction intervals for point predictions of neural network metamodels. Space search for neural network structures will be defined and confined based on particular features of prediction intervals. Instead of using traditional selection criteria such as mean square error or mean absolute percentage error, prediction interval coverage probability and normalized mean prediction interval will be used for selecting the optimal network structure. The proposed method will be then applied for metamodeling of a highly detailed discrete event simulation model which is essentially a validated virtual representation of a large real world baggage handling system. Through a more than 77% reduction in number of potential candidates, optimal structure for neural networks is found in a manageable time. According to the demonstrated results, constructed prediction intervals using optimal neural network metamodel have a satisfactory coverage probability of targets with a low mean of length.

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


An efficient index structure for XML based on generalized suffix tree ? A novel index structure based on the generalized suffix tree (PIGST) is proposed. Combined with post lists, PIGST can answer both structural and content queries. The distinct paths in an XML collection are mapped into strings. The construction algorithm of the PIGST for the path strings is presented based on the modification and improvement of a well-known suffix tree construction algorithm that only requires linear time and space complexity. The query process merely needs m character comparisons for direct containment queries, where m is the length of a query string. An efficient processing method for the indirect containment queries that avoids the inefficient tree traversal operation is also presented. Experiments show that PIGST outperforms earlier approaches.

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

path index based on generalized suffix tree (pigst)


Perceptual Quality-Regulable Video Coding System With Region-Based Rate Control Scheme In this paper, we discuss a region-based perceptual quality-regulable H. 264 video encoder system that we developed. The ability to adjust the quality of specific regions of a source video to a predefined level of quality is an essential technique for region-based video applications. We use the structural similarity index as the quality metric for distortion-quantization modeling and develop a bit allocation and rate control scheme for enhancing regional perceptual quality. Exploiting the relationship between the reconstructed macroblock and the best predicted macroblock from mode decision, a novel quantization parameter prediction method is built and used to achieve the target video quality of the processed macroblock. Experimental results show that the system model has only 0.013 quality error in average. Moreover, the proposed region-based rate control system can encode video well under a bitrate constraint with a 0.1% bitrate error in average. For the situation of the low bitrate constraint, the proposed system can encode video with a 0.5% bit error rate in average and enhance the quality of the target regions.

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

h.264
perceptual video coding
structural similarity (ssim)


Optimized graph-based segmentation for ultrasound images Segmentation of medical images is an inevitable image processing step for computer-aided diagnosis. Due to complex acoustic inferences and artifacts, accurate extraction of breast lesions in ultrasound images remains a challenge. Although there have been many segmentation techniques proposed, the performance often varies with different image data, leading to poor adaptability in real applications. Intelligent computing techniques for adaptively learning the boundaries of image objects are preferred. This paper focuses on optimization of a previously documented method called robust graph-based (RGB) segmentation algorithm to extract breast tumors in ultrasound images more adaptively and accurately. A novel technique named as parameter-automatically optimized robust graph-based (PAORGB) image segmentation method is accordingly proposed and performed on breast ultrasound images. A particle swarm optimization algorithm is incorporated with the RGB method to achieve optimal or approximately optimal parameters. Experimental results have shown that the proposed technique can more accurately segment lesions from ultrasound images compared to the RGB and two conventional region-based methods.

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

evolutionary learning
ultrasound image segmentation
graph theory


Chaotifying the controllable linear system via single input state feedback An approach for chaotifying a stable controllable linear system via single input state-feedback is presented. The feedback controller designed is a sawtooth function of the system states, which can make the fixed point of the closed-loop system to be a snapback repeller, thereby yielding chaotic dynamics. Based on the Marotto theorem, it is proven theoretically that the closed-loop system is chaotic in the sense of Li and Yorke. Finally, the simulation results are used to illustrate the effectiveness of the proposed theory.

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


Shape morphing-based control of robotic visual servoing We present an approach for controlling robotic interactions with objects, using synthetic images generated by morphing shapes. In particular, we attempt the problem of positioning an eye-in-hand robotic system with respect to objects in the workspace for grasping and manipulation. In our formulation, the grasp position (and consequently the approach trajectory of the manipulator), varies with each object. The proposed solution to the problem consists of two parts. First, based on a model-based object recognition framework, images of the objects taken at the desired grasp pose are stored in a database. The recognition and identification of the grasp position for an unknown input object (selected from the family of recognizable objects) occurs by morphing its contour to the templates in the database and using the virtual energy spent during the morph as a dissimilarity measure. In the second step, the images synthesized during the morph are used to guide the eye-in-hand system and execute the grasp. The proposed method requires minimal calibration of the system. Furthermore, it conjoins techniques from shape recognition, computer graphics, and vision-based robot control in a unified engineering framework. Potential applications range from recognition and positioning with respect to partially-occluded or deformable objects to planning robotic grasping based on human demonstration.

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

shape recognition
robotic visual servoing

shape morphing
vision-based robot control
vision-based grasping


On the consistency of multiclass classification methods Binary classification is a well studied special case of the classification problem. Statistical properties of binary classifiers, such as consistency, have been investigated in a variety of settings. Binary classification methods can be generalized in many ways to handle multiple classes. It turns out that one can lose consistency in generalizing a binary classification method to deal with multiple classes. We study a rich family of multiclass methods and provide a necessary and sufficient condition for their consistency. We illustrate our approach by applying it to some multiclass methods proposed in the literature.

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


A novel hybrid prediction algorithm to network traffic Network traffic describes the characteristics and users behaviors of communication networks. It is a crucial input parameter of network management and network traffic engineering. This paper proposes a new prediction algorithm to network traffic in the large-scale communication network. First, we use signal analysis theory to transform network traffic from time domain to time-frequency domain. In the time-frequency domain, the network traffic signal is decomposed into the low-frequency and high-frequency components. Second, the gray model is exploited to model the low-frequency component of network traffic. The white Gaussian noise model is utilized to describe its high-frequency component. This is reasonable because the low-frequency and high-frequency components, respectively, represent the trend and fluctuation properties of network traffic, while the gray model and white Gaussian noise model can well capture the characteristics. Third, the prediction models of low-frequency and high-frequency components are built. The hybrid prediction algorithm is proposed to overcome the problem of network traffic prediction in the communication network. Finally, network traffic data from the real network is used to validate our approach. Simulation results indicate that our algorithm holds much lower prediction error than previous methods.

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

traffic prediction
traffic modeling
time-frequency analysis


Explaining consumer choice through neural networks: The stacked generalization approach This paper uses neural network models and the ensemble technique of stacked generalization to investigate the relative importance of situational and demographic factors on consumer choice. We discuss the theoretical justification for this approach and develop the level-0 and level-1 models which we estimate using a consumer choice data set from AT&T. The findings confirm the superiority of situational factors in explaining the consumers choice of communication modes and support the strength of stacked generalization. Important clues that emerge from the analysis regarding the factors to be accounted for when developing efficient neural network structures are also discussed.

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


Aging and the Role of Reactive Nitrogen Species The role of reactive oxygen species and its effects on aging has received considerable attention in the past 47 years since Dr. Denham Harman first proposed the free radical theory of aging. Though not completely understood due to the incalculable number of pathways involved, the number of manuscripts that facilitate the understanding of the underlying effects of reactive radical species on the oxidative stress on lipids, proteins, and DNA and its contribution to the aging process increases nearly exponentially each year. More recently, the role of reactive nitrogen species, such as nitric oxide and its by-productsnitrate (NO3?), nitrite (NO2?), peroxynitrite (ONOO?), and 3-nitrotyrosinehave been shown to have a direct role in cellular signaling, vasodilation, and immune response. Nitric oxide is produced within cells by the actions of a group of enzymes called nitric oxide synthases. Presently, there are three distinct isoforms of nitric oxide synthase

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

apoptosis
oxidants
protein nitration
denitrase


Synaptic Inputs and Their Pathways from Fixation and Saccade Zones of the Superior Colliculus to Inhibitory Burst Neurons and Pause Neurons Abstract: The caudal part of the superior colliculus (SC) plays an important role in the generation of saccades, whereas the rostral part of the SC is considered to be involved in visual fixation. The present study was performed to determine neural connections from the rostral and caudal parts of the SC to inhibitory burst neurons (IBNs) and pause neurons (PNs) in the nucleus raphe interpositus in the anesthetized cat, and to reveal the functional role of the rostral SC on eye movements. The intracellular potentials from IBNs and PNs were recorded, and the effects of stimulation of the SC on these neurons were analyzed. The results show that IBNs receive monosynaptic excitation from the contralateral caudal SC, and disynaptic inhibition from the ipsilateral caudal SC via contralateral IBNs. In addition, IBNs receive disynaptic inhibition from the rostral part of the SC on either side via inhibitory interneurons other than IBNs. Intracellular recording from PNs revealed that they receive convergent excitation from the rostral parts of the bilateral superior colliculi and that the rostral SC inhibits IBNs on both sides via PNs. The neural connections determined in this study support the functional independence of the rostral SC and are consistent with the notion that the fixation zone is localized in the rostral SC. These results show that the fixation zone in the rostral SC may suppress the initiation of bilateral saccades via pause neurons.

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

inhibitory burst neuron (ibn)
pause neuron (pn)
abducens motoneuron
fixation neuron


data aspects in a relational database Data has cross-cutting concerns such as versioning, privacy, and reliability. In this paper we sketch support such concerns by adapting the aspect-oriented programming (AOP) paradigm to data. Our goal, shared by AOP, is to re-engineer applications to support cross-cutting concerns without directly modifying the application's data or queries. We propose modeling a cross-cutting data concern as a data aspect. A data aspect weaves metadata around an application's data and queries, imbuing them with additional semantics for constraint and query processing.

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

aspect-oriented
cross-cutting concerns
relational algebra


Substructural analysis in drug discovery The dominant paradigm in drug discovery emphasizes techniques that generate large amounts of data. What was possible by simple inspection in the past, nowadays cannot be effectively achieved without the aid of informatics techniques. In this context substructural analysis techniques are increasing their role in the organization and management of information generated. Advances in the field of substructure analysis have expanded the applicability of substructural analysis in multiple fronts in early lead discovery and optimization. It can be applied beyond the management of information, including compound library design and virtual screening to structure activity relationships. The relationships between chemical substructures and drug-like properties also aid in developing more robust rationales for fragment-based approaches for lead discovery, predictive toxicology, and elucidation of pharmacokinetic properties. A review of recent developments in substructure analysis in a broad range of areas in drug discovery is presented. The focus is on the application of substructural analysis in computational chemistry for drug design and the methods used to identify substructures in a chemical database, as well as their relation to fragment-based drug discovery. The discussion shows the benefits of substructural analysis to the drug discovery process and gives impetus to further advancement of substructure analysis techniques.

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

maximum common substructure
fragment-based discovery
chemical data management
chemoinformatics
data mining


Dynamic tuning of the workload partition factor and the resource utilization in data-intensive applications A methodology to improve performance in data-intensive applications has been designed. It adapts at run time the workload partition factor and the number of resources to be used. Adaptation of the partition factor enables load balancing and overall time reduction. Adaptation of the number of resources used enables execution without large idle times. Obtained results using real data-intensive applications are encouraging and positive.

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

data-intensive applications
divisible load theory (dlt)


The integration of process simulation in operational analysis The driving force for undertaking any process retrofit is to increase the overall profitability of that process. The opportunities for increasing profitability are available in a wide variety of forms. For example, cheaper, alternative raw materials, which do not affect the yields and cycle time, may be identified. A new conversion or recovery technology to produce the same compound may be developed. The average throughput of the slowest stage, the bottleneck, may be increased by adding parallel equipment or by fine-tuning operating parameters of that stage. Of course, any process change may incur capital expenses and/or increase operating costs which must be more than offset by the increase in the overall throughput of the process. The management at Eli Lilly has made a commitment to base the process retrofit decisions on as much quantitative information as possible. In addition, an increased emphasis will be placed on taking into consideration the overall process in evaluating the impact of change rather than studying a section of the process in isolation. Due to the highly regulated nature of the pharmaceutical business, the cost and risk of implementing a process change are enhanced. Making changes to a pharmaceutical process entails obtaining regulatory compliance approval. The extent of effort required in obtaining these approvals depends on the types of proposed changes. Some changes require only proper reporting, while others require proper validation and authorization by the FDA. Often, unless the indicated change has a proposed significant incremental improvement, it would be rejected. Simulation has provided additional support to justify both major and minor process improvements. This paper describes the steps taken in evaluating the impact of changing the technology of a key operation in one section of Eli Lilly's biosynthetic bulk drug processing facility in Indianapolis, IN. The study was performed using the BATCHES simulator. First, the description of the underlying process is given followed by the details of the simulation model. At the end, a summary of various simulation runs and the ranges of parameters studied is provided. (C) 2000 Elsevier Science Ltd. All rights reserved.

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


Multiprocessor task scheduling in multistage hybrid flow-shops: A parallel greedy algorithm approach Hybrid flow shop scheduling problems have a special structure combining some elements of both the flow shop and the parallel machine scheduling problems. Multiprocessor task scheduling problem can be stated as finding a schedule for a general task graph to execute on a multiprocessor system so that the schedule length can be minimized. Hybrid Flow Shop Scheduling with Multiprocessor Task (HFSMT) problem is known to be NP-hard. In this study we present an effective parallel greedy algorithm to solve HFSMT problem. Parallel greedy algorithm (PGA) is applied by two phases iteratively, called destruction and construction. Four constructive heuristic methods are proposed to solve HFSMT problems. A preliminary test is performed to set the best values of control parameters, namely population size, subgroups number, and iteration number. The best values of control parameters and operators are determined by a full factorial experimental design using our PGA program. Computational results are compared with the earlier works of O?uz et al. [1]and[3], and O?uz [2]. The results indicate that the proposed parallel greedy algorithm approach is very effective in terms of reduced total completion time or makespan (Cmax) for the attempted problems.

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

hybrid flow shop
parallel greedy algorithm

multiprocessor tasks scheduling problems


retaining majors through the introductory sequence Retention is an important issue for Computer Science Departments. In many cases students leave the major due to frustrations with programming in the complex languages often used in CS1 and CS2 or because they do not understand that computer science is much more than programming. We have redesigned our introductory sequence to include a rigorous, non-programming introduction to the field and a CS1 course which uses Scheme so that students can focus on the principles of programming instead of the complexities of a particular language. In the first year that we have required these courses in our major, we have had positive results. In this paper, we describe what we have learned through discussions with students and student surveys.

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


a cooperative coevolutionary genetic algorithm for learning bayesian network structures We propose a cooperative coevolutionary genetic algorithm for learning Bayesian network structures from fully observable data sets. Since this problem can be decomposed into two dependent subproblems, that is to find an ordering of the nodes and an optimal connectivity matrix, our algorithm uses two subpopulations, each one representing a subtask. We describe the empirical results obtained with simulations of the Alarm and Insurance networks. We show that our algorithm outperforms the deterministic algorithm K2.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 the nature, evolution and future of quantitative structure-activity relationships (QSAR) in toxicology The quantitative structure-activity relationship (QSAR) science agenda is being determined by its skeptics. Toxic substances control legislation over the past 30 years was born of a culture that tests animals and interprets the results of those tests in attempts to protect public health. Even with the current awareness that there are many more chemicals to assess than resources and test data permit, those skeptical of QSAR are predominant in the regulatory setting. Bureaucracies founded on laboratory testing, whether a private or governmental agency, will only begrudgingly accept QSAR as a strategic tool for designing chemicals and managing chemical risks. Every major milestone in QSAR accomplishments has been met with stronger skepticism that QSAR cannot replace animal testing. The QSAR research community needs to embrace the arguments of the skeptics and design research to overcome the perceived inadequacies of current QSAR methods. This paper will discuss three common errors in QSAR research, which, if corrected, will place in silico methods fully complementary to the strategic use of in vitro and in vivo methods. QSAR is based on well-defined endpoints of intrinsic chemical activities and molecular descriptors, which can be mechanistically interpreted. Chemicals in a QSAR training set ought to have a common mechanism of interaction so that the context of structural requirements defining the domain can be articulated and tested. Finally, the estimation of complex endpoints ought to be controlled by a QSAR-based expert system if the estimation of missing values or hazard screening in heterogeneous inventories is to avoid fueling the skepticism of QSAR.

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

applicability domain
toxicity test data
reach


interdisciplinary minor in digital forensics, security and law Digital forensics is playing a more prominent role in law enforcement, network security, and information assurance. The field of study encompasses not just digital evidence, but also the areas of cyber law, sociology, and security to name a few. Its increasing importance is reflected in its growing role within crime investigations, civil cases and homeland security.An in-depth understanding of digital forensics will be needed by college students who will be entering the various fields within technology, business, criminal justice, law, and homeland security. Currently, many professionals in those fields are not well-prepared to understand the use and management of digital evidence - or the use of digital forensics in determining the causes of security breaches, or the avoidance of security breaches altogether.Today, many professionals are working with others from different fields - lawyers are working with IT managers, members of law enforcement are working with forensics engineers. Well, at least they are trying. Unless properly prepared, many of these professionals will not be able to communicate and work effectively with each other. Those communications will continue in their frequency and importance. The demand for forensics and investigative work by knowledgeable professionals will continue to exceed the supply available for the foreseeable future.While some topics or courses in forensics and security will be needed in a variety of majors such as criminal justice and computer science, an enhanced level of study should be provided for those wishing to have a more solid foundation in digital forensics, security and law. By having students from different disciplines participate together in a minor in digital forensics, security and law, we hope to provide a richer learning environment.The curriculum discussed contains core courses in digital forensics, security and law as well as a capstone course. The curriculum also contains individual tracks in several areas for more in-depth study outside the students chosen major. The core courses within the minor cover digital evidence and its relationship to forensics, security and the law. Many areas of law are covered within the curriculum because of the ubiquitous use of computers and the importance of such acts as Graham-Leach-Bliley Act (GLBA) of 1999, Electronic Communications Privacy Act of 1986 (ECPA), Sarbanes-Oxley (SOX), Health Insurance Portability and Accountability Act of 1996 (HIPAA) and the USA PATRIOT Act.This article describes the background and the process of developing a minor in digital forensics, security and law to better prepare those students majoring in criminal justice, information technology and computer science. This article also presents information on extending the minor to students majoring in accounting, pre-law and public administration.

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

curriculum
digital forensics
digital evidence

cyberlaw
computer forensics
electronic evidence


Fast concurrent access to parallel disks High performance applications involving large data sets require the efficient and flexible use of multiple disks. In an external memory machine with D parallel, independent disks, only one block can be accessed on each disk in one I/O step. This restriction leads to a load balancing problem that is perhaps the main inhibitor for the efficient adaptation of single-disk external memory algorithms to multiple disks. We solve this problem for arbitrary access patterns by randomly mapping blocks of a logical address space to the disks. We show that a shared buffer of O(D) blocks suffices to support efficient writing. The analysis uses the properties of negative association to handle dependencies between the random variables involved. This approach might be of independent interest for probabilistic analysis in general. If two randomly allocated copies of each block exist, N arbitrary blocks can be read within [N/D] + 1 I/O steps with high probability. The redundancy can be further reduced from 2 to 1 + 1/r for any integer r without a big impact on reading efficiency. From the point of view of external memory models, these results rehabilitate Aggarwal and Vitter's "single-disk multi-head" model [1] that allows access to D arbitrary blocks in each I/O step. This powerful model can be emulated on the physically more realistic independent disk model [2] with small constant overhead factors. Parallel disk external memory algorithms can therefore be developed in the multi-head model first. The emulation result can then be applied directly or further refinements can be added.

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


Analysis of dissipation energy of switching digital CMOS gates with coupled outputs The current trend of a high level of integration causes an important parasitic coupling between lines, that is, a capacitance between lines exists in addition to capacitance to ground. This paper calculates how this coupling capacitance influences the power consumption, taking into account the value of the capacitance, the switching activity of the coupled lines, and the influence of relative delay between transitions in the coupled lines.

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

power-consumption-model interconnections crosstalk-noise switching-activity low-power-design


Borehole and Ice Feature Annotation Tool (BIFAT): A program for the automatic and manual annotation of glacier borehole images We present a stand-alone software platform, Borehole and Ice Feature Annotation Tool (BIFAT), for the examination, annotation and analysis of glacier borehole images. This tool aids in the lengthy and often subjective process of annotating layers and other features in optical and acoustic glacier borehole televiewer logs. Since these view 360 around the full circumference of an exploratory borehole, intersecting planes are reconstructed on the televiewer image as sinusoids, the amplitude and phase of which can be used to calculate, respectively, the dip and direction of dip of each of these planes. The program aids in the annotation and examination of such planes, as well as a number of other features, including clusters and inclusions. BIFAT also provides an automatic layer detection option to aid and speed up the often lengthy process of identifying planar features in glacier borehole images. The software also shows promising results in rock borehole images and in the detection of planar layers in line-scan ice core images. We describe the capability and operation of BIFAT, and illustrate its application with reference to the automatic identification and annotation of sections from an optical televiewer (OPTV) borehole log from Roi Baudouin, Dronning Maud Land, Antarctica. The software is freely available for download from http://users.aber.ac.uk/byh/iceoptv.

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

image analysis
englacial layering
ice boreholes


Stochastic programming and scenario generation within a simulation framework: An information systems perspective Stochastic programming brings together models of optimum resource allocation and models of randomness to create a robust decision-making framework. The models of randomness with their finite, discrete realisations are called scenario generators. In this paper, we investigate the role of such a tool within the context of a combined information and decision support system. We explain how two well-developed modelling paradigms, decision models and simulation models can be combined to create business analytics which is based on ex-ante decision and ex-post evaluation. We also examine how these models can be integrated with data marts of analytic organisational data and decision data. Recent developments in on-line analytical processing (OLAP) tools and multidimensional data viewing are taken into consideration. We finally introduce illustrative examples of optimisation, simulation models and results analysis to explain our multifaceted view of modelling. In this paper, our main objective is to explain to the information systems (IS) community how advanced models and their software realisations can be integrated with advanced IS and DSS tools.

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

scenario generation
stochastic programming
dss
olap
business analytics
simulation


On-line hand-drawn electric circuit diagram recognition using 2D dynamic programming In order to facilitate sketch recognition, most online existing works assume that people will not start to draw a new symbol before the current one has been finished. We propose in this paper a method that relaxes this constraint. The proposed methodology relies on a two-dimensional dynamic programming (2D-DP) technique allowing symbol hypothesis generation, which can correctly segment and recognize interspersed symbols. In addition, as discriminative classifiers usually have limited capability to reject outliers, some domain specific knowledge is included to circumvent those errors due to untrained patterns corresponding to erroneous segmentation hypotheses. With a point-level measurement, the experiment shows that the proposed novel approach is able to achieve an accuracy of more than 90 percent.

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

electric circuit diagram
dynamic programming


Invariance properties of interval dynamical systems This article analyses the flow (positive) invariance of different types of time-dependent sets with respect to the dynamics of interval systems (state-space models described by interval matrices) in both discrete and continuous time. The investigated sets have general shapes, defined in terms of HO lder vector p-norms, 1 <= p <= infinity. The time dependence of the sets is separately considered arbitrary and exponentially decreasing. We develop procedures that explore set invariance by using (i) a single test matrix, introduced as a majorant of the interval matrix and (ii) all the distinct vertices of the matrix polytope corresponding to the interval matrix. In case (i) we provide sufficient conditions for all p, 1 <= p <= 1, whereas the necessity is guaranteed only for p is an element of {1, infinity}; in case (ii) we formulate necessary and sufficient conditions valid for all p, 1 <= p <= infinity. Our analysis shows that the existence of invariant sets (with arbitrary or exponential time-dependence, defined by a p-norm) approaching the state-space origin for infinite time horizon implies the asymptotic stability. Some examples are presented to provide intuitive support for the theoretical concepts and to illustrate the applicability of the main results.

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

interval systems
interval matrices
invariant sets
stability

parametric uncertainties
matrix inequalities


Linking structural equation modeling to Bayesian networks: Decision support for customer retention in virtual communities Bayesian networks are limited in differentiating between causal and spurious relationships among decision factors. Decision making without differentiating the two relationships cannot be effective. To overcome this limitation of Bayesian networks, this study proposes linking Bayesian networks to structural equation modeling (SEM), which has an advantage in testing causal relationships between factors. The capability of SEM in empirical validation combined with the prediction and diagnosis capabilities of Bayesian modeling facilitates effective decision making from identification of causal relationships to decision support. This study applies the proposed integrated approach to decision support for customer retention in a virtual community. The application results provide insights for practitioners on how to retain their customers. This research benefits Bayesian researchers by providing the application of modeling causal relationships at latent variable level, and helps SEM researchers in extending their models for managerial prediction and diagnosis.

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

decision support
structural equation modeling
bayesian networks
customer retention
virtual community


Properties of quadratic equations and their application to power system analysis A number of facts about quadratic algebraic problems and applied NewtonRaphson like methods are presented. The main results are about solution structure, loading trajectories, load flow feasibility boundaries and NewtonRaphson solutions. Various practically important applications of these properties are discussed. Although motivated by power flow problems, the results are valid for any problem described by an algebraic system of quadratic equations.

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

network analysis
load flow analysis
numerical techniques


Recursive search method applied to a nonequilibrium phase transition In this work, we extend the recursive search method to locate the critical point and to obtain the relevant critical exponents of a nonequilibrium phase transition. In particular, the method is applied to the contact process which presents a nonequilibrium phase transition between a steady active to a single inactive absorbing state belonging to the directed percolation universality class. We present the appropriate scaling analysis which allows for precise estimates of the critical parameters with a relatively small computational effort. The proposed scheme can be directly applied to general model systems presenting nonequilibrium transitions into absorbing states including reaction-diffusion and pair contact processes.

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

nonequilibrium phase transition
contact process
recursive search


Solving Kirkman's schoolgirl problem in a few seconds The Social Golfer Problem has been extensively used by the constraint community in recent years as an example of a highly symmetric problem. It is an excellent problem for benchmarking symmetry breaking mechanisms such as SBDS or SBDD and for demonstrating the importance of the choice of the right model for one problem. We address in this paper a specific instance of the Golfer Problem well known as Kirkman's Schoolgirl Problem and list a collection of techniques and tricks to find efficiently all its unique solutions. In particular, we propose SBDD+, a generic improvement over SBDD which allows a deep pruning when a symmetry is detected during the search. Our implementation of the presented techniques improves previously published results by an order of magnitude for CPU time as well as for number of backtracks. It computes the seven unique solutions of Kirkman's problem in a few seconds.

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


Highly Efficient Gradient Computation for Density-Constrained Analytical Placement Recent analytical global placers use density constraints to approximate nonoverlap constraints, and these show very successful results. This paper unifies a wide range of density smoothing techniques called global smoothing and presents a highly efficient method for computing the gradient of such smoothed densities used in several well-known analytical placers. This method reduces the complexity of the gradient computation by a factor of n compared with a naive method, where n is the number of modules. Furthermore, with this efficient gradient computation, it is able to support an efficient nonlinear programming-based placement framework, which supersedes the existing force-directed placement methods. Experiments show that replacing the approximated gradient computation in mPL6 with the exact gradient computation improves wire length by 15% on the IBM-HB+ benchmark and by 3% on average on the modified International Symposium on Physical Design 2005 (ISPD'05) and ISPD'06 placement contest benchmarks with movable macros. The results also show that the augmented Lagrangian method outperforms the quadratic penalty method with the exact gradient computation.

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

iterative solvers
overlap constraints
overlap removal


Extended generic product structure: an information model for representing product families An information model is presented that supports sharing of design definition data between the designs of completely configured variants within a product family. Design data sharing is supported across many levels of a design's product structure hierarchy: A change in one subassembly component does not force the whole subassembly to be duplicated. This is achieved for completely configured models and does not require the use of effectivity or any other filtering mechanism. The key is recognizing a product structure architecture that acts as a template for product variants, maximizing data sharing between them. This approach is applied to many distinct product structure abstractions, including the geometric design and the logical systems design of a product. It is extended to include secondary product structure data such as interface connection points (e.g., ports) and connectivity information, which may involve connections between ports or the mapping from the logical systems design to the geometric design that implements it. This model achieves data scalability for hierarchical product structures, meaning that when adding a new product variant, the amount of new data that must be added is proportional to the amount of design change required for the new variant times the logarithm of the total system size (this logarithm is taken to the base of the branching factor of the product structure tree).

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

product lifecycle management
multivariant design
configuration management
design domains


Multilevel finite element discretizations based on local defect correction for nonsymmetric eigenvalue problems ? Based on the work of Xu and Zhou (2000), we establish new three-level and multilevel finite element discretizations by local defect correction techniques. Theoretical analysis and numerical experiments show that the discretizations are simple and easy to implement, and can be used to solve nonsymmetric eigenvalue problems with non smooth eigenfunctions efficiently. We also discuss the local error estimates of finite element approximations; it is a new feature here that the estimates apply to the local domains containing corner points.

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

nonsymmetric eigenvalue problems
finite element
local defect correction

multilevel discretization
local refinement


A model for secure protocols and their compositions This paper develops a foundation for reasoning about protocol security. We adopt a model-based approach for defining protocol security properties. This allows us to describe security properties in greater detail and precision than previous frameworks. Our model allows us to reason about the security of protocols, and considers issues of beliefs of agents, time, and secrecy. We prove a composition theorem which allows us to state sufficient conditions on two secure protocols A and B such that they may be combined to form a new secure protocol C. Moreover, we give counter-examples to show that when the conditions are not met, the protocol C may not be secure.

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

authentication
clocks
communication
computer security
cryptography
formal methods
logic of authentication
model checking
protocol analysis
protocols composition of
security time
timed models


Networks of polarized evolutionary processors ? Definition of a new version of networks of evolutionary processors. A uniform and linear time solution to the 3-colorability problem. A non-uniform, linear size and time solution to the Common Algorithmic Problem which can be easily extended to a uniform solution.

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

network of polarized evolutionary processor


How progressive land titling could foster new surveying practices and land information systemsbased on case studies in Namibia Under the premise that land administration is one of the necessary components of sustainable development and better land management, this article reviews how progressive titling could foster new land administration procedures and associated information systems. This review is based on the objectives of progressive titling as they are developed or currently implemented in various regions in the world. These objectives include an upgradable regime of rights to land, and a step-wise system of land surveying. How such objectives affect or should affect land surveying practice and design and implementation of land information systems is highlighted. The article derives a number of proposals to adapt the structure and objectives of land surveying and land information systems in such a way that these support the objectives of land management and tenure security better.

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

progressive titling
land information systems
surveying


Reliability Analysis for a Data Flow in Event-Driven Wireless Sensor Networks For the purpose of designing more reliable networks, we extend the traditional reliability analysis from wired networks to wireless networks with imperfect components. This paper aims to study the reliability of a data flow in event-driven wireless sensor networks with acknowledgment-based transmission scheme. Initially, an event-driven wireless sensor network model is described in terms of limited node battery energy and shadowed fading channels. Then, in order to analyze the network reliability, wireless link reliability and node energy availability are investigated, respectively. Further the analytical expressions of the instantaneous network reliability and the mean time to failure are derived. Finally, the simulation results validate the correctness and accuracy of the analytical results.

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

reliability analysis
instantaneous network reliability


Fast and accurate edge-based segmentation with no contour smoothing in 2-D real images In this paper we propose an edge-based segmentation algorithm built on a new type of active contour which is fast, has a low computational complexity and does not introduce unwanted smoothing on the retrieved contours. The contours are always returned as closed chains of points, resulting in a very useful base for subsequent shape representation techniques.

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

active contours
edge extraction
two-dimensional image segmentation


The Trustworthiness Analyzing of Interacting Business Process Based on the Induction Information Under the open environments, it is very difficult to guarantee the trustworthiness of interacting business process using traditional software engineering methods, at the same time, for dealing with the influence of external factors, some proposed business process mining methods are only effective 1-bounded business process, and some behavior dependent relationships are ignore. A behavior trustworthiness analysis method of business process based on induction information is presented in the paper. Firstly, aimed to the internal factors, we analyze the consistent behavior relativity to guarantee the predictable function. Then, for the external factors, in order to analyze the behavior change of business process, we propose a process mining methods based on induction information. Finally, experiment simulation is given out, and compares our method with genetic process mining methods. Theoretical analysis and experimental results indicate that our method is better than the genetic process mining method.

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

trustworthiness
consistent behavior relativity
business process
process mining


The QoSbox: Quantitative service differentiation in BSD routers We describe the design and implementation of the QoSbox, a configurable IP router that provides per-hop service differentiation on loss, delays and throughput to classes of traffic. The novel aspects of the QoSbox are that (1) the QoSbox does not rely on any external component (e.g., no traffic shaping and no admission control) to provide the desired service differentiation, but instead, (2) dynamically adapts packet forwarding and dropping decisions as a function of the instantaneous traffic arrivals and allows for temporary relaxation of some service objectives; also, (3) the QoSbox can enforce both absolute and proportional service differentiation on queuing delays, loss rates, and throughput at the same time. We focus on a publicly available implementation of the QoSbox in BSD-based PC-routers. We evaluate our implementation in a testbed of BSD routers over a FastEthernet network, and we sketch how the QoSbox can be implemented in high speed architectures. (c) 2006 Elsevier B.V. All rights reserved.

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

quality-of-service implementations
pc-routers
high-speed networks


determining the user intent of web search engine queries Determining the user intent of Web searches is a difficult problem due to the sparse data available concerning the searcher. In this paper, we examine a method to determine the user intent underlying Web search engine queries. We qualitatively analyze samples of queries from seven transaction logs from three different Web search engines containing more than five million queries. From this analysis, we identified characteristics of user queries based on three broad classifications of user intent. The classifications of informational, navigational, and transactional represent the type of content destination the searcher desired as expressed by their query. We implemented our classification algorithm and automatically classified a separate Web search engine transaction log of over a million queries submitted by several hundred thousand users. Our findings show that more than 80\% of Web queries are informational in nature, with about 10\% each being navigational and transactional. In order to validate the accuracy of our algorithm, we manually coded 400 queries and compared the classification to the results from our algorithm. This comparison showed that our automatic classification has an accuracy of 74\%. Of the remaining 25\% of the queries, the user intent is generally vague or multi-faceted, pointing to the need to for probabilistic classification. We illustrate how knowledge of searcher intent might be used to enhance future Web search engines.

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


Impressions of computer and human agents after interaction: Computer identity weakens power but not goodness impressions ? This study compares impressions of mediated humans and computer agents. Impressions of computer agents are weaker than for human agents. The weakening model explains previous research?s findings for goodness impressions. This model is tested with a 222 an organizational setting experiment. The weakening model is supported for power, but not for goodness impressions.

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

computer-mediated communication
organizations
valence
potency


A Framework for Binding and Retrieving Class-Specific Information to and from Image Patterns Using Correlation Filters We describe a template-based framework to bind class-specific information to a set of image patterns and retrieve that information by matching the template to a query pattern of the same class. This is done by mapping the class-specific information to a set of spatial translations which are applied to the set of image patterns from which a template is designed, taking advantage of the properties of correlation filters. The bound information is retrieved during matching with an authentic query by estimating the spatial translations applied to the images that were used to design the template. In this paper, we focus on the problem of binding information to biometric signatures as an application of our framework. Our framework is flexible enough to allow spreading the information to be bound over multiple pattern classes which, in the context of biometric key-binding, enables multiclass and multimodal biometric key-binding. We demonstrate the effectiveness of the proposed scheme via extensive numerical results on multiple biometric databases.

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

biometric security
biometric key-binding
face recognition
palmprint recognition


Application of adaptive neuro-fuzzy inference system for solubility prediction of carbon dioxide in polymers Solubility of carbon dioxide in poly(vinyl acetate) (PVAc), poly(2,6-dimethyl-1,4-phenylene ether) (PPO), polypropylene (PP), and high-density polyethylene (HDPE), poly(butylene succinate) (PBS), poly(butylene succinate-co-adipate) (PBSA) and polystyrene (PS) are modeled by adaptive neuro-fuzzy inference system (ANFIS) in wide range of pressure and temperature. The results obtained in this work indicate that ANFIS is effective method for prediction of solubility of carbon dioxide in polymers and have better accuracy and simplicity compared with the classical methods. (C) 2008 Elsevier Ltd. All rights reserved.

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

polymer
artificial neural network
adaptive neuro-fuzzy inference system


Supporting risks in software project management Complex software development is a risky job. The number of unsuccessful projects surpasses the number of successful developments, particularly when large projects are analyzed. This paper describes an approach to develop, retrieve, and reuse management knowledge and experience concerned with software development risks. Scenarios are used to model risk impact and resolution strategies efficacy within risk archetypes. A risk archetype is an information structure that holds knowledge about software development risks. A risk management process organizes the use of risk archetypes within an application development effort. The process resembles a reuse process framework, where two sub-processes are respectively responsible for identifying and reusing risk information. Simulating the impact of the expected risks can support some of the decisions throughout the software development process. The contribution of this paper is to show how risk archetypes and scenario models can represent reusable project management knowledge. An observational analysis of applying such an approach in an industrial environment and a feasibility study are also described.

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

risk analysis
knowledge reuse and management
empirical studies


Rotation map with a controlling segment: Basic analysis and application to A/D converters This paper studies the rotation map with a controlling segment. As a parameter varies, the map exhibits superstable periodic orbits, chaos and rich bifurcation phenomena. The map is applicable to an A/D converter having efficient resolution characteristics. The converter can be realized as a circuit model based on a spiking neuron and the rate-coding. Presenting a test circuit, basic operation is confirmed experimentally.

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

analog-to-digital converters
superstable periodic orbit