trading off computation for error in providing immersive voice communications for mobile gaming The interactive experiences of players in networked games can be enhanced with the provision of an Immersive Voice Communication Service. Game players are immersed in their voice communication experience as they exchange live voice streams which are rendered in real-time with directional and distance cues corresponding to the users' positions in the virtual game world. In particular, we propose a Mobile Immersive Communication Environment (MICE) which targets mobile game players using platforms such as Sony PSP and Nintendo DS. A computation reduction scheme was proposed in our previous work for the scalable delivery of MICE from a central server. On the basis of that computation reduction scheme, this paper identifies what factors, and to what extent, affect the unacceptable voice rendering error incurred when providing MICE. In the first experimental scenario, we investigate the level of unacceptable voice rendering error incurred in MICE for different avatar densities or avatar population sizes, with a fixed level of processing limit. In the second experimental scenario, we studied the level of unacceptable voice rendering error incurred in MICE for different processing resource limits, with a fixed avatar population size or avatar density. Our findings provide important insights into the planning and dimensioning of processing resources for the support of MICE, with due considerations to the impact on the unacceptable voice rendering error incurred.

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

immersive voice communications
mobile gaming

computation cost reduction
voice over ip (voip)


a scalable heuristic for evacuation planning in large road network Evacuation planning is of critical importance for civil authorities to prepare for natural disasters, but efficient evacuation planning in large city is computationally challenging due to the large number of evacuees and the huge size of transportation networks. One recently proposed algorithm Capacity Constrained Route Planner (CCRP) can give sub-optimal solution with good accuracy in less time and use less memory compared to previous approaches. However, it still can not scale to large networks. In this paper, we analyze the overhead of CCRP and come to a new heuristic CCRP++ that scalable to large network. Our algorithm can reuse search results in previous iterations and avoid the repetitive global shortest path expansion in CCRP. We conducted extensive experiments with real world road networks and different evacuation parameter settings. The result shows it can gives great speed-up without loosing the optimality.

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


Battery energy storage system for frequency support in microgrids and with enhanced control features for uninterruptible supply of local loads A battery energy storage system to support the frequency in autonomous microgrids. Original frequency controller to better damp the frequency oscillations. The frequency controller covers the main two control levels, namely primary and secondary. Enhanced control functions to ensure uninterruptible power supply to local sensitive loads. Simulations and experimental results validate the proposed control solution.

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

microgrid
frequency control
single-phase inverter


Extended Average Magnitude Difference Function Based Pitch Detection This paper presents a new extended average magnitude difference function for noise robust pitch detection. Average magnitude difference function based algorithms are suitable for real time operations, but suffer from incorrect pitch detection in noisy conditions. The proposed new extended average magnitude difference function involves in sufficient number of averaging for all lag values compared to the original average magnitude difference function, and thereby eliminates the falling tendency of the average magnitude difference function without emphasizing pitch harmonics at higher lags, which is a severe limitation of other existing improvements of the average magnitude difference function. A noise robust post processing that explores the contribution of each frequency channel is also presented. Experimental results on Keele pitch database in different noise level, both with white and color noise, shows the superiority of the proposed extended average magnitude difference function based pitch detection method over other methods based on average magnitude difference function.

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


multi-core demands multi-interfaces The challenge for the microarchitect has always been (with very few notable domain-specific exceptions) how to translate the continually increasing processing power provided by Moore's Law into increased performance, or more recently into similar performance at lower cost in energy. The mechanisms in the past (almost entirely) kept the interface intact and used the increase in transistor count to improve the performance of the microarchitecture of the uniprocessor. When that became too hard, we went to larger and larger on-chip caches. Both are consistent with the notion that "abstractions are good." At some point, we got overwhelmed with too many transistors; predictably, multi-core was born. As the transistor count continues to skyrocket, we are faced with two questions: what should be on the chip, and how should the software interface to it. If we expect to continue to take advantage of what process technology is providing, I think we need to do several things, starting with rethinking the notion of abstraction and providing multiple interfaces for the programmer.

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

multicore
software interface
performance


Decisions, decisions, decisions: transfer and specificity of decision-making skill between sports The concept of transfer of learning holds that previous practice or experience in one task or domain will enable successful performance in another related task or domain. In contrast, specificity of learning holds that previous practice or experience in one task or domain does not transfer to other related tasks or domains. The aim of the current study is to examine whether decision-making skill transfers between sports that share similar elements, or whether it is specific to a sport. Participants (n=205) completed a video-based temporal occlusion decision-making test in which they were required to decide on which action to execute across a series of 4 versus 4 soccer game situations. A sport engagement questionnaire was used to identify 106 soccer players, 43 other invasion sport players and 58 other sport players. Positive transfer of decision-making skill occurred between soccer and other invasion sports, which are related and have similar elements, but not from volleyball, supporting the concept of transfer of learning.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 processes
knowledge
skill acquisition
perceptualcognitive skill


an approach of creative application evolution on cloud computing platform Cloud computing is a paradigm that focuses on sharing data and computing resources over a scalable network of nodes, so it is becoming a preferred environment for those applications with large scalability, dynamic collaboration and elastic resource requirements. Creative computing is an emerging research field in these applications, which can be considered as the study of computer science and related technologies and how they are applied to support creativity, take part in creative processes, and solve creativity related problems. However, it is a very hard work to develop such applications from the very beginning under new environment, while it is a big waste for legacy systems under existing environment. Now software evolution plays an important role. In this paper, we introduced creative computing firstly, including definition, properties and requirements. Then the advantages of cloud computing platform for supporting creative computing were analysed. Next, a private cloud as experimental environment was built. Finally, the process of creative application evolution was illustrated. Our work is about research and application of software evolution methodology, also is an exploratory try to do creative computing research under cloud environment.

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

creative application
creative computing
software evolution
cloud computing


A sensitivity-based approach to analyzing signal delay uncertainty of coupled interconnects Performance optimization is a critical step in the design of integrated circuits. Rapid advances in very large scale integration (VLSI) technology have enabled shrinking feature sizes, wire widths, and wire spacings, making the effects of coupling capacitance more apparent. As signals switch faster, noise due to coupling between neighboring wires becomes more pronounced. Changing the relative signal arrival times (RSATs) alters the victim line delay due to the varying coupling noise on the victim line. The authors propose a sensitivity-based method to analyze delay uncertainties of coupled interconnects due to uncertain signal arrival times at its inputs. Compared to existing methods of analyzing delay uncertainties of coupled interconnects, the simulation results show that the proposed method strikes a good balance between model accuracy and complexity compared to the existing approaches.

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

coupled interconnects
signal arrival times

delay changes
sensitivity
statistical timing


Visual estimation of pointed targets for robot guidance via fusion of face pose and hand orientation ? Problem formulation: given a number of possible pointed targets, compute the target that the user points to. Estimate head pose by visually tracking the off-plane rotations of the face. Recognize two different hand pointing gestures (point left and point right). Model the problem using the DempsterShafer theory of evidence. Use Demspsters rule of combination to fuse information and derive the pointed target.

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

humanrobot interaction
computer vision
gesture recognition
head pose estimation


RTN distribution comparison for bulk, FDSOI and FinFETs devices In this paper we investigate the sensitivity of RTN noise spectra to statistical variability alone and in combination with variability in the traps properties, such as trap level and trap activation energy. By means of 3D statistical simulation, we demonstrate the latter to be mostly responsible for noise density spectra dispersion, due to its large impact on the RTN characteristic time. As a result FinFETs devices are shown to be slightly more sensitive to RTN than FDSOI devices. In comparison bulk MOSFETs are strongly disadvantaged by the statistical variability associated with high channel doping.

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

random telegraph noise
finfet
reliability


Learning similarity matching in multimedia content-based retrieval Many multimedia content-based retrieval systems allow query formulation with user setting of relative importance of features (e.g., color, texture, shape, etc) to mimic the user's perception of similarity. However, the systems do not modify their similarity matching functions, which are defined during the system development. In this paper, we present a neural network-based learning algorithm for adapting similarity matching function toward the user's query preference based on his/her relevance feedback. The relevance feedback is given as ranking errors (misranks) between the retrieved and desired lists of multimedia objects. The algorithm is demonstrated for facial image retrieval using the NIST Mugshot Identification Database with encouraging results.

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

image retrieval
learning
ranking
similarity matching
relevance feedback

content-based retrieval
multimedia databases


Self-organization of decentralized swarm agents based on modified particle swarm algorithm In this paper, an attempt has been made by incorporating some special features in the conventional particle swarm optimization (PSO) technique for decentralized swarm agents. The modified particle swarm algorithm ( MPSA) for the self-organization of decentralized swarm agents is proposed and studied. In the MPSA, the update rule of the best agent in swarm is based on a proportional control concept and the objective value of each agent is evaluated on-line. In this scheme, each agent self-organizes to flock to the best agent in swarm and migrate to a moving target while avoiding collision between the agent and the nearest obstacle/agent. To analyze the dynamics of the MPSA, stability analysis is carried out on the basis of the eigenvalue analysis for the time-varying discrete system. Moreover, a guideline about how to tune the MPSA's parameters is proposed. The simulation results have shown that the proposed scheme effectively constructs a self-organized swarm system in the capability of flocking and migration.

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

decentralized swarm systems
self-organization


Computing large deformation metric mappings via geodesic flows of diffeomorphisms This paper examine the Euler-Lagrange equations for the solution of the large deformation diffeomorphic metric mapping problem studied in Dupuis et al. (1998) and Trouve (1995) in which two images 10, 1, are given and connected via the diffeomorphic change of coordinates I-0 o phi(-1) = I, where p = 01 is the end point at t = 1 of curve phi(t), t is an element of [0, 1] satisfying (phi)over dot(t) = v(t)(phi(t)), t is an element of [0, 1] with phi(0) = id. The variational problem takes the form [GRAPHICS] where parallel tov(t)parallel to(V) is an appropriate Sobolev norm on the velocity field v(t)(.), and the second term enforces matching of the images with parallel to.parallel to(L2) representing the squared-error norm. In this paper we derive the Euler-Lagrange equations characterizing the minimizing vector fields vt(,) t is an element of [0, 1] assuming sufficient smoothness of the norm to guarantee existence of solutions in the space of diffeomorphisms. We describe the implementation of the Euler equations using semi-lagrangian method of computing particle flows and show the solutions for various examples. As well, we compute the metric distance on several anatomical configurations as measured by integral(0)(1) parallel tov(t)parallel to(v)dt on the geodesic shortest paths.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 anatomy
euler-lagrange equation
variational optimization
deformable template
metrics


ARVO-CL:

The

OpenCL

version

of

the

ARVO

package

An

efficient

tool

for

computing

the

accessible

surface

area

and

the

excluded

volume

of

proteins

via

analytical

equations

Introduction

of

Graphical

Processing

Units

(GPUs)

and

computing

using

GPUs

in

recent

years

opened

possibilities

for

simple

parallelization

of

programs.

In

this

update,

we

present

the

modernized

version

of

program

ARVO

[J.

Busa,

J.

Dzurina,

E.

Hayryan,

S.

Hayryan,

C-K.

Hu,

J.

Plavka,

I.

Pokorny,

J.

Skivanek,

M.-C.

Wu,

Comput.

Phys.

Comm.

The

whole

package

has

been

rewritten

in

the

C

language

and

parallelized

using

OpenCL.

Some

new

tricks

have

been

added

to

the

algorithm

in

order

to

save

memory

much

needed

for

efficient

usage

of

graphical

cards.

A

new

tool

called

was

added

for

conversion

of

pdb

files

into

files

suitable

for

work

with

the

C

and

OpenCL

version

of

ARVO.

New

version

program

summary

Program

title:

ARVO-CL

Catalog

identifier:

Program

summary

URL:

Program

obtainable

from:

CPC

Program

Library,

Queen's

University,

Belfast,

N.

Ireland

Licensing

provisions:

Standard

CPC

licence,

No.

of

lines

in

distributed

program,

including

test

data,

etc.:

No.

of

bytes

in

distributed

program,

including

test

data,

etc.:

Distribution

format:

tar.gz

Programming

language:

C.

OpenCL.

Computer:

PC

Pentium;

Operating

system:

All

OpenCL

capable

systems.

Has

the

code

been

vectorized

or

parallelized?:

Parallelized

using

GPUs.

A

serial

version

(non

GPU)

is

also

included

in

the

package.

Classification:

External

routines:

cl.hpp

Catalog

identifier

of

previous

version:

Journal

reference

of

previous

version:

Comput.

Phys.

Comm.

Does

the

new

version

supercede

the

previous

version?:

Yes

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

solvent accessible area
stereographic projection
opencl package


Three-Dimensional Near-Field MIMO Array Imaging Using Range Migration Techniques This paper presents a 3-D near-field imaging algorithm that is formulated for 2-D wideband multiple-input-multiple-output (MIMO) imaging array topology. The proposed MIMO range migration technique performs the image reconstruction procedure in the frequency-wavenumber domain. The algorithm is able to completely compensate the curvature of the wavefront in the near-field through a specifically defined interpolation process and provides extremely high computational efficiency by the application of the fast Fourier transform. The implementation aspects of the algorithm and the sampling criteria of a MIMO aperture are discussed. The image reconstruction performance and computational efficiency of the algorithm are demonstrated both with numerical simulations and measurements using 2-D MIMO arrays. Real-time 3-D near-field imaging can be achieved with a real-aperture array by applying the proposed MIMO range migration techniques.

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

multiple-input multiple-output (mimo)
near-field imaging
sparse array


Imprint lithography for flexible transparent plastic substrates A novel imprinting process has been developed for the use of resist pattern transfer on flexible transparent plastic substrates. The polymer resist was first spin-coated on the mold, which was treated with a release agent. After softbaking, the resist layer was attached to a plastic substrate coated with an adhesive. The patterns were completely transferred to the substrate after removing the mold. Using this method, we were able to obtain the desired patterns on the plastic substrate without heating the substrate, which could deform the substrate.

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


Efficient Routing of Subspace Skyline Queries over Highly Distributed Data Data generation increases at highly dynamic rates, making its storage, processing, and update costs at one central location excessive. The P2P paradigm emerges as a powerful model for organizing and searching large data repositories distributed over independent sources. Advanced query operators, such as skyline queries, are necessary in order to help users handle the huge amount of available data. A skyline query retrieves the set of nondominated data points in a multidimensional data set. Skyline query processing in P2P networks poses inherent challenges and demands nontraditional techniques, due to the distribution of content and the lack of global knowledge. Relying on a superpeer architecture, we propose a threshold-based algorithm, called SKYPEER and its variants, for efficient computation of skyline points in arbitrary subspaces, while reducing both computational time and volume of transmitted data. Furthermore, we address the problem of routing skyline queries over the superpeer network and we propose an efficient routing mechanism, namely SKYPEER(+), which further improves the performance by reducing the number of contacted superpeers. Finally, we provide an extensive experimental evaluation showing that our approach performs efficiently and provides a viable solution when a large degree of distribution is required.

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


Parallel processing in regional climatology: The parallel version of the "Karlsruhe Atmospheric Mesoscale Model" (KAMM) Simultaneously to improvements of computer performance and of availability of memory not only the resolution of meteorological models of atmospheric currents has been refined but also the accuracy of the necessary physical approximations has been improved more and more. Now full elastic models are developed which describe also sound waves, although sound processes are not supposed to be relevant for atmospheric flow phenomena. But the full set of the elastic Navier-Stokes equations has a quite simple structure in comparison to sound proved systems like "anelastically" approximated models, so that the corresponding numerical models can be implemented on parallel computer systems without too much efforts. This has been considered by the redesign of the "Karlsruhe Atmospheric Mesoscale Model" (KAMM) for parallel processing. The new full elastic version of this model is written in FORTRAN-90. The necessary communication operations are gathered into few functions of a communication library, which is designed for different computer architectures, for massive parallel systems, for parallel vector computers requiring long vectors, but also for mono processors. (C) 1999 Elsevier Science B.V. All rights reserved.

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

regional climatology
communication library
massive parallel systems
vector computers

navier-stokes equation
elastic model
benchmark


X-ray scattering processes and chemometrics for differentiating complex samples using conventional EDXRF equipment Mild variations in organic matrices, which are investigated in this work, are caused by alterations in X-ray Raman scattering. The multivariate approaches, principal component analysis (PCA) and hierarchical cluster analysis (HCA), are applied to visualize these effects. Conventional energy-dispersive X-ray fluorescence equipment is used, where organic compounds produce intense scattering of the X-ray source. X-ray Raman processes, before obtained only for solid samples using synchrotron radiation, are indirectly visualized here through PCA scores and HCA cluster analysis, since they alter the Compton and Rayleigh scattering. As a result, their influences can be seen in known sample characteristics, as those associated with gender and melanin in dog hairs, and the differentiation in coconut varieties. Chemometrics has shown that, despite their complexity, natural samples can be easily classified. (c) 2005 Elsevier B.V. All rights reserved.

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

principal component analysis (pca)
hierarchical cluster analysis (hca)
natural sample differentiation
x-ray raman scatter spectrometry (xrss)
complex organic mixtures


A Deterministic Time Algorithm for the Reeb Graph We present a deterministic algorithm to compute the Reeb graph of a PL real-valued function on a simplicial complex in time, where is the size of the 2-skeleton. The problem can be solved using dynamic graph connectivity. We obtain the running time by using offline graph connectivity which assumes that the deletion time of every arc inserted is known at the time of insertion. The algorithm is implemented and experimental results are given. In addition, we reduce the offline graph connectivity problem to computing the Reeb graph.

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


advances in pcb routing Due to rapid increases in printed circuit board (PCB) complexity and lack of research progresses in PCB routing algorithms over the years, routing has become a bottleneck in overall circuit board design time. Today, a high-end PCB typically takes significant tedious manual efforts to complete the wiring and this problem will only get worse for future generations of PCBs. In this talk, we present some of our recent research results on this problem.

O O B B O O O O O O O O B O O O O O O O B B B O O O B O O O O O O O O O O O O O B O O O O O O O O O O O O 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 Test of Two Models of Value Creation in Virtual Communities Does a firm get any extra value from investing resources in sponsoring its own virtual community above and beyond the value that could be created for the firm, indirectly, via customer-initiated communities? If so, what explains the extra value derived from a firm-sponsored virtual community and how might this understanding inform managers about appropriate strategies for leveraging virtual communities as part of a value-creating strategy for the firm? We test two models of virtual community to help shed light on the answers to these questions. We hypothesize that in customer-initiated virtual communities, three attributes of member-generated information (MGI) drive value, while in firm-sponsored virtual communities, a sponsoring firm's efforts, as well as MGI, drive value. Drawing on information search and processing theories, and developing new measures of three attributes of MGI (consensus, consistency, and distinctiveness), we surveyed 465 consumers across numerous communities. We find that value can emerge via both models, but that in a firm-sponsored model, a sponsor's efforts are more powerful than MGI and have a positive, direct effect on the trust-building process. Our results suggest a continuum of value creation whereby firms extract greater value as they migrate toward the firm-sponsored model.

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

attribution theory
co-creation
online communities
online trust
user-generated content


Performance optimization and modeling of blocked sparse kernels We present a method for automatically selecting optimal implementations of sparse matrix-vector operations. Our software "AcCELS" (Accelerated Compress-storage Elements for Linear Solvers) involves a setup phase that probes machine characteristics, and a run-time phase where stored characteristics are combined with a measure of the actual sparse matrix to find the optimal kernel implementation. We present a performance model that is shown to be accurate over a large range of matrices.

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

matrix-vector product
blocking
self-adaptivity


Parameter estimation of two-level nonlinear mixed effects models using first order conditional linearization and the EM algorithm Multi-level nonlinear mixed effects (ML-NLME) models have received a great deal of attention in recent years because of the flexibility they offer in handling the repeated-measures data arising from various disciplines. In this study, we propose both maximum likelihood and restricted maximum likelihood estimations of ML-NLME models with two-level random effects, using first order conditional expansion (FOCE) and the expectationmaximization (EM) algorithm. The FOCEEM algorithm was compared with the most popular Lindstrom and Bates (LB) method in terms of computational and statistical properties. Basal area growth series data measured from Chinese fir (Cunninghamia lanceolata) experimental stands and simulated data were used for evaluation. The FOCEEM and LB algorithms given the same parameter estimates and fit statistics for models that converged by both. However, FOCEEM converged for all the models, while LB did not, especially for the models in which two-level random effects are simultaneously considered in several base parameters to account for between-group variation. We recommend the use of FOCEEM in ML-NLME models, particularly when convergence is a concern in model selection.

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

cunninghamia lanceolata
first order conditional expansion
simulated data


Multi-scale modelling of sandwich structures using the Arlequin method Part I: Linear modelling The paper presents an Arlequin based multi-scale method for studying problems related to the mechanical behaviour of sandwich composite structures. Towards this end, different models are mixed and glued to each other. Several coupling operators are tested in order to assess the usefulness of the proposed approach. A new coupling operator is proposed and tested on the different glued Arlequin zones. A freeclamped sandwich beam with soft core undergoing a concentrated effort on the free edge is used as a typical example (benchmark) in the validation procedure. Numerical simulations were conducted as the preliminary evaluation of the various coupling operators and the discrepancies between local and global models in the gluing zone have been addressed with sufficient care.

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

multi-scale
local effects
finite element


DETERMINATES OF EIS ACCEPTANCE The large number of organizations developing executive information systems (EISs) highlights the importance of understanding why executives use these systems. This survey investigated how ease of use, the number of features, and support staff characteristics are related to EIS acceptance. Acceptance was measured by the percentage of the targeted users who incorporate the EIS into their daily routine. High usage was not associated with ease of use, a large number of features, or the staff being physically close to the users. However, rapid development time was positively correlated with acceptance. Higher numbers of available features were associated with larger support staffs and larger user groups. The number of users was positively correlated with both staff size and EIS age. Existing EISs place a stronger emphasis on reporting internal rather than external data.

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

information systems features
information systems support


SIFT-Based Non-blind Watermarking Robust to Non-linear Geometrical Distortions This paper presents a non-blind watermarking technique that is robust to non-linear geometric distortion attacks. This is one of the most challenging problems for copyright protection of digital content because it is difficult to estimate the distortion parameters for the embedded blocks. In our proposed scheme, the location of the blocks are recorded by the translation parameters from multiple Scale Invariant Feature Transform (SIFT) feature points. This method is based on two assumptions: SIFT features are robust to non-linear geometric distortion and even such non-linear distortion can be regarded as "linear" distortion in local regions. We conducted experiments using 149,800 images (7 standard images and 100 images downloaded from Flickr, 10 different messages, 10 different embedding block patterns, and 14 attacks). The results show that the watermark detection performance is drastically improved, while the baseline method can achieve only chance level accuracy.

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

scale invariant feature transform (sift)


zoom navigation exploring large information and application spaces We present the concept of ZOOM NAVIGATION, a new interaction paradigm to cope with visualization and navigation problems as found in large information and application spaces. It is based on the pluggable zoom , an object-oriented component derived from the variable zoom fisheye algorithm.Working with a limited screen space we apply a Degree-of-interest (DOI) function to guide the level of detail used in presenting information. Furthermore we determine the user's information and navigation needs by analysing the interaction history. This leads to the definition of the aspect-of-interest (AOI) function. The AOI is evaluated in order to choose one of the several information aspects , under which an item can be studied. This allows us to change navigational affordance and thereby enhance navigation.In this paper we describe the ideas behind the pluggable zoom and the definition of DOI and AOI functions. The application of these functions is demonstrated within two case studies, the ZOOM ILLUSTRATOR and the ZOOM NAVIGATOR. We discuss our experience with these implemented systems.

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

zooming interfaces
screen layout
information navigation
fisheye display
human-computer interfaces
detail + context technique


FITS: A Finite-Time Reputation System for Cooperation in Wireless Ad Hoc Networks A wireless ad hoc network does not have an infrastructure, and thus, needs the cooperation of nodes in forwarding other nodes' packets. Reputation system is an effective approach to give nodes incentives to cooperate in packet forwarding. However, existing reputation systems either lack rigorous analysis, or have analysis in unrealistic models. In this paper, we propose FITS, the first reputation system that has rigorous analysis and guaranteed incentive compatibility in a practical model. FITS has two schemes: the first scheme is very simple, but needs a Perceived Probability Assumption (PPA); the second scheme uses more sophisticated techniques to remove the need for PPA. We show that both of these two FITS schemes have a subgame perfect Nash equilibrium in which the packet forwarding probability of every node is one. Experimental results verify that FITS provides strong incentives for nodes to cooperate.

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

incentive compatibility
packet forwarding


Developing a verbal protocol method for collecting and analysing reports of workers thoughts during manual handling tasks Concurrent and retrospective verbal protocol methods were used to collect thoughts from 18 participants during a manual handling task involving the repeated transfer of loads between locations at two tables. The effectiveness of qualitative and quantitative methods of analysing the reported information was tested in the study. A simple taxonomy was developed to investigate the content of the reports (including reports on postures and loads) and determine how the participants approached the task (whether they made plans, described actions or evaluated their completion of the task). References to posture were obtained in the verbal protocol reports, indicating that the participants had some awareness of their postures during parts of the task. There were similarities in the content of the concurrent and retrospective reports, but there were differences in the amount of detail between the methods and differences in the way the reports were constructed. There could be some scope for developing the quantitative analysis of the frequencies of references to classes of information, though this can only be recommended for concurrent reports on tasks of short duration. The analyses of qualitative data gave a deeper insight into the reports, such as identifying factors that can be important when planning to handle a load, or illustrating how participants can change their focus of attention periodically throughout the task. The relative strengths of the concurrent and retrospective methods are described, along with ideas for improving the quality of information collected in future studies. A number of potential problems with the interpretation of the reported information are explained.

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

verbal protocol methods
manual handling tasks


Fast and flexible instruction selection with on-demand tree-parsing automata Tree parsing as supported by code generator generators like BEG, burg, iburg, lburg and ml-burg is a popular instruction selection method. There are two existing approaches for implementing tree parsing: dynamic programming, and tree-parsing automata; each approach has its advantages and disadvantages. We propose a new implementation approach that combines the advantages of both existing approaches: we start out with dynamic programming at compile time, but at every step we generate a state for a tree-parsing automaton, which is used the next time a tree matching the state is found, turning the instruction selector into a fast tree-parsing automaton. We have implemented this approach in the Gforth code generator. The implementation required little effort and reduced the startup time of Gforth by up to a factor of 2.5.

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

instruction selection
tree parsing
dynamic programming
automaton


challenges on preserving scientific data with data grids The emerging context of e-Science imposes new scenarios and requirements for digital preservation. In particular, the data must be reliably stored, for which redundancy is a key strategy. But managing redundancy must take into account the potential failure of component. Considering that correlated failures can affect multiple components and potentially cause a complete loss of data, we propose an innovative solution to manage redundancy strategies in heterogeneous environments such as data grids. This solution comprises a simulator that can be used to evaluate redundancy strategies according to preservation requirements and supports the process to design the best architecture to be deployed, which can latter be used as an observer of the deployed system, supporting its monitoring and management.

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

e-science
simulation
digital libraries
data grid


automated test order generation for software component integration testing The order in which software components are tested can have a significant impact on the number of stubs required during component integration testing. This paper presents an efficient approach that applies heuristics based on a given software component test dependency graph to automatically generate a test order that requires a (near) minimal number of test stubs. Thus, the approach reduces testing effort and cost. The paper describes the proposed approach, analyses its complexity and illustrates its use. Comparison with three well known graph-based approaches, for a real-world software application, shows that only the classic Le Traon et al.s approach and ours give an optimal number of stubs. However, experiments on randomly simulated dependency models with 100 to 10,000 components show that our approach has a significant performance advantage with a reduction in the average running time of 96.01\%.

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

heuristic algorithms
software testing
directed feedback vertex-set problem


Inhomogeneous and self-organized temperature in Schelling-Ising model The Schelling model of 1971 is a complicated version of a square-lattice Ising model at zero temperature, to explain urban segregation, based on the neighbor preferences of the residents, without external reasons. Various versions between Ising and Schelling models give about the same results. Inhomogeneous "temperatures" T do not change the results much, while a feedback between segregation and T leads to a self-organization of an average T.

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


An exploratory study of architectural effects on requirements decisions The question of the "manner in which an existing software architecture affects requirements decision-making" is considered important in the research community; however, to our knowledge, this issue has not been scientifically explored. We do not know, for example, the characteristics of such architectural effects. This paper describes an exploratory study on this question. Specific types of architectural effects on requirements decisions are identified, as are different aspects of the architecture together with the extent of their effects. This paper gives quantitative measures and qualitative interpretation of the findings. The understanding gained from this study has several implications in the areas of: project planning and risk management, requirements engineering (RE) and software architecture (SA) technology, architecture evolution, tighter integration of RE and SA processes, and middleware in architectures. Furthermore, we describe several new hypotheses that have emerged from this study, that provide grounds for future empirical work. This study involved six RE teams (of university students), whose task was to elicit new requirements for upgrading a pre-existing banking software infrastructure. The data collected was based on a new meta-model for requirements decisions, which is a bi-product of this study. (C) 2010 Elsevier Inc. All rights reserved.

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

software architecture
requirements engineering

architecture and requirements technology


A direction of arrival estimation method for spatial optical beam-forming network Spatial optical beam-forming network (OBFN) is a superior structure than traditional ones in bandwidth adaptability, system complexity, and so forth. Compared with conventional beam-forming network, the output signal model of OBFN is different, making the previous direction of arrival (DOA) estimation methods improper for this structure. At present, DOA estimation method for this structure has not been sufficiently explored and there is no efficient algorithm. In this paper, the observation model of the network is established first, and then a new DOA estimation method is proposed. The new method makes use of the amplitude distribution of the fiber array to achieve direction finding. Sufficient numerical simulations are carried out to demonstrate the feasibility and efficiency of the proposed 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 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 B I O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O

spatial optical beam-forming network
fourier transform


On central algorithms of approximation under fuzzy information We consider the problem of approximation of an operator by information described by n real characteristics in the case when this information is fuzzy. We develop the well-known idea of an optimal error method of approximation for this case. It is a method whose error is the infimum of the errors of all methods for a given problem characterized by fuzzy numbers in this case. We generalize the concept of central algorithms, which are always optimal error algorithms and in the crisp case are useful both in practice and in theory. In order to do this we define the centre of an L-fuzzy subset of a normed space. The introduced concepts allow us to describe optimal methods of approximation for linear problems using balanced fuzzy information. (C) 2005 Elsevier B.V. All rights reserved.

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

l-fuzzy number
central algorithm of approximation


Prediction of currents and sea surface elevation in the Gulf of California from tidal to seasonal scales ? A web tool that provides currents and/or sea surface elevation in the Gulf of California is presented. The above variables are reconstructed from harmonic constants obtained from harmonic analyses of time series produced by a 3D baroclinic numerical model of the Gulf. The numerical model was forced (1) at the Gulf's mouth by the tides and the hydrographic variability of the Pacific Ocean (at semiannual and annual frequencies), and (2) at the Gulf's surface by winds, heat and fresh water fluxes (also at the semiannual and annual frequencies). The response to these forcings results in motions with time scales limited to semidiurnal and diurnal, fortnightly and monthly (due to nonlinear interactions of the tidal components), and semiannual and annual frequencies (due to the nontidal forcing).

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

prediction
currents
gulf of california
tides


Surpassing the fractional derivative: Concept of the memory-dependent derivative Enlightened by the Caputo type of fractional derivative, here we bring forth a concept of memory-dependent derivative, which is simply defined in an integral form of a common derivative with a kernel function on a slipping interval. In case the time delay tends to zero it tends to the common derivative. High order derivatives also accord with the first order one. Comparatively, the form of kernel function for the fractional type is fixed, yet that of the memory-dependent type can be chosen freely according to the necessity of applications. So this kind of definition is better than the fractional one for reflecting the memory effect (instantaneous change rate depends on the past state). Its definition is more intuitionistic for understanding the physical meaning and the corresponding memory-dependent differential equation has more expressive force.

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

memory-dependent differential equation (mdde)


Deriving robust counterparts of nonlinear uncertain inequalities In this paper we provide a systematic way to construct the robust counterpart of a nonlinear uncertain inequality that is concave in the uncertain parameters. We use convex analysis (support functions, conjugate functions, Fenchel duality) and conic duality in order to convert the robust counterpart into an explicit and computationally tractable set of constraints. It turns out that to do so one has to calculate the support function of the uncertainty set and the concave conjugate of the nonlinear constraint function. Conveniently, these two computations are completely independent. This approach has several advantages. First, it provides an easy structured way to construct the robust counterpart both for linear and nonlinear inequalities. Second, it shows that for new classes of uncertainty regions and for new classes of nonlinear optimization problems tractable counterparts can be derived. We also study some cases where the inequality is nonconcave in the uncertain parameters.

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

fenchel duality
robust counterpart
support functions


On the weight distribution of terminated convolutional codes In this correspondence, the low-weight terms of the weight distribution of the block code obtained by terminating a convolutional code after x information blocks are expressed as a function of x. It is shown that this function is linear in x for codes with noncatastrophic encoders, but quadratic in x for codes with catastrophic encoders, These results are useful to explain the poor performance of convolutional codes with a catastrophic encoder at low-to-medium signal-to-noise ratios.

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

block codes
soft-decision decoding
viterbi decoding


Common data model for natural language processing based on two existing standard information models: CDA+GrAF An increasing need for collaboration and resources sharing in the Natural Language Processing (NLP) research and development community motivates efforts to create and share a common data model and a common terminology for all information annotated and extracted from clinical text. We have combined two existing standards: the HL7 Clinical Document Architecture (CDA), and the ISO Graph Annotation Format (GrAF; in development), to develop such a data model entitled CDA+GrAF. We experimented with several methods to combine these existing standards, and eventually selected a method wrapping separate CDA and GrAF parts in a common standoff annotation (i.e., separate from the annotated text) XML document. Two use cases, clinical document sections, and the 2010 i2b2/VA NLP Challenge (i.e., problems, tests, and treatments, with their assertions and relations), were used to create examples of such standoff annotation documents, and were successfully validated with the XML schemata provided with both standards. We developed a tool to automatically translate annotation documents from the 2010 i2b2/VA NLP Challenge format to GrAF, and automatically generated 50 annotation documents using this tool, all successfully validated. Finally, we adapted the XSL stylesheet provided with HL7 CDA to allow viewing annotation XML documents in a web browser, and plan to adapt existing tools for translating annotation documents between CDA+GrAF and the UIMA and GATE frameworks. This common data model may ease directly comparing NLP tools and applications, combining their output, transforming and translating annotations between different NLP applications, and eventually plug-and-play of different modules in NLP applications.

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

data model
hl7 clinical document architecture
iso graph annotation format

natural language processing (mesh l01.224.065.580)


Labelings and encoders with the uniform bit error property with applications to serially concatenated trellis codes The well-known uniform error property for signal constellations and codes is extended to encompass information bits. We introduce a class of binary labelings for signal constellations, called bit geometrically uniform (BGU) labelings, for which the uniform bit error property holds, i.e., the bit error probability does not depend on the transmitted signal. Strong connections between the symmetries of constellations and binary Hamming spaces are involved. For block-coded modulation (BCM) and trellis-coded modulation (TCM) Euclidean-space codes, BGU encoders are introduced and studied. The properties of BGU encoders prove quite useful for the analysis and design of codes aimed at minimizing the bit, rather than symbol, error probability. Applications to the analysis and the design of serially concatenated trellis codes are presented, together with a case study which realizes a spectral efficiency of 2 b/s/Hz.

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

constellations
trellis codes
uniform error property

coding
concatenated codes
encoding
labeling


Stochastic analysis of packet-pair probing for network bandwidth estimation In this paper, we perform a stochastic analysis of the packet-pair technique, which is a widely used method for estimating the network bandwidth in an end-to-end manner. There has been no explicit delay model of the packet-pair technique primarily because the stochastic behavior of a packet pair has not been fully understood. Our analysis is based on a novel insight that the transient analysis of the G/D/1 system can accurately describe the behavior of a packet pair, providing an explicit stochastic model. We first investigate a single-hop case and derive an analytical relationship between the input and the output probing gaps of a packet pair. Using this single-hop model, we provide a multi-hop model under an assumption of a single tight link. Our model shows the following two important features of the packet-pair technique: (i) The difference between the proposed model and the previous fluid model becomes significant when the input probing gap is around the characteristic value. (ii) The available bandwidth of any link after the tight link is not observable. We verify our model via ns-2 simulations and empirical results. We give a discussion on recent packet-pair models in relation to the proposed model and show that most of them can be regarded as special cases of the proposed model.

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


Development of a teleoperation system for agricultural vehicles A teleoperation system for a hydro-static transmission (HST) drive crawler-type robotic vehicle is described in this paper. The system was developed to satisfy the needs of various farm operations and teleoperation in unknown agricultural fields. The controller has a layered architecture and supports two degrees of cooperation between the operator and robot, direct and supervisory control. The vehicle can travel autonomously by using an RTK-GPS and a fiber-optic gyroscope during supervisory control, and the operator interface also provides a field navigator based on Google Map technology. The vehicle's position and heading direction was capable of 1Hz update using precise satellite image maps. The results of field tests using direct control showed that it is difficult for the operator to control the movement of the vehicle along the target lines. On the other hand, the vehicle could travel in a straight line with a maximum lateral error of 0.3m by using supervisory control.

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

agriculture
computer vision
autonomous mobile robot
communication


A general audio classifier based on human perception motivated model The audio channel conveys rich clues for content-based multimedia indexing. Interesting audio analysis includes, besides widely known speech recognition and speaker identification problems, speech/music segmentation, speaker gender detection, special effect recognition such as gun shots or car pursuit, and so on. All these problems can be considered as an audio classification problem which needs to generate a label from low audio signal analysis. While most audio analysis techniques in the literature are problem specific, we propose in this paper a general framework for audio classification. The proposed technique uses a perceptually motivated model of the human perception of audio classes in the sense that it makes a judicious use of certain psychophysical results and relies on a neural network for classification. In order to assess the effectiveness of the proposed approach, large experiments on several audio classification problems have been carried out, including speech/music discrimination in Radio/TV programs, gender recognition on a subset of the switchboard database, highlights detection in sports videos, and musical genre recognition. The classification accuracies of the proposed technique are comparable to those obtained by problem specific techniques while offering the basis of a general approach for audio classification.

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

audio classification
highlights detection

gender identification
music genre recognition
perceptually motivated features
content-based audio indexing
piecewise gaussian modelling


Stability routing with constrained path length for improved routability in dynamic MANETs Quality of service (QoS) routing is known to be an NP-hard problem in case of two or more additive constraints, and several exact algorithms and heuristics have been proposed to address this issue. In this paper, we consider a particular two-constrained quality of service routing problem maximizing path stability with a limited path length in the quest of improving routability in dynamic multi-hop mobile wireless ad hoc networks. First, we propose a novel exact algorithm to solve the optimal weight-constrained path problem. We instantiate our algorithm to solve the most stable path not exceeding a certain number of hops, in polynomial time. This algorithm is then applied to the practical case of proactive routing in dynamic multi-hop wireless ad hoc networks. In these networks, an adequate compromise between route stability and its length in hops is essential for appropriately mitigating the impact of the network dynamics on the validity of established routes. Secondly, we set up a common framework for the comparison between three families of proactive routing: the shortest path-based routing, the most stable path-based routing and our proposed most stable constrained path routing. We show then through extensive simulations that routing based on our proposed algorithm selects appropriate stable paths yielding a very high routability with an average path length just above that of the shortest paths.

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

constrained-based routing
stability constraint
np-hard problems
polynomial algorithms


SAR complex image data compression based on quadtree and zerotree Coding in Discrete Wavelet Transform Domain: A Comparative Study SAR complex image data compression based on wavelet-quadtree is proposed. QC-DWT has achieved the-state-of-the-art performance. QC-DWT has achieved higher performance compared with wavelet-zerotree.

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

quadtree
sar complex image data compression
zerotree


On the power of tree-walking automata ? Tree-walking automata (TWAs) recently received new attention in the fields of formal languages and databases. To achieve a better understanding of their expressiveness, we characterize them in terms of transitive closure logic formulas in normal form. It is conjectured by Engelfriet and Hoogeboom that TWAs cannot define all regular tree languages, or equivalently, all of monadic second-order logic. We prove this conjecture for a restricted, but powerful, class of TWAs. In particular, we show that 1-bounded TWAs, that is TWAs that are only allowed to traverse every edge of the input tree at most once in every direction, cannot define all regular languages. We then extend this result to a class of TWAs that can simulate first-order logic (FO) and is capable of expressing properties not definable in FO extended with regular path expressions; the latter logic being a valid abstraction of current query languages for XML and semistructured data.

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


authenticity by tagging and typing We propose a type and effect system for authentication protocols built upon a tagging scheme that formalizes the intended semantics of ciphertexts. The main result is that the validation of each component in isolation is provably sound and fully compositional : if all the protocol participants are independently validated, then the protocol as a whole guarantees authentication in the presence of Dolev-Yao intruders. The highly compositional nature of the analysis makes it suitable for multi-protocol systems, where different protocols might be executed concurrently.

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


The conformational behavior, geometry and energy parameters of Menshutkin-like reaction of O-isopropylidene-protected glycofuranoid mesylates in view of DFT calculations The reaction of three mesylates of furanoderivatives in pyridine is presented at the DFT. All the structures were fully optimized in the gas phase, in chloroform and water. The calculations revealed the barrier height increasing order as follows: 1>2>3. MPW1K/6-31+G** level activation barriers are higher than those from B3LYP/6-31+G**. The furanoid ring conformations are close to E0 or 0E.

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

conformation
nbo
quaternary ammonium salts


Translating update operations from relational to object-oriented databases In migrating a legacy relational database system to the object-oriented (OO) platform, when database migration completes, application modules are to be migrated, where embedded relational database operations are mapped into their OO correspondents. In this paper we study mapping relational update operations to their OO equivalents, which include UPDATE1, INSERT and DELETE operations. Relational update operation translation from relational to OO faces the touchy problem of transformation from a value-based relationship model to a reference-based model and maintaining the relational integrity constraints. Moreover, with a relational database where inheritance is expressed as attribute value subset relationship, changing of some attribute values may lead to the change of the position of an object in the class inheritance hierarchy, which we call object migration. Considering all these aspects, algorithms are given mapping relational UPDATE, INSERT and DELETE operations to their OO correspondents. Our work emphasize in examining the differences in the representation of the source schema's semantics resulting from the translation process, as well as differences in the inherent semantics of the two models.

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

relational model
object-oriented model
query translation
update translation


Secure threshold multi authority attribute based encryption without a central authority An attribute based encryption scheme (ABE) is a cryptographic primitive in which every user is identified by a set of attributes, and some function of these attributes is used to determine the ability to decrypt each ciphertext. Chase proposed the first multi authority ABE scheme which requires a fully trusted central authority who has the ability to decrypt each ciphertext in the system. This central authority would endanger the whole system if it is corrupted. This paper provides a threshold multi authority fuzzy identity based encryption (MA-FIBE) scheme without a central authority for the first time. An encrypter can encrypt a message such that a user could only decrypt if he has at least d(k) of the given attributes about the message for at least t + 1, t <= n/2 honest authorities of all the n attribute authorities in the proposed scheme. This paper considers a stronger adversary model in the sense that the corrupted authorities are allowed to distribute incorrect secret keys to the users. The security proof is based on the secrecy of the underlying distributed key generation protocol and joint zero secret sharing protocol and the standard decisional bilinear Diffie-Hellman assumption. The proposed MA-FIBE could be extended to the threshold multi authority attribute based encryption (MA-ABE) scheme, and both key policy based and ciphertext policy based MA-ABE schemes without a central authority are presented in this paper. Moreover, several other extensions, such as a proactive large universe MA-ABE scheme, are also provided in this paper. (C) 2010 Elsevier Inc. All rights reserved.

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


Segmentation According to Natural Examples: Learning Static Segmentation from Motion Segmentation The Segmentation According to Natural Examples (SANE) algorithm learns to segment objects in static images from video training data. SANE uses background subtraction to find the segmentation of moving objects in videos. This provides object segmentation information for each video frame. The collection of frames and segmentations forms a training set that SANE uses to learn the image and shape properties of the observed motion boundaries. When presented with new static images, the trained model infers segmentations similar to the observed motion segmentations. SANE is a general method for learning environment-specific segmentation models. Because it can automatically generate training data from video, it can adapt to a new environment and new objects with relative ease, an advantage over untrained segmentation methods or those that require human-labeled training data. By using the local shape information in the training data, it outperforms a trained local boundary detector. Its performance is competitive with a trained top-down segmentation algorithm that uses global shape. The shape information it learns from one class of objects can assist the segmentation of other classes.

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

machine learning
computer vision
markov random field


New delay-dependent conditions on robust stability and stabilisation for discrete-time systems with time-delay This article is concerned with new robust stability conditions and robust stabilisation method for a discrete-time system with time-delay and time-varying structured uncertainties that come into state and input matrices. An improved approach to obtain new robust stability conditions is proposed. Our approach employs a generalised Lyapunov functional combined with the parameterised model transformation method and the generalised free weighting matrix method. These generalisations lead to generalised robust stability conditions that are given in terms of linear matrix inequalities. Moreover, based on new robust stability conditions, a robust stabilisation method for uncertain discrete-time systems with time-delay is given. Numerical examples compare our robust stability conditions with some existing conditions to show the effectiveness of our approach and also illustrate the improvement of our robust stabilisation method.

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

time-delay systems
discrete-time systems
uncertain systems
delay-dependent conditions
linear matrix inequality


Link testA statistical method for finding prostate cancer biomarkers We present a new method, link-test, to select prostate cancer biomarkers from SELDI mass spectrometry and microarray data sets. Biomarkers selected by link-test are supported by data sets from both mRNA and protein levels, and therefore results in improved robustness. Link-test determines the level of significance of the association between a microarray marker and a specific mass spectrum marker by constructing background mass spectra distributions estimated by all human protein sequences in the SWISS-PROT database. The data set consist of both microarray and mass spectrometry data from prostate cancer patients and healthy controls. A list of statistically justified prostate cancer biomarkers is reported by link-test. Cross-validation results show high prediction accuracy using the identified biomarker panel. We also employ a text-mining approach with OMIM database to validate the cancer biomarkers. The study with link-test represents one of the first cross-platform studies of cancer biomarkers.

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

microarray
mass spectrometry
biomarker
prostate cancer


a low leakage 9t sram cell for ultra-low power operation This paper presents the design and evaluation of a new SRAM cell made of nine transistors (9T). The proposed 9T cell utilizes a scheme with separate read and write wordlines; it is shown that the 9T cell achieves improvements in power dissipation, performance and stability compared with previous designs (that require 10T and 8T) for low-power operation. The 9T scheme is amenable to small feature sizes as encountered in the deep sub-micron/nano ranges of CMOS technology.

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

static noise margin
nanotechnology
leakage power
low power


Bacteria Hunt Evaluating multi-paradigm BCI interaction The multimodal, multi-paradigm brain-computer interfacing (BCI) game Bacteria Hunt was used to evaluate two aspects of BCI interaction in a gaming context. One goal was to examine the effect of feedback on the ability of the user to manipulate his mental state of relaxation. This was done by having one condition in which the subject played the game with real feedback, and another with sham feedback. The feedback did not seem to affect the game experience (such as sense of control and tension) or the objective indicators of relaxation, alpha activity and heart rate. The results are discussed with regard to clinical neurofeedback studies. The second goal was to look into possible interactions between the two BCI paradigms used in the game: steady-state visually-evoked potentials (SSVEP) as an indicator of concentration, and alpha activity as a measure of relaxation. SSVEP stimulation activates the cortex and can thus block the alpha rhythm. Despite this effect, subjects were able to keep their alpha power up, in compliance with the instructed relaxation task. In addition to the main goals, a new SSVEP detection algorithm was developed and evaluated.

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

brain-computer interfacing
multimodal interaction
steady-state visually-evoked potentials
neurofeedback relaxation


Metamodels and emergent behaviour in models of conflict In this paper, we develop a simplified mathematical model (a metamodel) of a simulation model of conflict, based on ideas drawn from the analysis of more general physical systems, such as found in fluid dynamics modelling. We show that there is evidence from the analysis of historical conflicts to support the kind of emergent behaviour implied by this approach. We then apply this approach to the development of a metamodel of a particular complexity based simulation model of conflict (ISAAC), developed for the US Marine Corps. The approach we have illustrated here is very generic, and is applicable to any simulation model which has complex interactions similar to those found in fluid dynamic modelling, or in simulating the emergent behaviour of large numbers of simple systems which interact with each other locally.

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

conflict
emergent behaviour
metamodel
simulation
complexity


Topological Implications of Selfish Neighbor Selection in Unstructured Peer-to-Peer Networks Current peer-to-peer (P2P) systems often suffer from a large fraction of freeriders not contributing any resources to the network. Various mechanisms have been designed to overcome this problem. However, the selfish behavior of peers has aspects which go beyond resource sharing. This paper studies the effects on the topology of a P2P network if peers selfishly select the peers to connect to. In our model, a peer exploits locality properties in order to minimize the latency (or response times) of its lookup operations. At the same time, the peer aims at not having to maintain links to too many other peers in the system. By giving tight bounds on the price of anarchy, we show that the resulting topologies can be much worse than if peers collaborated. Moreover, the network may never stabilize, even in the absence of churn. Finally, we establish the complexity of Nash equilibria in our game theoretic model of P2P networks. Specifically, we prove that it is NP-hard to decide whether our game has a Nash equilibrium and can stabilize.

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

game theory
peer-to-peer
np-hardness
metric spaces


a readable tcp in the prolac protocol language Prolac is a new statically-typed, object-oriented language for network protocol implementation. It is designed for readability, extensibility, and real-world implementation; most previous protocol languages, in contrast, have been based on hard-to-implement theoretical models and have focused on verification. We present a working Prolac TCP implementation directly derived from 4.4BSD. Our implementation is modular---protocol processing is logically divided into minimally-interacting pieces; readable---Prolac encourages top-down structure and naming intermediate computations; and extensible---subclassing cleanly separates protocol extensions like delayed acknowledgements and slow start. The Prolac compiler uses simple global analysis to remove expensive language features like dynamic dispatch, resulting in end-to-end performance comparable to an unmodified Linux 2.0 TCP.

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

network protocol
structure
analysis
dynamic
language
performance
implementation
verification
readability
extensibility
global

process
modular
compilation
model
feature
object oriented language


A WEARABLE DOCUMENT READER FOR THE VISUALLY IMPAIRED: DEWARPING AND SEGMENTATION While reading devices for the visually impaired have been available for many years, they are often expensive and difficult to use. The image processing required to enable the reading task is a composition of several important sub-tasks, such as image capture, image stabilization, image enhancement and page-curl dewarping region segmentation, regions grouping, and word recognition In this paper we deal with some of these sub-tasks in an effort to prototype a device (Tyflos-reader) that will read a document for a person with a visual impairment and respond to voice commands for control. Initial experimental results on a set of textbook and newspaper pages are also presented.

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

assistive devices
image super-resolution
perspective rectification
page-curl dewarping
document segmentation
voice user-interface


Top-K structural diversity search in large networks Social contagion depicts a process of information (e.g., fads, opinions, news) diffusion in the online social networks. A recent study reports that in a social contagion process, the probability of contagion is tightly controlled by the number of connected components in an individuals neighborhood. Such a number is termed structural diversity of an individual, and it is shown to be a key predictor in the social contagion process. Based on this, a fundamental issue in a social network is to find top-\(k\) users with the highest structural diversities. In this paper, we, for the first time, study the top-\(k\) structural diversity search problem in a large network. Specifically, we study two types of structural diversity measures, namely, component-based structural diversity measure and core-based structural diversity measure. For component-based structural diversity, we develop an effective upper bound of structural diversity for pruning the search space. The upper bound can be incrementally refined in the search process. Based on such upper bound, we propose an efficient framework for top-\(k\) structural diversity search. To further speed up the structural diversity evaluation in the search process, several carefully devised search strategies are proposed. We also design efficient techniques to handle frequent updates in dynamic networks and maintain the top-\(k\) results. We further show how the techniques proposed in component-based structural diversity measure can be extended to handle the core-based structural diversity measure. Extensive experimental studies are conducted in real-world large networks and synthetic graphs, and the results demonstrate the efficiency and effectiveness of the proposed methods.

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

disjoint-set forest
\(\hbox {a}^*\) search
dynamic graph


A unified approach for detecting and eliminating selfish nodes in MANETs using TBUT Recent years have witnessed the increasing efforts toward making architecture standardization for the secured wireless mobile ad hoc networks. In this scenario when a node actively utilizes the other node resources for communicating and refuses to help other nodes in their transmission or reception of data, it is called a selfish node. As the entire mobile ad hoc network (MANETs) depends on cooperation from neighboring nodes, it is very important to detect and eliminate selfish nodes from being part of the network. In this paper, token-based umpiring technique (TBUT) is proposed, where every node needs a token to participate in the network and the neighboring nodes act as umpire. This proposed TBUT is found to be very efficient with a reduced detection time and less overhead. The security analysis and experimental results have shown that TBUT is feasible for enhancing the security and network performance of real applications.

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

performance and token-based umpiring technique (tbut)


Multiversion join index for multiversion data warehouse The data warehouse (DW) technology is developed in order to support the integration of external data sources (EDSs) for the purpose of advanced data analysis by On-Line Analytical Processing (OLAP) applications. Since contents and structures of integrated EDSs may evolve in time, the content and schema of a DW must evolve too in order to correctly reflect the evolution of EDSs. In order to manage a DW evolution, we developed the multiversion data warehouse (MVDW) approach. In this approach, different states of a DW are represented by the sequence of persistent DW versions that correspond either to the real world state or to a simulation scenario. Typically, OLAP applications execute star queries that join multiple fact and dimension tables. An important optimization technique for this kind of queries is based on join indexes. Since in the MVDW fact and dimension data are physically distributed among multiple DW versions, standard join indexes need extensions. In this paper we present the concept of a multiversion join index (MVJI) applicable to indexing dimension and fact tables in the MVDW. The MVJI has a two-level structure, where an upper level is used for indexing attributes and a lower level is used for indexing DW versions. The paper also presents the theoretical upper bound (pessimistic) analysis of the MVJI performance characteristic with respect to I/O operations. The analysis is followed by experimental evaluation. It shows that the MVJI increases a system performance for queries addressing multiple DW versions with exact match and range predicates. (C) 2008 Elsevier B.V. All rights reserved.

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

star query
multiversion query
multiversion join index


Reactive column profile map topology: Continuous distillation column with non-reversible kinetics In this paper we present a topologically based approach to the analysis and synthesis of reactive distillation columns. We extend the definition of Tapp et al. [Tapp, M., Holland, S., Glasser, D., & Hildebrandt, D. (2004). Column profile maps part A: Derivation and interpretation. Industrial and Engineering Chemistry Research, 43, 364-374] of a column section in non-reactive distillation column to a reactive column section (RCS) in a reactive distillation column. A RCS is defined as a section of a reactive distillation column in which there is no addition or removal of material or energy. We introduce the concept of a reactive column profile map (RCPM) in which the profiles in the RCPM correspond to the liquid composition profiles in the RCS. By looking at the singular points in the RCPM, it is demonstrated that for a single chemical reaction with no net change in the total number of moles, the bifurcation of the singular points depends on both the difference point as introduced by Hauan et al. [Hauan, S., Ciric, A. R., Westerberg, A. W., & Lien, K. M. (2000). Difference points in extractive and reactive cascades I-Basic properties and analysis. Chemical Engineering Science, 55, 3145-3159] as well as the direction of the stoichiometric vector. These two vectors combine to define what we call the reactive difference point composition. We show that there only certain feasible topologies of the RCPM and these depend only on the position of the reactive difference point composition. We look at a simple example where the vapour liquid equilibrium (VLE) is ideal and show that we can classify regions of reactive difference point compositions that result in similar topology of the RCPM. Thus, by understanding the feasible topologies of the RCPM, one is able to identify profiles in the RCPM that are desirable and hence one is able to synthesize a reactive distillation column by combining RCS that correspond to the desired profile in the RCPM. We believe that this tool will help understand how and when reaction could introduce unexpected behaviors and this can be used as a complementary tool to existing methods used for synthesis of reactive distillation columns. (C) 2007 Elsevier Ltd. All rights reserved.

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

reactive column profile map
difference point
reactive column section


Fault-tolerant hamiltonian laceability of hypercubes It is known that every hypercube Q(n) is a bipartite graph. Assume that n greater than or equal to 2 and F is a subset of edges with \F\ less than or equal to n - 2. We prove that there exists a hamiltonian path in Q(n) - F between any two vertices of different partite sets. Moreover, there exists a path of length 2(n) - 2 between any two vertices of the same partite set. Assume that n greater than or equal to 3 and F is a subset of edges with \F\ less than or equal to n - 3. We prove that there exists a hamiltonian path in Q(n) - {v} - F between any two vertices in the partite set without v. Furthermore, all bounds are tight. (C) 2002 Elsevier Science B.V. All rights reserved.

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


incorporating user control into recommender systems based on naive bayesian classification Recommender systems are increasingly being employed to personalize services, such as on the web, but also in electronics devices, such as personal video recorders. These recommenders learn a user profile, based on rating feedback from the user on, e.g., books, songs, or TV programs, and use machine learning techniques to infer the ratings of new items. The techniques commonly used are collaborative filtering and naive Bayesian classification, and they are known to have several problems, in particular the cold-start problem and its slow adaptivity to changing user preferences. These problems can be mitigated by allowing the user to set up or manipulate his profile. In this paper, we propose an extension to the naive Bayesian classifier that enhances user control. We do this by maintaining and flexibly integrating two profiles for a user, one learned by rating feedback, and one created by the user. We in particular show how the cold-start problem is mitigated.

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

user profile
machine learning
classification
recommender
user control