Energy-Efficient MAC Protocol for U-Agriculture Based on Link Quality The sensor network application in the agricultural growth monitoring field is being tried by various methods. The biggest characteristics of the growth monitoring are that its data sensing cycle is very long, and if it is installed once, its position change almost doesn't occur, and it should be operated for a long period. Accordingly, the MAC Protocol satisfying these properties is necessary. The proposed MAC Protocol writes a node list of a transmission range, and uses minimum transmit power measured in case of transmit/receive by measuring minimum transmit power that can transmit/receive according to each node in the synchronization process. This research compares energy consumption of MAC and SMAC & PSMAC with network viability proposed through mathematical analysis and simulation experiments.

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

u-agriculture
wsn
power control
energy efficient
lqi


MULTI-ATTRIBUTE DECISION MAKING BASED ON LABEL SEMANTICS We propose label semantics as an integrated representation framework for probabilistic uncertainty and fuzziness in multiple-attribute decision making problems. Linguistic attribute hierarchies are then introduced as a means of modelling the complex and often imprecise functional relationships between low-level attributes or measurements and high-level decision or classification variables. Within this framework we introduce linguistic decision trees as a tool for information aggregation in multi-attribute decision problems and describe the process of information propagation through a hierarchy of linked decision trees. In addition,we consider the ranking of different alternatives or examples based on their linguistic descriptions of a high-level utility variable. Finally, we discuss how linguistic decision trees embedded in attribute hierarchies can be learnt from data.

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

appropriateness measures
mass assignment
attribute hierarchy


accuracy in dead-reckoning based distributed multi-player games Distributed multi-player games use dead reckoning vectors to intimate other (at a distance) participating players about the movement of any entity by a controlling player. The dead reckoning vector contains the current position of the entity and the velocity components. When a participating player receives a vector, traditionally it puts the entity at the current position specified by the vector and starts projecting the path of the entity from that point using the local clock of the receiver. In this paper we show that this traditional method of usage of dead reckoning vector brings in inaccuracy in the receivers' rendering of the entity. This inaccuracy can be substantial even with low network delay between the sender-receiver pairs and increases with network delay. We propose the use of globally synchronized clocks among the participating players and a time-stamp augmented dead reckoning vector that enables the receiver to render the entity accurately. We modified the popular game BZFlag with this technique, and compared the accuracy seen in game playing using the traditional method and the proposed technique. We conducted several types of experiments varying the frequency of generation of dead reckoning vectors and the delay between the sender and the receivers. The experiments show significant quantitative improvement in accuracy even for 100ms delay between the sender-receiver pairs and appreciable qualitative improvement in game playing experience.

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

clock synchronization
dead-reckoning
distributed multi-player games


Estimation of parameters based on artificial neural networks and threshold of HIV/AIDS epidemic system in Cuba In this paper, a method of parameter estimation, based upon Hopfield neural networks, is applied to the identification of a model of the HIV/AIDS epidemic in Cuba. This estimation technique presents a number of features that make it especially suitable for the identification of such epidemic models. In particular, its remarkable ability to estimate time variant parameters allows us to outline the evolution of parameters, thus assessing the efficiency of health policies. A complementary aim is the validation of the model, which stems from basic concepts and reasoning in disease modelling rather than from specific physical laws, thus it is not supported by rigorous mathematical results. Indeed, the experimental results show a significant adjustment of simulated data to actual ones, which provides considerable support to model validity. A sequence of real data, corresponding to the HIV and AIDS affected populations in Cuba from 1986 to 2004, has been compared to both simulations of the epidemic model and used to test the estimation method. A detection threshold, which plays a similar role to the basic reproduction number, has been calculated to complement the information about the current situation of the epidemic and the possible evolution perspectives. The obtained results are plausible and coherent according to health experts. (C) 2013 Elsevier Ltd. All rights reserved.

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

dynamical systems
systems identification


Unbalanced digit sets and the closest choice strategy for minimal weight integer representations An algorithm is presented that produces an optimal radix-2 representation of an input integer n using digits from the set D(l,u) = {a is an element of Z : l = 1. The algorithm works by scanning the digits of the binary representation of n from left-to-right (i.e., from most-significant to least-significant); further, the algorithm is of the online variety in that it needs to scan only a bounded number of input digits before giving an output digit (i.e., the algorithm produces output before scanning the entire input). The output representation is optimal in the sense that, of all radix-2 representations of n with digits from D(l,u), it has as few nonzero digits as possible (i.e., it has minimal weight). Such representations are useful in the efficient implementation of elliptic curve cryptography. The strategy the algorithm utilizes is to choose an integer of the form d2(i), where d is an element of D(l,u), that is closest to n with respect to a particular distance function. It is possible to choose values of l and u so that the set D(l,u) is unbalanced in the sense that it contains more negative digits than positive digits, or more positive digits than negative digits. Our distance function takes the possible unbalanced nature of D(l,u) into account.

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

elliptic curve cryptography
efficient implementation


The

IFC-based

path

planning

for

indoor

spaces

Path

planning

is

a

fundamental

problem,

especially

for

various

AEC

applications,

such

as

architectural

design,

indoor

and

outdoor

navigation,

and

emergency

evacuation.

However,

the

conventional

approaches

mainly

operate

path

planning

on

drawings

or

building

layouts

by

simply

considering

geometric

information,

while

losing

abundant

semantic

information

of

building

components.

To

address

this

issue,

this

paper

introduces

a

new

method

to

cope

with

path

planning

for

indoor

space

through

an

IFC

(Industry

Foundation

Classes)

file

as

input.

As

a

major

data

exchange

standard

for

Building

Information

Modeling

(BIM),

the

IFC

standard

is

capable

of

restoring

both

geometric

information

and

rich

semantic

information

of

building

components

to

support

lifecycle

data

sharing.

The

method

consists

of

three

main

steps:

extracting

both

geometric

and

semantic

information

of

building

components

defined

within

the

IFC

file,

discretizing

and

mapping

the

extracted

information

into

a

planar

grid,

and

finally

finding

the

shortest

path

based

on

the

mapping

for

path

planning

using

Fast

Marching

Method.

The

paper

aims

to

process

different

kinds

of

building

components

and

their

corresponding

properties

to

obtain

rich

semantic

information

that

can

enhance

applications

of

path

planning.

In

addition,

the

IFC-based

distributed

data

sharing

and

management

is

implemented

for

path

planning.

The

paper

also

presents

some

experiments

to

demonstrate

the

accuracy,

efficiency

and

adaptability

of

the

method.

Video

demonstration

is

available

from

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

industry foundation classes (ifc)
fast marching method (fmm)


Keep definition, change category A practical approach to state-based system calculi Faced with the need to quantify software (un)reliability in the presence of faults, the semantics of state-based systems is urged to evolve towards quantified (e.g. probabilistic) nondeterminism. When one is approaching such semantics from a categorical perspective, this inevitably calls for some technical elaboration, in a monadic setting. This paper proposes that such an evolution be undertaken without sacrificing the simplicity of the original (qualitative) definitions, by keeping quantification implicit rather than explicit. The approach is a monad lifting strategy whereby, under some conditions, definitions can be preserved provided the semantics moves to another category. The technique is illustrated by showing how to introduce probabilism in an existing software component calculus, by moving to a suitable category of matrices and using linear algebra in the reasoning. The paper also addresses the problem of preserving monadic strength in the move from original to target (Kleisli) categories, a topic which bears relationship to recent studies in categorial physics.

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

mealy automata
kleisli category
relation algebra
software calculi


Reduced-Dimension Multiuser Detection We present a reduced-dimension multiuser detector (RD-MUD) structure for synchronous systems that significantly decreases the number of required correlation branches at the receiver front end, while still achieving performance similar to that of the conventional matched-filter (MF) bank. RD-MUD exploits the fact that, in some wireless systems, the number of active users may be small relative to the total number of users in the system. Hence, the ideas of analog compressed sensing may be used to reduce the number of correlators. The correlating signals used by each correlator are chosen as an appropriate linear combination of the users' spreading waveforms. We derive the probability of symbol error when using two methods for recovery of active users and their transmitted symbols: the reduced-dimension decorrelating (RDD) detector, which combines subspace projection and thresholding to determine active users and sign detection for data recovery, and the reduced-dimension decision-feedback (RDDF) detector, which combines decision-feedback matching pursuit for active user detection and sign detection for data recovery. We derive probability of error bounds for both detectors, and show that the number of correlators needed to achieve a small probability of symbol error is on the order of the logarithm of the number of users in the system. The theoretical performance results are validated via numerical simulations.

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


On the pseudoachromatic index of the complete graph Let q = 2? be, for some ???, and let n = q2 + q+ 1. By exhibiting a complete coloring of the edges of Kn, we show that the pseudoachromatic number ?(Gn) of the complete line graph Gn = L(Kn)or the pseudoachromatic index of Kn, if you willis at least q3 + q. This bound improves the implicit bound of Jamison [Discrete Math 74 (1989), 99115] which is given in terms of the achromatic number: ?(Gn)??(Gn)?q3 + 1. We also calculate, precisely, the pseudoachromatic number when q+ 1 extra points are added:

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


Prediction suffix trees for supervised classification of sequences This paper presents a statistical test and algorithms for patterns extraction and supervised classification of sequential data. First it defines the notion of prediction suffix tree (PST). This type of tree can be used to efficiently describe variable order chain. It performs better than the Markov chain of order L and at a lower storage cost. We propose an improvement of this model, based on a statistical test. This test enables us to control the risk of encountering different patterns in the model of the sequence to classify and in the model of its class. Applications to biological sequences are presented to illustrate this procedure. We compare the results obtained with different models (Markov chain of order L, Variable order model and the statistical test, with or without smoothing). We set out to show how the choice of the parameters of the models influences performance in these applications. Obviously these algorithms can be used in other fields in which the data are naturally ordered.

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

prediction suffix tree
patterns extraction
supervised classification
variable order chain

markov model
chronobiological and dna sequences


MEANS - MIT extensible air network simulation In this article, the authors describe a model of the U.S. air transportation network in which air traffic service provider and airline decision making, the impacts of weather on airport capacity and decision making, the effects of stochastic phenomenon, and the movement of aircraft, crews, and passengers are simulated. The details of the underlying discrete event simulation framework and the constituent modules are presented, along with examples of the results that may be 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O

airline and air traffic control decision-making


Systems for strategic learning An important decision support system component is machine learning/data mining. Classical machine learning methods implicitly assume that attributes of instances under classification do not change to acquire a positive classification. However, in many situations these instances represent people or organizations that can proactively seek to alter their characteristics to gain a positive classification. We argue that the learning mechanism should take this possible strategic learning into consideration during the induction process. We call this strategic learning. In this paper we define this concept, summarize related research, and present a number of future research areas.

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

discriminant analysis
principalagent
strategic gaming
data mining


federated identity management for protecting users from id theft Federated identity management is sometimes criticized as exacerbating the problem of online identity theft, based as it is on the idea of connecting together previously separate islands of identity information. This paper explores this conjecture, and argues that, while such linkages do undeniably increase the potential scope of a successful theft of identity information, this risk is more than offset by the much greater value federated identity, in combination with strong authentication, offers in preventing such theft in the first place.

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


Parameter estimation of harmonic polluting industrial loads This paper develops a methodology for the estimation of relevant parameters characterizing harmonic polluting industrial loads through a set of measurements acquired at the point of common coupling. The proposed method is capable of obtaining an accurate load model in absence of detailed information about its internal structure and composition.

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

harmonics
power quality
state estimation


module generation of complex macros for logic-emulation applications Logic emulation is a technique that uses dynamically reprogrammable systems for prototyping and design verification. Using an emulator, designers can realize designs through a software configuration process and perform real-time design verification before fabricating the chip into silicon. However, converting designs into an emulator involves the use of multi-phase design tasks, which is a very time-consuming process. Hence, shortening the Time-To-Emulation (TTE) is always the main concern for the logic-emulation design process. One approach t o shorten the design processing time is to replace portions of the design with macro cells. This paper presents a module generator for logic-emulation applications, which is able to generate macro cells of arbitrarily complex functions described in High-level Descriptive Languages the (HDLs), Furthermore, the module generator can effectively generate a multiple-FPGA macro for large macros which can not fit in a single FPGA chip. Experiments using the module generator for logic emulation are reported. The results demonstrate that the module generator can effectively and efficiently generate complex macros from their Register-Transfer-Level (RTL) description. In addition, the results also show that the design processing time is significantly shortened when the module generation method is incorporated into the logic-emulation design flow.

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

fit applications generation use design paper emulation software method systems macros verification module flow process demonstrate logic

experience
timing
real-time
design process
prototype
language
configurability
complexity


A tool for producing structured interoperable data from product features on the web A tool producing structured data from product features on the web is introduced. This is the first Protg plug-in that extracts product features from web pages. Extracting information from complex-data intensive web sites is partially handled. The user creates a template manually using a domain-specific language. The output is GoodRelations snippets containing product features in RDFa/ Microdata.

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

information extraction
web scraping
ontology
rich snippets


Optimization, conditioning and accuracy of radial basis function method for partial differential equations with nonlocal boundary conditionsA case of two-dimensional Poisson equation Various real-world processes usually can be described by mathematical models consisted of partial differential equations (PDEs) with nonlocal boundary conditions. Therefore, interest in developing computational methods for the solution of such nonclassical differential problems has been growing fast. We use a meshless method based on radial basis functions (RBF) collocation technique for the solution of two-dimensional Poisson equation with nonlocal boundary conditions. The main attention is paid to the influence of nonlocal conditions on the optimal choice of the RBF shape parameters as well as their influence on the conditioning and accuracy of the method. The results of numerical study are presented and discussed.

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

poisson equation
meshless method
radial basis function
collocation

nonlocal boundary condition
shape parameter
condition number


NIMFA - Natural language Implicit Meaning Formalization and Abstraction There are many general purpose Knowledge Representation, Natural Language Processing and Information Extraction techniques that were successfully applied in many applications. However, their more broad use is still limited by the relatively high costs of their application. It seems that these limitations are partly caused by some essential characteristics and some weaknesses of these techniques. In this paper we propose a radically new knowledge representation and interpretation technique, NIMFA, specialized for knowledge expressed in natural languages. To test the basic ideas underlying NIMFA we have implemented a prototype Information Center that provides answers to natural language queries using Web services. (C) 2010 Elsevier Ltd. All rights reserved.

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

knowledge representation
natural language processing
information extraction
web services


Robust neuro-fuzzy sensor-based motion control among dynamic obstacles for robot manipulators A new robust neuro-fuzzy controller for autonomous and intelligent robot manipulators in dynamic and partially known environments containing moving obstacles is presented. The navigation is based on a fuzzy technique for the idea of artificial potential fields (APFs) using analytic harmonic functions. Unlike the fuzzy technique, the development of APFs is computationally intensive. A computationally efficient processing scheme for fuzzy navigation to reasoning about obstacle avoidance using APF is described, namely, the intelligent dynamic motion planning. An integration of a robust controller and a modified Elman neural networks (MENNs) approximation-based computed-torque controller is proposed to deal with unmodeled bounded disturbances and/or unstructured unmodeled dynamics of the robot arm. The MENN weights are tuned on-line, with no off-line learning phase required. The stability of the overall closed-loop system, composed by the nonlinear robot dynamics and the robust neuro-fuzzy controller, is guaranteed by the Lyapunov theory. The purpose of the robust neuro-fuzzy controller is to generate the commands for the servo-systems of the robot so it may choose its way to its goal autonomously, while reacting in real-time to unexpected events. The proposed scheme has been successfully tested. The controller also demonstrates remarkable performance in adaptation to changes in manipulator dynamics. Sensor-based motion control is an essential feature for dealing with model uncertainties and unexpected obstacles in real-time world systems.

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

intelligent dynamic motion planning (idmp)


Using virtual platform in embedded system education This article presents our cost-effective curriculum on embedded systems. Education on embedded systems requires coverage of both hardware and software aspects of the systems. Our curriculum uses one monolithic environment, virtual platform, to introduce all the layers of the system components (i.e., from hardware to operating systems to user applications). It is cost-effective since a hardware system is replaced by a virtual platform. Correspondingly, hardware boards and a lab space are not required. Yet, students are able to make modifications easily on hardware and software components of interest, fully exercising the system. Students responded to the course survey that they are knowledgeable on how embedded systems work after taking the course. Especially, students responded that the virtual platform is effective to use, in place of a hardware platform to learn embedded systems. The course materials are available to the public from a website at Korea University. 2009 Wiley Periodicals, Inc. Comput Appl Eng Educ 20: 346355, 2012

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

embedded systems
virtual platform
curriculum
education


Using structural contexts to compress semistructured text collections ? ?? We describe a compression model for semistructured documents, called Structural Contexts Model (SCM), which takes advantage of the context information usually implicit in the structure of the text. The idea is to use a separate model to compress the text that lies inside each different structure type (e.g., different XML tag). The intuition behind SCM is that the distribution of all the texts that belong to a given structure type should be similar, and different from that of other structure types. We mainly focus on semistatic models, and test our idea using a word-based Huffman method. This is the standard for compressing large natural language text databases, because random access, partial decompression, and direct search of the compressed collection is possible. This variant, dubbed SCMHuff, retains those features and improves Huffmans compression ratios. We consider the possibility that storing separate models may not pay off if the distribution of different structure types is not different enough, and present a heuristic to merge models with the aim of minimizing the total size of the compressed database. This gives an additional improvement over the plain technique. The comparison against existing prototypes shows that, among the methods that permit random access to the collection, SCMHuff achieves the best compression ratios, 24% better than the closest alternative. From a purely compression-aimed perspective, we combine SCM with PPM modeling. A separate PPM model is used to compress the text that lies inside each different structure type. The result, SCMPPM, does not permit random access nor direct search in the compressed text, but it gives 25% better compression ratios than other techniques for texts longer than 5MB.

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

text compression
compressed text databases


New X.509-based mechanisms for fair anonymity management We extend the X.509 infrastructure to support anonymity and unlinkability revocation. The additional functionality is included by means of OCSP and CRL extensions. Also, a new protocol, Anonymous Certificate Fairness Protocol (ACFP) is proposed. ACFP provides an X.509-like mechanism to convey evidence proving a misbehavior. The work includes experimental measures obtained through a prototype of our proposal.

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

privacy enhancing technologies
pets
privacy-by-design


a hypercube novelty model for comparing e-commerce and m-commerce E-commerce innovating applications have posed novel, technical, organizational and commercial challenges. In this paper we use a hypercube model for systematic assessment of these innovative challenges and focuses on their impacts on the E-commerce companies and their co-opetitors (providers, customers, and complementors). The results indicate that mobile commerce (M-commerce) differs substantially from Web-based commerce in some technological components, yet both share common business model. From Web-based commerce to M-commerce, novelty is modular for providers, architectural for customers and Ecommerce companies, but a disruptive change for complementors. Based on the analysis, the critical impacts of M-commerce novelty on the stakeholders are identified. From these findings, six research propositions are stated.

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


Localized classification The main problem with localized discriminant techniques is the curse of dimensionality, which seems to restrict their use to the case of few variables. However, if localization is combined with a reduction of dimension the initial number of variables is less restricted. In particular it is shown that localization yields powerful classifiers even in higher dimensions if localization is combined with locally adaptive selection of predictors. A robust localized logistic regression ( LLR) method is developed for which all tuning parameters are chosen data- adaptively. In an extended simulation study we evaluate the potential of the proposed procedure for various types of data and compare it to other classification procedures. In addition we demonstrate that automatic choice of localization, predictor selection and penalty parameters based on cross validation is working well. Finally the method is applied to real data sets and its real world performance is compared to alternative procedures.

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

local logistic regression
discrimination
data adaptive tuning parameters
localized discrimination


Learning Communicating Automata from MSCs This paper is concerned with bridging the gap between requirements and distributed systems. Requirements are defined as basic message sequence charts (MSCs) specifying positive and negative scenarios. Communicating finite-state machines (CFMs), i.e., finite automata that communicate via FIFO buffers, act as system realizations. The key contribution is a generalization of Angluin's learning algorithm for synthesizing CFMs from MSCs. This approach is exact - the resulting CFM precisely accepts the set of positive scenarios and rejects all negative ones - and yields fully asynchronous implementations. The paper investigates for which classes of MSC languages CFMs can be learned, presents an optimization technique for learning partial orders, and provides substantial empirical evidence indicating the practical feasibility of the approach.

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

theory of computation/computation by abstract devices/models of computation/automata


MAXIMUM COVERAGE METHOD FOR FEATURE SUBSET SELECTION FOR NEURAL NETWORK TRAINING Every real object having certain properties can be described by a number of descriptors, visual or other, e.g. mechanical, chemical etc. A set of descriptors (features) characterizing a given object is described in the paper by a vector of descriptors, where each entry of the vector determines a value of some feature of the object. In general, it is important to describe the object as completely as possible, which means by a large number of descriptors. This paper deals with a problem of selection of a proper subset of descriptors, which have the most substantial influence on the properties of the object, so that irrelevant descriptors could be excluded. For this purpose, we introduce a new method, Maximum Coverage Method (MCM). This method has been combined with optimization by a classical genetic algorithm. The described method is used for a data pre-processing, with the resulting selected features serving as an input for a neural network.

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

cluster significant shift prediction correctness eliminating separation


Formation of compounds and Kirkendall vacancy in the CuSn system The Kirkendall effect provides the lower limit of the void formation in the Cu/Sn. A criterion for the maximum vacancy concentration in the Cu/Sn system was developed. The fraction of Kirkendall vacancy was calculated by an analytical diffusion model. Kirkendall voids were experimentally observed using Cu/Sn diffusion couples. The simulation result satisfactorily reproduces the experiment.

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

cusn system
kirkendall voids
analytical diffusion model

intermetallic compound
diffusion coefficient


clustered subset selection and its applications on it service metrics Motivated by the enormous amounts of data collected in a large IT service provider organization, this paper presents a method for quickly and automatically summarizing and extracting meaningful insights from the data. Termed Clustered Subset Selection (CSS), our method enables program-guided data explorations of high-dimensional data matrices. CSS combines clustering and subset selection into a coherent and intuitive method for data analysis. In addition to a general framework, we introduce a family of CSS algorithms with different clustering components such as k-means and Close-to-Rank-One (CRO) clustering, and Subset Selection components such as best rank-one approximation and Rank-Revealing QR (RRQR) decomposition. From an empirical perspective, we illustrate that CSS is achieving significant improvements over existing Subset Selection methods in terms of approximation errors. Compared to existing Subset Selection techniques, CSS is also able to provide additional insight about clusters and cluster representatives. Finally, we present a case-study of program-guided data explorations using CSS on a large amount of IT service delivery data collection.

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

service delivery
service provider
subset selection
clustering


Scaling the MOSFET gate dielectric: From high-k to higher-k? (Invited Paper) We discuss options for metaloxide-semiconductor field-effect transistor (MOSFET) gate stack scaling with thin titanium nitride metal gate electrodes and high-permittivity (high-k) gate dielectrics, aimed at gate-first integration schemes. Both options are based on further increasing permittivity of the dielectric stack. First, we show that hafnium-based stacks such as TiN/HfO2 can be scaled to capacitance equivalent thickness in inversion (Tinv) of 10 and equivalent oxide thickness (EOT) of 6 by using silicon nitride instead of silicon oxide as a high-k/channel interfacial layer. This is based on the higher dielectric constant of Si3N4 and on its resistance to oxidation. Although the nitrogen introduces positive fixed charges, carrier mobility is not degraded. Secondly, we investigate whether Ti-based higher-k dielectrics have the potential to ultimately replace Hf. We discuss oxygen loss from TiO2 as a main challenge, and identify two migration pathways for such oxygen atoms: In addition to well-known down-diffusion and channel Si oxidation, we have newly observed oxygen up-diffusion through the TiN metal gate, forming SiO2 at the poly-Si contact. We further address the performance of Si3N4 and HfO2 as oxygen barrier layers.

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

field-effect transistors
hafnium oxide
titanium oxide
oxygen diffusion


Applying process monitoring with multivariate analysis through a knowledge-based systems approach to a paperboard machine The utility of multivariate statistical process control (MSPC) in the process industry can be further improved by applying knowledge-based systems (KBS) principles. First, the extensive volumes of process data generated in a production process can be pre-assessed by the KBS according to set rules. Second, the KBS can make a selection between various MSPC model alternatives. Third, the KBS may support the plant operators when evaluating the MSPC output results. This is shown in this preliminary study where a KBS was applied to an existing MSPC application on a paperboard machine. It is suggested that these experiences may also successfully be applied with other continuous processes in the manufacturing industry. (c) 2005 Published by Elsevier B.V.

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

multivariate data analysis
knowledge-based systems
decision-making support


A comparative study of empirical potential energy functions: Applications to silicon microclusters A comparative study has been performed for silicon microclusters, Si-3 and Si-4, considering fifteen different empirical potential energy functions. It has been found that only two of the empirical potential energy functions give linear structure more stable for Si-3, the remaining potential functions give triangular structure as more stable. In the case of Si-4 microclusters eight potential functions give open tetrahedral structure as more stable, two functions give perfect tetrahedral as more stable, three functions give square structure as more stable, and two functions give linear structure as more stable.

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

silicon microclusters
empirical potential energy functions


Univariate modeling and forecasting of monthly energy demand time series using abductive and neural networks Neural networks have been widely used for short-term, and to a lesser degree medium and long-term, demand forecasting. In the majority of cases for the latter two applications, multivariate modeling was adopted, where the demand time series is related to other weather, socio-economic and demographic time series. Disadvantages of this approach include the fact that influential exogenous factors are difficult to determine, and accurate data for them may not be readily available. This paper uses univariate modeling of the monthly demand time series based only on data for 6 years to forecast the demand for the seventh year. Both neural and abductive networks were used for modeling, and their performance was compared. A simple technique is described for removing the upward growth trend prior to modeling the demand time series to avoid problems associated with extrapolating beyond the data range used for training. Two modeling approaches were investigated and compared: iteratively using a single next-month forecaster, and employing 12 dedicate(] models to forecast the 12 individual months directly. Results indicate better performance by the first approach, with mean percentage error (MAPE) of the order of 3% for abductive networks. Performance is superior to naive forecasts based on persistence and seasonality, and is better than results quoted in the literature for several similar applications using multivariate abductive modeling, multiple regression, and univariate ARIMA analysis. Automatic selection of only the most relevant model inputs by the abductive learning algorithm provides better insight into the modeled process and allows constructing simpler neural network models with reduced data dimensionality and improved forecasting performance. (C) 2007 Elsevier Ltd. All rights reserved.

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

abductive networks
neural networks
energy demand

time series forecasting
medium-term load forecasting
univariate time series analysis


A computational study of cost reoptimization for min-cost flow problems In the last two decades, a number of algorithms for the linear single-commodity min-cost flow (MCF) problem have been proposed, and several efficient codes are available that implement different variants of the algorithms. The practical significance of the algorithms has been tested by comparing the time required by their implementations for solving "from-scratch" instances of MCF, of different classes, as the size of the problem (number of nodes and arcs) increases. However, in many applications several closely related instances of MCF have to be sequentially solved, so that reoptimization techniques can be used to speed up computations, and the most attractive algorithm is the one that minimizes the total time required to solve all the instances in the sequence. In this paper we compare the performances of four different efficient implementations of algorithms for MCF under cost reoptimization in the context of decomposition algorithms for the multicommodity min-cost flow (MMCF) problem, showing that for some classes of instances the relative performances of the codes doing "from-scratch" optimization do not accurately predict the relative performances when reoptimization is used. Because the best solver depends both on the class and on the size of the instance, this work also shows the usefulness of a standard interface for MCF problem solvers that we have proposed and implemented.

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

analysis of algorithms
computers-computer science
software
networks-graphs
flow algorithms


constraint tuning and management for web applications Since the Web is becoming a platform for implementing complex B2C and B2B applications instead of simple content publishing sites, the need arises of imposing constraints on the navigation and on the managed information. Web conceptual modeling languages allow to a small extent to specify constraints on the application, by means of some extensions to their basic primitives; however these approaches do not provide a comprehensive framework for efficient and effective constraint management. The goal of this paper is to present a general framework to facilitate the integration of efficient integrity checking methods in Web applications. Our main contribution is the study of a set of parameters that can be inferred from high level Web application modeling, for allowing the tuning of the constraint optimization techniques for each specific Web application. From these parameters we derive the optimal enforcement techniques to be implemented.

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


Uniform asymptotic stability of impulsive delay differential equations In this paper, criteria on uniform asymptotic stability are established for impulsive delay differential equations using Lyapunov functions and Razumikhin techniques. It is shown that impulses do contribute to yield stability properties even when the underlying system does not enjoy any stability behavior. Some examples are also discussed to illustrate the theorems. (C) 2001 Elsevier Science Ltd. All rights reserved.

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

stability
impulsive delay differential equations


Formal specification and analysis of functional properties of graph rewriting-based model transformation Model processing programs are regularly used when working with models or synthetizing the code from them; therefore, their verification has become an essential component of constructing reliable software in model-based software engineering. Models are usually formalized and visualized as graphs; therefore, model processing programs based on algebraic graph rewriting systemssuch programs are called model transformationsare often applied, and their verification has become an important research area. The goal of our research is to support offline transformation analysis by automated methods, where offline means that only the definition of the program itself, the language definitions of its source and target models are used during the analysis. Therefore, the results are independent from concrete source models, and the analysis needs to be performed only once. Based on previous work, this paper provides the synthesis and of a set of individual components and improves them to provide a complete verification solution: (i) a language is introduced to specify the properties to be verified; (ii) a formalism to describe model transformations in a declarative way; and (iii) automated algorithms that can analyse the declarative transformations as well as the properties expressed by the language. Besides its theoretical basis, the implementation of a verification framework is presented, and its operation is illustrated on a case study. Although the formal verification of model transformation properties is algorithmically undecidable in general, our goal is to provide a practically usable, scoped framework that can largely facilitate the manual verification of model transformations. Copyright (c) 2013 John Wiley & Sons, Ltd.

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

model processing
model transformation
graph rewriting
verification


Sensitivity and Hessian matrix analysis of power spectral density functions for uniformly modulated evolutionary random seismic responses This paper describes a numerical method for calculation of the sensitivity and Hessian matrix of the response PSD functions of structures subjected to uniformly modulated evolutionary random seismic excitation. The method is formulated based on the pseudo excitation method and Newmark method. The evolutionary non-stationary random response analysis is converted into step-by-step integration computations using the pseudo excitation method. The formulas of the pseudo responses, their first and second derivatives with respect to the structural design variables are derived based on the Newmark method. The PSD functions, their sensitivity and Hessian matrix are calculated using the pseudo responses, their first and second derivatives, respectively. Then the computation procedure of sensitivity and Hessian matrix of PSD functions is given in detail. Finally, the PSD functions sensitivity and Hessian matrix analysis of a three-story, two-bay planar frame subjected to the uniformly modulated evolutionary random earthquake ground motion has been studied to elucidate the proposed method.

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

psd function
non-stationary random seismic response


A specification language for problem partitioning in decomposition-based design optimization Decomposition-based design optimization consists of two steps: partitioning of a system design problem into a number of subproblems, and coordination of the design of the decomposed system. Although several generic frameworks for coordination method implementation are available (the second step), generic approaches for specification of the partitioned problem (the first step) are rare. Available specification methods are often based on matrix or graph representations of the entire system. For larger systems these representations become intractable due to the large number of design variables and functions. This article presents a new linguistic approach for specification of partitioned problems in decomposition-based design optimization. With the elements of the proposed specification language, called I (the Greek letter "Psi"), a designer can define subproblems, and assemble these into larger systems in a bottom-up fashion. The assembly process allows the system designer to control the complexity and tractability of the problem partitioning task. To facilitate coupling to generic coordination frameworks, a compiler has been developed for I that generates an interchange file in the INI format. This INI-definition of the partitioned problem can easily be interpreted by programs written in other languages. The flexibility provided by the I language and the automated generation of input files for computational frameworks is demonstrated on a vehicle chassis design problem. The developed tools, including user manuals and examples, are made publicly available.

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

problem partitioning
specification language
implementation

decomposition
distributed analysis
distributed optimization
multidisciplinary design optimization
psi language


Analyzing the enabling factors for the organizational decision to adopt healthcare information systems ? We identify factors affecting the organization adoption of healthcare IS. We developed a framework to show the inter-relationship among factors identified. Awareness and trigger type could affect organizational adoption decision outcomes. Besides resource availability, shared contribution among stakeholders is essential.

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

vital signs monitoring
pilot trial
adoption enabling factors


the direct cost of virtual function calls in c++ We study the direct cost of virtual function calls in C++ programs, assuming the standard implementation using virtual function tables. We measure this overhead experimentally for a number of large benchmark programs, using a combination of executable inspection and processor simulation. Our results show that the C++ programs measured spend a median of 5.2\% of their time and 3.7\% of their instructions in dispatch code. For "all virtuals" versions of the programs, the median overhead rises to 13.7\% (13\% of the instructions). The "thunk" variant of the virtual function table implementation reduces the overhead by a median of 21\% relative to the standard implementation. On future processors, these overheads are likely to increase moderately.

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

processor simulation benchmark code implementation direct tables future inspection cost

measurement program functional instruction standardization version relation timing virtualization combinational


Adaptive order statistics rational hybrid filters for multichannel image processing A new adaptive multichannel filtering approach is introduced and analyzed in this paper. The technique is sim pier and more appropriate than traditional approaches that have been addressed by means of groupwise vector ordering information. These filters are a two-stage filters based on rational functions (RF using fuzzy transformations of the Euclidean and angular distances among the different vectors to adapt to local data in the color image. The output is the result of vector rational operation taking into account three fuzzy sub-function outputs. Simulation studies indicate that the filters are computationally attractive and have excellent performance such as edge and details preservation and accurate chromaticity estimation.

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


extensible input handling in the subarctic toolkit The subArctic user interface toolkit has extensibility as one of its central goals. It seeks not only to supply a powerful library of reusable interactive objects, but also make it easy to create new, unusual, and highly customized interactions tailored to the needs of particular interfaces or task domains. A central part of this extensibility is the input model used by the toolkit. The subArctic input model provides standard reusable components that implement many typical input handling patterns for the programmer, allows inputs to be handled in very flexible ways, and allows the details of how inputs are handled to be modified to meet custom needs. This paper will consider the structure and operation of the subArctic input handling mechanism. It will demonstrate the flexibility of the system through a series of examples, illustrating techniques that it enables - many of which would be very difficult to implement in most toolkits.

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

task examples input goals interfaces flexibility extensibility model paper toolkit structure custom demonstrate programmer

user-interface toolkit
domain
object
standardization
interaction techniques
libraries
reusability
gui toolkits
component
pattern
interaction
systems
event handling


State space collapse for asymptotically critical multi-class fluid networks We consider a class of fluid queueing networks with multiple fluid classes and feedback allowed, which are fed by N heavy tailed ON/OFF sources. We study the asymptotic behavior when N -> infinity of these queueing systems in a heavy traffic regime (that is, when they are asymptotically critical). As performance processes we consider the workload W(N) (the amount of time needed for each server to complete processing of all the fluid in queue), and the fluid queue Z(N) (the quantity of each fluid class in the system). We show the convergence of root NW(N) and root N Z(N) (to (W) over cap and (Z) over cap) in heavy traffic if state space collapse (SSC) holds. (SSC) is a condition that establishes a relationship between those components of (Z) over cap that correspond to fluid classes processed by the same server, which implies that (Z) over cap =Delta(W) over cap for a deterministic lifting matrix Delta. Our main contribution is to prove that assuming that the other hypotheses are true, (SSC) is not only sufficient for this convergence, but necessary. Furthermore, we prove that processes (W) over cap and (Z) over cap conveniently scaled in time, converge to W (a reflected fractional Brownian motion) and Z (= Delta W). We illustrate the application of our results with some examples including a tandem queue.

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

state space collapse
reflected fractional brownian motion
heavy traffic
tandem queue

fluid model
multi-class queueing network
workload process
fluid queue process
on-off sources
completely-s matrix


Towards a hybrid testing process unifying exploratory testing and scripted testing Given the current state of the art in research, practitioners are faced with the challenge of choosing scripted testing (ST) or exploratory testing (ET). This study aims at systematically incorporating strengths of ET and ST in a hybrid testing process to overcome the weaknesses of each. We utilized systematic review and practitioner interviews to identify strengths and weaknesses of ET and ST. Strengths of ET were mapped to weaknesses of ST and vice versa. Noblit and Hare's lines-of-argument method was used for data analysis. The results of the mapping were used as input to codesign a hybrid process with experienced practitioners. We found a clear need to create a hybrid process as follows: (i) both ST and ET provide strengths and weaknesses, and these depend on some particular conditions, which prevents preference of one approach to another; and (ii) the mapping showed that it is possible to address the weaknesses in one process by the strengths of the other in a hybrid form. With the input from literature and industry experts, a flexible and iterative hybrid process was designed. Practitioners can clearly benefit from using a hybrid process given the mapping of advantages and disadvantages. Copyright 2013 John Wiley & Sons, Ltd.

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 B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 process improvement
test process
prescriptive testing
test case based testing
ad hoc testing
empirical study


Quantitative comparison of models Of Cs-137 cycling in forest ecosystems The predictions of nine mathematical models of radiocesium (Cs-137) cycling in forest ecosystems were evaluated through a model-data comparison on the basis of a scenario consisting of an acute dry deposition Of Cs-137 over a pine forest located in the Ukrainian territory affected by the Chernobyl accident (Zhitomir region). The forest compartments included in the comparisons were: organic and mineral soil layers, bilberries, fungi, roe deer, and different parts of the tree: bark, needles, shoots, and wood. The model predictions and the data agreed within a factor of 1.1 to 65 depending on the model and forest compartment. Statistically significant differences in the degree of agreement between model predictions and experimental data could be demonstrated for some models and forest compartments. The observed differences suggest that efforts for improving model predictions of radiocesium transfer to tree wood, needles, and shoots should be directed to a better simulation of the processes of root uptake and translocation of the radionuclide within the tree. (C) 2002 Elsevier Science Ltd. All rights reserved.

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


Learning Signaling Network Structures with Sparsely Distributed Data Flow cytometric measurement of signaling protein abundances has proved particularly useful for elucidation of signaling pathway structure. The single cell nature of the data ensures a very large dataset size, providing a statistically robust dataset for structure learning. Moreover, the approach is easily scaled to many conditions in high throughput. However, the technology suffers from a dimensionality constraint: at the cutting edge, only about 12 protein species can be measured per cell, far from sufficient for most signaling pathways. Because the structure learning algorithm ( in practice) requires that all variables be measured together simultaneously, this restricts structure learning to the number of variables that constitute the flow cytometer's upper dimensionality limit. To address this problem, we present here an algorithm that enables structure learning for sparsely distributed data, allowing structure learning beyond the measurement technology's upper dimensionality limit for simultaneously measurable variables. The algorithm assesses pairwise (or n-wise) dependencies, constructs "Markov neighborhoods" for each variable based on these dependencies, measures each variable in the context of its neighborhood, and performs structure learning using a constrained search.

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

bayesian networks
flow cytometry
graphical models
proteomics


self-organizing publish/subscribe The increasing availability of broadband Internet access coming along with cheap flatrate tariffs changed the way the Internet is used over the last years. As a result, we observe more users that become producers and collaborate instead of solely consuming information as they did before. Besides that, the Internet has become a tool for daily use and information dissemination. As push-based information services are heavily needed for collaboration and information dissemination, it seems like the breakthrough of distributed push publish/subscribe on the open Internet is just imminent today, although research has been around already for many years now. One reason why most publish/subscribe applications are still based on a rather basic centralized mechanism and not on a distributed scalable notification service, as it is commonly proposed in state-of-the-art publish/subscribe systems in research, is the unsolved management issue.This extended research abstracts is intended to give an overview of my Ph.D. project on self-organizing publish/subscribe, where I want to tackle management issues for better applicability. After giving an introduction to the pub/sub communication paradigm and motivating the necessity to make such systems self-organizing, I will point out the contributions of my work. They are centered around making publish/subscribe systems self-stabilizing and adaptive by means of self-organizing mechanisms. While my work on self-stabilization is nearly finished, introducing adaptivity by self-organization is still in an early stage.

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


A spatial microsimulation model with student agents In this paper, we present a dynamic simulation model which projects the future population of the city of Leeds as a basis for policy analysis and scenario planning. We argue that microsimulation modelling is not entirely effective in the representation of student populations. Alternative approaches using both spatial interaction models and student agents are presented and evaluated. The results from the agent-based model are found to be particularly encouraging. We suggest that agent-based modelling and microsimulation are powerful as complementary technologies for individual-based modelling.

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

agent-based model
spatial interaction model
migration
urban planning
policy scenario


Existence of Data and Multiuser Diversities in Noncooperative Mobile Infostation Networks The capacity of mobile Infostation network can be greatly increased, if, in addition to direct short-range communications between mobile nodes and fixed infostations, nodes also communicate amongst themselves whenever they meet. However, this requires cooperation among mobile nodes that are not necessarily spontaneous for commercial applications. We propose means to create opportunistic cooperation in the context of contention distribution in selfish mobile infostation networks. First, we assume that all nodes have a common interest in all files. We stipulate a social contract such that a bilateral file exchange takes place only when either node obtains something it wants from the exchange. Resulting capacity depends on mobility, the number of files being disseminated, and node density. In addition to the existence of multiuser diversity, our results indicate the existence of data diversity-throughput increases as the number of files of interest to all nodes increases. We also consider the case where nodes have dissimilar interests. Results show that as the level of interest overlap decreases, network performance degrades dramatically. We propose an alternate user strategy in the partially overlapping-interests case and show that network throughput is significantly improved by allowing better use of multiuser diversity. We conclude that through opportunistic cooperation, both data and multiuser diversities exist in noncooperative mobile infostation networks.

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

mobile infostation networks
cooperation
multiuser diversity

ad hoc networks
noncooperative networks
content distribution
data diversity


why not negation by fixpoint? There is a fixpoint semantics for DATALOG programs with negation that is a natural generalization of the standard semantics for DATALOG programs without negation. We show that, unfortunately, several compelling complexity-theoretic obstacles rule out its efficient implementation. As an alternative, we propose Inflationary DATALOG, an efficiently implementable semantics for negation, based on inflationary fixpoints

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

standardization program general complexity efficiency semantic


Sensor data analysis for equipment monitoring Sensors play a key role in modern industrial plant operations. Nevertheless, the information they provide is still underused. Extracting information from the raw data generated by the sensors is a complicated task, and it is usually used to help the operator react to undesired events, other than preventing them. This paper presents SDAEM (Sensor Data Analysis for Equipment Monitoring), an oil process plant monitoring model that covers three main goals: mining the sensor time series data to understand plant operation status and predict failures, interpreting correlated data from different sensors to verify sensors interdependence, and adjusting equipments working set points that leads to a more stable plant operation and avoids an excessive number of alarms. In addition, as time series data generated by sensors grow at an extremely fast rate, SDAEM uses parallel processing to provide real-time feedback. We have applied our model to monitor a process plant of a Brazilian offshore platform. Initial results were promising since some undesired events were recognized and operators adopted the tool to assist them finding good set points for the oil processing equipments.

O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 frontal code for the solution of sparse positive-definite symmetric systems arising from finite-element applications We describe the design, implementation, and performance of a frontal code for the solution of large sparse symmetric systems of linear finite-element equations. The code is intended primarily for positive-definite systems, since numerical pivoting is not performed. The resulting software package, MA62, will be included in the Harwell Subroutine Library. We illustrate the performance of our new code on a range of problems arising from real engineering and industrial applications. The performance of the code is compared with that of the Harwell Subroutine Library general frontal solver MA42 and with other positive-definite codes from the Harwell Subroutine Library.

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

finite-element equations
gaussian elimination
level 3 blas
sparse symmetric linear equations
symmetric frontal method


Transmission control for power-shift agricultural tractors: Design and end-of-line automatic tuning This paper addresses the analysis and design of the transmission control system for a high-power power-shift agricultural tractor. Specifically, all the criticalities involved with the correct management of both single clutch and double clutch gear shifts are investigated, and a control system capable of providing good shifting performance in all operating conditions is proposed. Further, to comply with components tolerances and spreads in the production line, an automatic procedure for the end-of-line tuning of the transmission control system is proposed to objectively classify the quality of the gear shift and automatically optimize it. The suitability of the proposed approach is thoroughly tested on an instrumented vehicle. (C) 2010 Elsevier Ltd. All rights reserved.

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

power-shift transmission
automotive systems
end-of-line tuning


AINet-SL: Artificial immune network with social learning and its application in FIR filter designing An artificial immune network with social learning (AINet-SL) for optimization is proposed. Two social learning mechanisms, i.e., stochastic social learning (SSL) and heuristic social learning (HSL), are proposed. The numerical simulation results confirm the superiority of the proposed AINet-SL in solution accuracy and convergence speed.

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

artificial immune network
fir filter
optimization
social learning


ADAPTATION TO A SPEAKERS VOICE IN A SPEECH RECOGNITION SYSTEM BASED ON SYNTHETIC PHONEME REFERENCES A speech recognition system based on synthetic generation of reference prototypes is described. The vocabulary and grammar are described in a finite-state phoneme network. In the transformation from symbolic to spectral representation, reduction rules modify the initial phoneme target values and a coarticulation module inserts interpolated transition states at phoneme boundaries. The phoneme templates are specified in terms of control parameters to a serial formant synthesiser. At each state, a 16-channel filter bank section is computed from the synthesis parameters. The recognition process uses a time-synchronous dynamic programming technique to find the path in the network that minimises the accumulated spectral distance to the input utterance. A technique for dynamic adaptation to the speaker's voice source spectrum is performed during recognition. Without adaptation, the average recognition for ten male speakers was 88% on an isolated-word task using a 26-word vocabulary. Adding voice source adaptation raised the performance to 96%. On a vocabulary of 3 connected digits, the adaptation technique improved the recognition rate for six male speakers from 87.7% to 92.8%. The improvement was largest for subjects with low initial recognition rate, indicating the benefit of the voice source adaptation technique for certain voices. Changing the voice source model and optimising the adaptation time constant raised the recognition rate further to 96.1%. Current work is directed towards speaker adaptation of phoneme parameters and modelling of the variability of the parameter dynamics at phoneme boundaries.

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

speech recognition
voice source adaptation

synthetic prototypes
speech production oriented recognition


a maximum entropy approach to species distribution modeling We study the problem of modeling species geographic distributions, a critical problem in conservation biology. We propose the use of maximum-entropy techniques for this problem, specifically, sequential-update algorithms that can handle a very large number of features. We describe experiments comparing maxent with a standard distribution-modeling tool, called GARP, on a dataset containing observation data for North American breeding birds. We also study how well maxent performs as a function of the number of training examples and training time, analyze the use of regularization to avoid overfitting when the number of examples is small, and explore the interpretability of models constructed using maxent.

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

training
use
examples
tool
data
maximum entropy
regularization

observability interpretation functional standardization experience timing distributed model algorithm critic feature exploration update


Multi-Scale Model of O2 Transport and Metabolism Regulation of pulmonary oxygen uptake (VO2p) during exercise depends on cellular energy demand, blood flow, ventilation, oxygen exchange across membranes, and oxygen utilization in the contracting skeletal muscle. In human and animal studies of metabolic processes that control cellular respiration in working skeletal muscle, pulmonary VO2 dynamics is measured at the mouth using indirect calorimetry. To provide information on the dynamic balance between oxygen delivery and oxygen consumption at the microvascular level, muscle oxygenation is measured using near-infrared spectroscopy. A multi-scale computational model that links O2 transport and cellular metabolism in the skeletal muscle was developed to relate the measurements and gain quantitative understanding of the regulation of VO2 at the cellular, tissue, and whole-body level. The model incorporates mechanisms of oxygen transport from the airway openings to the cell, as well as the phosphagenic and oxidative pathways of ATP synthesis in the muscle cells.

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

modeling
mass transport
energy metabolism
muscle exercise


CameronLiebler line classes in \(PG(n,4)\) We derive a new existence condition for CameronLiebler line classes in \(PG(3,q)\). As an application, we obtain the characterization of CameronLiebler line classes in \(PG(n,4),\,n\ge 3\).

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


Projective reconstruction from line-correspondences in multiple uncalibrated images A new approach is proposed for reconstructing 3D lines and cameras from 2D corresponding lines across multiple uncalibrated views. There is no requirement that the 2D corresponding lines on different images represent the same segment of a 3D line, which may not appear on all images. A 3D line is reconstructed by minimizing a geometric cost function that measures the distance of the reprojected end points of the 3D segment from the measured 2D lines on different images. An algorithmic procedure is provided with guaranteed convergence to a solution where the geometric cost function achieves a (local) minimum.

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

multiple views
line reconstruction
line correspondence


Costs and benefits of the European directive on road tolling interoperability Pricing of road use in the form of tolls, congestion charges, kilometre tax and other similar schemes, is becoming increasingly common. Each toll road operator has so far decided on its own how to design and implement systems for collecting road user charges, causing a plethora of system and scheme designs. As a measure to reduce the drawbacks of such differences, the European Union has passed legislation aiming at making available interoperable road charging services, valid across all charging systems a vehicle might pass during a European journey. This legislation is setting the bar high, requiring that virtually every charging system in the Union be covered. We analyse the costs and benefits caused by this regulation, and if an adjusted regulation can improve these results. We conclude that the new legislation yields a social loss ranging from 100 to just above 500 million Euros annually. Policy suggestions to improve this result are also provided.

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

road user charging
road pricing
costbenefit analysis
harmonisation
standards


Ontological informatics infrastructure for pharmaceutical product development and manufacturing Informatics infrastructure plays a crucial role in supporting different decision making activities related to pharmaceutical product development, pilot plant and commercial scale manufacturing by streamlining information gathering, data integration, model development and managing all these for easy and timely access and reuse. The foundation of such an infrastructure is the explicitly and formally modeled information. This foundation enables knowledge in different forms, and best manufacturing practices, to be modeled and captured into tools to support the product lifecycle management. This paper discusses the development of ontologies, Semantic Web infrastructure and Web related technologies that make such an infrastructure development possible. While many of the issues addressed in this paper are applicable to a wide spectrum of molecular-based products, we focus our work on the development of pharmaceutical informatics to support Active Pharmaceutical Ingredient (API) as well as drug product development as case studies to illustrate the various aspects of this infrastructure.(c) 2006 Elsevier Ltd. All rights reserved.

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

product design
process development
ontology


An expert system based on artificial neural network for predicting the tensile behavior of tailor welded blanks The forming behavior of tailor welded blanks (TWB) is influenced by thickness ratio, strength ratio, and weld conditions in a synergistic fashion. In most of the cases, these parameters deteriorate the forming behavior of TWB. It is necessary to predict suitable TWB conditions for achieving better-stamped product made of welded blanks. This is quite difficult and resource intensive, requiring lot of simulations or experiments to be performed under varied base material and weld conditions. Automotive sheet part designers will be greatly benefited if an expert system is available that can deliver forming behavior of TWB for varied weld and blank conditions. This work primarily aims at developing an artificial neural network (ANN) model to predict the tensile behavior of welded blanks made of steel grade and aluminium alloy base materials. The important tensile characteristics of TWB are predicted within chosen range of varied blank and weld condition. Through out the work, PAM STAMP 2G finite element (FE) code is used to simulate the tensile behavior and to generate output data required for training the ANN. Predicted results from ANN model are compared and validated with FE simulation for two different intermediate TWB conditions. It is observed that the results obtained from ANN are encouraging with acceptable prediction errors. An expert system framework is proposed using the trained ANN for designing TWB conditions that will deliver better formed TWB products.

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

tailor welded blanks
forming
simulation
artificial neural network


A component-based topology model for railway interlocking systems Writing interlocking logic is an important part of designing a railway interlocking system. In this paper a new method which increases the efficiency of writing interlocking logic is introduced. That is describing interlocking rules and station topology separately, and producing interlocking logic automatically by associating topology data with interlocking rules using software tools. As interlocking rules remain the same, the work for a new station is to specify the topology data only and the new interlocking logic can be generated automatically. This paper emphasizes on a component-based model used to describe the topology of the station. In this model, a railway station is abstracted as a set of connected components, and route information can be deduced from the topology data. The model of station topology makes the idea of producing interlocking logic automatically possible. (C) 2011 IMACS. Published by Elsevier B.V. All rights reserved.

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


Constructing delay-bounded multicast trees in computer networks In this paper we propose a distributed protocol for constructing delay-bounded minimum-cost multicast trees in computer networks. The proposed protocol does nor require knowledge of the complete network topology. Furthermore, it is unnecessary to know how many nodes are in the networks and which nodes are group members in advance. It is shown, through analysis and simulation on a class of random graphs, that our protocol only uses O(n) messages in the best case, where n is the number of nodes in the networks. Even in the worst case, our protocol uses O(d*n) messages that has lower message complexity than previous protocols, where d is the average nodal degree.

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

multicast routing
steiner tree
tree cost
delay bounded multicast
distributed algorithm


Back to the Future: Economic Self-Organisation and Maximum Entropy Prediction This paper shows that signal restoration methodology is appropriate for predicting the equilibrium state of certain economic systems. A formal justification for this is provided by proving the existence of finite improvement paths in object allocation problems under weak assumptions on preferences, linking any initial condition to a Nash equilibrium. Because a finite improvement path is made up of a sequence of systematic best-responses, backwards movement from the equilibrium back to the initial condition can be treated like the realisation of a noise process. This underpins the use of signal restoration to predict the equilibrium from the initial condition, and an illustration is provided through an application of maximum entropy signal restoration to the Schelling model of segregation.

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


Elastic SI-Cache: consistent and scalable caching in multi-tier architectures The new vision of cloud computing demands scalable, available and autonomic software platforms in order to deploy applications and services accessible anywhere and anytime. Multi-tier architectures are an important building block for many applications that are deployed in the cloud. This paper presents a novel caching and replication infrastructure that facilitates the scalable and elastic deployment of multi-tier architectures. Our Elastic SI-Cache is a novel multi-version cache that attains high performance and consistency in multi-tier systems. In contrast to most existing caches, Elastic SI-Cache provides snapshot isolation coherently across all tiers. Furthermore, Elastic SI-Cache supports scalable replication of the different tiers where replicas can be added or removed dynamically as needed, making the cache amenable for cloud computing environments. Elastic SI-Cache has been implemented and integrated into an open source JEE application server and its performance evaluated with the industrial benchmark SPECjAppServer.

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

scalability
elastic computing
provisioning
multi-version caching
fault-tolerance


Fast quantification of immunohistochemistry tissue microarrays in lung carcinoma Tissue microarrays (TMAs) are an effective tool for high-throughput molecular analysis of tissues to help identify new diagnostic and prognostic markers and targets in human cancers. We have developed a fully automated method for rapid, continuous and quantitative analysis of TMAs based on immunohistochemistry. The method deals with complex and varying tissue architectures, segments tumour cells from normal cells, conducts cell compartmentalisation, identifies nuclei and cytoplasm and produces three different continuous measurements of marker expression levels within tumour cell nuclei, tumour cell cytoplasm and total tumour cell protein expression. We have demonstrated this method using three independent protein markers (BAK, BAX and a novel biomarker, named KS) over 7 TMAs, involving 2 BAK stained TMAs with 229 tumour tissue cores, 2 BAX stained TMAs with 229 tumour tissue cores and 3 KS stained TMAs with 373 tumour cores of lung carcinomas. We validated the automated method, showing that the automated scoring is significantly correlated with the pathologist-based scoring.

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

automated quantification
tissue microarray


Endocrinological Basis of Sex Differences in Cocaine-Induced Behavioral Responses Currently, 1.8 million Americans use cocaine, 30% of whom are females. Sex differences in the pattern of cocaine abuse may reside in neuroendocrinological modulations that affect the use of and/or dependence on cocaine. This review discusses sex differences in cocaine-induced behavioral and molecular alterations in the central nervous system, with emphasis on the role of endocrine responses in the neuronal modulations of this drug. Mechanisms and data supporting the role of the hypothalamic-gonadal axis in the modulation of cocaine-induced behavioral and molecular alterations are also provided.

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

estrogen
estrous cycle
gender
progesterone
testosterone


UANN BASED PATTERN CLASSIFIER USING ROUGH SET APPROACH Data mining currently is a vital and core process because of advances in the technology, and numerous other forms of data. As an essential and significant constituent of data mining, classification has also become vital and a sought-after-option for research. Over the years, as various soft computing tools have been proven to be more complimentary than competitive, many hybrid approaches have evolved for pattern classification. A major thrust has always been there to apply hybrid approaches involving artificial neural network as the main tool for pattern classification. Here, one such hybrid approach is presented with application of Rough set philosophy to unsupervised artificial neural network (UANN) based pattern classifier. This enhances the performance of the classifier and makes it more suitable for real time classification applications dealing with large and unlabeled data. The idea presented here discusses with possibility and application of various Rough set based approaches at different levels of implementation of such classifier. The concluding section presents the results achieved for data of two case studies related to face recognition and mobile handoff prediction.

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

pattern classification
face
recognition
handoff

rough sets
unsupervised neural network
rough neuron