Determining and representing width of soil boundaries using electrical conductivity and MultiGrid In classical soil mapping, map unit boundaries are considered crisp even though all experienced survey personnel are aware of the fact, that soil boundaries really are transition zones of varying width. However, classification of transition zone width on site is difficult in a practical survey. The objective of this study is to present a method for determining soil boundary width and a way of representing continuous soil boundaries in GIS. A survey was performed using the non-contact conductivity meter EM38 from Geonics Inc., which measures the bulk Soil Electromagnetic Conductivity (SEC). The EM38 provides an opportunity to classify the width of transition zones in an unbiased manner. By calculating the spatial rate of change in the interpolated EM38 map across the crisp map unit delineations from a classical soil mapping, a measure of transition zone width can be extracted. The map unit delineations are represented as transition zones in a GIS through a concept of multiple grid layers, a MultiGrid. Each layer corresponds to a soil type and the values in a layer represent the percentage of that soil type in each cell. As a test, the subsoil texture was mapped at the Vindum field in Denmark using both the classical mapping method with crisp representation of the boundaries and the new map with MultiGrid and continuous boundaries. These maps were then compared to an independent reference map of subsoil texture. The improvement of the prediction of subsoil texture, using continuous boundaries instead of crisp, was in the case of the Vindum field, 15%. (C) 2004 Elsevier Ltd. 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 B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O 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 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

soil boundary width
gis
soil mapping
transition zones


Evaluating cross-organizational impacts of information technology - an empirical analysis This paper documents information technology (IT) impacts that extend across organizational boundaries based on the economic theory. It evaluates how a firm's production cost is affected by the IT decisions of its business partners, over which it has no direct control. Using cross-sectional data on 100 audit engagements for the 100 largest continuing clients of a leading international public accounting firm's main office, it empirically evaluates the impact of the clients' IT choices on their supplier's (the public accounting firm's) production costs, professional allocations and product prices. The results indicate, other things being equal, that the higher intensity or complexity a client's IT exhibits, the more effort public accounting professionals need to exert, thus, the higher the production cost incurred by the public accounting firm. In contrast, the better documentation or security a client's IT furnishes, the lower the cost the public accounting firm sustains. Furthermore, such differences in production cost are eventually passed on to the client via differences in product price. European Journal of Information Systems (2010) 19, 153-167. doi: 10.1057/ejis.2010.9; published online 2 March 2010

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

cross-organizational impacts
externalities
information technology value
translog cost function
seemingly unrelated regression


A

computational

tool

for

FCNC

and

CP-violating

processes

in

the

MSSM

We

present

version

a

Fortran

program

that

calculates

low-energy

flavor

observables

in

the

general

R-parity

conserving

MSSM.

For

a

set

of

MSSM

parameters

as

input,

the

code

gives

predictions

for:

Electric

dipole

moments

of

the

leptons

and

the

neutron.

Anomalous

magnetic

moments

(i.e.

g

of

the

leptons.

Radiative

lepton

decays

(mu

e

gamma

and

tau

mu

gamma,

e

gamma).

Rare

Kaon

decays

over

bar

nu

and

K+

pi(+)(nu)

over

barv).

Leptonic

B

decays

(B-s,B-d

l(+)l(-),

B

D

tau

nu)

Radiative

B

decays

(B

(X)

over

bar

(s)gamma).

Delta

F

processes

((K)

over

bar

(D)

over

bar

-D,

(B)

over

bar

(d)-B-d

and

(B)

over

bar

(s)-B-s

mixing).

Comparing

to

where

the

matching

conditions

were

calculated

strictly

at

one-loop

level,

performs

the

resummation

of

all

chirally

enhanced

corrections,

i.e.

takes

into

account

the

enhanced

effects

from

tan

beta

and/or

large

trilinear

soft

mixing

terms

to

all

orders

in

perturbation

theory.

Also,

in

new

routines

calculation

of

B

(D)tau

nu,

g

radiative

lepton

decays

and

Br(l

l'gamma)

were

added.

All

calculations

are

done

using

exact

diagonalization

of

the

sfermion

mass

matrices.

The

program

can

be

obtained

from

Program

summary

Program

title:

Catalogue

identifier:

Program

summary

URL:

Program

obtainable

from:

CPC

Program

Library,

Queen's

University,

Belfast,

N.

Ireland

Licensing

provisions:

Standard

CPC

licence,

No.

of

lines

in

distributed

program,

including

test

data,

etc.:

No.

of

bytes

in

distributed

program,

including

test

data,

etc.:

Distribution

format:

tar.gz

Programming

language:

Fortran

Computer:

Any.

Operating

system:

Any,

tested

on

Linux.

Classification:

Does

the

new

version

supersede

the

previous

version?:

Yes

Catalogue

identifier

of

previous

version:

Journal

reference

of

previous

version:

Comput.

Phys.

Comm.

Nature

of

problem:

Predicting

CP-violating

observables,

meson

mixing

parameters

and

branching

ratios

for

set

of

rare

processes

in

the

general

R-parity

conserving

MSSM.

Solution

method:

We

use

standard

quantum

theoretical

methods

to

calculate

Wilson

coefficients

in

MSSM

and

at

one

loop

including

QCD

corrections

at

higher

orders

when

this

is

necessary

and

possible.

The

input

parameters

can

be

read

from

an

external

file

in

SLHA

format.

Reasons

for

new

version:

A

major

rewrite

of

the

internal

code

structure

to

accommodate

higher

order

corrections;

new

observables

added.

Summary

of

revisions:

is

able

to

perform

resummation

of

chirally

enhanced

corrections

to

all

orders

of

perturbation

expansion

included

terms

only).

Routines

calculating

new

observables

are

added:

lepton

magnetic

moment

anomaly,

mu

to

e

gamma

and

tau

to

e

gamma,

mu

gamma

decays,

B

to

D

tau

nu

decays,

B

to

mu

e,

tau

e,

tau

mu

decays.

Parameter

initialization

in

the

sfermion

sector

is

simplified

and

follows,

by

default,

the

conventions.

Restrictions:

The

results

apply

only

to

the

case

of

MSSM

with

R-parity

conservation.

Running

time:

For

a

single

parameter

set

approximately

s

in

double

precision

on

a

PowerBook

Mac

(c)

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

rare decays
flavor and cp violation
supersymmetry
general mssm
higher order resummation
fortran 77 code


large scale analysis of web revisitation patterns Our work examines Web revisitation patterns. Everybody revisits Web pages, but their reasons for doing so can differ depending on the particular Web page, their topic of interest, and their intent. To characterize how people revisit Web content, we analyzed five weeks of Web interaction logs of over 612,000 users. We supplemented these findings by a survey intended to identify the intent behind the observed revisitation. Our analysis reveals four primary revisitation patterns, each with unique behavioral, content, and structural characteristics. Through our analysis we illustrate how understanding revisitation patterns can enable Web sites to provide improved navigation, Web browsers to predict users' destinations, and search engines to better support fast, fresh, and effective finding and re-finding.

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

survey web analysis intent navigation predict interaction users revisitation support

understandability
query log analysis
large-scale
web browser
web behavior
pattern
contention
reasoning
structure
search engine
web page
behavior
re-finding
web site
effect


Structural

and

dynamical

studies

of

all-trans

and

all-cis

peptides

The

quantum

chemical

and

molecular

dynamics

studies

have

been

performed

to

infer

the

structural

changes

of

all-trans

and

all-cis

forms

of

cyclo[(1R,3S)-3-aminocyclohexanecarboxylicacid(gamma-Acc)-alpha-Glycine(Gly)](3)

hexapeptide.

The

backbone

conformations

of

the

above

peptide

have

been

analyzed

using

the

valence

and

peptide

deformation

angles

applying

level

of

theory.

The

conformational

preference

of

the

backbone

of

all-trans

and

all-cis

hexapeptides

is

found

to

depend

on

the

puckering

of

cyclohexane

rings.

The

non-uniform

distribution

of

water

inside

the

cavity

is

observed,

where

sometimes

water

molecules

formed

a

chain

like

conformation

through

hydrogen

bond

networks

while

traversing

the

pore

of

all-cis

peptide.

Larger

relaxation

times

of

the

order

of

a

hundred

to

two

hundred

pico

seconds

for

active

site...

water

hydrogen

bond

interactions

were

noticed.

The

hydrophobic

nature

of

the

cavity

of

all-trans

due

to

the

presence

of

cyclohexane

moiety

has

been

analyzed.

Further

this

investigation

emphasized

on

the

non-transport

of

molecules

through

the

pore

of

all-trans

peptide

due

to

the

obstruction

produced

by

cyclohexane

groups.

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

alpha-gamma cyclic peptides
hydrogen bond dynamics
hydrophobicity
molecular dynamics simulations
water transport


A CSP model with flexible parallel termination semantics In the original failure-divergence semantic model for Communicating Sequential Processes (CSP), the incomplete treatment of successful process termination, and in particular parallel termination, permitted unnatural processes to be defined. In response to these problems, a number of different solutions have been proposed by various authors since the original failure-divergence model was developed by Hoare, Brookes and Roscoe. This paper presents an alternative solution to this problem, which is both closer to the original semantic model and provides greater flexibility over the type of parallel termination semantics available in CSP.

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


Mutation-Driven Generation of Unit Tests and Oracles To assess the quality of test suites, mutation analysis seeds artificial defects (mutations) into programs; a nondetected mutation indicates a weakness in the test suite. We present an automated approach to generate unit tests that detect these mutations for object-oriented classes. This has two advantages: First, the resulting test suite is optimized toward finding defects modeled by mutation operators rather than covering code. Second, the state change caused by mutations induces oracles that precisely detect the mutants. Evaluated on 10 open source libraries, our mu TEST prototype generates test suites that find significantly more seeded defects than the original manually written test suites.

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

test case generation
unit testing
test oracles
assertions
search-based testing


Dynamic programming in parallel boundary detection with application to ultrasound intima-media segmentation Improve implementation of two dynamic programming for parallel boundary detection. Propose novel DP, dual line detection, featuring efficiency and rotation invariance. Propose coupled snake model that simultaneously deforms two contours. Dual line detection shows improved performance compared to previous DPs.

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

pl-ddp piecewise linear dual dynamic programming


the micon system for computer design The MICON system is an integrated collection of programs which automatically synthesizes small computer systems from high level specifications. The system addresses multiple levels of design, from logical through physical, providing a rapid prototyping capability. Two programs form MICON's nucleus: a knowledge-based synthesis tool called M1; and, an automated knowledge acquisition tool named CGEN which is used to teach M1 how to design. Other tools in the MICON system are an integrated database and associated data management tools. The system is fully functional, having been used to generate designs that have been fabricated. This paper describes the architecture and operation of the MICON system.

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

knowledge acquisition
systems
architecture
functional
design
tool
physical
synthesis
paper
data management
rapid prototyping
database
tools

program association computation collect knowledge automation integrability


Expert-mediated sequential search ? We study strategic information-brokers (experts) in sequential search environments. We characterize optimal consumer search strategies. We compare different pricing strategies for the expert. Subscription models are preferred in settings characteristic of electronic markets. Subsidizing access to expert services can increase social welfare.

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

e-commerce
artificial intelligence
sequential decision making
expert-mediated search


Chi-square-based Scoring Function for Categorization of MEDLINE Citations Objectives: Text categorization has been used in biomedical informatics for identifying documents containing relevant topics of interest. We developed a simple method that uses a chi-square-based scoring function to determine the likelihood of MEDLINE (R) citations containing genetic relevant topic. Methods: Our procedure requires construction of a genetic and a nongenetic domain document corpus. We used MeSH (R) descriptors assigned to MEDLINE citations for this categorization task. We compared frequencies of MeSH descriptors between two corpora applying chi-square test. A MeSH descriptor was considered to be a positive indicator if its relative observed frequency in the genetic domain corpus was greater than its relative observed frequency in the nongenetic domain corpus. The output of the proposed method is a list of scores for all the citations, with the highest score given to those citations containing MeSH descriptors typical for the genetic domain. Results: Validation was done on a set of 734 manually annotated MEDLINE citations. It achieved predictive accuracy of 0.87 with 0.69 recall and 0.64 precision. We evaluated the method by comparing it to three machine-learning algorithms (support vector machines, decision trees, naive Bayes). Although the differences were not statistically significantly different, results showed that our chi-square scoring performs as good as compared machine-learning algorithms. Conclusions: We suggest that the chi-square scoring is an effective solution to help categorize MEDLINE citations. The algorithm is implemented in the BITOLA literature-based discovery support system as a preprocessor for gene symbol disambiguation process.

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

applied statistics
text mining
natural language processing
document categorization


Large cliques or stable sets in graphs with no four-edge path and no five-edge path in the complement Erd?s and Hajnal [Discrete Math 25 (1989), 3752] conjectured that, for any graph H, every graph on n vertices that does not have H as an induced subgraph contains a clique or a stable set of size n?(H) for some ?(H)>0. The Conjecture 1. known to be true for graphs H with |V(H)|?4. One of the two remaining open cases on five vertices is the case where H is a four-edge path, the other case being a cycle of length five. In this article we prove that every graph on n vertices that does not contain a four-edge path or the complement of a five-edge path as an induced subgraph contains either a clique or a stable set of size at least n1/6. 2011 Wiley Periodicals, Inc. J Graph Theory

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

erd?shajnal conjecture
forbidden induced subgraphs


Cybernetics and systems on the web - Philosophy of information and messages in DNA Purpose - A recent discussion on the CybCom discussion list is reviewed, making a comparison of views of information due to Bateson and Shannon. The discussion extends to theories involving cellular automata and their relationship, as well as that of mathematics in general, to the real world. A recent suggestion that messages from extraterrestrials may be coded in DNA is discussed. Design/methodology/approach - The aim is to review developments on the internet, especially those of general cybernetic interest. Findings - The discussion is essentially philosophical and thought-provoking. Practical implications - A passing reference is made to methods for pattern recognition, and to the Bremermann limit with its bearing on ultimate computing capability. Attitudes to information exchange have a bearing on sociological theories, and behaviour of cellular automata is claimed to model communication between bacteria. The final note on extraterrestrial communication via DNA may redirect activity in the search for such communication and is evidence of an increasingly liberal attitude to scientific publication. Originality/value - It is hoped this is a valuable periodic review.

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


Ant colony optimization for nonlinear AVO inversion of network traffic allocation optimization Most local optimization algorithms are hard to search the global minimum. In this paper, we implemented and tested an AVO inversion scheme based on ACO algorithms. The ant colony optimization (ACO) algorithms are inspired by the behavior of ants to find solutions to combinatorial optimization problem. Inversion results of synthetic data and real model demonstrate that ACO algorithms applied in nonlinear AVO inversion should be considered well not only in terms of accuracy but also in terms of computation effort. Meanwhile it can provide a new approach to solve the nonlinear problems of network traffic allocation optimization. (C) 2010 Published by Elsevier Ltd.

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

aco algorithms
avo inversion
global minimum
network traffic
allocation optimization


Identification of piecewise linear uniform motion blur A motion blur identification scheme is proposed for nonlinear uniform motion blurs approximated by piecewise linear models which consist of more than one linear motion component. The proposed scheme includes three modules that are a motion direction estimator, a motion length estimator and a motion combination selector. In order to identify the motion directions, the proposed scheme is based on a trial restoration by using directional forward ramp motion blurs along different directions and an analysis of directional information via frequency domain by using a Radon transform. Autocorrelation functions of image derivatives along several directions are employed for estimation of the motion lengths. A proper motion combination is identified by analyzing local autocorrelation functions of non-flat component of trial restored results. Experimental examples of simulated and real world blurred images are given to demonstrate a promising performance of the proposed scheme.

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


Numerical simulation of anisotropic surface diffusion with curvature-dependent energy The aim of this paper is the numerical simulation of surface diffusion processes in the presence of a strong anisotropy and curvature dependence in the surface energy. We derive semi-implicit finite element discretizations based on a splitting into three second-order equations. The discretization we use yields indefinite linear systems for the nodal values of the height function, the curvature concentration, and the chemical potential. We provide several numerical examples and parametric studies with respect to some of the parameters in the surface energy and with respect to the coverage. The results, to our knowledge the first that have been obtained for this model, confirm theoretical predictions, namely partial faceting of the surfaces with rounded corners.

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


Response to Therapy in Myasthenia Gravis with Anti-MuSK Antibodies Myasthenia gravis (MG) with antibodies against the muscle-specific tyrosine kinase (MuSK abs) is often a severe disease requiring aggressive treatment. Various immunosuppressive (IS) regimens have been employed; the efficacy of plasma exchange is unanimously recognized, while the indication for thymectomy is controversial. We evaluated the response to therapy in 57 MuSK-positive patients (12 M/45 F) comparing our experience with other authors' results. Disease severity and response to treatment were graded according to MG Foundation of America; follow-up ranged from 0.529years. Owing to both MG severity and the unsatisfactory response to cholinesterase inhibitors, most patients (54/57) needed IS treatment, and 35 received one or more courses of plasma exchange and intravenous immunoglobulin. At the end of follow-up, the rate of complete remission was 8.8%, and IS treatment had been withdrawn in only 10/54 patients. The extent of therapeutic response varied considerably. With conventional IS therapy (prednisone alone or in combination with azathioprine or cyclosporine), most patients achieved good control of their disease, but 30% of them were left with permanent facial and bulbar weakness. In patients with refractory disease, the use of mycophenolate mofetil and rituximab proved very effective, as also reported by other authors. In our and others' experience, MuSK-positive MG markedly improves with IS therapy, although, in comparison with the AChR-positive disease, it is characterized by a lower remission rate, as a higher proportion of patients remain dependent on treatment. Thymectomy is mostly considered scarcely effective; however, at present, no firm conclusions can be drawn on its role in the treatment of this form of MG.

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

cholinesterase inhibitors
thymectomy
plasma exchange

anti-musk antibodies
musk-positive myasthenia gravis
corticosteroids
immunosuppressive therapy


Testability Optimizations for A Time Multiplexed CPLD Implemented on Structured ASIC Technology Multi-context dynamic reconfigurable architectures can use of both spatial and temporal aspects of logic capacity. Gaining logic capacity by reusing hardware with time multiplexing techniques requires controlling logic using small distributed memories. This can create testability problems for dynamic reconfigurable architectures. In this paper we are analysing the test coverage loss and proposing a test extension for a CPLD like dynamic reconfigurable architecture. The proposed solution is implemented in structured ASIC technology and helps in regaining the test coverage with no area and timing penalty.

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


Invariant image watermarking using multi-scale Harris detector and wavelet moments Desynchronization attack is known as one of the most difficult attacks to resist, which can desynchronize the location of the watermark and hence causes incorrect watermark detection. It is a challenging work to design a robust image watermarking scheme against desynchronization attacks. Based on multi-scale Harris detector and wavelet moment theory, we propose a new content based image watermarking algorithm with low computational complexity, good visual quality and reasonable resistance toward desynchronization attacks in this paper. Firstly, the steady image feature points are extracted from the origin host by using multi-scale Harris detector, and the local feature regions (LFRs) are constructed adaptively according to the feature scale theory. Then, the LFRs are image normalized, and significant regions are obtained from the normalized LFRs by utilizing the invariant centroid theory. Finally, the digital watermark is embedded into the LFRs by modifying wavelet moment invariants of the significant regions. By binding the watermark with the geometrically invariant image features, the watermark detection can be done without synchronization error. Experimental results show that the proposed image watermarking is not only invisible and robust against common image processing operations as sharpening, noise adding, and JPEG compression etc, but also robust against the desynchronization attacks such as rotation, translation, scaling, row or column removal, cropping, and local random bend etc.

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

image watermarking
desynchronization attacks
wavelet moments


An automatic algorithm for approximating boundary of bitmap characters In this paper, an automatic and efficient algorithm for outline capture of character images, stored as bitmap, is presented. This method is well suited for characters of non-Roman languages like Arabic, Japanese, Urdu, Persian, etc. Contemporary word processing systems store shapes of the characters in terms of their outlines, and outlines are expressed as cubic Bezier curves. The process of capturing outlines includes steps: detection of boundary, finding Corner Points and Break Points and fitting the curve. The work done in this paper, fully automate the above process and produces optimal results.

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

digital character images
significant points
boundary points
reparameterization


Memory-restricted latent semantic analysis to accumulate term-document co-occurrence events This paper addresses a novel adaptive problem of obtaining a new type of term-document weight. In our problem, an input is given by a long sequence of co-occurrence events between terms and documents, namely, a stream of term-document co-occurrence events. Given a stream of term-document co-occurrences, we learn unknown latent vectors of terms and documents such that their inner product adaptively approximates the target query-based term-document weights resulting from accumulating co-occurrence events. To this end, we propose a new incremental dimensionality reduction algorithm for adaptively learning a latent semantic index of terms and documents over a collection. The core of our algorithm is its partial updating style, where only a small number of latent vectors are modified for each term-document co-occurrence, while most other latent vectors remain unchanged. Experimental results on small and large standard test collections demonstrate that the proposed algorithm can stably learn the latent semantic index of terms and documents, showing an improvement in the retrieval performance over the baseline method.

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

dimensionality reduction
latent semantic analysis


Reliable circuit techniques for low-voltage analog design in deep submicron standard CMOS: A tutorial We present in this paper an overview of circuit techniques dedicated to design reliable low-voltage (1-V and below) analog functions in deep submicron standard CMOS processes. The challenges of designing such low-voltage and reliable analog building blocks are addressed both at circuit and physical layout levels. State-of-the-art circuit topologies and techniques ( input level shifting, bulk and current driven, DTMOS), used to build main analog modules ( operational amplifier, analog CMOS switches) are covered with the implementation of MOS capacitors.

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

bulk driven and current driven bulk opamp


Pricing calls to mobiles: analysis of the UK Monopolies & Mergers Commission Reports on mobile termination charges ? The UK Monopolies and Mergers Commission (MMC) nine-month inquiry into fixed-to-mobile termination charges provides an exhaustive analysis of competitive and cost factors in mobile telephony. Its recommendations are discussed and compared with those of the telecommunications regulator, OFTEL, which referred the mobile operators to the MMC after failure to agree a further reduction in charges in early 1998. The MMC, following the same general statutory duty required of OFTEL, to promote competition under the Telecommunications Act 1984, provided a radically different analysis and disagreed with most of OFTEL's specific proposals suggesting that some were anti-competitive. As telecommunications regulators are increasingly required to implement pro-competitive regulation, the MMC's reports show that the evolving approach of sectoral regulators contains some significant flaws.

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

mobile call termination
mobile network operators


Characterization and detection of taxpayers with false invoices using data mining techniques In this paper we give evidence that it is possible to characterize and detect those potential users of false invoices in a given year, depending on the information in their tax payment, their historical performance and characteristics, using different types of data mining techniques. First, clustering algorithms like SOM and neural gas are used to identify groups of similar behaviour in the universe of taxpayers. Then decision trees, neural networks and Bayesian networks are used to identify those variables that are related to conduct of fraud and/or no fraud, detect patterns of associated behaviour and establishing to what extent cases of fraud and/or no fraud can be detected with the available information. This will help identify patterns of fraud and generate knowledge that can be used in the audit work performed by the Tax Administration of Chile (in Spanish Servicio de Impuestos Internos (SII)) to detect this type of tax crime.

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


tool support for data validation by end-user programmers End-user programming tools for creating spreadsheets and webforms offer no data types except "string" for storing many kinds of data, such as person names and street addresses. Consequently, these tools cannot automatically validate these data. To address this problem, we have developed a new userextensible model for string-like data. Each "tope" in this model is a user-defined abstraction that guides the interpretation of strings as a particular kind of data, such as a mailing address. Specifically, each tope implementation contains software functions for recognizing and reformatting that tope's kind of data. With our tools, end-user programmers define new topes and associate them with fields in spreadsheets, webforms, and other programs. This makes it possible at runtime to distinguish between invalid data, valid data, and questionable data that could be valid or invalid. Once identified, questionable and/or invalid data can be double-checked and possibly corrected, thereby increasing the overall reliability of the data.

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


experiment and evaluation of the rampe interactive auditive information system for the mobility of blind people in public transport This paper will present the design and experimentation of the RAMPE system intended for the assistance and information of visually disabled/impaired people so that they can increase their mobility and autonomy in public transports. The system is intended to equip bus or tramway stops or to be installed in connection link. It is based either on a remote control (RC) or on a smart hand-held WiFi enabled device like a Personal Digital Assistant (PDA) able to communicate by a WiFi connection with fixed equipment in stations to retrieve travelers information. This system has been evaluated by Visually Disabled People (VDP) in real public transport environment in the city of Lyon in France. Ergonomics data has been collected during the experiment and analyzed, showing the usability of such devices by VDP and hence also by Visually Impaired Peoples (VIP).

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

visually disabled/impaired people
real-time travelers information system
wlan
design for all
pervasive computing
assistive device


Improving enterprise resource planning (ERP) fit to organizational process through knowledge transfer Critical to enterprise resource planning (ERP) implementation is the fit between the system and the processes in an organization. Knowledge about the ERP system must flow from those implementing the system and those responsible once in production. Effective knowledge transfer is assisted by the absorptive capacity of the learner and the competence of the knowledge holder, as reflected in the client and consultant relationship of this study. A model of transfer is composed from existing theories of learning to explain the roles played by the client through absorptive capacity and the consultant through competence. Survey data of CIOs in Taiwan confirm that transfer is improved with higher levels of capacity and competence, while the transfer process leads to a better fit between ERP systems and organizational processes. Management needs to foster the build-up of their internal knowledge stocks in order to stimulate the flow of knowledge transfer.

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

erp implementation
knowledge transfer
absorptive capacity


A study of academic performance of business school graduates using neural network and statistical techniques Over the past several years, there is tremendous increase in the number of applicants to business schools and hence adequately measuring the potential of these students with regard to their academic performance is an important process of admission decision for any business school. In the present study, an analysis is carried out to predict the academic performance of business school graduates using neural networks and traditional statistical techniques and results are compared to evaluate the performance of these techniques. The underlying constructs in a traditional business school curriculum are also identified and its relevance with the various elements of admission process is presented.

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

discriminant analysis
logistic regression
regression analysis


Partial words and a theorem of Fine and Wilf A partial word is a word that is a partial mapping into an alphabet. We prove a variant of Fine and Wilf's theorem for partial words, and give extensions of some general combinatorial properties of words. (C) 1999 Elsevier Science B.V. All rights reserved.

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


On link-level starvation in dense 802.11 wireless community networks With the growing number of spontaneously deployed WiFi hotspots and home networks, end-users often experience significant performance degradation or even starvation. However, we observe that tuning individual system parameters (channel, Tx power, carrier sense threshold, transmit rate, etc.) is insufficient and may lead to starvation in some cases. In this paper, we develop a comprehensive analytical model to characterize the throughput of individual links in dense IEEE 802.11 wireless community networks that accounts for heterogeneous transmission power levels and CS thresholds, as well as various sources of packet collisions. Based on the insight from the theoretical analysis, we propose a simple identification mechanism that can determine the sources of starvation using local measurements. Both the theoretical model and the identification algorithm are validated using testbed experiments and ns-2 simulations.

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

ieee 802.11 wireless community networks
hidden node
asymmetric sense


Comments on "An efficient search direction for linear programming problems" by H. Luh and R. Tsaih With regard to the paper "An efficient search direction for linear programming problems" by Luh and Tsaih (Comput. and Oper. Res. 29 (2002) 195), we provide a correction of a mathematical error, and we modify the auxiliary algorithm in the above reference. We also introduce a new initial search direction when the algorithm begins at an interior feasible point. Numerical results are presented to show that this search direction can substantially improve the efficiency of the algorithm.

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


mining specifications of malicious behavior Malware detectors require a specification of malicious behavior. Typically, these specifications are manually constructed by investigating known malware. We present an automatic technique to overcome this laborious manual process. Our technique derives such a specification by comparing the execution behavior of a known malware against the execution behaviors of a set of benign programs. In other words, we mine the malicious behavior present in a known malware that is not present in a set of benign programs. The output of our algorithm can be used by malware detectors to detect malware variants. Since our algorithm provides a succinct description of malicious behavior present in a malware, it can also be used by security analysts for understanding the malware. We have implemented a prototype based on our algorithm and tested it on several malware programs. Experimental results obtained from our prototype indicate that our algorithm is effective in extracting malicious behaviors that can be used to detect malware variants.

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

differential analysis
behavior-based detection
malspec


An

introduction

to

PYTHIA

The

Pythia

program

is

a

standard

tool

for

the

generation

of

events

in

high-energy

collisions,

comprising

a

coherent

set

of

physics

models

for

the

evolution

from

a

few-body

hard

process

to

a

complex

multiparticle

final

state.

It

contains

a

library

of

hard

processes,

models

for

initial-

and

final-state

parton

showers,

matching

and

merging

methods

between

hard

processes

and

parton

showers,

multiparton

interactions,

beam

remnants,

string

fragmentation

and

particle

decays.

It

also

has

a

set

of

utilities

and

several

interfaces

to

external

programs.

Pythia

is

the

second

main

release

after

the

complete

rewrite

from

Fortran

to

C++,

and

now

has

reached

such

a

maturity

that

it

offers

a

complete

replacement

for

most

applications,

notably

for

LHC

physics

studies.

The

many

new

features

should

allow

an

improved

description

of

data.

Program

title:

Pythia

Catalogue

identifier:

Program

summary

Program

obtainable

from:

CPC

Program

Library,

Queens

University,

Belfast,

N.

Ireland

Licensing

provisions:

GNU

General

Public

Licence,

version

No.

of

lines

in

distributed

program,

including

test

data,

etc.:

No.

of

bytes

in

distributed

program,

including

test

data,

etc.:

Distribution

format:

tar.gz

Programming

language:

C++.

Computer:

Commodity

PCs,

Macs.

Operating

system:

Linux,

OS

X;

should

also

work

on

other

systems.

RAM:

megabytes

Classification:

Does

the

new

version

supersede

the

previous

version?:

Yes

Catalogue

identifier

of

previous

version:

Journal

reference

of

previous

version:

Comput.

Phys.

Comm.

Nature

of

problem:

High-energy

collisions

between

elementary

particles

normally

give

rise

to

complex

final

states,

with

large

multiplicities

of

hadrons,

leptons,

photons

and

neutrinos.

The

relation

between

these

final

states

and

the

underlying

physics

description

is

not

a

simple

one,

for

two

main

reasons.

Firstly,

we

do

not

even

in

principle

have

a

complete

understanding

of

the

physics.

Secondly,

any

analytical

approach

is

made

intractable

by

the

large

multiplicities.

Solution

method:

Complete

events

are

generated

by

Monte

Carlo

methods.

The

complexity

is

mastered

by

a

subdivision

of

the

full

problem

into

a

set

of

simpler

separate

tasks.

All

main

aspects

of

the

events

are

simulated,

such

as

hard-process

selection,

initial-

and

final-state

radiation,

beam

remnants,

fragmentation,

decays,

and

so

on.

Therefore

events

should

be

directly

comparable

with

experimentally

observable

ones.

The

programs

can

be

used

to

extract

physics

from

comparisons

with

existing

data,

or

to

study

physics

at

future

experiments.

Reasons

for

new

version:

Improved

and

expanded

physics

models.

Summary

of

revisions:

Hundreds

of

new

features

and

bug

fixes,

allowing

improved

modelling.

Restrictions:

Depends

on

the

problem

studied.

Running

time:

events

per

second,

depending

on

process

studied.

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

parton showers
matching and merging
multiparton interactions

event generators
multiparticle production
matrix elements
hadronisation


Subpixel edge location based on orthogonal Fourier-Mellin moments In order to satisfy the stringent requirements for edge location accuracies in such fields as medical image analysis and satellite remote sensing, an approach based on orthogonal Fourier-Mellin moments is proposed to use the lower radial orders and the rotation invariance of these moments to describe small objects in images, and edge location is accomplished by setting the edge in the vertical direction and analyzing the interrelationships among the orthogonal Fourier-Mellin moments with different orders and degrees, and consequently the specific characteristics of the edge can be fully extracted. Experimental results show that the proposed method can be used to achieve an edge location accuracy of 0.16 pixel for straight lines with noise and 0.23 pixel for curves with noise. It can therefore be concluded that the proposed method is an efficient approach to satisfy the stringent requirements for higher edge location accuracies in such fields as medical image analysis and satellite remote sensing. (C) 2007 Elsevier B.V. All rights reserved.

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

subpixel edge location
rotation invariance


A level set characteristic Galerkin finite element method for free surface flows This paper presents a numerical method for free surface flows that couples the incompressible Navier-Stokes equations with the level set method in the finite element framework. The implicit characteristic-Galerkin approximation together with the fractional four-step algorithm is employed to discretize the governing equations. The schemes for solving the level set evolution and reinitialization equations are verified with several benchmark cases, including stationary circle, rotation of a slotted disk and stretching of a circular fluid element. The results are compared with those calculated from the level set finite volume method of Yue et al. (Int. J Numer. Methods Fluids 2003; 42:853-884), which employed the third-order essentially non-oscillatory (ENO) schemes for advection of the level set function in a generalized curvilinear coordinate system. The comparison indicates that the characteristic Galerkin approximation of the level set equations yields more accurate solutions. The second-order accuracy of the Navier-Stokes solver is confirmed by simulation of decay vortex. The coupled system of the Navier-Stokes and level set equations then is validated by solitary wave and broken dam problems. The simulation results are in excellent agreement with experimental data. Copyright (c) 2005 John Wiley & Sons, Ltd.

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

level set method
solitary wave
broken dam

characteristic galerkin method
unstructured mesh
free surface flow


TFP: An efficient algorithm for mining top-K frequent closed itemsets Frequent itemset mining has been studied extensively in literature. Most previous studies require the specification of a min_support threshold and aim at mining a complete set of frequent itemsets satisfying min_support. However, in practice, it is difficult for users to provide an appropriate min_support threshold. In addition, a complete set of frequent itemsets is much less compact than a set of frequent closed itemsets. In this paper, we propose an alternative mining task: mining top-k frequent closed itemsets of length no less than min_l, where k is the desired number of frequent closed itemsets to be mined, and min_l is the minimal length of each itemset. An efficient algorithm, called TFP, is developed for mining such itemsets without mins_support. Starting at min_support = 0 and by making use of the length constraint and the properties of top-k frequent closed itemsets, min_support can be raised effectively and FP-Tree can be pruned dynamically both during and after the construction of the tree using our two proposed methods: the closed node count and descendant_sum. Moreover, mining is further speeded up by employing a top-down and bottom-up combined FP-Tree traversing strategy, a set of search space pruning methods, a fast 2-level hash-indexed result tree, and a novel closed itemset verification scheme. Our extensive performance study shows that TFP has high performance and linear scalability in terms of the database size.

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

data mining
association rules
mining methods and algorithms


Statistical deformable bone models for robust 3D surface extrapolation from sparse data A majority of pre-operative planning and navigational guidance during computer assisted orthopaedic surgery routinely uses three-dimensional models of patient anatomy. These models enhance the surgeons capability to decrease the invasiveness of surgical procedures and increase their accuracy and safety. A common approach for this is to use computed tomography (CT) or magnetic resonance imaging (MRI). These have the disadvantages that they are expensive and/or induce radiation to the patient. In this paper we propose a novel method to construct a patient-specific three-dimensional model that provides an appropriate intra-operative visualization without the need for a pre or intra-operative imaging. The 3D model is reconstructed by fitting a statistical deformable model to minimal sparse 3D data consisting of digitized landmarks and surface points that are obtained intra-operatively. The statistical model is constructed using Principal Component Analysis from training objects. Our deformation scheme efficiently and accurately computes a Mahalanobis distance weighted least square fit of the deformable model to the 3D data. Relaxing the Mahalanobis distance term as additional points are incorporated enables our method to handle small and large sets of digitized points efficiently. Formalizing the problem as a linear equation system helps us to provide real-time updates to the surgeons. Incorporation of M-estimator based weighting of the digitized points enables us to effectively reject outliers and compute stable models. We present here our evaluation results using leave-one-out experiments and extended validation of our method on nine dry cadaver bones.

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

medical image analysis
shape analysis
statistical shape models
deformable models


Using intelligent agents for pro-active, real-time urban intersection control The usability and effectiveness of traffic control systems greatly depends on its ability of reacting upon traffic patterns and permutations. In this research we investigate the applicability of autonomous intelligent agents in Urban Traffic Control (UTC), and why these artificial intelligent strategies are useful in UTC. We propose a system that autonomously can adapt itself, based upon internal rules and its environment, at changing environments. Both long term changes as well as short term changes are accounted for in different manner. The UTC model is primarily based on several Intelligent Traffic Signalling Agents (ITSA) and some authority agents. This approach enables us to use a UTC system, based on agent technology, capable of responding to traffic conditions in real-time. The system can maintain its integrity and stability within the overall transportation system. Due to its pro-active behaviour we are able to make better use of the capacity of intersections.

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

forecasting
artificial intelligent agents
optimisation


New efficient MDS array codes for RAID - Part II: Rabin-like codes for tolerating multiple (>= 4) disk failures A new class of Binary Maximum Distance Separable (MDS) array codes which are based on circular permutation matrices are introduced in this paper. These array codes are used for tolerating multiple ( >= 4) disk failures in Redundant Arrays of Inexpensive Disks (RAID) architecture. The size of the information part is m x n, where n is the number of information disks and (m+1) is a prime integer; the size of the parity-check part is m x r, the minimum distance is r + 1, and the number of parity-check disks is r. In practical applications, m can be very large and n ranges from 20 to 50. The code rate is R= n/n+r. These codes can be used for tolerating up to r disk failures, with very fast encoding and decoding. The complexities of encoding and decoding algorithms are O(rmn) and O(m(3)r(4)), respectively. When r = 4, there need to be 9mn XOR operations for encoding and (9n+95)(m+1) XOR operations for decoding.

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


CadiaPlayer: Search-Control Techniques Effective search control is one of the key components of any successful simulation-based game-playing program. In General Game Playing (GGP), learning of useful search-control knowledge is a particularly challenging task because it must be done in real-time during online play. In here we describe the search-control techniques used in the 2010 version of the GGP agent CadiaPlayer, and show how they have evolved over the years to become increasingly effective and robust across a wide range of games. In particular, we present a new combined search-control scheme (RAVE/MAST/FAST) for biasing action selection. The scheme proves quite effective on a wide range of games including chess-like games, which have up until now proved quite challenging for simulation-based GGP agents.

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

general game playing
cadiaplayer
search control


Static properties and waveguide modes of a wide lateral window Josephson junction We developed an efficient hybrid mode expansion method to study the maximum tunneling current as a function of the external magnetic field for a 2D large area lateral window junction. We consider the inhomogeneity in the critical current density, which is taken a piecewise constant. The natural modes of the expansion in y, are the linearized eigen-modes around a static solution which satisfies the 1D sine-Gordon equation with the critical current variation in y, and the boundary conditions determined by the overlap component of the bias current, which can be inline or overlap like. The magnetic field along with the inline component of the bias current enters as a boundary condition on the modal amplitudes. We obtain fast convergent results and for a ratio of idle to window widths of w(0)/w = 4 (in units of lambda(J)), only two modes are needed. A simple scaling is obtained for the maximum tunneling current as we vary the idle region width. We also present the linear electromagnetic waveguide modes taking into account the variation normal to the waveguide of the critical current and the capacitance.

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

josephson junctions
partial differential equations
solitons


Robust Pole Placement in a Specified Trapezoid Region for Flexible Manipulators This paper proposes a robust pole placement method for the joint dynamical models of flexible manipulators with parametric uncertainty. The proposed method incorporates Kharitonovs theorem, the RouthHurwitz criterion, and the mapping theory. All system poles can be placed in a specified trapezoid region such that control system performance can be predefined.

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

robust stability
robust parameter designs
pole and zero placement problems
kharitonov polynomial


An optimization framework for the energy management of carrier ethernet networks with Multiple Spanning Trees We propose an energy management framework to optimize the energy consumption of networks using the Multiple Spanning Tree Protocol such as Carrier Grade Ethernet networks. The objective is to minimize the energy consumption of nodes and links while considering QoS constraints. The energy management is done through the Multiple Spanning Tree Protocol (MSTP) by choosing from a given set the most appropriate Spanning Trees and the most appropriate edges to operate while respecting the traffic demands. A trade-off framework between energy consumption and network performance is proposed. Results show that it is possible to achieve a good traffic engineering while operating the network closer to the minimum energy value.

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

carrier grade ethernet
traffic engineering
spanning trees

green networking
routing optimization
network design


Security Ontology for Adaptive Mapping of Security Standards Adoption of security standards has the capability of improving the security level in an organization as well as to provide additional benefits and possibilities to the organization. However mapping of used standards has to be done when more than one security standard is employed in order to prevent redundant activities, not optimal resource management and unnecessary outlays. Employment of security ontology to map different standards can reduce the mapping complexity however the choice of security ontology is of high importance and there are no analyses on security ontology suitability for adaptive standards mapping. In this paper we analyze existing security ontologies by comparing their general properties, Onto Metric factors and ability to cover different security standards. As none of the analysed security ontologies were able to cover more than 1/3 of security standards, we proposed a new security ontology, which increased coverage of security standards compared to the existing ontologies and has a better branching and depth properties for ontology visualization purposes. During this research we mapped 4 security standards (ISO 27001, PCI DSS, ISSA 5173 and NISTIR 7621) to the new security ontology, therefore this ontology and mapping data can be used for adaptive mapping of any set of these security standards to optimize usage of multiple security standards in an organization.

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

security ontology
security standards
adaptive mapping


new techniques for evaluating innovative interfaces with eye tracking Computer interfaces are changing rapidly, as are the cognitive demands on the operators using them. Innovative applications of new technologies such as multimodal and multimedia displays, haptic and pen-based interfaces, and natural language exchanges bring exciting changes to conventional interface usage. At the same time, their complexity may place overwhelming cognitive demands on the user. As novel interfaces and software applications are introduced into operational settings, it is imperative to evaluate them from a number of different perspectives. One important perspective examines the extent to which a new interface changes the cognitive requirements for the operator.This presentation describes a new approach to measuring cognitive effort using metrics based on eye movements and pupil dilation. It is well known that effortful cognitive processing is accompanied by increases in pupil dilation, but measurement techniques were not previously available that could supply results in real time or deal with data collected in long-lasting interactions. We now have a metric-the Index of Cognitive Activity-that is computed in real time as the operator interacts with the interface. The Index can be used to examine extended periods of usage or to assess critical events on an individual-by-individual basis.While dilation reveals when cognitive effort is highest, eye movements provide evidence of why. Especially during critical events, one wants to know whether the operator is confused by the presentation or location of specific information, whether he is attending to key information when necessary, or whether he is distracted by irrelevant features of the display. Important details of confusion, attention, and distraction are revealed by traces of his eye movements and statistical analyses of time spent looking at various features during critical event.Together, the Index of Cognitive Activity and the various analyses of eye movements provide essential information about how users interact with new interface technologies. Their use can aid designers of innovative hardware and software products by highlighting those features that increase rather than decrease users' cognitive effort.In the presentation, the underlying mathematical basis of the Index of Cognitive Activity will be described together with validating research results from a number of experiments. Eye movement analyses from the same studies give clues to the sources of increase in cognitive workload. To illustrate interface evaluation with the ICA and eye movement analysis, several extended examples will be presented using commercial and military displays. [NOTE: Dr. Marshall's eye tracking system will be available to view at Tuesday evening's joint UIST-ICMI demo reception.

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

requirements
applications
use
examples
analysis
evidence
user
natural language
attention
eye tracking
research
workload
multimedia
measurement
traces
interfaces
evaluation
place
software
technologies
users
data
complexity
haptic
hardware
display

present
activation
innovating
event
metrication
experience
timing
real-time
informal
change
multimodality
interaction
indexing
product
eye-movement
pen-based interface
critic
statistics
cognitive processes
computation
systems
cognition
locatability
operability
feature


a statistical approach to simulation model validation in response-time analysis of complex real-time embedded systems As simulation-based analysis methods make few restrictions on the system design and scale to very large and complex systems, they are widely used in, e.g., timing analysis of complex real-time embedded systems (CRTES) in industrial circles. However, before such methods are used, the analysis simulation models have to be validated in order to assess if they represent the actual system or not, which also matters to the confidence in the simulation results. This paper presents a statistical approach to validation of temporal simulation models extracted from CRTES, by introducing existing mature statistical hypothesis tests to the context. Moreover, our evaluation using simulation models depicting a fictive but representative industrial robotic control system indicates that the proposed method can successfully identify temporal differences between different simulation models, hence it has the potential to be considered as an effective simulation model validation technique.

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

simulation model validation
complex realtime embedded systems

two-sample kolmogorov-smirnov test
response time


How Many Test Vectors We Need to Detect a Bridging Fault? The growing dispersion of ICs parameters poses relevant uncertainties on gate output conductances and logic thresholds which play a main role in bridging fault detection. In this evolving context, the quality of fault simulation and test generation tools making use of nominal parameters should be verified. To analyze this problem we have studied bridging fault detection in combinational ICs in the presence of growing variations of ICs parameters. Results show that a single test is not sufficient to ensure acceptable escape probabilities. Conversely, the minimal number of test vectors required to provide a null escape probability is upper bounded with respect to variations in the standard deviation of ICs parameters. This result has been verified by means of Monte Carlo electrical level simulation. We propose a method to derive these minimal test sets in the case of low frequency tests. A fault simulator and a test generator have been developed supporting the search of minimal test sets targeting a null escape probability. These tools have been applied to a set of combinational benchmarks.

O O O O O O O O O O O O O O O O O O O O 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 and adaptive pseudoinverse solutions for ELM weights The ELM method has become widely used for classification and regressions problems as a result of its accuracy, simplicity and ease of use. The solution of the hidden layer weights by means of a matrix pseudoinverse operation is a significant contributor to the utility of the method; however, the conventional calculation of the pseudoinverse by means of a singular value decomposition (SVD) is not always practical for large data sets or for online updates to the solution. In this paper we discuss incremental methods for solving the pseudoinverse which are suitable for ELM. We show that careful choice of methods allows us to optimize for accuracy, ease of computation, or adaptability of the solution.

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

extreme learning machine
greville?s method


multi-step concern refinement A Model-Driven Software Product Line (MD-SPL) uses metamodels, models, and transformations to create a family of products using a Model Refinement Line (MRL). However, an MD-SPL must evolve and provide mechanisms to add new crosscutting concerns, such as security or logging, to the applications. Our problem is that we want to preserve and reuse the original MRL. In this paper, we present the challenges associated with this problem. We illustrate them by evaluating different model-driven approaches to add crosscutting concerns into an application using high-level aspects. Furthermore, we propose an approach to add crosscutting concerns as early aspects and to preserve the original MRL. This approach adds a new MRL that refines a high-level model of the concern. This high-level model is related with the high-level application model in the original MRL. The refinement of the application model and the concern model proceeds in parallel. The presented approach is a work in progress and requires us to tackle several challenges in order to implement and validate the proposal.

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

software product line
early aspects
model refinement

aspect-oriented software development
model-driven engineering


Standardised system for automatic remote evaluation of biometric algorithms It is difficult to generate significant results when evaluating algorithms developed in biometrics. Additionally, when third parties, such as system integrators, want to compare results among different algorithm providers, they cannot do so easily for several reasons: difficulty accessing large databases, inability to exchange biometric data among researchers due to data protection laws in some countries, or the lack comprehensive and standardised evaluation reports. This paper presents a new performance evaluation system for biometric systems that is secure, automatic and remote. This system has been developed using current standards developed within ISO/IEC JTC1/SC37 for data Formats, Application Program Interfaces (APIs) and evaluation methodology. Standardised technology is able to provide developers in biometrics and third parties with a way to perform comprehensive evaluations remotely and with 24/7 availability without compromising the privacy of the individuals included in the test crew. The solution described here offers the developers the ability to evaluate large databases that are stored in a secured centralised server. As this system is modality-independent, researchers can use the same protocol to perform different evaluations, and therefore lower the overhead costs for testing purposes. Additionally, such protocols can be plugged directly into end-user applications, minimising technology transfer costs. The system is described by block diagrams as well as flowcharts.

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

application program interface (api)
personal information databases
biometric service provider (bsp)
pre-processing
feature extraction
verification


Analysis of nursing records of cardiac-surgery patients based on the nursing process and focusing on nursing outcomes This study analyzed what nurses wrote in narrative nursing notes for cardiac-surgery patients. The nursing notes of 46 patients were analyzed based on the nursing process. Eight patterns were extracted according to different combinations of nursing process components, of which an assessment alone was the most frequent nursing phrase (45.8%), followed by assessment or diagnosis-intervention-outcome (25.9%). The content of the nursing notes was also classified into 15 categories, of which nursing outcomes were recorded more frequently in nursing care driven mainly by physician's order such as disease-related symptom management, insomnia care, respiratory care, and pain control, than in independent nursing care such as education and emotional care. A survey on the attitudes of nurses toward the nursing record revealed that they do not document nursing outcomes as much as they think they do. The main reasons for this discrepancy were insufficient time for recording and lack of knowledge about why, how, and what to evaluate. Even though there is room for improvement, nursing notes represent a useful resource for determining nursing contributions to patient outcomes.

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

nursing documentation
nursing outcome
icnp
outcomes research
cardiac-surgery


Numerical solution of a Stefan-like problem in laser processing of semiconducting alloys A theoretical model of binary alloy melting and solidification induced by pulsed-laser irradiation is formulated using the mass and internal energy balances in the liquid and solid phases. The interface between the solid and liquid phases is modeled as a discontinuity surface where the mass and internal energy balance conditions are expressed, together with the interface response function. Both melting and solidification are considered as nonequilibrium processes. The numerical solution of the mathematical model is performed using the Galerkin finite element method in a 1D approximation and the moving boundary problem is solved by a front-fixing technique. The resulting set of nonlinear algebraic equations is solved by an iterative procedure using the successive approximation approach. In a practical application of the computational model, the phase change processes in a Si-Ge system induced by XeCl excimer laser are simulated. The temperature and concentration fields, and the position and velocity of the phase interface are calculated in dependence on the laser energy density. The results show good agreement with experimental measurements by Slaoui et al. [10]. The model can also provide some data which are difficult to be measured in a direct experiment. (C) 1999 IMACS/Elsevier Science B.V. All rights reserved.

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

stefan-like problem
pulsed laser
numerical modeling


Developing a NFC-equipped smart classroom: Effects on attitudes toward computer science We developed a smart classroom system that utilizes near field communication (NFC). This study evaluated the effect on students attitude toward computer science education. The real-time feedback function could be beneficial especially for Asian students. The system demonstrated significant positive impacts on students learning attitudes.

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

near field communication
science education


a logic for strategic reasoning Rational strategic reasoning is the process whereby an agent reasons about the best strategy to adopt in a given multi-agent scenario, taking into account the likely behaviour of other participants in the scenario, and, in particular, how the agent's choice of strategy will affect the choices of others. We present CATL, a logic that is intended to facilitate such reasoning. CATL is an extension of Alternating-time Temporal Logic (ATL), which supports reasoning about the abilities of agents and their coalitions in game-like multi-agent systems. CATL extends ATL with a ternary counterfactual commitment operator of the form C i (?, ?) , with the intended reading "if it were the case that agent i committed to strategy ?, then ?". By using this operator in combination with the ability operators of ATL, it is possible to reason about the implications of different possible choices by agents. We illustrate the approach by showing how CATL may be used to express properties of games such as Nash equilibrium and Pareto efficiency. We also show that the model checking problem for CATL is tractable, and hence that efficient implementations of strategic reasoners based on CATL are feasible.

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

modal logic
game theory
multi-agent systems


Torpedo evasion simulation of underwater vehicle using fuzzy-logic-based tactical decision making in script tactics manager An underwater vehicle such as a submarine or a torpedo is a complex and complicated weapon system composed of various systems and subsystems. Usually, it takes around 10years, a substantial amount of money, and many research and development resources to complete the development of an underwater vehicle, right from the concept design to the mass production. Recently, in order to reduce the number of trial-and-error instances required for verifying the operation of an underwater vehicle, modeling and simulation (M&S) has been investigated and applied to an engineering-level simulation to analyze the performance of a system and a subsystem and to an engagement-level simulation to analyze the tactical and operational effectiveness. In this paper, we introduce a method for applying fuzzy logic to the tactical decision making of an underwater vehicle in an engagement-level simulation. In the scenario of an engagement between a light torpedo pursuing a submarine and the submarine attempting to evade the attack, the evasion methods for the submarine are modeled in fuzzy logic after tacticalization. For the simulation, we modeled a light torpedo and a submarine on the basis of DEVS (Discrete Event System Specification). Further, when a tactical decision had to be taken, the submarine model calls the tactics manager implemented outside of the model and passes its own state variables, which are necessary for tactical decision making, to the tactics manager. The tactics manager used in the tactical decision making process supports Lua and the Python scripting languages and is self-implemented. The tactics description of the submarine was implemented using Python scripting grammar and stored as a Python file (?.py) to be inputted to the tactics manager. As the simulation results, we present the implemented fuzzy Python tactic description file of the submarine evasion tactics and the possibilities of submarine survival according to the tactics as a comparison. Finally, as the fundamental research on the application of artificial intelligence to the tactical decision making method of the model used in the engagement-level simulation, this work suggests the fuzzy-based tactics description method and presents the detailed procedures for the various actions, and their adopting effectiveness.

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

tactics manager
underwater vehicle
modeling and simulation
torpedo evasion
python scripting
devs


A Peano theorem for fuzzy differential equations with evolving membership grade The Peano theorem on the existence without possible uniqueness of solutions has been a perplexing problem in the theory of fuzzy differential equations. The difficulty appears to be due to the standard use of the supremum metric ? ? defined by the supremum over the Hausdorff metric between the level sets of the fuzzy sets. Another may have been the classical formulation of fuzzy differential equations in terms of the Hukuhara derivative of the level sets. Here a Peano theorem is established for fuzzy differential equations formulated in a recent paper by the authors by combining Hllermeier's suggestion of defining fuzzy differential equations at each level set via differential inclusions with Aubin's morphological equations, which allow non-local set evolution. A major difference from previous publications is the use of the endograph metric end end , essentially the Hausdorff metric between the endographs in Rn[0,1] R n [ 0 , 1 ] of fuzzy sets, instead of the supremum metric ? ? . Another is that the membership grades of the fuzzy sets are also allowed to evolve under the fuzzy differential equations. The result applies for a very general class of fuzzy sets without additional assumptions of fuzzy convexity, compact supports or even normality.

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

fuzzy differential equations
peano theorem
endograph metric
differential inclusions
morphological equations

sendograph metric
reachable sets
set differential equations


A short and versatile finite element multiscale code for homogenization problems We describe a multiscale finite element (FE) solver for elliptic or parabolic problems with highly oscillating coefficients. Based on recent developments of the so-called heterogeneous multiscale method (HMM), the algorithm relies on coupled macro- and microsolvers. The framework of the HMM allows to design a code whose structure follows the classical finite elements implementation at the macro level. To account for the fine scales of the problem, elementwise numerical integration is replaced by micro FE methods on sampling domains. We discuss a short and flexible FE implementation of the multiscale algorithm, which can accommodate simplicial or quadrilateral FE and various coupling conditions for the constrained micro simulations. Extensive numerical examples including three dimensional and time dependent problems are presented illustrating the efficiency and the versatility of the computational strategy.

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

macro-to-micro modeling
microstructure
fem implementation
composite material


A phase dynamic model of systematic error in simple copying tasks A crucial insight into handwriting dynamics is embodied in the idea that stable, robust handwriting movements correspond to attractors of an oscillatory dynamical system. We present a phase dynamic model of visuomotor performance involved in copying simple oriented lines. Our studies on human performance in copying oriented lines revealed a systematic error pattern in orientation of drawn lines, i.e., lines at certain orientation are drawn more accurately than at other values. Furthermore, human subjects exhibit "flips" in direction at certain characteristic orientations. It is argued that this flipping behavior has its roots in the fact that copying process is inherently ambiguous-a line of given orientation may be drawn in two different (mutually opposite) directions producing the same end result. The systematic error patterns seen in human copying performance is probably a result of the attempt of our visuomotor system to cope with this ambiguity and still be able to produce accurate copying movements. The proposed nonlinear phase-dynamic model explains the experimentally observed copying error pattern and also the flipping behavior with remarkable accuracy.

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

visuomotor transformation
nonlinear oscillators
phase dynamics


automatic classification of sentences for evidence based medicine AIM Given a set of pre-defined medical categories used in Evidence Based Medicine, we aim to automatically annotate sentences in medical abstracts with these labels. METHOD We construct a corpus of 1,000 medical abstracts annotated by hand with medical categories (e.g. "Intervention", "Outcome"). We explore the use of various features based on lexical, semantic, structural, and sequential information in the data, using Conditional Random Fields (CRF) for classification. RESULT For the classification tasks over all labels, our systems achieved micro-averaged F-scores of 80.9\% and 66.9\% in structured and unstructured datasets respectively, using sequential features. In labeling only key sentences, our systems produced F-scores of 89.3\% and 74.0\% in structured and unstructured datasets respectively, using the same sequential features. The results over an external dataset were lower (F-scores of 63.1\% for all-labels, and 83.8\% for key sentences). CONCLUSION Of the features we used, the best for classifying any given sentence in an abstract are based on unigrams, section headings, and sequential information from preceding sentences. These features resulted in improved performance over a simple bag-of-words approach, and outperform feature sets used in previous work.

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


Automatic classification of chromosomes by means of quadratically asymmetric statistical distributions We use quatratically asymmetric distributions as introduced in Ritter [1, 2] as statistical models of human chromosomes for automatic constrained Bayesian classification into their 24 classes. These distributions are able to reflect asymmetries in the data. Moreover, we design algorithms for constrained classification of cells with missing and extra chromosomes (trisomies). Applied to the Edinburgh features of the large Copenhagen data set Cpr, the best classifier reported here reduces the cross-validation error rate from 2.7% (classical normal model) to 1.2% with respect to chromosomes. On the average, five out of six cells are completely correctly classified. (C) 1999 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved.

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

diagnostic classification
automatic chromosome classification
karyotyping
biomedical data model
statistical pattern recognition
quadratic asymmetry
mixture distribution
trimming method


Multi-class Multipath Routing Protocol for Low Power Wireless Networks with Heuristic Optimal Load Distribution The distributed nature and dynamic topology of hierarchical low power wireless networks have made them an interesting platform for ubiquitous applications and smart environments. Wireless Sensor and Actuator Networks are a well known example in this area where the nodes collaborate to disseminate data over multi-hop routing trees. Emerging applications like smart grids and internet of things, demand more traffic volumes with QoS requirements, such as delay and reliability. The traditional shortest path routing fails to meet these demands because of producing more congestion, delay, packet loss, and energy consumption along the limited optimal paths. Multipath routing is a promising way to meet both the QoS constraints and lifetime concerns. In this paper we propose a proactive multipath load balancing approach which tries to achieve maximum lifetime by equalizing the traffic rate between the nodes of equal distance from the local sink. The load balancing and QoS provision is achieved through a network flow optimization problem, which is locally solved by a novel Heuristic Optimal Load Distributor. The load distribution is performed over a routing graph produced by a Multi-class Multipath Routing Protocol for Low power and lossy networks (\(\hbox {M}^2\hbox {RPL}\)). The simulation results show the efficiency of the proposed framework, that leads to 30% increase in lifetime and 10% decrease in average delay compared to some well known algorithms in the area.

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

multipath routing
load balancing
low power wireless networks