Cloud service: automatic construction and evolution of software process problem-solving resource space The automatic construction of networked software and its ability to adapt to dynamic environments are important for cloud services that depend upon these capabilities. We provide a cloud service that browses the stacks of problem solution resources produced in the software process (SP for short) by organizing them into a structured Resource Space according to domain topics. Efforts are made to provide the cloud service with the ability of automatic construction of the SP problem-solving Resource Space, including extracting domain topics from document resources with the TDDF algorithm, transforming the topics into several categories to form the logic Resource Space, and deploying the Resource Space in a Peer-to-Peer (P2P for short) network. We also expect to achieve the online service evolution such as adjusting the resource pool and refining the Resource Space Model (RSM for short) by continuously understanding and adapting to its surroundings. Empirical cases are finally presented. Our investigation promotes the adaptability of cloud services to their changing environment.

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

networked software
resource space
cloud service

software evolution
problem-solving resource


Design of Cognitive Decision Making Controller for Autonomous Online Adaptive Beam Steering in Free Space Optical Communication System The beam motion is one of the main causes for major power loss which severely degrades the performance of the Free Space Optical Communication (FSOC) system. Designing a suitable controller to correct the beam motion to increase the beam stability at a point becomes significant. This paper presents an investigation on the performance of two types of controller designed for aiming a laser beam to be at a particular spot under dynamic disturbances generated at the transmitter. The experimental nonlinear inputoutput data mapping is used as the principal components for the controller design. The first design is based on the Taguchi method while the second is the artificial neural networkcognitive method. These controllers process the beam pointing (beam location) information from an opto-electronic position detector and then generate the necessary outputs to steer the beam with fast steering mirror. Conceptually, the controller design problem is addressed with looking the position error information to decide the level of nonlinear static output map for generating the correction control information. The pipelined-parallel architecture of both controllers are developed in a field programmable gate array (FPGA) and installed at the receiver station. Evidence of the suitability and the effectiveness of the proposed controller in terms of prediction exactness, response to impulse, scintillation, Q-factor and bit error rate are provided through experimental results obtained from the 155Mbps FSOC data link set-up established for the horizontal range of 0.5km at an altitude of 15.25m.

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

nonlinearity
taguchis method
neural-controller
beam wandering
scintillation and bit error rate


Efficient feature tracking of time-varying surfaces using multi-scale motion flow propagation This paper presents a framework for efficient feature tracking of time-varying surfaces. The framework can not only capture the dynamic geometry features on time-varying surfaces, but can also compute the accurate boundaries of the geometry features. The basic idea of the proposed approach is using the multi-scale motion flow and surface matching information to propagate the feature frame on time-varying surfaces. We first define an effective multi-scale geometry motion flow for the time-varying surfaces, which efficiently propagates the geometry features along the time direction of the time-varying surfaces. By combining both the approximately invariant signature vectors and geometry motion flow vectors, we also incorporate the shape matching into the system to process feature tracking for time-varying surfaces in large deformation while with low frame sampling rate. Our approach does not depend on the topological connection of the underlying surfaces. Thus, it can process both mesh-based and point-based time-varying surfaces without vertex-to-vertex correspondence across the frames. Feature tracking results on different kinds of time-varying surfaces illustrate the efficiency and effectiveness of the proposed method. (C) 2013 Elsevier Ltd. All rights reserved.

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

multi-scale filtering
time-varying surfaces
geometry feature tracking
gaussian mixture model


Managing more physical with less virtual Recent explosive growth in physical memory configurations inverts the problem faced by traditional operating systems, which were built around the assumption of limited physical memory and plentiful virtual memory. With the introduction of the Pentium Pro, there is an aberration in the historical trend towards increased virtual space. Such processors have 36-bit physical and 32-bit logical addressing; with traditional algorithms, the smaller virtual space limits the number of concurrent processes as well as the total physical memory usable by an application. To address these problems, two general principles can be applied to any operating system to reduce its virtual memory needs: first, multiplexing different physical addresses over the same virtual-as opposed to multiplexing different virtual over the same physical, where the optimization was to share the physical memory across multiple processes; second, optimize virtual consumption by kernel pagepool data, by organizing data structures to extend their physical memory reach using the same amount of virtual space. Copyright (C) 2000 John Wiley & Sons, Ltd.

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

physical memory
virtual memory
multiplexing


The effects of static and adaptive performance feedback in game-based training Training in virtual environments (VEs) has the potential to establish mental models and task mastery while providing a safe environment in which to practice. Performance feedback is known to contribute to this learning; however, the most effective ways to provide feedback in VEs have not been established. The present study examined the effects of differing feedback content, focusing on adaptive feedback. Participants learned search procedures during multiple missions in a VE. A control group received only a performance score after each mission. Two groups additionally received either detailed or general feedback after each mission, while two other groups received feedback that adapted based on their performance (either detailed-to-general, or general-to-detailed). Groups that received detailed feedback from the start of training had faster performance improvement than all other groups; however, all feedback groups showed improved performance and by the fourth mission performed at levels above the control group. Results suggest that detailed feedback early in the training cycle is the most beneficial for the fastest learning of new task skills in VEs.

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

ve virtual environment
gbt game-based training
clt cognitive load theory
dg detailed-to-general
gd general-to-detailed
vge video game experience


A polyhedral approach to the alldifferent system This paper examines the facial structure of the convex hull of integer vectors satisfying a system of alldifferent predicates, also called an alldifferent system. The underlying analysis is based on a property, called inclusion, pertinent to such a system. For the alldifferent systems for which this property holds, we present two families of facet-defining inequalities, establish that they completely describe the convex hull and show that they can be separated in polynomial time. Consequently, the inclusion property characterises a group of alldifferent systems for which the linear optimization problem (i.e. the problem of optimizing a linear function over that system) can be solved in polynomial time. Furthermore, we establish that, for systems with three predicates, the inclusion property is also a necessary condition for the convex hull to be described by those two families of inequalities. For the alldifferent systems that do not possess that property, we establish another family of facet-defining inequalities and an accompanied polynomial-time separation algorithm. All the separation algorithms are incorporated within a cutting-plane scheme and computational experience on a set of randomly generated instances is reported. In concluding, we show that the pertinence of the inclusion property can be decided in polynomial time.

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


Locally Oriented Optical Flow Computation This paper proposes the use of an adaptive locally oriented coordinate frame when calculating an optical flow field. The coordinate frame is aligned with the least curvature direction in a local window about each pixel. This has advantages to both fitting the flow field to the image data and in imposing smoothness constraints between neighboring pixels. In terms of fitting, robustness is obtained to a wider variety of image motions due to the extra invariance provided by the coordinate frame. Smoothness constraints are naturally propagated along image boundaries which often correspond to motion boundaries. In addition, moving objects can be efficiently segmented in the least curvature direction. We show experimentally the benefits of the method and demonstrate robustness to fast rotational motion, such as what often occurs in human motion.

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

directional derivative
image structure
intrinsic direction detection
motion estimation


Stochastic convex ordering for multiplicative decrease internet congestion control Window growth function for congestion control is a strong determinant of protocol behaviors, especially its second and higher-order behaviors associated with the distribution of transmission rates, its variances, and protocol stability. This paper presents a new stochastic tool, called convex ordering, that provides an ordering of any convex function of transmission rates of two multiplicative-decrease protocols and valuable insights into high-order behaviors of protocols. As the ordering determined by this tool is consistent with any convex function of rates, it can be applied to any unknown metric for protocol performance that consists of some high-order moments of transmission rates, as well as those already known such as rate variance. Using the tool, it is analyzed that a protocol with a growth function that starts off with a concave function and then switches to a convex function (e.g.. an odd order function such as x(3) and x(5)) around the maximum window size in the previous loss epoch, gives the smallest rate variation under a variety of network conditions. Among existing protocols, BIC and CUBIC have this window growth function. Experimental and simulation results confirm the analytical findings. (C) 2008 Elsevier B.V. All rights reserved.

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


Conceptualizing means-end chains of user goals as networks Goals are desired states that an individual tries to attain. The process of achieving a goal can be represented as interlinked means-end chains of user goals that have been traditionally visualized as hierarchies. Evidence in recent literature suggests that a network structure would be more appropriate and provide insight into a user's process of seeking a goal. We investigated user goal means-end chains for the eBay online auction system, and produced its structure as a goal network. To analyze this network and assess the importance of various goals, social network analysis measures were used (specifically, degree and flow-betweenness centrality). In addition, goal networks for users with low and high IS value were created and differences in goal importance in the two groups were considered. Results revealed that the most important user goals are closely related to key features of the auction system; users with high IS value want to use eBay to buy, sell, and bid for products, while users with low IS value seem to avoid using eBay because of uncertain price bidding. As such, the results of our study suggest that differences in IS value may be due to differences in IS usage. IS designers, marketers, and providers of online auction system can use our findings to design and promote better systems for their users.

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

goal-directed behavior
means-end chains
degree centrality
flow betweenness centrality
ucinet


On codes over quaternion integers Decoding algorithms for the correction of errors for cyclic codes over quaternion integers of quaternion Mannheim weight one up to two coordinates are discussed by zen and Gzeltepe (Eur J Pure Appl Math 3(4):670677, 2010). Though, Neto et al. (IEEE Trans Inf Theory 47(4):15141527, 2001) proposed decoding algorithms for the correction of errors of arbitrary Mannheim weight. In this study, we followed the procedures used by Neto et al. and suggest a decoding algorithm for an \(n\) length cyclic code over quaternion integers to correct errors of quaternion Mannheim weight two up to two coordinates. Furthermore, we establish that; over quaternion integers, for a given \(n\) length cyclic code there exist a cyclic code of length \(2n-1\). The decoding algorithms for the cyclic code of length \(2n-1\) are given, which correct errors of quaternion Mannheim weight one and two. In addition, we show that the cyclic code of length \(2n-1\) is maximum-distance separable (MDS) with respect to Hamming distance.

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

monoid ring
mannheim distance
syndrome decoding


A novel multi-swarm algorithm for optimization in dynamic environments based on particle swarm optimization Optimization in dynamic environment is considered among prominent optimization problems. There are particular challenges for optimization in dynamic environments, so that the designed algorithms must conquer the challenges in order to perform an efficient optimization. In this paper, a novel optimization algorithm in dynamic environments was proposed based on particle swarm optimization approach, in which several mechanisms were employed to face the challenges in this domain. In this algorithm, an improved multi-swarm approach has been used for finding peaks in the problem space and tracking them after an environment change in an appropriate time. Moreover, a novel method based on change in velocity vector and particle positions was proposed to increase the diversity of swarms. For improving the efficiency of the algorithm, a local search based on adaptive exploiter particle around the best found position as well as a novel awakeningsleeping mechanism were utilized. The experiments were conducted on Moving Peak Benchmark which is the most well-known benchmark in this domain and results have been compared with those of the state-of-the art methods. The results show the superiority of the proposed method.

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

particle swarm optimization
dynamic environments
moving peak benchmark


Analyzing the structure of expert knowledge Knowledge is either explicit or tacit. The elicitation, codification, storage, and distribution of tacit knowledge are extremely challenging tasks that require innovative methods and techniques. This paper reports the results of a study in which the tacit knowledge of domain experts was elicited, represented, and analyzed for validity. The subjects were a group of instructors and students at a USPS training school whose memory structures were analyzed for evidence of two common characteristics of expertise: holistic perception and use of abstract concepts. No evidence of either characteristic was found in the more experienced instructor group but, when the subjects were regrouped based on observed performance, the cognitive models of the high performers contained structural evidence of both characteristics. This finding led to the conclusion that experience alone is not an indicator of expertise. Other factors, such as the cognitive ability to correctly structure those experiences, must also be present.

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

knowledge management
organizational knowledge
cognitive mapping


Towards lightweight checks for mass maintenance transformations We propose a lightweight, practical approach to check mass maintenance transformations. We present checks for both transformation tools and transformed source code, and illustrate them using examples of real-world transformations. Our approach is not a fully fledged, formal one but provides circumstantial evidence for transformation correctness, and has been applied to the mass maintenance of industrial Cobol systems. (c) 2005 Elsevier B.V. All rights

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

mass maintenance
transformations
lightweight checks


dynamic switching of coherent cache protocols and its effects on doacross loops In multiprocessor systems, overheads caused by interprocessor communication and synchronization have been one of the largest obstacles for efficient execution of parallel programs. To reduce these overheads in shared-memory/shared-bus multiprocessors, we have proposed two hardware mechanisms: the Inter-Cache Snoop Control Mechanism (ICSCM), which dynamically switches snoop-protocols for improving shared-bus utilization, and the Mechanism for Integrated Synchronization and Communication (MISC), which extends ICSCM to support producer-consumer type synchronization efficiently. We have developed an execution-driven multiprocessor simulator for evaluating performance with these mechanisms. Simulation experiments on doacross loops show remarkable speed-ups by ICSCM/MISC mechanisms. Although the proposed mechanisms are originally implemented on a single shared-bus system, they are easily applicable to a clustered multiprocessing systems. The methods used in a clustered system are discussed.

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

communication cache simulation systems synchronization dynamic performance support hardware multiprocessor control

sharing
shared memory
method
efficiency
parallel programming
experience
switch
effect
integrability
coherence
cluster


Wheelchair guidance strategies using EOG This paper describes an eye-control method, based on electrooculography (EOG), for guiding and controlling a wheelchair for disabled people; the control is actually effected by eye movements within the socket. An eye model based on an electrooculographic signal is proposed and its validity is studied. Different techniques and guidance strategies are then shown with comments on the advantages and disadvantages of each one. The system consists of a standard electric wheelchair with an on-board computer, sensors and a graphic user interface run by the computer. This control technique could be useful in multiple applications, such as mobility and communication aid for handicapped persons.

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

wheelchair
control
guidance
disabled people

electrooculography (eog)
graphical interfaces


The development of a knowledge-based system supporting the diagnosis of reading and spelling problems (II) In an earlier paper [Van Aarle & Van den Bercken (1992). The development of a knowledge-based system for supporting the diagnosis of reading and spelling problems. Computers in Human Behavior, 8, 183201] a decision-support system for diagnosing elementary reading and spelling problems (CONDALS) was introduced. The system is meant to assist diagnosticians in processing diagnostic information in a methodical way. It is designed to embody a number of guidelines incorporated in a prescriptive framework for diagnostic decision making, the so-called Diagnostic Cycle. The construction of the interface, which entailed our first knowledge aquisition study, was described in the previous paper. The present paper reports on further research activities needed to construct the system. It primarily reports the results of a knowledge acquisition study in which almost all Dutch experts familiar with the current scientific literature and clinical practice participated. The study resulted in a reliable knowledge base of highly agreed upon diagnostic hypotheses, all relating one or more symptoms of reading and spelling problems to one or more factors currently considered to embody the best explanatory power for these symptoms.

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

computer-assisted diagnosis
educational diagnosis
reading disabilities
spelling disabilities


Exploring the economic value of personal information from firms financial statements Economic analysis of personal information has been qualitatively conducted, linked to privacy issues. This is not acceptable as prime online business models are dependent on personal information use. Company-level financial data can be used for approximating the value of personal data. Performance figures needs to be turned into a reliable economic value by considering future returns. It seems realistic that there are considerable regional differences in the economic value of a profile.

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

valuation of firm
intangible asset
online business model


New

vibrationrotation

code

for

tetraatomic

molecules

exhibiting

wide-amplitude

motion:

A

general

computational

method

for

the

accurate

calculation

of

rotationally

and

vibrationally

excited

states

of

tetraatomic

molecules

is

developed.

The

resulting

program

is

particularly

appropriate

for

molecules

executing

wide-amplitude

motions

and

isomerizations.

The

program

offers

a

choice

of

coordinate

systems

based

on

Radau,

Jacobi,

diatomdiatom

and

orthogonal

satellite

vectors.

The

method

includes

all

six

vibrational

dimensions

plus

three

rotational

dimensions.

Vibrationrotation

calculations

with

reduced

dimensionality

in

the

radial

degrees

of

freedom

are

easily

tackled

via

constraints

imposed

on

the

radial

coordinates

via

the

input

file.

Title

of

program:

Catalogue

number:

ADUN

Program

summary

Program

obtainable

from:

CPC

Program

Library,

Queen's

University

of

Belfast,

N.

Ireland

Licensing

provisions:

Persons

requesting

the

program

must

sign

the

standard

CPC

nonprofit

use

license

Computer:

Developed

under

UNIX,

ported

to

Microsoft

Windows

and

Sun

Unix

Operating

systems

under

which

the

program

has

been

tested:

Unix,

Microsoft

Windows,

Sun

Unix

Programming

language

used:

Fortran

Memory

required

to

execute

with

typical

data:

case

dependent

No.

of

lines

in

distributed

program,

including

test

data,

etc.:

No.

of

bytes

in

distributed

program,

including

test

data,

etc.:

Distribution

format:

tar.gz

Nature

of

physical

problem:

calculates

the

bound

ro-vibrational

levels

and

wavefunctions

of

a

tetraatomic

system

using

body-fixed

coordinates

based

on

generalised

orthogonal

vectors.

Method

of

solution:

The

angular

coordinates

are

treated

using

a

finite

basis

representation

(FBR)

based

on

products

of

spherical

harmonics.

A

discrete

variable

representation

(DVR)

based

on

either

Morse-oscillator-like

or

spherical-oscillator

functions

is

used

for

the

radial

coordinates.

Matrix

elements

are

computed

using

an

efficient

Gaussian

quadrature

in

the

angular

coordinates

and

the

DVR

approximation

in

the

radial

coordinates.

The

solution

of

the

secular

problem

is

carried

through

a

series

of

intermediate

diagonalisations

and

truncations.

Restrictions

on

the

complexity

of

the

problem:

The

size

of

the

final

Hamiltonian

matrix

that

can

be

practically

diagonalised;

The

DVR

approximation

for

a

radial

coordinate

fails

for

values

of

the

coordinate

near

zerothis

is

remedied

only

for

one

radial

coordinate

by

using

analytical

integration.

Typical

running

time:

problem-dependent

Unusual

features

of

the

program:

A

user-supplied

subroutine

to

evaluate

the

potential

energy

is

a

program

requirement.

External

routines:

BLAS

and

LAPACK

are

required.

References:

J.C.

Light,

I.P.

Hamilton,

J.V.

Lill,

J.

Chem.

Phys.

J.R.

Henderson,

C.R.

Le

Sueur,

J.

Tennyson,

Comp.

Phys.

Comm.

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

wavefunctions
discrete variable representation
finite basis representation
tetraatomic

ro-vibrational
bound states
body-fixed
4-atom


Applying data fusion techniques for benthic habitat mapping and monitoring in a coral reef ecosystem Accurate mapping and effective monitoring of benthic habitat in the Florida Keys are critical in developing management strategies for this valuable coral reef ecosystem. For this study, a framework was designed for automated benthic habitat mapping by combining multiple data sources (hyperspectral, aerial photography, and bathymetry data) and four contemporary imagery processing techniques (data fusion, Object-based Image Analysis (OBIA), machine learning, and ensemble analysis). In the framework, 1-m digital aerial photograph was first merged with 17-m hyperspectral imagery and 10-m bathymetry data using a pixel/feature-level fusion strategy. The fused dataset was then preclassified by three machine learning algorithms (Random Forest, Support Vector Machines, and k-Nearest Neighbor). Final object-based habitat maps were produced through ensemble analysis of outcomes from three classifiers. The framework was tested for classifying a group-level (3-class) and code-level (9-class) habitats in a portion of the Florida Keys. Informative and accurate habitat maps were achieved with an overall accuracy of 88.5% and 83.5% for the group-level and code-level classifications, respectively.

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

data fusion
machine learning
benthic habitat mapping
hyperspectral imagery
coral reef ecosystem


Self-adaptive ant colony optimization for construction time-cost optimization Purpose - This research aims to propose self-adaptive ant colony optimization (SACO) with changing parameters for solving time-cost optimization (TCO) problems to assist the relevant construction management firm with their technological tool. Design/methodology/approach - A SACO with changing parameters based on information entropy has been employed to model TCO problem, which overcomes the intrinsic weakness of premature convergence of the basic ant colony optimization by adjusting parameters according to mean information entropy of the ant system. A computer simulation with Matlab 7.0 based on a prototype example has been carried out on the basis of SACO for TCO problem. Findings - The test results show that the SACO for TCO model can generate a better cost under the same duration and achieve a better Pareto front than other models. Therefore, the SACO can be regarded as a useful approach for solving construction project TCO problems. Research limitations/implications Further research on selection parameters should be conducted to further improve the robustness of the SACO for TCO model. Practical implications The modelling results can help the construction management to good result of TCO problems in construction sites. Originality/value - A new approach to study the TCO model is proposed based on SACO.

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

project management
multiobjective optimization
time-cost optimization


MultiFusion: A Boosting Approach for Multimedia Fusion The multimodal data usually contain complementary, correlated and redundant information. Thus, multimodal fusion is useful for many multisensor applications. Here, a novel multimodal fusion algorithm is proposed, which is referred to as "MultiFusion." The approach adopts a boosting structure where the atomic event is considered as the fusion unit. The correlation of multimodal data is used to form an overall classifier in each iteration. Moreover, by adopting the Adaboost-like structure, the overall fusion performance is improved. Both the simulation experiment and the real application show the effectiveness of the MultiFusion approach. Our approach can be applied in different multimodal applications to exploit the multimedia data characteristics and improve the performance.

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

algorithms
decision fusion
atomic event multimodal fusion
adaboost


A Competitive Layer Model for Cellular Neural Networks ? This paper discusses a Competitive Layer Model (CLM) for a class of recurrent Cellular Neural Networks (CNNs) from continuous-time type to discrete-time type. The objective of the CLM is to partition a set of input features into salient groups. The complete convergence of such networks in continuous-time type has been discussed first. We give a necessary condition, and a necessary and sufficient condition, which allow the CLM performance existence in our networks. We also discuss the properties of such networks of discrete-time type, and propose a novel CLM iteration method. Such method shows similar performance and storage allocation but faster convergence compared with the previous CLM iteration method (Wersing, Steil, & Ritter, 2001a). Especially for a large scale network with many features and layers, it can significantly reduce the computing time. Examples and simulation results are used to illustrate the developed theory, the comparison between two CLM iteration methods, and the application in image segmentation.

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

competitive layer model
cellular neural networks

continuous-time recurrent neural networks


Estimation of surface area and surface area measure of three-dimensional sets from digitizations A local method for estimating surface area and surface area measure of three-dimensional objects from discrete binary images is presented. A weight is assigned to each 222 configuration of voxels and the total surface area of an object is given by summation of the local area contributions. The method is based on an exact asymptotic result that holds for increasing resolution of the digitization. It states that the number of occurrences of a 2 22 configuration is asymptotically proportional to an integral of its h-function with respect to the surface area measure of the object. We find explicit representations for these h-functions. Analyzing them in detail, we determine weights that lead to an asymptotic worst case error for surface area estimation of less than 4%. We show that this worst case error is the best possible. Exploiting the local nature of the asymptotic result, we also establish two parametric estimators for the surface area measure. The latter allow to quantify anisotropy of the object under consideration. Simulation studies illustrate the validity of the estimation procedure also for finite, but sufficiently high resolution.

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

surface area
anisotropy
configuration
local method

surface area measure
3d binary image
gauss digitization
rose of normal directions


Personal knowledge management Putting the "person" back into the knowledge equation INTRODUCTION Purpose - The author aims to introduce this themed issue on personal knowledge management. Design/methodology/approach - The author discusses some of the issues surrounding personal and organisational knowledge management, and then introduces the papers in this themed issue. Findings - Personal knowledge management is an under-researched area. This themed issue contributes both technical and theoretical papers to the field. Originality/value - The paper provides an introduction to this themed issue.

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

knowledge management systems
knowledge organizations


Scattering from a coated perfect electromagnetic conducting elliptic cylinder An exact analytic solution is presented to the problem of scattering from a coated perfect electromagnetic conducting (PEMC) elliptic cylinder, when it is illuminated by a plane wave as well as a line source. The problem is formulated by expanding the various fields in terms of appropriate angular and radial Mathieu functions and a set of expansion coefficients. The expansion coefficients associated with the incident fields are known, but those associated with the scattered fields and the fields within the coating are unknown. Imposing boundary conditions at the surface of the PEMC elliptic cylinder and the surface of the coating, enables the determination of the unknown expansion coefficients. Results are presented in the form of normalized scattering widths for elliptic cylinders of various sizes, PEMC admittances, and different coatings, to show the effects of these on scattering.

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

mathieu function expansions
metamaterials


on the relationship of model transformations based on triple and plain graph grammars Triple graph grammars have been applied and implemented as a formal basis for model transformations in a variety of application areas. They convince by special abilities in automatic derivation of forward, backward and several other transformations out of just one specified set of rules for the integrated model defined by a triple of graphs. While many case studies and all implementations, which state that they are using triple graph grammars, do not use triples of graphs, this paper presents the justification for many of them. It shows a one to one correspondence between triple graph grammars and suitable plain graph grammars, thus results and benefits of the triple case can be transferred to the plain case. Main results show the relationship between both graph transformation approaches, syntactical correctness of model transformations based on triple graph grammars and a sound and complete condition for functional behaviour. Theoretical results are elaborated on an intuitive case study for a model transformation from class diagrams to database models.

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

model transformation
graph transformation
triple graph grammars


Health information systems: Between shared care and body area networks - Findings from the section on health information systems Objectives: To summarize current excellent research in the field of health information systems (HIS). Methods: Synopsis of the articles selected for the IMIA Yearbook 2006. Results: Current research in the field of HIS is focused on supporting transinstitutional health care processes including health record systems, integration of new data types and knowledge based decision support, patient empowerment, the utilization of new technologies like wearable systems or ubiquitous computing in home and personal care, and methods and tools for the analysis, development, management, and evaluation of HIS. Conclusions: The best paper selection of articles on HIS comprises examples of excellent research on integration of HIS based on standards for electronic health records, methods and tools for HIS oriented change management, the use of wearable systems for telemedical surveillance of chronically ill patient, technology driven home care concepts for the elderly and physically disabled, and data privacy issues arising from the emergence of new clinical data types in the context of biomedicine. Besides successful research concerning important aspects of HIS, achieving interoperability and integration of health information subsystems and technology remains an important field of work.

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

international medical informatics association


Complexity Analysis of Pipeline Mapping Problems in Distributed Heterogeneous Networks Largescale scientific applications require using various system resources to execute complex computing pipelines in distributed networks to support collaborative research. System resources are typically shared in the Internet or over dedicated connections based on their location, availability, capability, and capacity. Optimizing the network performance of computing pipelines in such distributed environments is critical to the success of these applications. We consider two types of largescale distributed applications: interactive applications where a single dataset is sequentially processed along a pipeline; and streaming applications where a series of datasets continuously flow through a pipeline. The computing pipelines of these applications consist of a number of modules executed in a linear order in network environments with heterogeneous resources under different constraints. Our goal is to find an efficient mapping scheme that allocates the modules of a pipeline to network nodes for minimum endtoend delay or maximum frame rate. We formulate the pipeline mappings in distributed environments as optimization problems and categorize them into six classes with different optimization goals and mapping constraints: Minimum Endtoend Delay with No Node Reuse (MEDNNR), Minimum Endtoend Delay with Contiguous Node Reuse (MEDCNR), Minimum Endtoend Delay with Arbitrary Node Reuse (MEDANR), Maximum Frame Rate with No Node Reuse or Share (MFRNNRS), Maximum Frame Rate with Contiguous Node Reuse and Share (MFRCNRS), and Maximum Frame Rate with Arbitrary Node Reuse and Share (MFRANRS). Here, contiguous node reuse means that multiple contiguous modules along the pipeline may run on the same node and arbitrary node reuse imposes no restriction on node reuse. Note that in interactive applications, a node can be reused but its resource is not shared. We prove that MEDANR is polynomially solvable and the rest are NP-complete. MEDANR, where either contiguous or noncontiguous modules in the pipeline can be mapped onto the same node, is essentially the Maximum n-hop Shortest Path problem, and can be solved using a dynamic programming method. In MEDNNR and MFRNNRS, any network node can be used only once, which requires selecting the same number of nodes for onetoone onto mapping. We show its NP-completeness by reducing from the Hamiltonian Path problem. Node reuse is allowed in MEDCNR, MFRCNRS and MFRANRS, which are similar to the Maximum n-hop Shortest Path problem that considers resource sharing. We prove their NP-completeness by reducing from the Disjoint-Connecting-Path Problem and Widest path with the Linear Capacity Constraints problem, respectively.

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

computational complexity
np-complete
distributed computing


automatic phase detection for stochastic on-chip traffic generation During System on Chip (SoC) design, Network on Chip (NoC) prototyping is used for adapting NoC parameters to the application running on the chip. This prototyping is currently done using traffic generators which emulate the SoC components (IPs) behavior: processors, hardware accelerators, etc. Traffic generated by processor-like IPs is highly non-regular, it must be decomposed into program phases. We propose an original feature for NoC prototyping, inspired by techniques used in processor architecture performance evaluation: the automatic detection of traffic phases. Integrated in our NoC prototyping environment, this feature permits to have a completely automatic toolchain for the generation of stochastic traffic generators. We show that our traffic generators emulate precisely the behavior of processors and that our environment is a versatile tool for networks-on-chip prototyping. Simulations are performed in a SystemC-based simulation environment with a mesh network-on-chip (DSPIN) and a processor running MP3 decoding applications.

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

traffic generation
performance evaluation

network-on-chip
phase behavior
stochastic traffic modeling


The exact unconditional z-pooled test for equality of two binomial probabilities: optimal choice of the Berger and Boos confidence coefficient Exact unconditional tests for comparing two binomial probabilities are generally more powerful than conditional tests like Fisher's exact test. Their power can be further increased by the Berger and Boos confidence interval method, where a p-value is found by restricting the common binomial probability under H-0 to a 1 - gamma confidence interval. We studied the average test power for the exact unconditional z-pooled test for a wide range of cases with balanced and unbalanced sample sizes, and significance levels 0.05 and 0.01. The detailed results are available online on the web. Among the values 10(-3), 10(-4), ... , 10(-10), the value gamma = 10(-4) gave the highest power, or close to the highest power, in all the cases we looked at, and can be given as a general recommendation as an optimal gamma.

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

2 x 2 table
pearson's chi-squared
small sample


Diffusion Tensor Imaging of the Spinal Cord The spinal cord is an important part of the nervous system and provides the connection of the brain with the periphery. It consists not only of a large number of longitudinal fibers, but also contains collateral fibers and a central gray matter structure, which are part of autonomous circuits. Magnetic resonance diffusion tensor imaging can reveal this complex fiber architecture in great detail. This report summarizes the normal findings for ADC, diffusion anisotropy, and diffusion eigenvector directions in the spinal cord. Sagittal and axial diffusion-weighted images of the spinal cord were obtained with line scan diffusion imaging (LSDI) in adults, children, infants, and a spinal cord specimen.

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

collateral nerve fibers
white matter
second eigenvector


Implementing surfactant mass balance in 2D FEMALE models Practical aspects of implementing surfactant mass balance computation in finite elements models, where the model geometry shape change is captured by utilizing the arbitrary LagrangeEulerian method are discussed briefly. The discussion and the reported simulations are carried out in two-dimensional Cartesian coordinates. Two alternative approaches to formulating the governing equation of surfactant mass balance for solving it computationally are presented and discussed. One of the approaches is based on computing the boundary curvature and boundary tangential velocity, as well as their differentials on the boundary, directly. The other approach is based on reformulating the governing equation in order to track the proportional rate of change of local surface area. As a conclusion, it is found that though both of the presented approaches can be configured to perform adequately in terms of surfactant mass conservation, surface differentials that are necessary to compute the surface curvature and surface tangential velocity in the first one of the methods evoke numerical oscillations near those points of the boundary where it is not smooth. The text is accompanied by example simulations and figures.

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

surfactant modeling
ale method
curvature computation
surface deformation


Engineering change propagation system using STEP Reducing the time for engineering changes can greatly shorten a product's life cycle and improve the productivity of enterprises. This work proposes an approach to engineering change propagation between CAD and product data management (PDM) systems. A system for modeling and triggering changes of models of engineering data, geometries, and features, using STEP AP 214 and AP224, is developed.,A change in CAD and PDM systems can propagate along a defined path and trigger a rule by which data of another system are changed. The proposed engineering change propagation (ECP) system provides a flexible, virtually integrated framework to enable engineering change. Affected items and propagation sequences of engineering changes are inferred with the help of an ECP network. Engineering change issued between a STEP-based solid modeling system and a PDM system is implemented and discussed to demonstrate the capability of the ECP system. Change in the feature parameters of a CAD system is propagated and the relevant data, defined in the ECP network, are triggered. Enterprises can use the ECP system to integrate various information systems, such as CAx, PDM, CAPP, ERP, and others, and facilitate collaborative engineering using a virtual framework, to promote competition.

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

engineering change
step
product data management

concurrent engineering
change propagation


Prediction of daily ozone concentration maxima in the urban atmosphere A model for the prediction of daily O-3 concentration maxima several hours in advance is reported. The model is developed for an urban area of warm oceanic climate and can be easily integrated with automatic pollution and meteorological stations. It provides a basis for issuing advance warnings to the public before O-3 peaks are reached. It also affords straightforward interpretation of the processes leading to O-3 level changes as the predicted O-3 concentrations are directly related to variables with physical meaning. The correlations between O-3 concentrations and other pollutants, e.g. CO, NO, NO2, SO2, suspended particles as well as meteorological variables, e.g. wind speed, temperature, relative humidity, rainfall, solar radiation, cloud cover and light intensity, were evaluated prior to the selection of variables for the model. Multiple linear regression with forward stepwise method has defined seasonal, photochemical and persistence components that account for the seasonal influence of O-3 production, the relations between O-3 and NOx, and previous day O-3 levels, respectively. The model was calibrated using data collected over a period of two years and its performance for prediction was evaluated by calculation of the daily O-3 concentration maxima over the subsequent two years and comparing the predictions to measured values. (c) 2005 Elsevier B.V. All rights reserved.

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

urban air quality
ozone prediction
ozone daily maximum
mlr model
seasonal behaviour


A software-based dynamic-warp scheduling approach for load-balancing the Viola-Jones face detection algorithm on GPUs Face detection is a key component in applications such as security surveillance and human-computer interaction systems, and real-time recognition is essential in many scenarios. The Viola-Jones algorithm is an attractive means of meeting the real time requirement, and has been widely implemented on custom hardware, FPGAs and GPUs. We demonstrate a GPU implementation that achieves competitive performance, but with low development costs. Our solution treats the irregularity inherent to the algorithm using a novel dynamic warp scheduling approach that eliminates thread divergence. This new scheme also employs a thread pool mechanism, which significantly alleviates the cost of creating, switching, and terminating threads. Compared to static thread scheduling, our dynamic warp scheduling approach reduces the execution time by a factor of 3. To maximize detection throughput, we also run on multiple GPUs, realizing 95.6 FPS on 5 Fermi CPUs. (C) 2013 Elsevier Inc. All rights reserved.

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


Recognizing human motions through mixture modeling of inertial data A method is proposed for unsupervised segment clustering of human motion capture data. Gaussian mixture models and dynamic time warping are used to compare similar data sequences. Human motion capture data was collected with a set of body-worn inertial sensors. The resultant classifier is compared with k-nearest-neighbor and support vector machine approaches.

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

human motion
inertial sensors
dynamic time warping

classification
recognition
segmentation
gaussian mixture model
minimum message length


a case study of icon-scenario based animated menu's concept development This paper reports on the implementation of the Icon-Scenario Based Animated Menu graphical user interface that is adopted across our latest 2G platform. We describe the concept development process of the phone's menu enhanced by the use of a captivating Icon-Scenario Based Animated Menu that takes usability into consideration and brings delight to users.

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

graphic user interface
icon-scenario based animated menu


Time series pattern discovery by a PIP-based evolutionary approach Time series are an important and interesting research field due to their many different applications. In our previous work, we proposed a time-series segmentation approach by combining a clustering technique, discrete wavelet transformation (DWT) and a genetic algorithm to automatically find segments and patterns from a time series. In this paper, we propose a perceptually important points (PIP)-based evolutionary approach, which uses PIP instead of DWT, to effectively adjust the length of subsequences and find appropriate segments and patterns, as well as avoid some problems that arose in the previous approach. To achieve this, an enhanced suitability factor in the fitness function is designed, modified from the previous approach. The experimental results on a real financial dataset show the effectiveness of the proposed approach.

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

genetic algorithm
segmentation
time series
clustering
perceptually important points


Special knowledge sharing incentive mechanism for two clients with complementary knowledge: A principal-agent perspective In this paper, we study how the firm share the special knowledge of two knowledge-complementarity clients by implementing a large and complex project which the firm out-sourced. Firstly, incentive mechanism for complementarity special knowledge sharing are designed for clients being risk-neutral and risk-averse respectively under the asymmetric information. Further, knowledge complementary effects and other relevant factors on the optimal incentive coefficient are analyzed. Lastly, the numerical results are reported. Crown Copyright (C) 2011 Published by Elsevier Ltd. All rights reserved.

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

knowledge sharing
knowledge complementary
incentive mechanism


mls-based scalar fields over triangle meshes and their application in mesh processing A novel technique that uses the Moving Least Squares (MLS) method to interpolate sparse constraints over mesh surfaces is introduced in this paper. Given a set of constraints, the proposed technique constructs, directly on the surface, a smooth scalar field that interpolates or approximates the constraints. Three types of constraints: point-value, point-gradient and iso-contour , are introduced to provide flexible control of the scalar field design. Furthermore, the framework also provides the user control over the region of influence and rate of influence decrease of the constraints, through parameter adjustment. We demonstrate that the scalar fields resulted from this framework can be used in several mesh applications such as skin deformation, region selection and curve drawing.

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

mesh processing
scalar field design
moving least squares

scattered data interpolation
geodesic path


an automated, yet interactive and portable db designer Tuning tools attempt to configure a database to achieve optimal performance for a given workload. Selecting an optimal set of physical structures is computationally hard since it involves searching a vast space of possible configurations. Commercial DBMSs offer tools that can address this problem. The usefulness of such tools, however, is limited by their dependence on greedy heuristics, the need for a-priori (offline) knowledge of the workload, and lack of an optimal materialization schedule to get the best out of suggested design features. Moreover, the open source DBMSs do not provide any automated tuning tools. This demonstration introduces a comprehensive physical designer for the PostgreSQL open source DBMS. The tool suggests design features for both offline and online workloads. It provides close to optimal suggestions for indexes for a given workload by modeling the problem as a combinatorial optimization problem and solving it by sophisticated and mature solvers. It also determines the interaction between indexes to suggest an effective materialization strategy for the selected indexes. The tool is interactive as it allows the database administrator (DBA) to suggest a set of candidate features and shows their benefits and interactions visually. For the demonstration we use large real-world scientific datasets and query workloads.

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

continuous tuning
index interaction
physical design tuning


Surgical gesture classification from video and kinematic data Surgical gesture recognition from video and kinematic data. Explanation of linear dynamical systems (LDSs) and their metrics. Extensive explanation of the bag of features (BoF) framework and its variations. Combination of LDS and BoF via Multiple Kernel Learning (MKL). Combination of heterogeneous data (video and kinematic). Recognition rates that outperform state of the art rates based on kinematic data.

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

surgical gesture classification
bag of features
multiple kernel learning

time series classification
dynamical system classification


Flows on few paths: Algorithms and lower bounds The classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part of this article we consider the unsplittable flow problem where all flow traveling from a source to a destination must be sent on only one path. We prove a lower bound of Omega (log m/ log log rn) on the performance of a general class of algorithms for minimizing congestion where m is the number of edges in a graph. These algorithms start with a solution for the classical multicommodity flow problem, compute a path decomposition, and select one of its paths for each commodity in order to obtain an unsplittable flow. Our result matches the best known upper bound for randomized rounding-an algorithm of this type introduced by Raghavan and Thompson. The k-splittable flow problem is a generalization of the unsplittable flow problem where the number of paths is bounded for each commodity. We study a new variant of this problem with additional constraints on the amount of flow being sent along each path. We present approximation results for two versions of this problem with the objective to minimize the congestion of the network. The key idea is to reduce the problem under consideration to an unsplittable flow problem while only losing a constant factor in the performance ratio. (C) 2006 Wiley Periodicals, Inc.

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

multicommodity flow
network flow
unsplittable flow

k-splittable flow
approximation algorithm
randomized rounding


LevelScheme: A level scheme drawing and scientific figure preparation system for Mathematica LevelScheme is a scientific figure preparation system for Mathematica. The main emphasis is upon the construction of level schemes, or level energy diagrams, as used in nuclear, atomic, molecular, and hadronic physics. LevelScheme also provides a general infrastructure for the preparation of publication-quality figures, including support for multipanel and inset plotting, customizable tick mark generation, and various drawing and labeling tasks. Coupled with Mathematica's plotting functions and powerful programming language, LevelScheme provides a flexible system for the creation of figures combining diagrams, mathematical plots, and data plots. Program summary Title of program: LevelScheme Catalogue identifier: ADVZ Program obtainable from: CPC Program Library, Queen's University of Belfast, N. Ireland Program summary URL: http://cpc.cs.qub.ac.uk/summaries/ADVZ Operating systems: Any which supports Mathematica; tested under Microsoft Windows XP, Macintosh OS X, and Linux Programming language used: Mathematica 4 Number of bytes in distributed program, including test and documentation: 3 05 1807 Distribution format: tar.gz Nature of problem: Creation of level scheme diagrams. Creation of publication-quality multipart figures incorporating diagrams and plots. Method of solution: A set of Mathematica packages has been developed, providing a library of level scheme drawing objects, tools for figure construction and labeling, and control code for producing the graphics. (C) 2005 Elsevier B.V. All rights reserved.

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

level scheme
drawing
plotting
figure preparation
mathematica


Reconstructing Surfaces of Particle-Based Fluids Using Anisotropic Kernels In this article we present a novel surface reconstruction method for particle-based fluid simulators such as Smoothed Particle Hydrodynamics. In particle-based simulations, fluid surfaces are usually defined as a level set of an implicit function. We formulate the implicit function as a sum of anisotropic smoothing kernels, and the direction of anisotropy at a particle is determined by performing Principal Component Analysis (PCA) over the neighboring particles. In addition, we perform a smoothing step that repositions the centers of these smoothing kernels. Since these anisotropic smoothing kernels capture the local particle distributions more accurately, our method has advantages over existing methods in representing smooth surfaces, thin streams, and sharp features of fluids. Our method is fast, easy to implement, and our results demonstrate a significant improvement in the quality of reconstructed surfaces as compared to existing methods.

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

algorithms
computer graphics
fluid simulation
physically based animation
anisotropic basis functions


A dynamic adaptive converter and management for PRAM-based main memory ? As DRAM-based main memory becomes a dominant factor in the energy consumption and cost of any computer system, new non-volatile memory technologies have been proposed to replace DRAMs. For example, PRAM is emerged as a leading alternative for main memory technology. However, the access latency of PRAM is significantly slower than that of DRAM and an interfacing converter is required to at least partly alleviate this latency difference. The interfacing converter sits between PRAM-based main memory and the last level of cache memory. In this paper, we present a proposed dynamic adaptive converter and its management scheme for PRAM-based main memory. In addition to overcoming long access latency, it provides enhanced endurance. The adaptive converter is composed of an aggressive streaming buffer to make better use of spatial locality by dynamically varying fetch size, a write buffer to improve endurance limit, and an adaptive filtering buffer to better utilize temporal locality. Our experimental results show that we can reduce buffer miss rate by about 59%, compared with using a single buffer structure with same space. Our approach also hides PRAM access latency more effectively. It improves the number of superblocks pre-fetched from main memory by 25%. Therefore, the converter shows its effectiveness comparable to a case with larger buffer space, without expending the extra power.

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

component
non-volatile memory
phase-change ram


Data-parallel polygonization Data-parallel algorithms are presented for polygonizing a collection of line segments represented by a data-parallel bucket PMR quadtree, a data-parallel R-tree, and a data-parallel R(+)-tree. Such an operation is useful in a geographic information system (GIS). A sample performance comparison of the three data-parallel structures for this operation is also given. (C) 2003 Published by Elsevier B.V.

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

data-parallel algorithms
hierarchical spatial data structures
lines


On testing equality of two censored samples This paper examines some stochastic processes derived from rank related statistics for testing equality of distributions of two samples with possibly censored data. Based on the martingale approach, the null distributions of these processes are approximated through simulating zero-mean Gaussian processes. Each observed process can then be compared with a large number of realizations from the corresponding Gaussian process. Based on these comparisons, a supremum test is discussed to assess equality of two censored samples. The proposed methods are illustrated in two applications.

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

survival analysis
weighted log-rank statistics


Energy-aware and self-adaptive anomaly detection scheme based on network tomography in mobile ad hoc networks Anomaly detection is indispensable for satisfying security services in mobile ad hoc network (MANET) applications. Often, however, a highly secure mechanism consumes a large amount of network resources, resulting in network performance degradation. To shift intrusion detection from existing security-centric design approaches to network performance centric design schemes, this paper presents a framework for designing an energy-aware and self-adaptive anomaly detection scheme for resource constrained MANETs. The scheme uses network tomography, a new technique for studying internal link performance based solely on end-to-end measurements. With the support of a module comprising a novel spatial-time model to identify the MANET topology, an energy-aware algorithm to sponsor system service, a method based on the expectation maximum to infer delay distribution, and a Self-organizing Map (SOM) neural network solution to profile link activity, the proposed system is capable of detecting link anomalies and localizing malicious nodes. Consequently, the proposed scheme offers a trade-off between overall network security and network performance, without causing any heavy network overload. Moreover, it provides an additional approach to monitor the spatial-time behavior of MANETs, including network topology, link performance and network security. The effectiveness of the proposed schemes is verified through extensive experiments.

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


Extraction of functional regularity in datapath circuits Datapath circuits exhibit a very high degree of regularity, which is exploited by designers to generate layouts with a high density and performance as well as to reduce the overall design effort. Regularity in a datapath circuit manifests itself at functional, structural, and topological levels, Functional regularity of a circuit implies the existence of logically equivalent subcircuits-a common feature of datapath circuits. We present a new and comprehensive approach to extract functional regularity for datapath circuits from their high-level or gate-level descriptions. The key step is the generation of a large set of templates, where a template is a subcircuit with multiple instances in the circuit. Two novel template generation algorithms are presented-one for templates with a tree structure, and the other for a special class of multioutput templates, called single-principal-output-graph (SPOG) templates, where all outputs of a template are in the transitive fanin of a particular output. The set of templates generated is shown to be complete under a few simplifying, Set practical, assumptions, which is key in obtaining a desirable cover of the circuit using templates. We present a few extensions to our regularity extraction approach to demonstrate its generality; these extensions include hierarchical representation of regularity and generation of instances of user-specified templates. We show that the generation of the above two classes of templates results in good covers for datapath circuits with a regular bus structure, including several International Conference on Computer-Aided Design benchmark circuits. The regularity extracted from these circuits can be used to easily understand their structure. We have successfully used our approach to identify bit slices of very large datapath circuits from general purpose microprocessors.

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

datapath circuits
functional regularity
templates

adders
graph covering
graph theory
hardware design languages (hdl)
hierarchical systems
trees


An optimum design methodology of active tuned mass damper for asymmetric structures The application of active tuned mass damper (ATMD) for the reduction of both the translational and torsional responses is discussed in the present paper to a two-degree-of-freedom (2DOF) torsionally coupled system (structure), able to represent the dynamic characteristics of the idealized one-storey asymmetric building consisting of a diaphragm (slab) supported by structural elements, such as frames or walls, in each of the two orthogonal directions, i.e. general asymmetric structures. Depending on the ratio of the torsional to the translational eigenfrequency, i.e. the torsional to translational frequency ratio (TTFR), of asymmetric structures, the following three scenarios can be distinguished: (1) torsionally flexible structures (TTFR 1.0). Taking into account the optimum position of the ATMD within the width of the asymmetric structure, a careful examination of the effects of the normalized eccentricity ratio (NER) on the performance of the ATMD is carried out by resorting to both the translational and the torsional displacement variances of the asymmetric structure. Extensive numerical simulations have been performed to accurately estimate the dynamic characteristics of the ATMD for asymmetric structures subject to ground acceleration. In the numerical simulations, the optimum parameter criterion of the ATMD is defined as the minimization of the minimum translational and torsional displacement variances of the asymmetric structure with the ATMD. Evaluation criterion on the effectiveness of the ATMD is selected as the ratio of the minimization of the minimum translational and torsional displacement variances of the asymmetric structure with the ATMD to the translational and torsional displacement variances of the asymmetric structure without the ATMD. Based on the four criteria above defined, the influences of both the NER and the TTFR of asymmetric structures are investigated on the optimum parameters and effectiveness of the ATMD.

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

torsional to translational frequency ratio (ttfr)


Application of Hardware Architecture of Genetic Algorithm for Optimal Packet Scheduling In Dense Wavelength Division Multiplexing (DWDM) technologies, the optimal packet scheduling issue is commonly encountered in multiple channel networks. NP-hard problems deal with finding a way to rearrange packets from multiple channels into a finite and rare channel. Genetic Algorithm (GA) is one of the most efficient ways to solve these issues. We hope to find a better solution to our task through the GA characteristics of multiprocessor searching and survival of the fittest. Therefore, a modified and achievable hardware architecture of GA is presented in this paper. This architecture can increase both the speed of packet scheduling and the efficiency of DWDM in Optical Communication Networks.

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

genetic algorithm
dense wavelength division multiplexing
packet scheduling


developing for autism with user-centred design This paper describes the process undertaken to develop software that allows children with Autism Spectrum Disorders (ASD) to explore social situations, in particular the concept of sharing. The User-Centred Design (UCD) process is described, along with adaptations made to alleviate anxiety resulting from the reduced social skills seen in ASD.

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

informants
autistic
user-centred design
ethnography


Is happy better than sad even if they are both non-adaptive? Effects of emotional expressions of talking-head interface agents Hedonic preference and contextual appropriateness are two general principles governing humans emotional expressions. People in general prefer perceiving and expressing positive emotions to negative ones, but also modulate their emotional expressions to be appropriate to social contexts. Although computer-based characters such as interface agents are able to express basic human emotions, they cannot yet automatically and effectively adapt their emotional expressions to the changing context. Would hedonic preference hold up without contextual appropriateness? A 22 mixed-design experiment (happy vs. sad expression by happy vs. sad context) (N=24) ( N = 24 ) was conducted with a talking-head agent presenting happy and sad novels to users. Supporting the hedonic preference principle, results showed that although both happy and sad agents were non-adaptive to the varying emotional tone of the context, the happy agent elicited greater intent to consume the books, more positive evaluation of the book reviews, more positive attitudes towards the agent and the interface, and more positive user experience than the sad agent.

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

interface agents
emotional expressions
hedonic preference
happy
sad


Numerical method satisfying the first two conservation laws for the Korteweg-de Vries equation In this paper, we develop a finite-volume scheme for the KdV equation which conserves both the momentum and energy. The main ingredient of the method is a numerical device we developed in recent years that enables us to construct numerical method for a PDE that also simulates its related equations. In the method, numerical approximations to both the momentum and energy are conservatively computed. The operator splitting approach is adopted in constructing the method in which the conservation and dispersion parts of the equation are alternatively solved; our numerical device is applied in solving the conservation part of the equation. The feasibility and stability of the method is discussed, which involves an important property of the method, the so-called Jensen condition. The truncation error of the method is analyzed, which shows that the method is second-order accurate. Finally, several numerical examples, including the Zabusky-Kruskal's example, are presented to show the good stability property of the method for long-time numerical integration. (C) 2007 Elsevier Inc. 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 B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

kdv equation
jensen condition
truncation error


Efficient Top-k Keyword Search Over Multidimensional Databases Keyword search over databases has recently received significant attention. Many solutions and prototypes have been developed. However, due to large memory consumption requirements and unpredictable running time, most of them cannot be applied directly to the situations where memory is limited and quick response is required, such as when performing keyword search over multidimensional databases in mobile devices as part of the OLAP functionalities. In this paper, the authors attack the keyword search problem from a new perspective, and propose a cascading top-k keyword search algorithm, which generates supernodes by a branch and bound method in each step of search instead of computing the Steiner trees as done in many existing approaches. This new algorithm consumes less memory and significantly reduces the response time. Experiments show that the method can achieve high search efficiency compared with the state-of-the-art approaches.

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

multidimensional database
ranking
supernode


A new SIMPLORER model for single-electron transistors In the first part of this paper, we present simulations of single-electron transistor (SET) output characteristic using Maple. Typical SET IV characteristics and charge energies curves are presented by developing Maple programs. In the second part of this work, we develop a new model without considering quantum effects using the superposition theorem, transfer function and Laplace transformer. Finally, we propose a new bloc using SIMPLORER 7.0 simulator to modulate quantum effects in the SET island. This model is based on a parallel analogdigital converter.

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

single-electron transistor
coulomb blockade oscillations
orthodox theory


A comparison of fraud cues and classification methods for fake escrow website detection The ability to automatically detect fraudulent escrow websites is important in order to alleviate online auction fraud. Despite research on related topics, such as web spam and spoof site detection, fake escrow website categorization has received little attention. The authentic appearance of fake escrow websites makes it difficult for Internet users to differentiate legitimate sites from phonies; making systems for detecting such websites an important endeavor. In this study we evaluated the effectiveness of various features and techniques for detecting fake escrow websites. Our analysis included a rich set of fraud cues extracted from web page text, image, and link information. We also compared several machine learning algorithms, including support vector machines, neural networks, decision trees, nave bayes, and principal component analysis. Experiments were conducted to assess the proposed fraud cues and techniques on a test bed encompassing nearly 90,000 web pages derived from 410 legitimate and fake escrow websites. The combination of an extended feature set and a support vector machines ensemble classifier enabled accuracies over 90 and 96% for page and site level classification, respectively, when differentiating fake pages from real ones. Deeper analysis revealed that an extended set of fraud cues is necessary due to the broad spectrum of tactics employed by fraudsters. The study confirms the feasibility of using automated methods for detecting fake escrow websites. The results may also be useful for informing existing online escrow fraud resources and communities of practice about the plethora of fraud cues pervasive in fake websites.

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

online escrow services
internet fraud
website classification


Efficiently determining a locally exact shortest path on polyhedral surfaces In this paper, we present an efficient visibility-based algorithm for determining a locally exact shortest path (LESP) from a source point to a destination point on a (triangulated) polyhedral surface. Our algorithm, of a finitely-iterative scheme, evolves an initial approximately shortest path into a LESP. During each iteration, we first compute the exact shortest path restricted on the current face sequence according to Fermats principle which affirms that light always follows the shortest optical path, and then optimize the face sequence where the path is not locally shortest on the polyhedral surface. Since the series of paths we obtained are monotonic decreasing in length, the algorithm gives a LESP which is shorter than the initial path, at conclusion. For comparison, we use various methods to provide an initial path. One of the methods is Dijkstras algorithm, and the others are the Fast Marching Method (FMM) and its improved version. Our intention for improvement is to overcome the limitation of acute triangulations in the original version. To achieve this goal, we classify all the edges into seven types according to different wavefront propagation manners, and dynamically determine the type of each edge for controlling the subsequent wavefront expansion. Furthermore, we give two approaches for backtracing the approximately shortest paths directed at the improved FMM. One exploits the known propagation manners of the edges as well as the Eulers method. This is another contribution in this paper.

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

computational geometry
discrete geodesics


Age differences in perceptions of online community participation among non-users: An extension of the Technology Acceptance Model This study examined age differences in perceptions of online communities held by people who were not yet participating in these relatively new social spaces. Using the Technology Acceptance Model (TAM), we investigated the factors that affect future intention to participate in online communities. Our results supported the proposition that perceived usefulness positively affects behavioral intention, yet it was determined that perceived ease of use was not a significant predictor of perceived usefulness. The study also discovered negative relationships between age and Internet self-efficacy and the perceived quality of online community websites. However, the moderating role of age was not found. The findings suggest that the relationships among perceived ease of use, perceived usefulness, and intention to participate in online communities do not change with age. Theoretical and practical implications and limitations were discussed.

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

online community
technology acceptance model


An evaluation approach to engineering design in QFD processes using fuzzy goal programming models Quality function deployment (QFD) is a product development process used to achieve higher customer satisfaction: the engineering characteristics affecting the product performance are designed to match the customer requirements. From the viewpoint of QFDs designers, product design processes are performed in uncertain environments, and usually more than one goal must be taken into account. Therefore, when dealing with the fuzzy nature in QFD processes, fuzzy approaches are applied to formulate the relationships between customer requirements (CRs) and engineering design requirements (DRs), and among DRs. In addition to customer satisfaction, the cost and technical difficulty of DRs are also considered as the other two goals, and are evaluated in linguistic terms. Fuzzy goal programming models are proposed to determine the fulfillment levels of the DRs. Differing from existing fuzzy goal programming models, the coefficients in the proposed model are also fuzzy in order to expose the fuzziness of the linguistic information. Our model also considers business competition by specifying the minimum fulfillment levels of DRs and the preemptive priorities between goals. The proposed approach can attain the maximal sum of satisfaction degrees of all goals under each confidence degree. A numerical example is used to illustrate the applicability of the approach.

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

quality function deployment (qfd)
fuzzy numbers


Two additive-constrained path selection in the presence of inaccurate state information We study quality-of-service (QoS) routing, particularly two additive-constrained path selection problem, in the presence of inaccurate state information. We formulate this problem as Most-Probable Two-Additive-Con strained Path (MP-TACP) problem. To solve it, we follow a probabilistic approach and propose an algorithm called MP-TACPA. In general, MP-TACPA uses pre- and on-demand computation along with both linear and nonlinear search techniques. In contrast to previous algorithms using similar techniques, MP-TACPA takes into account the inaccuracies along with new bounds and heuristics including look ahead and dominance probability. Extensive simulations show that MP-TACPA behaves very well in the presence of inaccurate state information. Specifically, it gives higher success rate in finding feasible paths than existing solutions that assume the availability of exact state information. In addition, its average computational cost and thus response time is better than typical on-demand path selection algorithms. (C) 2007 Elsevier B.V. All rights reserved.

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

pareto optimal
multiobjective optimization