Computational

wave

optics

library

for

C

plus

plus:

CWO

plus

plus

library

Diffraction

calculations,

such

as

the

angular

spectrum

method

and

Fresnel

diffractions,

are

used

for

calculating

scalar

light

propagation.

The

calculations

are

used

in

wide-ranging

optics

fields:

for

example,

Computer

Generated

Holograms

(CGHs),

digital

holography,

diffractive

optical

elements,

microscopy,

image

encryption

and

decryption,

three-dimensional

analysis

for

optical

devices

and

so

on.

However,

increasing

demands

made

by

large-scale

diffraction

calculations

have

rendered

the

computational

power

of

recent

computers

insufficient.

We

have

already

developed

a

numerical

library

for

diffraction

calculations

using

a

Graphic

Processing

Unit

(GPU),

which

was

named

the

GWO

library.

However,

this

GWO

library

is

not

user-friendly,

since

it

is

based

on

C

language

and

was

also

run

only

on

a

GPU.

In

this

paper,

we

develop

a

new

C++

class

library

for

diffraction

and

CGH

calculations,

which

is

referred

to

as

a

CWO++

library,

running

on

a

CPU

and

GPU.

We

also

describe

the

structure,

performance,

and

usage

examples

of

the

CWO++

library.

Program

summary

Program

title:

CWO++

Catalogue

identifier:

Program

summary

URL:

Program

obtainable

from:

CPC

Program

Library,

Queen's

University,

Belfast,

N.

Ireland

Licensing

provisions:

Standard

CPC

licence,

No.

of

lines

in

distributed

program,

including

test

data,

etc.:

No.

of

bytes

in

distributed

program,

including

test

data,

etc.:

Distribution

format:

tar.gz

Programming

language:

C++

Computer:

General

computers

and

general

computers

with

NVIDIA

GPUs

Operating

system:

Windows

XP,

Vista,

Has

the

code

been

vectorized

or

parallelized?:

Yes.

core

processor

used

in

CPU

and

many

cores

in

GPU.

RAM:

M

bytes

Classification:

External

routines:

CImg,

FFTW

Nature

of

problem:

The

CWO++

library

provides

diffraction

calculations

which

are

useful

for

Computer

Generated

Holograms

(CGHs),

digital

holography,

diffractive

optical

elements,

microscopy,

image

encryption

and

decryption

and

three-dimensional

analysis

for

optical

devices.

Solution

method:

FFT-based

diffraction

calculations,

computer

generated

holograms

by

direct

integration.

Running

time:

The

sample

runs

provided

take

approximately

minutes

for

the

C++

version

and

seconds

for

the

C++

with

GPUs

version.

(c)

Elsevier

B.V.

All

rights

reserved.

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

diffraction
digital holography
scalar light propagation

digital holographic microscopy
graphics processing unit
gpgpu
cpu computing
holography


Modeling and Simulation of SIP Tandem Server with Finite Buffer Recent collapses of SIP servers (e. g., Skype outage) indicate that the built-in SIP overload control mechanism cannot mitigate overload effectively. We introduce our analytical approach by investigating an overloaded tandem server scenario. Our analytical model: (1) considers a general case that both arrival rate and service rate for signaling messages are generic random processes; (2) makes a detailed analysis of departure processes; (3) allows us to run fluid-based simulations to observe and analyze SIP system performance under some specific scenarios. This approach is much faster than event-driven simulation which needs to track thousands of retransmission timers for outstanding messages and may crash a simulator due to limited computing resources. Our numerical results help us reach a counterintuitive conclusion: A SIP system with a large buffer size may continuously exhibit overload and long queuing delay after experiencing a short period of demand burst or a temporary server slowdown. Small buffer size, on the other hand, can mitigate overload quickly by rejecting a large portion of the requests from a demand burst, and then resume normal operation after a short period of time. Furthermore, numerical results demonstrate that overload at a downstream server may propagate or migrate to its upstream servers and therefore cause widespread server crashes in a real SIP network.

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


Quantum information as a measure of multipartite correlation The mutual information has been successfully used as a measure of correlation strength between quantum systems, especially for bipartite systems. Here, we examine the use of this measure for multipartite quantum systems. For system of qubits, we find that the difference between classical and quantum regimes of correlation strength amounts to just 1 bit of information, at most. We show that the information content of a correlation can be expanded into correlations between pairwise components and demonstrate that in terms of this information-based measure of correlation the GHZ states are the only states that simultaneously optimise these pairwise correlations for systems of qubits.

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


topic-sensitive pagerank In the original PageRank algorithm for improving the ranking of search-query results, a single PageRank vector is computed, using the link structure of the Web, to capture the relative "importance" of Web pages, independent of any particular search query. To yield more accurate search results, we propose computing a set of PageRank vectors, biased using a set of representative topics, to capture more accurately the notion of importance with respect to a particular topic. By using these (precomputed) biased PageRank vectors to generate query-specific importance scores for pages at query time, we show that we can generate more accurate rankings than with a single, generic PageRank vector. For ordinary keyword search queries, we compute the topic-sensitive PageRank scores for pages satisfying the query using the topic of the query keywords. For searches done in context (e.g., when the search query is performed by highlighting words in a Web page), we compute the topic-sensitive PageRank scores using the topic of the context in which the query appeared.

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

yield
search
structure
web page
web
context
queries
algorithm
pagerank
ranking
query
generic

sensitive
vectorization
keyword search
computation
personalized search
web graph
timing
relation
search in context
bias
link structure
linking


The investigation of effects of digital proofing systems used in colour management on print quality with neural networks The aim of this study is to assist users and to determine how digital proofing systems used in colour management effect print qualities. Also the main theme of this study is to determine the effects of digital proofing systems used in colour management on print quality by artificial neural network (ANN). The R2 values are obtained 0.99702 and 0.99688 for training data as matte and cuated papers, respectively. Similarly, these values for testing data are 0.994707 and 0.99629, respectively. The ANN approach shows greater accuracy for evaluating colour management. Based on the outputs of the study, ANN model can be used to estimate the effects of digital proofing systems used in colour management on print quality with highly confidence.

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

colour management
digital proofing
print quality
artificial neural network


Evaluating an eye tracking interface for a two-dimensional sketch editor Throughout the history of CAD, a variety of interfaces have been employed with the aim of supporting designers construction and manipulation of digital models. This paper explores the potential of eye tracking as a CAD interface, and presents a prototype that uses collected gaze data to support shape exploration in a two-dimensional vector-based sketch editor. The eye tracking interface uses the visual interactions of users to identify interpretations of constructed shapes, according to recognised parts identified using methods from shape grammar research. It can therefore be argued that it supports construction and manipulation of shapes according to user intent. The prototype has been evaluated in a user study where design students carried out controlled shape exploration exercises which involved interpretation and manipulation of shapes. In the paper, key concepts of eye tracking methodology are introduced; the methods used to implement the eye tracking interface are described; and the user study and its outcomes are reported. The results are positive and indicate the potential for eye tracking as an interface for supporting shape exploration in CAD.

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


Co-evolutionary particle swarm optimization to solve constrained optimization problems ? This paper presents a co-evolutionary particle swarm optimization (CPSO) algorithm to solve global nonlinear optimization problems. A new co-evolutionary PSO (CPSO) is constructed. In the algorithm, a deterministic selection strategy is proposed to ensure the diversity of population. Meanwhile, based on the theory of extrapolation, the induction of evolving direction is enhanced by adding a co-evolutionary strategy, in which the particles make full use of the information each other by using gene-adjusting and adaptive focus-varied tuning operator. Infeasible degree selection mechanism is used to handle the constraints. A new selection criterion is adopted as tournament rules to select individuals. Also, the infeasible solution is properly accepted as the feasible solution based on a defined threshold of the infeasible degree. This diversity mechanism is helpful to guide the search direction towards the feasible region. Our approach was tested on six problems commonly used in the literature. The results obtained are repeatedly closer to the true optimum solution than the other techniques.

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

global nonlinear optimization
particle swarm optimization
extrapolation
infeasible degree
diversity mechanism


Efficient bit-parallel multipliers over finite fields GF(2(m)) Hardware implementation of multiplication in finite field GF(2(m)) based on sparse polynomials is found to be advantageous in terms of space-complexity as well as the time-complexity. In this paper, we present a new permutation method to construct the irreducible like-trinomials of the form (x + 1)(m) + (x + 1)(n) + 1 for the implementation of efficient bit-parallel multipliers. For implementing the multiplications based on such polynomials, we have defined a like-polynomial basis (LPB) as an alternative to the original polynomial basis of GF(2(m)). We have shown further that the modular arithmetic for the binary field based on like-trinomials is equivalent to the arithmetic for the field based on trinomials. In order to design multipliers for composite fields, we have found another permutation polynomial to convert irreducible polynomials into like-trinomials of the forms (x(2) + x + 1)(m) + (x(2) + x + 1)(n) + 1, (x(2) + x)(m) + (x(2)+ x)(n) + 1 and (x(4) + x + 1)(m) + (x(4) + x + 1)(n) + 1. The proposed bit-parallel multiplier over GF(2(4m)) is found to offer a saving of about 33% multiplications and 42.8% additions over the corresponding existing architectures. (C) 2010 Elsevier Ltd. All rights reserved.

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

composite field
trinomial
pentanomial
like-polynomial
like-trinomial


TSCAN: A Content Anatomy Approach to Temporal Topic Summarization A topic is defined as a seminal event or activity along with all directly related events and activities. It is represented by a chronological sequence of documents published by different authors on the Internet. In this study, we define a task called topic anatomy, which summarizes and associates the core parts of a topic temporally so that readers can understand the content easily. The proposed topic anatomy model, called TSCAN, derives the major themes of a topic from the eigenvectors of a temporal block association matrix. Then, the significant events of the themes and their summaries are extracted by examining the constitution of the eigenvectors. Finally, the extracted events are associated through their temporal closeness and context similarity to form an evolution graph of the topic. Experiments based on the official TDT4 corpus demonstrate that the generated temporal summaries present the storylines of topics in a comprehensible form. Moreover, in terms of content coverage, coherence, and consistency, the summaries are superior to those derived by existing summarization methods based on human-composed reference summaries.

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

natural language processing: language summarization

natural language processing: text analysis


Unavoidable sets of words of uniform length A set of words X over a finite alphabet A is said to be unavoidable if all but finitely many words in A* have a factor in X. We examine the problem of calculating the cardinality of minimal unavoidable sets of words of uniform length; we correct an error in [8], state a conjecture offering a formula for the minimum size of these so called n-good sets for all values of n, and show that the conjecture is correct in an infinite number of cases. (C) 2002 Elsevier Science (USA).

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


Infeasibility resolution based on goal programming Infeasibility resolution is an important aspect of infeasibility analysis. This paper proposes a multi-objective programming model for infeasibility resolution and develops a method based on l? l ? norm goal programming to solve the problem. Any solution is at least weakly efficient and any efficient solution is reachable by regulating the weights. For the special case of irreducibly inconsistent linear systems, any solution is guaranteed to be efficient. The method is capable of handling both linear and nonlinear/non-convex cases, as demonstrated by the numerical examples.

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


Reliability of copper low-k interconnects For the implementation of copper and low-k materials into a tight pitch damascene interconnect architecture it is important to understand and correctly describe the underlying degradation mechanisms during reliability testing. Based on the understanding solutions can be proposed for avoiding fast degradation. While the physical understanding of electromigration mechanisms is less of a debate, technological challenges towards the fabrication of metal wires/vias able to carry the ever increasing current densities are enormous. Recently a number of novel metallization schemes including ruthenium and its alloys or self-forming barriers were proposed. As a consequence, some of the thermodynamic and kinetic behavior of the system can be modified when compared to the conventional Ta-based metallization. Another important component of the system is the insulating low-k dielectric. When scaling the critical dimensions into 50nm pitch and beyond, the impact of layout and line edge roughness becomes important. If a double patterning approach is used for printing a tight metal pitch, then misalignment between the different photos will exacerbate the layout induced effects. The choice of dielectric material, test structure design and damascene process steps will contribute on top of these effects. Based on recent understanding we review some aspects of novel metallization schemes and tight pitch copper/low-k interconnects from a reliability standpoint.

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


A study on semantic web design for global national R&D status analysis The analysis of global R&D information has become an important factor in making R&D investment strategies and global cooperation with the increased competition in the global market. The R&D analysis in Korea is based on the National Science and Technology Information Service (NTIS). However, it is limited to domestic information and the need to widen the analysis to the global market has risen recently. LOD (Linked Open Data) Cloud service, which is based on the openness and the connection of data, is being expanded recently as is the use of Mashup services through the connection with data from other institutes. In this paper, we will analyze the Linked data structure of CORDIS (Community Research and Development Information Service), which is the R&D information service adopted by the EU, and then suggest a case for utilizing the linked data format and design model for implementing the semantic web to effectively analyze the global national R&D trends by using a case where the RDF Triple data has been semantically mashed up from NTIS and NDSL (National Discovery for Science Leaders).

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

linked data
cordis
ntis
ndsl
semantic web
mashup

lod (linked open data)
global r&d information
ontology
interoperability
intelligent information


Provisioning high-availability datacenter networks for full bandwidth communication One critical challenge in datacenter network design is full bandwidth communication. Recent advances have enabled this communication paradigm based on the notion of Valiant load balancing (VLB). In this paper, we target full bandwidth communication among all servers, for all valid traffic patterns, and under k arbitrary link failures. We focus on two typical datacenter topologies, VL2 and fat-tree, and propose a mechanism to perform VLB on fat-tree. We develop the minimum link capacity required on both topologies, where edge and core links are handled separately. These results can help datacenter providers to provision their networks with guaranteed availability. Based on the results, we evaluate the minimum total link capacity required on each topology and characterize the capacity increase trend with k and with the total number of supported servers. These studies are important for datacenter providers to project their capital expenditures on datacenter design, upgrade, and expansion. Next, we compare the total link capacity between the two topologies. We find that given the same server scale, fat-tree requires less total capacity than does VL2 for small k. For large k, there exists a turning point at which VL2 becomes more capacity-efficient.

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

datacenter networks
valiant load balancing
full bandwidth communication
link failures

service availability
capacity allocation


instrumentness for creativity mediation, materiality & metonymy We introduce the concept instrumentness as a quality of human-computer interfaces. Instrumentness points to the way musical instruments are controlled and conceptualized through values such as virtuosity and playability, which are important for computer-mediated creative work supporting development in use beyond what is initially designed for. The paper performs a conceptual investigation into qualities in software interfaces that support creativity, supported by analysis of, and interviews with, musical composers. Instrumentness is explained through discussions of materiality and metonymy as central strategies for computer mediated creativity. The paper is contributing to an investigation of the aesthetics of use in relation to software, pointing to alternative values, differing from traditional usability, which are also relevant in creative work outside art and music composition.

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

materiality
mediation
computer mediated creativity
instrumentness
music composition
metonymy

activity theory
interface aesthetics
instrumental interactions


An investigation of the effect of online consumer trust on expectation, satisfaction, and post-expectation This study proposes a framework regarding the relationship between consumer trust, satisfaction, expectation, and post-expectation in the context of electronic commerce. In particular, the framework draws together from three theories: social exchange theory, expectation-confirmation theory, and post-acceptance model of IS continuance. Following the longitudinal pre-purchase and post-purchase stages, this study provides a theoretical framework combining trust, expectation, satisfaction, and post-expectation (i.e., perceived usefulness) and tests the proposed model empirically using Internet consumer behavior data collected via two rounds of Web surveys. The empirical findings suggest that both consumers trust and expectation have positive influences on consumers satisfaction; a significant and positive relationship is detected between consumers trust and expectation; customers satisfaction and perceived usefulness as post-expectation belief are important predictors of repurchase intention. In consequence, the study provides a framework explaining the subsequent relationships of trust, expectation, confirmation, satisfaction, post-expectation, and repurchase intention (i.e., consumer trust ? expectation ? confirmation ? satisfaction ? post-expectation ? repurchase intention) across pre-purchase and post-purchase stages. Theoretical and practical implications are discussed.

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

consumer satisfaction
expectation-confirmation theory
post-acceptance model
pre-purchase and post-purchase stages


Structure of CAPE teaching module in Bradford University Many leading industrialists (Benson, 1992) believe that CAFE (Computer Aided Process Engineering) is an absolute necessity to survival in the coming decades. Training staff to run and maintain a chemical plant without ever visiting the site may soon be possible (Chemistry in Britain, 1997). Increasing demands for graduates with sound understanding and competence in using computational tools in process engineering leads to the development of CAFE course in most universities world-wide. This paper looks into the structure of the CAFE module at Bradford. We believe the ESCAPE meeting will give us the opportunity to discuss the content of the course with academic and industrial colleagues from all over the world and to further develop the course.

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

process unit
process flowsheet
modelling
simulation
optimisation


Squashed Entanglement for Multipartite States and Entanglement Measures Based on the Mixed Convex Roof New measures of multipartite entanglement are constructed based on two definitions of multipartite information and different methods of optimizing over extensions of the states. One is a generalization of the squashed entanglement where one takes the mutual information of parties conditioned on the state's extension and takes the infimum over such extensions. Additivity of the multipartite squashed entanglement is proved for both versions of the multipartite information which turn out to be related. The second one is based on taking classical extensions. This scheme is generalized, which enables to construct measures of entanglement based on the mixed convex roof of a quantity, which in contrast to the standard convex roof method involves optimization over all decompositions of a density matrix rather than just the decompositions into pure states. As one of the possible applications of these results we prove that any multipartite monotone is an upper bound on the amount of multipartite distillable key. The findings are finally related to analogous results in classical key agreement.

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

mixed convex roof
multipartite distillable key
squashed entanglement


On-line legal aid: Markov chain model for efficient retrieval of legal documents It is widely accepted that, with large databases, the key to good performance is effective data-clustering. In any large document database clustering is essential for efficient search, browse and therefore retrieval. Cluster analysis allows the identification of groups, or clusters, of similar objects in multi-dimensional space [1]. Conventional document retrieval systems involve the matching of a query against individual documents, whereas a clustered search compares a query with clusters of documents, thereby achieving efficient retrieval. In most document databases, periodic updating of clusters is required due to the dynamic nature of a database. Experimental evidence, however, shows that clustered searches are substantially less effective than conventional searches of corresponding non-clustered documents. In this paper, we investigate the present clustering criteria and its drawbacks. We propose a new approach to clustering and justify the reasons why this new approach should be tested and (if proved beneficial) adopted.

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

document retrieval
clustering
markov chain


emotional experience on facebook site Although user behavior in the popular Facebook social network site has been intensely investigated since the site came live in 2004, we know little about users' emotions and values weaved in the fabric of their interactions. We report on a diary study for collecting daily accounts of users' most memorable experiences. Outcomes emphasize the distinction between public and private presentation together with user motivation for engaging in each of these roles. Findings also suggest that at their heart, people's most memorable experiences with Facebook are all about positive emotions, in particular those concerned with connectedness and entertainment.

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


A black hole novelty detector for video analysis A black hole is a region of space that has so much mass concentrated in it that there is no way training data for a nearby object to escape its gravitational pull. In this paper we are inspired by this phenomenon to create a new form of novelty detector. We consider the of a given class as a black hole. For multi-class data we are dealing with multiple black holes. A test point is pulled by the centroids of different black holes as well as its K nearest neighbours. The gravitational pull is modelled as an iterative process, where the forces acting on a point are constantly changing with time as the test point moves in multi-dimensional space corresponding to these forces. Once the algorithm has converged, a thresholding scheme is applied to determine whether the test point has been pulled within the boundary of the black hole or not. Any points that lie outside all known black holes are deemed to be novel. We compare this novelty detector with other well-known models of novelty detection on a video analysis application and show very promising results.

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

black hole
novelty detection
video analysis


CPBAC: Property-based access control model for secure cooperation in online social networks The rapid growth of online social networks (OSNs) has brought a revolutionary change in the way geographically dispersed people interact and cooperate with each other toward achieving some common goals. Recently, new ways of ad-hoc cooperation have been demonstrated during the hurricane Irene and the earthquake in Japan. In such emergency situations, OSNs have already taken a significant role as alternative social media that support altruistic information sharing and cooperation among people. However, existing cooperation approaches have not been well-organized and are highly vulnerable to security threats such as a disclosure of users' identities and the leakage of other private data because of the lack of secure cooperation mechanisms. To support secure and effective cooperation in OSNs, in this paper, we propose the CPBAC (Community-centric Property Based Access Control) model, which extends the existing CRiBAC (Community-centric Role interaction Based Access Control) model for use in OSNs to support cooperation among users. To verify the feasibility of the proposed model, we have implemented a prototype application on Facebook and have demonstrated its applicability with two working examples.

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

online social network
community
anonymous member
temporal sharing
property-based access control


Roots of Ehrhart Polynomials of Smooth Fano Polytopes V. Golyshev conjectured that for any smooth polytope P with dim(P)a parts per thousand currency sign5 the roots zaa", of the Ehrhart polynomial for P have real part equal to -1/2. An elementary proof is given, and in each dimension the roots are described explicitly. We also present examples which demonstrate that this result cannot be extended to dimension six.

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

lattice polytope
nonsingular toric fano
canonical line hypothesis


An energy efficient re-access scheme for data caching in data broadcast of a mobile computing environment Data caching is used to improve the response time and the power consumption of a mobile client in a mobile computing environment. To enhance the performance of data caching, one needs to improve the hit ratio and to reduce the cost in processing a cache miss. In a mobile computing environment, a cached data item of a mobile client needs to remain up-to-date with respect to its corresponding data item in the server. A cached data item which is out of date is called a cached invalidated data item. Accessing a cached invalidated data item can be regarded as processing a cache miss. To access a cached invalidated data item, a mobile client needs to download the new content of the data item from the broadcast channel. This operation is called a re-access operation in this paper. Re-accessing a cached invalidated data item incurs large tuning time overhead. In this paper, we propose a re-access scheme that reduces this overhead by allowing a mobile client to access a cached invalidated data item from the broadcast channel without accessing indices. We analyze the performance of the proposed scheme and validate the analysis through experiments. The experiments showed that the proposed scheme significantly reduces the tuning time of a mobile client. Furthermore, the proposed scheme is robust in the sense that it allows changes on the broadcast structure in data broadcasting.

O B I O O O B I O B I O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 broadcast
data caching
energy efficient


Low-Power Architectures for Compressed Domain Video Coding Co-Processor Low power as a de facto is one of the most important criteria for many signal-processing system designs, particularly in multimedia cellular applications and multimedia system on chip design. There have been many approaches to achieve this design goal at many different implementation levels ranging from very-large-scale-integration fabrication technology to system design. In this paper, the multirate low-power design technique will be used along with other methods such as look-ahead, pipelining in designing cost-effective low-power architectures of compressed domain video coding co-processor. Our emphasis is on optimizing power consumption by minimizing computational units along the data path. We demonstrate both low-power and high-speed can be accomplished at algorithm/architecture level. Based on the calculation and simulation results, the design can achieve significant power savings in the range of 60%-80% or speedup factor of two at the needs of users.

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

dct
low-power architecture
motion estimation


New multistage secret sharing scheme based on the factorization problem An efficient multistage (t, n) secret sharing scheme is proposed. The scheme allows a group of users to share multiple secrets. and only one secret share needs to be kept by each user. Knowing the exposed secrets will not affect the security of the other secrets not yet revealed. Moreover, only one public value is needed in the proposed scheme.

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

data privacy
lagrange interpolation polynomial


A comparison of algorithms for inference and learning in probabilistic graphical models Research into methods for reasoning under uncertainty is currently one of the most exciting areas of artificial intelligence, largely because it has recently become possible to record, store, and process large amounts of data. While impressive achievements have been made in pattern classification problems such as handwritten character recognition, face detection, speaker identification, and prediction of gene function, it is even more exciting that researchers are on the verge of introducing systems that can perform large-scale combinatorial analyses of data, decomposing the data into interacting components. For example, computational methods for automatic scene analysis are now emerging in the computer vision community. These methods decompose an input image into its constituent objects, lighting conditions, motion patterns, etc. Two of the main challenges are finding effective representations and models in specific applications and finding efficient algorithms for inference and learning in these models. In this paper, we advocate the use of graph-based probability models and their associated inference and learning algorithms. We review exact techniques and various approximate, computationally efficient techniques, including iterated conditional modes, the expectation maximization (EM) algorithm, Gibbs sampling, the mean field method, variational techniques, structured variational techniques and the sum-product algorithm ("loopy" belief propagation). We describe how each technique can be applied in a vision model of multiple, occluding objects and contrast the behaviors and performances of the techniques using a unifying cost function, free energy.

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

graphical models
probability models
reasoning
learning
variational techniques
loopy belief propagation
em algorithm
mean field
gibbs sampling
free energy

bayesian networks
probabilistic inference
bayesian methods
sum-product algorithm
gibbs free energy
bethe free energy


The effects of perceived risk and technology type on users' acceptance of technologies Previous studies on technology adoption disagree regarding the relative magnitude of the effects of perceived usefulness and perceived ease of use. However these studies did not consider moderating variables. We investigated four potential moderating variables - perceived risk, technology type, user experience, and gender - in users' technology adoption. Their moderating effects were tested in an empirical study of 161 subjects. Results showed that perceived risk, technology type, and gender were significant moderating variables. However the effects of user experience were marginal after the variance of errors was removed. (C) 2007 Published by Elsevier B.V.

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

perceived risk
technology type
user experience
gender

technology acceptance
utaut
moderating variable


A microcoded elliptic curve processor using FPGA technology The implementation of a microcoded elliptic curve processor using field-programmable gate array technology is described. This processor implements optimal normal basis field operations in F(2)n. The design is synthesized by a parameterized module generator, which can accommodate arbitrary n and also produce field multipliers with different speed/area tradeoffs. The control part of the processor is microcoded, enabling curve operations to be incorporated into the processor and hence reducing the chip's I/O requirements. The microcoded approach also facilitates rapid development and algorithmic optimization: for example, projective and affine coordinates were supported using different microcode. The design was successfully tested on a Xilinx Virtex XCV1000-6 device and could perform an elliptic curve multiplication over the field F(2)n using affine and projective coordinates for n = 113, 155, and 173.

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

arithmetic
cryptography
galois fields
microprogramming
public key cryptography
reconfigurable architectures


a novel beaconing approach based on sender-centric movement predictions for collision avoidance in vanets The detection of potential collisions between vehicles is one of the main functionalities of Vehicular Ad-Hoc Networks (VANETs). Vehicles periodically exchange beacon messages by using wireless communication. From the obtained information the receiver calculates the collision probability by predicting the potential movement of every neighbor. Due to the highly dynamic movement of vehicles the accuracy of a prediction is mainly related to the detailed knowledge about the sender. However, as wireless communication suffers from interference due to a saturated communication channel, the context information within a beacon has to be limited. To accomplish this issue while achieving highly accurate predictions, we propose a scalable sender-centric prediction approach based on the available sender's context information.

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

collision detection
trajectory forecast
ad-hoc networks


An elementary proof of Sylvester's double sums for subresultants In 1853 Sylvester stated and proved an elegant formula that expresses the polynomial subresultants in terms of the roots of the input polynomials. Sylvester's formula was also recently proved by Lascoux and Pragacz using multi-Schur functions and divided differences. In this paper, we provide an elementary proof that uses only basic properties of matrix multiplication and Vandermonde determinants. (c) 2006 Elsevier Ltd. All rights reserved.

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

double-sum formula
vandermonde determinant


Semi-online scheduling on two identical machines with rejection In this paper we consider two semi-online scheduling problems with rejection on two identical machines. A sequence of independent jobs are given and each job is characterized by its size (processing time) and its penalty, in the sense that, jobs arrive one by one and can be either rejected by paying a certain penalty or assigned to some machine. No preemption is allowed. The objective is to minimize the sum of the makespan of schedule, which is yielded by all accepted jobs and the total penalties of all rejected ones. In the first problem one can reassign several scheduled jobs in rejection tache, in the second a buffer with length k is available in rejection tache. Two optimal algorithms both with competitive ratio are presented.

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


Scaled steady state models for effective on-line applications Applications for on-line data reconciliation and optimization must be efficient and numerically robust. The models in these applications are rarely changed and the same optimization problem is solved thousands of times with only minor changes in the parameters. This paper describes a suitable modeling framework for this type of applications that, with the aim of simplifying the creation of new models, makes the application robust and avoids numerical difficulties. The model is based on a unit model structure where first-order derivatives, scaling and initial values are properties of the unit model. A new scaling procedure is proposed based on equation and variable pairing. The modeling framework and the use of the proposed scaling procedure are demonstrated in two case studies, case I is simulation of a simple pipe model, case 2 is simulation, data reconciliation and optimization of a flash process. (C) 2007 Elsevier Ltd. All rights reserved.

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

optimization
data reconciliation
simulation
scaling


memory organization and data layout for instruction set extensions with architecturally visible storage Present application specific embedded systems tend to choose instruction set extensions (ISEs) based on limitations imposed by the available data bandwidth to custom functional units (CFUs). Adoption of the optimal ISE for an application would, in many cases, impose formidable cost increase in order to achieve the required data bandwidth. In this paper we propose a novel methodology for laying out data in memories, generating high-bandwidth memory systems by making use of existing low-bandwidth low-cost ones and designing custom functional units all with the desirable data bandwidth for only a fraction of the additional cost required by traditional techniques.

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

architecturally visible storage (avs)
extensible processor
instruction set extensions (ises)


A synthesizable pseudo fractional-N clock generator with improved duty cycle output A proposed synthesizable pseudo fractional-N clock generator with improved duty cycle output is presented by the pseudo fractional-N frequency synthesizer unit for SoC chips and the dynamic frequency scaling applications. The different clock frequencies can be generated by following the design flowchart. It has been fabricated in a 0.13?m CMOS technology and work with a supply voltage of 1.2V. According to measured results, the frequency range of the proposed synthesizable pseudo fractional-N clock generator is from 12.5MHz to 1GHz and the peak-to-peak jitter is less than 5% of the output period. Duty cycle error rate of the output clock frequency is 1.5% and the measured power dissipation of the pseudo fractional-N frequency synthesizer unit is 146?W at 304MHz.

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

synthesizable
clock generator
duty cycle


Pre-filtering technique for MAI cancellation in MC-CDMA systems Multicarrier code division multiple access (MC-CDMA), is a promising multiplexing technique for future communication systems. In this study, we employ the well-known Walsh-Hadamard spreading codes for synchronous downlink transmission of MC-CDMA systems. The spreading codes allow that the frequency diversity to be efficiently exploited. However, multipath propagation may cause orthogonality among users is distorted, and this distortion produces multiple access interference (MAI). To eliminate this effect, we propose a pre-filtering-based MC-CDMA system which uses a pre-filtering technique at the transmitter and an equal gain combining (EGC) scheme at the receivers, respectively. Our proposed pre-filtering technique transforms the transmitted signals so that the MAI can be eliminated, and the EGC scheme weights the signals received from all subcarriers so that channel distortions can be compensated. Furthermore, the proposed technique can calculate the transmitted power over all subcarriers to satisfy the required quality of service of each user and archive MAI-free. In this paper, performance in terms of bit error rate is analyzed; in comparison with the EGC, orthogonal restoring combining, and maximal ratio combining schemes at receiver, respectively. Copyright (c) 2011 John Wiley & Sons, Ltd.

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

mc-cdma
walsh-hadamard code
pre-filtering


Real time vector quantization of LSP parameters The distance measure is of great importance in both the design and coding stage of a vector quantizer. Due to its complexity, however, the spectral distance which best correlates with the perceptual quality is seldom used. On the other hand, various weighted squared Euclidean distance measures give close or even accurate estimation of the meaningful spectral distance. Since they are in general mathematically more tractable, these weighted squared Euclidean distance measures are more commonly used. Significant differences can be found in the performance of different distance measures suggested in previous literatures. In this paper, a complete study and comparison of weighted squared Euclidean distance measures is given. This paper also proposes a new weighted squared Euclidean distance measure for vector quantization of Line Spectrum Pairs (LSP) or Cosine of LSP (CLSP) parameters. It also presents an efficient adaptation apparatus for using the proposed distance measure in the case of split or multi-stage vector quantizers.

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

speech coding
split vector quantization
multi-stage vector quantization
low bit rate
spectral distance measure
power spectral density


a fast and efficient heuristic esop minimization algorithm This work presents theoretical results and an efficient heuristic algorithm for minimizing single -output exclusive -or sum-of-products expressions, based on an iterative product term transformation paradigm. Experimental results verify the efficiency of the algorithm in terms of execution times and product term count of the produced expression, when compared to a state-of-the-art heuristic ESOP minimizer for single-output benchmark and randomly generated functions.

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


Face recognition using various scales of discriminant color space transform Research on color face recognition in the existing literature is aimed to establish a color space that can have the most of the discriminative information from the original data. This mainly includes optimal combination of different color components from the original color space. Recently proposed discriminate color space (DCS) is theoretically optimal for classification, in which one seeks a set of optimal coefficients in terms of linear combinations of the R, G and B components (based on a discriminate criterion). This work proposes an innovative block-wise DCS (BWDCS) method, which allows each block of the image to be in a distinct DCS. This is an interesting alternative to the methods relying on converting whole image to DCS. This idea is evaluated with four appearance-based subspace state-of-the-art methods on five different publicly available databases including the well-known FERET and FRGC databases. Experimental results show that the performance of these four gray-scale based methods can be improved by 17% on average when they are used with the proposed color space.

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

color face recognition
discriminant color space
feret
frgc


fused, multi-spectral automatic target recognition with xcs We present new results from our most recent efforts in applying XCS to automatic target recognition (ATR). We place particular emphasis on ATR as a series of linked problems, which include pre-processing of multi-spectral data, detection of objects (in this case, vehicles) in that data, and identification (classification) of those objects. Multi-spectral data contains visual imagery, and additional imagery from several infrared spectral bands. The performance of XCS, with robust features, notably exceeds that of a template-based classifier on the pre-processed multi-spectral data for vehicle identification.

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


Environmental decision support systems (EDSS) development Challenges and best practices ? Despite the perceived value of DSS in informing environmental and natural resource management, DSS tools often fail to be adopted by intended end users. By drawing together the experience of a global group of EDSS developers, we have identified and assessed key challenges in EDSS development and offer recommendations to resolve them. Challenges related to engaging end users in EDSS development emphasise the need for a participatory process that embraces end users and stakeholders throughout the design and development process. Adoption challenges concerned with individual and organisational capacities to use EDSS and the match between EDSS and organisational goals can be overcome through the use of an internal champion to promote the EDSS at different levels of a target organisation; co-ordinate and build capacity within the organisation, and; ensure that developers maintain focus on developing EDSS which are relatively easy and inexpensive to use and update (and which are perceived as such by the target users). Significant challenges exist in relation to ensuring EDSS longevity and financial sustainability. Such business challenges may be met through planning and design that considers the long-term costs of training, support, and maintenance; revenue generation and licensing by instituting processes which support communication and interactions; and by employing software technology which enables easy model expansion and re use to gain an economy of scale and reduce development costs. A final group of perhaps more problematic challenges relate to how the success of EDSS ought to be evaluated. Whilst success can be framed relatively easily in terms of interactions with end users, difficulties of definition and measurability emerge in relation to the extent to which EDSS achieve intended outcomes. To tackle the challenges described, the authors provide a set of best practice recommendations concerned with promoting design for ease of use, design for usefulness, establishing trust and credibility, promoting EDSS acceptance, and starting simple and small in functionality terms. Following these recommendations should enhance the achievement of successful EDSS adoption, but more importantly, help facilitate the achievement of desirable social and environmental outcomes.

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

environmental decision support systems
edss
adoption
use

information systems
decision-making
software development


Adaptive pick-and-place behaviors in a whole-body humanoid robot with an autonomous layer based on parallel sensor-motor modules The aim of this research is to achieve adaptive carrying behaviors using the whole body of a humanoid robot; in other words to create humanoid robots' "pick-and-place" behaviors. We developed a small-sized whole-body humanoid robot. The robot's body consists of 22 DOFs, lots of sensors, an onbody micro processor network, and a wireless modem. The robot's brain consists of primitive sensor-motor reflex modules running in parallel as a lower layer and an event-driven planner that starts/stops appropriate modules as a higher layer. Using this system the robot can hold, lift up, and put down various objects without knowing its size, hardness or weight. We believe this work will be one of footholds toward achieving various whole-body behaviors of humanoid robots, especially carrying behaviors. (C) 1999 Elsevier Science B.A. All right reserved.

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

whole-body behavior
reactive sensor-motor module


Automated verification of an audio-control protocol using UPPAAL In this paper we present a case-study in which the tool UPPAAL is extended and applied to verify an audio-control protocol developed by Philips. The size of the protocol studied in this paper is significantly larger than case studies, including various abstract versions of the same protocol without bus-collision handling, reported previously in the community of real-time verification. We have checked that the protocol will function correctly if the timing error of its components is bound to +/-5% and incorrectly if the error is +/-6%. In addition, using UPPAAL's ability of generating diagnostic traces, we have studied an erroneous version of the protocol actually implemented by Philips. and constructed a possible execution sequence explaining the error. During the case-study. UPPAAL was extended with the notion of committed locations. It allows for accurate modelling of atomic behaviours, and more importantly, it is utilised to guide the state-space exploration of the model checker to avoid exploring unnecessary interleavings of independent transitions. Our experimental results demonstrate considerable time and space-savings of the modified model checking algorithm. In fact, due to the huge time and memory-requirement. it was impossible to check a simple reachability property, of the protocol before the introduction of committed locations, and now, it takes only seconds. (C) 2002 Published by Elsevier Science Inc.

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

protocol verification
requirements/specifications
design tools and techniques
software/program verification


Simultaneous correction of ghost and geometric distortion artifacts in EPI using a multiecho reference scan A computationally efficient technique is described for the simultaneous removal of ghosting and geometrical distortion artifacts iri echo-planar imaging (EPI) utilizing a multiecho, gradient-echo reference scan. Nyquist ghosts occur in EPI reconstructions because odd and even Lines of Ic-space are acquired with opposite polarity, and experimental imperfections such as gradient eddy currents, imperfect pulse sequence timing, B-0 field inhomogeneity, susceptibility, and chemical shift result in the even and odd lines of k-space being offset by different amounts relative to the true center of the acquisition window Geometrical distortion occurs due to the limited bandwidth of the EPI images in the phase-encode direction. This distortion can be problematic when attempting to overlay an activation map from a functional magnetic resonance imaging experiment generated from EPI data on a high-resolution anatomical image. The method described here corrects for geometrical distortion related to Be inhomogeneity, gradient eddy currents, radio frequency pulse frequency offset, and chemical shift effect. The algorithm for removing ghost artifacts utilizes phase information in two dimensions and is, thus, more robust than conventional one-dimensional methods. An additional reference scan is required which takes approximately 2 min for a matrix size of 64 X 64 and a repetition time of 2 s. Results from a water phantom and a human brain at 3 T demonstrate the effectiveness of the method for removing ghosts and geometric distortion artifacts.

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


Trade deals and/or on-package coupons We investigate whether or not manufacturers should offer trade deals and/or on-pack coupons. Conditions under which either one of the three promotional options is optimal are identified. The coupon redemption rate critically affects manufacturers promotional choices. When a choice is possible, manufacturers prefer on-pack coupons to trade deals. Retailers may only earn more profits than manufacturers when on-pack coupons are offered.

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

on-pack coupons
pull price promotions
push price promotions
trade deal


spatio-temporal visualization of urban crimes on a gis grid We present several techniques for visualizing the temporal dimension of a Geographic Information System. Techniques include (i) pseudo-colored time-window display, (ii) side-by-side height bars, (iii) stacked time-aggregated cumulative bars, (iv) stacked order-preserving bus, (v) vertical time dimension, and (vi) multi-layered display. These techniques are presented in the context of an urban crime mapping application and extend the existing visualization techniques employed in this field. We discuss merits and demerits of the proposed and existing techniques as well as issues related to aggregating the sampled data on a grid. The graphical display and the user interface is achieved through the use of VRML and vrmlscript. Our approach highlights the efforts to combine geographic information visualization with WordWideWeb technologies.

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


Higher-Order Genomic Organization of Cellular Functions in Yeast Previous studies have shown that the distribution of genes in prokaryotes and eukaryotic genomes is not random. Using the thousands of cellular functions that appear in the Gene Ontology ( GO) project, we exhaustively studied the relation between functionality and genomic localization of genes across 16 organisms with rich GO ontologies ( one prokaryote and 15 eukaryotes). Overall, we found that the genomic distribution of cellular functions tends to be more similar in organisms that have higher evolutionary proximity. At the primary level, which measures localization of functionally related genes, the prokaryote Escherichia coli exhibits the highest level of organization, as one would expect given its operon-based genomic organization. However, examining a higher level of genomic organization by analyzing the co-localization of pairs of different functional gene groups, we surprisingly find that the eukaryote yeast Saccharomyces cerevisiae is markedly more organized than E. coli. A network-based analysis further supports this notion and suggests that the eukaryotic genomic architecture is more organized than previously thought. See online Supplementary Material at www.liebertonline.com.

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

functional organization and co-organization


Comparison of failure dependent protection strategies in optical networks The criticality of survivable network design and operation increases with increasing transmission speed. Path protection strategies achieve better network utilization compared to link protection strategies; however, the recovery time of connections in path protection strategies are higher than that in link protection strategies. This paper evaluates and compares the performance of three failure dependent strategies: (1) failure dependent path protection; (2) link protection; and (3) Diversion-a variant of the segmented path protection approach. In addition, a framework for evaluating the connection recovery time is also developed. The protection strategies are compared for their recovery time and blocking performance using extensive simluations.

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

optical networks
failure dependent protection

traffic grooming
survivability
dynamic connection establishment
recovery time computation


Navigation Domain Representation For Interactive Multiview Imaging Enabling users to interactively navigate through different viewpoints of a static scene is a new interesting functionality in 3D streaming systems. While it opens exciting perspectives toward rich multimedia applications, it requires the design of novel representations and coding techniques to solve the new challenges imposed by the interactive navigation. In particular, the encoder must prepare a priori a compressed media stream that is flexible enough to enable the free selection of multiview navigation paths by different streaming media clients. Interactivity clearly brings new design constraints: the encoder is unaware of the exact decoding process, while the decoder has to reconstruct information from incomplete subsets of data since the server generally cannot transmit images for all possible viewpoints due to resource constrains. In this paper, we propose a novel multiview data representation that permits us to satisfy bandwidth and storage constraints in an interactive multiview streaming system. In particular, we partition the multiview navigation domain into segments, each of which is described by a reference image (color and depth data) and some auxiliary information. The auxiliary information enables the client to recreate any viewpoint in the navigation segment via view synthesis. The decoder is then able to navigate freely in the segment without further data request to the server; it requests additional data only when it moves to a different segment. We discuss the benefits of this novel representation in interactive navigation systems and further propose a method to optimize the partitioning of the navigation domain into independent segments, under bandwidth and storage constraints. Experimental results confirm the potential of the proposed representation; namely, our system leads to similar compression performance as classical inter-view coding, while it provides the high level of flexibility that is required for interactive streaming. Because of these unique properties, our new framework represents a promising solution for 3D data representation in novel interactive multimedia services.

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

interactivity
data representation
navigation domain


A hierarchic collision detection algorithm for simple Brownian dynamics We describe an algorithm to avoid steric violation (bumps) between bodies arranged in a hierarchy. The algorithm recursively directs the focus of a bump-detector towards the interactions of children whose parents are in collision. This has the effect of concentrating available computer resources towards maintaining good steric interactions in the region where bodies are colliding. The algorithm was implemented and tested under two programming environments: a graphical environment, OpenGL under Java3D, and a non-graphical environment in C. The former used a built-in collision detection system whereas the latter used a simple algorithm devised previously for the interaction of soft bodies. This simpler system was found to run much faster (by 50-fold) even after allowing for time spent on graphical activity and was also better at preventing steric violations. With a hierarchy of three levels of 100, the non-graphical implementation was able to simulate a million atomic bodies for 100,000 steps in 12h on a laptop computer.

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

brownian dynamics
collision detection
java3d


Connectivity-preserving transformations of binary images ? ?? A binary image I is Ba, Wb-connected, where a,b?{4,8}, if its foreground is a-connected and its background is b-connected. We consider a local modification of a Ba, wb-connected image I in which a black pixel can be interchanged with an adjacent white pixel provided that this preserves the connectivity of both the foreground and the background of I. We have shown that for any (a,b)?{(4,8), (8,4), (8,8)}, any two Ba, wb-connected images I and J each with n black pixels differ by a sequence of ?(n2) interchanges. We have also shown that any two B4, W4-connected images I and J each with n black pixels differ by a sequence of O(n4) interchanges.

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

digital topology
transforming images
ip-equivalence


A novel artificial immune system for solving multiobjective scheduling problems subject to special process constraint This study presents a novel artificial immune system for solving a multiobjective scheduling problem on parallel machines (MOSP), which has the following characteristics: (1) parallel machines are nonidentical, (2) the type of jobs processed on each machine can be restricted, and (3) the multiobjective scheduling problem includes minimizing the maximum completion time among all the machines (makespan) and minimizing the total earliness/tardiness penalty of all the jobs. In this proposed algorithm, the cells are represented by a vector group, and a local search algorithm is incorporated to facilitate the exploitation of the search space. Specially, a new diversity technique is proposed to preserve the diversity of the population and enhance the exploration of the solution space. Simulation results show the proposed algorithm outperforms the vector immune genetic algorithm (VIGA). (C) 2010 Elsevier Ltd. All rights reserved.

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

artificial immune system
multiobjective scheduling
parallel machines


In vivo strain and stress estimation of the heart left and right ventricles from MRI images Mechanical properties of the myocardium have been investigated intensively in the last four decades. Many complex strain energy functions have been used to estimate the stress-strain relationship of myocardium because the heart muscle is an inhomogeneous, anisotropic. and nearly incompressible material, which undergoes large deformations. These functions can be effective for fitting in vitro experimental data from myocardial stretch testing. However, it is difficult to model in vivo myocardium using these strain energy functions. Moreover. such estimates have so far been carried out almost exclusively on the left ventricle, because of the relative thinness and complex geometry of the right ventricle. Previous work from our research group has successful estimated the motion and deformation of both the left and the right ventricles, using data from noninvasive tagged magnetic resonance imaging. In this paper, we present a novel statistical model to estimate the in vivo material properties and strain and stress distribution in both ventricles, using such data. Two normal hearts and two hearts with right-ventricular hypertrophy (RVH) were studied and noticeable differences were found between the strain and stress distributions for normal volunteers and RVH patients. Compared to the strain energy function approach, our model is more intuitively understandable. (C) 2003 Elsevier B.V. All rights reserved.

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

heart ventricle
strain-stress
mri tagging
em algorithm
composite material model


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

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

pervasive computing
content negotiation
device capabilities

context-awareness
http optimization
ubiquitous web
profiling


Facility dispersion problems under capacity and cost constraints The MAX-MIN dispersion problem, which arises in the placement of undesirable facilities, involves selecting a specified number of sites among a set of potential sites so as to maximize the minimum distance between any pair of selected sites. We consider different versions of this dispersion problem where each potential site has an associated storage capacity and a storage cost. A typical problem in this context is to choose a subset of potential sites so that the total capacity of the chosen sites is at least a given value, the total storage cost is within the specified budget and the minimum distance between any pair of chosen sites is maximized. Since these constrained optimization problems are NP-hard in general, we consider whether there are efficient approximation algorithms for them with good performance guarantees. Our results include approximation algorithms for some versions, approximation schemes for some geometric versions and polynomial algorithms for special cases. We also present results that bring out the intrinsic difficulty of obtaining near-optimal solutions to some versions.

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

dispersion
storage capacity
storage cost
optimization

polynomial algorithm
approximation scheme


Cooperative embodied communication emerged by interactive humanoid robots Research on humanoid robots has produced various uses for their body properties in communication. In particular, mutual relationships of body movements between a robot and a human are considered to be important for smooth and natural communication, as they are in humanhuman communication. We have developed a semi-autonomous humanoid robot system that is capable of cooperative body movements with humans using environment-based sensors and switching communicative units. Concretely, this system realizes natural communication by using typical behaviors such as: nodding, eye-contact, face-to-face, etc. It is important to note that the robot parts are NOT operated directly; only the communicative units in the robot system are switched. We conducted an experiment using the mentioned robot system and verified the importance of cooperative behaviors in a route-guidance situation where a human gives directions to the robot. The task requires a human participant (called the speaker) to teach a route to a hearer that is (1) a human, (2) a developed robot that performs cooperative movements, and (3) a robot that does not move at all. This experiment is subjectively evaluated through a questionnaire and an analysis of body movements using three-dimensional data from a motion capture system. The results indicate that the cooperative body movements greatly enhance the emotional impressions of human speakers in a route-guidance situation. We believe these results will allow us to develop interactive humanoid robots that sociably communicate with humans.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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
entrainment
subjective experiments
environment-based sensing


distributed particle filters for sensor networks This paper describes two methodologies for performing distributed particle filtering in a sensor network. It considers the scenario in which a set of sensor nodes make multiple, noisy measurements of an underlying, time-varying state that describes the monitored system. The goal of the proposed algorithms is to perform on-line, distributed estimation of the current state at multiple sensor nodes, whilst attempting to minimize communication overhead. The first algorithm relies on likelihood factorization and the training of parametric models to approximate the likelihood factors. The second algorithm adds a predictive scalar quantizer training step into the more standard particle filtering framework, allowing adaptive encoding of the measurements. As its primary example, the paper describes the application of the quantization-based algorithm to tracking a manoeuvring object.The paper concludes with a discussion of the limitations of the presented technique and an indication of future avenues for enhancement.

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

communication
sensor
scenario
framework
paper
training
parametric
tracking
particle filtering
algorithm
distributed
future

measurement
applications
estimates
examples
approximation
object
standardization
timing
model
quantization
predict
adapt
systems
methodology
factor
encode
sensor network


Gene expression data analysis of human lymphoma using support vector machines and output coding ensembles The large amount of data generated by DNA microarrays was originally analysed using unsupervised methods, such as clustering or self-organizing maps. Recently supervised methods such as decision trees, dot-product support vector machines (SVM) and multi-layer perceptrons (MLP) have been applied in order to classify normal and tumoural tissues. We propose methods based on non-linear SVM with polynomial and Gaussian kernels, and output coding (OC) ensembles of learning machines to separate normal from malignant tissues, to classify different types of lymphoma and to analyse the role of sets of coordinately expressed genes in carcinogenic processes of lymphoid tissues. Using gene expression data from Lymphochip, a specialised DNA microarray developed at Stanford University School of Medicine, we show that SVM can correctly separate normal from tumoural tissues, and OC ensembles can be successfully used to classify different types of lymphoma. Moreover, we identify a group of coordinately expressed genes related to the separation of two distinct subgroups inside diffuse large B-cell lymphoma (DLBCL), validating a previous Alizadehs hypothesis about the existence of two distinct diseases inside DLBCL.

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

gene expression data analysis
support vector machines
dna microarrays

output coding ensembles of learning machines


mobile thumb interaction and speech The design of future spoken and multimodal interfaces should not only compare voice with other modalities of interaction. Instead, it should take screen-based smartphones as a basis and add new, gesture-based anthropocentric interaction forms to it. A potential speech-based interaction can then be smoothly integrated. We focus on the thumb's role while carrying a handheld device in the left or right hand.

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

speech interaction
multimodality
gesture based interaction


computing constructor forms with non terminating rewrite programs In the context of the study of rule-based programming, we focus in this paper on the property of C -reducibility, expressing that every term reduces to a constructor term on at least one of its rewriting derivations. This property implies completeness of function definitions, and enables to stop evaluations of a program on a constructor form, even if the program is not terminating. We propose an inductive procedure proving C -reducibility of rewriting. The rewriting relation on ground terms is simulated through an abstraction mechanism and narrowing. The induction hypothesis allows assuming that terms smaller than the starting terms rewrite into a constructor term. The existence of the induction ordering is checked during the proof process, by ensuring satisfiability of ordering constraints. The proof is constructive, in the sense that the branch leading to a constructor term can be computed from the proof trees establishing C -reducibility for every term

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

termination
sufficient completeness
ordering constraint


Preference modeling on totally ordered sets by the Sugeno integral We present in this paper necessary and sufficient conditions for the representation of preferences in a decision-making problem, by the Sugeno integral, in a purely ordinal framework. We distinguish between strong representation (exact) and weak representation (no contradiction on strict preferences).

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

preference representation
ordinal information


Almost-Tight Hardness of Directed Congestion Minimization Given a set of demands in a directed graph, the directed congestion minimization problem is to route every demand with the objective of minimizing the heaviest load over all edges. We show that for any constant epsilon > 0, there is no Omega(log(1-epsilon) M)-approximation algorithm on networks of size M unless NP subset of ZPTIME(n(polylog) (n)). This bound is almost tight given the O(log M/log log M)-approximation via randomized rounding due to Raghavan and Thompson.

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

hardness of approximation
undirected graphs


Game-theoretical occlusion handling for multi-target visual tracking Multi-target visual tracking is a challenge because of data association and mutual occlusion in the interacting targets. This paper presents a Gaussian mixture probability hypothesis density based multi-target visual tracking system with game-theoretical occlusion handling. Firstly, the spatial constraint based appearance model with other interacting targets interferences is modeled. Then, a two-step occlusion reasoning algorithm is proposed. Finally, an n-person, non-zero-sum, non-cooperative game is constructed to handle the mutual occlusion problem. The individual targets within the occlusion region are regarded as the players in the constructed game to compete for the maximum utilities by using the certain strategies. A Nash Equilibrium of the game is the optimal estimation of the locations of the players within the occlusion region. Experiments on video sequences demonstrate the good performance of the proposed occlusion handling algorithm.

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

multi-target visual tracking
gm-phd filter
game-theory


teaching operating systems with ruby Dynamic languages have regained enormous popularity in recent years. One of the principal dynamic programming languages, Ruby, has been used as the language for assignment work and the presentation of concepts in an introductory Operating Systems course. This was a strange choice for a systems course but there were several good reasons for the choice including the ease with which Ruby provides access to Unix commands and system calls. After some initial problems, the change has been very successful and demonstrates that even in the core courses of a Computer Science curriculum dynamic programming languages have benefits.

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

scripting language
operating systems education


A distributed utility-based two level market solution for optimal resource scheduling in computational grid This paper investigates the interactions between agents representing users, services and resources to solve resource scheduling optimization in computational grid. In order to reduce the computational complexity, we further decompose the grid resource allocation optimization into subproblems: grid user agent-grid service agent in service market and grid service agent-grid resource agent in resource market. Two-level market converges to its optimal points; a globally optimal point is achieved. Total user benefit of the computational grid is maximized when the equilibrium prices are obtained through the service market level optimization and resource market level optimization. It demonstrates a practical approach to market responsive resource pricing that can benefit grid providers and users alike. The paper presents two-level market grid resource pricing that is an iterative algorithm used to perform optimal resource allocation. The experiment shows that two-level market based resource pricing scheme outperforms one level market scheme in terms of task completion time and resource allocation efficiency.

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


Cheap grid: Leveraging system failure using stochastic computation Traditionally, network and computation failure on a heterogeneous network are viewed as an unfortunate obstacle to reliable, efficient computation. We propose that such noise can be incorporated into the algorithm design as part of the necessary source of randomness used in stochastic computation. This paradigm incorporates network and computation failure at a high level in the solution-discovery algorithm, rather than attempting to hide and suppress all such noise at the lowest possible levels in the computation tool. This idea enables the creation of a network solution system with extremely small amounts of global state. This lack of required system state allows for heightened degrees of scalability in the computation engine, and fewer resources are consumed by system management. Algorithms with a stochastic component are easily adapted to this system; various types of evolutionary computation are particularly well adapted to this hybrid paradigm. A specific example using a modified steady-state genetic algorithm is provided to explore the functionality of the resulting composite system. The developed architecture is used to calculate the solution to a number of problems, in each case converging on a solution measurably faster than that of a fully fault-tolerant scheme, thereby resulting in lower overhead and faster execution time.

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

grid computing
parallel computation
fault-tolerance
reliable computing
stochastic systems
evolutionary computing
genetic algorithms