Mining Authoritativeness of Collaborative Innovation Partners The global marketplace over the past decade has called for innovative products and cost reduction. This perplexing duality has led companies to seek external collaborations to effectively deliver innovative products to market. External collaboration often leads to innovation at reduced research and development expenditure. This is especially true of companies which find the most authoritative entity (usually a company or even a person) to work with. Authoritativeness accelerates development and research-to-product transformation due to the inherent knowledge of the authoritative entity. This paper offers a novel approach to automatically determine the authoritativeness of entities for collaboration. This approach automatically discovers an authoritative entity in a domain of interest. The methodology presented utilizes web mining, text mining, and generation of an authoritativeness metric. The concepts discussed in the paper are illustrated with a case study of mining the authoritativeness of collaboration partners for microelectromechanical systems (MEMS).

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


A comparison analysis between unsymmetric and symmetric radial basis function collocation methods for the numerical solution of partial differential equations In this article, we present a thorough numerical comparison between unsymmetric, and symmetric radial basis function collocation methods for the numerical solution of boundary value problems for partial differential equations. A series of test examples was solved with these two schemes, different problems with different type of governing equations, and boundary conditions. Particular emphasis was paid to the ability of these schemes to solve the steady-state convection-diffusion equation at high values of the Peclet number. From the examples tested in this work, it was observed that the system of algebraic equations obtained with the symmetric method was in general simpler to solve than the one obtained with the unsymmetric method and that the resulting algorithm performs better. However, the unsymmetric method has the advantage of being simpler to implement. Two main features about the results obtained in this work are worthy of special attention: First, with the symmetric method it was possible to solve convection-diffusion problems at a very high Peclet number without the need of any artificial damping term, and second, with these two approaches, symmetric and unsymmetric, it is possible to impose free boundary conditions for problems in unbounded domains. (C) 2002 Elsevier Science Ltd. All rights reserved.

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

partial differential equation
mesh free technique


preliminary analysis of the effects of confirmation bias on software defect density In cognitive psychology, confirmation bias is defined as the tendency of people to verify hypotheses rather than refuting them. During unit testing software developers should aim to fail their code. However, due to confirmation bias, most defects might be overlooked leading to an increase in software defect density. In this research, we empirically analyze the effect of confirmation bias of software developers on software defect density.

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

confirmation bias
software defect density


A unified parameterized formulation of reasoning in fuzzy modeling and control A unified parameterized formulation for the reasoning process in fuzzy modeling and control is developed in this paper. First, by selecting a suitable parameterized family of triangular functions and extending to the n-ary operation, the parameterized form of Mamdani's approximation and formal logical reasoning approaches is introduced. Next, by unifying the inference mechanism for both approaches, a unified parameterized reasoning function is developed. It is also proved that for crisp input variables, the two methods of inference from a set of rules, i.e., first-aggregate-then-infer (FATI) and first-infer-then-aggregate (FITA), generate identical fuzzy outputs. The proposed reasoning formulation introduces four reasoning parameters. Depending on these parameters, the reasoning operation varies continuously among the extreme cases in each step of the inference. In order to reduce the computational effort, a fast algorithm for computing the parameterized family of triangular functions is suggested. Further, a simplified parameterized reasoning formulation is also suggested in which the defuzzified output can be calculated directly from the individual consequent fuzzy sets. This simplified formulation is comparable with Sugeno's and Yager's heuristic simplified reasoning functions. Some examples demonstrate the validity of the results. (C) 1999 Elsevier Science B.V. All rights reserved.

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

fuzzy set theory
approximate reasoning
fuzzy systems


A Continuous Method for Reducing Interpolation Artifacts in Mutual Information-Based Rigid Image Registration We propose an approach for computing mutual information in rigid multimodality image registration. Images to be registered are modeled as functions defined on a continuous image domain. Analytic forms of the probability density functions for the images and the joint probability density function are first defined in 1D. We describe how the entropies of the images, the joint entropy, and mutual information can be computed accurately by a numerical method. We then extend the method to 2D and 3D. The mutual information function generated is smooth and does not seem to have the typical interpolation artifacts that are commonly observed in other standard models. The relationship between the proposed method and the partial volume (PV) model is described. In addition, we give a theoretical analysis to explain the nonsmoothness of the mutual information function computed by the PV model. Numerical experiments in 2D and 3D are presented to illustrate the smoothness of the mutual information function, which leads to robust and accurate numerical convergence results for solving the image registration problem.

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

image registration
interpolation artifacts
multimodality
mutual information
rigid


optimizing multimodal reranking for web image search In this poster, we introduce a web image search reranking approach with exploring multiple modalities. Diff erent from the conventional methods that build graph with one feature set for reranking, our approach integrates multiple feature sets that describe visual content from different aspects. We simultaneously integrate the learning of relevance scores, the weighting of different feature sets, the distance metric and the scaling for each feature set into a unified scheme. Experimental results on a large data set that contains more than 1,100 queries and 1 million images demonstrate the effectiveness of our approach.

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


GPU implementations of the bond fluctuation model We present two parallel implementations of the bond fluctuation model on graphics processors that outperform by a factor of up to 50 times an equivalent implementation on single CPU processor. The first algorithm is a parallelized version of an accelerated MC method published earlier in [S. Nedelcu, J.-U. Sommer, Single chain dynamics in polymer networks: a Monte Carlo study, J. Chem. Phys. 130 (2009) 204902]. In this first algorithm we use the parallel domain decomposition technique to avoid monomer collisions. In contrast, in the second algorithm we associate each monomer with a parallel process, where all monomers in the system are attempted to move simultaneously. In both cases, only monomer moves that result in allowed bonds and preserve lattice occupancy are accepted. To validate the correctness of the GPU algorithms we simulated monodisperse polymer melts at monomer number density 0.5 and compared static and dynamical properties with standard CPU implementations. We found good agreement between the CPU and the GPU results, which demonstrates the equivalence of the serial and parallel implementations. The influence of higher monomer number density is discussed.

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

monte carlo simulations
graphics programming


LP-Decodable Permutation Codes Based on Linearly Constrained Permutation Matrices A set of linearly constrained permutation matrices are proposed for constructing a class of permutation codes. The main feature of this class of permutation codes, called linear programming (LP)-decodable permutation codes, is this LP decodability. It is demonstrated that the LP decoding performance of the proposed class of permutation codes is characterized by the vertices of the code polytope of the code. Two types of linear constraints are discussed: one is structured constraints and the other is random constraints. The structured constraints allow an efficient encoding algorithm. On the other hand, the random constraints enable us to use probabilistic methods for analyzing several code properties such as the average cardinality and the average weight distribution.

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

error correction
linear programming (lp)


A computational model explaining language phenomena on Korean visual word recognition How do we understand the meaning of written word? Until recently, the basic mechanisms underlying visual word recognition have remained controversial. To explore the basic mechanisms underlying the human recognition processes, we propose the computational model of visual word recognition which reflects the theoretically presented linguistic processing mechanisms of Koreans visual word processing. In applying the computational model, sets of orthographic units, hidden units, context units and semantic units, were constructed. During the training phase, the weight on the connections between the units were modified using the back-propagation learning algorithm. The model using a lexical decision response time was substituted by a cross entropy values. To evaluate the model, we also conducted behavioral experiments to compare the results of the model performance with human performances. The results show that the proposed model closely simulates Korean visual word processing characteristics such as the word frequency effect, the lexical status effect, the word similarity effect and the semantic priming effect. The model suggests that the computational models should be a valuable tool that can explain the lexical information processing characteristics of the Korean visual word recognition.

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

connectionist model
lexical decision task


A heterogeneous computing environment to solve the 768-bit RSA challenge In December 2009 the 768-bit, 232-digit number RSA-768 was factored using the number field sieve. Overall, the computational challenge would take more than 1700 years on a single, standard core. In the article we present the heterogeneous computing approach, involving different compute clusters and Grid computing environments, used to solve this problem.

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


Shurmian morphisms and alpha-words In this paper we prove that the set W of alpha-words over {0, 1} coincides with the set of images of 0 under Sturmian morphisms. This gives an alternative approach of generating alpha-words. For each w is an element of W, a Sturmian solution H of the equation w = H(0) which is a composition of Sturmian morphisms of special forms can be constucted explicitly. In order to demonstrate how results on Sturmian morphic images are reformulated as results on alpha-words and vice versa, we give a Sturmian proof for the conjugation and reversion theorem of alpha-words obtained by the present author in an earlier paper. (C) 1999 Elsevier Science B.V. All rights reserved.

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

alpha-word
sturmian morphism
sturmian word


Formal verification of a generic framework to synthesize SAT-provers We present in this paper an application of the ACL2 system to generate and reason about propositional satisfiability provers. For that purpose, we develop a framework in which we define a generic SAT-prover based on transformation rules, and we formalize this generic framework in the ACL2 logic, carrying out a formal proof of its termination, soundness, and completeness. This generic framework can be instantiated to obtain a number of verified and executable SAT-provers in ACL2, and this instantiation can be done in an automated way. Three instantiations of the generic framework are considered: semantic tableaux, sequent calculus, and Davis-Putnam-Logeman-Loveland methods.

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


Metamodels for Estimating Quantiles of Systems with One Controllable Parameter We investigate the properties and robustness of histogram approximation to construct non-functional-form metamodels for estimating quantiles of systems with one controllable parameter, providing a general trend of quantiles. By non-functional-form metamodel, we mean the metamodel is not described by a single formula. The procedure constructs histograms by tracking sample quantiles at certain grid points. The algorithm dynamically increases the sample size so that the quantile estimates obtained via the histogram satisfy the proportional precision. The non-functional-form metamodel is constructed with a set of carefully selected histograms. Quantiles can then be estimated via the metamodel. An experimental performance evaluation demonstrates the validity of using non-functional-form metamodels to estimate quantiles.

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


A radial basis function neural network adaptive controller to drive a powered lower limb knee joint orthosis Human safety is ensured for the wearer of exoskeleton. Adaptive controller without prior knowledge. Stability proved theoretically using Lyapunov approach. No chattering phenomena in the input control. External disturbances are rejected and the wearer efforts are taken into account.

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

neural networks
control theory
robustness
exoskeletons
intelligent systems


CSIEC: A computer assisted English learning chatbot based on textual knowledge and reasoning CSIEC (Computer Simulation in Educational Communication) system with newly developed multiple functions for English instruction still focuses on supplying a virtual chatting partner (chatbot), which can chat in English with the English learners anytime anywhere. It generates communicative response according to the user input, the dialogue context, the users and its own personality knowledge, common sense knowledge, and inference knowledge. All these kinds of knowledge are expressed in the form of NLML, an annotation language for natural language text. These NLMLs can either be automatically obtained through parsing the text, or be easily authored with the help of GUI editors designed by us. So the CSIEC system suggests a nave approach of logical reasoning and inference directly through syntactical and semantic analysis of textual knowledge. This approach has advantages over the old ELIZA-like keywords matching mechanism. The chatting log summarization of free Internet usage within six months demonstrates this advantage. In this paper, we present the system architecture and underlying technologies, and the educational application results.

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

computer assisted language learning
natural language processing
humancomputer interaction


Restricted arc-connectivity of generalized p p -cycles ? For a strongly connected digraph D D the restricted arc-connectivity ??(D) ? ? ( D ) is defined as the minimum cardinality of an arc-cut over all arc-cuts S S satisfying that D?S D ? S has a non-trivial strong component D1 D 1 such that D?V(D1) D ? V ( D 1 ) contains an arc. In this paper we prove that a generalized p p -cycle is ?? ? ? -optimal if diam ( D ) ? 2 ? + p ? 2 , where ? ? is the semigirth of D D and p?3 p ? 3 . Further we show that the k k -iterated line digraph is ?? ? ? -optimal if diam ( D ) ? 2 ? + p ? 2 + k for p?3 p ? 3 . We improve these results for p p large enough and we also improve known results on super-? ? for p p -cycles with p?3 p ? 3 .

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

restricted arc-connectivity
generalized p p -cycle p p p p p
diameter


A NEW DISTRIBUTED JOB SCHEDULING ALGORITHM FOR GRID SYSTEMS Job scheduling is one of the key issues in the design of grid environments. The performance of the grid system severely degrades if a method does not exist to efficiently schedule the user jobs. In this article, a fully distributed, learning automatabased job scheduling algorithm is proposed for grid environments. The proposed method is composed of two types of procedures: in the first, a procedure is run at the grid nodes and in the second, the procedure is run at the schedulers. The proposed algorithm synchronizes the performance of the schedulers by the learning automata that select their actions using the pseudo-random number generators with the same seed. In this method, the grid computational capacity that is allocated to each scheduler is proportional to its workload. To show the efficiency of the proposed method, several simulation experiments were conducted under different grid scenarios. The obtained results show that the proposed algorithm outperforms several well-known methods in terms of makespan, flow time, and load balancing.

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


An integrated framework for the performance analysis of asynchronous communicating stochastic processes In this paper we present a design framework containing a process algebra and the concurrent functional programming language Eden. In order to study properties of a specification written in our process algebraic notation, we provide a translation mechanism to generate Eden programs. Once we have a translation, we may use the Eden tools to study the performance of the (simulation of the) system. In order to add expressiveness to our design language we use a very powerful process algebra. First, we allow the specification of delays induced by general random variables. We also consider value passing. Finally, the communication between concurrent processes is asynchronous. The usefulness of our framework is presented by two examples featuring all the characteristics of our process algebraic model, we give the corresponding translations, and we provide some performance measures obtained by using Eden tools.

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


The

JISC

Academic

Database

Assessment

Tool

virtues

and

vices

Purpose

The

Joint

Information

Systems

Committee

(JISC)

is

an

advisory

body

to

the

higher

and

further

education

funding

councils

for

England,

Scotland

and

Wales,

and

the

Department

of

Education

of

Northern

Ireland

in

matters

related

to

the

use

of

information

and

communications

technology

in

education

and

research.

In

the

world

of

committees,

it

has

been

offering

remarkably

practical

digital

information

products

and

services

for

colleges

and

universities

(www.jisc.ac.uk/aboutus/whoweare/valueimpact.aspx)

for

a

variety

of

very

large-scale

projects.

One

of

the

services

helps

librarians

in

comparing

and

selecting

digital

information

resources

for

licensing.

The

JISC

Academic

Database

Assessment

Tool

(JISC

ADAT)

created

for

JISC

by

DataSalon

is

offered

free

of

charge

under

a

Creative

Commons

license

agreement

so

it

is

available

to

any

type

of

library

(and

any

user)

anywhere

in

the

world,

not

just

for

JISC

members

in

the

UK.

This

paper

aims

to

address

these

issues.

Design/methodology/approach

The

paper

reviews

the

major

features,

advantages

and

shortcomings

of

the

promising

initiatives

of

JISC

ADAT,

and

recommends

some

essential

content

enhancements

to

increase

its

utility

for

the

perennial

and

daunting

task

in

academic,

public,

special

and

school

libraries

of

selecting

databases

based

on

their

source

coverage

and

essential

features

of

their

software

platform.

Here

only

the

journal

coverage

aspects

are

discussed.

Findings

JISC

ADAT

is

a

promising

idea,

and

indeed

JISC

is

the

organisation

in

the

UK

that

can

handle

it.

However,

it

still

would

not

suffice,

as

users

would

need

to

learn

about

the

depth

of

coverage

of

each

journal

by

the

databases,

not

just

about

the

time

span

of

coverage,

and

in

particular

the

gaps

which

may

have

very

different

implications.

It

should

show

the

number

of

records

taken

from

the

journals

in

the

specific

database.

For

nearly

journals,

it

seems

to

be

impossible

to

do,

but

it

could

be

limited

to

the

active

journals,

and

the

process

could

be

automated

by

a

series

of

macros

launching

federated

searching

using

the

existing

journal

names

and/or

ISSNs,

and

visualising

the

hit

counts

in

tiny

sparkline

graphs

in

a

very

compact

way

to

make

the

differences

in

the

real

coverage

of

journals

by

various

databases

really

stand

out.

Originality/value

The

paper

offers

insights

into

the

JISC

ADAT,

outlining

its

virtues

and

vices.

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


Optimal capacitor allocation using fuzzy reasoning and genetic algorithms for distribution systems This paper presents an optimal capacitor allocation method which uses fuzzy reasoning and genetic algorithms for primary distribution systems. In the method, capacitor allocation is applied to correct voltage deviation and reduce power loss for a given load pattern. The problem of capacitor allocation includes determining the location, type (fixed or switched), and size of capacitor. Fuzzy reasoning finds the sensitive buses which are used as the candidate locations for capacitors placement. Genetic algorithms determine the size and type of capacitors to be placed in the system. It is a combinatorial optimization problem which has the objective composed of power losses and capacitor installation costs subject to bus voltage constraints. Three membership functions relating to voltage deviation, real power loss, and reactive power loss are defined for fuzzy application. The proposed approach is demonstrated using two example systems. Computational results show that the proposed method can quickly achieve an optimal or near-optimal solution. (C) 2001 Elsevier Science Ltd. All rights reserved.

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

optimization
fuzzy reasoning
genetic algorithms


Scalable Monte Carlo image synthesis This paper describes a scalable photorealistic renderer that is designed to render scenes of arbitrary complexity on computer systems of arbitrary size. The rendering algorithm is a Monte Carlo method to compute approximate solutions of the rendering equation. The software implementation uses a diffusive load balancing method coupled with a message driven concurrent pipeline. Measured performance in rendering replicated models on up to 128 computers shows scaling efficiencies as high as 99%. Simple extensions will partition extremely large models across physically distributed memory as well as perform out-of-core calculations.

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

monte carlo ray tracing
parallel rendering


ray tracing complex scenes A new algorithm for speeding up ray-object intersection calculations is presented. Objects are bounded by a new type of extent, which can be made to fit convex hulls arbitrarily tightly. The objects are placed into a hierarchy. A new hierarchy traversal algorithm is presented which is efficient in the sense that objects along the ray are queried in an efficient order.Results are presented which demonstrate that our technique is several times faster than other published algorithms. Furthermore, we demonstrate that it is currently possible to ray trace scenes containing hundreds of thousands of objects.

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

demonstrate
fit
intersection
algorithm
ray tracing

object
order
traces
hierarchies
complexity
efficiency
convex hull


A neuroengineering suite of computational tools for visual prostheses The cooperation between neuroscience and biomedical engineering gave rise to a recent, but growing research field, known as neuroengineering. We follow its principles to have a system providing basic descriptions of the visual world to the brain's cortex. We describe a set of software and hardware tools to interface with neural tissue, in order to transmit visual information encoded into a bioinspired neural-like form. The set is composed of a retina-like encoder, and a platform to optimize electrical stimulation parameters for a multi-electrode implant. The main objective is to progress towards a functional visual neuroprosthesis for the blind.

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

neural processing and coding
spiking neurons
artificial retinas
visual neuroprostheses
electrical neurostimulation


A cluster-based trust-aware routing protocol for mobile ad hoc networks Routing protocols are the binding force in mobile ad hoc network (MANETs) since they facilitate communication beyond the wireless transmission range of the nodes. However, the infrastructure-less, pervasive, and distributed nature of MANETs renders them vulnerable to security threats. In this paper, we propose a novel cluster-based trust-aware routing protocol (CBTRP) for MANETs to protect forwarded packets from intermediary malicious nodes. The proposed protocol organizes the network into one-hop disjoint clusters then elects the most qualified and trustworthy nodes to play the role of cluster-heads that are responsible for handling all the routing activities. The proposed CBTRP continuously ensures the trustworthiness of cluster-heads by replacing them as soon as they become malicious and can dynamically update the packet path to avoid malicious routes. We have implemented and simulated the proposed protocol then evaluated its performance compared to the clustered based routing protocol (CBRP) as well as the 2ACK approach. Comparisons and analysis have shown the effectiveness of our proposed scheme.

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


First-principles study of metal atom adsorption on the boron-doped carbon nanotubes Different boron-doped carbon nanotubes with dispersed Ni atoms as potential hydrogen storage materials are investigated using first-principles density functional theory. Our results show that substitution of neighboring two carbon atoms with boron atoms can improve the adsorption of Ni atom on the tube and fix the Ni atom around boron atoms, which prevent the aggregation of the Ni atoms on the surface. It is also found that this kind of boron-doped SWNT with Ni as catalyst has large hydrogen storage capacity.

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

hydrogen storage
density functional theory


Dependent-chance programming with fuzzy decisions Dependent-chance programming (DCP) is a new type of stochastic programming and has been extended to the area of fuzzy programming, This paper provides a spectrum of DCP and dependent-chance multiobjective programming (DCMOP) as Hell as dependent-chance goal programming (DCGP) models with fuzzy rather than crisp decisions. The terms of uncertain environment, event, chance function, and induced constraints are discussed in the case of fuzzy decisions. A technique of fuzzy simulation is also designed for computing chance functions. Finally, we present a fuzzy simulation-based genetic algorithm For solving these models and illustrate its effectiveness by some numerical examples.

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

fuzzy programming
fuzzy simulation
genetic algorithm


CSS-Like Constructions of Asymmetric Quantum Codes Asymmetric quantum error-correcting codes (AQCs) may offer some advantage over their symmetric counterparts by providing better error-correction for the more frequent error types. The well-known CSS construction of q-ary AQCs is extended by removing the F-q-linearity requirement as well as the limitation on the type of inner product used. The proposed constructions are called CSS-like constructions and utilize pairs of nested subfield linear codes under one of the Euclidean, trace Euclidean, Hermitian, and trace Hermitian inner products. After establishing some theoretical foundations, best-performing CSS-like AQCs are constructed. Combining some constructions of nested pairs of classical codes and linear programming, many optimal and good pure q-ary CSS-like codes for q is an element of {2, 3, 4, 5, 6, 7, 8, 9} up to reasonable lengths are found. In many instances, removing the F-q-linearity and using alternative inner products give us pure AQCs with improved parameters than relying solely on the standard CSS construction.

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

asymmetric quantum codes
inner products
subfield linear codes

best-known linear codes
cyclic codes
delsarte bound
group character codes
linear programming (lp) bound
quantum singleton bound


testing network-based intrusion detection signatures using mutant exploits Misuse-based intrusion detection systems rely on models of attacks to identify the manifestation of intrusive behavior. Therefore, the ability of these systems to reliably detect attacks is strongly affected by the quality of their models, which are often called "signatures." A perfect model would be able to detect all the instances of an attack without making mistakes, that is, it would produce a 100\% detection rate with 0 false alarms. Unfortunately, writing good models (or good signatures) is hard. Attacks that exploit a specific vulnerability may do so in completely different ways, and writing models that take into account all possible variations is very difficult. For this reason, it would be beneficial to have testing tools that are able to evaluate the "goodness" of detection signatures. This work describes a technique to test and evaluate misuse detection models in the case of network-based intrusion detection systems. The testing technique is based on a mechanism that generates a large number of variations of an exploit by applying mutant operators to an exploit template. These mutant exploits are then run against a victim host protected by a network-based intrusion detection system. The results of the systems in detecting these variations provide a quantitative basis for the evaluation of the quality of the corresponding detection model.

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

quality detection systems test exploit behavior case account model template writing evaluation attack tools

network
vulnerabilities
security testing
quality metrics
intrusion detection system
variation
operability
signature
intrusion detection


On the complexity of the maximum biplanar subgraph problem ? Let G=(S,T,E) be a bipartite graph with vertex set S?T and edge E?ST. A typical convention for drawing G is to put the vertices of S on a line and the vertices of T on a separate parallel line and then represent edges by placing straight line segments between the vertices that determine them. In this convention, a drawing is biplanar if edges do not cross, and a subgraph of G is biplanar if it has a biplanar drawing. The maximum biplanar subgraph problem is to find a biplanar subgraph with a maximum number of edges. In general, this maximum biplanar subgraph problem is NP-complete. In this paper, we show the maximum biplanar subgraph problem belongs not only to the class P, but also the class NC, when input graphs are restricted to doubly convex-bipartite graphs which is an important subclass of bipartite graphs. Moreover, our sequential algorithm is optimal.

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

graph drawing
doubly convex-bipartite graphs
p class
nc class
crossing number


Collaboration challenges: Bridging the IT support gap The more collaborative enterprises are, the better they perform. However, current collaboration technologies do not contribute as much as expected to collaboration quality. Collaboration technology seems to be stuck in just overcoming the limitation of people not being in the same place at the same time. Real time communications are supported through such things as web-conferencing and instant messaging, while email, wikis, and web-based repositories provide the electronic equivalent of the shared file cabinet. Although some technologies support workflow and project management to a degree, there is little support for the joint development lifecycle of planning, creating, evaluating, negotiating, and consolidating group work. Focusing broadly on collaboration challenges highlights limitations of current technology and can help provide direction for the kinds of information technology that will be needed to bridge the IT support gap to meet current and future collaboration challenges.

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

collaboration technology
electronic collaboration


A mathematical framework for sequential passenger and baggage screening to enhance aviation security To enhance security at both national and global levels, airport security screening systems must be designed with high efficiency and effectiveness, which are affected by both screening technologies and operational procedures for utilizing those technologies. The operational efficiency and aviation security can be enhanced if an effective passenger prescreening system is integrated into the baggage screening system. In this paper, passenger information is incorporated into a two-level checked-baggage screening system to determine the screening strategy for different subsets of passengers. By deploying a passenger prescreening system, this paper considers selectively applying baggage screening procedures for 100% screening. Since new image-based screening technologies differ widely in cost and accuracy, a comprehensive mathematical framework is developed in this paper for selecting technology or combination of technologies for efficient 100% baggage screening. The objective is to determine the optimal combination of technologies and the setting of threshold values for these screening technologies as well. Probability and optimization techniques are used to quantify and evaluate the risk and cost-effectiveness of various device deployment configurations, which are captured by using a system life-cycle cost model. Numerical analysis for all possible system arrangements is demonstrated. (c) 2008 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 B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

aviation security risk analysis
checked-baggage screening
selective screening
system life-cycle cost


Face Detection Using Quantized Skin Color Regions Merging and Wavelet Packet Analysis Detecting and recognizing human faces automatically in digital images strongly enhance content-based video indexing systems. In this paper, a novel scheme for human faces detection in color images under nonconstrained scene conditions, such as the presence of a complex background and uncontrolled illumination, is presented. Color clustering and filtering using approximations of the YCbCr and HSV skin color subspaces are applied on the original image, providing quantized skin color regions. A merging stage is then iteratively performed on the set of homogeneous skin color regions in the color quantized image, in order to provide a set of potential face areas. Constraints related to shape and size of faces are applied, and face intensity texture is analyzed by performing a wavelet packet decomposition on each face area candidate in order to detect human faces. The wavelet coefficients of the band filtered images characterize the face texture and a set of simple statistical deviations is extracted in order to form compact and meaningful feature vectors. Then, an efficient and reliable probabilistic metric derived from the Bhattacharrya distance is used in order to classify the extracted feature vectors into face or nonface areas, using some prototype face area vectors, acquired in a previous training stage.

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

bhattacharrya distance
color clustering
face detection


Rank-1 Modal Logics are Coalgebraic Coalgebras provide a unifying semantic framework for a wide variety of modal logics. It has previously been shown that the class of coalgebras for an endofunctor can always be axiomatized in rank 1. Here we establish the converse, i.e. every rank-1 modal logic has a sound and strongly complete coalgebraic semantics. This is achieved by constructing for a given modal logic a canonical coalgebraic semantics, consisting of a signature functor and interpretations of modal operators, which turns out to be final among all such structures. The canonical semantics may be seen as a coalgebraic reconstruction of neighbourhood semantics, broadly construed. A finitary restriction of the canonical semantics yields a canonical weakly complete semantics which moreover enjoys the HennessyMilner property. As a consequence, the machinery of coalgebraic modal logic, in particular generic decision procedures and upper complexity bounds, becomes applicable to arbitrary rank-1 modal logics, without regard to their semantic status; we thus obtain purely syntactic versions of such results. As an extended example, we apply our framework to recently defined deontic logics. In particular, our methods lead to the new result that these logics are strongly complete.

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

coalgebra
neighbourhood frames
deontic logic


A multidimensional approach to determinants of computer use in primary education: teacher and school characteristics The central aim of this study was to test a model that integrates determinants of educational computer use. In particular, the article examines teacher and school characteristics that are associated with different types of computer use by primary school teachers. A survey was set up, involving 527 teachers from 68 primary schools in Flanders. A separate questionnaire was administered to information and communication technology (ICT) coordinators from the same schools to gather additional information about cultural and contextual school characteristics. The combined impact of both teacher and school characteristics was explored through a multilevel analysis. Besides the importance of school characteristics, the results reveal differential effects of specific characteristics on specific types of computer use. Cultural school characteristics for instance, such as the schools openness to change and the availability of an ICT school policy plan, are positively related to the use of computers as a learning tool and to the adoption of ICT in view of basic computer skills. In contrast, no cultural school characteristic seem to be associated with the use of computers as an information tool. In a comparable way, teacher characteristics are associated with specific types of computer use, e.g. the variable gender. In general, male teachers report integrating computers more often. In this study, it appears that gender differences only exist in relation to the adoption of computers as an information tool. The results demonstrate that a multidimensional approach provides more insight into the characteristics affecting computer use.

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

multilevel modelling
school culture
school policies


auxiliary object knowledge influences visually-guided interception behavior This work investigated how humans integrate visual information with object knowledge for interception behavior. When attempting to intercept a moving object using only monocular visual information, the optimal interception position may be ambiguous-the observer may be viewing a small object that is near or a large object that is far away. Regardless, humans are quite adept at monocular interception so it is likely that additional information is incorporated to disambiguate the visual information. We hypothesize that object size information is integrated to accomplish this disambiguation. This sort of auxiliary information integration is well-defined by a Bayesian model of information propagation. We derived a Bayesian model that represents scene attributes relevant to intercepting an object and relations among these attributes. Our model combines sensory measurements with prior scene knowledge to infer an object's position. To test our model we asked participants to intercept a moving ball in virtual reality. In some trials participants were able to see and touch the ball before intercepting it, in others they were only able to see it. When allowed to touch the ball, participants showed improved interception performance. Effectively, they discounted the variation in image size that was caused by variation in object size to obtain more accurate knowledge of object distance. This discounting is consistent with Bayesian information propagation and confirms our hypothesis that human participants use Bayesian inference to estimate an object's distance for interception.

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


MILP formulations for single- and multi-mode resource-constrained project scheduling problems This work presents new mixed-integer linear programming models for the deterministic single-and multi-mode resource constrained project scheduling problem with renewable and non-renewable resources. The modeling approach relies on the Resource-Task Network (RTN) representation, a network representation technique used in process scheduling problems, based on continuous time models. First, we propose new RTN-based network representation methods, and then we efficiently transform them into mathematical formulations including a set of constraints describing precedence relations and different types of resources. Finally, the applicability of the proposed formulations is illustrated using several example problems under the most commonly addressed objective, the makespan minimization. (C) 2011 Elsevier Ltd. All rights reserved.

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

single/multi-mode resource-constrained project scheduling


An improved index of interactivity for fuzzy numbers In this paper we will introduce a new index of interactivity between marginal possibility distributions A and B of a joint possibility distribution C. The starting point of our approach is to equip each gamma-level set of C with a uniform probability distribution, then the probabilistic correlation coefficient between its marginal probability distributions is interpreted as an index of interactivity between the gamma-level sets of A and B. Then we define the index of interactivity between A and B as the weighted average of these indexes over the set of all membership grades. This new index of interactivity is meaningful for the whole family of joint possibility distributions. (C) 2010 Elsevier B.V. All rights reserved.

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

possibility distribution
uniform probability distribution

interactive fuzzy numbers
possibilistic correlation


An Adaptive Hybrid OLAP Architecture with optimized memory access patterns OLAP (On-Line Analytical Processing) is an approach to efficiently evaluate multidimensional data for business intelligence applications. OLAP contributes to business decision-making by identifying, extracting, and analyzing multidimensional data. The fundamental structure of OLAP is a data cube that enables users to interactively explore the distinct data dimensions. Processing depends on the complexity of queries, dimensionality, and growing size of the data cube. As data volumes keep on increasing and the demands by business users also increase, higher processing speed than ever is needed, as faster processing means faster decisions and more profit to industry.

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


Air-stable,

high

current

density,

solution-processable,

amorphous

organic

rectifying

diodes

(ORDs)

for

low-cost

fabrication

of

flexible

passive

low

frequency

RFID

tags

We

report

on

long-term

air-stable

organic

rectifying

diodes

(ORD)

on

flexible

substrates

based

on

a

solution

deposited

amorphous

organic

semiconductor

(OSC)

material,

consisting

of

a

co-polymer

of

arylamine

and

a

fused

aromatic

species,

reaching

charge-carrier

mobilities

of

(space

charge

limited

current

region)

and

current

densities

of

up

to

at

levels

with

rectification

ratios

of

operating

in

the

range.

The

ORDs

exhibit

a

high

degree

of

air-stability

without

any

passivation

with

extremely

reliable

reproducibility.

ORDs

were

fabricated

on

polyethylene

naphthalate

foils

in

a

vertical

sandwich

structure

with

gold

and

aluminium

as

the

injecting

and

blocking

electrodes

respectively

via

evaporation

with

the

OSC

spin-coated

in

between

In

order

to

improve

device

performance

of

the

ORDs,

poly(ethylenedioxythiophene):poly(styrenesulfonate)

was

?-dispensed

as

a

hole-injection

layer

The

results

for

show

a

really

narrow

spread

of

the

diode

characteristics,

whereas

for

diodes

the

spread

is

slightly

more

but

still

acceptable.

These

ORDs

prove

themselves

better

than

conventional

pentacene

diodes

both

in

terms

of

reliability/repeatability

of

the

diode

performance

and

air-stability

without

an

encapsulation

layer,

and

goes

towards

the

enabling

of

a

viable

and

reliable

low-cost

fabrication

method

of

radio

frequency

identification-tags

using

organic

semiconductors.

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

solution processed organic rectifying diodes


Examination for adjoint boundary conditions in initial water elevation estimation problems I present here a method of generating a distribution of initial water elevation by employing the adjoint equation and finite element methods. A shallow-water equation is employed to simulate flow behavior. The adjoint equation method is utilized to obtain a distribution of initial water elevation for the observed water elevation. The finite element method, using the stabilized bubble function element, is used for spatial discretization, and the Crank-Nicolson method is used for temporal discretizations. In addition to a method for optimally assimilating water elevation, a method is presented for determining adjoint boundary conditions. An examination using the observation data including noise data is also carried out. Copyright (C) 2009 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 B I I O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

adjoint equation method
finite element method

data assimilation
shallow-water equation
adjoint boundary condition
estimation of initial water elevation
observation error


Nested harmonic broadcasting for scalable video over mobile datacast channels The integration of reliable Video-on-Demand (VoD) broadcasting schemes in mobile datacast systems, specifically in DVB-H, is studied and enhanced. Sophisticated VoD broadcasting schemes such as Harmonic Broadcasting (HB) allows receivers to tune into the ongoing transmission of a video stream at arbitrary time, while still being able to receive the multimedia sequence from beginning to end, after short initial playout latency. In addition, we address service enhancements by using scalable video coding (SVC) to support heterogeneous receiver capabilities and receiving conditions as well as the reception of the signal from more than on transmission site. We present and discuss options for the integration of VoD broadcasting schemes in combination with fountain codes. Optimizations in parameter selection are discussed. A realistic protocol environment is only slightly modified to support our system concept. Simulation results show the benefits of the discussed VoD scheme compared to existing approaches if integrated in DVB-H. Copyright (c) 2007 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 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 B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

h.264/avc
application layer fec
mobile datacasting
multiple site reception


Parallel Bayesian inference of range and reflectance from LaDAR profiles Bayesian analysis using reversible jump Markov chain Monte Carlo (RJMCMC) algorithms improves the measurement accuracy, resolution and sensitivity of full waveform laser detection and ranging (LaDAR), but at a significant computational cost. Parallel processing has the potential to significantly reduce the processing time, but although there have been several strategies for Markov chain Monte Carlo (MCMC) parallelization, adaptation of these strategies to RJMCMC may degrade parallel performance. In this paper, we describe an approach to parallel RJMCMC processing that combines data and sampling parallelism in a single framework. This approach, Data Parallel State Space Decomposed RJMCMC (DP SSD-RJMCMC), can be adapted to different parallel cluster size, improve sampling efficiency and maintain parameter estimation accuracy. Formally, it forms a group of parallel chains by decomposing the state space into subsets of parameter space. Each subset has different but restricted dimensionality, and is assigned with an independent chain of variable length. To further improve load balancing, we also employ data decomposition, forming a task queue and conducting dynamic task allocation. The MPI-based implementation on a 32-node Beowulf cluster leads to significant speedup, typically of the order of 1525 times, while maintaining the estimation accuracy.

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

reversible jump markov chain monte carlo

distributed parallel computation
data parallelism
varying-dimensional signal analysis
laser radar


UDT: UDP-based data transfer for high-speed wide area networks ? In this paper, we summarize our work on the UDT high performance data transport protocol over the past four years. UDT was designed to effectively utilize the rapidly emerging high-speed wide area optical networks. It is built on top of UDP with reliability control and congestion control, which makes it quite easy to install. The congestion control algorithm is the major internal functionality to enable UDT to effectively utilize high bandwidth. Meanwhile, we also implemented a set of APIs to support easy application implementation, including both reliable data streaming and partial reliable messaging. The original UDT library has also been extended to Composable UDT, which can support various congestion control algorithms. We will describe in detail the design and implementation of UDT, the UDT congestion control algorithm, Composable UDT, and the performance evaluation.

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

transport protocol
congestion control
design and implementation


Specification, planning, and execution of QoS-aware Grid workflows within the Amadeus environment Commonly, at a high level of abstraction Grid applications are specified based on the workflow paradigm. However, majority of Grid workflow systems either do not support Quality of Service (QoS), or provide only partial QoS support for certain phases of the workflow lifecycle. In this paper we present Amadeus, which is a holistic service-oriented environment for QoS-aware Grid workflows. Amadeus considers user requirements, in terms of QoS constraints, during workflow specification, planning, and execution. Within the Amadeus environment workflows and the associated QoS constraints are specified at a high level using an intuitive graphical notation. A distinguishing feature of our system is the support of a comprehensive set of QoS requirements, which considers in addition to performance and economical aspects also legal and security aspects. A set of QoS-aware service-oriented components is provided for workflow planning to support automatic constraint-based service negotiation and workflow optimization. For improving the efficiency of workflow planning we introduce a QoS-aware workflow reduction technique. Furthermore, we present our static and dynamic planning strategies for workflow execution in accordance with user-specified requirements. For each phase of the workflow lifecycle we experimentally evaluate the corresponding Amadeus components. Copyright (C) 2007 John Wiley & Sons, Ltd.

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

amadeus environment
grid workflow
workflow reduction

quality of service (qos)
uml-based specification


A multi-physics and multi-scale lumped parameter model of cardiac contraction of the left ventricle: A conceptual model from the protein to the organ scale In cardiovascular computational physiology the importance of understanding cardiac contraction as a multi-scale process is of paramount importance to understand causality across different scales. Within this study, a multi-scale and multi-physics model of the left ventricle that connects the process of cardiac excitation and contraction from the protein to the organ level is presented in a novel way. The model presented here includes the functional description of a cardiomyocyte (cellular scale), which explains the dynamic behaviour of the calcium concentration within the cell whilst an action potential develops. The cell domain is coupled to a domain that determines the kinetics of the sliding filament mechanism (protein level), which is at the basis of cardiac contraction. These processes are then linked to the generation of muscular force and from there to the generation of pressure inside the ventricle. This multi-scale model presents a coherent and unified way to describe cardiac contraction from the protein to the organ level.

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

multi-scale modelling and simulation
excitation contraction coupling process
left ventricular contraction
dynamic calcium concentration
cross-bridge kinetics


A high performance parallelization scheme for the Hessenberg double shift QR algorithm We propose a new parallelization scheme for the Hessenberg double shift QR algorithm. Our scheme allows software pipelining and communication latency hiding, and gives almost perfect load balance. An asymptotic parallelizing overhead analysis shows that our scheme attains the best possible scalability of the double shift QR algorithm, and that the overheads are less than the multishift algorithm when n=?(p2), where n is the matrix size and p is the number of processors. Its high exploitation of the parallelism of the double shift QR algorithm is demonstrated by an implementation on Fujitsu AP1000+ multicomputer system.

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

parallel processing
data mapping
performance analysis


Simulation-based scheduling of assembly operations The production of large-sized machines or facilities is fundamentally different from the usual manufacturing processes. Mostly it is a fixed-site production, dominated by typical assembly processes instead of linear operation sequences in the known flow shop or job shop problems. To describe these processes, several graph methods were developed in the past, i.e. AND/OR-graphs or modified Petri nets, but most of them are static methods and they are not suitable for scheduling tasks. This paper demonstrates how Timed AND/OR-graphs can be modelled with a common discrete event simulation (DES) system. The objective is a simulation-based scheduling system for assembly processes which is able to improve the prediction of due date keeping as well as to optimise the workflow of the assembly systems.

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

modelling
discrete-event simulation
assembly process
assembly graph


A new Gabor based approach for wood recognition Correct wood recognition has an important meaning in the rational use of wood resources. To complete this task automatically, based on wood stereogram images, we propose a new Gabor based wood recognition approach in this paper, which has been successfully applied in many pattern recognition fields for its robustness against local distortions. However, only a few approaches can make full use of the information in Gabor patterns. To obtain more information of Gabor feature for wood recognition, we first use a set of 40 Gabor patterns to represent a wood image, which consist of important information at different orientation and scales. Then, we apply the block-based feature extraction with more statistical features besides mean and standard deviation on these Gabor patterns to enhance the discriminative ability of our approach. Finally, we reduce the dimensionality of the proposed feature descriptor by using feature selection. Only a few features are selected to achieve both high recognition performance and computational efficiency. We evaluate our approach on the wood database in Zhejiang A & F University (ZAFU), which contains 24 wood species. Experimental results show that by adopting proper sub-block numbers and blocking schemes, our approach outperforms the most of state-of-the-art approaches.

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

wood recognition
gabor patterns
wood stereogram images
feature selection


A Unified Trust Model for Pervasive Environments - Simulation and Analysis Ubiquitous interaction in a pervasive environment is the main attribute of smart spaces. Pervasive systems are weaving themselves in our daily life, making it possible to collect user information invisibly, in an unobtrusive manner by known and even unknown parties. Huge number of interactions between users and pervasive devices necessitate a comprehensive trust model which unifies different trust factors like context, recommendation, and history to calculate the trust level of each party precisely. Trusted computing enables effective solutions to verify the trustworthiness of computing platforms. In this paper, we elaborate Unified Trust Model (UTM) which calculates entity's trustworthiness based on history, recommendation, context and platform integrity measurement, and formally use these factors in trustworthiness calculation. We evaluate UTM behaviour by simulating in different scenario experiments using a Trust and Reputation Models Simulator for Wireless Sensor Networks. We show that UTM offers responsive behaviour and can be used effectively in the low interaction environments.

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

remote attestation
pervasive computing
wireless sensor network
trusted platform module


A wavelet based method for electrical stimulation artifacts removal in electromyogram A technique for artifact removal based on the continuous wavelet transform is presented. It uses common mother wavelets to find the temporal localization of stimulation artifacts on electromyogram signal recording during an electrical surface evoked contraction of a muscle. This method is applied with different kinds of stimulation pulse parameters including shape and duration changes. This method is used with standard stimulation pulse waveforms such as monophasic or biphasic ones. It can also be applied when the artifacts and M waves are in the same range of amplitude where threshold techniques are inefficient. Lastly, a method to determine which mother wavelet efficiently removed artifacts is proposed, results indicate the Haar wavelet performs best among fourteen tested wavelets.

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


Unsupervised detection of non-iris occlusions Accurate iris defect detection. Unconstrained mobile devices high resolution color iris images. Multispectral Markovian spatial texture model. Ranked first from the 97+1 recent Noisy Iris Challenge Evaluation contest alternative methods. Promising performance on the very challenging, high resolution, and highly variable Mobile Iris Challenge Evaluation data.

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


A new construction of 64-QAM Golay complementary sequences In this correspondence, we present a new construction for 64-QAM Golay sequences of length n = 2(m) for integer m. The peak envelope power (PEP) of 64-QAM Golay sequences is shown to be bounded by 4.66n. The new construction of 64-QAM Golay sequences of length n = 2(m) is based on our earlier construction of new offsets of 16-QAM Golay sequences which are also presented here. The total number of offsets of 64-QAM Golay sequences is 496 for m = 2,808 for m = 3 and 976 for m = 4, obtained by computer search. We also computed the PEP distribution for 64-QAM Golay sequences for m = 2, m = 3, and m = 4.

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

orthogonal frequency-division multiplexing (ofdm)

peak-to-mean envelope power ratio (pmepr)


autonomic load-testing framework In this paper, we present a method for performance testing of transactional systems. The methods models the system under test, finds the software and hardware bottlenecks and generate the workloads that saturate them. The framework is autonomic, the model and workloads are determined during the performance test execution by measuring the system performance, fitting a performance model and by analytically computing the number and mix of users that will saturate the bottlenecks. We model the software system using a two-layer queuing model and use analytical techniques to find the workload mixes that change the bottlenecks in the system. Those workload mixes become stress vectors and initial starting points for the stress test cases. The rest of test cases are generated based on a feedback loop that drives the software system towards the worst case behaviour.

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

stress testing
performance models
autonomic system


Framework for formal implementation of the business understanding phase of data mining projects Various data mining methodologies have been proposed in the literature to provide guidance towards the process of implementing data mining projects. The methodologies describe a data mining project as comprised of a sequence of phases and highlight the particular tasks and their corresponding activities to be performed during each of the phases. It seems that the large number of tasks and activities, often presented in a checklist manner, are cumbersome to implement and may explain why all the recommended tasks are not always formally implemented. Additionally, there is often little guidance provided towards how to implement a particular task. These issues seem to be especially dominant in case of the business understanding phase which is the foundational phase of any data mining project. In this paper, we present an organizationally grounded framework to formally implement the business understanding phase of data mining projects. The framework serves to highlight the dependencies between the various tasks of this phase and proposes how and when each task can be implemented. An illustrative example of a credit scoring application from the financial sector is used to exemplify the tasks discussed in the proposed framework. (C) 2008 Elsevier Ltd. All rights reserved.

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

data mining
framework
business understanding


A real-time network simulation infrastructure based on OpenVPN We present an open and flexible software infrastructure that embeds physical hosts in a simulated network. In real-time network simulation, where real-world implementations of distributed applications and network services can run together with the network simulator that operates in real-time, real network packets are injected into the simulation system and subject to the simulated network conditions computed as a result of both real and virtual traffic traversing the network and competing for network resources. Our real-time simulation infrastructure has been implemented based on Open Virtual Private Network (OpenVPN), modified and customized to bridges traffic between the physical hosts and the simulated network. We identify the performance advantages and limitations of our approach via a set of experiments. We also present two interesting application scenarios to show the capabilities of the real-time simulation infrastructure. Published by Elsevier Inc.

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

network simulation
virtual private network


on optimal and equilibrium retrial rates in an unreliable retrial queue with two types of customers A single-server retrial queue with two types of customers in which the server is subject to breakdowns and repairs is studied. Two types of customers arrive to the system in accordance with two different independent Poisson flows. There is no waiting space in front of the server and therefore, if the server is found busy or down, the blocked two types of customers form two sources of repeated calls. The service times of the two types of customers have two different independent general distributions. It is also assumed that the server has a service-type dependent exponentially distributed lifetime as well as a service-type dependent, generally distributed repair time. Explicit expressions are derived for the expected number of retrial customers of each type. In addition, by assuming both types of customers face linear costs for waiting and conducting retrials, we discuss and compare optimal and equilibrium retrial rates respectively regarding the situations in which the customers are cooperative or noncooperative.

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

optimal retrial rate
equilibrium retrial rate


highly-resilient, energy-efficient multipath routing in wireless sensor networks Previously proposed sensor network data dissemination schemes require periodic low-rate flooding of data in order to allow recovery from failure. We consider constructing two kinds of multipaths to enable energy efficient recovery from failure of the shortest path between source and sink. Disjoint multipath has been studied in the liteature. w propose a model braided multipath scheme, which results in several partially disjoint multipath schemes. We find that braided multipaths are a viable alternative for energy-efficient recovery from isolated and patterned failures

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

multipath
order
recovery
data dissemination
sensor networks
data
failure
scheme
shortest path

flood
multipath routing
resilience
wireless sensor network
energy efficiency


Author gender identification from text ? Text is still the most prevalent Internet media type. Examples of this include popular social networking applications such as Twitter, Craigslist, Facebook, etc. Other web applications such as e-mail, blog, chat rooms, etc. are also mostly text based. A question we address in this paper that deals with text based Internet forensics is the following: given a short text document, can we identify if the author is a man or a woman? This question is motivated by recent events where people faked their gender on the Internet. Note that this is different from the authorship attribution problem. In this paper we investigate author gender identification for short length, multi-genre, content-free text, such as the ones found in many Internet applications. Fundamental questions we ask are: do men and women inherently use different classes of language styles? If this is true, what are good linguistic features that indicate gender? Based on research in human psychology, we propose 545 psycho-linguistic and gender-preferential cues along with stylometric features to build the feature space for this identification problem. Note that identifying the correct set of features that indicate gender is an open research problem. Three machine learning algorithms (support vector machine, Bayesian logistic regression and AdaBoost decision tree) are then designed for gender identification based on the proposed features. Extensive experiments on large text corpora (Reuters Corpus Volume 1 newsgroup data and Enron e-mail data) indicate an accuracy up to 85.1% in identifying the gender. Experiments also indicate that function words, word-based features and structural features are significant gender discriminators.

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

gender identification
logistic regression
decision tree
support vector machine


an efficient algorithm for mining time interval-based patterns in large database Most studies on sequential pattern mining are mainly focused on time point-based event data. Few research efforts have elaborated on mining patterns from time interval-based event data. However, in many real applications, event usually persists for an interval of time. Since the relationships among event time intervals are intrinsically complex, mining time interval-based patterns in large database is really a challenging problem. In this paper, a novel approach, named as incision strategy and a new representation, called coincidence representation are proposed to simplify the processing of complex relations among event intervals. Then, an efficient algorithm, CTMiner ( C oincidence T emporal Miner ) is developed to discover frequent time-interval based patterns. The algorithm also employs two pruning techniques to reduce the search space effectively. Furthermore, experimental results show that CTMiner is not only efficient and scalable but also outperforms state-of-the-art algorithms.

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

temporal pattern
interval-based mining
data mining


A new anonymous conference key distribution system based on the elliptic curve discrete logarithm problem ? In 1999, Tseng and Jan [Comput. Commun. 22 (1999) 749] proposed two conference key distribution systems (CKDS) with user anonymity based on the discrete logarithm problem and the interpolating properties of polynomials. Their first CKDS scheme uses a one-way hash function to hide the identities of the participants and to protect each participant's common key that is shared with the chairperson. In this article, we will propose a more efficient CKDS scheme with user anonymity that is based on the elliptic curve discrete logarithm problem and the properties of the line. Our scheme has the advantage of requiring less computing time than the TsengJan CKDS with a one-way hash function.

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

conference key distribution system
user anonymity
elliptic curve discrete logarithm


Akt Depletion Is an Important Determinant of L929 Cell Death following Heat Stress Exposure of mammalian cells to heat stress causes impairment of numerous physiological functions and activates a number of signaling pathways. Some of these pathways, such as induction of heat-shock proteins and activation of Akt, enhance the ability of cells to survive heat stress. On the other hand, heat stress can trigger cell-death signaling via activation of the stress-activated protein kinase/c-Jun NH2-terminal kinase (SAPK/Jnk). Recently, it has been shown that kinases activated by heat stress can regulate synthesis and functioning of the molecular chaperones, and these chaperones modulate the activity of the cell death and survival pathways. We have found that Akt plays a central role in determining the fate of L929 fibroblast cells exposed to heat stress. In our experiments heat stress causes Akt depletion and L929 cells to undergo cell death. Heat-shock protein 70 (Hsp70) is known to prevent stress-induced cell death by interfering with the SAPK/Jnk signaling pathway. In our study, there is a very high level of induction of Hsp70, yet this is not sufficient to rescue Akt depletion and L929 from cell death. The Akt depletion is specific, since actin protein level does not change during the heat stress. Moreover, our studies show that L929 cells can recover from a short-term heat shock, whereby, Akt level is returned to normal following recovery from heat shock. Therefore, it appears that the fate of the prolonged heat-stressed fibroblast cells is determined by Akt level, and that return of Akt protein level to normal prevents cell death.

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


Towards characterizing the non-locality of entangled quantum states The behavior of entangled quantum systems can generally not be explained as being determined by shared classical randomness. In the first part of this paper, we propose a simple game for n players demonstrating this non-local property of quantum mechanics: While, on the one hand, it is immediately clear that classical players will lose the game with substantial probability, it can, on the other hand, always be won by players sharing an entangled quantum state. The simplicity of the classical analysis of our game contrasts the often quite involved analysis of previously proposed examples of this type. In the second part, aiming at a quantitative characterization of the non-locality of n-partite quantum states, we consider a general class of n-player games, where the amount of communication between certain (randomly chosen) groups of players is measured. Comparing the classical communication needed for both classical players and quantum players (initially sharing a given quantum state) to win such a game, a new type of separation results is obtained. In particular, we show that in order to simulate two separated qubits of an n-partite GHZ state at least Omega (log log n) bits of information are required. (C) 2012 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

quantum information theory
communication complexity
non-locality
pseudo-telepathy


The universal projection for computing data carried on the hemisphere For many years, important efforts have been devoted to efficiently compute the view factors in the frame of radiative heat exchanges. This subject has also received special attention in the more recent development of global illumination methods. Basically two techniques are available; the first one is based on projections and the second one on ray tracing methods. Here we will present a new algorithm dealing with projections and show that we can solve both the problems of computing view factors and solid angles by using the same projection. The proposed method is precise and fast, so it can be used in interactive design software.

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

stereography
view factor
radiative heat transfer


Measuring the user acceptance of a web-based nursing documentation system Objectives: The development of an ICNP web-based nursing documentation system, and its evaluation for its usability, and its user acceptance. Methods: A web-based nursing documentation system was designed and implemented by using the Greek translation of ICNP beta 2 version nursing terminology. The system integrates the steps of nursing process for providing and documenting nursing care, while ICNP terminology is used for the description of nursing concepts. The system was evaluated by nurses in a computer laboratory. We measured the user interaction satisfaction mainly by using questionnaires and scenarios. Results. The nurses who evaluated the system possessed adequate basic computer skills, but low-to-moderate experience in clinical or hospital information systems, and insufficient experience with nursing vocabularies, and especially ICNP. Overall, they were satisfied enough with the system's usability and usefulness, while the acceptance level increased as the level of their training in computers, nursing process and IN P was also increased. The integration and use in the system of predefined, or standardized, nursing concepts and care plans seems to increase the acceptance of the documentation system and also the ICNP. Conclusion: The subjective satisfaction and response of the users towards the system is specified. The described system was evaluated under "laboratory conditions" and revealed some of its strong and weak points and some of the factors that influenced its success and acceptance by its users.

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

nursing informatics
internet
user-computer interface
health technology assessment


a scalable approach for reliable downstream data delivery in wireless sensor networks There exist several applications of sensor networks wherere liability of data delivery can be critical. While the redundancy inherent in a sensor network might increase the degree of reliability, it by no means can provide any guaranteed reliability semantics. In this paper, we consider the problem of reliable sink-to-sensors data delivery. We first identify several fundamental challenges that need to be addressed, and are unique to a wireless sensor network environment. We then propose a scalable framework for reliable downstream data delivery that is specifically designed to both address and leverage the characteristics of a wireless sensor network, while achieving the reliability in an efficient manner. Through ns2 based simulations, we evaluate the proposed framework.

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

sensor framework applications redundancy reliability data paper

challenge
wireless sensor networks
simulation
efficiency
sink-to-sensors reliability
environments
reliable transport protocols
scalability
semantic
p3p
sensor networks
addressing
energy conservation
critic
evaluation


Which functionalities are available in the electronic health record systems used by French general practitioners? An assessment study of 15 systems Highly variable functionalities in French EHR systems. Lack of standardisation. Poor structuration. High availability of standard drug classification.

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

evaluation study as a topic
general practice


towards a conceptual design of an intelligent system for an international trade centre in china Over the past few decades, research in artificial intelligence and enterprise systems can be viewed as complementary efforts towards building highly intelligent and efficient organizational information systems for increased systems automation, better systems control and more efficient decision-making. A highly automated intelligent system in an international trade centre is a new initiative in China. The authors of the paper believe that an enterprise level information system planning should precede all detailed designs of the system. This paper presents a set of conceptual models that aim to provide some design guidelines and a structure for the target intelligent system. The final objective is to achieve a highly automatic control of all systems within the trade center and to maximize organizational decision-making capabilities with fully integrated enterprise system architecture.

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

intelligent systems
enterprise framework


Possibilistic approach for biclustering microarray data Biclustering has emerged as an important method for analyzing gene expression data from microarray technology. It allows to identify groups of genes which behave similarly under a subset of conditions. As a gene may play more than one biological role in conjunction with distinct groups of genes, non-exclusive biclustering algorithms are required. In this paper we propose a new method to obtain potentially-overlapping biclusters, the Possibilistic Spectral Biclustering algorithm (PSB), based on Fuzzy Technology and Spectral Clustering. We tested our method on S. cerevisiae cell cycle expression data and on a human cancer dataset, validating the obtained biclusters using known classifications of conditions and GO Term Finder for functional annotations of genes. Results are available at http://decsai.ugr.es/-ccano/psb. (c) 2007 Elsevier Ltd. All rights reserved.

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

microarray
spectral clustering
fuzzy technology


Professional development through attending conferences: reflections of a health librarian In this article, guest writer Ruth Jenkins from Berkshire Heathcare Foundation Trust reflects on two conferences she attended in 2014, LILAC and SLA. Through the process of reflection, she considers the benefits that attending conferences can have to library and information professionals in the health sector. In particular, she discusses the opportunities and areas for learning and professional development that conferences can offer including evidence-based practice and current awareness, gaining new knowledge and objectivity, and networking and the unexpected benefits of conferences. Ruth also offers some practical hints and tips on ways to facilitate your attendance at conferences, including through awards and funding.

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

library and information professionals
professional development

careers
education and training
lifelong learning