The Basic Block Reassembling Instruction Stream Buffer with LWBTB for X86 ISA The potential performance of superscalar processors can be exploited only when processor is fed with sufficient instruction bandwidth. The front-end units, the Instruction Stream Buffer (ISB) and the fetcher, are the key elements for achieving this goal. Current ISBs could not support instruction streaming beyond a basic block. In x86 processors, the split-line instruction problem worsens this situation. In this paper, we proposed a basic blocks reassembling ISB. By cooperating with the proposed Line-Weighted Branch Target Buffer (LWBTB), the proposed ISB can predict upcoming branch information and reassemble current cache line together with the other cache line containing instructions for the next basic block. Therefore, the fetcher could fetch more instructions in a cycle with the assistance of the proposed ISB. Simulation results show that the cache line size over 64 bytes has a good chance to let two basic blocks present in a reassembled cache line and the fetch efficiency is about 90% as the fetch capacity is under 6.

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

trace cache
ilp
superscalar processor
x86 architecture
multiple instruction fetch


Fuzzy Interpolative Reasoning for Sparse Fuzzy Rule-Based Systems Based on alpha-Cuts and Transformations Techniques In sparse fuzzy rule-based systems, the fuzzy rule bases are usually incomplete. In this situation, the system may not properly perform fuzzy reasoning to get reasonable consequences. In order to overcome the drawback of sparse fuzzy rule-based systems, there is an increasing demand to develop fuzzy interpolative reasoning techniques in sparse fuzzy rule-based systems. In this paper, we present a new fuzzy interpolative reasoning method via cutting and transformation techniques for sparse fuzzy rule-based systems. It can produce more reasonable results than the existing methods. The proposed method provides a useful way to deal with fuzzy interpolative reasoning in sparse fuzzy rule-based systems.

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

alpha-cuts
increment transformations
ratio transformations
sparse fuzzy rule-based systems


Databases for recognition of handwritten Arabic cheques This paper describes an effort towards the development of Arabic cheque databases for research in the recognition of hand-written Arabic cheques. Databases of real-life Arabic legal amounts, Arabic sub-words, courtesy amounts, Indian digits, and Arabic cheques are described. This paper highlights some characteristics of the Arabic language and presents the various steps that have been completed to build these databases including segmentation, binarization and data tagging. It also describes a solid validation procedure including grammars and algorithms used to verify the correctness of the tagging process. Detailed descriptions of the database organization and class distribution are included. These databases aim to facilitate experimental comparisons between various recognition methods, and will be provided to all interested researchers upon request to CENPARMI.1

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

arabic ocr
cheque processing
image processing
databases of arabic handwriting
database of indian digits


Program

in

C

for

studying

characteristic

properties

of

two-body

interactions

in

the

framework

of

spectral

distribution

theory

We

present

a

program

in

C

that

employs

spectral

distribution

theory

for

studies

of

characteristic

properties

of

a

many-particle

quantum-mechanical

system

and

the

underlying

few-body

interaction.

In

particular,

the

program

focuses

on

two-body

nuclear

interactions

given

in

a

JT

J

T

-coupled

harmonic

oscillator

basis

and

calculates

correlation

coefficients,

a

measure

of

similarity

of

any

two

interactions,

as

well

as

HilbertSchmidt

norms

specifying

interaction

strengths.

An

important

feature

of

the

program

is

its

ability

to

identify

the

monopole

part

(centroid)

of

a

interaction,

as

well

as

its

density-dependent

one-body

and

two-body

part,

thereby

providing

key

information

on

the

evolution

of

shell

gaps

and

binding

energies

for

larger

nuclear

systems.

As

additional

features,

we

provide

statistical

measures

for

density-dependent

interactions,

as

well

as

a

mechanism

to

express

an

interaction

in

terms

of

two

other

interactions.

This,

in

turn,

allows

one

to

identify,

e.g.,

established

features

of

the

nuclear

interaction

(such

as

pairing

correlations)

within

a

general

Hamiltonian.

The

program

handles

the

radial

degeneracy

for

density-dependent

one-body

interactions

and

together

with

an

efficient

linked

list

data

structure,

facilitates

studies

of

nuclear

interactions

in

large

model

spaces

that

go

beyond

valence-shell

applications.

Program

title:

sdt

Catalogue

identifier:

Program

summary

Program

obtainable

from:

CPC

Program

Library,

Queens

University,

Belfast,

N.

Ireland

Licensing

provisions:

Standard

CPC

licence,

No.

of

lines

in

distributed

program,

including

test

data,

etc.:

No.

of

bytes

in

distributed

program,

including

test

data,

etc.:

Distribution

format:

tar.gz

Programming

language:

C.

Computer:

Laptop,

Workstation.

Operating

system:

Linux

[tested

on

Linux

(Kernel

with

a

gcc,

version

RAM:

Less

than

MB

Classification:

Nature

of

problem:

The

program

calculates

second-order

energy

moments,

such

as

variances

and

correlation

coefficients,

widely

used

as

measures

of

the

overall

strength

of

an

interaction

and

its

similarity

to

other

interactions.

It

allows

for

studies

of

the

physical

properties

of

various

interactions

and

their

effect

on

many-particle

systems.

Solution

method:

Calculations

are

based

on

spectral

distribution

theory

and

invoke

statistical

measures

provided

by

the

theory.

Running

time:

Less

than

min

(typically,

several

seconds)

using

a

GHz

processor.

References:

J.B.

French

and

K.F.

Ratcli,

Phys.

Rev.

C

F.S.

Chang,

J.B.

French,

and

T.H.

Thio,

Ann.

Phys.

(N.Y.)

K.T.

Hecht

and

J.P.

Draayer,

Nucl.

Phys.

K.D.

Sviratcheva,

J.P.

Draayer,

and

J.P.

Vary,

Nucl.

Phys.

A

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

properties of realistic and schematic interactions


Triple I method based on pointwise sustaining degrees ? The concept of the pointwise sustaining degrees is first introduced, and based on it the triple I principles for fuzzy modus ponens (FMP for short) and fuzzy modus tollens (FMT for short) are improved. And then, for the sake of making more implications can be used under the same way, general computing formulas of the triple I method for FMP and FMT are established under weaker conditions. Thus, the existing unified forms of triple I method are generalized to new forms.

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

fuzzy reasoning
triple i principle
pointwise sustaining degree
implication operator


Privacy-preserving models for comparing survival curves using the logrank test The incorporation of electronic health care in medical institutions will benefit and thus further boost the collaborations in medical research among clinics and research institutions. However, privacy regulations and security concerns make such collaborations very restricted. In this paper, we propose privacy preserving models for survival curves comparison based on logrank test, in order to perform better survival analysis through the collaboration of multiple medical institutions and protect the data privacy. We distinguish two collaboration scenarios and for each scenario we present a privacy preserving model for logrank test. We conduct experiments on the real medical data to evaluate the effectiveness of our proposed models.

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


Biomarker discovery using 1-norm regularization for multiclass earthworm microarray gene expression data Novel biomarkers can be discovered through mining high dimensional microarray datasets using machine learning techniques. Here we propose a novel recursive gene selection method which can handle the multiclass setting effectively and efficiently. The selection is performed iteratively. In each iteration, a linear multiclass classifier is trained using 1-norm regularization, which leads to sparse weight vectors, i.e., many feature weights are exactly zero. Those zero-weight features are eliminated in the next iteration. The empirical results demonstrate that the selected features (genes) have very competitive discriminative power. In addition, the selection process has fast rate of convergence.

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

biomarker discovery
microarray gene expression data

1-norm regularization
multiclass classification


Mechanical loading, cartilage degradation, and arthritis Joint tissues are exquisitely sensitive to their mechanical environment, and mechanical loading may be the most important external factor regulating the development and long-term maintenance of joint tissues. Moderate mechanical loading maintains the integrity of articular cartilage; however, both disuse and overuse can result in cartilage degradation. The irreversible destruction of cartilage is the hallmark of osteoarthritis and rheumatoid arthritis. In these instances of cartilage breakdown, inflammatory cytokines such as interleukin-1 beta and tumor necrosis factor-alpha stimulate the production of matrix metalloproteinases (MMPs) and aggrecanases (ADAMTSs), enzymes that can degrade components of the cartilage extracellular matrix. In order to prevent cartilage destruction, tremendous effort has been expended to design inhibitors of MMP/ADAMTS activity and/or synthesis. To date, however, no effective clinical inhibitors exist. Accumulating evidence suggests that physiologic joint loading helps maintain cartilage integrity; however, the mechanisms by which these mechanical stimuli regulate joint homeostasis are still being elucidated. Identifying mechanosensitive chondroprotective pathways may reveal novel targets or therapeutic strategies in preventing cartilage destruction in joint disease.

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

mechanical loading
cartilage degradation
arthritis


A combined approach for segment-specific market basket analysis Market baskets arise from consumers shopping trips and include items from multiple categories that are frequently chosen interdependently from each other. Explanatory models of multicategory choice behavior explicitly allow for such category purchase dependencies. They typically estimate own and across-category effects of marketing-mix variables on purchase incidences for a predefined set of product categories. Because of analytical restrictions, however, multicategory choice models can only handle a small number of categories. Hence, for large retail assortments, the issue emerges of how to determine the composition of shopping baskets with a meaningful selection of categories. Traditionally, this is resolved by managerial intuition. In this article, we combine multicategory choice models with a data-driven approach for basket selection. The proposed procedure also accounts for customer heterogeneity and thus can serve as a viable tool for designing target marketing programs. A data compression step first derives a set of basket prototypes which are representative for classes of market baskets with internally more distinctive (complementary) cross-category interdependencies and are responsible for the segmentation of households. In a second step, segment-specific cross-category effects are estimated for suitably selected categories using a multivariate logistic modeling framework. In an empirical illustration, significant differences in cross-effects and price elasticities can be shown both across segments and compared to the aggregate model.

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

marketing
choice models
market basket analysis
segmentation


An arbitrary Lagrangian-Eulerian method for simulating bubble growth in polymer foaming We present a sharp-interface algorithm for simulating the diffusion-driven bubble growth in polymer foaming. A moving mesh of unstructured triangular elements tracks the expanding and deforming bubble surface. In the interior of the liquid, the mesh velocity is determined by solving a Laplace equation to ensure spatially smooth mesh movement. When mesh distortion becomes severe, remeshing and interpolation are performed. The governing equations are solved using a Galerkin finite-element formalism, with fully implicit time marching that requires iteration among the bubble and mesh deformation, gas diffusion and the flow and stress fields. Besides numerical stability, the implicit scheme also guarantees a smooth interfacial curvature as numerical disturbances on the interface are automatically relaxed through the iterations. The polymer melt is modeled as a viscoelastic Oldroyd-B fluid. First, we compute three benchmark problems to validate various aspects of the algorithm. Then we use a periodic hexagonal cell to simulate bubble growth in an isothermal two-dimensional foam, fed by a gaseous blowing agent initially dissolved in the melt to supersaturation. Results show two distinct stages: a rapid initial expansion followed by slow drainage of the liquid film between bubbles driven by capillarity. The effect of viscoelastic rheology is to enhance the speed of bubble growth in the first stage, and hinder film drainage in the second. Finally, we use axisymmetric simulations to investigate the thinning film between a bubble and a free surface. Melt viscoelasticity is shown to initially enhance film thinning but later resist it. An important insight from the simulations is that polymer strain-hardening, namely the steep increase of elongational viscosity with strain, helps stabilize the foam structure by suppressing bubble-bubble coalescence and bubble burst at the foam surface. This confirms prior observations in foam extrusion experiments. (c) 2007 Elsevier Inc. All rights reserved.

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

moving mesh
viscoelasticity
film drainage
capillarity

free surface problem
interfacial flows
finite elements
oldroyd-b fluids


Analyzing the performance and fairness of BitTorrent-like networks using a general-fluid model In this paper, a general fluid model is developed to study the performance and fairness of BitTorrent-like networks. The fluid model incorporates two important features previously isolated from system performance models, user settings with multiple groups and inter-group data exchange induced by the choking algorithm. Our numerical results point out some key parameters of performance, such as the staying time of seeders. Generally, selfish behavior does not receive equal performance degradation, and in some scenarios users have strong incentives of free-riding. We also find content delivery can be greatly deterred when malicious free-riders are overwhelming. (C) 2006 Elsevier B.V. All rights reserved.

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


Analysis of subway station capacity with the use of queueing theory We consider a problem how to calculate the subway station capacity (SSC). We introduce a definition of SSC. We propose a multi-objective optimization model using queuing network. We use a response surface methodology integrating queueing theory to solve. We do a sensitivity analysis for identifying bottleneck of SSC.

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

subway station capacity
response surface methodology
queuing network

remaining passengers
incoming passenger control


Blast response of reinforced concrete pile using fully coupled computer simulation techniques Response of reinforced concrete pile to a buried explosion is treated. Fully coupled computer simulation techniques are used in the analysis. Material models for air, soil, explosive, concrete and steel are incorporated. Pile reinforcements have a significant effect on pile response to blast load. Findings of this paper will serve as a reference for future analysis and design.

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

underground explosion
pile foundation
numerical simulation
coupled analysis


Biomarkers in Huntington's and Parkinson's Disease Parkinson's (PD) and Huntington's disease (HD) are chronic neurodegenerative conditions of the brain with a variety of clinical presentations including a disorder of movement and a range of nonmotor deficits. HD is genetic in origin and the causative gene and protein known, namely mutant Huntingtin, which leads to widespread early neuronal dysfunction and death throughout the brain. In contrast, the etiology of sporadic PD is unknown, and the pathology targets the nigrostriatal dopaminergic neurons with the formation of ?-synuclein positive Lewy bodies. In both diseases, the ability to accurately diagnose the disease in the early stages and monitor progression over time remains a major challenge given the majority of the pathology is sited deep within the CNS. This challenge has gained extra significance as the development of disease-modifying drugs starts to emerge into the clinic. To this end, there is a need to find biomarkers that will help in the accurate diagnosis of the disease and/or prediction of its clinical onset as well as biomarkers that are able to faithfully track disease progression independent of any symptomatic effects of any therapies. In addition, these same markers may also help stratify each of these heterogeneous disorders into specific subtypes that share particular clinical and pathological characteristics.

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

parkinson's disease
huntington's disease
biomarker
imaging
motor measures
wet biomarker


A projection method for low speed flows We propose a decomposition applicable to low speed, inviscid flows of all Mach numbers less than 1. By using the Hedge decomposition, we may write the velocity field as the sum of a divergence-free vector field and a gradient of a scalar function. Evolution equations for these parts are presented. A numerical procedure based on this decomposition is designed, using projection methods for solving the incompressible variables and a backward-Euler method for solving the potential variables. Numerical experiments are included to illustrate Various aspects of our algorithm. (C) 1999 Academic Press.

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


Simulation of wavestructure interaction by hybrid Cartesian/immersed boundary and arbitrary LagrangianEulerian finite-element method This article aims to develop a Cartesian-grid-based numerical model to study the interaction between free-surface flow and stationary or oscillating immersed obstacle in a viscous fluid. To incorporate the effect of the free surface motion, an arbitrary LagrangianEulerian (ALE) scheme is employed to accurately capture the configuration of free surface. To deal with the complex submerged obstacle in the fluid, a hybrid Cartesian/immersed boundary (HCIB) method is adopted, which allows easy implementation of the solid boundary conditions for a fixed structured grid. The two numerical techniques are combined to study the wavestructure interaction problems. The major merit of the proposed model is that the fluid grid is fixed throughout the computations during the transients, while the immersed body can move arbitrarily through the Cartesian grid. The meshes deform smoothly over the solid and free-surface boundaries, especially for representing sharp interface. There is no re-meshing process needed since this scheme only depends on the simple mesh generation to promote the efficiency of calculation. Some numerical examples are displayed respectively to validate the robustness and accuracy of the HCIB method, the ALE based finite-element scheme and their combinations. In addition, the other two numerical applications are carried out to simulate the wavestructure interaction with stationary and moving immersed body. In case studies some physical characteristics are also discussed for a range of amplitude of free-surface wave, Reynolds numbers and the proximity of structure under the liquid surface. The feasibility of the developed novel numerical model is shown through five numerical experiments.

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

free surface
arbitrary lagrangianeulerian
wavestructure interaction

hybrid cartesian/immersed boundary
finite-element method


A strong and easily computable separation bound for arithmetic expressions involving radicals We consider arithmetic expressions over operators +, -, *, /, and k root, with integer operands. For an expression E having value xi, a separation bound sep(E) is a positive real number with the property that xi not equal 0 implies \xi\ greater than or equal to sep(E). We propose a new separation bound that is easy to compute and stronger than previous bounds.

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


A record linkage process of a cervical cancer screening database This paper aims at to present the integration of the files of the Brazilian Cervical Cancer Information System (SISCOLO) in order to identify all women in the system. SISCOLO has the exam as the unit of observation and the women are not uniquely identified. It has two main tables: histology and cytology, containing the histological and cytological examinations of women, respectively. In this study, data from June 2006 to December 2009 were used. Each table was linked with itself and with the other through record linkage methods. The integration identified 6236 women in the histology table and 1,678,993 in the cytology table. 5324 women from the histology table had records in the cytology table. The sensitivities were above 90% and the specificities and precisions near 100%. This study showed that it is possible to integrate SISCOLO to produce indicators for the evaluation of the cervical cancer screening programme taking the woman as the unit of observation.

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

public health information systems
database integration


Emotion recognition from speech using source, system, and prosodic features In this work, source, system, and prosodic features of speech are explored for characterizing and classifying the underlying emotions. Different speech features contribute in different ways to express the emotions, due to their complementary nature. Linear prediction residual samples chosen around glottal closure regions, and glottal pulse parameters are used to represent excitation source information. Linear prediction cepstral coefficients extracted through simple block processing and pitch synchronous analysis represent the vocal tract information. Global and local prosodic features extracted from gross statistics and temporal dynamics of the sequence of duration, pitch, and energy values represent the prosodic information. Emotion recognition models are developed using above mentioned features separately, and in combination. Simulated Telugu emotion database (IITKGP-SESC) is used to evaluate the proposed features. The emotion recognition results obtained using IITKGP-SESC are compared with the results of internationally known Berlin emotion speech database (Emo-DB). Autoassociative neural networks, Gaussian mixture models, and support vector machines are used to develop emotion recognition systems with source, system, and prosodic features, respectively. Weighted combination of evidence has been used while combining the performance of systems developed using different features. From the results, it is observed that, each of the proposed speech features has contributed toward emotion recognition. The combination of features improved the emotion recognition performance, indicating the complementary nature of the features.

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

emotion recognition
local prosodic features
pitch synchronous analysis

excitation source features
global prosodic features
glottal closure instants
emo-db
iitkgp-sesc
system features
zero frequency filter


Shortcut Fusion of Monadic Programs Functional programs often combine separate parts of the program using intermediate data structures for communicating results. Programs so defined are easier to understand and maintain, but suffer from inefficiency problems due to the generation of those data structures. In response to this problematic, some program transformation techniques have been studied with the aim to eliminate the intermediate data structures that arise in function compositions. One of these techniques is known as shortcut fusion. This technique has usually been studied in the context of purely functional programs. In this work we propose an extension of shortcut fusion that is able to eliminate intermediate data structures generated in the presence of monadic effects. The extension to be presented can be uniformly defined for a wide class of data types and monads.

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

computational effects
functional programming


SiZer Map for inference with additive models Sizer Map is proposed as a graphical tool for assistance in nonparametric additive regression testing problems. Four problems have been analyzed by using SiZer Map: testing for additivity, testing the components significance, testing parametric models for the components and testing for interactions. The simplicity and flexibility of SiZer Map for our purposes are highlighted from the performed empirical study with several real datasets. With these data, we compare the conclusions derived from SiZer analysis with the global results derived from standard tests, previously proposed in the literature.

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

test
model checking
smoothing parameter
residuals
interaction


Learning policies for single machine job dispatching Reinforcement learning (RL) has received some attention in recent years from agent-based researchers because it deals with the problem of how an autonomous agent can learn to select proper actions for achieving its goals through interacting with its environment. Each time after an agent performs an action, the environment's response, as indicated by its new state, is used by the agent to reward or penalize its action. The agent's goal is to maximize the total amount of reward it receives over the long run. Although there have been several successful examples demonstrating the usefulness of RL, its application to manufacturing systems has not been fully explored. In this study, a single machine agent employs the Q-learning algorithm to develop a decision-making policy on selecting the appropriate dispatching rule from among three given dispatching rules. The system objective is to minimize mean tardiness. This paper presents a factorial experiment design for studying the settings used to apply Q-learning to the single machine dispatching rule selection problem. The factors considered in this study include two related to the agent's policy table design and three for developing its reward function. This study not only investigates the main effects of this Q-learning application but also provides recommendations for factor settings and useful guidelines for future applications of Q-learning to agent-based production scheduling.

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

reinforcement learning
dispatching rule selection


On-line monitoring of boring tools for control of boring operations In order to carry out precision and quality control of boring operations, on-line monitoring of boring tools is essential. Fourteen features were extracted by processing cutting force signals using virtual instrumentation. A Sequential Forward Search (SFS) algorithm was employed to select the best combination of features. Backpropagation neural networks (BPNs) and adaptive neuro-fuzzy inference systems (ANFIS) were used for on-line classification and measurement of tool wear. The input vectors consist of selected features. For the on-line classification, the outputs are boring tool conditions, which are either usable or worn out. For the on-line measurement, the outputs are estimated value of the tool wear. Using BPN, five features were needed for the on-line classification of boring tools. They are the average longitudinal force, average value of the ratio between the tangential and radial forces, skewness of the longitudinal force, skewness of the tangential force, and kurtosis of the longitudinal force. Three features, the average longitudinal force, average of the ratio between the tangential and radial forces, and kurtosis of the longitudinal force, were needed for on-line measurement of tool wear. Using ANFIS, three features were needed for the on-line classification of boring tools. They are the average longitudinal force, average of the ratio between the tangential and radial forces, and kurtosis of the longitudinal force. Only one feature, kurtosis of the longitudinal force, was needed for the on-line measurement of tool wear using ANFIS. Both 5201BPN and 35 ANFIS can achieve a 100% success rate for the on-line classification of boring tool conditions. Using a 3201BPN for neural computing, the minimum flank wear estimation error is 0.29% while the minimum flank wear estimation error is 2.04% using a 15 ANFIS.

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


Content delivery policies in replicated web services: Client-side vs. server-side Replication of Web Services has an important role among techniques that have been developed in order to meet the demand for faster and more efficient access to the Internet. Replication can be addressed both by a cluster of servers, and by servers geographically distributed in the Internet. In this paper, we focus on geographical replication. Two approaches are commonly used for geographical replication: server-side and client-side. In the client-side approach, the client has a significant role in the policy used to exploit Web Service Replication. In the server-side approach, the client transparently exploits a Replicated Web Service. Both server-side and client-side approaches provide various strategies that can be adopted. An analysis of these strategies, and an overall classification, is presented here. Finally, client-side and server-side approaches are compared, identifying their pros and cons in order to propose the features of an eventual complete approach.

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

replication
web service
content delivery policies

content distribution
http
parallel access
server selection
qos


Matching macroscopic properties of binary fluids to the interactions of dissipative particle dynamics We investigate the role played by conservative forces in dissipative particle dynamics (DPD) simulation of single-component, and binary fluids. We employ equations from kinetic theory for matching the coefficients of DPD interparticle force to the macroscopic properties of fluid such as: density, temperature, diffusion coefficient, kinematic viscosity and sound velocity The sound velocity c is coupled with scaling factor pi(1) of conservative component of the DFD collision operator. Its value sets up an upper limit on the mass S of a single particle in DPD fluid. The Kirkwood-Alder fluid-solid transition is observed for a sufficiently large S. We emphasize the role of the scaling factor pi(12) for particles of different types in simulating phase separation in binary fluids. The temporal growth of average domain size R(t) in the phase separation process depends on the value of immiscibility coefficient Delta = pi(12) - pi(1). For small immiscibility, R(t) proportional to t(beta), where beta approximate to 1/2 for R(t) R-H, R-H is the hydrodynamic length. Finally, both phases separate out completely. For larger immiscibility, R(t) increases exponentially at the beginning of simulation, while finally the domain growth process becomes marginal. We also observe the creation of emulsion-like structures. This effect results from an increase of the surface tension on the two-phase interface along with increasing immiscibility.

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

dissipative particle dynamics
phase separation

particle interactions
computer simulations


Modeling and control of a pneumatic artificial muscle manipulator joint - Part I: Modeling of a pneumatic artificial muscle manipulator joint with accounting for creep effect An antagonistically actuated pair of pneumatic muscle actuators has recently become an interesting basic joint unit for developing humanoid robots or robotic manipulators in general. This basic unit exhibits some advantageous characteristics, such as high compliance, high power-weight ratio, and high volume-to-weight ratio. However, hysteresis and muscle creep are significant drawbacks that limit the performance of this manipulator unit. This paper presents a new approach to model the hysteresis, also taking into account the muscle creep, of a basic antagonistic manipulator joint constructed by a pair of Festo fluidic muscles. The experimental results show that the manipulator hysteresis has the same behavior as that found in the individual muscles. This behavior is well described by the Maxwell-slip model. The creep effect is factorized and incorporated into the constraint torque model, resulting in a stationary extracted hysteresis loop. The time-varying behavior, due to creep, is transformed into a time-invariant one, and only one identified set of Maxwell-slip model parameters is proven to be adequate. This model performs well in the prediction of the torque-angle hysteresis, not only with an arbitrary angular trajectory at any isobaric condition, but also at any moment in the creep history of the unit. (C) 2012 Elsevier Ltd. All rights reserved.

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

mckibben artificial muscle
hysteresis modeling
pneumatic muscle manipulation


Short-term site-wide maintenance scheduling Preventive maintenance is essential for every chemical production site to prevent failure and accidents, however, it upsets material and utility flows inside the site and also causes production loss. In order to minimize the loss, maintenance of each plant unit has to be carefully scheduled together with considerations on site-wide material and utility balances. This will involve both production and utility systems, and indeed is a very complicated problem. A scheduling strategy is then employed to handle the problem efficiently. It divides the scheduling into two steps, long-term and short-term. Long-term maintenance scheduling determines the combination of plant shutdown in a period of 2-5 years. Base upon the long-term schedule, a short-term maintenance scheduling optimizes the exact timing of plant shutdown, overhaul, inspection and startup within a maintenance period of 4-10 weeks. Short-term maintenance scheduling involves pre-set utility and material demand profiles during a plant shutdown, overhaul and startup making it a very challenging task. In this paper, a multi-period mixed integer linear programming (MILP) model, a site-model, is proposed as an aid to optimize short-term site-wide maintenance schedule. A special formulation is also developed to deal with the pre-set utility and material demand profiles in the site-model. (C) 2003 Elsevier Ltd. All rights reserved.

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


Editorial process in scientific journals: analysis and modeling The editorial handling of articles in scientific journals as a human activity process is considered. Using recently proposed approaches of human dynamics theory we examine the probability distributions of random variables reflecting the temporal characteristics of studied processes. The first part of this article contains our results of analysis of the real data about articles published in scientific journals. The second part is devoted to modeling of time-series connected with editorial work. The purpose of our study is to present new object that can be studied in terms of human dynamics theory and to corroborate the scientometrical application of the results obtained.

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

time-series modeling
editorial process analysis


Classification of emotional speech using 3DEC hierarchical classifier The recognition of emotion from speech acoustics is an important problem in humanmachine interaction, with many potential applications. In this paper, we first compare four ways to extend binary support vector machines (SVMs) to multiclass classification for recognising emotions from speechnamely two standard SVM schemes (one-versus-one and one-versus-rest) and two other methods (DAG and UDT) that form a hierarchy of classifiers, each making a distinct binary decision about class membership. These are trained and tested using 6552 features per speech sample extracted from three databases of acted emotional speech (DES, Berlin and Serbian) and a database of spontaneous speech (FAU Aibo Emotion Corpus) using the OpenEAR toolkit. Analysis of the errors made by these classifiers leads us to apply non-metric multi-dimensional scaling (NMDS) to produce a compact (two-dimensional) representation of the data suitable for guiding the choice of decision hierarchy. This representation can be interpreted in terms of the well-known valence-arousal model of emotion. We find that this model does not give a particularly good fit to the data: although the arousal dimension can be identified easily, valence is not well represented in the transformed data. We describe a new hierarchical classification technique whose structure is based on NMDS, which we call Data-Driven Dimensional Emotion Classification (3DEC). This new method is compared with the best of the four classifiers studied earlier and a state-of-the-art classification method on all four databases. We find no significant difference between these three approaches with respect to speaker-dependent performance. However, for the much more interesting and important case of speaker-independent emotion classification, 3DEC significantly outperforms the competitors.

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

speech processing
emotion recognition
valence-arousal model
multiclass support vector machines


On optimal low rank Tucker approximation for tensors: the case for an adjustable core size Approximating high order tensors by low Tucker-rank tensors have applications in psychometrics, chemometrics, computer vision, biomedical informatics, among others. Traditionally, solution methods for finding a low Tucker-rank approximation presume that the size of the core tensor is specified in advance, which may not be a realistic assumption in many applications. In this paper we propose a new computational model where the configuration and the size of the core become a part of the decisions to be optimized. Our approach is based on the so-called maximum block improvement method for non-convex block optimization. Numerical tests on various real data sets from gene expression analysis and image compression are reported, which show promising performances of the proposed algorithms.

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

multiway array
tucker decomposition
low-rank approximation


Knowledge base management systems-tools for creating verified intelligent systems As automation of business processes becomes more complex and encompasses less-structured domains, it becomes even more essential that the knowledge used by these processes is verified and accurate. Most application development is facilitated with software tools, but most business rules and expert systems are developed in environments that provide inadequate verification testing. This paper describes an emerging class of applications we refer to as Knowledge Base Management Systems (KBMS). The KMBS provides a full life-cycle environment for the development and verification of business rule and expert systems. We will present an overview of knowledge base verification, the KBMS life-cycle, and the architecture for a KBMS. We then describe building a small expert system in the KBMS, with emphasis on the verification testing at each stage. We conclude with a summary of the benefits of a KBMS.

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

computer aided software development
rapid application development


video inpainting and restoration techniques Aged films may contain defects such as spikes or dirt, as well as long vertical defect lines. These defects were produced in file development or due to improper maintenance of films. We present a series of algorithms, which can detect and restore defects. In addition, the restoration technique is used with a motion tracking mechanism. Objects can be removed and holes can be inpainted. We aim to demonstrate three tools for 1) spike detection and restoration, 2) long vertical line detection and repairing, and 3) object removal and inpainting. Results of restored video clips show that our mechanisms are practical with good inpainted video quality.

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

motion estimation
defect detection
video inpainting
image completion
software tool


EClass: An execution classification approach to improving the energy-efficiency of software via machine learning Energy efficiency at the software level has gained much attention in the past decade. This paper presents a performance-aware frequency assignment algorithm for reducing processor energy consumption using Dynamic Voltage and Frequency Scaling (DVFS). Existing energy-saving techniques often rely on simplified predictions or domain knowledge to extract energy savings for specialized software (such as multimedia or mobile applications) or hardware (such as NPU or sensor nodes). We present an innovative framework, known as EClass, for general-purpose DVFS processors by recognizing short and repetitive utilization patterns efficiently using machine learning. Our algorithm is lightweight and can save up to 52.9% of the energy consumption compared with the classical PAST algorithm. It achieves an average savings of 9.1% when compared with an existing online learning algorithm that also utilizes the statistics from the current execution only. We have simulated the algorithms on a cycle-accurate power simulator. Experimental results show that EClass can effectively save energy for real life applications that exhibit mixed CPU utilization patterns during executions. Our research challenges an assumption among previous work in the research community that a simple and efficient heuristic should be used to adjust the processor frequency online. Our empirical result shows that the use of an advanced algorithm such as machine learning can not only compensate for the energy needed to run such an algorithm, but also outperforms prior techniques based on the above assumption. (C) 2011 Elsevier Inc. All rights reserved.

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

workload prediction
energy optimization
energy saving


Internet health information seeking is a team sport: Analysis of the Pew Internet Survey Previous studies examining characteristics of Internet health information seekers do not distinguish between those who only seek for themselves, and surrogate seekers who look for health information for family or friends. Identifying the unique characteristics of surrogate seekers would help in developing Internet interventions that better support these information seekers. To assess differences between self seekers versus those that act also as surrogate seekers. We analyzed data from the cross-sectional Pew Internet and American Life Project November/December 2008 health survey. Our dependent variable was self-report of type of health information seeking (surrogate versus self seeking). Independent variables included demographics, health status, and caregiving. After bivariate comparisons, we then developed multivariable models using logistic regression to assess characteristics associated with surrogate seeking. Out of 1250 respondents who reported seeking health information online, 56% (N=705) reported being surrogate seekers. In multivariable models, compared with those who sought information for themselves only, surrogate seekers were more likely both married and a parent (OR=1.57, CI=1.08, 2.28), having good (OR=2.05, CI=1.34, 3.12) or excellent (OR=2.72, CI=1.70, 4.33) health status, being caregiver of an adult relative (OR=1.76, CI=1.34, 2.30), having someone close with a serious medical condition (OR=1.62, CI=1.21, 2.17) and having someone close to them facing a chronic illness (OR=1.55, CI=1.17, 2.04). Our findings provide evidence that information needs of surrogate seekers are not being met, specifically of caregivers. Additional research is needed to develop new functions that support surrogate seekers.

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

patient education
communication
online interventions
context sensitive informatics


Parallel machine scheduling and common due window assignment with job independent earliness and tardiness costs We study problems of scheduling n jobs on m identical parallel machines, in which a common due window has to be assigned to all jobs. If a job is completed within the due window, then it incurs no scheduling cost. Otherwise, an earliness or tardiness cost is incurred. The job completion times as well as the due window location and size are integer valued decision variables. The objective is to find a job schedule as well as location and size of the due window such that a sum of costs associated with job earliness, job tardiness and due window location and size is minimized. The costs are arbitrary nondecreasing and job independent functions. We establish a number of properties of optimal solutions and derive dynamic programming algorithms, which are pseudopolynomial if the number of machines is a constant. The single machine case, in which the due window size cost is a discretely convex or concave nondecreasing function and all the other cost functions are linear, is shown to be polynomially solvable.

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

scheduling
parallel machine
due window assignment


Linear intensity-based image registration by Markov random fields and discrete optimization We propose a framework for intensity-based registration of images by linear transformations, based on a discrete Markov random field (MRF) formulation. Here, the challenge arises from the fact that optimizing the energy associated with this problem requires a high-order MRF model. Currently, methods for optimizing such high-order models are less general, easy to use, and efficient, than methods for the popular second-order models. Therefore, we propose an approximation to the original energy by an MRF with tractable second-order terms. The approximation at a certain point p in the parameter space is the normalized sum of evaluations of the original energy at projections of p to two-dimensional subspaces. We demonstrate the quality of the proposed approximation by computing the correlation with the original energy, and show that registration can be performed by discrete optimization of the approximated energy in an iteration loop. A search space refinement strategy is employed over iterations to achieve sub-pixel accuracy, while keeping the number of labels small for efficiency. The proposed framework can encode any similarity measure is robust to the settings of the internal parameters, and allows an intuitive control of the parameter ranges. We demonstrate the applicability of the framework by intensity-based registration, and 2D3D registration of medical images. The evaluation is performed by random studies and real registration tasks. The tests indicate increased robustness and precision compared to corresponding standard optimization of the original energy, and demonstrate robustness to noise. Finally, the proposed framework allows the transfer of advances in MRF optimization to linear registration problems.

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

markov random fields
discrete optimization

linear image registration
intensity-based registration


Address translation in telecommunication features Address translation causes a wide variety of interactions among telecommunication features. This article begins with a formal model of address translation and its effects, and with principles for understanding how features should interact in the presence of address translation. There is a simple and intuitive set of constraints on feature behavior so that features will interact according to the principles. This scheme (called "ideal address translation") has provable properties, is modular ( explicit cooperation among features is not required), and supports extensibility ( adding new features does not require changing old features). The article also covers reasoning in the presence of exceptions to the constraints, limitations of the theory, relation to real networks and protocols, and relation to other research.

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

design
verification
component architecture
feature interaction
formal methods
network addressing
network protocols
network security
requirements
telecommunications


PACS in Toolo Hospital A 3-year PACS project was started in 1997 and completed in 1999 with filmless radiology and surgery. An efficient network for transferring images provides the infrastructure for integration of different distributed imaging systems and enables efficient handling of all patient-related information on one display station. Because of the need for high-speed communications and the massive amount of image data transferred in radiology, ATM (25, 155 Mbit/s) was chosen to be the main technology used. Both hardware and software redundancy of the system have been carefully planned. The size of the Dicom image library utilizing MO discs is currently 1.2 TB with 300 GB RAID capacity. For the increasing amount of teleradiologic consultations, a special Dicom gateway is planned. It allows a centralized and resilient handling and routing of received images around the hospital. Hospital-wide PACS has already improved the speed and quality of patient care by providing instant access to diagnostic information at multiple locations simultaneously. The benefits of PACS are considered from the viewpoint of the entire hospital: PACS offers a method for efficiently transporting patient-related images and reports to the referring physicians. (C) 2001 Elsevier Science Ireland Ltd. All rights reserved.

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


Transcranial electric stimulation of motor pathways: a theoretical analysis The response to transcranial electrical stimulation of the brain is an important means of assessing motor pathways in the anesthetized patient. The purposes of this study were to elucidate the pattern of axonal excitation produced by transcranial stimulation and to demonstrate how this pattern is affected by changes in the conductivity or geometry of the skull-CSF-brain complex. To this end, analytic solutions to the problem of electrodes placed on a three shell spherical model were obtained under constant current conditions. The potentials, currents and fields generated were computed and the "activating function" was computed for an idealized set of radially organized axons in order to estimate the degree of membrane depolarization produced by stimulation. The degree to which electromagnetic/radiation effects change these solutions was also estimated. The pattern of stimulation was only slightly dependent on the conductivity and the thickness of the CSF layer. Axons very close to the anode were stimulated with lowest threshold at the brain surface. Axons further away were stimulated with higher thresholds and the point of maximum stimulation moved nearer the center of the sphere. Near the cathode, stimulation was maximal about 5-7degrees away from the edge of the electrode but the peak magnitude of the activating function was generally 20 times lower than over the anode. (C) 2004 Elsevier Ltd. All rights reserved.

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

activating function
model
current
electrode

motor stimulation
evoked potential
electrostatics
skin depth


An Online Scalable Algorithm for Average Flow Time in Broadcast Scheduling In this article, the online pull-based broadcast model is considered. In this model, there are n pages of data stored at a server and requests arrive for pages online. When the server broadcasts page p, all outstanding requests for the same page p are simultaneously satisfied. We consider the problem of minimizing average (total) flow time online where all pages are unit-sized. For this problem, there has been a decade-long search for an online algorithm which is scalable, that is, (1 + epsilon)-speed O(1)-competitive for any fixed epsilon > 0. In this article, we give the first analysis of an online scalable algorithm.

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

broadcast
average flow time
online
scalable


A hybrid evolutionary approach for heterogeneous multiprocessor scheduling This article investigates the assignment of tasks with interdependencies in a heterogeneous multiprocessor environment; specific to this problem, task execution time varies depending on the nature of the tasks as well as with the processing element assigned. The solution to this heterogeneous multiprocessor scheduling problem involves the optimization of complete task assignments and processing order between the assigned processors to arrive at a minimum makespan, subject to a precedence constraint. To solve an NP-hard combinatorial optimization problem, as is typified by this problem, this paper presents a hybrid evolutionary algorithm that incorporates two local search heuristics, which exploit the intrinsic structure of the solution, as well as through the use of specialized genetic operators to promote exploration of the search space. The effectiveness and contribution of the proposed features are subsequently validated on a set of benchmark problems characterized by different degrees of communication times, task, and processor heterogeneities. Preliminary results from simulations demonstrate the effectiveness of the proposed algorithm in finding useful schedule sets based on the set of new benchmark problems.

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

multiprocessor scheduling
heterogeneous
hybrid evolutionary algorithm
local search
precedence


BEM-RBF approach for viscoelastic flow analysis A new BE-only method is achieved for the numerical solution of viscoelastic flows. A decoupled algorithm is chosen where the fluid is considered as being composed of an artificial Newtonian component and the remaining component which is accordingly defined from the original constitutive equation. As a result the problem is viewed as that of solving for the flow of a Newtonian liquid with the non-linear viscoelastic effects acting as a pseudo-body force. Thus the general solution can be obtained by adding a particular solution (PS) to the homogeneous one. The former is obtained by a BEM for the base Newtonian fluid and the latter is obtained analytically by approximating the pseudo-body force in terms of suitable radial basis functions (RBFs). Embedded in the approximation of the pseudo-body force is the calculation of the polymer stress. This is achieved by solving the constitutive equation using RBF networks (RBFNs). Both the calculations of the PS and the polymer stress are therefore meshless and the resultant BEM-RBF method is a BE-only method. The complete elimination of any structured domain discretisation is demonstrated with a number of flow problems involving the upper convected Maxwell (UCM) and the Oldroyd-B fluids.

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

function approximation
derivative approximation
bem-ps-rbfn formulation


Novel pharmacophore-based methods reveal gossypol as a reverse transcriptase inhibitor In a program to identify new structural entities for the inhibition of the HIV-1 reverse transcriptase (RT) enzyme via database searching, a series of RT pharmacophores were developed. By utilising a novel filtering technique, the National Cancer Institute database of compounds was scanned producing 15 compounds to be screened for activity. A notable inclusion was a series of gossypol derivatives. The testing of a series of compounds revealed the parent compound gossypol to be an HIV-1 reverse transcriptase inhibitor. These results suggest that at least a part of its anti-HIV activity is due to gossypol targeting the non-nucleoside inhibitor binding pocket of RT.

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

gossypol
pharmacophores
database searching
reverse transcriptase


Fuzzy Clustering for Semantic Knowledge Bases This work focusses on the problem of clustering resources contained in knowledge bases represented throughmulti-relational standard languages that are typical for the context of the Semantic Web, and ultimately founded in Description Logics. The proposed solution relies on effective and language-independent dissimilarity measures that are based on a finite number of dimensions corresponding to a committee of discriminating features, that stands for a context, represented by concept descriptions in Description Logics. The proposed clustering algorithm expresses the possible clusterings in tuples of central elements: in this categorical setting, we resort to the notion of medoid, w.r.t. the given metric. These centers are iteratively adjusted following the rationale of fuzzy clustering approach, i.e. one where the membership to each cluster is not deterministic but graded, ranging in the unit interval. This better copes with the inherent uncertainty of the knowledge bases expressed in Description Logics which adopt an open-world semantics. An extensive experimentation with a number of ontologies proves the feasibility of our method and its effectiveness in terms of major clustering validity indices.

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

multi-relational learning
ontology
semantic web mining


The basins of attraction of a new Hopfield learning rule The nature of the basins of attraction of a Hopfield network is as important as the capacity. Here a new learning rule is re-introduced. This learning rule has a higher capacity than that of the Hebb rule, and still keeps important functionality, such as incrementality and locality, which the pseudo-inverse lacks. However the basins of attraction of the fixed points of this learning rule have not yet been studied. Three important characteristics of basins of attraction are considered: indirect and direct basins of attraction, distribution of sizes of basins of attraction and the shape of the basins of attraction. The results for the new learning rule are compared with those of the Hebb rule. The size of direct and indirect basins of attractions are generally larger for the new rule than for the Hebb rule, the distribution of sizes is more even, and the shape of the basins more round.

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

hopfield neural networks
attraction basins
learning rules


ADAPTIVENESS IN MONOTONE PSEUDO-BOOLEAN OPTIMIZATION AND STOCHASTIC NEURAL COMPUTATION Hopfield neural network (HNN) is a nonlinear computational model successfully applied in finding near-optimal solutions, of several difficult combinatorial problems. In many cases, the network energy function is obtained through a learning procedure so that its minima are states falling into a proper subspace (feasible region) of the search space. However, because of the network nonlinearity, a number of undesirable local energy minima emerge from the learning procedure, significantly effecting the network performance. In the neural model analyzed here, we combine both a penalty and a stochastic process in order to enhance the performance of a binary HNN. The penalty strategy allows us to gradually lead the search towards states representing feasible solutions, so avoiding oscillatory behaviors or asymptotically instable convergence. Presence of stochastic dynamics potentially prevents the network to fall into shallow local minima of the energy function, i.e., quite far from global optimum. Hence, for a given fixed network topology, the desired final distribution on the states can be reached by carefully modulating such process. The model uses pseudo-Boolean functions both to express problem constraints and cost function; a combination of these two functions is then interpreted as energy of the neural network. A wide variety of NP-hard problems fall in the class of problems that call be solved by the model at hand, particularly those having a monotonic quadratic pseudo-Boolean function as constraint function. That is, functions easily derived by closed algebraic expressions representing the constraint structure and easy (polynomial time) to maximize. We show the asymptotic convergence properties of this model characterizing its state space distribution at thermal equilibrium in terms of Markov chain and give evidence of its ability to find high quality solutions on benchmarks and randomly generated instances of two specific problems taken from the computational 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 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

hopfield neural networks
nonlinear pseudo-boolean optimization
penalty strategies
heuristics


Combined effects of acoustic and visual distraction on cognitive performance and well-being ? ?? Information work is usually performed in offices and influenced by the combined effects of acoustics, room climate, lighting and air quality. However, the principal part of literature solely focuses on the individual effects of physical parameters. This study (n=32) investigates the combined effects of acoustic and visual distraction with regard to cognitive performance and well-being. Therefore low level background speech (40dB(A)) of good or poor intelligibility was combined with either static or dynamic lighting. Experimental testing lasted for approx. 7h for each participant and was conducted in mock-up offices. No interaction effects of background speech and lighting conditions with regard to cognitive performance were found. However, the results prove that even low level background speech of high intelligibility significantly impairs short-term memory, reasoning ability and well-being. But no effect of background speech on text comprehension and sustained attention was found. Visual distraction due to dynamic lighting caused significant complaints but did not impair performance. An interaction effect of background speech and lighting conditions was found with regard to perceived performance during task processing. Test persons only felt to perform better, if background speech of low intelligibility was combined with static lighting. It is shown that the effects on cognitive performance and well-being must be considered separately since these effects are rarely consistent.

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

acoustic distraction
office noise
well-being


Quantifying and Verifying Reachability for Access Controlled Networks Quantifying and querying network reachability is important for security monitoring and auditing as well as many aspects of network management such as troubleshooting, maintenance, and design. Although attempts to model network reachability have been made, feasible solutions to computing network reachability have remained unknown. In this paper, we propose a suite of algorithms for quantifying reachability based on network configurations [mainly Access Control Lists (ACLs)] as well as solutions for querying network reachability. We present a network reachability model that considers connectionless and connection-oriented transport protocols, stateless and stateful routers/firewalls, static and dynamic NAT, PAT, IP tunneling, etc. We implemented the algorithms in our network reachability tool called Quarnet and conducted experiments on a university network. Experimental results show that the offline computation of reachability matrices takes a few hours, and the online processing of a reachability query takes 0.075 s on average.

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


Self-Adaptive Fault Tolerance in Multi-/Many-Core Systems This paper presents a novel approach to the design of multi-/many-core systems with an adaptive level of reliability. The approach defines a layer at the operating system level that achieves fault detection/tolerance/diagnosis properties by means of thread replication and re-execution mechanisms. The layer applies the most convenient hardening mechanism to achieve the desired trade-off between reliability and performance by adapting at run-time to the changes of the working scenario. The proposed strategy has been applied in a set of experimental sessions considering a real-world parallel application, to evaluate its benefits on the final system with respect to various strategies selected at design time.

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

tunable fault tolerance
adaptive systems
multi-/many-core architectures


Field modeling with sampled distances Traditional mesh-based approaches to the modeling and analysis of physical fields within geometric models require some form of topological reconstruction and conversion in the mesh generation process. Such manipulations tend to be tedious and error-prone manual processes that are not easily automated. We show that most field problems may be solved directly by using approximate distance fields computed from designed or sampled geometric data, thus avoiding many of the difficult reconstruction and meshing problems. With distances we can model fields that satisfy boundary conditions while approximating the governing differential equations to arbitrary precision. Because the method is based on sampling, it provides natural control for multi-resolution both in geometric detail of the domain and in accuracy of the computed physical field. We demonstrate the field modeling capability with several heat transfer applications, including a typical transient problem and a scan and solve approach to the simulation of a physical field in a real-world artifact.

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

engineering analysis
meshfree modeling
automated analysis


Pose-invariant face recognition using facial landmarks and Weber local descriptor Face recognition across pose is a popular issue in biometrics. Facial rotations caused by pose dramatically enlarge the intra-class variations, which considerably obstructs the performance of the face recognition algorithms. It is advisable to extract more discriminative features to overcome this difficulty. In this paper, we present a simple but efficient feature extraction method based on facial landmarks and multi-scale fusion features. We first extract local features by using Weber local descriptors (WLD) and multi-scale patches centered at predefined facial landmarks, and then construct fusion features by randomly selecting parts of local features. Finally, the classification result is obtained by decision fusion of all local features and fusion features. The proposed method has the following two characteristics: (1) local features around landmarks can well describe the similarity between two images under pose variations and simultaneously reduce redundant information and (2) fusion features constructed by randomly selecting local features from predefined regions further alleviate the influence of pose variations. Extensive experimental results on public face datasets have shown that the proposed method greatly outperforms the previous state-of-the-art algorithms.

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

face recognition
facial landmarks
weber local descriptors
feature extraction


fpga based programmable embedded intrusion detection system In this article, the design of a Field Programmable Gate Array (FPGA) based real time Intrusion Detection System (IDS) is presented. The embedded system first summarizes and normalizes the packets and then determines whether there is an attack or not using this summary according to the naive bayesian algorithm. The packet summaries which play an important role in the accurate classification of the packets include data such as the IP numbers of the packets, port numbers, protocol types and packet length. Real time Intrusion Detection System (IDS) was designed in the Altera Cyclone III based FPGA development environment and tested. As a result of the tests performed, appropriate results were obtained.

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

intrusion detection system
embedded system


Augmented reality to promote collaborative and autonomous learning in higher education Augmented reality (AR) technology facilitates collaborative work in education. Apps based on AR environments provide satisfaction during the learning process. Students declare an improvement in learning when augmented reality tools were used. Our tools allow learning of theoretical contents in an autonomous way. Our tools facilitate collaboration among students.

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

engineering education
collaborative learning
interactive learning environments


Non-parametric

calibration

for

depth

sensors

Automatic

calibration

method

for

removing

distortions

of

RGBD

sensors.

Non-parametric

distortion

model

adequate

for

any

depth

sensor.

The

procedure

is

easy

to

apply

and

can

be

done

by

non-expert

users.

It

does

not

require

the

use

of

any

other

software

or

of

any

calibration

device.

Freely

available

at

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


morphogenetic constraint-satisfaction based approach for organizational engineering Organizations are modeled using several approaches namely behavioral-science approach, design-science approach [March and Smith 1995], classification approach [Zachman 1993], etc. Can all these different approaches be consistently reconciled? Can this reconciliation be systemic, based on principles that support analyses of organizations? We present a solution to these questions through a morphogenetic constraint-satisfaction based approach.In our view, the hallmark of this approach is that it systemically unifies the functional, cross-functional and behavioral views of organizations.

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


Classification-based vehicle detection in high-resolution satellite images In this study, we have looked into the problem of vehicle detection in high-resolution satellite images. Based on the input from the local road authorities, we have focused not only on highways, but also on inner city roads, where more clutter is expected. The study site is the city of Oslo, Norway. To do vehicle detection in these areas, we propose an automatic approach, consisting of a segmentation step, followed by two stages of object classification. In the process, we utilize multispectral images, panchromatic images and a road network. The approach has been tested on Quickbird images, and the results that are obtained have been compared with manual counts and classifications.

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

quickbird
vehicle detection
classification


Transformed perturbation stochastic finite element method for static response analysis of stochastic structures TPSFEM for static response analysis of stochastic structures is proposed. Probability density function of static response is calculated. Cumulative distribution function of static response is calculated. The effectiveness of TPSFEM is investigated.

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

change-of-variable technique
stochastic structure


A PROXY-BASED SYSTEM FOR DYNAMIC CONTENT NEGOTIATION AND COLLABORATIVE OPTIMIZATION IN HETEROGENIC ENVIRONMENTS Ubiquitous and Pervasive Computing relies on ubiquitous network access and applications' context-awareness. This pervasive access implies exchanging traffic with a wide spectrum of devices across heterogenic networks. Services and applications deployed on these networks should adapt its operation and presentation to the characteristics of the underlying network technologies and the actual client device capabilities. Cellular wide area networks like UMTS are used as Internet access networks for particular users but, in some cases, they can also be employed to provide Internet access to other smaller networks. The main inconvenient is that cellular networks have not the same bandwidth as wired networks and therefore, the cellular channel becomes a network bottle-neck. To help to mitigate this situation and in order to improve the user's experience different optimization techniques exist, especially in web traffic. This paper studies the existing synergies at HTTP layer between device capabilities expression, content negotiation, channel optimization and content adaptation. And secondly, it presents a system where HTTP requests transmission is optimized by means of HTTP header reduction over the cellular channel, showing a significant improvement in response time. In order to allow content negotiation, headers should be restored when reaching the Internet. This dynamic header reconstruction allows giving enriched and more expressive information about user's device and browser capabilities. Thus navigation speed and user's QoE can be enhanced by means of dynamic content negotiation in order to obtain adapted and lighter content and responses from web servers and adaptation proxies alike.

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

pervasive computing
content negotiation
device capabilities

context-awareness
http optimization
ubiquitous web
profiling


Variational multiscale stabilized FEM formulations for transport equations: stochastic advectiondiffusion and incompressible stochastic NavierStokes equations An extension of the deterministic variational multiscale (VMS) approach with algebraic subgrid scale (SGS) modeling is considered for developing stabilized finite element formulations for the stochastic advection and the incompressible stochastic NavierStokes equations. The stabilized formulations are numerically implemented using the spectral stochastic formulation of the finite element method (SSFEM). Generalized polynomial chaos and KarhunenLove expansion techniques are used for representation of uncertain quantities. The proposed stabilized method is then applied to various standard advectiondiffusion and fluid-flow examples with uncertainty in essential boundary conditions. Comparisons are drawn between the numerical solutions and Monte-Carlo/analytical solutions wherever possible.

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

variational multiscale
polynomial chaos
stochastic advection
karhunenlove expansion

spectral stochastic fem
stochastic fluid-flow
subgrid scale models
monte-carlo


Hierarchical interconnection networks based on (3,3)-graphs for massively parallel processors This paper proposes several novel hierarchical interconnection networks based on the (3, 3)-graphs, namely folded (3, 3)-networks, root-folded (3, 3)-networks, recursively expanded (3, 3)-networks, and flooded (3, 3)-networks. Just as the hypercubes, CCC, Peterson-based networks, and Heawood-based networks, these hierarchical networks have the following nice properties: regular topology, high scalability, and small diameters. Due to these important properties, these hierarchical networks seem to have the potential as alternatives for the future interconnection structures of multicomputer systems, especially massively parallel processors (MPPs). Furthermore, this paper will present the routing and broadcasting algorithms for these proposed networks to demonstrate that these algorithms are as elegant as the algorithms for hypercubes, CCC, and Petersen- or Heawood-based networks.

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

roadcasting algorithms
routing algorithms
(3,3)-graph folded (3,3)-networks
root-folded (3,3)-networks
recursively expanded (3,3)-networks
flooded (3,3)-networks


Networks of integrate-and-fire neurons using Rank Order Coding B: Spike timing dependent plasticity and emergence of orientation selectivity Rank Order Coding is an alternative to conventional rate coding schemes that uses the order in which a neuron's inputs fire to encode information. In a visual system framework, we simulated the asynchronous waves of retinal spikes produced in response to natural scenes and used them to stimulate integrate-and-fire V1 neurons that implemented a standard learning rule based on spike timing. After propagating thousands of images, orientation like receptive fields arise in these neurons despite the fact that the input neurons never fired more than once. We also analyze the biological plausibility of such a network.

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

spike timing dependant plasticity
orientation emergence
one spike


Implementation of synthetic turbulence inlet for turbomachinery LES Large eddy simulation (LES) has the potential to model complex separated flows, where Reynolds Averaged Navier-Stokes (RANS) based methods often fail. An important aspect of LES is specifying correlated turbulent fluctuations at the inlet boundary. This is particularly important in turbomachines, where turbulence length scale and intensity play a key role in the correct prediction of component performance. In this work, a method is implemented into an unstructured Computational Fluid Dynamics (CFD) solver to impose correlated turbulent fluctuations in a compressible form. It is shown that compressibility effects are particularly important in turbomachinery and must be taken into account. The method uses a pre-processing method to generate a cube of isotropic, homogeneous turbulence. The velocity fluctuations so obtained are used to determine a fluctuating Mach number in order to evaluate the instantaneous total pressure and temperature fluctuations at domain inlet. In the authors knowledge this is one of the first attempts to define correlated fluctuations in a compressible form. The method is successfully applied to two turbomachinery related flows. Firstly, the jet flow from a propelling nozzle is investigated. Following this, the flow over a low pressure (LP) turbine blade is predicted. Results from the LES simulations show that modifications to the inlet conditions can significantly affect flow development. For the jet, changes in the shear layer and peak shear stress are shown, important in the context of high frequency sideline noise generated by the jet. Despite what is suggested in the literature the differences in shear stresses are important also in a non-swirling jet. For the LP turbine, incoming turbulent fluctuations modify the onset of transition and the extent of separation bubble. Without imposed turbulence fluctuations, loss is overpredicted by up to 50%. Moreover it is important to use a compressible solver. Despite the fact that the majority of the results proposed in literature on LP turbine is using incompressible solvers, the difference in terms of pressure coefficient, Cp, is comparable to turbulence contribution. (C) 2010 Elsevier Ltd. All rights reserved.

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


OBSERVABLES ON sigma-MV ALGEBRAS AND sigma-LATTICE EFFECT ALGEBRAS Effect algebras were introduced as abstract models of the set of quantum effects which represent sharp and unsharp properties of physical systems and play a basic role in the foundations of quantum mechanics. In the present paper, observables on lattice ordered sigma-effect algebras and their "smearings" with respect to (weak) Markov kernels are studied. It is shown that the range of any observable is contained in a block, which is a sigma-MV algebra, and every observable is defined by a smearing of a sharp observable, which is obtained from generalized Loomis-Sikorski theorem for sigma-MV algebras. Generalized observables with the range in the set of sharp real observables arc studied and it is shown that they contain all smearings of observables.

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

lattice effect algebra
mv algebra
state
markov kernel
weak markov kernel
generalized observable