CIJET:

A

program

for

computation

of

jet

cross

sections

induced

by

quark

contact

interactions

at

hadron

colliders

We

describe

a

Fortran

program

aimed

at

calculating

single-inclusive

jet

or

dijet

production

cross

sections

induced

by

quark

contact

interactions

from

new

physics

at

hadron

colliders,

up

to

next-to-leading

order

in

QCD.

It

covers

various

contact

interactions

with

different

chiral

and

color

structures.

The

code

is

designed

in

a

way

that

could

be

used

for

fast

calculations

with

arbitrary

parton

distribution

functions

based

on

interpolations

of

the

QCD

coupling

constant

and

parton

distribution

functions.

Program

title:

CIJET

Catalogue

identifier:

Program

summary

URL:

Program

obtainable

from:

CPC

Program

Library,

Queens

University,

Belfast,

N.

Ireland

Licensing

provisions:

Standard

CPC

licence,

No.

of

lines

in

distributed

program,

including

test

data,

etc.:

No.

of

bytes

in

distributed

program,

including

test

data,

etc.:

Distribution

format:

tar.gz

Programming

language:

Fortran;

with

some

included

libraries

coded

in

C.

Computer:

All.

Operating

system:

Any

UNIX-like

system.

RAM:

MB

Classification:

External

routines:

LHAPDF

Nature

of

problem:

Calculation

of

single-inclusive

jet

and

dijet

cross

sections

induced

by

quark

contact

interactions

up

to

next-to-leading

order

in

QCD

at

hadron

colliders.

Solution

method:

Using

the

VEGAS

Monte

Carlo

sampling

and

subtracted

matrix

element

to

generate

weight

grids

and

store

them

in

a

table

file

that

allows

for

later

interpolations

on

arbitrary

parton

distribution

functions.

Running

time:

Depends

on

the

details

of

the

calculation

and

the

required

numerical

accuracy.

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

jet production
quark compositeness
perturbative calculation
hadron collider


Parameter optimization for spray coating The aim of planning path-oriented spray-coating processes is to find a time-dependent continuous sequence of spray gun configurations so that a coating of desired thickness is achieved when executing the sequence. A novel approach to solving the planning task, called geometry-last, is outlined which leads to a more general gun configuration cover problem. The gun configuration cover problem is to find a finite set of spray gun configurations, which minimizes the error between a target coating and the coating induced by simultaneously activating those configurations. A suitable objective function for gun configuration covers is defined, and algorithmic solutions for the optimization problem are presented, including speed-up by hierarchization and use of graphics hardware. An experimental evaluation shows that good approximations of the desired coatings can be achieved within reasonable computing times. In contrast to other approaches, geometry-last gains additional flexibility required to find complex paths for free-form workpieces.

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

robot path planning
thermal spray coating


Computing multi-species chemical equilibrium with an algorithm based on the reaction extents A mathematical model for the solution of a set of chemical equilibrium equations in a multi-species and multiphase chemical system is described. The computer-aid solution of model is achieved by means of a Newton-Raphson method enhanced with a line-search scheme, which deals with the non-negative constrains. The residual function, representing the distance to the equilibrium, is defined from the chemical potential (or Gibbs energy) of the chemical system. Local minimums are potentially avoided by the prioritization of the aqueous reactions with respect to the heterogeneous reactions. The formation and release of gas bubbles is taken into account in the model, limiting the concentration of volatile aqueous species to a maximum value, given by the gas solubility constant. The reaction extents are used as state variables for the numerical method. As a result, the accepted solution satisfies the charge and mass balance equations and the model is fully compatible with general reactive transport models. (C) 2013 Elsevier Ltd. All rights reserved.

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


The Malaysian Telehealth Flagship Application: a national approach to health data protection and utilisation and consumer rights Telehealth refers to the integration of information, telecommunication, humanmachine interface technologies and health technologies to deliver health care, to promote the heath status of the people and to create health. The Malaysian Telehealth Application [Proceedings of the Ninth World Congress on Medical Informatics, 1998, p. 1282] will, on completion, provide every resident of the country an electronic Lifetime Health Record (LHR) and Lifetime Health Plan (LHP). He or she will also hold a smart card that will contain a subset of the data in the Lifetime Health Record. These will be the means by which Malaysians will receive seamless continuous quality care across a range of health facilities and health care providers, and by which Malaysias health goal of a nation of healthy individuals, families and communities is achieved. The challenges to security and privacy in providing access to an electronic Lifetime Health Record at private and government health facilities and to the electronic Lifetime Health Plan at homes of consumers require not only technical mechanisms but also national policies and practices addressing threats while facilitating access to health data during health encounters in different care settings. Organisational policies establish the goals that technical mechanisms serve. They should outline appropriate uses and access to information, create mechanisms for preventing and detecting violations, and set sanctions for violations. Some interesting innovations have been used to address these issues against the background of the launching of the multimedia supercorridor (MSC) in Malaysia.

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 B


a predictive blissymbolic to english translation system This paper reports on the use of predictive techniques to translate Blissymbol sentences into grammatically correct English. Evaluations of this approach show that it is possible to translate short sentences by analysing the likelihood of word tri-gram occurrences in English source texts. The translation system is designed to be a component of a Blissymbol word processor which allows users to convert Blissymbol sentences into grammatically correct English.

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

aac
blissymbolics
natural language translation


Assessing the quality of metamodels The complexity and diversity of modern software demands a variety of metamodel-based modeling languages for software development. Existing languages change continuously, and new ones are constantly emerging. In this situation, and especially for metamodel-based modeling languages, a quality assurance mechanism for metamodels is needed. This paper presents an approach to assessing the quality of metamodels. A quality model, which systematically characterizes and classifies quality attributes, and an operable measuring mechanism for effectively assessing the quality of metamodels based on the quality model, are presented, using UML as the main example.

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


On the numerical solution of nonlinear BlackScholes equations Nonlinear BlackScholes equations have been increasingly attracting interest over the last two decades, since they provide more accurate values by taking into account more realistic assumptions, such as transaction costs, risks from an unprotected portfolio, large investors preferences or illiquid markets (which may have an impact on the stock price), the volatility, the drift and the option price itself. In this paper we will focus on several models from the most relevant class of nonlinear BlackScholes equations for European and American options with a volatility depending on different factors, such as the stock price, the time, the option price and its derivatives due to transaction costs. We will analytically approach the option price by transforming the problem for a European Call option into a convection-diffusion equation with a nonlinear term and the free boundary problem for an American Call option into a fully nonlinear nonlocal parabolic equation defined on a fixed domain following ev?ovi?s idea. Finally, we will present the results of different numerical discretization schemes for European options for various volatility models including the Leland model, the Barles and Soner model and the Risk adjusted pricing methodology model.

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

nonlinear blackscholes equation
american and european options
finite difference schemes


nonprocedural query processing for databases with access paths The use of "rules of inference" in database systems with access paths--e.g., CODASYL and IMS databases--is proposed to allow nonprocedural querying of the database systems. The kinds of access paths for which these rules of inference are required are isolated. It is shown that the rules of inference required for a CODASYL or an IMS database depend on the configurations of the edges in a diagram of the database.

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

use
inference
access
database
rules
nonprocedural query processing

diagrams
database system
configurability
queries
relational model
network model
logical view of data
data independence
query processing
data base task group


Gujrati character recognition using weighted k-NN and Mean ? 2 distance measure With advances in the field of digitization, document analysis and handwriting recognition have emerged as key research areas. Authors present a handwritten character recognition system for Gujrati, an Indian language spoken by 40million people. The proposed system extracts four features. A unique pattern descriptor and Gabor phase XNOR pattern are the two features that are newly proposed for isolated handwritten character set of Gujrati. In addition to these two features, we use contour direction probability distribution function and autocorrelation features. Next contribution is the weighted k-NN classifier. This research finally contributes is a novel mean ? 2 distance measure. Proposed classifier exploits a combination of feature weights, new distance measure along with a triangular distance and Euclidian distance for performance that improves conventional k-NN classifier. The implementation on a comprehensive data set show 86.33% recognition efficiency. Facts and figures show that proposed approach outperforms conventional k-NN. It is concluded that despite the shape ambiguities in Indian scripts, proposed classification algorithm could be a dominant technique in the field of handwritten character recognition.

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

optical character recognition (ocr)
weighted k-nn classification
gabor phaser xnor pattern


user interactions in social networks and their implications Social networks are popular platforms for interaction, communication and collaboration between friends. Researchers have recently proposed an emerging class of applications that leverage relationships from social networks to improve security and performance in applications such as email, web browsing and overlay routing. While these applications often cite social network connectivity statistics to support their designs, researchers in psychology and sociology have repeatedly cast doubt on the practice of inferring meaningful relationships from social network connections alone. This leads to the question: Are social links valid indicators of real user interaction? If not, then how can we quantify these factors to form a more accurate model for evaluating socially-enhanced applications? In this paper, we address this question through a detailed study of user interactions in the Facebook social network. We propose the use of interaction graphs to impart meaning to online social links by quantifying user interactions. We analyze interaction graphs derived from Facebook user traces and show that they exhibit significantly lower levels of the "small-world" properties shown in their social graph counterparts. This means that these graphs have fewer "supernodes" with extremely high degree, and overall network diameter increases significantly as a result. To quantify the impact of our observations, we use both types of graphs to validate two well-known social-based applications (RE and SybilGuard). The results reveal new insights into both systems, and confirm our hypothesis that studies of social applications should use real indicators of user interactions in lieu of social graphs.

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


Systems-Level Evidence of Transcriptional Co-Regulation of Yeast Protein Complexes Protein complexes are functional units in the cell whose formation is regulated by a number of mechanisms. Previous studies have suggested that transcriptional co-regulation of protein components play a minor role in assembly of individual complexes. Recent developments in experimental approaches and bioinformatic analyses offer an opportunity to investigate the cell at a global or systems level with better quality. Here we show that, using genome/proteome-wide yeast data of protein complexes and protein-DNA interactions in normal growth conditions, a contribution of transcriptional co-regulation to global formation of protein complexes is statistically significant at a systems level. A significant fraction of proteins that form complexes shares common transcription factors on a global scale. We provide evidence for the significant contribution by quantifying transcriptional co-regulation of complexes as a global topological pattern of an integrated network. Biological relevance is examined by functional analysis of highly co-regulated complexes such as transport complexes. Our finding indicates that there exists linear causality at a systems level between transcriptional co-regulation of genes and formation of multi-protein complexes in the unicellular organism.

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

co-regulation measure
systems-level non-randomness
transcriptional co-regulation


An approach to fuzzy default reasoning for function approximation This paper discusses fuzzy reasoning for approximately realizing nonlinear functions by a small number of fuzzy if-then rules with different specificity levels. Our fuzzy rule base is a mixture of general and specific rules, which overlap with each other in the input space. General rules work as default rules in our fuzzy rule base. First, we briefly describe existing approaches to the handling of default rules in the framework of possibility theory. Next, we show that standard interpolation-based fuzzy reasoning leads to counterintuitive results when general rules include specific rules with different consequents. Then, we demonstrate that intuitively acceptable results are obtained from a non-standard inclusion-based fuzzy reasoning method. Our approach is based on the preference for more specific rules, which is a commonly used idea in the field of default reasoning. When a general rule includes a specific rule and they are both compatible with an input vector, the weight of the general rule is discounted in fuzzy reasoning. We also discuss the case where general rules do not perfectly but partially include specific rules. Then we propose a genetics-based machine learning (GBML) algorithm for extracting a small number of fuzzy if-then rules with different specificity levels from numerical data using our inclusion-based fuzzy reasoning method. Finally, we describe how our approach can be applied to the approximate realization of fuzzy number-valued nonlinear functions.

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

fuzzy modeling
genetics-based machine learning
fuzzy number-valued function


Goals and means in action observation: A computational approach Many of our daily activities are supported by behavioural goals that guide the selection of actions, which allow us to reach these goals effectively. Goals are considered to be important for action observation since they allow the observer to copy the goal of the action without the need to use the exact same means. The importance of being able to use different action means becomes evident when the observer and observed actor have different bodies (robots and humans) or bodily measurements (parents and children), or when the environments of actor and observer differ substantially (when an obstacle is present or absent in either environment). A selective focus on the action goals instead of the action means furthermore circumvents the need to consider the vantage point of the actor, which is consistent with recent findings that people prefer to represent the actions of others from their own individual perspective. In this paper, we use a computational approach to investigate how knowledge about action goals and means are used in action observation. We hypothesise that in action observation human agents are primarily interested in identifying the goals of the observed actor's behaviour. Behavioural cues (e.g. the way an object is grasped) may help to disambiguate the goal of the actor (e.g. whether a cup is grasped for drinking or handing it over). Recent advances in cognitive neuroscience are cited in support of the model's architecture.

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

action observation
action goals
human agents

action planning
goal inference
decision making
perception and action


Software architecture definition for on-demand cloud provisioning Cloud computing is a promising paradigm for the provisioning of IT services. Cloud computing infrastructures, such as those offered by the RESERVOIR project, aim to facilitate the deployment, management and execution of services across multiple physical locations in a seamless manner. In order for service providers to meet their quality of service objectives, it is important to examine how software architectures can be described to take full advantage of the capabilities introduced by such platforms. When dealing with software systems involving numerous loosely coupled components, architectural constraints need to be made explicit to ensure continuous operation when allocating and migrating services from one host in the Cloud to another. In addition, the need for optimising resources and minimising over-provisioning requires service providers to control the dynamic adjustment of capacity throughout the entire service lifecycle. We discuss the implications for software architecture definitions of distributed applications that are to be deployed on Clouds. In particular, we identify novel primitives to support service elasticity, co-location and other requirements, propose language abstractions for these primitives and define their behavioural semantics precisely by establishing constraints on the relationship between architecture definitions and Cloud management infrastructures using a model denotational approach in order to derive appropriate service management cycles. Using these primitives and semantic definition as a basis, we define a service management framework implementation that supports on demand cloud provisioning and present a novel monitoring framework that meets the demands of Cloud based applications.

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

cloud computing
software architecture
service management


image-based haptic texture rendering In this paper, we present a new image-based method to display haptic texture information extracted from a static two dimensional image. The three dimensional forces allow the user to feel the contours and textures of the image with sufficient realism using haptic devices. The texture force is decomposed into a normal force component and a tangential force component at the haptic interaction point. The magnitude of the normal force is determined either by the color temperature (i.e. the emotions of warmth/coolness evoked by colors) or the luminance values in images. Warmer/brighter colors determine stronger normal forces to generate bumps, and cooler/darker colors determine weaker normal forces to produce depressions. The tangential force describes the relative color variation between haptic interaction point and its neighbors, thus, can be considered as a descriptor of the local texture feature. Because it is oriented to the pixels with cooler color in the neighborhood, when the user is exploring the bump by a haptic device, tangential resistive forces are sent to the user until the top of the bump is reached and, after the top, the virtual probe is pulled in the other direction. Our force model is by means of simple image processing techniques. The calculation is totally done by local, independent and direct operation. In other words, global operation such as recovering height maps is not necessary.

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

haptic rendering
effects of color on perceived depth
texture extraction
virtual reality


Probability density of the differential phase difference in applications to passive wireless surface acoustic wave sensing ? The probability density function (pdf) is discussed of the differential phase difference (DPD) in the radio frequency (RF) pulse-burst perturbed by Gaussian noise at the coherent receiver. Statistical properties of the DPD are of importance for error estimation in coherent systems such as remote passive wireless surface acoustic wave (SAW) sensing with multiple differential phase measurement. The rigorous probability density of the DPD is derived and its particular functions, all having no closed forms, are given for different signal-to-noise ratios (SNRs) in the RF pulses. Employing the von Mises/Tikhonov distribution, an efficient approximation is proposed via the modified Bessel functions of the first kind and zeroth order. Engineering features and small errors of the approximation are demonstrated. Applications are given for the phase difference drift rate and error probability for the drift rate to exceed a threshold.

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

differential phase difference
probability density
drift rate
error probability


BANDWIDTH EMPIRICAL MODE DECOMPOSITION AND ITS APPLICATION There are some methods to decompose a signal into different components such as: Fourier decomposition and wavelet decomposition. But they have limitations in some aspects. Recently, there is a new signal decomposition algorithm called the Empirical Mode Decomposition (EMD) Algorithm which provides a powerful tool for adaptive multiscale analysis of nonstationary signals. Recent works have demonstrated that EMD has remarkable e.ect in time series decomposition, but EMD also has several problems such as scale mixture and convergence property. This paper proposes two key points to design Bandwidth EMD to improve on the empirical mode decomposition algorithm. By analyzing the simulated and actual signals, it is confirmed that the Intrinsic Mode Functions (IMFs) obtained by the bandwidth criterion can approach the real components and reflect the intrinsic information of the analyzed signal. In this paper, we use Bandwidth EMD to decompose electricity consumption data into cycles and trend which help us recognize the structure rule of the electricity consumption series.

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

intrinsic mode function (imf)
empirical mode decomposition (emd)
sifting algorithm
instantaneous frequency


Assessment of M5 ' model tree and classification and regression trees for prediction of scour depth below free overfall spillways The scour below spillways can endanger the stability of the dams. Hence, determining the scour depth downstream of spillways is of vital importance. Recently, soft computing models and, in particular, artificial neural networks (ANNs) have been used for scour depth prediction. However, ANNs are not as comprehensible and easy to use as empirical formulas for the estimation of scour depth. Therefore, in this study, two decision-tree methods based on model trees and classification and regression trees were employed for the prediction of scour depth downstream of free overfall spillways. The advantage of model trees and classification and regression trees compared to ANNs is that these models are able to provide practical prediction equations. A comparison between the results obtained in the present study and those obtained using empirical formulas is made. The statistical measures indicate that the proposed soft computing approaches outperform empirical formulas. Results of the present study indicated that model trees were more accurate than classification and regression trees for the estimation of scour depth.

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

scour depth
free overfall spillways
model trees
classification and regression trees


Further properties of random orthogonal matrix simulation Random orthogonal matrix (ROM) simulation is a very fast procedure for generating multivariate random samples that always have exactly the same mean, covariance and Mardia multivariate skewness and kurtosis. This paper investigates how the properties of parametric, data-specific and deterministic ROM simulations are influenced by the choice of orthogonal matrix. Specifically, we consider how cyclic and general permutation matrices alter their time-series properties, and how three classes of rotation matrices - upper Hessenberg. Cayley, and exponential - influence both the unconditional moments of the marginal distributions and the behaviour of skewness when samples are concatenated. We also perform an experiment which demonstrates that parametric ROM simulation can be hundreds of times faster than equivalent Monte Carlo simulation. Crown Copyright (c) 2012 Published by Elsevier B.V. on behalf of IMACS. All rights reserved.

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

computational efficiency
l matrix
random orthogonal matrix (rom)
rotation matrix


Four-dimensional connectivity modelling with application to Australia's north and northwest marine environments We provide open-source software written in Java for performing individual-based marine dispersal simulations. The software is capable of handling volumetric releases over time with three-dimensional flow (3D spacetime) and benthic collision detection. The software is scalable, and was used to simulate over a billion particle objects, which were saved to a database for subsequent analysis. A case study for Australia's north and northwest marine planning regions is presented, using dispersal characteristics of ophiuroids.

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

individual-based model
seascape
australia


scalable subgraph mapping for acyclic computation accelerators Computer architects are constantly faced with the need to improve performance and increase the efficiency of computation in their designs. To this end, it is increasingly common to see acyclic com-putation accelerators appear in embedded processor designs. One major problem with adding accelerators to a design is that it is difficult to generate high-quality code utilizing them. Hand-written assembly code is typical, and if compiler support does exist, it is implemented using only greedy algorithms. In this work, we investigate more thorough techniques for compiling to processors with acyclic accelerators. Where as greedy solutions only explore one possible solution, the techniques presented in this paper explore the entire design space, when possible. Intelligent pruning methods are employed to ensure compilation is both tractable and scalable. Overall, our new compilation algorithms produce code that performs on average 10\%, and up to 32\% better than standard greedy methods. These algorithms also run in less than one second for more than 98\% of basic blocks tested.

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


A unified view on lifetime distributions arising from selection mechanisms In this paper, we formulate a flexible density function from the selection mechanism viewpoint (see, for example, Bayarri and DeGroot (1992) and Arellano-Valle etal. (2006)) which possesses nice biological and physical interpretations. The new density function contains as special cases many models that have been proposed recently in the literature. In constructing this model, we assume that the number of competing causes of the event of interest has a general discrete distribution characterized by its probability generating function. This function has an important role in the selection procedure as well as in computing the conditional personal cure rate. Finally, we illustrate how various models can be deduced as special cases of the proposed model.

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

competing causes
conditional personal cure rate
probability generating function
selection mechanism

conditional personal non-cure rate
survival analysis


computing good nash equilibria in graphical games This paper addresses the problem of fair equilibrium selection in graphical games. Our approach is based on the data structure called the best response policy , which was proposed by Kearns et al. [13] as a way to represent all Nash equilibria of a graphical game. In [9], it was shown that the best response policy has polynomial size as long as the underlying graph is a path. In this paper, we show that if the underlying graph is abounded-degree tree and the best response policy has polynomial size then there is an efficient algorithm which constructs a Nash equilibrium that guarantees certain payoffs to all participants. Another attractive solution concept is a Nash equilibrium that maximizes the social welfare. We show that, while exactly computing the latter is infeasible (we prove that solving this problem may involve algebraic numbers of an arbitrarily high degree), there exists an FPTAS for finding such an equilibrium as long as the best response policy has polynomial size. These two algorithms can be combined to produce Nash equilibria that satisfy various fairness criteria.

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


Robustness analysis and synthesis of a multi-PID controller based on an uncertain multimodel representation This paper presents an effective method for robustness analysis and synthesis of a multi-PID controller for non-linear systems where desirable robustness and performance properties must be maintained across a large range of operating conditions. The robustness analysis problem is solved using an uncertain multimodel of the original non-linear system. The model of uncertainties used is an interval matrix modeled by a stochastic matrix which gives poor conservatism in the analysis of stability robustness. Moreover, the robust stability margin is interpreted as a smallest interval matrix that causes instability. This stability margin is evaluated using a random search algorithm. Simulation studies are used to demonstrate the effectiveness of the proposed method. (c) 2006 Elsevier Ltd. All rights reserved.

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

multimodel
robust stability
random search algorithm

pid controller
multi-pid
parametric uncertainties


Two-Sided Pareto Front Approximations A new approach to derive Pareto front approximations with evolutionary computations is proposed here.

multiobjective optimization
evolutionary algorithms
lower pareto front approximations
upper pareto front approximations


Fuzzy Discrete Event Systems for Multiobjective Control: Framework and Application to Mobile Robot Navigation Fuzzy discrete event systems (FDESs) have been introduced in recent years to model systems whose discrete states or discrete state transitions can be uncertain and are, hence, determined by a possibility degree. This paper develops an FDES framework for the control of sampled data systems that have to fulfill multiple objectives. The choice of a fuzzy system representation is justified by the assumption of a controller realization that depends on various potentially imprecise sensor measurements. The proposed framework consists of three basic steps that are performed at each sampling instant. First, the current fuzzy state of the system is determined by a sensor evaluation. Second, the fuzzy state in the future sampling instant is predicted for all possible control actions of the system. Finally, an original multiobjective weighting strategy is proposed to determine the control action to be applied in the current sampling instant. The features of the proposed approach are demonstrated by a detailed mobile robot example, which includes a simulation study.

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

fuzzy discrete event systems (fdess)
sampled systems


A bio-inspired predictive sensory-motor coordination scheme for robot reaching and preshaping This paper presents a sensory-motor coordination scheme for a robot hand-arm-head system that provides the robot with the capability to reach an object while pre-shaping the fingers to the required grasp configuration and while predicting the tactile image that will be perceived after grasping. A model for sensory-motor coordination derived from studies in humans inspired the development of this scheme. A peculiar feature of this model is the prediction of the tactile image. The implementation of the proposed scheme is based on a neuro-fuzzy module that, after a learning phase, starting from visual data, calculates the position and orientation of the hand for reaching, selects the best-suited hand configuration, and predicts the tactile feedback. The implementation of the scheme on a humanoid robot allowed experimental validation of its effectiveness in robotics and provided perspectives on applications of sensory predictions in robot motor control.

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

predictive control
sensory-motor coordination
robot grasping
robot learning
expected perception
internal models
neuro-fuzzy controllers


Region tracking via level set PDEs without motion computation Tracking regions in an image sequence is a challenging and difficult problem in image processing and computer vision and at the same time, one that has many important applications: automated video surveillance, video database search and retrieval, automated video editing, etc. So far, numerous approaches to region tracking have been proposed. Many of them suffer from excessive constraints imposed on the motion of the region being tracked and need an explicit motion model (e.g., affine, Euclidean). Some, which do not need a parametrized motion model, rely instead on a dense motion field. By and large, most rely on some kind or other of motion information. Those which do not use any motion information instead use a model of the region being tracked, typically by assuming strong intensity boundaries, or constraining the shape of the region to belong to a parametrized family of shapes. In this paper, we propose a novel approach to region tracking that is derived from a Bayesian formulation. The novelty of the approach is twofold: First, no motion field or motion parameters need to be computed. This removes a major burden since accurate motion computation has been and remains a challenging problem and the quality of region tracking algorithms based on motion critically depends on the computed motion fields and parameters. The second novelty of this approach, is that very little a priori information about the region being tracked is used in the algorithm. In particular, unlike numerous tracking algorithms, no assumption is made on the strength of the intensity edges of the boundary of the region being tracked, nor is its shape assumed to be of a certain parametric form. The problem of region tracking is formulated as a Bayesian estimation problem and the resulting tracking algorithm is expressed as a level set partial differential equation. We present further extensions to this partial differential equation, allowing the possibility of including additional information in the tracking process, such as priors on the region's intensity boundaries and we present the details of the numerical implementation. Very promising experimental results are provided using numerous real image sequences with natural object and camera motion.

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

level set equations
image sequence analysis


Standardized terminological services enabling semantic interoperability between distributed and heterogeneous systems ? The interconnection of heterogeneous computer applications in medicine raises the issue of semantic interoperability, going beyond traditional approaches of terminological standardization in basically three aspects. First, the variety of medical vocabularies that currently coexist in different domains is a major barrier for the integration of autonomously developed applications. Fortunately, with the Unified Medical Language System (UMLS) there are machine-readable terminological sources that cover and integrate most of the existing medical vocabularies. Second, the exchanged data need to be processed by a machine for different purposes like patient data integration, access to literature and knowledge bases as well as clinical audit and research. Medical vocabularies provided as passive dictionaries are no longer sufficient. Software system developers should take advantage of terminological services for refining user queries, for mapping the user's terms to appropriate medical vocabularies etc. Third, the services should be accessible uniformly and transparently. In the CORBAmed initiative a proposal for a standardized interface for querying and accessing computerized medical terminology resources was created. Based on the mentioned principles the MUSTANG system (Medical UMLS based Terminology Server for Authoring, Navigating and Guiding the Retrieval to Heterogeneous Knowledge Sources) has been developed. It is implemented on a Windows NT platform using the ORACLE database management and development software. The terminological services are accessible via multiple interfaces. The MUSTANG-System and the experiences with using terminological services in practice are described. Opposed to other levels of standardization like syntactical message standards there is much more a hesitation in the use of standardized terminology.

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

open distributed systems
medical records


Designing robust network topologies for wireless sensor networks in adversarial environments In this paper, we address the problem of deploying sink nodes in a wireless sensor network such that the resulting network topology be robust. In order to measure network robustness, we propose a new metric, called persistence, which better captures the notion of robustness than the widely known connectivity based metrics. We study two variants of the sink deployment problem: sink selection and sink placement. We prove that both problems are NP-hard, and show how the problem of sink placement can be traced back to the problem of sink selection using an optimal search space reduction technique, which may be of independent interest. To solve the problem of sink selection, we propose efficient heuristic algorithms. Finally, we provide experimental results on the performance of our proposed algorithms.

O 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

topology robustness
graph metric
denial-of-service attack
node placement


Wavelet natural boundary element method for the Neumann exterior problem of Stokes equations Natural boundary element approach is a promising method to solve boundary value problems of partial differential equations. This paper addresses the Neumann exterior problem of Stokes equations using the wavelet natural boundary element method. The Stokes exterior problem is reduced into an equivalent Hadamard-singular Natural Integral Equation (NIE). By virtue of the wavelet-Galerkin algorithm, the simple and accurate computational formulae of stiffness matrix are obtained. The 2(J+3) x 2(J+3) stiffness matrix is sparse and determined only by its 2(J) + 3J + 1 entries. It greatly decreases the computational complexity. Also, the condition number of stiffness matrix is O(N), where N is the discrete node number. This indicates that the proposed algorithm is more stable than that of classical finite element method. The error estimates are established for the wavelet-Galerkin approximate solution. Several numerical examples are given to evaluate the performance of our method with encouraging results.

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

stokes equations
wavelet
natural boundary element


computationally sound secrecy proofs by mechanized flow analysis We present a novel approach for proving secrecy properties of security protocols by mechanized flow analysis. In contrast to existing tools for proving secrecy by abstract interpretation, our tool enjoys cryptographic soundness in the strong sense of blackbox reactive simulatability/UC which entails that secrecy properties proven by our tool are automatically guaranteed to hold for secure cryptographic implementations of the analyzed protocol, with respect to the more fine-grained cryptographic secrecy definitions and adversary models.Our tool is capable of reasoning about a comprehensive language for expressing protocols, in particular handling symmetric encryption and asymmetric encryption, and it produces proofs for an unbounded number of sessions in the presence of an active adversary. We have implemented the tool and applied it to a number of common protocols from the literature.

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


Incorporating cognitive aids into decision support systems: the case of the strategy execution process This paper emphasizes the need to support decision makers in their execution of decision-making strategies. In particular, it discusses the specific cognitive requirements of the strategy execution process and uses the insights generated as the conceptual basis from which to guide the design of cognitive aids to be incorporated into decision support technology. The impact of such cognitive aids is then empirically tested. The results indicate that computerized cognitive aids can successfully be designed into DSS to support decision makers' strategy execution process and that such aids have a significant positive impact on both decision-making efficiency and effectiveness.

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

cognitive aids
strategy execution process

decision support system
complexity
feedback


Implicit representation and manipulation of binary decision diagrams This paper presents implicit representation of binary decision diagrams (implicit BDDs) as a new efficient data structure for Boolean functions. A well-known method of representing graphs by binary decision diagrams (BDDs) is applied to BDDs themselves. Namely, it is a BDD representation of BDDs. Regularity in the structure of BDDs representing certain Boolean functions contributes to significant reduction in size of the resulting implicit BDD representation. Since the implicit BDDs also provide canonical forms for Boolean functions, the equivalence of the two implicit BDD forms is decided in time proportional to the representation size. We also show an algorithm to manipulate Boolean functions on this implicit data structure.

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

binary decision diagram (bdd)
representation of boolean functions
logic design verification
logic synthesis
implicit representation of graphs


Provider selection and task allocation issues in networks with different QoS levels and all you can send pricing We investigate an optimization problem a firm faces when acquiring network capacity from multiple providers. We define two types of tasks the firm performs using data networks, and show that the time, bandwidth and quality requirements of each type are quite different. We formulate the associated problem as a cost minimization problem subject to quality and capacity requirements and offer multiple solution approaches. We analyze how different prices, quality and task distribution affect the optimal behavior of the firm. We also implement Generalized Bender's Decomposition to solve a relaxation of this problem in order to obtain a tight lower bound.

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

quality of service
sourcing
telecommunications
generalized bender's decomposition
bin packing


Bayesian sampling plans for exponential distribution based on uniform random censored data The problem of a single sampling plan with polynomial loss for the exponential distribution based on uniformly distributed random censored data has been considered. A Bayes sampling plan is derived under various schemes of censoring time. It is specially focused on a quadratic loss and an unit time cost is included in the loss. Some optimal Bayes solutions are tabulated and some numerical comparisons between the proposed plan and a known plan under special loss are also made. It is shown that the optimal solutions of the known plan are not Bayes in general.

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

exponential population
uniform random censoring


Policy for cryptography in healthcare a view from the NHS Effective security arrangements, which both protect and assure those information assets of healthcare providers, doctors and patients, are fundamental requirements in a modern electronic healthcare culture. At the heart of healthcare information systems in future will be those infrastructure components and services, which underpin the principles of confidentiality, integrity and availability. Before embarking upon any major implementation of cryptographic support services, there are a number of critical policy issues, which must first be considered and addressed. To address these successfully will maximise the potential values of these services and facilities to their users on a broad front. A primary consideration for all information security projects, is the need to establish clear scope and objectives for the security services to be implemented. When considering the policy, scope and design implications of a large scale cryptography programme, a number of external issues also need to be considered not least of which are the legal liabilities, implications and obligations of the country or countries where the system(s) will operate. Where such legislation exists, regulatory arrangements may potentially influence how secure information sharing across international healthcare boundaries can be achieved.

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

cryptographic support services
policy issues

electronic communication bill
regulation of investigatory powers bill
encryption programme board


Game theoretic design for polarimetric MIMO radar target detection ? Polarimetric radar systems allow the flexibility of transmitting arbitrarily polarized waveforms that match the scattering profiles of the target. Since different types of targets have varying profiles, the advantages of a polarimetric radar system can fully be exploited only when the type of target is accurately estimated. However, accurate estimation requires a significant amount of training data, which can be expensive. We propose a polarimetric design scheme for distributed multiple input multiple output (MIMO) radar target detection. We formulate the selection of transmit polarizations using a game theoretic framework by examining the impact of all possible transmit schemes on the detection performance with different available target profiles (see also Gogineni and Nehorai, 2011 [1]). This approach does not require training data, and we show a significant performance improvement due to the polarimetric design. Other radar design problems can also be solved using this game theoretic approach.

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

game theory
multiple input multiple output (mimo)
polarimetry


Analysis of Nonstationary Stochastic Simulations Using Classical Time-Series Models This article extends the use of classical autoregressive and moving average time-series models to the analysis of a variety of nonstationary discrete-event simulations. A thorough experimental evaluation shows that integrated and seasonal time-series models constitute very promising metamodels, especially for analyzing queueing system simulations under congested or cyclical traffic conditions. In some situations, stationarity-inducing transformations may be required before this methodology can be used. Our approach for efficient estimation of meaningful performance measures of selected responses in the target system is illustrated using a set of case studies taken from the simulation literature.

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

discrete-event simulation
output analysis
simulation metamodels
time-series models


Decisional DNA for modeling and reuse of experiential clinical assessments in breast cancer diagnosis and treatment Clinical Decision Support Systems (CDSS) are active knowledge resources that use patient data to generate case specific advice. The fast pace of change of clinical knowledge imposes to CDSS the continuous update of the domain knowledge and decision criteria. Traditional approaches require costly tedious manual maintenance of the CDSS knowledge bases and repositories. Often, such an effort cannot be assumed by medical teams, hence maintenance is often faulty. In this paper, we propose a (semi-)automatic update process of the underlying knowledge bases and decision criteria of CDSS, following a learning paradigm based on previous experiences, such as the continuous learning that clinicians carry out in real life. In this process clinical decisional events are acquired and formalized inside the system by the use of the SOEKS and Decisional DNA experiential knowledge representation techniques. We propose three algorithms processing clinical experience to: (a) provide a weighting of the different decision criteria, (b) obtain their fine-tuning, and (c) achieve the formalization of new decision criteria. Finally, we present an implementation instance of a CDSS for the domain of breast cancer diagnosis and treatment.

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

decisional dna
clinical decision support systems
breast cancer diagnosis and treatment

set of experience knowledge structure
semantic technologies


how many candidates are needed to make elections hard to manipulate? In multiagent settings where the agents have different preferences, preference aggregation is a central issue. Voting is a general method for preference aggregation, but seminal results have shown that all general voting protocols are manipulable. One could try to avoid manipulation by using voting protocols where determining a beneficial manipulation is hard computationally. The complexity of manipulating realistic elections where the number of candidates is a small constant was recently studied [4], but the emphasis was on the question of whether or not a protocol becomes hard to manipulate for some constant number of candidates. That work, in many cases, left open the question: How many candidates are needed to make elections hard to manipulate? This is a crucial question when comparing the relative manipulability of different voting protocols. In this paper we answer that question for the voting protocols of the earlier study: plurality, Borda, STV, Copeland, maximin, regular cup, and randomized cup . We also answer that question for two voting protocols for which no results on the complexity of manipulation have been derived before: veto and plurality with runoff . It turns out that the voting protocols under study become hard to manipulate at 3 candidates, 4 candidates, 7 candidates, or never.

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

general complexity manipulation method paper voting preference


Variable frame skipping scheme based on estimated quality of non-coded frames at decoder for real-time video coding This paper proposes a block-based video encoder employing variable frame skipping (VFS) to improve the video quality in low bit rate channel. The basic idea of VFS mechanism is to decide and skip a suitable, non-fixed number of frames in temporal domain to reduce bit usage. The saved bits can be allocated to enhance the spatial quality of video. In literature, several methods of frame skipping decision have been proposed, but most of them only consider the similarities between neighboring coded frames as the decision criteria. Our proposed method takes into account the reconstruction of the skipped frames using motion-compensated frame interpolation at decoder. The proposed VFS models the reconstructed objective quality of the skipped frame and, therefore, can provide a fast estimate to the frame skipping at encoder. The proposed VFS can determine the suitable frame skipping in real time and provide the encoded video with better spatial-temporal bit allocation.

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

frame rate restoration
spatial-temporal rate control


Mobility evaluation of wheeled all-terrain robots Standardized performance evaluation is uncommon in mobile robotics. Therefore, it is difficult to compare published results and estimate their value. This work aims at providing a basis for the evaluation and comparison of the mobility performance of wheeled, all-terrain robots with respect to terrainability. Precisely defined existing and novel metrics are proposed for this purpose. The utility of these metrics is shown by applying them in a comparison to a selection of rover suspension systems known from the literature. Appropriate models for evaluation of the performance are described as well as the validation of the metrics by means of experimental testing. The simulations reveal significant differences in performance between the rovers which is confirmed by the test results. The correlation of the performance in simulation and reality is highly satisfying and supports the applicability of the proposed metrics.

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

mobility metrics
experimental validation
space rovers
locomotion


resolution of haplotypes and haplotype frequencies from snp genotypes of pooled samples Recent efforts to characterize genetic variation indicate that humans share large chromosomal blocks, along which little to no recombination is observable. Thus, on a segment-by-segment basis, only a handful of haplotypes account for most human genotypes. Currently, the challenge of registering haplotypes and their frequencies is met by genotyping individuals one by one, a process which is overall resource intensive. Instead, we propose utilizing the ability of current genotyping technologies to pool DNA samples and output allele frequencies of SNP markers. We enable inference of haplotypes and haplotype frequencies from such pooled data, by novel computational methods. This strategy harnesses the economics of pooling for the task of haplotyping, potentially offering a 10-20-fold saving in genotyping reactions performed.We show that a small number of pools can be used to accurately and cost-effectively reconstruct a haplotype block and determine haplotype frequencies.

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


ForgetMeNot: What and how users expect intelligent virtual agents to recall and forget personal conversational content ? Our study involved interaction with a remembering and forgetting virtual real estate agent over three sessions. Content remembered or forgotten included social and task-related information personal to the user. Recall was found to increase enjoyment, believability and trust over the three sessions. Partial or complete forgetting was found to be more natural and preferable to incorrect recall.

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


A systemic framework and analysis of urban water energy Defines boundaries for the water-energy system. Creates a framework for consistent analysis and management. Clarifies how models address parts of the energy effect of the water system. Quantifies water-related energy across multiple boundaries.

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

integrated
infrastructure
metabolism
decision support
business case


An efficient scan tree design for compact test pattern set Tree-based scan path architectures have recently been suggested for reducing test application time or test data volume in today's high-density very large scale integrated circuits. However, these techniques strongly rely on the existence of a large number of compatible sets of flip-flops under the given test set and therefore may not be suitable for a highly compact test set generated by an efficient automatic test pattern generator tool. Tree-based architectures also suffer from loss of fault coverage while achieving a significant reduction ratio for test time or data. In this paper, to circumvent this problem, a new two-pass hybrid method is proposed to design an efficient scan tree architecture based on approximate compatibility. The method is particularly suitable for a highly compact test set having fewer don't cares and low compatibility. Finally, to reduce the volume of scan-out data, test responses shifted out from the leaf nodes' of the scan tree are compacted by a space compactor, which is designed specially for the proposed scan tree architecture. The compactor uses an XOR tree, and its overhead is low. The design thus offers a solution to both test data and response compaction. Experimental results on various benchmark circuits demonstrate that the proposed algorithm outperforms the earlier methods in reducing test application time significantly without degrading fault coverage.

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

design-for-testability
space compaction
stuck-at faults
testing
very large scale integration


Are isophotes and reflection lines the same? Isophotes and reflection lines are standard tools for surface interrogation. We study the correlations between them. We show that isophotes and reflection lines are different (but not disjunct) classes of surface curves. Furthermore we introduce the concept of reflection circles as a generalization of isophotes and reflection lines. Reflection circles can be considered as the mirror images of a family of concentric circles on the surface. We show that reflection circles contain both isophotes and reflection lines as special cases. (C) 2001 Elsevier Science B.V. All rights reserved.

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

surface interrogation
isophotes
reflection lines


Typed generic traversal with term rewriting strategies A typed model of strategic term rewriting is developed. The key innovation is that generic traversal is covered. To this end, we define a typed rewriting calculus S'(gamma). The calculus employs a many-sorted type system extended by designated generic strategy types gamma. We consider two generic strategy types, namely the types of type-preserving and type-unifying strategies. S'(gamma) offers traversal combinators to construct traversals or schemes thereof from many-sorted-and generic strategies. The traversal combinators model different forms of one-step traversal, that is, they process the immediate subterms of a given term without anticipating any scheme of recursion into terms. To inhabit generic types, we need to add a fundamental combinator to lift a many-sorted strategy s to a generic type gamma. This step is called strategy extension. The semantics of the corresponding combinator states that s is only applied if the type of the term at hand fits, otherwise the extended strategy fails. This approach dictates that the semantics of strategy application must be type-dependent to a certain extent. Typed strategic term rewriting with coverage of generic term traversal is a simple but expressive model of generic programming. It has applications in program transformation and program analysis. (C) 2002 Elsevier Science Inc. All rights reserved.

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

term rewriting
strategies
generic programming
traversal
program transformation


Effect of spool side chambers on dynamic response of contactless electro-operated pneumatic directional control valve The synchronization of feeding paper drums in the offset printing machines are carefully design. The actuators themselves are controlled by a contactless electro-operated pneumatic directional control valve (EOPDCV). In this paper, a mathematical model for the double acting pneumatic actuator controlled by EOPDCV has been developed. Such these drums are controlled through a series of actuators to produce the appreciated speed necessary to perform the printing job accurately. Effect of the valve spool side chambers ratio of the EOPDCV on the pneumatic actuators and the EOPDCV dynamic performances was introduced. Experimental setup has been conducted to study the actuator inlet pressure for EOPDCV operating conditions. The mathematical model was validated by the results from the mathematical test rig and a good agreement has been achieved. The mathematical results showed that the valve spool side chambers volume ratio (V*) has a significant effect on the dynamic response of the actuator and hence, the timing of paper feeding in the printing machine. By comparing experimental and mathematical results, it has been found that the designed dynamic performance of the pneumatic system under study is at (V-x = 0.6). (C) 2013 Elsevier Ltd. All rights reserved.

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

valve spool side chamber
side chamber ratio
electro-operated pneumatic dcv
contact less dcv
pneumatic dcv


Novel 'hybrid' classification method employing Bayesian networks Standard statistical discriminant analysis techniques inherently make assumptions about underlying class structures in data, limiting their validity and effectiveness. Other classification methods, such as soft independent modeling of class analogy (SIMCA) or artificial neural networks, replace the disadvantage of making such assumptions with an equally impeding lack of interpretability. The intention of this work was to formulate a classification scheme that avoids these and other obstacles. A new classification technique has been designed that combines the recursive partitioning feature of tree-based classifiers (e.g. classification and regression trees (CART)) with the probabilistic reasoning of Bayesian networks. The proposed hybrid approach benefits from all the advantages of tree-based classifiers and Bayesian networks without experiencing the usual limitations associated with these methods individually. The resulting classifier outperformed several standard methods and has the added benefits of being both statistically and semantically justifiable. Copyright (C) 1999 John Wiley & Sons, Ltd.

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


distributed fault detection of wireless sensor networks Wireless Sensor Networks (WSNs) have become a new information collection and monitoring solution for a variety of applications. Faults occurring to sensor nodes are common due to the sensor device itself and the harsh environment where the sensor nodes are deployed. In order to ensure the network quality of service it is necessary for the WSN to be able to detect the faults and take actions to avoid further degradation of the service. The goal of this paper is to locate the faulty sensors in the wireless sensor networks. We propose and evaluate a localized fault detection algorithm to identify the faulty sensors. The implementation complexity of the algorithm is low and the probability of correct diagnosis is very high even in the existence of large fault sets. Simulation results show the algorithm can clearly identify the faulty sensors with high accuracy.

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


theoretical analysis of gate level information flow tracking Understanding the flow of information is an important aspect in computer security. There has been a recent move towards tracking information in hardware and understanding the flow of individual bits through Boolean functions. Such gate level information flow tracking (GLIFT) provides a precise understanding of all flows of information. This paper presents a theoretical analysis of GLIFT. It formalizes the problem, provides fundamental definitions and properties, introduces precise symbolic representations of the GLIFT logic for basic Boolean functions, and gives analytic and quantitative analysis of the GLIFT logic.

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


3D-QSAR analysis of cycloguanil derivatives as inhibitors of A16V+S108T mutant Plasmodium falciparum dihydrofolate reductase enzyme A three-dimensional quantitative structureactivity relationship (3D-QSAR) study was carried out on cycloguanil derivatives which are reported as growth inhibitors of Plasmodium falciparum clone (T9/94 RC17) which harbors A16V+S108T mutant dihydrofolate reductase (DHFR) enzyme. Comparative of Molecular Field Analysis (CoMFA) and Comparative of Molecular Similarity Indices Analysis (CoMSIA) were carried out to investigate the structural requirements for the activities of these compounds and to derive predictive models that may be used for designing novel PfDHFR enzyme inhibitors. The global minimum energy (within the search space) conformation of the most active compound (38) was obtained by using simulated annealing, and was subsequently used as a template to build the structures of the rest molecules used in the study. The CoMFA model gave statistically significant results with r cv 2 and r ncv 2 values of 0.654 and 0.951, respectively. The combination of steric, electrostatic and hydrophobic fields resulted in the best CoMSIA model with r cv 2 and r ncv 2 values of 0.669 and 0.907, respectively. The predictive abilities of the CoMFA and CoMSIA models were also evaluated using test compounds which gave r pred 2 values of 0.735 and 0.557, respectively. The results of bootstrapping analyses also confirmed that the generated models are robust and reliable. The models were graphically interpreted using CoMFA and CoMSIA contour plots. The structural regions responsible for the differences in anti-plasmodial activities were analyzed with respect to their electrostatic, steric and hydrophobic nature. The results obtained from this study could be used for rational design of potent inhibitors against A16V+S108T mutant PfDHFR enzyme.

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


Topological and Physicochemical Characteristics of 1,2,3,4-Tetrahydro-acridin-9(10H)-Ones and Their Antimalarial Profiles: A Composite Insight to the Structure-Activity Relation The study reports the QSAR rationales from multilateral approaches for the antimalarial activities (against W2 and TM90-C2B strains of Plasmodium falciparum) and physical properties (aqueous solubility, permeability and logD) of 1,2,3,4-tetrahydroacridin-9(10H)-one (THA) derivatives. A modification to Free-Wilson matrix (parameter set) is introduced to improve the compound to parameter ratio of the analysis carried out in the study. The models from modified Free-Wilson and physicochemical parameters suggest that 5th (R1) and 8th (R4) positions of THA scaffold should be free from substitution for the antimalarial activity against both the strains. The THA's 6th (R2) and 7th (R3) positions' substituents with a blend of hydrophobicity and polarity offer scope to modulate the activities of these compounds. The substituent group contributions derived here gives opportunity to examine various combinations possible from these analogues. The models from the topological and other structural indices has suggested that MLOGP, LP1 and JGI6 as three common important features for activity against W2 and TM90 strains. The topological indices participated in the models suggested a preference for longer path lengths in molecules for better activity against both strains. The PLS analysis of the descriptors identified in the feature selection approach, combinatorial protocol in multiple linear regression (CP-MLR), has suggested that MATS3e and nRORPh are best suited to modulate the W2 activity, and Me, T(S..F) and ARR are best suited to modulate the TM90 activity. In these derivatives the analysis of aqueous solubility, permeability and logD has suggested that most of the R1 and R4 substituents have contributed with same arithmetic sign to theses properties. For all other variations in these compounds, the permeability increased with increasing logD and decreased with increasing aqueous solubility. The results suggest ways for the activity-property modulation in these analogues.

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

1,2,3,4-tetrahydroacridin-9(10h)-ones
antimalarials
cp-mlr
modified free wilson analysis
topological descriptors


Design of ternary D flip-flop with pre-set and pre-reset functions based on resonant tunneling diode literal circuit The problems existing in the binary logic system and the advantages of multiple-valued logic (MVL) are introduced. A literal circuit with three-track-output structure is created based on resonant tunneling diodes (RTDs) and it has the most basic memory function. A ternary RTD D flip-flop with pre-set and pre-reset functions is also designed, the key module of which is the RTD literal circuit. Two types of output structure of the ternary RTD D flip-flop are optional: one is three-track and the other is single-track; these two structures can be transformed conveniently by merely adding tri-valued RTD NAND, NOR, and inverter units after the three-track output. The design is verified by simulation. Ternary flip-flop consists of an RTD literal circuit and it not only is easy to understand and implement but also provides a solution for the algebraic interface between the multiple-valued logic and the binary logic. The method can also be used for design of other types of multiple-valued RTD flip-flop circuits.

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

resonant tunneling diode (rtd)
ternary logic
d flip-flop


Scalable VLSI architecture for variable block size integer motion estimation in H.264/AVC Because of the data correlation in the motion estimation (ME) algorithm of H.264/AVC reference software, it is difficult to implement an efficient ME hardware architecture. In order to make parallel processing feasible, four modified hardware friendly ME workflows are proposed in this paper. Based on these workflows, a scalable full search ME architecture is presented, which has following characteristics: (1) The sum of absolute differences (SAD) results of 4 x 4 sub-blocks is accumulated and reused to calculate SADs of bigger sub-blocks. (2) The number of PE groups is configurable. For a search range of MxN pixels, where M is width and N is height, up to M PE groups can be configured to work in parallel with a peak processing speed of N x 16 clock cycles to fulfill a full search variable block size ME (VBSME). (3) Only conventional single port SRAM is required, which makes this architecture suitable for standard-cell-based implementation. A design with 8 PE groups has been realized with TSMC 0.18 mu m CMOS technology. The core area is 2.13 mm x 1.60 mm and clock frequency is 228 MHz in typical condition (1.8 V, 25 degrees C).

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

variable block size motion estimation (vbsme)

very large scale integration (vlsi) architecture


How experience-driven community identification generates trust and engagement Purpose - The purpose of this paper is to develop a conceptual model of how technology-enabled virtual experiences contribute to community members' online trust and engagement through inducing their community identification. It also seeks to examine two types of social influence in the virtual community: within-community normative pressure and normative pressure from outside the community. Design/methodology/approach - The authors employed the structural equation modelling approach to estimate a conceptual model using survey data from participants in the World of Warcraft online game community. Findings - The results mainly supported the hypotheses. It was shown that three types of experience could influence community members' engaging behaviour through an increase in community identification and community trust. More importantly it was found that normative pressure from outside the community exhibits a significant and inverted U-shaped relationship with online community engagement, while within-community normative pressure had a positive relationship with community engagement. No evidence was found to support the inverted U-shaped relationship between within-community normative pressure and community members' engagement. Originality/value - From perspectives of virtual experience, social identity theory, social trust, and susceptibility to normative influence, the current study contributes to a more comprehensive understanding of the process through which community members are willing to share what they know, participate in collective actions, and spend their time with strangers in a virtual space.

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

online community
virtual experience
community identification
trust
engagement
normative pressure


HMIPv6-BI: A Proposal to Improve the Bandwidth of the Radio Channel in HMIPv6 Networks Our approach called HMIPv6-BI proposes a modification to the Hierarchical Mobile IPv6 protocol in order to reduce the use of bandwidth in the radio link between AR and MN. HMIPv6 establishing a tunnel between MAP and MN, which leads to tunnel headers traveling by air interface, leading to greater use of the channel. With HMIPv6-BI improves the situation. In addition to significantly reducing the bandwidth of the radio channel, HMIPv6-BI allows the use of multicast tunnels to reduce the handover latency. The HMIPv6-BI analysis shows favorable results, when is compared with the standard approach. These results are compared with NS-2 simulations.

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

hierarchical mobile ipv6
hmipv6
handover


Novel UWB miniaturized integrated antenna based on CRLH metamaterial transmission lines This article presents a novel ultra-wideband (UWB) miniaturized integrated antenna based on composite right/left-handed (CRLH) metamaterial (MTM) transmission lines (TLs). The antenna design is based on implementing the new inductive and capacitive components such as the spiral and rectangular inductors along with the metallic via holes and the engraved L and T-shaped slits that are constructed by the MTM technology and the standard manufacturing techniques on the engraved circuit board (ECB). With applying the proposed methods for designing the aforementioned components with proper and tuned dimensions the desirable specifications, i.e. size reduction, bandwidth extension and good radiation properties are provided. The antenna physical size is 22.6mm5.8mm0.8mm or 0.037?00.009?00.001?0 in terms of free space wavelengths at f=0.5GHz. The proposed structure covers the measured frequency bandwidth (S11<?10dB) from 0.5GHz to 11.3GHz for VSWR<2, which corresponds to 183% practical bandwidth. Also, the measured radiation gains and efficiencies of the antenna at 0.5, 3, 5, 8 and 11.3GHz are 1.5dBi and 20%, 3.4dBi and 45%, 4.8dBi and 57%, 6.5dBi and 88%, and 5.7dBi and 73%, respectively. Main features of the fabricated antenna are unidirectional radiation patterns, low cost, light weight, low profile, simple constructing and compatibility and ease of integration with electronic devices.

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

composite right/left-handed metamaterial transmission line (crlh mtm-tl)


Yet Another Map Algebra This paper describes features of a language approach for map algebra based on the use of algebraic expressions that satisfy a concise formalism. To be consistent with formal approaches such as geoalgebra and image algebra, the proposed algebraic expressions are suitable not only for the usual modeling of layers but also to describe variable neighborhoods and zones. As a compromise between language and implementation issues we present an implementation strategy based on the theory of automata. The result is an efficient way of implementing map algebra that simplifies its use on environmental and dynamic models without going too far from its well-known paradigm.

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

cartographic modeling
spatial analysis
formal languages
dynamic modeling


A 0.52 ppm/A degrees C high-order temperature-compensated voltage reference This paper proposed a new high-order curvature compensation technique for a new bandgap voltage reference structure using the temperature characteristics of current gain beta and emitter bandgap narrowing factor Delta E (G) of a lateral NPN bipolar transistor. The new structure can produce two voltage references, which are 1.209 and 2.418 V, respectively. The simulation results show that the temperature coefficients of the two output voltage are 0.52 ppm/A degrees C, the PSRR is more than 60 dB for frequencies at 10 kHz, and the circuit dissipates 0.18 mW with 5-V supply.

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

curvature compensation
bandgap voltage reference
current gain
emitter bandgap narrowing factor


visualization and clustering of crowd video content in mpca subspace This paper presents a novel approach for the visualization and clustering of crowd video contents by using multilinear principal component analysis (MPCA). In contrast to feature-point-based approach and frame-based dimensionality reduction approach, the proposed method maps each short video segment to a point in MPCA subspace to take temporal information into account naturally through tensorial representations. Specifically, MPCA projects each short segment of a video to a low-dimensional tensor first. A few MPCA features are then selected according to the variance captured as the final representation. Thus, a video is visualized as a trajectory in MPCA subspace. The trajectory generated enables visual interpretation of video content in a compact space as well as visual clustering of video events. The proposed method is evaluated on the PETS 2009 datasets through comparison with three existing methods for video visualization. The MPCA visualization shows superior performance in clustering segments of the same event as well as identifying the transitions between events.

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


Conjoint analysis for intellectual property education As the knowledge economy rapidly increases, intangible assets are more valuable to businesses and valuing them attracts much research from the field of technology management. Intangible assets include intellectual capital and intellectual property. To ensure that science students have the skills that match the information resources they will use as professionals, patent searching must become part of their information literacy instruction. This article is to design guidelines for intellectual property (IP) education from the perspective of the researchers and employees in university, private and public institution researchers and others. Applying conjoint analysis, this study shows not only the relative importance of the attributes related to IP education but also the most important conditions of the education. It is expected that this study may help to develop IP curricula in academia in Korea and elsewhere.

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

intellectual property education
conjoint analysis