The

VENUS/NWChem

software

package.

Tight

coupling

between

chemical

dynamics

simulations

and

electronic

structure

theory

The

interface

for

VENUS

and

NWChem,

and

the

resulting

software

package

for

direct

dynamics

simulations

are

described.

The

coupling

of

the

two

codes

is

considered

to

be

a

tight

coupling

since

the

two

codes

are

compiled

and

linked

together

and

act

as

one

executable

with

data

being

passed

between

the

two

codes

through

routine

calls.

The

advantages

of

this

type

of

coupling

are

discussed.

The

interface

has

been

designed

to

have

as

little

interference

as

possible

with

the

core

codes

of

both

VENUS

and

NWChem.

VENUS

is

the

code

that

propagates

the

direct

dynamics

trajectories

and,

therefore,

is

the

program

that

drives

the

overall

execution

of

VENUS/NWChem.

VENUS

has

remained

an

essentially

sequential

code,

which

uses

the

highly

parallel

structure

of

NWChem.

Subroutines

of

the

interface

that

accomplish

the

data

transmission

and

communication

between

the

two

computer

programs

are

described.

Recent

examples

of

the

use

of

VENUS/NWChem

for

direct

dynamics

simulations

are

summarized.

Program

title:

VENUS/NWChem

Catalogue

identifier:

Program

summary

Program

obtainable

from:

CPC

Program

Library,

Queens

University,

Belfast,

N.

Ireland

Licensing

provisions:

Open

Source

Educational

Community

License

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

C

in

NWChem,

MPI.

Computer:

All

Linux

based

workstations

and

parallel

supercomputers.

Operating

system:

Linux.

Has

the

code

been

vectorized

or

parallelized?:

Venus

is

a

sequential

code;

NWChem

can

run

in

parallel.

Classification:

Direct

dynamics

simulations

play

an

important

role

in

investigating

and

understanding

atomic-level

chemical

dynamics

information

such

as

atomistic

reaction

mechanisms,

unimolecular

and

bimolecular

rate

constants,

intramolecular

vibrational

energy

redistribution

rates,

etc.

The

ability

to

couple

direct

dynamics

with

electronic

structure

methods

brings

a

level

of

fidelity

to

the

simulations

that

is

important

for

complex

systems.

However,

a

tight

coupling

between

two

codes

that

have

their

own

development

teams

and

schedules

can

be

challenging.

Solution

method:

The

VENUS/NWChem

interface

is

designed

to

link

the

general

electronic

structure

program

(NWChem)

and

classical

chemical

dynamics

simulation

program

(VENUS)

to

perform

direct

dynamics

simulation

in

which

the

trajectories

on

the

fly

with

the

potential

and

its

derivatives

obtained

directly

from

electronic

structure

theory.

One

of

the

design

goals

is

to

build

interfaces

that

require

as

little

interference

in

NWChem

and

VENUS

as

possible

so

that

each

of

the

code

developments

can

continue

independently.

This

is

especially

important

since

VENUS

is

currently

a

sequential

code

and

NWChem

is

a

parallel

code

and

being

able

to

compute

the

energies,

gradients,

and

Hessian

in

parallel

is

an

important

aspect

of

making

the

software

useful

to

users.

In

this

manuscript,

the

tight

coupling

interface

between

the

two

codes

is

described

and

examples

of

its

use

are

given.

In

the

classical

chemical

dynamics

simulation

an

ensemble

of

trajectories

is

calculated,

and

the

initial

sampling

represents

the

conditions

of

the

reactants

for

the

chemical

reaction

under

investigation.

Each

trajectory

is

evaluated

by

numerically

integrating

either

Hamiltons

or

Newtons

equations

of

motion.

The

Schrdinger

equation

is

solved

and

the

energy

and

energy

gradient

are

calculated

in

the

electronic

structure

program

(NWChem),

and

this

information

is

passed

to

the

classical

trajectory

program

(VENUS)

to

solve

the

equations

of

motion.

Additional

comments:

Full

documentation

is

provided

in

the

distribution

file.

This

includes

a

README

file

giving

the

names

and

brief

description

of

all

the

files

that

make

up

the

package

and

instructions

on

the

installation

and

execution

of

the

program.

Sample

input

and

output

data

for

test

run

will

also

be

provided.

The

software

is

free

to

download

and

use

once

a

signed

license

agreement

has

been

received.

The

agreement

will

be

displayed

when

the

program

is

requested.

Running

time:

The

running

time

depends

on

the

size

of

the

chemical

system,

simulation

time,

complexity

of

the

ab

initio

method

and

number

of

CPUs.

The

ab

initio

method

is

the

most

time

consuming

part

of

each

step

in

the

calculations

and

scaling

for

different

types

of

systems

and

levels

of

theory

is

available

in

Valiev

etal.

Again,

there

are

many

factors

that

affect

the

running

time

for

the

full

simulation

and

it

can

range

from

several

hours

for

simulations

of

a

few

atoms

with

DFT

and

a

small

basis

set

running

on

a

single

compute

node

to

several

days

for

the

simulation

of

tens

of

heavy

atoms

with

larger

basis

set

running

parallel.

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

classical trajectories
molecular simulation


Alan Turing and the development of Artificial Intelligence During the centennial year of his birth Alan Turing (1912-1954) has been widely celebrated as having laid the foundations for Computer Science, Automated Decryption, Systems Biology and the Turing Test. In this paper we investigate Turing's motivations and expectations for the development of Machine Intelligence, as expressed in his 1950 article in Mind. We show that many of the trends and developments within AI over the last 50 years were foreseen in this foundational paper. In particular, Turing not only describes the use of Computational Logic but also the necessity for the development of Machine Learning in order to achieve human-level AI within a 50 year time-frame. His description of the Child Machine (a machine which learns like an infant) dominates the closing section of the paper, in which he provides suggestions for how AI might be achieved. Turing discusses three alternative suggestions which can be characterised as: (1) AI by programming, (2) AI by ab initio machine learning and (3) AI using logic, probabilities, learning and background knowledge. He argues that there are inevitable limitations in the first two approaches and recommends the third as the most promising. We compare Turing's three alternatives to developments within AI, and conclude with a discussion of some of the unresolved challenges he posed within the paper.

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

alan turing
artificial intelligence
machine intelligence


Discovering frequent user--environment interactions in intelligent environments Intelligent Environments are expected to act proactively, anticipating the users needs and preferences. To do that, the environment must somehow obtain knowledge of those need and preferences, but unlike current computing systems, in Intelligent Environments, the user ideally should be released from the burden of providing information or programming any device as much as possible. Therefore, automated learning of a users most common behaviors becomes an important step towards allowing an environment to provide highly personalized services. In this article, we present a system that takes information collected by sensors as a starting point and then discovers frequent relationships between actions carried out by the user. The algorithm developed to discover such patterns is supported by a language to represent those patterns and a system of interaction that provides the user the option to fine tune their preferences in a natural way, just by speaking to the system.

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

ambient intelligence
pattern learning
machine learning techniques


A tri-level programming model based on Conditional Value-at-Risk for three-stage supply chain management For the problem of supply chain management, the existing literature mainly focuses on the research of the single-stage supply chain or the two-stage supply chain that consists of a manufacturer and a retailer. To our best knowledge, little attention has been paid to the study of a more extensive supply chain that consists of a material supplier, a manufacturer and a retailer, which is a more practical and interesting case. Therefore, based on the Conditional Value-at-Risk (CVaR) measure of risk management, this paper proposes a tri-level programming model for the three-stage supply chain management. In this model, the material supplier and the manufacturer maximize their own profit while the retailer maximize his/her CVaR of expected profit. Further, we show that the proposed tri-level programming model can be transferred into a bilevel programming model, which can be solved by the existing methods. Numerical results show that the proposed model is efficient for improving the risk management of the three-stage supply chain. (C) 2013 Elsevier Ltd. All rights reserved.

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

conditional value-at-risk (cvar)
tr-level programming
newsvendor problem


A Combination Approach to Web User Profiling In this article, we study the problem of Web user profiling, which is aimed at finding, extracting, and fusing the "semantic"-based user profile from the Web. Previously, Web user profiling was often undertaken by creating a list of keywords for the user, which is (sometimes even highly) insufficient for main applications. This article formalizes the profiling problem as several subtasks: profile extraction, profile integration, and user interest discovery. We propose a combination approach to deal with the profiling tasks. Specifically, we employ a classification model to identify relevant documents for a user from the Web and propose a Tree-Structured Conditional Random Fields (TCRF) to extract the profile information from the identified documents; we propose a unified probabilistic model to deal with the name ambiguity problem (several users with the same name) when integrating the profile information extracted from different sources; finally, we use a probabilistic topic model to model the extracted user profiles, and construct the user interest model. Experimental results on an online system show that the combination approach to different profiling tasks clearly outperforms several baseline methods. The extracted profiles have been applied to expert finding, an important application on the Web. Experiments show that the accuracy of expert finding can be improved (ranging from +6% to +26% in terms of MAP) by taking advantage of the profiles.

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

information extraction
name disambiguation
topic modeling
social network
text mining


a cs1 maze lab, using joysticks and mippets We are designing a number of programming projects which utilize input/output devices, such as joysticks or a homebrewed board we call a MIPPET (Module for Input/Output Programming Projects Enhancing Teaching). These projects have been used or will be used in the closed labs of our CS1 course (taught in C++). The goal of these projects is to enhance student comprehension (by teaching objects with "real" objects) and student motivation (by providing "fun" projects). This paper focuses on an early project, where the student's program provides support for a human solving a maze.

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


Difference sphere: An approach to near light source estimation We present a novel approach for estimating light sources from a single image of a scene that is illuminated by major near point light sources, a few directional light sources and ambient light. We propose to employ a pair of reference spheres as light probes and introduce the difference sphere that we acquire by differencing the intensities of two image regions of the reference spheres. Because the effect by directional light sources and ambient light is eliminated by differencing, the key advantage of considering the difference sphere is that it enables us to identify near point light sources including their radiant intensities. We also show that analysis of gray level contours on spherical surfaces facilitates separate identification of multiple combined light sources and is well suited to the difference sphere. We demonstrate the effectiveness of the entire algorithm with experimental results while also investigating the applicability to an open scanner in indoor scene.

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

difference sphere
near light source
open scanner


Nonlinear fuzzy control of a fed-batch reactor for penicillin production The process of penicillin production is characterized by nonlinearities and parameter uncertainties that make it difficult to control. In the paper the development and testing of a multivariable fuzzy control system that makes use of type-2 fuzzy sets for the control of pH and temperature are described. The performance of the type-2 fuzzy logic control system (T2FLCS) is compared by simulation with that of a type-1 fuzzy logic control system (T1FLCS) and that of a control system with traditional proportional-integral-derivative (PID) controllers proposed in the literature. The fuzzy controllers are optimized using an ANFIS algorithm. The best results are obtained with the T2FLCS particularly when uncertainties are present in the control system. (C) 2011 Elsevier Ltd. All rights reserved.

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

fed-batch fermentor
non-linear systems
uncertainty
type-2 fuzzy logic controller


recognizing gaze aversion gestures in embodied conversational discourse Eye gaze offers several key cues regarding conversational discourse during face-to-face interaction between people. While a large body of research results exist to document the use of gaze in human-to-human interaction, and in animating realistic embodied avatars, recognition of conversational eye gestures - distinct eye movement patterns relevant to discourse - has received less attention. We analyze eye gestures during interaction with an animated embodied agent and propose a non-intrusive vision-based approach to estimate eye gaze and recognize eye gestures. In our user study, human participants avert their gaze (i.e. with "look-away" or "thinking" gestures) during periods of cognitive load. Using our approach, an agent can visually differentiate whether a user is thinking about a response or is waiting for the agent or robot to take its turn.

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

human-computer interaction
eye gaze tracking
turn-taking
embodied conversational agent


Pulsatile non-Newtonian haemodynamics in a 3D bifurcating abdominal aortic aneurysm model Numerical prediction of non-Newtonian blood flow in a 3D abdominal aortic aneurysm bifurcating model is carried out. The non-Newtonian Carreau model is used to characterise the shear thinning behaviour of the human blood. A physical inlet velocity waveform incorporating a radial velocity distribution reasonably representative of a practical case configuration is employed. Case studies subject to both equal and unequal outlet pressures at iliac bifurcations are presented to display convincingly the downstream pressure influences on the flow behaviour within the aneurysm. Simulations indicate that the non-Newtonian aspects of the blood cannot at all be neglected or given a cursory treatment. The wall shear stress (WSS) is found to change significantly at both the proximal and distal ends of the aneurysm. At the peak systole, the WSS is peak around the bifurcation point, whereas the WSS becomes zero in the bifurcation point. Differential downstream pressure fields display significant effects regarding the flow evolution in the iliac arteries, whereas little or no effects are observed directly on the flow details in the aneurysm.

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

abdominal aortic aneurysm
pulsatile
wall shear stress


Neural fixed-parameter active noise controller for variable frequency tonal noise Sound emitted by audible warning devices for emergency vehicles usually exceeds maximum admissible rates of noise in the aspect of occupational health and safety of the crew inside. Therefore, the idea of active noise control systems for emergency vehicles is an important issue. Most of active noise control systems for emergency vehicles developed till now are based on the concept of adaptive control. A major disadvantage of adaptive noise control methods is the lack of robustness for external disturbances. In this paper the concept of robust, fixed-parameter controller for variable frequency tonal noises is presented. The concept is based on a neural network performing a role of intelligent data base for notch filter coefficients.

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


Description logics for an autonomic IDS event analysis system Internet has grown by several orders of magnitude in recent years, and this growth has escalated the importance of computer security. Intrusion Detection System (IDS) is used to protect computer networks. However, the overwhelming flow of log data generated by IDS hamper security administrators from uncovering the hidden attack scenarios. Therefore, the autonomic IDS event analysis system is essential to make the IDS console smarter and more efficient. In this paper, we propose an IDS autonomic event analysis system represented by description logics, which allows inferring the attack scenarios and enabling the attack knowledge semantic queries. The modified case grammar PCTCG is used to convert raw alerts into frame-structured alert streams, and the alert semantic network 2-AASN is used to generate the attack scenarios, which can then inform the security administrator. Afterwards, based on the alert contexts, attack scenario instances are extracted, and attack semantic query results on attack scenario instances using spreading activation technique are forwarded to the security administrator. (c) 2006 Published by Elsevier B.V.

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

intrusion detection system
description logics


The marginal social cost of travel time variability We study the marginal social cost of travel time variability (MSCTTV) of car users. We amend the bottleneck model of road congestion by adding a random delay. We derive the Nash equilibrium and the MSCTTV for users with (?,?,?) preferences. The MSCTTV is strictly lower than the VTTV, which assumes exogenous congestion. Data for the Paris area suggests that in practice, the gap is substantial.

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


Attributed graph transformation with inheritance: Efficient conflict detection and local confluence analysis using abstract critical pairs Inheritance is an important and widely spread concept enabling the elegant expression of hierarchy in object-oriented software programs or models. It has been defined for graphs and graph transformations enhancing the applicability of this formal technique. Up to now, for the analysis of transformations with inheritance a flattening construction has been used, which yields all the well-known results for graph transformation but results in a large number of graphs and rules that have to be analyzed. In this paper, we introduce a new category of typed attributed graphs with inheritance. For the detection of conflicts between graph transformations on these graphs, the notion of abstract critical pairs is defined. This allows us to perform the analysis on polymorphic rules and transformations without the need for flattening, which significantly increases the efficiency of the analysis and eases the interpretation of the analysis results. The new main result is the Local Confluence Theorem for typed attributed graph transformation with inheritance using abstract critical pairs. All constructions and results are demonstrated on an example for the analysis of refactorings. (C) 2012 Elsevier B.V. All rights reserved.

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

typed attributed graph transformation
inheritance

critical pair analysis
m-adhesive category with nacs


SCTP multihoming provisioning in converged IP-based multimedia environment The latest evolution and successful deployment of different access technologies have resulted in end-users having the ability of combining different fixed and wireless technologies into a superior network service. Increasingly bandwidth-hungry multimedia applications are the first to utilize all benefits that multihomed user terminals offer in a way of connection persistence, reliability and fault tolerance, seamless handovers between points of attachments (PoA) and bandwidth aggregation. Stream control transmission protocol (SCTP) is, considering the advantages of integrated multihoming support, possible bandwidth aggregation and high reliability in addition to other attractive features like multistreaming, partial reliability and optional unordered delivery, a viable transport protocol for provisioning of demanding services in the converged IP-based multimedia environment with guaranteed operator-grade reliability and quality. But despite numerous advantages, the use of SCTP is still mainly limited to operators' services, while end-user terminals have still not yet adopted SCTP as a common transport protocol. As we point out in this article, this is mainly due to widely deployed network address translation (NAT) and firewall (FW) middleboxes and very common use of default routing at the end-user terminals, which results in issues at setting up and maintaining of a fully operational multihomed SCTP association. In this article we introduce two novel solutions that overcome these issues with the use of NAT/firewall NSIS signaling layer protocol (NATFW NSLP). First solution relies on dynamic address reconfiguration SCTP extension and the second one on SCTP endpoints' routing table synchronization. Interface between NATFW NSLP and SCTP has been designed and implemented in Linux environment, using Linux kernel SCTP (LKSCTP). Test results clearly show the benefits of our approach with a successful deployment of a resilient multihomed SCTP association in distributed NAT environment. Single point of failure is successfully avoided, even though default routing and asymmetrical multihoming is used. Additionally, our solution can realize an immediate failover if a fatal error occurs at a traversed middlebox, and offer disjoint network paths for possible bandwidth aggregation. These advanced features are of vital importance for dynamic end-to-end resource availability and satisfactory service quality for clients with heterogeneous access technologies. (C) 2010 Elsevier B.V. All rights reserved.

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

transport layer multihoming
path control


DCT implementation with distributed arithmetic This paper presents an efficient method for implementing the Discrete Cosine Transform (DCT) with distributed arithmetic. While conventional approaches use the original DCT algorithm or the even-odd frequency decomposition of the DCT algorithm, the proposed architecture uses the recursive DCT algorithm and requires less area than the conventional approaches, regardless of the memory reduction techniques employed in the ROM Accumulators (RACs). An efficient architecture for implementing the scaled DCT with distributed arithmetic is also proposed. The new architecture requires even less area while keeping the same structural regularity for an easy VLSI implementation. A comparison of synthesized DCT processors shows that the proposed method reduces the hardware area of regular and scaled DCT processors by 17 percent and 23 percent, respectively, relative to a conventional design, With the row-column decomposition method, the proposed architectures can be easily extended to compute the two-dimensional DCT required in many image compression applications such as HDTV.

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

discrete cosine transform
distributed arithmetic
recursive dct algorithm


Application-level causally ordered broadcast for large-scale group communication Gossip-based reliable broadcast protocols with reasonably weak reliability properties scale well to large groups and degrade system performance gracefully even if node failure or message loss rates increase compared with traditional protocols. However, although many distributed applications require highly steady performance only by allowing causality to be used asynchronously, there is no existing gossip-based protocol offering causally ordered delivery property more lightweight than totally ordered delivery one. This paper presents an application-level broadcast algorithm to guarantee causally-ordered delivery semantics based on peer to peer interaction models for scalability, reasonable reliability and stable throughput. Processes propagate each message with a vector time stamp much like the spread of rumor in society for a fixed number of rounds. Upon receipt of these messages, correct processes immediately deliver the corresponding messages to the application layers in a causal order. Simulation results show that the proposed algorithm outperforms the existing ones in terms of delivery throughput.

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

group communication
scalability
reliability


An alternative approach to distance geometry using L? L ? distances A standard task in distance geometry is to calculate one or more sets of Cartesian coordinates for a set of points that satisfy given geometric constraints, such as bounds on some of the L2 L 2 distances. Using instead L? L ? distances is attractive because distance constraints can be expressed as simple linear bounds on coordinates. Likewise, a given matrix of L? L ? distances can be rather directly converted to coordinates for the points. It can happen that multiple sets of coordinates correspond precisely to the same matrix of L? L ? distances, but the L2 L 2 distances vary only modestly. Practical examples are given of calculating protein conformations from the sorts of distance constraints that one can obtain from nuclear magnetic resonance experiments.

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


Robust Multi-Property Combiners for Hash Functions A robust combiner for hash functions takes two candidate implementations and constructs a hash function which is secure as long as at least one of the candidates is secure. So far, hash function combiners only aim at preserving a single property such as collision-resistance or pseudorandomness. However, when hash functions are used in protocols like TLS they are often required to provide several properties simultaneously. We therefore put forward the notion of robust multi-property combiners and elaborate on different definitions for such combiners. We then propose a combiner that provably preserves (target) collision-resistance, pseudorandomness, and being a secure message authentication code. This combiner satisfies the strongest notion we propose, which requires that the combined function satisfies every security property which is satisfied by at least one of the underlying hash function. If the underlying hash functions have output length n, the combiner has output length 2n. This basically matches a known lower bound for black-box combiners for collision-resistance only, thus the other properties can be achieved without penalizing the length of the hash values. We then propose a combiner which also preserves the property of being indifferentiable from a random oracle, slightly increasing the output length to 2n+?(logn). Moreover, we show how to augment our constructions in order to make them also robust for the one-wayness property, but in this case require an a priory upper bound on the input length.

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


Transactional scheduling for read-dominated workloads The transactional approach to contention management guarantees atomicity by aborting transactions that may violate consistency. A major challenge in this approach is to schedule transactions in a manner that reduces the total time to perform all transactions (the makespan), since transactions are often aborted and restarted. The performance of a transactional scheduler can be evaluated by the ratio between its makespan and the makespan of an optimal, clairvoyant scheduler that knows the list of resource accesses that will be performed by each transaction, as well as its release time and duration. This paper studies transactional scheduling in the context of read-dominated workloads; these common workloads include read-only transactions, i.e., those that only observe data, and late-write transactions, i.e., those that update only towards the end of the transaction. We present the BIMODAL transactional scheduler, which is especially tailored to accommodate read-only transactions, without punishing transactions that write most of their duration (early-write transactions). It is evaluated by comparison with an optimal clairvoyant scheduler; we prove that BIMODAL demonstrates the best competitive ratio achievable by a non-clairvoyant schedule for workloads consisting of early-write and read-only transactions. We also show that late-write transactions significantly deteriorate the competitive ratio of any non-clairvoyant scheduler, assuming it takes a conservative approach to conflicts. (C) 2012 Elsevier Inc. All rights reserved.

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

transactional memory
competitive analysis
read-dominated workload


Converting knowledge into sustainability performance of freight villages Along with the globalization of industry and trade, the importance of freight villages (FVs) greatly grows due to the substantial benefits they can generate, such as supply chain management efficiency, intensive provision of logistics services, modal shift, regional economic growth and employment, lower energy consumption, and environmental consequences. Hence, the sustainability performance tends to become a strategic goal that FVs operators and decision makers (e.g., transport agents, warehouse providers and freight forwarders, logistics operators, and FV management company) endeavor to achieve. However, due to the lack of a systematic approach toward FVs sustainable development, existing literature has not yet clearly defined what strategic direction should be followed to pursue such a goal. This article proposes a knowledge-related approach to promote sustainability performance of FVs. This article highlights sustainability as a strategic goal of FVs rooting in the evidences from academia and practical cases. In addition, it explains the principle of ensuring sustainability by FVs with twofold meanings. Meanwhile, it summarizes the sustainability dimensions in the context of FVs. After introducing the significances of knowledge assets and knowledge management (KM) approach to the sustainability drawing on the implications from sustainability balanced scorecard (SBSC), it analyses KM characteristics in logistics and FVs area. Then, how the general KM process (knowledge acquisition, sharing, and application) act on FVs sustainable development is clarified. In which, the sustainability-related stakeholders of FVs are identified. Finally, it proposes a roadmap of organizing KM for sustainability-oriented FVs considering the distinct features of KM in FVs context. To support the success of this roadmap, this article recognizes two key elements including human ability and stakeholders involvement. Furthermore, a checklist for building FVs sustainability capability based on SBSC is provided, which is hopefully being a referring guidance for FVs operators and decision makers.

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


Variance estimates and hypothesis tests in least absolute value regression This study uses Monte Carlo simulation to examine variance estimators for the coefficient estimates in least absolute value (LAV) regression. Variance estimators examined in this article are based on a procedure suggested by McKean and Schrader [McKean, J. and Schrader, R., 1987, Least absolute errors analysis of variance In: Dodge, Y. (Ed.) Statistical Data Analysis Based on the L-1-Norm and Related Methods , pp. 297-305.]. The variance estimates are used in significance tests for LAV regression coefficients. The resulting tests are compared on the basis of observed level of significance and power, and the test performance is used as a guide to choice of the variance estimate. Two of the factors in the Monte Carlo simulation, sample size and number of independent variables, are investigated over a wider range of values than in previous studies. The preferred variance estimator differs slightly from the one typically recommended in recent literature.

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

robust regression
l-1 -regression
least absolute deviations


Successive Group Selection for Microaggregation In this paper, we propose an efficient clustering algorithm that has been applied to the microaggregation problem. The goal is to partition N given records into clusters, each of them grouping at least K records, so that the sum of the within-partition squared error (SSE) is minimized. We propose a successive Group Selection algorithm that approximately solves the microaggregation problem in O(N-2 logN) time, based on sequential Minimization of SSE. Experimental results and comparisons to existing methods with similar computation cost on real and synthetic data sets demonstrate the high performance and robustness of the proposed scheme.

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


Singular point detection by shape analysis of directional fields in fingerprints This paper presents a new fingerprint singular point detection method that is type-distinguishable and applicable to various fingerprint images regardless of their resolutions. The proposed method detects singular points by analyzing the shapes of the local directional fields of a fingerprint image. Using the predefined rules, all types of singular points (upper core, lower core, and delta points) can be extracted accurately and delineated in terms of the type of singular points. In case of arch-type fingerprints there exists no singular point, but reference points for arch-type fingerprints are required to be detected for registration. Therefore, we propose a new reference point detection method for arch-type fingerprints as well. The result of the experiments on the two public databases (FVC2000 2a, FVC2002 2a) with different resolutions demonstrates that the proposed method has high accuracy in locating each types of singular points and detecting the reference points of arch-type fingerprints without regard to their image resolutions.

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

singular point
fingerprint
reference point

directional field
classification
alignment


Equivalent saturated MOSFET circuit with wide input range An equivalent MOSFET circuit with a wide input range is proposed. The proposed circuit is suitable for a realization of a wide input range under a low power supply voltage. The circuit consists of a MOSFET array and level shift circuits. The sum of drain currents of the MOSFET array is used as an equivalent drain current. The equivalent drain current is represented by K(V-GS - V-T)(2) even when its drain-to-source voltage is quite small and some MOSFETs in the array are in the non-saturation region or the cut-off region. The input range of the proposed circuit realized by k-MOSFET array is k times as wide as that of a single MOSFET. It is confirmed through HSPICE simulations that the proposed circuit is effective in applications with a wide dynamic range.

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

saturation region
equivalent mosfet circuit


Enclosing machine learning: concepts and algorithms A novel machine learning paradigm, i.e., enclosing machine learning based on regular geometric shapes was proposed. First, it adopted regular minimum volume enclosing and bounding geometric shapes (sphere, ellipsoid, box) or their unions and so on to obtain one class description model. Second, Data description, two class classification, learning algorithms based on the one class description model were presented. The most obvious feature was that enclosing machine learning emphasized one class description and learning. To illustrate the concepts and algorithms, a minimum volume enclosing ellipsoid (MVEE) case for enclosing machine learning was then investigated in detail. Implementation algorithms for enclosing machine learning based on MVEE were presented. Subsequently, we validate the performances of MVEE learners using real world datasets. For novelty detection, a benchmark ball bearing dataset is adopted. For pattern classification, a benchmark iris dataset is investigated. The performance results show that our proposed method is comparable even better than Support Vector Machines (SVMs) in the datasets studied.

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

enclosing machine learning
minimum volume enclosing ellipsoid

cognitive process
minimum volume enclosing shapes
cognitive class description
cognitive class recognizing


Multiscale finite element method applied to the SpalartAllmaras turbulence model for 3D detached-eddy simulation Employing the advectiondiffusionreaction equation as a model problem we present a multiscale method that yields a stabilized finite element formulation for Reynolds-Averaged NavierStokes (RANS) based turbulence models. The multiscale method arises from a decomposition of the scalar field into coarse (resolved) and fine (unresolved) scales. Modeling of the unresolved scales corrects the lack of stability of the standard Galerkin formulation. The proposed method possesses superior properties like that of the Streamline Upwind/PetrovGalerkin (SUPG) method and the Galerkin/Least-Squares (GLS) method. The stabilization terms appear naturally and the resulting formulation provides effective stabilization in turbulent computations where reaction-dominated effects strongly influence the boundary layer prediction. A family of 2D and 3D elements is developed and comparison of the proposed method with the SUPG method is presented. The multiscale formulation is then applied to the SpalartAllmaras turbulence model [1] in FENSAP-ICE [2], [3], [4], [5], [6]and[7] for detached-eddy simulation (DES). Numerical results obtained by the proposed method are compared with experimental and DNS results for backward-facing step problem at Reynolds number of 5000.

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

spalartallmaras turbulence model
advectiondiffusionreaction equation

multiscale methods
detached-eddy simulation


An extended range of stable-symmetric-conservative Flux Reconstruction correction functions The Flux Reconstruction (FR) approach offers an efficient route to achieving high-order accuracy on unstructured grids. Additionally, FR offers a flexible framework for defining a range of numerical schemes in terms of so-called FR correction functions. Recently, a one-parameter family of FR correction functions were identified that lead to stable schemes for 1D linear advection problems. In this study we develop a procedure for identifying an extended range of stable, symmetric, and conservative FR correction functions. The procedure is applied to identify ranges of such correction functions for various orders of accuracy. Numerical experiments are undertaken, and the results found to be in agreement with the theoretical findings.

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

high-order methods
discontinuous galerkin method
spectral difference method
energy stability


dcas-based concurrent deques The computer industry is currently examining the use of strong synchronization operations such as double compare-and-swap (DCAS) as a means of supporting non-blocking synchronization on tomorrow's multiprocessor machines. However, before such a strong primitive will be incorporated into hardware design, its utility needs to be proven by developing a body of effective non-blocking data structures using DCAS. As part of this effort, we present two new linearizable non-blocking implementations of concurrent deques using the DCAS operation. The first uses an array representation, and improves on former algorithms by allowing uninterrupted concurrent access to both ends of the deque while correctly handling the difficult boundary cases when the deque is empty or full. The second uses a linked-list representation, and is the first non-blocking unbounded-memory deque implementation. It too allows uninterrupted concurrent access to both ends of the deque.

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

use
synchronization
design
data structures
implementation
proven
hardware
access
representation
utility
multiprocessor

industrial computation arrays concurrency memorialized operability linearizability algorithm effect


Prior knowledge of character locational stereotypes and representations during text comprehension Certain character locational stereotypes are expected to affect constructions of mental representations during text comprehension. The present study examined whether readers prior knowledge of character locational stereotypes affects the construction of these character representations during text comprehension. Two short stories were presented to the participants. In one story, God, and two people wearing blue and green clothes, respectively, appeared in a room in that order (God condition). In the other, three people appeared in red, blue, and green clothes, respectively (three-people condition). The only difference between the two stories was the first character that appeared in the room. All participants were assigned to either the God or three-people condition. Participants read the story and provided an account of their own mental representation of where the three characters were located within the room, and explained the reasoning behind their descriptions. In the God condition, most participants stated that God was in the center (relative to the two people) because of locational stereotypes of God. In the three-people condition, most participants stated that the person in red was located in front of or closest to the participant because of the order in which the character appeared in the text. These results show that readers prior knowledge of character locational stereotypes affects their mental representation of spatial relationships between characters during text comprehension.

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

character locational stereotype
mental model
locational representation


New methods for students' evaluation using fuzzy sets In an earlier work, Biswas (1995) presented two methods for the application of fuzzy sets in students' answerscripts evaluation. In this paper, we extend his work to propose two new methods for evaluating students' answerscripts using fuzzy sets. The proposed methods can overcome the drawbacks in Biswas (1995) due to the fact that they do not need to perform the complicated matching operations and they can evaluate students' answerscripts in a more fair manner. (C) 1999 Elsevier Science B.V. All rights reserved.

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

extended fuzzy grade sheet
fuzzy set
generalized extended fuzzy grade sheet
letter-grade
mid-gradepoint


The integral over a directed line segment of fuzzy mapping and its applications In this paper, we present the definition of integral of fuzzy mappings from the fuzzy number space E into E, and discuss its properties and calculation. And as an application of the integral, we provide a method of robustness estimates for the traffic volumes passing a road each day (24 hours). In addition, we also give another example of the integral characterizing the distance travelled in an imprecise or uncertain environment of time and speed.

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

fuzzy number
fuzzy mapping
integral
distance travelled


Optimizing network performance and carbon offset through opportunistic reclustering We have viewed an enterprise information network as a flexible topology, where each node seeks the opportunity to join a cluster having high association with its nodes to reduce the external bandwidth and thereby producing less carbon. The opportunistic clustering is modeled as an optimization problem and we utilized heuristics such as genetic algorithm (GA) and simulated annealing (SA) to search for the best opportunistic topology. We have proposed redesign operations such as move and swap nodes to change the existing topology into an opportunistic topology. Also, we defined an opportunistic factor ranging from +1 to 1 to measure the gain in bandwidth and the amount of reduction in carbon emissions. Our simulation results demonstrate positive opportunistic factor in individual clusters from 0.4 to 0.7 in move operation, thereby showing a total bandwidth gain of 21% and 19% within GA and SA, respectively. In the swap operation, the opportunistic factor reached a maximum of 0.3, thereby showing a bandwidth gain of 9.7% and 5.1% within GA and SA, respectively. It is also observed that the optimization within GA outperforms SA in offsetting carbon emission with a maximum of 22%. Copyright (C) 2012 John Wiley & Sons, Ltd.

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

carbon offset
opportunistic topology
simulated annealing

bandwidth utilization
network redesign
genetic algorithm (ga)


Multivariable geostatistics in S: the gstat package This paper discusses advantages and shortcomings of the S environment for multivariable geostatistics, in particular when extended with the gstat package, an extension package for the S environments (R, S-Plus). The gstat S package provides multivariable geostatistical modelling, prediction and simulation, as well as several visualisation functions. In particular, it makes the calculation, simultaneous fitting, and visualisation of a large number of direct and cross (residual) variograms very easy. Gstat was started 10 years ago and was released under the GPL in 1996; gstat.org was started in 1998. Gstat was not initially written for teaching purposes, but for research purposes, emphasising flexibility, scalability and portability. It can deal with a large number of practical issues in geostatistics, including change of support (block kriging), simple/ordinary/universal (co)kriging, fast local. neighbourhood selection, flexible trend modelling, variables with different sampling configurations, and efficient simulation of large spatially correlated. random fields, indicator kriging and simulation, and (directional) variogram and cross variogram modelling. The formula/models interface of the S language is used to define multivariable geostatistical models. This paper introduces the gstat S package, and discusses a number of design and implementation issues. It also draws attention to a number of papers on integration of spatial statistics software, GIS and the S environment that were presented on the spatial statistics workshop and sessions during the conference (C) 2004 Elsevier Ltd. All rights reserved.

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

linear model of coregionalisation
open source software
stochastic simulation


Steady state analysis of Boolean molecular network models via model reduction and computational algebra A key problem in the analysis of mathematical models of molecular networks is the determination of their steady states. The present paper addresses this problem for Boolean network models, an increasingly popular modeling paradigm for networks lacking detailed kinetic information. For small models, the problem can be solved by exhaustive enumeration of all state transitions. But for larger models this is not feasible, since the size of the phase space grows exponentially with the dimension of the network. The dimension of published models is growing to over 100, so that efficient methods for steady state determination are essential. Several methods have been proposed for large networks, some of them heuristic. While these methods represent a substantial improvement in scalability over exhaustive enumeration, the problem for large networks is still unsolved 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

steady state computation
boolean model
discrete model


An approximate policy for a dual-sourcing inventory model with positive lead times and binomial yield Study the dual-sourcing models with positive lead times and yield uncertainty. Propose a heuristic based on models with full returns and modified demands. Extend heuristic to models with advance yield information. Numerically show close-to-optimal performance of proposed heuristic.

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

supply chain management
applied probability
dual-index order-up-to policy


Vector quantization using the firefly algorithm for image compression The vector quantization (VQ) was a powerful technique in the applications of digital image compression. The traditionally widely used method such as the Linde-Buzo-Gray (LBG) algorithm always generated local optimal codebook. Recently, particle swarm optimization (PSO) was adapted to obtain the near-global optimal codebook of vector quantization. An alterative method, called the quantum particle swarm optimization (QPSO) had been developed to improve the results of original PSO algorithm. The honey bee mating optimization (HBMO) was also used to develop the algorithm for vector quantization. In this paper, we proposed a new method based on the firefly algorithm to construct the codebook of vector quantization. The proposed method uses LBG method as the initial of FF algorithm to develop the VQ algorithm. This method is called FF-LBG algorithm. The FF-LBG algorithm is compared with the other four methods that are LBG, particle swarm optimization, quantum particle swarm optimization and honey bee mating optimization algorithms. Experimental results show that the proposed FF-LBG algorithm is faster than the other four methods. Furthermore, the reconstructed images get higher quality than those generated form the LBG, PSO and QPSO. but it is no significant superiority to the HBMO algorithm. (C) 2011 Elsevier Ltd. All rights reserved.

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

vector quantization
lbg algorithm
particle swarm optimization
honey bee mating optimization
firefly algorithm


Interactivity-Constrained Server Provisioning in Large-Scale Distributed Virtual Environments Maintaining interactivity is one of the key challenges in distributed virtual environments (DVEs). In this paper, we consider a new problem, termed the interactivity-constrained server provisioning problem, whose goal is to minimize the number of distributed servers needed to achieve a prespecified level of interactivity. We identify and formulate two variants of this new problem and show that they are both NP-hard via reductions to the set covering problem. We then propose several computationally efficient approximation algorithms for solving the problem. The main algorithms exploit dependencies among distributed servers to make provisioning decisions. We conduct extensive experiments to evaluate the performance of the proposed algorithms. Specifically, we use both static Internet latency data available from prior measurements and topology generators, as well as the most recent, dynamic latency data collected via our own large-scale deployment of a DVE performance monitoring system over PlanetLab. The results show that the newly proposed algorithms that take into account interserver dependencies significantly outperform the well-established set covering algorithm for both problem variants.

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

distributed virtual environments
server provisioning
interactivity


Identification of Viscoelastic Functions for Hot-Mix Asphalt Mixtures Using a Modified Harmony Search Algorithm This study proposes a modified harmony search (MHS) algorithm for determining the time-domain viscoelastic function of hot-mix asphalt (HMA) concrete materials. This MHS technique, employing a global optimization technique as well as a Wiechert model for the relaxation function, substantially enhances accuracy and consistency in the determination of viscoelastic functions of several HMA mixtures. In addition, this study shows how to determine a time-domain Prony series representation from the complex modulus in the frequency domain using the MHS algorithm. This can be efficiently used for numerical analysis with techniques such as the finite-element method. The results from lab frequency sweep tests of unmodified and lime-modified HMA at various asphalt contents were consistent with the functions obtained from the MHS algorithm. DOI: 10.1061/(ASCE)CP.1943-5487.0000078. (C) 2011 American Society of Civil Engineers.

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

harmony search
wiechert model
prony series representation


Accurate interface-tracking of surfaces in three dimensions for arbitrary LagrangianEulerian schemes We extend the computational method presented in [1] for tracking an interface immersed in a given velocity field to three spatial dimensions. The proposed method is particularly relevant to the simulation of unsteady free surface problems using the arbitrary LagrangianEulerian framework, and has been constructed with two goals in mind: (i) to be able to accurately follow the interface; and (ii) to automatically maintain a good distribution of the grid points along the interface. The method combines information from a pure Lagrangian approach with information from an ALE approach. The new method offers flexibility in terms of how an optimal point distribution should be defined, and relies on the solution of two-dimensional surface convection problems. We verify the new method by solving model problems both in the single and multiple spectral element case, and we compare this method with other traditional alternatives. We have been able to verify first, second, and third order temporal accuracy for the new method by solving these three-dimensional model problems.

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


Establishment of a hyperspectral evaluation model of ocean color satellite-measured reflectance The accuracy of the satellite-measured reflectance is a key question for data processing and oceanographic applications. A hyperspectral satellite remote sensing reflectance evaluation model (HRSREM) was developed to evaluate the accuracy of the satellite measured reflectance. The model can compute the total reflectance at the top of the atmosphere (TOA) according to observation conditions of satellites, based on a radiative transfer model with the consideration of multiple scattering effects and atmospheric absorption effects. The performance of the HRSREM model was examined by Gordon's algorithms, showing that the relative errors of the Rayleigh scattering reflectance and the aerosol scattering reflectance are less than 2%. The model can also compute the sky reflectance which can be validated by in-situ measurements. The two sky reflectances match well with a spectral average error of 5.4%. The relative error of the total reflectance of the model, verified by sea-viewing wide field-of-view sensor (SeaWiFS) data, is about 3.5%. Therefore, the total reflectances at TOA, computed by the model, can be taken as reference values to evaluate the accuracy of satellite reflectances. The model was used to evaluate the accuracy of the hypersptral satellite (Hyperion) remote sensing data. The Hyperion reflectance matches the total reflectance of HRSREM very well at visible and near-infrared bands with an average error of 7.3%, while the status of calibration coefficients at shortwave infrared bands are not stable with a large spectral average error of 63.5%. The reflectance evaluation of a moderate resolution imaging spectrometer (CMODIS) data indicated that relative errors are large, especially at near-infrared bands with relative errors more than 100%. The calibration coefficients of CMODIS, obtained from laboratory measurements, are not reliable. The CMODIS data should be recalibrated for oceanographic applications. The performance of the HRSREM model is effective in evaluating satellite data and its algorithms can be easily modified in order to evaluate the accuracy of other ocean color satellite sensors.

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

hyperspectral remote sensing
satellite ocean color


a framework for scalable global ip-anycast (gia) This paper proposes GIA, a scalable architecture for global IP-anycast. Existing designs for providing IP-anycast must either globally distribute routes to individual anycast groups, or confine each anycast group to a pre-configured topological region. The first approach does not scale because of expressive growth in the routing tables, whereas the second one severly limits the utility of the service. Our design scales by dividing inter-domain anycast routing into two components. The first component builds inexpensive default anycast routes that consume no bandwidth or storage space. The second component, controlled by the edge domains, generates enhanced anycast routes that are customized according to the beneficiary domain's interests. We evaluate the performance of our design using simulation, and prove its practicality by implementing it in the Multi-threaded Routing Toolkit.

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


An investigation and comparison of artificial neural network and time series models for Chinese food grain price forecasting This paper compares the predictive performance of ARIMA, artificial neural network and the linear combination models for forecasting wheat price in Chinese market. Empirical results show that the combined model can improve the forecasting performance significantly in contrast with its counterparts in terms of the error evaluation measurements. However, as far as turning points and profit criterions are concerned, the ANN model is best as well as at capturing a significant number of turning points. The results are conflicting when implementing dissimilar forecasting criteria (the quantitative and the turning points measurements) to evaluate the performance of three models. The ANN model is overall the best model, and can be used as an alternative method to model Chinese future food grain price.

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

artificial neural networks
combined forecast


The effect of advertisement choice, sex, and need for cognition on attention A recent study showed that choice of advertisement content affected attention for female but not male viewers (Nettelhorst & Brannon, 2012). This study extended that work by assessing the effect of choice difficulty and the moderation of viewers need for cognition (Cacioppo & Petty, 1982) on attention. Participants were either allowed or not allowed to choose which advertisement to watch after watching a television skit. Next, participants watched an advertisement and rated their amount of attention towards it. Results showed that males were not influenced by the choice manipulation, but females had significantly greater attention after making the difficult choice. Similarly, high need for cognition individuals were not influenced by the choice manipulation, but low need for cognition individuals had significantly greater attention after making the difficult choice. These results suggest that choice in of itself is not a sufficient means of increasing viewer attention towards an advertisement. Instead the choice must be between options which are attractive to the viewer. In addition, advertisement choice should be an effective marketing tool particularly for female viewers or those with low need for cognition in general.

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

advertisement choice
need for cognition
attention


CPG(EA): a grouping genetic algorithm for material cutting plan generation Construction firms specializing in large commercial buildings often purchase large steel plates, cut them into pieces and then weld the pieces into H-beams and other construction components. We formalize the material ordering and cutting problem faced by this industry and propose a grouping genetic algorithm, called CPGEA, for efficiently controlling the relevant costs. We test the quality of CPGEA in various ways. Three sets of simulated problems with known optimal solutions are solved using CPGEA, and the gap between its solutions and optimal solutions is measured. The same problem sets are also solved with an expert system and a multi-start greedy heuristic. CPGEA solutions are found to be consistently lower cost than the competing methods. The difference in solution quality is most pronounced for difficult problems requiring multiple identical plates in the optimal solution. CPGEA is also tested using data from actual construction projects of a company faced with this problem. Since an optimal solution for the problems is not available, a lower bound is created. For the historical problems tested, the average percent difference between CPGEA solutions and the lower bound is 0.67%. To put this performance in context, the results of solving these problems with an expert system and using experienced engineers is also reported. Of these three methods, CPGEA achieves the best performance and the human experts the worst performance. (C) 2003 Elsevier Science Ltd. All rights reserved.

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


Design and evaluation of a P2PIPTV system for heterogeneous networks NTUStreaming is an overlay P2P-based IPTV system that integrates innovations in both overlay networking and video coding for optimal user experience. The system consists of three key components: partnership formation, robust video coding, and video segment request scheduling. For partnership formation, a graph construction mechanism TYPHOON based on epidemic algorithms is developed to reduce disconnect time and isolated peers. For robust video coding, a multiple description coding (MDC) scheme with spatial-temporal hybrid interpolation (STHI) is proposed to adjust streaming traffic according to the bandwidth and device capability of each peer. For request scheduling, an optimization algorithm is developed by taking the available bandwidth and the video segment type into account. Experimental results show that NTUStreaming is able to deliver optimal video quality in lossy and dynamic networking environments.

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

error recovery
overlay network
peer-to-peer (p2p)
video broadcast
video streaming


Serviter: A service-oriented programmable network platform for shared infrastructure Active Networks propose a new approach for dynamic service deployment through the introduction of extensible software components and per-packet processing in the forwarding plane. By doing so, this approach causes serious degradation to performance, scalability, and reliability levels achievable in current networks. Furthermore, current Active Network architectures cannot guarantee isolation among conflicting services or services competing for limited resources. The focus of this paper is on service isolation and a programmable approach whereby service introduction is restricted to the control plane and per-packet processing is performed by reconfigurable dedicated hardware. In particular, we present Serviter, a Service-Oriented Programmable Network Platform for Shared Networks. Serviter employs separated control and forwarding planes. It enables on-demand service deployment in a partitioned and hardware optimised control plane. It facilitates safe node sharing by providing each trusted user (e.g. an ISP) with a secure, separate, and resource assured partition, representing a 'virtual router', to accommodate their services. Serviter employs a new QoS-differentiated allocation mechanism, called Control plane-Quality of Service, to allocate the platform internal resources fairly and efficiently among partitions and their services. (c) 2005 Elsevier B.V. All rights reserved.

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

programmable networks
programmable router


supporting the generation of argument structure within video sequences We describe our approach to the automatic generation of argument structures in the domain of video documentaries. Our approach releases control of the final video sequencing from the film maker/annotator to the system and thus allows users to select their own documentaries for viewing. Each video segment is annotated using a formal structure filled in with terms from a thesaurus. The annotations are used for finding and combining video segments into a final presentation. In order to influence the documentaries that can be generated, we introduce three methods for the annotator to evaluate the effectiveness of the annotations and to influence the process of automatic link generation.

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

structured annotations
hypermedia
automatic linking


Feasibility of a semi-automated method for cardiac conduction velocity analysis of high-resolution activation maps Myocardial conduction velocity is important for the genesis of arrhythmias. In the normal heart, conduction is primarily dependent on fiber direction (anisotropy) and may be discontinuous at sites with tissue heterogeneities (trabeculated or fibrotic tissue). We present a semi-automated method for the accurate measurement of conduction velocity based on high-resolution activation mapping following central stimulation. The method was applied to activation maps created from myocardium from man, sheep and mouse with anisotropic and discontinuous conduction. Advantages of the presented method over existing methods are discussed.

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

optical mapping
arrhythmia
fibrosis
electrophysiology


Periodic review stochastic inventory problem with forecast updates: Worst-case bounds for the myopic solution Muth first considered the linear cost periodic review inventory problem in which the mean demand in a period undergoes a non-observed random walk. Assuming the random walk variance and the within period demand variance to be known, and stationary, he showed that the Best Linear Unbiased Estimate (BLUE) for the mean is given by exponential smoothing and derived the formula for the optimal steady state smoothing constant in terms of the variances. We first show that the corresponding Bayesian analysis is useful under transient conditions, and converges to the Muth results under steady state. For the steady state solution, we prove that the myopic policy is near-optimal, using the concepts of -myopic and -myopic introduced in this paper, in the sense that the worst case bounds on policy errors in using it may be given analytically, and are small for reasonable values of parameters. As further validation, we use dynamic programming (DP) to compute optimal policies and compare them with myopic policies; policy errors are very small. By considering analogous results in recent literature, it is conjectured that additions of such factors as non-stationarity, lead-times, perishability, setup costs would produce near-myopic results.

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


Software Artifact Prioritization Based on the Frequency of Use Whenever there is more work to do than resources to overcome it, engineers usually tend to devise some kind of prioritization that ensures that effort is applied to the most important tasks. This is what Barry Boehm called the "value-based" approach. We propose a value-based methodology that prioritizes software artifacts taking into account the frequency of use. The main idea is to provide to maintainers with a "partial view" of the system containing only the code corresponding with the functionality that is really used by users, and thus to "ignore" the code which is not use. The objective of our proposal is to minimize the maintenance effort needed to maintain large systems, by means of reducing the size and complexity of such software. This process that we called "Software Reduction" is explained in detail in this paper.

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

artifact prioritization
frequency of use
software reduction

value-based software engineering
value-based maintenance


the challenges of delivering content on the internet In this talk, we will give an overview of how content is distributed on the internet, with an emphasis on the approach being used by Akamai. We will describe some of the technical challenges involved in operating a network of thousands of content servers across multiple geographies on behalf of thousands of customers. The talk will be introductory in nature and should be accessible to a broad audience.

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

custom challenge operability contention access server


Classifying terrain properties for planetary exploration rovers based on a combined distance measure with dynamic texture model We propose a metric to classify non-geometric terrain properties by image sequences. The image sequences are obtained from planetary rovers onboard cameras. The proposed metric is based on a technique called a Dynamic Texture. To classify different terrain properties, we derive a combined distance measure. The effectiveness of the distance measure is demonstrated through experiments.

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

terrain classification
motion-image sequence
dynamic textures


Adaptive control and synchronization of Lorenz systems ? This study addresses the adaptive control and synchronization problems of Lorenz systems with unknown system parameters. Based on the Lyapunov stability theory, an adaptive control law with single-state variable feedback is derived such that the trajectory of the Lorenz system is globally stabilized to an equilibrium point of the uncontrolled system. In addition, the adaptive control law is also applied to achieve the state synchronization of two identical Lorenz systems. Numerical results demonstrate the effectiveness of the proposed control scheme.

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

adaptive control
synchronization
lorenz systems


Effective scheme for generation of \(N\)-dimension atomic GreenbergerHorneZeilinger states In this paper, we propose an effective scheme for generation of \(N\)-dimension atomic GreenbergerHorneZeilinger states with the controlled phase flip gates. The successful probability of our scheme is 100% in principle. The scheme is implemented with simple linear optical elements, delay lines and polarization-independent circulators. We discuss the feasibility of the setups, concluding that the scheme is feasible with current technology.

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

greenbergerhornezeilinger state
controlled phase flip gate
high-dimension entanglement


Thermochemical responses of sandwich panels to fire Glass reinforced plastic (GRP) sandwich panels are increasingly being used in the offshore industry and their behaviour in fire is studied using mathematical and numerical modelling. A mathematical model is developed to analyse the thermochemical response of a widely used GRP sandwich panel, consisting of two glass-fibre/polyester GRP outer skins and calcium silicate (Vermiculux) sandwich material in between. The model accounts for (i) thermochemical decomposition in the GRP skins, (ii) transient heat conduction in Vermiculux and (iii) the effect of thermal contact resistance at the GRP/Vermiculux/GRP interfaces. A numerical model is presented using the finite element technique. A mixed explicitimplicit BubnovGalerkin finite element approach is adopted. In addition, a novel implicit method is used to include the effect of temperature drop at the interfaces. The numerical results are presented and comprise temperature profiles. They are compared with some experimental data and discussed. It is shown that GRP sandwich panels offer good passive thermal protection. Thermal contact resistance is important and may reduce heat flow by 13%.

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

fire
sandwich panels
thermochemical decomposition

finite element method
glass reinforced plastics


Quantitative validation techniques a database. (I). Simple examples This paper proposes the formulation of a database of validation examples. This initial contribution describes the problem of validation of the simulation of two real systems. These include a mechanical network and a thermal system with a transport delay. Data of the component values and measurements are reported here. The data from testing these systems will be made available at a later stage to enable other workers to compare other validation techniques with those presented here. The responses of a mechanical and a thermal system were measured with a laptop PC and Labview via a DAQCardTM-700 data acquisition card. Simulations were made with ACSL and ACSL Math. The validation procedures implemented included a parameter variation with integral quadratic weighting and ITAE weighting together with a statistical matching technique using a correlation coefficient. These techniques illustrate the problem of achieving good validation to within a few percentage points. Correlation coefficients of over 98% were obtained for the fitting of linear models, with Theil indices of less than 0.075.

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

systems
labview
correlation coefficient
parameter variation
acsl

model validation
integral squared error
theil coefficient


supporting co-evolution of users and systems by the recognition of interaction patterns This paper presents an approach to support the designer of Visual Interactive Systems (VISs) in adapting a VIS to the evolution of its users. This process is called co-evolution of users and systems. The approach is based on the identification of the patterns of interaction between the user and an interactive system and on their use for the evolution of the system to facilitate novel usages introduced by the user. The approach is focused on WIMP systems and is based on the recently introduced PCL (Pictorial Computing Laboratory) model of interaction, within which we provide a novel definition of interaction pattern . The proposal assumes that the VIS is observed by an external system called SIC (Supporting Interaction Co-evolution), which is in charge of recording the interactions between the user and the VIS and of analyzing the relevant interaction patterns. In particular, SIC exploits a UML-based statechart specification of the VIS in order to associate observed user activities with the states of the interactive process. This information provides a useful basis for a variety of pattern recognition techniques. Two techniques called usual state and recurrent sequence recognition are illustrated and the results of a first experiment are discussed.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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-evolution
system observation
visual sentence
visual interface design


Bundling retail products: Models and analysis ? We consider the impact of bundling products on retail merchandising. We consider two broad classes of retail products: basic and fashion. For these product classes, we develop models to calculate the optimal bundle prices, order quantities, and profits under bundling. We use this analysis to establish conditions and insights under which bundling is profitable. Our analysis confirms that bundling profitability depends on individual product demands, bundling costs, and the nature of the relationship between the demands of the products to be bundled. We also provide detailed numerical examples.

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

retailing
product bundling
pricing
inventory management
basic products
fashion products


pictopia The urban population in the developed world is living with unprecedented tolerance for diversity; material wealth has afforded us the time and space for our differences to co-exist. The ever proliferating cyberspace has added additional room to contain people, ideas and activities that are not necessarily compatible. Yet, is our city really multicultural? Cyberspace, instead of being on the fringe of physical reality, could become an infrastructure that enhances the intrinsic order in our city, resulting in a complex network of opportunities for our differences to interact and co-develop. Pictopia is a system in which our activities in the cyberspace can begin to overlap and intertwine with our everyday life in urban spaces. It prophesizes a new reality - a mixed reality that is rooted in the physical environment, harmoniously complimented and extended by virtual activities and resources. It uses the invisible geometrical orders beneath the city grids as a foundation and a conduit, to connect our memories and ideas to the physical world. Not only is it a functional file operating system, it also encourages its participants to question, learn, and visualize the relevance of their actions in cyberspace.

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

mediatecture urbanism locatability cybertecture architecture


Supervised feature extraction algorithm based on improved polynomial entropy Based on information entropy theory, a novel feature extraction algorithm based on improved polynomial entropy (IPE) is set up. Firstly, the concepts and their properties of information entropy and cross entropy (CE) are analysed and studied. On this foundation, we prove that symmetrical cross entropy (SCE) proposed here based on I E satisfies three axioms of the distance, i.e. nonnegativity, symmetry and triangle inequation. So SCE is a kind of distance measure, which can be used to measure the degree of variation between two random variables. Secondly, for convenience, we propose a new concept of improved polynomial entropy (IPE) based on polynomial entropy (PE), and explain that WE is equivalent to SCE. Thirdly, we make IPE separability criterion of the classes for feature extraction, and design a novel feature extraction algorithm based on IPE. Fianlly, the experimental results demonstrate that the algorithm proposed here is valid and reliable, and it provides a new research approach for feature extraction, data mining and pattern recognition.

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

information entropy theory
supervised feature extraction

cross entropy (ce)
symmetrical cross entropy (sce)
polynomial entropy (pe)
improved polynomial entropy (ipe)


Non-fragile H? filter design for discrete-time fuzzy systems with multiplicative gain variations This paper investigates the problem of non-fragile H? filter design for discrete-time TakagiSugeno (TS) fuzzy systems. The filter to be designed is assumed to have two type of multiplicative gain variations. By introducing additional matrix variables, a relaxed H? filtering analysis criterion is presented for the fuzzy system based on the fuzzy Lyapunov function. A filter state transformation approach is adopted to design the non-fragile H? filter, and the filter gains are given in terms of the feasible solutions of a set of linear matrix inequalities (LMIs). A simulation example is given to show the efficiency of the proposed methods.

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

ts fuzzy systems
multiplicative gain variations
filter state transformation

non-fragile h? filters
linear matrix inequalities (lmis)