Heuristics for planning with penalties and rewards formulated in logic and computed through circuits The automatic derivation of heuristic functions for guiding the search for plans is a fundamental technique in planning. The type of heuristics that have been considered so far, however, deal only with simple planning models where costs are associated with actions but not with states. In this work we address this limitation by formulating a more expressive planning model and a corresponding heuristic where preferences in the form of penalties and rewards are associated with fluents as well. The heuristic, that is a generalization of the well-known delete-relaxation heuristic, is admissible, informative, but intractable. Exploiting a correspondence between heuristics and preferred models, and a property of formulas compiled in d-DNNF, we show however that if a suitable relaxation of the domain, expressed as the strong completion of a logic program with no time indices or horizon is compiled into d-DNNF, the heuristic can be computed for any search state in time that is linear in the size of the compiled representation. This representation defines an evaluation network or circuit that maps states into heuristic values in linear-time. While this circuit may have exponential size in the worst case, as for OBDDs, this is not necessarily so. We report empirical results, discuss the application of the framework in settings where there are no goals but just preferences, and illustrate the versatility of the account by developing a new heuristic that overcomes limitations of delete-based relaxations through the use of valid but implicit plan constraints. In particular, for the Traveling Salesman Problem, the new heuristic captures the exact cost while the delete-relaxation heuristic, which is also exponential in the worst case, captures only the Minimum Spanning Tree lower bound. (c) 2008 Elsevier B.V. All rights reserved.

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

planning heuristics
planning with rewards
knowledge compilation


Semantische Technologien fr Produktionsprozessinnovationen in der Landwirtschaft Um die Effizienz von Produktionsprozessen stndig zu verbessern, mssen landwirtschaftliche Betriebe heutzutage befhigt sein, neuartige Gerte sowie Verfahren kontinuierlich, flexibel und in kurzer Zeit in das existierende System zu integrieren. Die Semantischen und Web-Service-Technologien bieten die notwendige Flexibilitt zur Gestaltung der Produktionsprozesse und deren Optimierung in Bezug auf Ressourcenschonung etc. Am Beispiel der semantischen Diagnose, welche heterogene Sensorinformationen nutzt, zeigt dieser Beitrag, wie semantische Technologien im Rahmen der praktischen Anwendung Milchwirtschaft nutzbringend zum Einsatz gebracht werden knnen.

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

prozessoptimierung
semantische web services
plug und play
ontologie
production optimization
semantic web services
plug and play
ontology
dairy farming


Two new four-error-correcting binary codes Two four-error-correcting binary codes of length 21 and 22 and of cardinality 64 and 80, respectively, are constructed. The codes consist of a union of cosets of linear codes with dimension 3 and were found by a maximum clique 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

error-correcting code
maximum clique problem


Use of the Global Trigger Tool in patient safety improvement efforts: Nordic experiences The Global Trigger Tool (GTT) developed by the Institute for Healthcare Improvement is a method for retrospective patient record review based on the use of triggerssignals of potential adverse events that have caused patient harm. The method has the purpose of patient safety measurement and monitoring among adult inpatient populations and has been increasingly popular among Nordic countries. Use of the GTT in the Nordic area has been part of broader legal and policy actions and initiatives supportive of patient safety promotion and is being used to establish also national level estimates of patient safety incidents. Limitations of the method are its dependency on quality of documentation and the varying inter-rater reliability observed in many studies. Strengths of the GTT are its ability to detect larger numbers, as well as different types of adverse events when compared to other incident detection methods, hence it is a good addition to the palette of means for organizational patient safety monitoring. Research on reliability, usefulness and implementation approaches of the GTT, including its automation, is ongoing in the Nordic countries and is expected to generate useful input for the international patient safety community.

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

patient safety monitoring
global trigger tool
nordic countries


Probabilistic packet marking for large-scale IP traceback This paper presents an approach to IP traceback based on the probabilistic packet marking paradigm. Our approach, which we call randomize-and-link, uses large checksum cords to "link" message fragments in a way that is highly scalable, for the checksums serve both as associative addresses and data integrity verifiers. The main advantage of these checksum cords is that they spread the addresses of possible router messages across a spectrum that is too large for the attacker to easily create messages that collide with legitimate messages.

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

checksum cords
ip
probabilistic packet marking
traceback

associate addresses
distributed denial of service (ddos)


speeding up search in peer-to-peer networks with a multi-way tree structure Peer-to-Peer systems have recently become a popular means to share resources. Effective search is a critical requirement in such systems, and a number of distributed search structures have been proposed in the literature. Most of these structures provide "log time search" capability, where the logarithm is taken base 2. That is, in a system with N nodes, the cost of the search is O ( log 2 N ).In database systems, the importance of large fanout index structures has been well recognized. In P2P search too, the cost could be reduced considerably if this logarithm were taken to a larger base. In this paper, we propose a multi-way tree search structure, which reduces the cost of search to O ( log m N ), where m is the fanout. The penalty paid is a larger update cost, but we show how to keep this penalty to be no worse than linear in m . We experimentally explore this tradeoff between search and update cost as a function of m , and suggest how to find a good trade-off point.The multi-way tree structure we propose, BATON*, is derived from the BATON structure that has recently been suggested. In addition to multi-way fanout, BATON* also adds support for multi-attribute queries to BATON.

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

peer-to-peer
multi-way tree structure
system architecture


a targeted web crawling for building malicious javascript collection Malicious javascript frequently serves as a starting point of web-based attacks, in particular cross-site scripting. Thus detecting malicious javascript before execution can protect users from attacks such as malware infection, drive-by downloads, and even from participating in denial-of-service attacks as part of botnet sometimes. A large collection of malicious javascript would help with detector development, but by the time crawler arrives at blacklisted domains attackers and malicious scripts are often long gone. We have used classifiers to direct a web crawler better towards more likely locations of malicious scripts, and show how this targeted web crawler performs compared to crawler seed with blacklisted-domains.

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


Graph approach to the computation of the homology of continuous maps We introduce an efficient algorithm to compute the homomorphism induced in (relative) homology by a continous map. The algorithm is based on a cubical approximation of the map and the theory of multivalued maps. A software implementation of the algorithms introduced in this paper is available at [27].

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

computational homology
homology maps
cubical complexes


signal-path driven partition and placement for analog circuit This paper advances a new methodology based on signal-path information to resolve the problem of device-level placement for analog layout. This methodology is mainly based on three observations: thinking of hierarchical design for analog, structural feature of circuit based on signal-path, requirements of matching/symmetry constraint and the reduction of parasitics. The thinking of hierarchical design makes the whole analog circuit divided into core-circuit and bias-circuit. So, the algorithm is designed as two independent steps: core-circuit is placed firstly, and then bias-circuit. The structural feature of circuit based on signal-path and the requirement of matching/symmetry constraint decide the placement pattern of core-circuit. The reduction of parasitics requires the algorithm to select the optimal variants to realize the placement. Experimental results demonstrate that this algorithm can generate the compact layout with high performance and it is universal and effective.

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

analog placement
layout automation
device merging
circuit partition
symmetry constrain
signal-path


A model reduction method for biochemical reaction networks In this paper we propose a model reduction method for biochemical reaction networks governed by a variety of reversible and irreversible enzyme kinetic rate laws, including reversible Michaelis-Menten and Hill kinetics. The method proceeds by a stepwise reduction in the number of complexes, defined as the left and right-hand sides of the reactions in the network. It is based on the Kron reduction of the weighted Laplacian matrix, which describes the graph structure of the complexes and reactions in the network. It does not rely on prior knowledge of the dynamic behaviour of the network and hence can be automated, as we demonstrate. The reduced network has fewer complexes, reactions, variables and parameters as compared to the original network, and yet the behaviour of a preselected set of significant metabolites in the reduced network resembles that of the original network. Moreover the reduced network largely retains the structure and kinetics of the original model.

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

kinetic models
enzyme kinetics
complex graph
yeast glycolysis
rat liver beta oxidation


CALL and Web training with teacher self-empowerment: a departmental and long-term approach This paper examines the benefits of self-empowering, group in-service training (INSET). It incorporates evidence from several case studies. The training involves the teaching and practising of relevant skills, as a departmental group, in the evaluation, selection and use of various computer-assisted language learning (CALL) and Web materials. Prior assessment of the needs of individual teachers and those of the department as a whole inform subsequent targeting of the training content. These needs range from a self-confessed paucity of awareness of CALL materials among modern foreign language teachers to the effective use of multi-media authoring materials across the whole ability range. There is a description of a typical training session which reveals that there must be at least two facilitators offering expertise on the CALL materials being presented and practical teacher training experience of the challenges teachers face within the classroom. The benefits of a model which supports team work and an educative process, and which holds a balance between theoretical issues and practical hands-on experience, is shown to be effective. The paper concludes with an evaluation of this form of INSET and proposes recommendations for further development and dissemination. (C) 1998 Elsevier Science Ltd. All rights reserved.

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

foreign language teacher education
self-empowerment
software evaluation
integration
on-going skills upgrading


Salivary ?-Amylase in Biobehavioral Research In the history of science, technical advances often precede periods of rapid accumulation of knowledge. Within the past three decades, discoveries that enabled the noninvasive measurement of the psychobiology of stress (in saliva) have added new dimensions to the study of health and human development. This widespread enthusiasm has led to somewhat of a renaissance in behavioral science. At the cutting edge, the focus is on testing innovative theoretical models of individual differences in behavior as a function of multilevel biosocial processes in the context of everyday life. Several new studies have generated renewed interest in salivary ?-amylase (sAA) as a surrogate marker of the autonomic/sympathetic nervous system component of the psychobiology of stress. This article reviews sAA's properties and functions; presents illustrative findings relating sAA to stress and the physiology of stress, behavior, cognitive function, and health; and provides practical information regarding specimen collection and assay. The overarching intent is to accelerate the learning curve such that investigators avoid potential pitfalls associated with integrating this unique salivary analyte into the next generation of biobehavioral research

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

salivary alpha-amylase
behavior problems
cognition
social relationships
sympathetic nervous system


A survey of recursive analysis and Moores notion of real computation The theory of analog computation aims at modeling computational systems that evolve in a continuous space. Unlike the situation with the discrete setting there is no unified theory of analog computation. There are several proposed theories, some of them seem quite orthogonal. Some theories can be considered as generalizations of the Turing machine theory and classical recursion theory. Among such are recursive analysis and Moores class of recursive real functions. Recursive analysis was introduced by Turing (Proc Lond Math Soc 2(42):230265, 1936), Grzegorczyk (Fundam Math 42:168202, 1955), and Lacombe (Compt Rend lAcad Sci Paris 241:151153, 1955). Real computation in this context is viewed as effective (in the sense of Turing machine theory) convergence of sequences of rational numbers. In 1996 Moore introduced a function algebra that captures his notion of real computation; it consists of some basic functions and their closure under composition, integration and zero-finding. Though this class is inherently unphysical, much work have been directed at stratifying, restricting, and comparing it with other theories of real computation such as recursive analysis and the GPAC. In this article we give a detailed exposition of recursive analysis and Moores class and the relationships between them.

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

recursive analysis
turing machine
gpac
analog computation
function algebra


On effective slack management in postscheduling phase In this paper, we propose techniques for effective slack management in high-level synthesis. Our design methodology improves the usability of slack. This manifests itself in the form of relaxed latency constraints on resources. Relaxed latency constraints could be exploited to generate designs with better power, area, routability, and other measures. The slack-management engine has two key components: delay budgeting and resource binding. We propose a left edge traversal-based algorithm for delay budgeting. For resource binding, we developed an algorithm that applies a locally optimal binding procedure at each clock step. In order to demonstrate the effectiveness of our strategy, we built an experimental flow that integrated SUIF, Synopsys Design Compiler, Cadence Silicon Ensemble, and our own optimization tools. Experiments with theMediaBench suite shows that our methodology could generate designs with better quality than designs and faster design closure when compared with designs generated without slack management.

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


Three efficient numerical models to analyse the step problem in shallow water In this paper, the problem of acoustic wave propagation in a waveguide of infinite extent is modelled, taking into account constant depth in each section of the sea. Efficient numerical strategies in the frequency domain are addressed to investigate two-dimensional acoustic wave propagation in a shallow water configuration, considering a step in the rigid bottom and a flat free surface. The time domain responses are obtained by means of an inverse Fast Fourier Transform (FFT) of results computed in the frequency domain. The numerical approaches used here are based on the Boundary Element Method (BEM) and the Method of Fundamental Solutions (MFS). In the numerical models only the inclined or vertical interface between the sub-regions of different depth are discretized, as Green?s functions that take into account the presence of free and rigid surfaces are used. These Green?s functions are obtained either by eigenfunction expansion or by Ewald?s method. A detailed discussion on the performance of these formulations is carried out, with the aim of finding an efficient numerical formulation to solve the step problem in shallow water.

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

boundary element method
method of fundamental solutions
shallow water


Bounds

and

Constructions

of

Optimal

(n,

Optical

Orthogonal

Codes

In

this

paper,

a

tight

upper

bound

on

the

maximum

possible

code

size

of

(n,

and

some

direct

and

recursive

constructions

of

optimal

(n,

attaining

the

upper

bound

are

given.

As

consequences,

the

following

new

infinite

series

of

optimal

(gn,

are

obtained:

i)

g

is

an

element

of

{1,7,11,19,23,31,35,39,71,79,131,179,191,239,251,271,

or

g

is

a

prime

and

equivalent

to

(mod

and

n

p(r)

where

h

is

an

element

of

i

and

j

are

arbitrary

nonnegative

integers,

and

each

pi

is

a

prime

equivalent

to

(mod

ii)

g

where

g'

is

an

element

of

{1,7,11,19,23,31,47,71,127,151,167,191,263,271,311,359,367,383,431,439,463,479,503,631,647,719,727,

and

n

p(r)

where

each

p(i)

is

a

prime

equivalent

to

(mod

iii)

g

is

an

element

of

and

n

is

any

positive

integer

prime

to

iv)

g

and

n,

p(r)

where

each

p(i)

is

a

prime

equivalent

to

(mod

greater

than

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

optimal (n, k, lambda(a), lambda(c)) optical orthogonal code


Applications of TLS and related methods in the environmental sciences An overview of statistical and computational techniques used in the solution of environmental problems is presented. The applications presented involve: (1) ( 1 ) the fitting of Horton's infiltration curve using real data from field experiments performed in Surinam; (2) linear and nonlinear rainfallrunoff modeling using real data from watersheds in Louisiana and Belgium; (3) real-time monitoring and forecasting of a network of chemical sensors using real data from Fall Creek Reservoir in Indiana; (4) forecasting of hourly water consumption in Indiana; and (5) the exponential fitting of a sum of AM and FM tones used to model a chirp signal of a Coqu frog from Puerto Rico.

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

horton's infiltration curve
hydrograph separation
exponential data fitting
amfm signal modeling
singular value decomposition
canonical correlation analysis
rv-coefficient
total least squares
state-space models


Developing equilibrium optimization methods for hub location problems This paper develops three new equilibrium optimization models for \(p\)-hub center problem, in which the travel times are characterized by fuzzy random variables. The proposed equilibrium optimization methods are to find the locations of hub facilities and demand nodes so as to maximize equilibrium service levels of uncertain travel times. Under mild assumptions, we first handle equilibrium service levels and reduce them to their equivalent probability constraints. According to structural characteristics of equivalent stochastic programming models, we design a new parametric decomposition-based hybrid tabu search (PD-HTS) algorithm that incorporates parametric decomposition (PD), sample average approximation and tabu search algorithm. To demonstrate the effectiveness of designed solution method, we conduct some numerical experiments by using Australian Post data set and randomly generated data set. The comparison study shows that the PD-HTS algorithm exhibits better performance than the parametric decomposition-based hybrid genetic 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 B I O O O O O O O O O O O O O O B I O B I 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 O O O O

stochastic programming
parametric decomposition
sample average approximation
tabu search algorithm

hub location problem
equilibrium service level


Nonlinear model identification of a frictional contact support Accurate predictions of a structure dynamics require precise modeling of its boundary conditions including any nonlinear effects. This paper investigates the behavior of frictional supports that are examples of boundary conditions exhibiting nonlinear effects, such as stiction and slip phenomena, depending on the structure vibration amplitudes. The dependency of restoring forces in a frictional contact to the vibration amplitude level is identified in this study using experimental observations. In an experimental case study measured responses of a beam fixed at one end and frictionally supported at the other end were expanded using corresponding nonlinear normal modes of the structure and a reduced order model of the continuous system containing dominant nonlinear effects of the contact was obtained. The obtained discrete model constitutes bases for identification of restoring forces in the contact interface using force state mapping. The identified nonlinear restoring forces are then employed to specify parameters of a predictive contact model for the boundary support. The obtained contact model is capable of predicting damping and softening effects due to micro/macro-slippage and accurately regenerates the experimental results at various response levels.

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

frictional support
nonlinear normal mode


A characterization of definability of second-order generalized quantifiers with applications to non-definability We characterize the definability of second-order generalized quantifiers: Q1 Q 1 is definable in MSO(Q2,+) MSO ( Q 2 , + ) iff Q 1 ? is definable in FO ( Q 2 ? , + , ) . We use our characterization to proof new definability results, e.g.: The monadic second-order majority quantifier is non-definable in SO. We discuss consequences for the linguistic semantics of collective quantifiers.

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

second-order generalized quantifiers
second-order logic
collective quantification


Autoreactive T Cell Response in CD25-Negative Fraction of Peripheral Blood Mononuclear Cells in Established Type 1 Diabetes CD4+CD25+ T cells (Tregs) play a critical role in maintaining dominant peripheral tolerance, and pathogenic autoreactive T cells may be frequent in the CD25-negative fraction of peripheral blood mononuclear cells (PBMCs) from patients with autoimmune disease. We therefore investigated whether T cell autoimmune responses to recombinant GAD65 can be detected by the use of ELISPOT assay in the CD25-negative fraction of PMBCs from Japanese type 1 diabetes (T1D) patients. The frequency of CD4+CD25+ T cells was not different among patients with newly developed T1D, established T1D, and healthy controls. The CD25 positive celldepleted fraction was obtained by negative selection with antihuman CD25 magnetic beads, reducing the number of CD4+CD25+ T cells from 45% to less than 1%. In whole PBMC fraction, there was a significant elevation of IFN-? spots in PBMCs from recently diagnosed patients with T1D (P < 0.05), whereas the number of IFN-? spots from patients with established T1D was not significant. In the CD25-negative fraction, unlike whole PBMCs, we observed the significant IFN-? spots to GAD65 in the fraction from patients with established T1D (P < 0.05), but not in those with recently diagnosed disease. The phenomena were not observed for IL-4 spots. Our data suggest a possible role of Tregs maintaining dominant peripheral tolerance in T1D and application of further improved T cell assay detecting autoimmunity even in established T1D.

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

type 1 diabetes
elispot
autoreactive t cells


Analytic hierarchy process for multi-sensor data fusion based on belief function theory Development of a new approach to manage conflict and uncertainty of sensor readings represented with belief functions. A modified AHP method is proposed. Assessment of sensor reading weights based on multiple criteria using the AHP method. Combination of sensor readings according to their weights.

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

belief function theory
sensor reading weights

multiple criteria analysis
uncertainty measures
conflict measures


Interferometric SAR for characterization of ravines as a function of their density, depth, and surface cover In recent years, the problem of ravine erosion with consequent loss of usable land has received much attention worldwide. The Chambal ravine zone in India is well known for being an extremely intricate, deeply incised network of ravines in a 10 km wide zone on the flanks of the Chambal River. It occupies an area of ?0.5 million hectares at the expense of fertile agricultural land of the Chambal Valley. The broad grouping of the ravines considering their reclamation potential, as carried out by previous workers based on visual interpretation of optical remote sensing data, is mostly descriptive in nature. In the present study, characterization of the ravines as a function of their erosion potential expressed through ravine density, ravine depth, and ravine surface cover was made in quantitative terms exploiting the preferential characteristics of side-looking, long-wavelength, coherent SAR signal and precision measurements associated with the InSAR technique. The outlines of ravines appear remarkably prominent in SAR backscattered amplitude images due to the high sensitivity of the SAR signal to terrain ruggedness. Using local statistics-based meso and macro textural information of SAR backscattered amplitude images in 77 pixel windows (the pixel size being 20m20m), the ravine-affected area has been classified into three density classes, namely low, moderate, and high density ravine classes. C-band InSAR digital elevation models (DEMs) of sparsely vegetated ravine areas essentially give the terrain height. From the pixel-by-pixel terrain height, the ravine depth was calculated by differencing the maximum and minimum terrain heights of the pixels in a 100m distance range. Considering the vertical precision of the ERS InSAR DEMs of ?5m and ravine depth classification by previous workers [Sharma, H.S., 1968. Genesis and pattern of ravines of the Lower Chambal Valley, India. Special Issue. 21st International Geographical Union Congress 30(4), 1424; Seth, S.P., Bhatnagar, R.K., Chauhan, S.S., 1969. Reclamability classification and nature of ravines of Chambal Command Areas. Journal of Soil and Water Conservation in India 17 (34), 3944.], three depth classes, namely shallow ( 20m) ravines, were made. Using the temporal decorrelation property of the close time interval InSAR data pair, namely the ERS SAR tandem pair, four ravine surface cover classes, namely barren land, grass/scrub/crop land, sparse vegetation, and wet land/dense vegetation, could be delineated, which was corroborated by the spectral signatures in the optical range and selective ground truths.

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

ravines insar characterization chambal india


Use of graphics processing units for automatic synthesis of programs ? A new quantum-inspired linear genetic programming system that runs on the GPU. Allows the synthesis of solutions for large-scale real-world problems. Eliminates the overhead of copying the fitness results from the GPU to the CPU. Proposes a new selection mechanism to recognize the programs with best evaluations. Improves performance of the GP execution through exploiting the GPU environment.

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

gpu acceleration
machine code
quantum-inspired algorithms
massive parallelism


Treatment of Over-Saturated Protein Spots in Two-Dimensional Electrophoresis Gel Images The paper addresses the over-saturated protein spot detection and extraction problem in two-dimensional electrophoresis gel images. The effective technique for detection and reconstruction of over-saturated protein spots is proposed. The paper presents. an algorithm of the median filter mask adaptation for initial filtering of gel image, the models of over-saturation used for gel image analysis; several models of protein spots used for reconstruction, technique of the automatic over-saturated protein spot search and reconstruction. Experimental investigation confirms that proposed search technique lets to find up to 96% of over-saturated protein spots Moreover the proposed flexible protein spot shape models for reconstruction are faster and more accurate in comparison to the flexible diffusion model.

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

two-dimensional electrophoresis
image processing
image reconstruction
modelling


The therapist user interface of a virtual reality exposure therapy system in the treatment of fear of flying The use of virtual reality (VR) technology to support the treatment of patients with phobia, such as the fear of flying, is getting considerable research attention. Research mainly focuses on the patient experience and the effect of the treatment. In this paper, however, the focus is on the interaction therapists have with the system. Two studies are presented in which the therapist user interface is redesigned and evaluated. The first study was conducted in 2001 with the introduction of the system into the clinic. The original user interface design was compared with a redesign that was based on interviews with therapists. The results of a user study with five therapists and 11 students showed significant usability improvement. In 2008 a follow-up study was conducted on how therapists were now using the redesigned system. Using a direct observation approach six therapists were observed during a total of 14 sessions with patients. The analysis showed that: 93% of the exposures had similar patterns, therapists triggered 20 inappropriate sound recordings (e.g. the pilot giving height information while taking off), and more complex airplane simulation functions (e.g. roll control to make turns with the airplane) were only used by a therapist who was also a pilot. This resulted in a second redesign of the user interface, which allowed therapists to select flight scenarios (e.g. a flight with extra long taxiing, a flight with multiple taking off and landing sessions) instead of controlling the simulation manually. This new design was again evaluated with seven therapists. Again, results showed significant usability improvements. These findings led to five design guidelines with the main tenet in favour of a treatment-focused user interface (i.e. specific flying scenario) instead of a simulation-focused user interface (i.e. specific airplane controls). (C) 2010 Elsevier B.V. All rights reserved.

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

virtual reality
exposure therapy
fear of flying
design guidelines
user interface


On Supporting High-Quality 3D Geometry Multicasting over IEEE 802.11 Wireless Networks With significant improvements in both wireless technologies and computational capabilities of mobile devices, it is now possible to exchange and render 3D graphics over wireless networks on mobile devices such as PDAs and laptops. In this paper, we consider a typical scenario where users holding mobile devices of different display resolutions and rendering capabilities request the same 3D object in an IEEE 802.11 wireless LAN. Several schemes are proposed. First, to support high-quality 3D content multicasting, we analyze the characteristics of 3D data and choose the minimum data set for unicast in order to avoid excessive bandwidth consumption. Then, a transcoding algorithm is proposed to address the issue of multiuser diversity. In addition, to take advantage of the nature of broadcast in wireless medium and further mitigate the issue of serious resource usage due to large data size, we propose to broadcast certain less important refinement data. With the proposed hybrid unicast/broadcast transmission scheme and a packet overhearing mechanism, good scalability can be achieved. Finally, we schedule the unicast according to users' experienced link condition to handle user mobility. Simulation results show that the proposed schemes in combination can efficiently achieve the dual objectives of low transmission delay and small distortion.

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


Highly convergent simulations of transport dynamics in organic light-emitting diodes We present a method-of-lines solution procedure for modelling charge transport and recombination in organic light-emitting diodes operating in the trap-free space-charge-limited regime. The numerical procedure employs a spatial remeshing algorithm based on equidistribution principles as reported by Sanz-Serna and Christie (1986, J. Comput. Phys. 67, 348) and incorporates additional refinements proposed by Revilla (1986, Int. J. Numer Methods Eng. 23, 2263) and Saucez et al. (1996. J. Comput. Phys. 128, 274). The method, which does not give rise to ill-conditioned series of differential equations, offers rapid convergence to the steady state and is especially well suited to systems of equations displaying steep moving solution fronts. The technique is readily extended to more complex systems. (C) 2002 Elsevier Science (USA).

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

polymer
electroluminescence
simulation
drift
diffusion
method of lines
ppv


Complexity and spectral analysis of the heart rate variability dynamics for distant prediction of paroxysmal atrial fibrillation with artificial intelligence methods Paroxysmal atrial fibrillation (PAF) is a serious arrhythmia associated with morbidity and mortality. We explore the possibility of distant prediction of PAF by analyzing changes in heart rate variability (HRV) dynamics of non-PAF rhythms immediately before PAF event. We use that model for distant prognosis of PAF onset with artificial intelligence methods. We analyzed 30-min non-PAF HRV records from 51 subjects immediately before PAF onset and at least 45min distant from any PAF event. We used spectral and complexity analysis with sample (SmEn) and approximate (ApEn) entropies and their multiscale versions on extracted HRV data. We used that features to train the artificial neural networks (ANNs) and support vector machine (SVM) classifiers to differentiate the subjects. The trained classifiers were further tested for distant PAF event prognosis on 16 subjects from independent database on non-PAF rhythm lasting from 60 to 320min before PAF onset classifying the 30-min segments as distant or leading to PAF. We found statistically significant increase in 30-min non-PAF HRV recordings from 51 subjects in the VLF, LF, HF bands and total power (p<0.0001) before PAF event compared to PAF distant ones. The SmEn and ApEn analysis provided significant decrease in complexity (p<0.0001 and p<0.001) before PAF onset. For training ANN and SVM classifiers the data from 51 subjects were randomly split to training, validation and testing. ANN provided better results in terms of sensitivity (Se), specificity (Sp) and positive predictivity (Pp) compared to SVM which became biased towards positive case. The validation results of the ANN classifier we achieved: Se 76%, Sp 93%, Pp 94%. Testing ANN and SVM classifiers on 16 subjects with non-PAF HRV data preceding PAF events we obtained distant prediction of PAF onset with SVM classifier in 10 subjects (5818min in advance). ANN classifier provided distant prediction of PAF event in 13 subjects (6221min in advance). From the results of distant PAF prediction we conclude that ANN and SVM classifiers learned the changes in the HRV dynamics immediately before PAF event and successfully identified them during distant PAF prognosis on independent database. This confirms the reported in the literature results that corresponding changes in the HRV data occur about 60min before PAF onset and proves the possibility of distant PAF prediction with ANN and SVM methods.

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

paroxysmal atrial fibrillation
prediction
heart rate variability
complexity
artificial neural networks


Using absolute metric maps to close cycles in a topological map In simultaneous localisation and mapping (SLAM) the correspondence problem, specifically detecting cycles, is one of the most difficult challenges for an autonomous mobile robot. In this paper we show how significant cycles in a topological map can be identified with a companion absolute global metric map. A tight coupling of the basic unit of representation in the two maps is the key to the method. Each local space visited is represented, with its own frame of reference, as a node in the topological map. In the global absolute metric map these local space representations from the topological map are described within a single global frame of reference. The method exploits the overlap which occurs when duplicate representations are computed from different vantage points for the same local space. The representations need not be exactly aligned and can thus tolerate a limited amount of accumulated error. We show how false positive overlaps which are the result of a misaligned map, can be discounted.

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

cognitive mapping
absolute space representation
topological maps
global maps


3d module placement for congestion and power noise reduction 3D packaging via System-On-Package (SOP) is a viable alternative to System-On-Chip (SOC) to meet the rigorous requirements of today's mixed signal system integration. In this work, we propose a 3D module and decap (decoupling capacitance) placement algorithm that simultaneously reduces the power supply noise and wire congestion. We provide efficient algorithms for 3D power supply noise and congestion analysis to guide our 3D module placement process. In addition, we allocate white spaces around the modules that require decaps to suppress the power supply noise while minimizing the area overhead. In our experimentation, we achieve improvements in both decap amount and congestion with only small increase in area, wirelength, and runtime.

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

congestion
power noise reduction
3d module placement


positional mapping myanmar text input scheme for mobile devices Current Myanmar PC keyboards or key mappings are very difficult to learn for novice users, and there is no efficient key mapping for mobile device keypads. In this paper, we introduce a new idea of key mapping (Positional Mapping) for phonetic scripts such as Myanmar language. Positional Mapping is a key mapping idea, based on Myanmar language characters writing positions, for small computing devices such as mobile phones, PDAs and electronic dictionaries etc. Our approach has made key mapping for Myanmar language very simple and easier to memorize. The results of first evaluation show that first time users have no problem with this key mapping and they can type Myanmar text with appropriate typing speed. Positional Mapping can be extended to other phonetic scripts such as Khmer, Thai, Indic and Lao etc.

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

stylus-based input
user interfaces for mobile devices
soft-keyboard


Shipment partitioning and routing to minimize makespan in a transportation network This paper addresses the problem of partitioning and transporting a shipment of known size through an n-node public transportation network with known scheduled departure and arrival times and expected available capacities for each departure. The objective is to minimize the makespan of shipping. The problem while practical in its scope, has received very little attention in the literature perhaps because of the concentration of research in vehicle routing without regard to partitioning and partitioning without regard to routing. A general non-linear programming model is developed. The model is then converted into a linear model through the Routing First and Assignment Second approach. This approach is different from the general decomposition approaches since they normally do not guarantee optimality. However, the linear model still involves a large number of constraints, and solution is not attempted here. Instead, three heuristics are proposed for solving the problem. Two of the heuristics use iterative techniques to evaluate all possible paths. The third heuristic uses a max-flows approach based upon aggregated capacities to reduce the size of the network presented to the other heuristics. This allows for a good starting point for other heuristics, and may impact the total computational effort. We find that the heuristics developed perform well because in the case of networks that are not congested, they find the optimal solution. (c) 2005 Elsevier Ltd. All rights reserved.

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


Thermal image enhancement using bi-dimensional empirical mode decomposition in combination with relevance vector machine for rotating machinery fault diagnosis In this study, a novel fault diagnosis system for rotating machinery using thermal imaging is proposed. This system consists of bi-dimensional empirical mode decomposition (BEMD) for image enhancement, a generalized discriminant analysis (GDA) for feature reduction, and a relevance vector machine (RVM) for fault classification. Firstly, the thermal image obtained from machine conditions is decomposed into intrinsic mode functions (IMFs) by using BEMD. At each decomposed level, the IMF is expanded and fused with the residue by gray-scale transformation and principal component analysis fusion technique, respectively. The enhanced image is then formed by the improved IMFs in reconstruction process. Subsequently, feature extraction is applied for the enhanced images to obtain histogram features which characterize the thermal image and contain useful information for diagnosis. The high dimensionality of the achieved feature set can be reduced by GDA implementation. Moreover, GDA also assists in the increase of the feature cluster separation. Finally, the diagnostic results are performed by RVM. The proposed system is applied and validated with the thermal images of a fault simulator. A comparative study of the classification results obtained from RVM, support vector machines, and adaptive neuro-fuzzy inference system is also performed to appraise the accuracy of these models. The results show that the proposed diagnosis system is capable of improving the classification accuracy and efficiently assisting in rotating machinery fault diagnosis.

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

thermal image
rotating machinery fault diagnosis
generalized discriminant analysis


Maintaining bounded-size sample synopses of evolving datasets Perhaps the most flexible synopsis of a database is a uniform random sample of the data; such samples are widely used to speed up processing of analytic queries and data-mining tasks, enhance query optimization, and facilitate information integration. The ability to bound the maximum size of a sample can be very convenient from a system-design point of view, because the task of memory management is simplified, especially when many samples are maintained simultaneously. In this paper, we study methods for incrementally maintaining a bounded-size uniform random sample of the items in a dataset in the presence of an arbitrary sequence of insertions and deletions. For "stable" datasets whose size remains roughly constant over time, we provide a novel sampling scheme, called "random pairing" (RP), that maintains a bounded-size uniform sample by using newly inserted data items to compensate for previous deletions. The RP algorithm is the first extension of the 45-year-old reservoir sampling algorithm to handle deletions; RP reduces to the "passive" algorithm of Babcock et al. when the insertions and deletions correspond to a moving window over a data stream. Experiments show that, when dataset-size fluctuations over time are not too extreme, RP is the algorithm of choice with respect to speed and sample-size stability. For "growing" datasets, we consider algorithms for periodically resizing a bounded-size random sample upwards. We prove that any such algorithm cannot avoid accessing the base data, and provide a novel resizing algorithm that minimizes the time needed to increase the sample size. We also show how to merge uniform samples from disjoint datasets to obtain a uniform sample of the union of the datasets; the merged sample can be incrementally maintained. Our new RPMerge algorithm extends the HRMerge algorithm of Brown and Haas to effectively deal with deletions, thereby facilitating efficient parallel sampling.

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


designing for email response management Email is the most widely used form of computer-mediated communication. And replying to messages is one of the main activities email interfaces need to support. In this paper we address the problems users face when managing emails that need a reply. Previous work has found that users have difficulty remembering to reply to messages when they postpone response, and have trouble re- finding messages they want to respond to. We review related work on email management, and describe three designs developed to facilitate email response management.

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

computer-mediated communication
social messaging
design


Effect of heating location and size on mixed convection in lid-driven cavities A numerical study is performed to analyze the mixed convection heat transfer and fluid flow in lid-driven cavities with different lengths of the heating portion and different locations of it. The left wall has been heated fully or partially to a higher temperature, whereas the right wall is maintained at a lower temperature. Three different lengths of the heating portion and three different locations of it are used along the hot wall. The remaining portions of the left wall, and the top and the bottom walls of the cavity are insulated. The finite volume method is used to discretize the governing equations which are then solved iteratively. The velocities and pressure are coupled by the SIMPLE algorithm. Results are presented graphically in the form of streamlines, isotherms and velocity profiles. It is concluded that the heat transfer rate is enhanced on reducing the heating portion and when the portion is at middle or top of the hot wall of the cavity.

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

lid-driven cavity
partial heating
size of heating portion


Two coupled neural-networks-based solution of the Hamilton-Jacobi-Bellman equation This work is aimed at looking into the determination of optimal neuro-feedback control for discrete time nonlinear systems. The basic idea consists in the use of two coupled neural networks to approximate the solution of the Hamilton-Jacobi-Bellman equation (HJB) and to obtain a robust feedback closed-loop control law. The used learning algorithm is a modified version of the backpropagation one. As an illustration, a numerical nonlinear discrete time example is considered. Simulation results show the effectiveness of the proposed method. (C) 2010 Elsevier B. V. All rights reserved.

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

hamilton-jacobi-bellman (hjb) equation
neural networks (nn)
nonlinear discrete time systems


Performance comparison of trust-based reactive routing protocols Ad hoc networks, due to their improvised nature, are frequently established in insecure environments and hence become susceptible to attacks. These attacks are launched by participating malicious nodes against different network services. Routing protocols, which act as the binding force in these networks, are a common target of these nodes. A number of secure routing protocols have recently been proposed, which make use of cryptographic algorithms to secure the routes. However, in doing so, these protocols entail a number of prerequisites during both the network establishment and operation phases. In contrast, trust-based routing protocols locate trusted rather than secure routes in the network by observing the sincerity in participation by other nodes. These protocols thus permit rapid deployment along with a dynamically adaptive operation, which conforms with the current network situation. In this paper, we evaluate the performance of three trust-based reactive routing protocols in a network with varying number of malicious nodes. With the help of exhaustive simulations, we demonstrate that the performance of the three protocols varies significantly even under similar attack, traffic, and mobility conditions. However, each trust-based routing protocol has its own peculiar advantage making it suitable for application in a particular extemporized environment.

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


An application of Darbo's fixed point theorem in the investigation of periodicity of solutions of difference equations Using the technique of Darbo's fixed point theorem we investigate a nonlinear second order difference equation of the form Delta(r(n)Delta x(n)) = a(n)f(x(n+1)) where x: N-0 -> R, a, r: N-0 -> R and f: R -> R is a continuous function. Additionally, the Sturm-Liouville difference equation is considered as a special case of the above equation. Sufficient conditions for the existence of an asymptotically periodic solution of this equation are obtained. An example illustrates the result. Next, the conditions under (C) 2011 Elsevier Ltd. All rights reserved.

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

difference equation
asymptotically periodic solution

measures of noncompactness
darbo's fix point theorem
sturm-liouville equation


Insights into the folding pathway of the Engrailed Homeodomain protein using replica exchange molecular dynamics simulations Protein folding studies were carried out by performing microsecond time scale simulations on the ultrafast/fast folding protein Engrailed Homeodomain (EnHD) from Drosophila melanogaster. It is a three-helix bundle protein consisting of 54 residues (PDB ID: 1ENH). The positions of the helices are 820 (Helix I), 2636 (Helix II) and 4053 (Helix III). The second and third helices together form a Helix-Turn-Helix (HTH) motif which belongs to the family of DNA binding proteins. The molecular dynamics (MD) simulations were performed using replica exchange molecular dynamics (REMD). REMD is a method that involves simulating a protein at different temperatures and performing exchanges at regular time intervals. These exchanges were accepted or rejected based on the Metropolis criterion. REMD was performed using the AMBER FF03 force field with the generalised Born solvation model for the temperature range 286373K involving 30 replicas. The extended conformation of the protein was used as the starting structure. A simulation of 600ns per replica was performed resulting in an overall simulation time of 18?s. The protein was seen to fold close to the native state with backbone root mean square deviation (RMSD) of 3.16. In this low RMSD structure, the Helix I was partially formed with a backbone RMSD of 3.37 while HTH motif had an RMSD of 1.81. Analysis suggests that EnHD folds to its native structure via an intermediate in which the HTH motif is formed. The secondary structure development occurs first followed by tertiary packing. The results were in good agreement with the experimental findings.

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

protein folding
molecular dynamics simulations
remd
engrailed homeodomain


Circle-criterion Based Nonlinear Observer Design for Sensorless Induction Motor Control This paper deals with the design of a nonlinear observer for sensorless induction motor control. Based upon the circle criterion approach, a nonlinear observer is designed to estimate pertinent but unmeasurable state variables of the considered induction machine for sensorless control purpose. The observer gain matrices are computed as a solution of linear matrix inequalities (LMI) that ensure the stability conditions of the state observer error dynamics in the sense of Lyapunov concepts. Measured and estimated state variables can be exploited to perform a state feedback control of the machine system. The simulation results are presented to illustrate the effectiveness of the proposed approach for nonlinear observer design.

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

circle-criterion
lyapunov stability
linear matrix inequalties (lmi)


Mutation Hopfield neural network and its applications In this paper, a new operator is proposed to optimize the traditional Hopfield neural network (HNN). The key idea is to incorporate the global search capability of the Estimation of Distribution Algorithms (EDAs) into the HNN, which typically has a powerful local search capability and fast operation. On account of this property of the EDA, our proposed algorithm also exhibits a powerful global search capability. In addition, the possible infeasible solutions generated during the re-sampling period of the EDA are eliminated by the HNN. Therefore, the merits of both these methods are combined in a unified framework. The proposed model is tested on a numerical example, the max-cut problem. The new and optimized model yielded a better performance than certain traditional intelligent optimization methods, such as HNN, genetic algorithm (GA). The proposed mutation Hopfield neural network (MHNN) is also used to solve a practical problem, aircraft landing scheduling (ALS). Compared with first-come-first-served sequence, MHNN sequence reduces both total landing time and total delay.

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

mutation
hopfield neural network
aircraft landing scheduling


Business-to-business eCommerce of Information Systems: Two cases of ASP-to-SME eRental Enterprises today can "eRent" Information Systems (ISs), through the Internet, from Application Service Providers (ASPs). This emerging IS "eRental" concept is a special case of Business-to-Business eCommerce, where the product is an IS application and the business units engaged in commerce are an enterprise and an ASP. For small or medium-sized enterprises (SMEs), IS eRental might be an appealing solution to complex and costly IT acquisition and implementation. It is yet too-early to assess what the future holds for ASP and how far-reaching ASP implications could be for IS delivery and management in the future economy. It is possible however, to focus on and learn from ASP case studies. This paper briefly describes Net-POS and Silverbyte, two Israeli software vendors for the hospitality industry whose members, mostly SMEs, confront with great difficulty the high cost of owning, maintaining, and managing the state-of-the-art IS infrastructure required in the Internet era. These vendors have recently entered the ASP arena by adding an IS eRental option to their for-sale IS offerings. The case studies are followed by a discussion of the new ASP concept as Well as of possible directions for research on ASP-to-SME eRental.

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

small or medium-sized enterprises (smes)


Digital signature of multicast streams secure against adaptive chosen message attack We design a secure multicast stream signature scheme which can resist adaptive chosen message attack through splitting a multicast stream into a sequence of blocks. Firstly, we propose the definition of one-time block signature scheme and its construction based on one-time message signature scheme and hash tree. Secondly, we propose the definition of multicast stream signature scheme secure against adaptive chosen message attack and its construction based on traditional message signature scheme secure against adaptive chosen message attack and our one-time block signature scheme. Thirdly, we prove the securities of our one-time block signature scheme and multicast stream signature scheme. Finally, we analyze the performance of our multicast stream signature scheme. Our multicast stream signature scheme proposed in this paper is secure against adaptive chosen message attack and has the properties of low send delay, instant verification, efficient signing and verification, robustness to packet loss at the cost of slight per-packet authentication information.

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

multicast security
one-time signature
stream signature


On flow of a fourth-grade fluid with heat transfer The influence of heat transfer on the steady flow of a fourth-grade fluid between two stationary parallel porous plates is studied. The flow is engendered under the application of a constant pressure gradient. The concept of homotopy analysis method is utilized for the series solution of the governing problem. Numerical solution has been also carried out. In addition, both analytic and numerical solutions are compared. The variations of embedded parameters into the solution are predicted through the graphical representations. Copyright (C) 2010 John Wiley & Sons, Ltd.

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

fourth-grade fluid
homotopy analysis solution


making sense of accelerometer measurements in pervasive physical activity applications In the last few years, accelerometer-based entertainment and health applications have been receiving increased attention in the research and commercial worlds. The effect of accelerometer placement on different parts of the body, despite its apparent significance, received little consideration. This paper documents through experimentation the different characteristics of accelerometer output on the waist, arm, wrist, thigh, and ankle in the context of translational body motion (walk). Furthermore, it offers experimental formulas that transform peripheral body measurements to more reliable, center body (i.e., waist) measurements, and these in turn to caloric measurements, which are the standard physical activity units. The importance of these results on the design of ubiquitous health applications and the ensuing user experiences cannot be underestimated. The paper's methodology can be used in further studies in other physical activity contexts, where more elaborate body motion patterns are involved.

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

accelerometer placement
ubiquitous health applications


a performance analysis of pim, stream processing, and tiled processing on memory-intensive signal processing kernels Trends in microprocessors of increasing die size and clock speed and decreasing feature sizes have fueled rapidly increasing performance. However, the limited improvements in DRAM latency and bandwidth and diminishing returns of increasing superscalar ILP and cache sizes have led to the proposal of new microprocessor architectures that implement processor-in- memory, stream processing, and tiled processing. Each architecture is typically evaluated separately and compared to a baseline architecture. In this paper, we evaluate the performance of processors that implement these architectures on a common set of signal processing kernels.The implementation results are compared with the measured performance of a conventional system based on the PowerPC with Altivec. The results show that these new processors show significant improvements over conventional systems and that each architecture has its own strengths and weaknesses.

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

cache
systems
latency
microprocessor
architecture
size
performance
implementation
clock
bandwidth
paper
stream processing
feature
ilp
signal processing

processor
process
memorialized
kernel
performance analysis
evaluation


SiC power DIMOS with double implanted Al/B P-well Power 6H- and 4H-SiC DIMOS test structures have been fabricated using a new technology. P-well formation was optimised from simulation study and previous experiments on high-energy Al implantation. Reduction of Al presence at interface and reduced defect formation during implantation were the main objectives of this optimisation. Complementary surface implantation of boron was performed to adjust the interface (channel) doping. Power DIMOS were characterised at ambient temperature and up to 320C. 4H-SiC DIMOS exhibits very poor characteristics while 6H-SiC device functionality is maintained at 300C. Power DIMOS without complementary boron implantation also exhibits good performances up to 300C.

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

silicon carbide
power mosfet
high temperature


Estimation of global sensitivity indices for models with dependent variables A novel approach for estimation variance-based sensitivity indices for models with dependent variables is presented. Both the first order and total sensitivity indices are derived as generalizations of Sobol? sensitivity indices. Formulas and Monte Carlo numerical estimates similar to Sobol? formulas are derived. A copula-based approach is proposed for sampling from arbitrary multivariate probability distributions. A good agreement between analytical and numerical values of the first order and total indices for considered test cases is obtained. The behavior of sensitivity indices depends on the relative predominance of interactions and correlations. The method is shown to be efficient and general.

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

global sensitivity analysis
correlated inputs
gaussian copula
quasi monte carlo methods
sobol? sensitivity indices
sobol? sequences


Towards a monitoring smart home for the elderly: One experience in retrofitting a sensor network into an existing home There has been a lot of research interest in research smart homes for behaviour recognition and related tasks supporting the elderly living alone. Amongst the many challenges of such research are the selection of sensors and the secure storage of data. However, there are other important issues such as reliable data collection, acceptance of sensor systems into the inhabitant's life, and ensuring that the sensor system does not create hazards in the house. In this paper we report on our experiences retrofitting a set of wireless sensors into the house of an elderly person living alone and an exploration of some of the data integrity issues faced.

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

elderly monitoring
wireless sensor network


MCRA noise estimation for KLT-VRE-based speech enhancement A new signal subspace-based approach is proposed for the enhancement of speech corrupted by a high level of noise. Conventional subspace-based methods use the minimum mean square error criterion to optimize the Karhunen-Love Transform (KLT). In non-stationary noisy environments, the selection of the optimal order of the KLT-based speech enhancement model is a critical issue. Indeed, estimation of the relevant subspace dimensions depends on the environmental conditions that may change unpredictably. Therefore, a drastic KLT-based dimension reduction may induce the loss of relevant components of speech and conversely, a reconstruction using a higher order of the KLT model will be ineffective to remove the noise. The method presented in this paper uses a Variance of Reconstruction Error (VRE) criterion to optimally select the KLT order model. A prominent point of this subspace method is that it incorporates the Minima Controlled Recursive Averaging (MCRA) to estimate the noise Power Spectral Density (PSD) used in the gain function. Three variants of the VRE combined with MCRA methods are implemented and compared, namely the VRE-MCRA, VRE-MCRA2 and VRE-IMCRA. Objective measures show that VRE-based approaches achieve a lower signal distortion and a higher noise reduction than existing enhancement methods.

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

subspace speech enhancement
karhunen-love transform
variance of the reconstruction error
imcra
mcra2


Transition Skew Coding for global on-chip interconnect This paper presents new simulation results of the previously proposed Transition Skew Coding (TSC) for global on-chip interconnects. Considering 2-GHz global clock frequency at the 90-nm node, we show that TSC can be applied to broad range of wire length on both semiglobal and global metal layers, while maintaining its energy efficiency and its advantages in terms of crosstalk reduction and signal integrity, and wiring and repeater area minimization.

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


Second-order time evolution of P-N equations for radiation transport Using polynomials to represent the angular variation of the radiation intensity is usually referred to as the P-N or spherical harmonics method. For infinite order, the representation is an exact solution of the radiation transport solution. For finite N, in some physical situations there are oscillations in the solution that can make the radiation energy density be negative. For small N, the oscillations may be large enough to force the material temperature to numerically have non-physical negative values. The second-order time evolution algorithm presented here allows for more accurate solutions with larger time steps; however, it also can resolve the negativities that first-order time solutions smear out. Therefore, artificial scattering is studied to see how it can be used to decrease the oscillations in low-order solutions and prevent negativities. Small amounts of arbitrary, non-physical scattering can significantly improve the accuracy of the solution to test problems. Flux-limited diffusion solutions can also be improved by including artificial scattering. One- and two-dimensional test results are presented. (C) 2009 Elsevier Inc. All rights reserved.

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

p-n method
second order
radiation diffusion
flux-limited diffusion


State of Component Models Usage: Justifying the Need for a Component Model Selection Framework The presence of a large number of component models has caused some difficulties in selecting suitable component models to be used, either for research purpose or for software development purpose. Lack of framework or standard that can be used to guide the process of selecting suitable component models is believed to be one of the reasons that have caused the difficulties. Therefore, in this article, the need for a component model selection framework is justified. The selection framework can be applied by the software developers to help them determine suitable component models to be used in their software development projects. Possible contributions of the framework to the research and software development industry communities are also identified. These are achieved by examining the current state of component models usage in both research and software development industry communities, which are obtained from a number of related resources found from exhaustive literature search.

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

component model selection
selection framework

component model usage
component model survey
component model review
component model state


WEAK REGULARIZABILITY AND POLE ASSIGNMENT FOR NON-SQUARE LINEAR SYSTEMS The problem of pole assignment by state feedback in the class of non-square linear systems is considered in the paper. It is shown that the problem is solvable under the assumption of weak regularizability, a newly introduced concept that can be viewed as a generalization of the regularizability of square systems. Necessary conditions of solvability for the problem of pole assignment are established. It is also shown that sufficient conditions can be derived in some special cases. Some conclusions and prospects for further studies are drawn in the last section.

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


A comparative study of the sense of presence and anxiety in an invisible marker versus a marker augmented reality system for the treatment of phobia towards small animals Phobia towards small animals has been treated using exposure in vivo and virtual reality. Recently, augmented reality (AR) has also been presented as a suitable tool. The first AR system developed for this purpose used visible markers for tracking. In this first system, the presence of visible markers warns the user of the appearance of animals. To avoid this warning, this paper presents a second version in which the markers are invisible. First, the technical characteristics of a prototype are described. Second, a comparative study of the sense of presence and anxiety in a non-phobic population using the visible marker-tracking system and the invisible marker-tracking system is presented. Twenty-four participants used the two systems. The participants were asked to rate their anxiety level (from 0 to 10) at 8 different moments. Immediately after their experience, the participants were given the SUS questionnaire to assess their subjective sense of presence. The results indicate that the invisible marker-tracking system induces a similar or higher sense of presence than the visible marker-tracking system, and it also provokes a similar or higher level of anxiety in important steps for therapy. Moreover, 83.33% of the participants reported that they did not have the same sensations/surprise using the two systems, and they scored the advantage of using the invisible marker-tracking system (IMARS) at 5.192.25 (on a scale from 1 to 10). However, if only the group with higher fear levels is considered, 100% of the participants reported that they did not have the same sensations/surprise with the two systems, scoring the advantage of using IMARS at 6.381.60 (on a scale from 1 to 10).

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

augmented reality
phobia towards small animals


Fractional calculus A new approach to the analysis of generalized fourth-order diffusionwave equations The homotopy perturbation method is applied to the generalized fourth-order fractional diffusionwave equations. The problem is formulated in the Caputo sense. Moreover, a reliable scheme for calculating nonlinear operators is proposed. The results reveal that the present method is very effective and convenient.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 Neural Network Scheme for Long-Term Forecasting of Chaotic Time Series The accuracy of a model to forecast a time series diminishes as the prediction horizon increases, in particular when the prediction is carried out recursively. Such decay is faster when the model is built using data generated by highly dynamic or chaotic systems. This paper presents a topology and training scheme for a novel artificial neural network, named "Hybrid-connected Complex Neural Network" (HCNN), which is able to capture the dynamics embedded in chaotic time series and to predict long horizons of such series. HCNN is composed of small recurrent neural networks, inserted in a structure made of feed-forward and recurrent connections and trained in several stages using the algorithm back-propagation through time (BPTT). In experiments using a Mackey-Glass time series and an electrocardiogram (ECG) as training signals, HCNN was able to output stable chaotic signals, oscillating for periods as long as four times the size of the training signals. The largest local Lyapunov Exponent (LE) of predicted signals was positive (an evidence of chaos), and similar to the LE calculated over the training signals. The magnitudes of peaks in the ECG signal were not accurately predicted, but the predicted signal was similar to the ECG in the rest of its structure.

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

recurrent neural networks
chaotic time series

long-term prediction
hybrid-connected complex neural network
ecg modeling
mackey-glass equation


Ultralow-power adiabatic circuit semi-custom design This brief shows that a conventional semi-custom design-flow based on a positive feedback adiabatic logic (PFAL) cell library allows any VLSI designer to design and verify complex adiabatic systems (e.g., arithmetic units) in a short time and easy way, thus, enjoying the energy reduction benefits of adiabatic logic. A family of semi-custom PFAL carry lookahead adders and parallel multipliers were designed in a 0.6-mum CMOS technology and verified. Post-layout simulations show that semi-custom adiabatic arithmetic units can save energy a factor 17 at 10 MHz and about 7 at 100 MHz, as compared to,a logically equivalent static CMOS implementation. The energy saving obtained is also better if compared to other custom adiabatic circuit realizations and maintains high values (3 divided by 6) even when the losses in power-clock generation are considered.

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

computer arithmetic
dynamic-logic circuit
low-power design
low power dissipation
power-consumption model


Robust orthogonal matrix factorization for efficient subspace learning This paper considers a subspace learning problem in the presence of corruptions. The proposed method finds a robust solution using orthogonality and smoothness constraints. The proposed method can handle missing or unknown entries as well as outliers. The proposed method is extended to handle the rank uncertainty issue. We demonstrate that the proposed method is robust for various subspace learning problems.

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

low-rank matrix factorization
l1-norm
augmented lagrangian method
rank estimation


performance evaluation of joint downlink scheduling in multi-cellular ofdma systems based on ieee 802.16a The employment of the OFDMA transmission technique in broadband radio systems shows several benefits. Especially the exploitation of multi-user diversity with the help of sophisticated scheduling algorithms can significantly increase the system capacity. In this paper, the performance of joint scheduling of downlink data transmissions for access point sets is evaluated in a multi-cellular system. The latter is compared with an independent scheduling on orthogonal subchannel sets in the access points. The general MAC structure of the investigated system is thereby based on IEEE 802.16a. However, concerning the Physical Layer there is an important difference. In IEEE 802.16a, the exploitation of multi-user diversity is not possible since the OFDMA subchannel scheme is based on an interference and fading averaging approach. The technique examined in this paper in contrast can be regarded as an avoidance approach which is subject to diversity in the subchannel quality. A basic OFDMA scheduling algorithm, which is able to exploit multi-user diversity and provide fairness, is used both for the joint and for the independent scheme.

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

ieee 802.16a
multi user diversity
access point controller
resource partitioning
qos


Cochannel interference suppression through time/space diversity Wireless systems are subject to a time-varying and unknown a priori combination of cochannel interference, fading, and Gaussian noise. It is well known that multiple antennas can provide diversity in space that allows system tradeoffs between interference suppression and mitigation of fading, This paper describes how to achieve these same tradeoffs through diversity in time provided by channel coding, The mathematical description of time diversity. is identical to that of space diversity, and what emerges is a unified framework for signal processing. Decoding algorithms are provided for repetition codes, rate 1/n convolutional codes, first-order Reed-Muller codes, and a new class of Linear combination codes that provide cochannel interference suppression. In all cases it is possible to trade performance for complexity by choosing between joint estimation and a novel low-complexity linear canceler structure that treats interference as noise, This means that a single code can he used in a variety of system environments just by changing the processing in the receiver.

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

concatenated codes
decoders for non-gaussian noise
interference cancellation
smart antennas
wireless communication


Reactive power pricing structure for hydroelectric power station in condenser mode operation Reactive power support is critical for system security and pricing of reactive power is a vital issue in restructured environment. Peaking units at hydroelectric power plant in condenser mode operation can provide major reactive power support. Therefore costing structure for hydroelectric power plant incorporating various cost components in condenser mode operation is presented in this paper. Major cost components include capital cost component, changeover cost component and a cost component related to number of service hours in condenser mode operation. A methodology is proposed based on these components. A case study of Koyna Hydro Electric Power Plant (KHEPP) is elaborated.

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

capital cost
changeover cost
condenser mode operation

cost of service hours in condenser mode
reactive power payment


Strategic alignment and value maximization for IT project portfolios Managing project portfolios has been a challenge to many IT organizations due to the size and complexity of their initiatives that are often cross-functional, fast changing, and transformational in nature. A governance process on project solicitation, evaluation, and monitoring is thus essential to ensure the resulting portfolio creates tangible values, balances across priorities, and supports business objectives. An optimization model to streamline the decision processes for IT portfolios and programs is proposed. We consider project characteristics such as the extent of strategic alignment, expected benefit, development cost, and cross-project synergy to maximize the portfolio value. We also consider team proficiency and resource availability to determine a project portfolio that could be implemented within the overall development time. The multi-objective model identifies the optimal mix among project types and the solution procedure efficiently produces recommendations that are superior to those found with current empirical techniques. We also describe an evolutionary algorithm to find approximate solutions to the optimization model. Possible extensions on how the optimization procedure can go beyond projects to also streamline decisions such as the renewal or replacement of in-flight applications is discussed.

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

it project management
project portfolio management
project synergy
multi-objective optimization
evolutionary algorithms


An orchestration approach for unwanted Internet traffic identification A simple examination of Internet traffic shows a wide mix of relevant and unwanted traffic. The latter is becoming increasingly harmful to network performance and service availability, while often consuming precious network and processing resources. Coordinated attacks, such as distributed denial-of-services (DDoS), large-scale scans, and worm outbreaks, occur in multiple networks simultaneously and become extremely difficult to detect using an individual detection engine. This paper presents the specification of a new orchestration-based approach to detect, and, as far as possible, to limit the actions of these coordinated attacks. Core to the proposal is a framework that coordinates the receiving of a multitude of alerts and events from detectors, evaluates this input to detect or prove the existence of anomalies, and consequently chooses the best action course. This framework is named Orchestration-oriented Anomaly Detection System (OADS). We also describe an OADS prototype implementation of the proposed infrastructure and analyze initial results obtained through experimentation with this prototype.

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

alert correlation
frequent episodes discovery
dempstershafer theory