Aortic pressure wave reconstruction during exercise is improved by adaptive filtering: a pilot study Reconstruction of central aortic pressure from a peripheral measurement by a generalized transfer function (genTF) works well at rest and mild exercise at lower heart rates, but becomes less accurate during heavy exercise. Particularly, systolic and pulse pressure estimations deteriorate, thereby underestimating central pressure. We tested individualization of the TF (indTF) by adapting its resonance frequency at the various levels of exercise. In seven males (age 4457) with coronary artery disease, central and peripheral pressures were measured simultaneously. The optimal resonance frequency was predicted from regression formulas using variables derived from the individuals peripheral pressure pulse, including a pulse contour estimation of cardiac output (pcCO). In addition, reconstructed pressures were calibrated to central mean and diastolic pressure at each exercise level. Using a genTF and without calibration, the error in estimated aortic pulse pressure was ?7.56.4mmHg, which was reduced to 0.25.7mmHg with the indTFs using pcCO for prediction. Calibration resulted in less scatter at the cost of a small bias (2.7mmHg). In exercise, the indTFs predict systolic and pulse pressure better than the genTF. This pilot study shows that it is possible to individualize the peripheral to aortic pressure transfer function, thereby improving accuracy in central blood pressure assessment during exercise.

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

aortic pressure
transfer function
individualization


A knowledge-based intelligent electronic commerce system for selling agricultural products This paper presents a knowledge-based intelligent e-commerce system for selling agricultural products. The KIES system not only provides agricultural products sales, financial analysis and sales forecasting, but also provides feasible solutions or actions based on the results of rule-based reasoning. The intelligent system integrates a database, a rule base and a model base to create a tool of which managers can use to deal with decision-making problems via the Internet. Rules in the rule base are explained in detail to illustrate the processes of reasoning. Also, an automatic and practical inference engine that provides monitoring and controlling a verity of processes is presented to show how the system can deal with knowledge management. In order to obtain more profits and manage future change, artificial neural network models in the model base have been developed and compared for demand forecasting. Finally, for offering convenient delivery and user-friendly services to customers, an e-map combined with a GPS is used.

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

knowledge-based intelligent system
e-commerce


Optimal database search: Waves and catalysis Grover's database search algorithm, although discovered in the context of quantum computation, can be implemented using any system that allows superposition of states. A physical realization of this algorithm is described using coupled simple harmonic oscillators, which can be exactly solved in both classical and quantum domains. Classical wave algorithms are far more stable against decoherence compared to their quantum counterparts. In addition to providing convenient demonstration models, they may have a role in practical situations, such as catalysis.

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


Reconstructing a minimum spanning tree after deletion of any node Updating a minimum spanning tree (MST) is a basic problem for communication networks. In this paper we consider single node deletions in MSTs. Let G = (V, E) be an undirected graph with n nodes and m edges, and let T be the MST of G. For each node v in V, the node replacement for v is the minimum weight set of edges R(v) that connect the components of T - v. We present a sequential algorithm and a parallel algorithm that find R(v) for all V simultaneously. The sequential algorithm takes O (m log n) time, but only O (m alpha (m, n)) time when the edges of E are presorted by weight. The parallel algorithm takes O (log(2)n) time using m processors on a CREW PRAM.

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

minimum spanning tree
node replacement
crew pram


Comparison of local weak and strong form meshless methods for 2-D diffusion equation A comparison between weak form meshless local PetrovGalerkin method (MLPG) and strong form meshless diffuse approximate method (DAM) is performed for the diffusion equation in two dimensions. The shape functions are in both methods obtained by moving least squares (MLS) approximation with the polynomial weight function of the fourth order on the local support domain with 13 closest nodes. The weak form test functions are similar to the MLS weight functions but defined over the square quadrature domain. Implicit timestepping is used. The methods are tested in terms of average and maximum error norms on uniform and non-uniform node arrangements on a square without and with a hole for a Dirichlet jump problem and involvement of Dirichlet and Neumann boundary conditions. The results are compared also to the results of the finite difference and finite element method. It has been found that both meshless methods provide a similar accuracy and the same convergence rate. The advantage of DAM is in simpler numerical implementation and lower computational cost.

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

meshless methods
mlpg
dam
weak form
strong form
diffusion equation

error comparison
regular node arrangement
non-regular node arrangement


Improved

version

of

parallel

programming

interface

for

distributed

data

with

multiple

helper

servers

We

present

an

improved

version

of

the

Parallel

Programming

Interface

for

Distributed

Data

with

Multiple

Helper

Servers

library,

which

provides

a

common

application

programming

interface

that

is

based

on

the

most

frequently

used

functionality

of

both

and

GA.

Compared

with

the

previous

version,

the

library

introduces

multiple

helper

servers

to

facilitate

global

data

structures,

and

allows

programmers

to

make

heavy

use

of

large

global

data

structures

efficiently.

Program

summary

Program

title:

Catalogue

identifier:

Program

summary

URL:

Program

obtainable

from:

CPC

Program

Library,

Queen's

University,

Belfast,

N.

Ireland

Licensing

provisions:

Standard

CPC

licence,

No.

of

lines

in

distributed

program,

including

test

data,

etc.:

No.

of

bytes

in

distributed

program,

including

test

data,

etc.:

Distribution

format:

tar.gz

Programming

language:

Fortran,

C

Computer:

Many

parallel

systems

Operating

system:

Various

Has

the

code

been

vectorised

or

parallelised?:

Yes.

processors

used

RAM:

Mbytes

Classification:

External

routines:

Global

Arrays

or

Catalogue

identifier

of

previous

version:

Journal

reference

of

previous

version:

Comput.

Phys.

Comm.

Does

the

new

version

supersede

the

previous

version?:

Yes

Nature

of

problem:

Many

scientific

applications

require

management

and

communication

of

data

that

is

global,

and

the

standard

protocol

provides

only

low-level

methods

for

the

required

one-sided

remote

memory

access.

Solution

method:

The

Parallel

Programming

Interface

for

Distributed

Data

(PPIDD)

library

provides

an

interface,

suitable

for

use

in

parallel

scientific

applications,

that

delivers

communications

and

global

data

management.

The

library

can

be

built

either

using

the

Global

Arrays

(GA)

toolkit,

or

a

standard

library.

This

abstraction

allows

the

programmer

to

write

portable

parallel

codes

that

can

utilise

the

best,

or

only,

communications

library

that

is

available

on

a

particular

computing

platform.

Reasons

for

new

version:

In

the

previous

version,

functionality

in

global

data

structure

was

mainly

implemented

by

passive

one-sided

operations.

In

real

applications

which

make

heavy

use

of

global

data

structures,

very

poor

performance

was

observed.

Summary

of

revisions:

Multiple

helper

servers

are

introduced

to

facilitate

the

manipulation

and

management

of

global

data

structure.

Mutual

exclusion

is

also

implemented

by

the

help

of

a

data

server,

and

becomes

much

more

robust

and

efficient.

In

addition,

flexible

options

are

provided

to

choose

different

settings

for

helper

servers.

Significant

improvement

has

been

seen

in

performance

tests.

M.

Wang

et

al./Computer

Physics

Communications

Running

time:

Problem-dependent.

The

test

provided

with

the

distribution

takes

only

a

few

seconds

to

run.

(C)

Elsevier

B.V.

All

rights

reserved.

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


investigating whether hyperneat produces modular neural networks HyperNEAT represents a class of neuroevolutionary algorithms that captures some of the power of natural development with a computationally efficient high-level abstraction of development. This class of algorithms is intended to provide many of the desirable properties produced in biological phenotypes by natural developmental processes, such as regularity, modularity and hierarchy. While it has been previously shown that HyperNEAT produces regular artificial neural network (ANN) phenotypes, in this paper we investigated the open question of whether HyperNEAT can produce modular ANNs. We conducted such research on problems where modularity should be beneficial, and found that HyperNEAT failed to generate modular ANNs. We then imposed modularity on HyperNEAT's phenotypes and its performance improved, demonstrating that modularity increases performance on this problem. We next tested two techniques to encourage modularity in HyperNEAT, but did not observe an increase in either modularity or performance. Finally, we conducted tests on a simpler problem that requires modularity and found that HyperNEAT was able to rapidly produce modular solutions that solved the problem. We therefore present the first documented case of HyperNEAT producing a modular phenotype, but our inability to encourage modularity on harder problems where modularity would have been beneficial suggests that more work is needed to increase the likelihood that HyperNEAT and similar algorithms produce modular ANNs in response to challenging, decomposable problems.

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

neat
artificial neural networks
generative encodings
developmental encodings
indirect encodings
neuroevolution


Minimal kernel classifiers A finite concave minimization algorithm is proposed for constructing kernel classifiers that use a minimal number of data points both in generating and characterizing a classifier. The algorithm is theoretically justified on the basis of linear programming perturbation theory and a leave-one-out error bound as well as effective computational results on seven real world datasets. A nonlinear rectangular kernel is generated by systematically utilizing as few of the data as possible both in training and in characterizing a nonlinear separating surface. This can result in substantial reduction in kernel data-dependence (over 94% in six of the seven public datasets tested on) and with test set correctness equal to that obtained by using a conventional support vector machine classifier that depends on many more data points. This reduction in data dependence results in a much faster classifier that requires less storage. To eliminate data points, the proposed approach makes use of a novel loss function, the "pound" function ((.)-)(#), which is a linear combination of the 1-norm and the step function that measures both the magnitude and the presence of any error.

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

support vector machines
sparse kernels
data reduction


Tests of Hering- and Helmholtz-Type Models for Saccade-Vergence Interactions by Comparing Visually Guided and Memory-Guided Movements Abstract: We compared the dynamic properties of memory-guided and visually-guided saccade-vergence movements. For memory-guided responses, convergence components were slowed proportionally more than corresponding saccadic components, compared with visually-guided responses. This result is consistent with independent saccadic and vergence systems, and supports a Hering-type model for saccade-vergence interactions.

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


Do web sites change customers beliefs? A study of priorposterior beliefs in e-commerce Web sites are the main interface between online merchants and their customers. Despite the consequent importance of web-site design, there is little theoretical foundation that can be used to assess how web-design factors lead e-customers to revise their earlier beliefs. Our study examined web customers salient beliefs and the role of web-design elements in altering customers existing beliefs after their exposure to an e-commerce web site. Using salient beliefs and categories of web-design elements identified previously, we developed a conceptual model of belief revisions due to exposure to web-design elements and internal cues. The empirical analysis of the model indicated that web customers were influenced by the external cues from the design factors as well as the internal ones from their prior beliefs. Our findings have implications in designing web sites for e-commerce.

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

perceived presence of web-design elements


Noninvasive evaluation of mental stress using by a refined rough set technique based on biomedical signals Evaluating and treating of stress can substantially benefits to people with health problems. Currently, mental stress evaluated using medical questionnaires. However, the accuracy of this evaluation method is questionable because of variations caused by factors such as cultural differences and individual subjectivity. Measuring of biomedical signals is an effective method for estimating mental stress that enables this problem to be overcome. However, the relationship between the levels of mental stress and biomedical signals remain poorly understood. A refined rough set algorithm is proposed to determine the relationship between mental stress and biomedical signals, this algorithm combines rough set theory with a hybrid Taguchi-genetic algorithm, called RS-HTGA. Two parameters were used for evaluating the performance of the proposed RS-HTGA method. A dataset obtained from a practice clinic comprising 362 cases (196 male, 166 female) was adopted to evaluate the performance of the proposed approach. The empirical results indicate that the proposed method can achieve acceptable accuracy in medical practice. Furthermore, the proposed method was successfully used to identify the relationship between mental stress levels and bio-medical signals. In addition, the comparison between the RS-HTGA and a support vector machine (SVM) method indicated that both methods yield good results. The total averages for sensitivity, specificity, and precision were greater than 96%, the results indicated that both algorithms produced highly accurate results, but a substantial difference in discrimination existed among people with Phase 0 stress. The SVM algorithm shows 89% and the RS-HTGA shows 96%. Therefore, the RS-HTGA is superior to the SVM algorithm. The kappa test results for both algorithms were greater than 0.936, indicating high accuracy and consistency. The area under receiver operating characteristic curve for both the RS-HTGA and a SVM method were greater than 0.77, indicating a good discrimination capability. In this study, crucial attributes in stress evaluation were successfully recognized using biomedical signals, thereby enabling the conservation of medical resources and elucidating the mapping relationship between levels of mental stress and candidate attributes. In addition, we developed a prototype system for mental stress evaluation that can be used to provide benefits in medical practice.

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

rough set theory
mental stress
stress evaluation

hybrid taguchi-genetic algorithm
stress diagnosis


Application of Non Parametric Empirical Bayes Estimation to High Dimensional Classification We consider the problem of classification using high dimensional features' space. In a paper by Bickel and Levina (2004), it is recommended to use naive-Bayes classifiers, that is, to treat the features as if they are statistically independent. Consider now a sparse setup, where only a few of the features are informative for classification. Fan and Fan (2008), suggested a variable selection and classification method, called FAIR. The FAIR method improves the design of naive-Bayes classifiers in sparse setups. The improvement is due to reducing the noise in estimating the features' means. This reduction is since that only the means of a few selected variables should be estimated. We also consider the design of naive Bayes classifiers. We show that a good alternative to variable selection is estimation of the means through a certain non parametric empirical Bayes procedure. In sparse setups the empirical Bayes implicitly performs an efficient variable selection. It also adapts very well to non sparse setups, and has the advantage of making use of the information from many "weakly informative" variables, which variable selection type of classification procedures give up on using. We compare our method with FAIR and other classification methods in simulation for sparse and non sparse setups, and in real data examples involving classification of normal versus malignant tissues based on microarray data.

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

non parametric empirical bayes
classification


Unique fixpoint induction for message-passing process calculi We present a proof system for message-passing process calculi with recursion. The key inference rule to deal with recursive processes is a version of Unique Fixpoint Induction for process abstractions. We prove that the proof system is sound and also complete for guarded regular message-passing processes. We also show that the system is incomplete for unguarded processes and discuss more powerful extensions with inductive inference rules. (C) 2001 Elsevier Science B.V. All rights reserved.

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

process equivalence
data transmission
completeness


Fully polynomial time approximation scheme for the weighted flow-time minimization on a single machine with a fixed non-availability interval In a recent paper [Theoretical Computer Science 363, 257-265], He, Zhong and Gu considered the non-resurnable case of the scheduling problem with a fixed non-availability interval under the non-resumable scenario. They proposed a polynomial time approximation scheme (PTAS) to minimize the total completion time. In this paper, we propose a fully polynomial-time approximation scheme to minimize the total weighted completion time. The FPTAS has O(n(2)/epsilon(2)) time complexity, where n is the number of jobs and epsilon is the required error bound. The proposed FPTAS outperforms all the previous approximation algorithms designed for this problem and its running time is strongly polynomial. (C) 2008 Elsevier Ltd. All rights reserved.

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

non-availability constraint
weighted flow-time


dynamic index pruning for effective caching RAM and dynamic pruning schemes to reduce query evaluation times. While only a small portion of lists are processed with dynamic pruning, current systems still store the entire inverted list in cache. In this paper we investigate caching only the pieces of the inverted lists that are actually used to answer a query during dynamic pruning. We examine an LRU cache model, and two recently proposed models. We also introduce a new dynamic pruning scheme for impact-ordered inverted lists. Using two large web collections and corresponding query logs we show that, using an LRU cache, our new pruning scheme reduces the number of disk accesses during query processing time by 7\%-15\% over the state-of-the-art impact-ordered baseline, without reducing answer quality. Surprisingly, however, we discover that using our new pruning scheme makes little difference to disk traffic when the more sophisticated caching schemes are employed.

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


Prediction of major depression in adolescents using an optimized multi-channel weighted speech classification system This study addresses an urgent need for objective measures allowing an efficient, early prediction of risk for depression in adolescents. An early intervention preventing the onset of clinical depression could significantly reduce the social and economic burden of the disease. Previous studies have shown that acoustic speech parameters are strong indicators of full blown depression symptoms in adults and adolescents. The current study investigates the effectiveness of acoustic speech analysis and classification in prediction of depression in adolescents before the full blown symptoms become apparent. The proposed optimized multi-channel weighted speech classification (OMCWSC) method introduces a two-stage multi-channel classification procedure. In the first stage, each channel of the OMCWSC performs an independent classification based on a single type of features (glottal, prosodic and Teager energy operator parameters derived from glottal waveform (TEOG)). In the second stage, the weighted classification outcomes from all channels are combined to deliver the final decision classifying an individual as At Risk (AR) or Not at Risk (NAR) of developing depression symptoms within the next 2.5 years. The weight values of the OMCWSC system are optimized to maximize the overall system classification accuracy. Experiments based on speech recordings collected from 15 AR and 15 NAR adolescents showed that while each of the three individual channels provided prediction accuracy above the chance level (69% glottal, 63% prosodic, 67% TEOG), the adaptive weighting system of the proposed OMCWSC procedure led to further improvement of the prediction results achieving up to 74% accuracy and a well-balanced sensitivity to specificity ratio of 77%/70%.

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

multi-channel classification
prediction of clinical depression
classifier optimization
weighted features
decision fusion


Bounded seas Traditional island grammars are difficult to define and are not flexible enough. Bounded seas a new technique of island parsing are composable, robust, reusable and easy to define. Bounded seas are specified using our extension of parsing expression grammars. Parsers utilizing bounded seas require less effort to define and provide both good precision and performance in the two performed case studies.

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

island parsing
parsing expression grammars


Self-oscillating mixing technique and its application to low-cost receiver architectures Self-oscillating mixers (SOMs) are an excellent choice for low-cost modern receiver architectures because the oscillating source and the mixer are combined in a single device. Moreover, subharmonic operation reduces local oscillator (LO) frequency requirements and therefore provides a very good option for millimetre-wave systems. In this paper, a fully balanced SOM structure at high harmonics with high conversion gain is presented. The balanced structure provides inherent RF-LO isolation and suppression of harmonics and noise. In addition, it removes the input balun from the design, thereby permitting integration into a monolithic microwave integrated circuit (MMIC).

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


Crossover can be constructive when computing unique inputoutput sequences Unique inputoutput (UIO) sequences have important applications in conformance testing of finite state machines (FSMs). Previous experimental and theoretical research has shown that evolutionary algorithms (EAs) can compute UIOs efficiently on many FSM instance classes, but fail on others. However, it has been unclear how and to what degree EA parameter settings influence the runtime on the UIO problem. This paper investigates the choice of acceptance criterion in the (1+1) EA and the use of crossover in the \((\mu+1)\) Steady State Genetic Algorithm. It is rigorously proved that changing these parameters can reduce the runtime from exponential to polynomial for some instance classes of the UIO problem.

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

finite state machines
unique inputoutput sequences
evolutionary algorithms


Spectral modelling of mantle convection in a non orthogonal geometry: application to subduction zones We present a two-dimensional numerical convection model, in a parallelogram-shaped domain adapted to the geometry of subduction zones. The Navier-Stokes problem is solved by a pseudo-spectral solver (named projection-diffusion) coupled to the Richardson iterative scheme. In a convective domain, representative of the upper mantle, plate tectonic parameters are fixed by imposing the velocities on the domain boundaries. In particular, the subducting plate, located on one side of the domain box, moves and dips at constant velocity. The model is validated for the zero obliquity configuration for three boundary conditions: first, for free boundaries, second, for a rigid upper boundary; and third, for a rigid upper and lateral boundary. We also report preliminary results of experiments for a non-zero obliquity at a Rayleigh number value of 10(4), a motionless overriding plate, subduction velocities smaller than 4 cm/yr, and subduction dip angles steeper than 60 degrees. Concerning the evolution of the flow and thermal structures with the subduction movement and geometry, the model predicts the occurrence of a recirculation process, characterised by the formation of an extra convection cell above the subducted plate, Recirculation starts at a critical subduction intensity that is dependent on the subduction geometry: the lower the subduction dip angle, the lower the critical subduction velocity. A critical subduction geometry is predicted by the model because the extra convection cell exists even at very low subduction velocities and subduction dip angles less than 65 degrees. (C) 2000 Elsevier Science Ltd. All rights reserved.

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

numerical modelling
earth's upper mantle
plate velocity


Integration of transient Web services into a virtual peer to peer Web service registry Transient Web service provisioning implies a variety of different requirements that are hard to meet in traditional Web service environments. Currently, Web service brokerage focuses on centralized or replicated architectures. We argue that such systems are not efficient when it comes to dynamic, respectively ad hoc, Web service provisioning. We propose a distributed peer to peer Web service registry solution based on lightweight Web service profiles. We further introduce the notion of views that allow the specification of arbitrary contexts of Web services and provide a working example to illustrate our approach. Finally, we present a prototype that uses tuple spaces as global storage and communication means.

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

pervasive computing
web service registries


An Analysis Framework for Electronic Health Record Systems Interoperation and Collaboration in Shared Healthcare Background: The timely provision of complete and up-to-date patient data to clinicians has for decades been one of the most pressing objectives to be fulfilled by information technology in the healthcare domain. The so-called electronic health record (EHR), which provides a unified view of all relevant clinical data, has received much attention in this context from both research and industry. This situation has given rise to a large number of research projects and commercial products that aim to address this challenge. Different projects and initiatives have attempted to address this challenge from various points of view, which are not easily comparable. Objectives: This paper aims to clarify the challenges, concepts, and approaches involved, which is essential in order to consistently compare existing solutions and objectively assess progress in the field. Methods: This is achieved by two different means. Firstly, the paper will identify the most significant issues that differentiate the points of view and intended scope of existing approaches. As a result, a framework for analysis of EHR systems will be produced. Secondly, the most representative EHR-related projects and initiatives will be described and compared within the context of this framework. Results: The main result of the present paper is an analysis framework for EHR systems. This is intended as an initial step towards an attempt to structure research on this field, clearly lacking sound principles to evaluate and compare results, and ultimately focusing its efforts and being able to objectively evaluate scientific progress. Conclusions: Evaluation and comparison of results in medical informatics, and specifically EHR systems, must address technical and nontechnical aspects. It is challenging to condensate in a single framework all potential views of such a field, and any chosen approach is bound to have its limitations. That being said, any well structured comparison approach, such as the framework presented here, is better than no comparison framework at all, as has been the current situation to date. This paper has presented the first attempt known to the authors to define such a framework.

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

electronic health records
two-level modeling
archetypes
integration
interoperability
semantic interoperability


New technology trends in education: Seven years of forecasts and convergence Each year since 2004, a new Horizon Report has been released. Each edition attempts to forecast the most promising technologies likely to impact on education along three horizons: the short term (the year of the report), the mid-term (the next 2 years) and the long term (the next 4 years). This paper analyzes the evolution of technology trends from 2004 to 2014 that correspond to the long-term predictions of the most recent Horizon Report. The study analyzes through bibliometric analysis which technologies were successful and became a regular part of education systems, which ones failed to have the predicted impact and why, and the shape of technology flows in recent years. The study also shows how the evolution and maturity of some technologies allowed the revival of expectations for others. The analysis here, which focuses on educational applications, offers guidelines that may be helpful to those seeking to invest in new research areas. (C) 2011 Elsevier Ltd. All rights reserved.

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

social web
mobile and ubiquitous devices
augmented reality
semantic web
immersive environments
learning objects


Compressed Sensing Off the Grid This paper investigates the problem of estimating the frequency components of a mixture of complex sinusoids from a random subset of n regularly spaced samples. Unlike previous work in compressed sensing, the frequencies are not assumed to lie on a grid, but can assume any values in the normalized frequency domain [0, 1]. An atomic norm minimization approach is proposed to exactly recover the unobserved samples and identify the unknown frequencies, which is then reformulated as an exact semidefinite program. Even with this continuous dictionary, it is shown that O(s log s log n) random samples are sufficient to guarantee exact frequency localization with high probability, provided the frequencies are well separated. Extensive numerical experiments are performed to illustrate the effectiveness of the proposed method.

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

atomic norm
compressed sensing
continuous dictionary

basis mismatch
line spectral estimation
nuclear norm relaxation
prony's method
sparsity


Information matrix for logistic distributions The Fisher information matrix for Type I, Type II, Type III, and Type IV logistic distributions are derived. (C) 2004 Elsevier Ltd. All rights reserved.

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


Log-hybrid architecture for tonal correction combined with modified un-sharp masking filter algorithm for colour image enhancement Developed system system architecture is less computationally complex than Homomorphic Filtering and Multi Scale Retinex Developed system yields excellent colour rendition and contrast enhancement with reduced complexity. The Log-Hybrid strategy reduces multiplication and avoids complex trigonometric operations. The developed architecture is compact and small enough to fit large and small FPGAs. The scalable architecture also adds sharpness in addition to colour contrast and rendition.

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

multiplierless log-hybrid low-complexity hardware architecture


Cutlike semantics for fuzzy logic and its applications Each fuzzy set can be represented by a nested system of ordinary sets--its a -cuts. There is an extensive literature on fuzzy sets devoted to problems of the following kind: is it possible to reduce operations with fuzzy sets to operations with their a -cuts? Is it possible to reduce properties of fuzzy relations to properties of their a -cuts? More generally, can a fuzzy concept be represented by a collection of corresponding crisp concepts? Klir and Yuan (1995) speak of cutworthiness. We attempt to provide a general solution to this problem. The way we proceed is thus: a structure for fuzzy predicate logic can be represented by a nested system of crisp structures. The system of crisp structures can be used to define semantics of fuzzy predicate logic in an alternative way by using the nested structure and Boolean connectives only. Answers to the above questions are then obtained by simple application of the obtained general results; we present some examples (extension principle, properties of binary fuzzy relations, fuzzy automata).

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


Imaging of primary rhabdomyosarcoma of the diaphragm This is a report on a rare case of embryonal rhabdomyosarcoma involving the diaphragm in a 3-year-old boy. This case illustrates the importance of preoperative imaging in the management of this tumor.

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


Global, voxel, and cluster tests, by theory and permutation, for a difference between two groups of structural MR images of the brain We describe almost entirely automated procedures for estimation of global, voxel, and cluster-level statistics to test the null hypothesis of zero neuroanatomical difference between two groups of structural magnetic resonance imaging (MRI) data. Theoretical distributions under the null hypothesis are available for 1) global tissue class volumes; 2) standardized linear model [analysis of variance (ANOVA and ANCOVA)] coefficients estimated at each voxel; and 3) an area of spatially connected clusters generated by applying an arbitrary threshold to a two-dimensional (2-D) map of normal statistics at voxel level. We describe novel methods for economically ascertaining probability distributions under the null hypothesis, with fewer assumptions, by permutation of the observed data. Nominal Type I error control by permutation testing is generally excellent; whereas theoretical distributions may be over conservative. permutation has the additional advantage that it can be used to test any statistic of interest, such as the sum of suprathreshold voxel statistics in a cluster (or cluster mass), regardless of its theoretical tractability under the null hypothesis. These issues are illustrated by application to MRI data acquired from 18 adolescents with hyperkinetic disorder and 16 control subjects matched for age and gender.

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

brain
probability distributions
statistics


Resistance dependence of transport properties in metalmultiwall carbon nanotubemetal structures We have studied currentvoltage (IV) characteristics of metal-on-tube metalmultiwall carbon nanotubemetal structures as a function of gate voltage. Device resistances ranged from about 10 k? to several M?, depending on the electrode metal and its deposition condition. When the resistance was much higher than the quantum resistance (RQ=h/4e2?6.5 k?), samples showed clear Coulomb blockade. We find that the tunnel barrier is located in the interface between the MWNT and the metal electrode. As the resistance decreased, the Coulomb oscillations became irregular with respect to the gate voltage, but the high resistance region around V=0 and its dependence on gate voltage survived at resistance smaller than 10 k?.

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

multiwall carbon nanotube
coulomb oscillation


Towards historical document indexing: extraction of drop cap letters This paper deals with the difficult problem of indexing ancient graphic images. It tackles the particular case of indexing drop caps (also called Lettrines) and specifically, considers the problem of letter extraction from this complex graphic images. Based on an analysis of the features of the images to be indexed, an original strategy is proposed. This approach relies on filtering the relevant information, on the basis of Meyer decomposition. Then, in order to accommodate the variability of representation of the information, a Zipf's law modeling enables detection of the regions belonging to the letter, what allows it to be segmented. The overall process is evaluated using a relevant set of images, which shows the relevance of the approach.

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


A unified framework for translation and understanding allowing discriminative joint decoding for multilingual speech semantic interpretation ? A comparison between the methods used for speech translation and understanding. A unified framework for translation and understanding. A discriminative joint decoding for multilingual speech semantic interpretation. The proposition is competitive with state-of-the-art techniques. The framework can be generalized to other components of a dialogue system.

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

multilingual speech understanding
conditional random fields
hypothesis graphs
statistical machine translation
dialogue systems


Interpretation of inequality constraints involving interval coefficients and a solution to interval linear programming The modem trend in Operations Research methodology deserves modelling of all relevant vague or uncertain information involved in a real decision problem. Generally, vagueness is modelled by a fuzzy approach and uncertainty by a stochastic approach. In some cases, a decision maker may prefer using interval numbers as coefficients of an inexact relationship. As a coefficient an interval assumes an extent of tolerance or a region that the parameter can possibly take. However, its use in the optimization problems is not much attended as it merits. This paper defines an interval linear programming problem as an extension of the classical linear programming problem to an inexact environment. On the basis of a comparative study on ordering interval numbers, inequality constraints involving interval coefficients are reduced in their satisfactory crisp equivalent forms and a satisfactory solution of the problem is defined. A numerical example is also given. (C) 2001 Elsevier Science B.V. All rights reserved.

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

interval number
inequality relation
mathematical programming


Lessons learned becoming a framework developer When we began developing frameworks we were naive about what was involved in developing a framework versus other software. We had experience in object-oriented development, but even that did not prepare us for some of what we learned as we developed frameworks. This paper captures some of the lessons that we learned as we became framework developers. If you have already developed frameworks these will validate what you have already learned, but for someone just starting out these are the areas where we believe you will be surprised. For example, are you ready to become comfortable exposing your work completely, since almost everything might be part of the framework product? Are you ready to become more disciplined so you can manage and deliver all these pieces? Other lessons will validate and enhance what you learned developing object-oriented software; for example, the value of patterns, especially to define customization points. All are part of the biggest lesson of all, that as a framework developer you are no longer independently developing an application for an end-user, instead you are on the many diverse customer teams using the framework-helping them deliver their applications. Copyright (C) 2002 John Wiley Sons, Ltd.

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

object-oriented applications and systems


Fluorescence Lifetime Imaging Microscopy (FLIM) data analysis with TIMP Fluorescence Lifetime Imaging Microscopy ( FLIM) allows fluorescence lifetime images of biological objects to be collected at 250 nm spatial resolution and at ( sub-) nanosecond temporal resolution. Often n(comp) kinetic processes underlie the observed fluorescence at all locations, but the intensity of the fluorescence associated with each process varies per-location, i. e., per-pixel imaged. Then the statistical challenge is global analysis of the image: use of the fluorescence decay in time at all locations to estimate the ncomp lifetimes associated with the kinetic processes, as well as the amplitude of each kinetic process at each location. Given that typical FLIM images represent on the order of 10(2) timepoints and 10(3) locations, meeting this challenge is computationally intensive. Here the utility of the TIMP package for R to solve parameter estimation problems arising in FLIM image analysis is demonstrated. Case studies on simulated and real data evidence the applicability of the partitioned variable projection algorithm implemented in TIMP to the problem domain, and showcase options included in the package for the visual validation of models for FLIM data.

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

spectroscopy
separable nonlinear least squares
superposition model


on the complexity of factoring bivariate supersparse (lacunary) polynomials We present algorithms that compute the linear and quadratic factors of supersparse (lacunary) bivariate polynomials over the rational numbers in polynomial-time in the input size. In supersparse polynomials, the term degrees can have hundreds of digits as binary numbers. Our algorithms are Monte Carlo randomized for quadratic factors and deterministic for linear factors. Our approach relies on the results by H. W. Lenstra, Jr., on computing factors of univariate supersparse polynomials over the rational numbers. Furthermore, we show that the problem of determining the irreducibility of a supersparse bivariate polynomial over a large finite field of any characteristic is co-NP-hard via randomized reductions.

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

sparse polynomials
np-hardness
multivariate polynomials
polynomial-time complexity
polynomial factorizations


Testing the forensic soundness of forensic examination environments on bootable media In this work we experimentally examine the forensic soundness of the use of forensic bootable CD/DVDs as forensic examination environments. Several Linux distributions with bootable CD/DVDs which are marketed as forensic examination environments are used to perform a forensic analysis of a captured computer system. Before and after the bootable CD/DVD examination, the computer system's hard disk is removed and a forensic image acquired by a second system using a hardware write blocker. The images acquired before and after the bootable CD/DVD examination are hashed and the hash values compared. Where the hash values are inconsistent, a differential analysis is performed on the image files. The differential analysis allows us to quantify and explain the alterations made to the image files by the bootable CD/DVD examination. Our approach can be used to experimentally validate new bootable CD/DVD distributions as forensically sound.

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

bootable examination environment
bootable cd
bootable dvd
hash functions


effects of passenger's arrival distribution to double-deck elevator group supervisory control systems using genetic network programming The Elevator Group Supervisory Control Systems (EGSCS) are the control systems that systematically manage three or more elevators in order to efficiently transport the passengers in buildings. Double-deck elevators, where two cages are connected with each other, are expected to be the next generation elevator systems. Meanwhile, Destination Floor Guidance Systems (DFGS) are also expected in Double-Deck Elevator Systems (DDES). With these, the passengers could be served at two consecutive floors and could input their destinations at elevator halls instead of conventional systems without DFGS. Such systems become more complex than the traditional systems and require new control methods Genetic Network Programming (GNP), a graph-based evolutionary method, has been applied to EGSCS and its advantages are shown in some previous papers. GNP can obtain the strategy of a new hall call assignment to the optimal elevator because it performs crossover and mutation operations to judgment nodes and processing nodes. In studies so far, the passenger's arrival has been assumed to take Exponential distribution for many years. In this paper, we have applied Erlang distribution and Binomial distribution in order to study how the passenger's arrival distribution affects EGSCS. We have found that the passenger's arrival distribution has great influence on EGSCS. It has been also clarified that GNP makes good performances under different conditions.

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

genetic network programming
erlang distribution


Cross-domain activity recognition via transfer learning In activity recognition, one major challenge is how to reduce the labeling effort one needs to make when recognizing a new set of activities. In this paper, we analyze the possibility of transferring knowledge from the available labeled data on a set of existing activities in one domain to help recognize the activities in another different but related domain. We found that such a knowledge transfer process is possible, provided that the recognized activities from the two domains are related in some way. We develop a bridge between the activities in two domains by learning a similarity function via Web search, under the condition that the sensor readings are from the same feature space. Based on the learned similarity measure, our algorithm interprets the data from the source domain as "pseudo training data" in the target domain with different confidence levels, which are in turn fed into supervised learning algorithms for training the classifier. We show that after using this transfer learning approach, the performance of activity recognition in the new domain is increased several fold as compared to when no knowledge transfer is done. Our algorithm is evaluated on several real-world datasets to demonstrate its effectiveness. In the experiments, our algorithm could achieve a 60% accuracy most of the time with no or very few training data in the target domain, which easily outperforms the supervised learning methods. (C) 2010 Elsevier B.V. All rights reserved.

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


Addressing voice recording replications for Parkinsons disease detection A general subject-based Bayesian approach has been proposed. Special treatment is provided for the probit model. Latent variables are used to provide a predictive model that can handle replications. A Gibbs sampling-based method is derived to compute the model parameters. The approach is used to discriminate healthy people from people suffering PD.

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

bayesian binary regression
gibbs sampling
speech recordings
voice features


Minimum Weakly Fundamental Cycle Bases Are Hard To Find In the last years, new variants of the minimum cycle basis (MCB) problem and new classes of cycle bases have been introduced, as motivated by several applications from disparate areas of scientific and technological inquiry. At present, the complexity status of the MCB problem is settled only for undirected, directed, and strictly fundamental cycle bases (SFCB's). Weakly fundamental cycle bases (WFCB's) form a natural superclass of SFCB's. A cycle basis C = {C(1), C(2), ... , C(nu)} of a graph G is a WFCB iff nu = 0 or there exists an edge e of G and a circuit C(i) in C such that C \ C(i) is a WFCB of G \ e. WFCB's still possess several of the nice properties offered by SFCB's. At the same time, several classes of graphs enjoying WFCB's of cost asymptotically inferior to the cost of the cheapest SFCB's have been found and exhibited in the literature. Considered also the computational difficulty of finding cheap SFCB's, these works advocated an in-depth study of WFCB's. In this paper, we settle the complexity status of the MCB problem for WFCB's (the MWFCB problem). The problem turns out to be APX-hard. However, in this paper, we also offer a simple and practical 2inverted right perpendicularlog(2) ninverted left perpendicular-approximation algorithm for the MWFCB problem. In O(n nu) time, this algorithm actually returns a WFCB whose cost is at most 2inverted right perpendicularlog(2)ninverted left perpendicular Sigma(e is an element of E(G)) w(e), thus allowing a fast 2inverted right perpendicularlog(2)ninverted left perpendicular-approximation also for the MCB problem. With this algorithm, we provide tight bounds on the cost of any MCB and MWFCB.

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

combinatorial optimization
minimum cycle basis problem
weakly fundamental cycle basis
fundamental cycle basis
approximation algorithm
computational complexity


how social structure and institutional order co-evolve beyond instrumental rationality This study proposes an agent-based model where adaptively learning agents with local vision who are situated in the Prisoner's Dilemma game change their strategy and location as well. Besides both the copying-highest-scoring strategy and the tie dissolution among defectors as the instrumental rationale, two other heuristics are considered: following-the-majority in the influence process; and the tie dissociation between cooperators and defectors in the selection process. Under the overall setting which is not favorable to cooperation, it turned out that cooperative culture is less likely to emerge and its transmission is more unstable when more agents stick to follow the trend on the fixed network. Given the same set of conditions but with the small amount of social plasticity, cooperative culture is much more likely to emerge and sustain on a hierarchical network where the average clustering coefficient is higher and the average path length is still similar compared to those of the equivalent random network when the small degree of freedom from defectors is allowed to defectors only; much higher and slightly longer, respectively, when cooperators also have that freedom.

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

homophily
prisoner's dilemma game
netlogo
coordination
emergent order
emergent structure


The output of a switch, or, effective bandwidths for networks Consider a switch which queues traffic from many independent input flows. We show that in the large deviations limiting regime in which the number of inputs increases and the service rate and buffer size are increased in proportion, the statistical characteristics of a flow are essentially unchanged by passage through the switch. This significantly simplifies the analysis of networks of switches. It means that each traffic flow in a network can be assigned an effective bandwidth, independent of the other flows, and the behaviour of any switch in the network depends only on the effective bandwidths of the flows using it.

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

effective bandwidths
large deviations
output of a switch

feedforward networks
decoupling bandwidths
many sources


A portable auto attendant system with sophisticated dialog structure An attendant system connects the caller to the party he/she wants to talk to. Traditional systems require the caller to know the full name of the party. If the caller forgets the name, the system fails to provide service for the caller. In this paper we propose a portable Auto Attendant System (AAS) with sophisticated dialog structure that gives a caller more flexibility while calling. The caller may interact with the system to request a phone number by providing just a work area, specialty, surname, or title, etc. If the party is absent, the system may provide extra information such as where he went, when he will be back, and what he is doing. The system is built modularly, with components such as speech recognizer, language model, dialog manager and text-to-speech that can be replaced if necessary. By simply changing the personnel record database, the system can easily be ported to other companies. The sophisticated dialog manager applies many strategies to allow natural interaction between user and system. Functions such as fuzzy request, user repairing, and extra information query, which are not provided by other systems, are integrated into our system. Experimental results and comparisons to other systems show that our approach provides a more user friendly and natural interaction for auto attendant system.

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

auto attendant system
fuzzy request
dialog manager


A unified approach for the recursive determination of generalized inverses Using a unified approach, simple derivations for the recursive determination of different types of generalized inverses of a matrix are presented. These include results for the generalized inverse, the least-squares generalized inverse, the minimum-norm generalized inverse, and the Moore-Penrose inverse of a matrix. (C) 1998 Elsevier Science Ltd. All rights reserved.

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

generalized inverses
recursive determination
unified approach


An intrinsical description of group codes A (left) group code of length n is a linear code which is the image of a (left) ideal of a group algebra via an isomorphism FG -> F(n) which maps G to the standard basis of F(n). Many classical linear codes have been shown to be group codes. In this paper we obtain a criterion to decide when a linear code is a group code in terms of its intrinsical properties in the ambient space F(n), which does not assume an "a priori" group algebra structure on F(n). As an application we provide a family of groups (including metacyclic groups) for which every two-sided group code is an abelian group code. It is well known that Reed-Solomon codes are cyclic and its parity check extensions are elementary abelian group codes. These two classes of codes are included in the class of Cauchy codes. Using our criterion we classify the Cauchy codes of some lengths which are left group codes and the possible group code structures on these codes.

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


Aggregate operators in probabilistic databases Though extensions to the relational data model have been proposed in order to handle probabilistic information, there has been very little work to date on handling aggregate operators in such databases. In this article, we present a very general notion of an aggregate operator and show how classical aggregation operators (such as COUNT, SUM, etc.) as well as statistical operators (such as percentiles, variance, etc.) are special cases of this general definition. We devise a formal linear programming based semantics for computing aggregates over probabilistic DBMSs, develop algorithms that satisfy this semantics, analyze their complexity, and introduce several families of approximation algorithms that run in polynomial time. We implemented all of these algorithms and tested them on a large set of data to help determine when each one is preferable.

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

performance
theory
probabilistic relational databases


development of an olympic audience judging system In this paper we describe the development of a system to facilitate audience participation in judging Olympic events for the CHI 2004, student design contest. This development process utilized domain analysis and human factors principles in combination with user-centered design techniques and usability testing.Application of these techniques resulted in the creation of the Olympic Audience Judging System (OAJS), a solid-state device that uses a hard-control system of buttons and dials in combination with icons and color grouping to convey functionality information to the user. In addition, the system guides the user through the judging process by means of luminance changes designed to draw attention to necessary parts of the interface.The resulting design focuses on simplicity of function. No previous knowledge of the Olympics or of the sports events is necessary to use the system. The OAJS allows for users from various backgrounds to judge Olympic performances.

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

personas
audience participation system
usability testing
paper prototype
user centered design


capturing and playing multimedia events with streams STREAMS is a prototype application designed and implemented at Bellcore to support the recording and playback of technical presentations, training sessions, and meetings. During playback STREAMS lets users make choices about how the recorded information is to be presented. To further aid users, STREAMS incorporates powerful searching techniques for locating information in audio and video streams. Key features of STREAMS include storing information as separate, single-medium streams correlated with each other by time, and using digital storage to allow rapid search and random access. We describe our capture techniques, prototype STREAMS playback system and report initial results.

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

training
video
users
prototype
random access
storage
multimedia
support
audio
search

digitize present play applications systems meeting locatability event timing feature informal records


Real world activity summary for senior home monitoring It is a common knowledge that the daily activities of senior people tell a lot about their health condition. Thus, we believe that analysing their activities at home will improve the health care. Toward this goal, we propose a senior home activity summary system. There are two challenging problems in such a real world application. First, the amount of data for different activity categories is extremely unbalanced, which severely degrades the classifying performance. Second, seniors activities are usually accompanied by nurses walking. It is impractical to predefine and label all the possible activities of all the potential visitors. Consequently, we propose a technique called subspace Naive-Bayesian Mutual Information Maximization (sNBMIM). It divides the feature space into a number of subspaces and allows the kernel and normalization parameters to vary between different subspaces. Moreover, we propose a novel feature filtering technique to reduce or eliminate the effects of the interest points that belong to other people. To evaluate the proposed activity summary system, we have collected a Senior home Activity Recognition dataset (UESTC-SAR), and performed activity recognition for eight categories. The experimental results show that the proposed system provides quite accurate activity summaries for a real world application scenario.

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

activity recognition
activity summary
senior home monitoring
health care
feature filtering


A computational framework to quantify tissue microstructural integrity using conventional MRI macrostructural volumetry In this work, we present a framework to fuse and quantify tissue microstructural attributes (e.g. diffusion, functional, relaxation and perfusion MRI) using high spatial resolution T1-weighted volumetric measurements. The proposed computational procedures can be implemented by utilizing advanced, image segmentation, registration and diffusion tensor image processing software. Feasibility of the framework is also demonstrated using in-house developed software and freely available software such as FreeSurfer for regional tissue segmentation, Advanced Normalization Tools (ANTs) for registration and DTIStudio for fiber tracking and diffusion tensor data processing. We also demonstrate the application of these methods in the provision of quality control measures to assess the fidelity of tissue segmentation and multi-modal MRI registration.

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

freesurfer
conventional mri
relaxation
segmentation
registration
ants
quality control

diffusion tensor imaging
dti
cmri
fsl
fnirt
brain atlas


Memetic Algorithm based on Improved Inverover operator and LinKernighan local search for the Euclidean traveling salesman problem In this study, an Improved Inverover operator is proposed to solve the Euclidean traveling salesman problem (TSP) problem. The Improved Inverover operator is tested on 14 different TSP examples selected from TSPLIB. The application of the Improved Inverover operator gives much more effective results regarding to the best and average error values than the Basic Inverover operator. Then an effective Memetic Algorithm based on Improved Inverover operator and LinKernighan local search is implemented. To speed up the convergence capability of the presented algorithm, a restart technique is employed. We evaluate the proposed algorithm based on standard TSP test problems and show that the proposed algorithm performs better than other Memetic Algorithm in terms of solution quality and computational effort.

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

euclidean traveling salesman problem
inverover operator
linkernighan local search
memetic algorithm


Automation of bridge deck graphical representations based on a shape geometric model The construction of a new bridge interferes with the existent environment. A careful aesthetic study must be made at an early stage in the design and the visualisation of a three-dimensional (3D) model of the structure is the best way to analyse it. As the bridges deck presents a complex shape it is difficult to execute a 3D deck model as well as the specific drawings or a 3D finite elements mesh of the deck. The modelling scheme proposed here allows the automation of the geometric design phases related to the deck element using as a means of integration a geometric database representative of the real deck shape. This concept was implemented in a computer programme. This application is an important support in a bridge design namely at the conceptual, analytical and final stages.

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

automation and integration in bridge design


dynamic scan-converted images with a frame buffer display device A color interactive display system which produces images of three-dimensional polygons and labels on a frame buffer display device is being developed. The entire image is scan converted and written into the frame buffer whenever it is modified. Since an entire image cannot be written into the frame buffer faster than 4.6 frames per second for the particular device chosen, an illusion of continuous motion cannot be supported. However, a rate of 3 frames per second has been found sufficient to provide feedback to continuous user input. In order to achieve this frame rate for a reasonably complex picture, the display device has been microprogrammed to accept run length encoded data and text, and the instruction set of the computer has been extended by microprogramming special-purpose instructions which perform visible surface calculations. These microprograms currently can process a scene which consists of up to 170 polygons at 3 frames per second.

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

order color input scan motion user device dynamic instruction text process data image feedback surface

computation
imaging
buffers
raster displays
interaction
frame buffers
label
systems
visible surface algorithms
run length encoding
complexity
continuation
interactive computer graphics


A computing theory for collaborative and transparent decision making under time constraint In this paper, we present a computing theory on the accelerated critical point of selection of proper strategies between collaboration and competition and its mathematical analysis for collaborative and transparent decision making under time constraint, i.e., cost of time pressure, which decision makers face in negotiation. Web 2.0 provides a useful digital environment to support various time-stressed human behaviors for collaborative decision making. However, little research has examined the collaborative behavior under time constraint on the Internet in its designs and implementations on electronically supported decision making. Those systems are implemented in black boxes so that we need transparent designs of decision support systems to promote collaboration by time-stressed decision makers. The essential problem on collaborative decision making under time constraint is the discovery and evaluation on the critical point of selection of proper strategies between collaboration and competition. Most of the current decision support systems accept the half of maximum acceptable time for negotiation as a critical point, a priori, though that conventional point is often late for proper decision making. The proposed theory shows that a critical point is to be accelerated at the one-third of maximum acceptable time for negotiation. We have formulated the proposed computing theory based on mathematical formulation, and checked its feasibility in its applications to a case study. The proposed theory promotes collaborative and transparent decision making in consideration of the properties of stakes under time pressure by selecting the strategy of collaboration or competition at the much earlier stage.

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

computing theory
collaboration
decision making
time constraint
mathematical formulation


An integrated telepresence environment for collaboration in construction For construction projects involving transient virtual organisations' composed of non-collocated team-members, the adoption of concurrent engineering principles is seen as vital. An important aspect of concurrent engineering in construction is the need for an effective communications infrastructure between team members. Traditionally, such communication has been handled through person-to-person meetings. however the complexity of construction projects has grown and, as a result, reliance on new information and communications technologies is becoming increasingly necessary. Hence, within a concurrent engineering setting, there is the need for an integrated information and collaboration environment that will create a persistent space to support interaction between project personnel throughout all phases of construction projects. This joins initiative between the Massachusetts Institute of Technology (MIT), Loughborough University, British Telecommunications pie. (BT) and Kajima Corporation explores computer-supported mechanisms for enhancing distributed engineering collaboration. The goal of this paper is to develop a set of requirements, a system architecture and a system prototype to facilitate computer-supported collaboration among distributed reams. The prototype consists of a comprehensive working collaborative system built from the integration of complementary standalone applications. These applications are the CAIRO system, developed at the Massachusetts Institute of Technology and the Telepresence system developed by Loughborough University and BT.

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

collaborative environments
meeting environments


Approximate Sum-Capacity of the Y-Channel A network where three users want to establish multiple unicasts between each other via a relay is considered. This network is called the Y-channel and resembles an elemental ingredient of future wireless networks. The sum-capacity of this network is studied. A characterization of the sum-capacity within an additive gap of 2 bits, and a multiplicative gap of 4, for all values of channel gains and transmit powers is obtained. Contrary to similar setups where the cut-set bounds can be achieved within a constant gap, they cannot be achieved in our case, where they are dominated by our new genie-aided bounds. Furthermore, it is shown that a time-sharing strategy, in which at each time two users exchange information using coding strategies of the bidirectional relay channel, achieves the upper bounds to within a constant gap. This result is further extended to the K-user case, where it is shown that the same scheme achieves the sum-capacity within 2 log (K - 1) bits.

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

functional decode-and-forward (fdf)
multiway relaying
sum-capacity


Lexical and syntactic structures in a connectionist model of reading multi-digit numbers A connectionist model of reading aloud multi-digit numbers is proposed. Unlike earlier models, a model that has no prior knowledge is trained on this task; it is found that the model develops both a lexical route and a route that implements (syntactic) rules. Lesion studies of the model show that it can exhibit the double dissociation between patients, with either lexical or syntactical problems in number naming. Results are discussed in terms of the rules-versus-connections debate in cognitive science.

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

multi-digit number reading
recurrent connectionist models


Tunnel Surrounding Rock Displacement Prediction Using Support Vector Machine Multi-step-ahead prediction of tunnel surrounding rock displacement is an effective way to ensure the safe and economical construction of tunnels. This paper presents a multi-step-ahead prediction model, which is based on support vector machine (SVM), for tunnel surrounding rock displacement prediction. To improve the training efficiency of SVM, shuffled complex evolution algorithm (SCE-UA) is also performed through some exponential transformation. The data from the Chijiangchong tunnel are used to examine the performance of the prediction model. Results show that SVM is generally better than artificial neural network (ANN). This indicates that SVM is a feasible and effective multi-step method for tunnel surrounding rock displacement prediction.

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

prediction
tunnel
surrounding rock displacement
svm


Experimental study of a self-tuning algorithm for DBMS buffer pools The tasks of configuring and tuning large database management systems (DBMSs) have always been both complex and time-consuming. They require knowledge of the characteristics of the system, the data, and the workload, and of the interrelationships between them. The increasing diversity of the data and the workloads handled by today systems is making manual tuning by database administrators almost impossible. Self-tuning DBMSs, which dynamically reallocate resources in response to changes in their workload in order to maintain predefined levels of performance, are one approach to handling the tuning problem. In this paper, we apply self-tuning technology to managing the buffer pools, which are a key resource in a DBIVE. Tuning the size of the buffer pools to a workload is crucial to achieving good performance. We describe a Buffer Pool Tuning Wizard that can be used by database administrators to determine effective buffer pool sizes. The wizard is based on a self-tuning algorithm called the Dynamic Reconfiguration algorithm (DRF), which uses the principle of goal-oriented resource management. It is an iterative algorithm that uses greedy heuristics to find a reallocation that benefits a target transaction class. We define and motivate the cost estimate equations used in the algorithm. Represent the results of a set of experiments to investigate the performance of the algorithm.

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

buffer management
database systems performance
self-tuning database management systems


An on-line performance visualization technology A new software technology for on-line performance analysis and the visualization of complex parallel and distributed systems is presented. Often heterogeneous, these systems need capabilities for the flexible integration and configuration of performance analysis and visualization. Our technology is based on an object-oriented framework for the rapid prototyping and development of distributable visual objects. The visual objects consist of two levels, a platform/device-specific low level and an analysis- and visualization-specific high level. We have developed a very high-level markup language called VOML and a compiler for the component-based development of high-level visual objects. The VOML is based on a software architecture for on-line event processing and performance visualization called EPIRA. The technology lends itself to constructing high-level visual objects from globally distributed component definitions. Details of the technology and tools used, as well as how an example visual object can be rapidly prototyped from several reusable components, are presented. Copyright (C) 2003 John Wiley Sons, Ltd.

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

markup language
performance analysis
performance visualization


Analysis and evaluation of the establishment and maintenance of paths in a MANET used for industrial process monitoring We model a complete mobile ad hoc network with stochastic activity networks. We obtain the exact route after the requesting of information. We study the effect of mobility on the maintenance and recovering of the route. We evaluate if the services offered in an industrial environment are affected.

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

san (stochastic activity networks)
modeling
routing protocols
route maintenance
path average lifetime


Location consistency - A new memory model and cache consistency protocol Existing memory models and cache consistency protocols assume the memory coherence property which requires that all processors observe the same ordering of write operations to the same location. In this paper. we address the problem of defining a memory model that does not rely on the memory coherence assumption and also the problem of designing a cache consistency protocol based on such a memory model. We define a new memory consistency model, called Location consistency (LC), in which the state of a memory location is modeled as a partially ordered multiset (pomset) of write and synchronization operations. We prove that LC is strictly weaker than existing memory models, but is still equivalent to stronger models for the common case of parallel programs that have no data races. We also describe a new multiprocessor cache consistency protocol based on the LC memory model. We prove that this LC protocol obeys the LC memory model. The LC protocol does not need to enforce single write ownership of memory blocks. As a result, the LC protocol is simpler and more scalable than existing snooping and directory-based cache consistency protocols.

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

memory consistency
location consistency
cache consistency protocols


Unconstrained detection of respiration rhythm and pulse rate with one under-pillow sensor during sleep A completely non-invasive and unconstrained method is proposed to detect respiration rhythm and pulse rate during sleep. By employing wavelet transformation (WT), waveforms corresponding to the respiration rhythm and pulse rate can be extracted from a pulsatile pressure signal acquired by a pressure sensor under a pillow. The respiration rhythm was obtained by an upward zero-crossing point detection algorithm from the respiration-related waveform reconstructed from the WT 26 scale approximation, and the pulse rate was estimated by a peak point detection algorithm from the pulse-related waveform reconstructed from the WT 24 and 225 scale details. The finger photo-electric plethysmogram (FPP) and nasal thermistor signals were recorded simultaneously as reference signals. The reference pulse rate and respiration rhythm were detected with the peak and upward zero-crossing point detection algorithm. This method was verified using about 24 h of data collected from 13 healthy subjects. The results showed that, compared with the reference data, the average error rates were 3.03% false negative and 1.47% false positive for pulse rate detection in the extracted pulse waveform. Similarly, 4.58% false negative and 3.07% false positive were obtained for respiration rhythm detection in the extracted respiration waveform. This study suggests that the proposed method is suitable, in sleep monitoring, for the diagnosis of sleep apnoea or sudden death syndrome.

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

respiration rhythm
pulse rate
wavelet transformation
sleep


Collaborative digital government in Mexico: Some lessons from federal Web-based interorganizational information integration initiatives The use of information and communication technologies in government has been characterized as one powerful strategy for administrative reform. From recent experiences around the world, it seems clear that in order to enjoy some of the greatest benefits of digital government, the integration of information across organizational boundaries is necessary. However, these digital government initiatives face additional challenges, since the required level of interorganizational collaboration and trust is often not supported by existing institutional arrangements, organizational structures, and managerial processes. In fact, many institutions and administrative structures found in government contexts offer incentives for single-agency work only, which produces stove-pipe systems. Based on an extensive case study in the Mexican federal government, this paper explores how certain institutional arrangements and organizational structures can enable or hinder cross-agency collaboration and consequently, interorganizational information integration.

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

digital government
collaboration
interorganizational
institutional arrangements

e-government
project evaluation
technology enactment


Time to stop researching the important things? From 2010 government funding for UK research will be based partly on metrics. One of the key metrics will be citations, with research income and postgraduate student numbers also assessed. While citation metrics seem sensible, there is a serious issue of what topics one researches, the methods used and the way in which a move to the use of citations will induce a change in research behaviour - especially a move to the dull middle ground. This paper investigates the potential impact of such a move on niche areas of IS research - here research on small- and medium-sized enterprises. However, the arguments hold for any new, emerging, or non-mainstream research area. The impacts of citation metrics on publication outlets and research method choice are assessed.

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


A mixed integer nonlinear programming model and heuristic solutions for location, inventory and pricing decisions in a closed loop supply chain Facility location, inventory and pricing decisions in a closed loop supply chain. Mixed integer nonlinear programming models. Effective heuristics for the solution of the model. The heuristics give less than 5% error from an upper bound.

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

facility location
pricing
inventory
mixed integer nonlinear programming
heuristics