optimizing communication overlap for high-speed networks Modern networking hardware supports true non-blocking communicationand effective exploitation of this feature can lead to significantapplication performance improvements. We believe that algorithm design and optimization techniques that hide latency by taking advantage of communication overlap will facilitate obtaining good parallel efficiency and performance on the highly concurrent contemporary systems. Finding an optimal, performance portable implementation when using non-blocking communication primitives is non-trivial and intimidating to many application developers. In this paper we present a methodology for discovering optimal message sizes and schedules for a variety of application scenarios. This is achieved by combining an analytic model that takes into account the variability of performance parameters with system scale and load with heuristics designed to avoid network congestion. We perform experiments to understand network behavior in the presence of overlap and purge the optimization space for any system based on either resource or implementation constraints. Our approach isable to choose optimal or nearly optimal implementation parameters fora variety of highly non-trivial scenarios and networks with different performance characteristics. Implementations based on parameters chosen by the models are able to hide over 90\% of communicationoverhead in all cases.

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

latency hiding
logp
loggp
high-speed networks
performance model


Probabilistic control of chaos: Chaotic maps under control Recently, we have proposed a new probabilistic method for the control of chaotic systems [1]. In this paper, we apply our method to characteristic cases of chaotic maps (one-and two-dimensional examples). As these chaotic maps are structurally stable, they cannot be controlled using conventional control methods without significant change of the dynamics. Our method consists in the probabilistic coupling of the original system with a controlling system. This coupling can be understood as a feedback control. of probabilistic nature. The chosen periodic orbit of the original system is a global attractor for the probability densities. The generalized spectral decomposition of the associated Frobenius-Perron operator provides a spectral condition of controllability for chaotic dynamical systems.

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


A Distributed System for Consuming Web Services and Caching Their Responses in MANETs Due to the widespread use of different types of hand-held computing devices whose bandwidth, memory size, and processing capacity are becoming comparable to those of desktop computers, mobile ad hoc network (MANET) applications can now make use of proven distributed computing paradigms, in particular, Web services. Indeed, in MANET environments, mobile computing devices can invoke Web services methods to gain access to needed data, like stock quotes, currency exchange rates, etc. However, in addition to the communication costs, device mobility can cause temporary loss of connectivity to the server, thus rendering needed services inaccessible during those periods. For such reasons, caching of Web service responses within the MANET can become beneficial for increasing data availability and reducing delays. This paper describes a distributed system designed for MANET environments to cache proxies of consumed Web services and responses of their invoked methods. Furthermore, it analyzes the analytical and experimental performance of the system, and demonstrates the savings that could be realized after implementing it.

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

web services
caching
mobile ad hoc network


A note correcting the proof of a Lemma in a recent paper A nonoscillation criterion for a second-order linear difference equation is established correcting a result in [1]. (C) 2003 Elsevier Science Ltd. All rights reserved.

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


fast direction-aware proximity for graph mining In this paper we study asymmetric proximity measures on directed graphs, which quantify the relationships between two nodes or two groups of nodes. The measures are useful in several graph mining tasks, including clustering, link prediction and connection subgraph discovery. Our proximity measure is based on the conceptof escape probability . This way, we strive to summarize the multiple facets of nodes-proximity, while avoiding some of the pitfalls to which alternative proximity measures are susceptible. A unique feature of the measures is accounting for the underlying directional information. We put a special emphasis on computational efficiency, and develop fast solutions that are applicable in several settings. Our experimental study shows the usefulness of our proposed direction-aware proximity method for several applications, and that our algorithms achieve a significant speedup (up to 50,000x) over straight forward implementations.

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

proximity
speedup
applications
efficiency
forward
paper
relationships
method
link prediction
graph mining
feature
connection

measurement
use
computation
direct
account
group
informal
experimentation
implementation
summarization
directed graph
random walk
discoveries
algorithm
cluster


Learning function-free Horn expressions The problem of learning universally quantified function free first order Horn expressions is studied. Several models of learning from equivalence and membership queries are considered, including the model where interpretations are examples (Learning from Interpretations), the model where clauses are examples (Learning from Entailment), models where extensional or intentional background knowledge is given to the learner (as done in Inductive Logic Programming), and the model where the reasoning performance of the learner rather than identification is of interest (Learning to Reason). We present learning algorithms for all these tasks for the class of universally quantified function free Horn expressions. The algorithms are polynomial in the number of predicate symbols in the language and the number of clauses in the target Horn expression but exponential in the arity of predicates and the number of universally quantified variables. We also provide lower bounds for these tasks by way of characterising the VC-dimension of this class of expressions. The exponential dependence on the number of variables is the main gap between the lower and upper bounds.

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

inductive logic programming
horn expressions

computational learning theory
direct products


Multi-solid and multi-fluid diffuse interface model: Applications to dynamic fracture and fragmentation We extend the model of diffuse solidfluid interfaces developed earlier by authors of this paper to the case of arbitrary number of interacting hyperelastic solids. Plastic transformations of solids are taken into account through a Maxwell type model. The specific energy of each solid is given in separable form: it is the sum of a hydrodynamic part of the energy depending only on the density and the entropy, and an elastic part of the energy which is unaffected by the volume change. It allows us to naturally pass to the fluid description in the limit of vanishing shear modulus. In spite of a large number of governing equations, the model has a quite simple mathematical structure: it is a duplication of a single visco-elastic model. The model is well posed both mathematically and thermodynamically: it is hyperbolic and compatible with the second law of thermodynamics. The resulting model can be applied in the situations involving an arbitrary number of fluids and solids. In particular, we show the ability of the model to describe spallation and penetration phenomena occurring during high velocity impacts.

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

fluidsolid interaction
hyperbolicity
godunov type methods
hyperelasticity
visco-plasticity


FUZZY LINEAR PROGRAMMING FOR SUPPLY CHAIN PLANNING UNDER UNCERTAINTY A new fuzzy mathematical programming model for supply chain planning under supply, process and demand uncertainty is proposed in this paper. A tactical supply chain planning problem has been formulated as a fuzzy mixed integer linear programming model where data are ill-known and modeled by fuzzy numbers with modified s-curve membership functions. The fuzzy model provides alternative decision plans to the decision maker (DM) for different degrees of satisfaction. Finally, the proposed model is tested by using data from a real automobile supply chain.

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

fuzzy mathematical programming
supply chain planning


A computer package for the design of piles under cyclic tensile load The majority of studies on piles are directed towards their behaviour under compressive loads. There is very limited literature available on the behaviour of piles under cyclic tensile loads. With the development of tension leg platform (TLP) technology for deep offshore oil and gas fields, there is a growing interest in understanding the behaviour of TLP pile foundations, which are subjected to a static pull-out superimposed by a cyclic tensile force. To design a pile for cyclic tensile loading there is a need to estimate the safe cyclic tensile loads for a pile. This paper presents the details of a computer program developed to estimate the safe cyclic tensile load for a pile. In the program, factors such as load distribution along the pile length, mechanism of pile failure under cyclic loading and the critical cyclic stress level for soilpile interface have been considered. The details of the program have been presented in the form of an algorithm and flowchart. Using the program, an example problem has been solved and the safe cyclic load for a set of field piles has been estimated. With the help of this program a computer package is developed for the design of piles under cyclic tensile load. The details of this package are presented in the form of a flowchart and algorithm.

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

computer package
cyclic tensile loads
design of piles
tension leg platform


mining uncertain data for frequent itemsets that satisfy aggregate constraints Many existing algorithms mine transaction databases of precise data for frequent itemsets. However, there are situations in which the user is interested in only some tiny portions of all the frequent itemsets, and there are also situations in which data in the transaction databases are uncertain . This calls for both (i) constrained mining (for finding only those frequent itemsets that satisfy user constraints, which express the user interest) and (ii) mining uncertain data . In this paper, we propose a tree-based algorithm that effectively mines transaction databases of uncertain data for only those frequent itemsets satisfying the user-specified aggregate constraints. The algorithm avoids candidate generation and pushes the aggregate constraints inside the mining process, which reduces computation and avoids unnecessary constraint checking.

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

aggregate functions
frequent patterns
data mining
probabilistic databases


Fitting curves and surfaces with constrained implicit polynomials A problem which often arises while fitting implicit polynomials to 2D and 3D data sets is the following: Although the data set is simple, the fit exhibits undesired phenomena, such as loops, holes, extraneous components, etc. Previous work tackled these problems by optimizing heuristic cost functions, which penalize some of these topological problems in the fit. This paper suggests a different approach-to design parameterized families of polynomials whose zero-sets are guaranteed to satisfy certain topological properties. Namely, we construct families of polynomials with star-shaped zero-sets, as well as polynomials whose zero-sets are guaranteed not to intersect an ellipse circumscribing the data or to be entirely contained in such an ellipse. This is more rigorous than using heuristics which may fail and result in pathological zero-sets. The ability to parameterize these families depends heavily on the ability to parameterize positive polynomials. To achieve this, we use some powerful recent results from real algebraic geometry.

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

implicit polynomials
fitting
positive polynomials

free-form shapes
topological integrity
starshaped curves and surfaces


Couplet alignment and improved electrofusion by dielectrophoresis for a zona-free high-throughput cloned embryo production system Mammalian cloning by somatic nuclear transfer has great potential for developing medical applications such as biopharmaceuticals and generation of tissues for transplantation. For agricultural applications, it allows the rapid dissemination of genetic gain in livestock breeding. The maximisation of that potential requires improvements to overall cloning technology, especially with respect to increasing cloning efficiency and throughput rates in cloned embryo production. A zona-free embryo reconstruction system was developed to increase cloning throughput and ease of operation. Central to this system is a modified electrofusion procedure for nuclear transfer. Cytoplast-donor cell couplets were placed in a custom-designed 'parallel plate' electrode chamber. A 1 MHz sinusoidal AC dielectrophoresis alignment electric field of 6-10 kV m(-1) was applied for 5-10 s. The couplets were then fused using 2 x 10 mus rectangular DC-field pulses (150-200 kV m-1), followed by application of the AC field (6-10 kV m-1) for another 5-10 s. Fusion was performed in hypoosmolar buffer (210 mOsm). Automated alignment of up to 20 couplets at a time has been achieved, resulting in greatly improved fusion throughput rates (2.5-fold increase) and improved fusion yields (1.3-fold increase), compared with commonly followed zona-intact protocols.

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

cloning
dielectrophoresis
electrofusion
nuclear transfer


On size-biased matrix-geometric distributions In this paper we consider size-biased discrete phase-type and matrix-geometric distributions, and we prove that their factorial moment distributions remain within their respective classes. We provide explicit representations of these factorial moment distributions.

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

discrete phase-type distribution
matrix-geometric distribution
size-biased distribution


Online scheduling of simple linear deteriorating jobs to minimize the total general completion time Traditional scheduling assumes that the processing time of a job is fixed. Yet there are numerous situations in which the processing time increases (deteriorates) as the start time increases. In particular, lots of work has been devoted to jobs with simple linear deterioration. The processing time p(j) of job J(j) is a simple linear function of its start time s(j), precisely, p(j) = b(j)s(j), where b(j) is the deteriorating rate. In this paper, we study the problem of online non-preemptive scheduling of jobs with arbitrary release times and simple linear deteriorating rates on a single machine to minimize the total general completion time. We present an algorithm DSDR (Delayed Smallest Deteriorating Rate) and prove that it achieves the best-possible competitive ratio (1 + b(max))(alpha) for all deterministic online algorithms, where a is the general index of completion time and alpha > 0. (C) 2013 Elsevier B.V. All rights reserved.

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

online scheduling
simple linear deterioration
total general completion time
single machine


The

endotracheal

tube

biases

the

estimates

of

pulmonary

recruitment

and

overdistension

To

assess

the

impact

of

the

endotracheal

tube

(ETT)

and

of

different

flow

waveforms

on

estimates

of

alveolar

cyclic

recruitment

(CR)

and

overdistension

(AO).

Numerical

simulation

of

the

respiratory

system

plus

ETT

(inertance

L

plus

a

flow-dependent

resistance,

K

and

K

with

the

following

non-linear

equation

of

motion

({\text{t}})

{\text{

}}{\left(

{\left(

{\left.

\cdot

\left|

{\left.

{\ifmmode\expandafter\dot\else\expandafter\.\fi{V}({\text{t}})}

\right|}

\right.}

\right)

\cdot

L

\cdot

\ifmmode\expandafter\ddot\else\expandafter\"\fi{V}({\text{t}})}

\right.}

\right)}

{\text{Rrs}}

\cdot

{\left(

\cdot

V({\text{t}})}

\right)}

\cdot

V({\text{t}})

$$(P

AW

pressure

at

the

airways

opening,

V

volume),

under

volume-controlled

mechanical

ventilation.

An

index

%E

T)/(E

T)

can

be

calculated

where

%E

represents

AO

and

%E

represents

CR.

Parameters

were

estimated

by

the

least-squares

method,

either

with

the

complete

equation

or

supressing

L,

K

or

both.

%E

is

always

underestimated

(down

to

percent

points)

with

incomplete

equations

of

motion.

The

estimation

of

%E

may

be

strongly

biased

in

the

presence

of

an

ETT

excluded

from

the

estimation

model.

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

respiratory mechanics
alveolar overdistension
tidal recruitment
model identification
non-linear models


emerging collective behavior in a simple artificial financial market We consider a simple model for a society of economic agents, where each can invest a discrete quantity. Interactions among agents happen in a neighborhood and depend on the motivation level (insider information, economy prospects, etc.). The profit of the group fluctuates stochastically and is used to update individual motivations. We analyze the behavior, as a function of time, of the global persistence, given the initial quantity of money invested. Our simulations show that this quantity -- a measure of the probability that the amount of money of the entire group remains at least equal to the initial amount -- has a power law updating behavior. We have also performed simulations with heterogeneous agents, including deceiver and conservative agents. We show that, although there is no regular pattern regarding the average wealth, robust power laws for persistence exist, indicating that this can be used to model the emerging collective behavior. Besides, the updating of motivation and the presence of conservatives and deceivers is remarkable and has an influence on the persistence.

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

multiagent systems
game theory
artificial stock market


towards topological consistency and similarity of multiresolution geographical maps Several application contexts require the ability to use together and compare different geographic datasets (maps) concerning the same or overlapping areas. This is for example the case of mediator systems, integrating distinct data sources for query processing, and GISs dealing with multi-resolution maps. In both cases, distinct maps may represent the same geographic feature with different geometry type (a road can be a region in one map and a line in another one). An important issue is therefore determining whether two multi-resolution maps are consistent, i.e., they represent the same area without contradictions, and, if not, if they are at least similar. In this paper we consider consistency and similarity of multi-resolution maps with respect to topological information. Existing approaches do not take feature geometry type into account. In this paper, we extend them with two notions of topological consistency, the first requiring the same topological relation between pairs of common features, the second `relaxing' the first one by considering similarity between topological relations. A similarity function for multi-resolution maps is then provided, taking into account both feature geometry types and topological relations of map objects. We finally discuss how the proposed consistency and similarity concepts can be significantly used in GIS applications. Some experimental results are also reported to show the effectiveness of the proposed approach.

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

consistency similarity gis multiresolution


Mining frequent itemsets over data streams using efficient window sliding techniques Online mining of frequent itemsets over a stream sliding window is one of the most important problems in stream data mining with broad applications. It is also a difficult issue since the streaming data possess some challenging characteristics, such as unknown or unbound size, possibly a very fast arrival rate, inability to backtrack over previously arrived transactions, and a lack of system control over the order in which the data arrive. In this paper, we propose an effective bit-sequence based, one-pass algorithm, called MFI-TransSW (Mining Frequent Itemsets within a Transaction-sensitive Sliding Window), to mine the set of frequent itemsets from data streams within a transaction-sensitive sliding window which consists of a fixed number of transactions. The proposed MFI-TransSW algorithm consists of three phases: window initialization, window sliding and pattern generation. First, every item of each transaction is encoded in an effective bit-sequence representation in the window initialization phase. The proposed bit-sequence representation of item is used to reduce the time and memory needed to slide the windows in the following phases. Second, MFI-TransSW uses the left bit-shift technique to slide the windows efficiently in the window sliding phase. Finally, the complete set of frequent itemsets within the current sliding window is generated by a level-wise method in the pattern generation phase. Experimental studies show that the proposed algorithm not only attain highly accurate mining results, but also run significant faster and consume less memory than do existing algorithms for mining frequent itemsets over data streams with a sliding window. Furthermore, based on the MFI-TransSW framework, an extended single-pass algorithm, called MFI-TimeSW (Mining Frequent Itemsets within a Time-sensitive Sliding Window) is presented to mine the set of frequent itemsets efficiently over time-sensitive sliding windows.

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

data mining
data streams
frequent itemsets
sliding windows

single-pass algorithms
bit-sequence representation


An introduction to alysidal algebra (I) Purpose - The purpose of this paper is to provide an introduction to alysidal algebra. Deontical impure systems are systems whose object set is formed by an s-impure set, whose elements are perceptuales significances (relative beings) of material and/or energetic objects (absolute beings) and whose relational set is freeways of relations, formed by sheaves of relations going in two-way directions. Objects and freeways form chains. Design/methodology/approach - The paper looks at the mathematical and logical development of human society structure. Findings - Existence of relations with positive imperative modality (obligation) would constitute the skeleton of the system. Negative imperative modality (prohibition) would be the immunological system of protection of the system. Modality permission the muscular system, that gives the necessary flexibility to the system, in as much to the modality faculty its neurocerebral system, because it allows him to make decisions. Transactions of energy, money, merchandise, population, etc. would be the equivalent one to the sanguineous system. These economic transactions and inferential relations, depend, as well, on the existence of a legislative body with their obligations, prohibitions and permissions that regulate them. Originality/value - The concepts of alysidal set are introduced, whose elements are chains and coupling function between alysidal sets. Environment is formed as well by different DIS. That is to say, by an alysidal set whose elements are simultaneously systems. Specific interchanges (stimulus-response) leave certain nodes and act on certain nodes of the alysidal sets (stimulus environment-DIS-response environment). The paper defines a special coupling function, denominated gnorpsic function, that can be used for algebraic operations between alysidal sets.

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

societal organization
freeway of relations
coupling functions
sheaf of relations
structural functions


JAC: declarative Java concurrency The Java programming language has a low-level concurrency model which is hard to use and does not blend well with inheritance. JAC is an extension of Java that introduces a higher level of concurrency, hiding threads and separating thread synchronization from application logic in a declarative fashion. The emphasis is on limiting the differences between sequential and concurrent code, thus furthering code reuse, and on avoiding inheritance anomalies. This is achieved by taking a middle road between concurrent code on the one hand and complete separation of sequential application logic from concurrency mechanisms on the other. An extensive comparison with related approaches is given for motivating our design decisions. Copyright (c) 2005 John Wiley & Sons, Ltd.

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

declarative concurrent programming
concurrency annotations


Obtaining Online Ecological Colourings by Generalizing First-Fit A colouring of a graph is ecological if every pair of vertices that have the same set of colours in their neighbourhood are coloured alike. We consider the following problem: if a graph G and an ecological colouring c of G are given, can further vertices added to G, one at a time, be coloured so that at each stage the current graph is ecologically coloured? If the answer is yes, then we say that the pair (G,c) is ecologically online extendible. By generalizing the well-known First-Fit algorithm, we are able to characterize when (G,c) is ecologically online extendible, and to show that deciding whether (G,c) is ecologically extendible can be done in polynomial time. We also describe when the extension is possible using only colours from a given finite setC.

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

graph colouring
graph homomorphisms
online algorithms


Speech Recognition under Multiple Noise Environment Based on Multi-Mixture HMM and Weight Optimization by the Aspect Model In this paper, we propose an acoustic model that is robust to multiple noise environments, as well as a method for adapting the acoustic model to an environment to improve the model. The model is called "the multi-mixture model," which is based on a mixture of different HMMs each of which is trained using speech under different noise conditions. Speech recognition experiments showed that the proposed model performs better than the conventional multi-condition model. The method for adaptation is based on the aspect model, which is a "mixture-of-mixture" model. To realize adaptation using extremely small amount of adaptation data (i.e., a few seconds), we train a small number of mixture models, which can be interpreted as models for "clusters" of noise environments. Then, the models are mixed using weights, which are determined according to the adaptation data. The experimental results showed that the adaptation based on the aspect model improved the word accuracy in a heavy noise environment and showed no performance deterioration for all noise conditions, while the conventional methods either did not improve the performance or showed both improvement and degradation of recognition performance according to noise conditions.

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

multi-mixture hmm
noise-independent acoustic model
speech recognition in noisy environment


Stability region of multicarrier channel aware aloha In this correspondence, we have studied the stability properties of multicarrier channel aware Aloha. For a simple two-user network, the stability region S-2 under the classical collision model has been wellstudied. In this correspondence, using multiple carriers, we show how to achieve any input rate vector in S-2 with 1-persistent Aloha. We then show how multicarrier diversity can be exploited to improve upon the existing stability region.

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


Test Strength: A Quality Metric for Transition Fault Tests in Full-Scan Circuits We define the strength of a test for transition faults based on the number of fault effects that can disappear without causing the test to lose the detection of target faults. The removal of fault effects represents the uncertainty created by pattern-dependent effects that can slow-down or speed-up signal-transitions, thus causing fault effects predicted by logic-level simulation to disappear. A test set that consists of higher-strength tests is less susceptible to these effects. We demonstrate that a transition fault test set with higher-strength tests also detects more path delay faults, which represent delay defects that were not targeted during test generation.

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

path delay faults
test generation
transition faults


executing association rule mining algorithms under a grid computing environment Grids are now regarded as promising platforms for data and computation-intensive applications like data mining. However, the exploration of such large-scale computing resources necessitates the development of new distributed algorithms. The major challenge facing the developers of distributed data mining algorithms is how to adjust the load imbalance that occurs during execution. This load imbalance is due to the dynamic nature of data mining algorithms (i.e. we cannot predict the load before execution) and the heterogeneity of Grid computing systems. In this paper, we propose a dynamic load balancing strategy for distributed association rule mining algorithms under a Grid computing environment. We evaluate the performance of the proposed strategy by the use of Grid'5000. A Grid infrastructure distributed in nine sites around France, for research in large-scale parallel and distributed systems.

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

association rules
apriori algorithm
parallel association rule mining
work migration


Isotropic finite-differences New finite-differences, called isotropic finite-differences, where the lowest order error terms are without any directional bias, are proposed. An accurate simulation of 6-fold symmetric dendritic solidification is presented using a numerical scheme based on these finite-differences.

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

directional bias
dendritic solidification


Algorithms for maximum weight induced paths A family of graphs is a k-bounded-hole family if every graph in the family has no holes with more than k vertices. The problem of finding in a graph a maximum weight induced path has applications in large communication and neural networks when worst case communication time needs to be evaluated; unfortunately this problem is NP-hard even when restricted to bipartite graphs. We show that this problem has polynomial time algorithms for k-bounded-hole families of graphs, for interval-filament graphs and for graphs decomposable by clique cut-sets or by splits into prime subgraphs for which such algorithms exist. (C) 2002 Elsevier Science B.V. All rights reserved.

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

longest induced path
interval-filament graph
split decomposition
graph algorithms


Prior knowledge and preferential structures in gradient descent learning algorithms A family of gradient descent algorithms for learning linear functions in an online setting is considered. The family includes the classical LMS algorithm as well as new variants such as the Exponentiated Gradient (EG) algorithm due to Kivinen and Warmuth. The algorithms are based on prior distributions defined on the weight space. Techniques from differential geometry are used to develop the algorithms as gradient descent iterations with respect to the natural gradient in the Riemannian structure induced by the prior distribution. The proposed framework subsumes the notion of "link-functions".

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

exponentiated gradient algorithm
link-functions
riemannian metric


Automated support specification for efficient mining of interesting association rules In recent years, the weakness of the canonical support-confidence framework for associations mining has been widely studied. One of the difficulties in applying association rules mining is the setting of support constraints. A high-support constraint avoids the combinatorial explosion in discovering frequent itemsets, but at the expense of missing interesting patterns of low support. Instead of seeking a way to set the appropriate support constraints, all current approaches leave the users in charge of the support setting, which, however, puts the users in a dilemma. This paper is an effort to answer this long-standing open question. According to the notion of confidence and lift measures, we propose an automatic support specification for efficiently mining high-confidence and positive-lift associations without consulting the users. Experimental results show that the proposed method is not only good at discovering high-confidence and positive-lift associations, but also effective in reducing spurious frequent itemsets.

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


Foxa1 and Foxa2 Interact with the Androgen Receptor to Regulate Prostate and Epididymal Genes Differentially Abstract: Previous studies from our group have shown that Foxa1 is expressed in the prostate and interacts with the androgen receptor (AR) to regulate prostate-specific genes such as prostate-specific antigen (PSA) and probasin (PB). We report here that Foxa2 but not Foxa1 is expressed in the epididymis. Further, Foxa2 interacts with the AR to regulate the mouse epididymal retinoic acid binding protein (mE-RABP) gene, an epididymis-specific gene. Binding of Foxa2 to the mE-RABP promoter was confirmed by gel-shift and chromatin immunoprecipitation (ChIP) assays. Overexpression of Foxa2 suppresses androgen activation of the mE-RABP promoter while overexpression of Foxa2 with prostate-specific promoters activates gene expression in an androgen-independent manner. GST pull-down assays determined that both Foxa1 and Foxa2 physically interact with the DNA binding domain of the AR. The interaction between Foxa proteins and AR was further confirmed by gel-shift assays where Foxa protein was recruited to AR binding oligomers even when Foxa binding sites were not present, and AR was recruited to Foxa binding oligomers even in the absence of an AR binding site. Given that Foxa1 and Foxa2 proteins are expressed differentially in the prostate and epididymis, these data suggest that the Foxa proteins have distinct effects on AR-regulated genes in different male reproductive accessory organs.

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

epididymis
prostate
foxa
androgen receptor


Statistical analysis of TCP's retransmission timeout algorithm The retransmission timeout (RTO) algorithm of Transmission Control Protocol (TCP), which sets a dynamic upper bound on the next round-trip time (RTT) based on past RTTs, plays an important role in reliable data transfer and congestion control of the Internet. A rigorous theoretical analysis of the RTO algorithm is important in that it provides insight into the algorithm and prompts optimal design strategies. Nevertheless, such an analysis has not been conducted to date. This paper presents such an analysis from a statistical approach. We construct an auto-regressive (AR) model for the RTT processes based on experimental results that indicate: 1) RTTs along a certain path in the Internet can be modeled by a shifted Gamma distribution and 2) the temporal correlation of RTTs decreases quickly with lag. This model is used to determine the average reaction time and premature timeout probability for the RTO algorithm. We derive a closed-form expression for the first measure and a formula for numerically calculating the second. Both measures are validated through tests on simulated and real RTT data. The theoretical analysis strengthens a number of observations reported in past experiment-oriented studies.

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

auto-regressive models
lognormal distribution
retransmission timeout (rto)
round-trip time (rtt)


third annual collaborative editing workshop Collaborative editing systems support groups of people editing a document together over the computer network. People may work simultaneously on the same document, simultaneously on different copies of the document, or at different times on the original or copied document. The document types include text, diagrams, more complicated graphic objects, images, CAD drawings, multimedia, etc.. Collaborative editing research addresses many fundamental and challenging issues facing the designers of real-time groupware systems in general.

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

operations transformation
consistency maintenance


Phase transitions in model colloids in reduced geometry The nature of the melting transition for a system of hard disks with translational degrees of freedom in two spatial dimensions has been analyzed by a novel finite size scaling technique. The behavior of the system is consistent with the predictions of the KTHNY theory. Hard and soft disks in external periodic potentials show rich phase diagrams including freezing and melting transitions when the density of the system is varied. Here we report on extensive Monte Carlo simulations for detailed finite size scaling analyses of various thermodynamic quantities like the order parameter, its cumulants, etc. in order to map the phase diagram of the system for various values of the density and the amplitude of the external potential. For hard disks we find clear indication of a re-entrant liquid phase over a significant region of the parameter space. Our simulations therefore show that the system of hard disks behaves in a fashion similar to charge stabilized colloids which are known to undergo an initial freezing, followed by a re-melting transition as the amplitude of the imposed, modulating field produced by crossed laser beams is steadily increased. Detailed analysis of our data shows several features consistent with a recent dislocation unbinding theory of laser induced melting. The differences and similarities of systems with soft potentials (DLVO, 1/r(12)) is discussed. (C) 2002 IMACS. Published by Elsevier Science B.V. All rights reserved.

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

hard disks
colloids
finite size scaling
melting


Keyword clustering for user interest profiling refinement within paper recommender systems To refine user interest profiling, this paper focuses on extending scientific subject ontology via keyword clustering and on improving the accuracy and effectiveness of recommendation of the electronic academic publications in online services. A clustering approach is proposed for domain keywords for the purpose of the subject ontology extension. Based on the keyword clusters, the construction of user interest profiles is presented on a rather fine granularity level. In the construction of user interest profiles, we apply two types of interest profiles: explicit profiles and implicit profiles. The explicit profiles are obtained by relating users interest-topic relevance factors to users interest measurements of these topics computed by a conventional ontology-based method, and the implicit profiles are acquired on the basis of the correlative relationships among the topic nodes in topic network graphs. Three experiments are conducted which reveal that the uses of the subject ontology extension approach as well as the two types of interest profiles satisfyingly contribute to an improvement in the accuracy of recommendation.

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

keyword clustering
user interest profiles
recommender systems
ontology extension


A metamodeling approach for pattern specification and management The formal specification of design patterns is central to pattern research and is the foundation of solving various pattern-related problems. In this paper, we propose a metamodeling approach for pattern specification, in which a pattern is modeled as a meta-level class and its participants are meta-level references. Instead of defining a new metamodel, we reuse the Unified Modeling Language (UML) metamodel and incorporate the concepts of Variable and Set into our approach, which are unavailable in the UML but essential for pattern specification. Our approach provides straightforward solutions for pattern-related problems, such as pattern instantiation, evolution, and implementation. By integrating the solutions into a single framework, we can construct a pattern management system, in which patterns can be instantiated, evolved, and implemented in a correct and manageable way.

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

design patterns
metamodeling
pattern management system


A fuzzy temporal notation and its application to specify fault patterns for diagnosis Many systems collect vast amounts of data over time, which is used to perform critical tasks like diagnosis, surveillance, resource management, planning and forecasting. To effectively use the historical data for these purposes, it is important to analyze the data and to gain insight into its significant aspects, by identifying the presence and characteristics of specific patterns. We describe a fuzzy logical notation, enhanced with facilities for expressing approximate temporal patterns, to build compositional and abstract models of syntactic structure of patterns. We present an algorithm, which detects where and how strongly the given pattern (i.e., a formula) is present. The approach is illustrated by specifying and detecting fault patterns for trace-based diagnosis of dynamic systems.

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

temporal logic
fuzzy logic
trace-based diagnosis


Rough implication operator based on strong topological rough algebras The role of topological De Morgan algebra in the theory of rough sets is investigated. The rough implication operator is introduced in strong topological rough algebra that is a generalization of classical rough algebra and a topological De Morgan algebra. Several related issues are discussed. First, the two application directions of topological De Morgan algebras in rough set theory are described, a uniform algebraic depiction of various rough set models are given. Secondly, based on interior and closure operators of a strong topological rough algebra, an implication operator (called rough implication) is introduced, and its important properties are proved. Thirdly, a rough set interpretation of classical logic is analyzed, and a new semantic interpretation of ?ukasiewicz continuous-valued logic system ?uk is constructed based on rough implication. Finally, strong topological rough implication algebra (STRI-algebra for short) is introduced. The connections among STRI-algebras, regular double Stone algebras and RSL-algebras are established, and the completeness theorem of rough logic system RSL is discussed based on STRI-algebras.

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

rough implication
topological de morgan algebra
strong topological rough algebra
rough logic system rsl


Design of an Energy-Efficient Asynchronous NoC and Its Optimization Tools for Heterogeneous SoCs The energy usage of on-chip interconnects is a concern for many system-on-chips targeting portable battery-powered devices. We have designed and evaluated a network-on-chip (NoC) for such an application, including tools to optimize for power and communication latency. Our asynchronous (clockless) network operates with efficient two-phase bundled-data links and four-phase routers. The topology and router floorplan is determined by our tool, ANetGen, which optimizes the network for energy and latency using simulated annealing and force-directed placement methods. We compare our solutions against a traditional synchronous NoC as specified by the COSI-2.0 framework and ORION 2.0 router and wire energy models. Traffic is simulated with SystemC functional models, and messages are generated with a "bursty" self-similar b-model. Results indicate our asynchronous network was more energy-efficient, lower in area, and provided comparable or superior message latency.

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

application-specific
asynchronous design
embedded
gals
low-power
network-on-chip
system-on-chip


Russell's Structuralism and the Supposed Death of Computational Cognitive Science John Searle believes that computational properties are purely formal and that consequently, computational properties are not intrinsic, empirically discoverable, nor causal; and therefore, that an entity's having certain computational properties could not be sufficient for its having certain mental properties. To make his case, Searle's employs an argument that had been used before him by Max Newman, against Russell's structuralism; one that Russell himself considered fatal to his own position. This paper formulates a not-so-explored version of Searle's problem with computational cognitive science, and refutes it by suggesting how our understanding of computation is far from implying the structuralism Searle vitally attributes to it. On the way, I formulate and argue for a thesis that strengthens Newman's case against Russell's structuralism, and thus raises the apparent risk for computational cognitive science too.

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

computation structuralism searle russell


A network hierarchical feedback system for Taiwanese universities based on the integration of total quality management and innovation An increasing number of Taiwanese universities are improving operational performance through innovation and total quality management (TQM). In addition, the National Quality Award (NQA), which is based on TQM, is now used to evaluate quality performance in various industries in Taiwan. Thus, several models for performance measurement have been proposed in recent years. However, these models do not take into account several features germane to performance within the Taiwanese university system, such as characteristics unique to the integration of TQM and innovation, comprehensive focuses in operational performance improvement across different types of universities, and interrelations among the different variables used to measure performance. Thus, precisely measuring and improving operation performance has proven to be a difficult task. The aim of this paper is to construct a network hierarchical feedback system (NHFS) based on the integration of TQM and innovation to overcome these problems. To that end, we adopted a decision-making trial and evaluation laboratory (DEMATEL) method to address the complex, interdependent relationships among the variables and thereby construct a relation structure among the measurement criteria for evaluation purposes. A fuzzy analytic network process (FANP) is employed to overcome the problem of dependence and feedback among each of the TQM measurement criteria. A fuzzy analytic hierarchical process (FAHP) is used to evaluate the measurement criteria for innovation performance. Lastly, a gray relational analysis (GRA) is utilized to find optimal alternatives. The value of this study comes from providing all types of universities in Taiwan the most complete evaluation system of operational performance, as well as opportunities to realize improved competitive advantages and enhanced prospects for survival.

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

fuzzy analytical hierarchical process (fahp)

decision-making trial and evaluation laboratory (dematel)

network hierarchical feedback system (nhfs)


Tailored spreading symbols in Strobe Correlators using W2-pulses A Strobe Correlator is a correlation-based multipath mitigation technique that utilizes tailored reference waveform to shape the discriminator function for tracking Global Navigation Satellite System (e.g. Global Positioning System) signals. Multipath performance of these techniques for Binary Phase Shift Keying (BPSK) signals has been discussed for decades but for some, their noise performance may not be easily evaluated analytically. In this paper, a theoretical framework is provided for noise evaluation of Strobe Correlators using complex strobes for both BPSK and sine-phased Binary Offset Carrier (e.g. BOC(1,1)) signals. Mathematical expressions of the tailored spreading symbols as key factors are derived and used for theoretical code tracking variance analysis of various correlation techniques including the Gating Function using a complex strobe-pulse liked waveform (i.e. W2-pulses). Empirical results for the sine-phased BOC(1,1) signal are given as verification. Analytical results reveal that the techniques using a W2-pulse suffer from higher code tracking variance than others, due to increased sensitivity to noise. The sensitivity to pre-correlation bandwidth is found to relate to the relative placement of the strobe pulses.

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

strobe
binary offset carrier
gating
code tracking variance


Dextrous Manipulation from a Grasping Pose This paper introduces an optimization-based approach to synthesizing hand manipulations from a starting grasping pose. We describe an automatic method that takes as input an initial grasping pose and partial object trajectory, and produces as output physically plausible hand animation that effects the desired manipulation. In response to different dynamic situations during manipulation, our algorithm can generate a range of possible hand manipulations including changes in joint configurations, changes in contact points, and changes in the grasping force. Formulating hand manipulation as an optimization problem is key to our algorithm's ability to generate a large repertoire of hand motions from limited user input. We introduce an objective function that accentuates the detailed hand motion and contacts adjustment. Furthermore, we describe an optimization method that solves for hand motion and contacts efficiently while taking into account long-term planning of contact forces. Our algorithm does not require any tuning of parameters, nor does it require any prescribed hand motion sequences.

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

character animation
physics-based animation


crystSim: A software environment for modelling industrial batch cooling crystallization Crystallization modelling is limited by the availability of methods to reliably predict mixing, temperature and concentration distributions, supersaturation, nucleation and growth kinetics for crystallization systems of industrial size. A new software environment for modelling batch cooling crystallization has been developed integrating crystallization and fluid dynamics. The mathematical model can reliably predict mixing in stirred vessels of a given geometry and its effect on the crystallization kinetics and crystal product properties thus reducing the cost and time required for the design and scale-up of industrial crystallizers. The paper describes the development and application of crystSim for modelling industrial crystallization in stirred tanks. The software is developed in Visual C# making full use of Object Oriented Programming (OOP) and multithreading. (C) 2011 Elsevier Ltd. All rights reserved.

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

crystallization modelling
mixing
multithreading

software package
computational fluid dynamics (cfd)
object oriented programming (oop)


A Rough Set Approach to Information Systems Decomposition The aim of this paper is to present the methods and algorithms of information systems decomposition. In the paper, decomposition with respect to reducts and the so-called global decomposition are considered. Moreover, coverings of information systems by components are discussed. An essential difference between two kinds of decomposition can be observed. In general, global decomposition can deliver more components of a given information system. This fact can be treated as some kind of additional knowledge about the system. The proposed approach is based on rough set theory. To demonstrate the usefulness of this approach, we present an illustrative example coming from the economy domain. The discussed decomposition methods can be applied e. g. for design and analysis of concurrent systems specified by information systems, for automatic feature extraction, as well as for control design of systems represented by experimental data tables.

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

information analysis
knowledge representation
machine learning
reduct
rough sets


RDA: Resource description & accessa survey of the current state of the art Resource Description & Access (RDA) is intended to provide a flexible and extensible framework that can accommodate all types of content and media within rapidly evolving digital environments while also maintaining compatibility with the Anglo-American Cataloguing Rules, 2nd edition (AACR2). The cataloging community is grappling with practical issues in navigating the transition from AACR2 to RDA; there is a definite need to evaluate major subject areas and broader themes in information organization under the new RDA paradigm. This article aims to accomplish this task through a thorough and critical review of the emerging RDA literature published from 2005 to 2011. The review mostly concerns key areas of difference between RDA and AACR2, the relationship of the new cataloging code to metadata standards, the impact on encoding standards such as Machine-Readable Cataloging (MARC), end user considerations, and practitioners' views on RDA implementation and training. Future research will require more in-depth studies of RDA's expected benefits and the manner in which the new cataloging code will improve resource retrieval and bibliographic control for users and catalogers alike over AACR2. The question as to how the cataloging community can best move forward to the post-AACR2/MARC environment must be addressed carefully so as to chart the future of bibliographic control in the evolving environment of information production, management, and use.

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

organization of information
information discovery
content management


hybrid latch flip-flop with improved power efficiency An improved design of a hybrid latch flip-flop is presented. The proposed design overcomes the problem of the glitch at the output and reduces the power consumption and delay of the circuit resulting in a total power-delay-product improvement of about 20\%. It also exhibits better soft-clock edge properties compared to the original circuit. This is accomplished by careful design of keeper elements and introducing the feedback path to suppress unnecessary transitions in the circuit. The new design introduces an insignificant area increase.

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

feedback path
keeper elements
power consumption
design
power efficiency
hybrid

flip-flops
circuit feedback
product
delay reduction
hybrid latch flip-flop
delays
transit
clock
low-power electronics
power
feedback
power-delay-product improvement
precharge technique
logic design
power consumption reduction
power efficiency improvement
soft-clock edge properties
circuits


ROLE OF TRUST IN ADOPTION OF ONLINE AUTO INSURANCE While online automobile insurance business is growing rapidly, systematic and focused studies lack behind significantly. This empirical study assesses the relationships among web-service quality, trust, and purchase intention. The results suggest that web-service quality has a significant impact on customer trust, which in turn significantly impact the customer's intention to purchase auto insurance online. This study provides useful guidelines for online auto insurers contemplating differentiated marketing strategies based on web-system quality, information quality, and various trust factors such as product trust, service trust, and company trust. Furthermore, this exploratory study makes a contribution to the research community by providing a theoretical framework for future studies on e-commerce in general and online auto insurance in particular.

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

online auto insurance
trust
purchase intention


LMI criteria on exponential stability of BAM neural networks with both time-varying delays and general activation functions In this paper, the exponential stability analysis for the bidirectional associative memory neural network model with both time-varying delays and general activation functions is considered. Neither the boundedness and the monotony on these activation functions nor the differentiability on the time-varying delays are assumed. By employing Lyapunov functional and the linear matrix inequality (LMI) approach, several new sufficient conditions in LMI form are obtained to ensure the existence, uniqueness and global exponential stability of equilibrium point for the neural networks. Moreover, the exponential convergence rate index is estimated, which depends on the system parameters. The proposed stability results are less conservative than some recently known ones in the literature, which is demonstrated via an example with simulation. (C) 2010 IMACS. Published by Elsevier B.V. All rights reserved.

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

bam neural networks
exponential stability
linear matrix inequality


Understanding the roles of business ecosystems in large public IT infrastructure project development: The case of M-Taipei This case study examines how publicprivate business ecosystems play a critical role in pubic IT infrastructure project development. In studying the world's foremost wireless cyber city, the M-Taipei project, we argue that the symbiotic nature of relationships in business ecosystems is of critical importance in conducting the public IT project. Based on the case data, we differentiate three forms of business ecosystems knowledge-oriented, resource-oriented, and business-oriented which emerged in the different phases of project development. We hope to provide a foundation for future discussions on this increasingly important view of research and practice.

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

publicprivate partnership
business ecosystem
outsourcing


recipe to lab management or the cookie cutter approach to building labs The ingredients in establishing and maintaining computer labs include determining the purpose and function of the lab; hardware and software needs; and infrastructure support. This paper outlines an approach to provide a recipe in establishing and maintaining labs. This approach attempts to lessen the guesswork and allows the lab manager to make more precise determinations when allocating resources.I have been managing computer labs for several years at Oklahoma State University and have developed a cookie cutter approach to implementing and managing computer lab facilities. This approach has simplified the process by defining the key ingredients needed whether it's implementing a new facility or just upgrading an existing one.The three basic ingredients necessary to deliver satisfying results are budget, labor, and materials. Short-term and long-term costs and expenses for execution and continual maintenance of the facility characterize budget. Expenses are equipment rollover, training of the support team, consumables, software updates, etc.Labor is defined both internally and externally. The internal labor support needs to be formed without duplicating the external labor support. For example, there is no need to have a server manager on the internal support team if the current infrastructure already has one in place. By utilizing the already existing server management, costs for a duplicate server manager can be reduced.Last, materials for the facility are outlined both internally and externally. Materials needed internally include hardware, software, furnishings, and supplies. The external materials include network and servers. Again the purpose here is to eliminate any redundant service. For example, the LAN systems team manages the lab servers for us. I don't need to hire a server manager.

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


Computational Challenges in Deciphering Genomic Structures of Bacteria This article addresses how the functionalities of the cellular machinery of a bacterium might have constrained the genomic arrangement of its genes during evolution and how we can study such problems using computational approaches, taking full advantage of the rapidly increasing pool of the sequenced bacterial genomes, potentially leading to a much improved understanding of why a bacterial genome is organized in the way it is. This article discusses a number of challenging computational problems in elucidating the genomic structures at multiple levels and the information that is encoded through these genomic structures, gearing towards the ultimate understanding of the governing rules of bacterial genome organization.

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

bioinformatics
microbial genomics
genome structure
comparative genome analysis
biological pathways


Integrated row and column rerouting for reconfiguration of VLSI Arrays with four-port switches This paper deals with the issue of developing efficient algorithms for reconfiguring two-dimensional VLSI arrays linked by four-port switches in the presence of faulty processing elements (PEs). The proposed algorithm reroutes the arrays with faults in both row and column directions at the same time. Unlike previous work, the compensation technique to replace the faulty PE is not restricted to the adjacent rows of the excluded row. Instead, we consider the neighbor rows of any faulty PE for compensation purposes. The nonfaulty PEs lying in the excluded rows are also effectively utilized to form the maximal target arrays, making the proposed algorithm more efficient in terms of both the percentages of harvest and the degradation of VLSI arrays for random and clustered faults. Empirical study shows that the improvement in harvest increases with increasing fault size and is more notable for maximal square target arrays than for maximal target arrays. Our investigations show that the improvement can be up to 8 percent and 23 percent for a 256 x 256 VLSI array with random faults of size 25 percent for maximal target arrays and for maximal square target arrays, respectively.

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

degradable vlsi array
fault tolerance
routing


Interworking wireless mesh networks: Problems, performance characterization, and perspectives Wireless broadband networks based on the IEEE 802.11 technology are being increasingly deployed as mesh networks to provide users with extended coverage for wireless Internet access. These wireless mesh networks, however, may be deployed by different authorities without any coordination a priori, and hence it is possible that they overlap partially or even entirely in service area, resulting in contention of radio resources among them. In this paper, we investigate the artifacts that result from the uncoordinated deployment of wireless mesh networks. We use a network optimization approach to model the problem as resource sharing among nodes belonging to one or different networks. Based on the proposed LP formulation, we then conduct simulations to characterize the performance of overlaying wireless mesh networks, with the goal to provide perspectives for addressing the problems. We find that in a system with multiple overlaying wireless mesh networks, if no form of inter-domain coordination is present, individual mesh networks could suffer from capacity degradation due to increased network contention. One solution toward addressing the performance degradation is to "interwork" these wireless mesh networks by allowing inter-domain traffic relay through provisioning of "bridge" nodes. However, if such bridge nodes are chosen arbitrarily, the problems of throughput sub-optimality and unfairness may arise. We profile the impact of bridge node selection and show the importance in controlling network unfairness for wireless mesh network interworking. We conclude that mesh network interworking is a promising direction to address the artifacts due to uncoordinated deployment of wireless mesh networks if it is supplemented with appropriate mechanisms. (c) 2007 Elsevier Inc. All rights reserved.

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

mesh network bridging
ieee 802.11a/b/g
capacity characterization
linear programming


design pattern concerns for software evolution Most design patterns help to make systems flexible and extensible. They have potential effects to support evolutionary software development. Ordinary implementation of design patterns, however, is not always enough for evolution. It is based on the inheritance mechanism. This makes application classes quite dependent on patterns and reduces reusability of application classes. In addition, it is difficult to exchange patterns once a system is designed. In this paper, we introduce a way to implement design patterns more flexibly, applying the concept of separation of concerns. It is realized by separating design patterns, as explicit concerns, from the application core that is responsible for the primary functionalities. The new implementation technologies that support the advanced separation of concerns such as Hyper/J help with coding this kind of design. Using an example, we show that it is possible to exchange patterns to support different behavior without any change on the application core. Our approach has an advantage that reusability of both design patterns and the application core is improved.

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

software evolution
design pattern
advanced separation of concerns


Memory efficient hybrid algebraic solvers for linear systems arising from compressible flows This paper deals with the solution of sparse linear systems arising from design optimization in computational fluid dynamics. In this approach, a linearization of the discretized compressible Navier-Stokes equations is built, in order to evaluate the sensitivity of the entire flow with respect to each design parameter. This requires an efficient and robust parallel linear solver, to generate the exact flow derivatives: from the algebraic decomposition of the input matrix, a hybrid robust direct/iterative solver is generally defined with a Krylov subspace method as accelerator, a domain decomposition method as preconditioner and a direct method as subdomain solver. The goal of this paper is to reduce the memory requirements and indirectly, the computational cost at different steps of this scheme. To this end, we use a grid-point induced block approach for the data storage and the partitioning part, a Krylov subspace method based on the restarted GMRES accelerated by deflation, a preconditioner formulated with the restricted additive Schwarz method and an aerodynamic/turbulent fields split at the subdomain level. Numerical results are presented with industrial test cases to show the benefits of these choices. (C) 2012 Elsevier Ltd. All rights reserved.

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

restricted additive schwarz preconditioner


Influence of the size of syncytial units on synaptic potentials in smooth muscle The effect of the size of syncytial bundles of cells on the passive synaptic potentials generated within them has been explored. Computer simulations have been performed of neuronally produced spontaneous excitatory junction potentials (SEJPs) generated in a cubical 'bidomain' model of syncytial tissue. It is found that indical properties of SEJPs vary conspicuously in syncytium sizes smaller than about 15-17-cube, but change very little in syncytium sizes greater than this. At the centroid of the cube, the peak amplitude V(p) of the SEJP declines from 14.32 mV to 11.70 mV as syncytium size increases from 7-cube to 15-cube, i.e. a decrease of similar to 18%, while between system sires 15-cube (V(p) = 11.70 mV) and 29-cube (V(p) = 11.67 mV), the reduction is only similar to 0.3%. Similar trends are observed for the rime to peak of SEJPs. These observations indicate a minimum bundle size in smooth muscle below which syncytial function is modified; the implications of this are discussed.

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

smooth muscle
synaptic potentials
bidomain model
syncytium


Understanding anti-plagiarism software adoption: An extended protection motivation theory perspective This study investigates factors affecting the adoption of anti-plagiarism software. Using protection motivation theory as a basis, this research examines the influence of threat and coping appraisals, along with social influences, moral obligation, and actual control variables, on the adoption of anti-plagiarism software. A field survey of 218 faculty members working at U.S. public universities reveals that threat appraisals have a stronger influence on the adoption of anti-plagiarism software than do coping appraisals. The faculty members' moral obligation, academic rank, class size, percentage of creative assignments, and gender significantly affect software adoption, whereas social influence does not. Key implications for theory and practice are discussed.

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

internet plagiarism
anti-plagiarism software
partial least squares


Implementation of time-dependent density functional response equations Time-dependent density functional theory provides a first principles method for the calculation of frequency-dependent polarizabilities, hyperpolarizabilities, excitation energies and many related response properties. In recent years, the molecular results obtained by several groups have shown that this approach is in general more accurate than the time-dependent Hartree-Fock approach, and is often competitive in accuracy with computationally more demanding conventional ab initio approaches. In this paper, our implementation of the relevant equations in the Amsterdam Density Functional program is described. We will focus on certain aspects of the implementation which are necessary for an efficient evaluation of the desired properties, enabling the treatment of large molecules. Such an efficient implementation is obtained by: using the full symmetry of the molecule, using a set of auxiliary functions for fitting the (zeroth- and first-order) electron density, using a highly vectorized and parallelized code, using linear scaling techniques, and, most importantly, by solving the response equations iteratively. (C) 1999 Elsevier Science B.V.

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

optical response properties of molecules


The COMPASS off-line system COMPASS is a new fixed target high rate experiment at CERN. The expected RAW data size is in the order of 300 TB per year, collected during about six months of data taking at the mean rate of 35 MB/s. To fulfill the experiment requirements. the Collaboration decided to build the off-line system using new technologies. The computing power needed for RAW data processing has been estimated to be in the order of 2000 SPECint95, and will be provided by a farm of about 200 CPUs. The reconstruction program is under development and is written using object-oriented techniques and C++ as the programming language. In the present model, all the experimental and reconstructed data will be stored in an object database management system. (C) 2001 Elsevier Science B.V. All rights reserved.

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

off-line computing system
object oriented
object data base


Storage QoS provisioning for execution programming of data-intensive applications In this paper a method for execution programming of data-intensive applications is presented. The method is based on storage Quality of Service (SQoS) provisioning. SQoS provisioning uses the semantic based storage monitoring based on a storage resources model and a storage performance management. Test results show the gain for the execution time when using the QStorMan toolkit which implements the presented method. Taking into account the SQoS provisioning opportunity on the one hand, and the increasingly growing user demands on the other hand, we believe that the execution programming of data-intensive applications can bring a new quality into the application execution.

O O O O O O 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 O O O O O O O O O O O O O O O O O O O O O O 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 application
distributed environment
storage management
grid


Adaptive and reliable paging to remote main memory Workstation clusters provide significant aggregate amounts of resources, including processing power and main memory. In this paper we explore the collective use of main memory in a workstation cluster to boost the performance of applications that require more memory than a single workstation can provide. We describe the design, simulation, implementation, and evaluation of a pager that uses main memory of remote workstations in a workstation cluster as a faster-than-disk paging device and provides reliability in case of single workstation failures and adaptivity in network and disk load variations. Our pager has been implemented as a block device driver linked to the Digital UNIX operating system, without any modifications to the kernel code. Using several test applications we measure the performance of remote memory paging over an Ethernet interconnection network and find it to be up to twice as fast as traditional disk paging. We also evaluate the performance of various reliability policies and demonstrate their feasibility even over low bandwith networks such as Ethernet. We conclude that the benefits of reliable remote memory paging in workstation clusters are significant today and are likely to increase in the near future. (C) 1999 Academic Press.

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


Modelling and simulation of an automatic grinding system using a hand grinder A grinding process model for an automatic grinding system with grinding force control is developed in this paper. This grinding system utilises an electric hand grinder, driven by a CNC machine centre and a force sensor for force measurement. This model includes compliance of the grinding system and is initially represented by a series of springs. The stiffness of each component is estimated in this study and it is found that the model may be simplified into a single spring-mass system. A corresponding PID controller is designed for the purpose of grinding force control, which calculates the appropriate CNC spindle displacement according to the force measured by the force sensor. Computer simulation results show that the system settling time is less than 0.25s.

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

applications grinding
grinding system simulation


accurate estimation of cache-related preemption delay Multitasked real-time systems often employ caches to boost performance. However the unpredictable dynamic behavior of caches makes schedulability analysis of such systems difficult. In particular, the effect of caches needs to be considered for estimating the inter-task interference. As the memory blocks of different tasks can map to the same cache blocks, preemption of a task may introduce additional cache misses. The time penalty introduced by these misses is called the Cache-Related Preemption Delay (CRPD).In this paper, we provide a program path analysis technique to estimate CRPD. Our technique performs path analysis of both the preempted and the preempting tasks. Furthermore, we improve the accuracy of the analysis by estimating the possible states of the entire cache at each possible preemption point rather than estimating the states of each cache block independently. To avoid incurring high space requirements, the cache states can be maintained symbolically as a Binary Decision Diagram. Experimental results indicate that we obtain tight CRPD estimates for realistic benchmarks.

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


Function call optimization for efficient behavioral synthesis Behavioral synthesis, which automatically synthesizes an RTL circuit from a sequential program, is one of promising technologies to improve the design productivity. This paper proposes a function call optimization method in behavioral synthesis from large sequential programs with a number of functions. We formulate the optimization problem using integer linear programming. Our experimental results show the reduction in the circuit area by up to 44.6%, compared with a traditional method.

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

function calls
integer programming problem


A THEORY OF FUZZY MEASURES - INTEGRATION AND ITS ADDITIVITY Fuzzy measures and their corresponding Choquet integrals introduced by Murofushi and Sugeno [1989, 1991] are included in the theory of pre-measures and the corresponding integral developed by Sipos [1979a, 1979b]. The additivity of Sipos integral is studied. As a corollary, the additivity of the Choquet integral is obtained.

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


Memory based active contour algorithm using pixel-level classified images for colon crypt segmentation Improve classification accuracy using two-step pixel-level classification. Memory based active contour that is robust to pixel-level classification errors. Test 7180 crypts: 87% and 9% true and false positives, 96% segmentation accuracy. We believe this method is general and can be applied on glandular biopsies.

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


Federated queries of clinical data repositories: Scaling to a national network Small regional federated data networks are used today for clinical research. National data networks with 100+ hospitals are being built. A conceptual framework was developed for evaluating networks of different sizes. A real four site network was compared to an imagined 4000 site network. Large networks have limitations but can take advantage of their heterogeneity.

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

algorithms
hospital shared services
medical record linkage
medical records systems computerized
search engine


Particle simulation and flow sequence on drainage of liquid particles The emptying efficiency/depletion ratio firstly proposed by Hanin (1999) [7] has proven analytically that tanks with cross-sectional area expressed in the form of a higher-order polynomial of the liquid head (denoted as higher-order tank in this paper) are effective in reducing the efflux time. In this study, a Lagrangian particle method (moving particle semi-implicit (MPS) method) is used to simulate the draining process of water particles in tanks of various geometries (n n -order tank), mainly to improve the physical understanding on why higher-order tanks are more effective in draining water particles. Analytically, it is shown that the reduction in efflux time is associated with the decrease of J J -factor introduced in this paper. It can be proven that there exists a theoretical minimum of the J J -factor (hence the efflux time) as the order (n n ) approaches infinity. In cases where the deformation of the free surface is mild while draining, the predicted time evolution of the water head agrees quite well with that of Torricellis law. Generally, the simulated averaged discharge coefficient increases with the order of the shape function used to describe the cross-sectional area of the tank, which may explain the effectiveness of higher-order tanks. From the Lagrangian particle simulation, the use of the flow sequence technique has revealed that water particles with identical range of drainage time form an inverted U-band (draining layer ) in lower-order tanks. Interestingly, as the order (n n ) increases, flattening of such draining layers is observed and this has led to a reduction of efflux time of water particles especially for those near the side-walls.

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

efflux time
particle method
torricellis law

moving particle semi-implicit (mps) method