Development and validation of a SUPG finite element scheme for the compressible Navier-Stokes equations using a modified inviscid flux discretization This paper considers the streamline-upwind Petrov-Galerkin (SUPG) method applied to the unsteady compressible Navier-Stokes equations in conservation-variable form. The spatial discretization, including a modified approach for interpolating the inviscid flux terms in the SUPG finite element formulation, and the second-order accurate time discretization are presented. The numerical method is discussed in detail. The performance of the algorithm is then investigated by considering inviscid flow past a circular cylinder. Validation of the finite element formulation via comparisons with experimental data for high-Mach number perfect gas laminar flows is presented, with a specific focus on comparisons with experimentally measured skin friction and convective heat transfer on a 15 degrees compression ramp. Copyright (C) 2007 John Wiley & Sons, Ltd.

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

supg
finite element
inviscid flux discretization
validation


Dynamic simulation assessment of collaboration strategies to manage demand gap in high-tech product diffusion There is no question that many high-tech supply chains operate in a context of high process and market uncertainties due to shorter product life cycles. When introducing a new product, these supply chains must manage the cost of supply, including the cost of capacity and inventories, with revenues from the products demand over its life cycle. However, in early phase of introduction after earlier buyers purchase, there might be a demand gap for a period followed by a sudden surge. To stay responsive and serve the market downstream after such gaps, two important decisions must be made: (a) the sizing of the capacity, and (b) the level of collaboration. It is the intention of this paper to show that the chosen level of collaboration effects significantly on managing the gap in the demand trajectory in new high-tech product diffusion. We study the impact of different collaboration strategies like vendor managed inventory (VMI), jointly managed inventory (JMI), and a collaborative planning, forecasting & replenishment (CPFR) model using system dynamics based simulation and compare the results with a non-collaborative chain. Our results yield insights into effectiveness of collaboration in managing the dynamics of demand gap.

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

collaboration strategies
dynamic simulation


Grobner bases with respect to several orderings and multivariable dimension polynomials Let D = K [X] be a ring of Ore polynomials over afield K and let a partition of the set of indeterminates into p disjoint subsets be fixed. Considering D as a filtered ring with the natural p-dimensional filtration, we introduce a special type of reduction in a free D-module and develop the corresponding Grobner basis technique (in particular, we obtain a generalization of the Buchberger Algorithm). Using such a modification of the Grobner basis method, we prove the existence of a Hilbert-type dimension polynomial in p variables associated with a finitely generated filtered D-module, give a method of computation and describe invariants of such a polynomial. The results obtained are applied in differential algebra where the classical theorems on differential dimension polynomials are generalized to the case of differential structures with several basic sets of derivation operators. (C) 2007 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 B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O B I O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

ore polynomials
grobner basis
dimension polynomial

differential ring
differential module
differential field extension


Modification semantics in now-relative databases ? Most real-world databases record time-varying information. In such databases, the notion of the current time, or NOW, occurs naturally and prominently. For example, when capturing the past states of a relation using begin and end time columns, tuples that are part of the current state have some past time as their begin time and NOW as their end time. While the semantics of such variable databases has been described in detail and is well understood, the modification of variable databases remains unexplored. This paper defines the semantics of modifications involving the variable NOW. More specifically, the problems with modifications in the presence of NOW are explored, illustrating that the main problems are with modifications of tuples that reach into the future. The paper defines the semantics of modificationsincluding insertions, deletions, and updatesof databases without NOW, with NOW, and with values of the type NOW+?, where ? is a non-variable time duration. To accommodate these semantics, three new timestamp values are introduced. Finally, implementation is explored. We show how to represent the variable NOW with columns of standard SQL data types and give a mapping from SQL on NOW-relative data to standard SQL on these columns. The paper thereby completes the semantics, the querying, and the modification of now-relative databases.

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

temporal data
temporal query language
now-relative information
updates


Determining the best suited semantic events for cognitive surveillance State-of-the-art systems on cognitive surveillance identify and describe complex events in selected domains, thus providing end-users with tools to easily access the contents of massive video footage. Nevertheless, as the complexity of events increases in semantics and the types of indoor/outdoor scenarios diversify, it becomes difficult to assess which events describe better the scene, and how to model them at a pixel level to fulfill natural language requests. We present an ontology-based methodology that guides the identification, step-by-step modeling, and generalization of the most relevant events to a specific domain. Our approach considers three steps: (1) end-users provide textual evidence from surveilled video sequences; (2) transcriptions are analyzed top-down to build the knowledge bases for event description; and (3) the obtained models are used to generalize event detection to different image sequences from the surveillance domain. This framework produces user-oriented knowledge that improves on existing advanced interfaces for video indexing and retrieval, by determining the best suited events for video understanding according to end-users. We have conducted experiments with outdoor and indoor scenes showing thefts, chases, and vandalism, demonstrating the feasibility and generalization of this proposal. (C) 2010 Elsevier Ltd. All rights reserved.

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

event modeling
content-based video retrieval
ontologies
advanced user interfaces


eStorys: A visual storyboard system supporting back-channel communication for emergencies In this paper we present a new web mashup system for helping people and professionals to retrieve information about emergencies and disasters. Today, the use of the web during emergencies, is confirmed by the employment of systems like Flickr, Twitter or Facebook as demonstrated in the cases of Hurricane Katrina, the July 7, 2005 London bombings, and the April 16, 2007 shootings at Virginia Polytechnic University. Many pieces of information are currently available on the web that can be useful for emergency purposes and range from messages on forums and blogs to georeferenced photos. We present here a system that, by mixing information available on the web, is able to help both people and emergency professionals in rapidly obtaining data on emergency situations by using multiple web channels. In this paper we introduce a visual system, providing a combination of tools that demonstrated to be effective in such emergency situations, such as spatio/temporal search features, recommendation and filtering tools, and storyboards. We demonstrated the efficacy of our system by means of an analytic evaluation (comparing it with others available on the web), an usability evaluation made by expert users (students adequately trained) and an experimental evaluation with 34 participants. (C) 2010 Elsevier Ltd. All rights reserved.

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

mashups
collaboration systems
emergency management


Residual layer-free Reverse Nanoimprint Lithography on silicon and metal-coated substrates In this work we demonstrate that Reverse Nanoimprint Lithography is a feasible and flexible lithography technique applicable to the transfer of micro and nano polymer structures with no residual layer over areas of cm2 areas on silicon, metal and non-planar substrates. We used a flexible polydimethylsiloxane stamp with hydrophobic features. We present residual layer-free patterns imprinted using a commercial poly(methylmethacrylate) thermoplastic polymer over silicon, nickel and pre-patterned substrates. Our versatile patterning technology is adaptable to free form nano structuring and has coupling to adhesion technologies.

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


Theory of exchange In the context of production activity, several parameters play an important role in the total cost estimation and its optimization. These parameters include facility setup cost, inventory carrying cost, and manufacturing cost for the basic model. Shortages can be incorporated in certain environment and costs associated with shortages need to be included in the analysis. It is expected that the industries will run their manufacturing facility at an optimum level. In the multi-product manufacture, optimum common cycle time approach is usually adopted and all the items are produced in each cycle. A situation may occur in the real world, in which a particular parameter concerning an item is exchanged with that of another item. It is of interest to examine the aftereffects. Otherwise also, for the purpose of internal benchmarking, a deliberate exchange of parameters can take place. This can be implemented in case of cost improvement. A generalized approach is presented and discussion is made with reference to various parameters.

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


A sparse nonparametric hierarchical Bayesian approach towards inductive transfer for preference modeling In this paper, we present a novel methodology for preference learning based on the concept of inductive transfer. Specifically, we introduce a nonparametric hierarchical Bayesian multitask learning approach, based on the notion that human subjects may cluster together forming groups of individuals with similar preference rationale (but not identical preferences). Our approach is facilitated by the utilization of a Dirichlet process prior, which allows for the automatic inference of the most appropriate number of subject groups (clusters), as well as the employment of the automatic relevance determination (ARD) mechanism, giving rise to a sparse nature for our model, which significantly enhances its computational efficiency. We explore the efficacy of our novel approach by applying it to both a synthetic experiment and a real-world music recommendation application. As we show, our approach offers a significant enhancement in the effectiveness of knowledge transfer in statistical preference learning applications, being capable of correctly inferring the actual number of human subject groups in a modeled dataset, and limiting knowledge transfer only to subjects belonging to the same group (wherein knowledge transferability is more likely).

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

preference learning
multitask learning
dirichlet process
automatic relevance determination


About a system of anti-periodic trigonometric functions In this paper we introduce the so-called second kind trigonometric system, which is a useful tool for the representation of 2? 2 ? anti-periodic functions. Using these functions we study a sequence of trigonometric polynomials, which are bi-orthogonal in the Szeg?s sense. We study the usual topics in the theory of Fourier series and we present a new connection with the orthogonal polynomials (OP) on the unit circle and some useful properties like: recurrence relations, kernel representations and a Favards type theorem.

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

orthogonal polynomials on the unit circle


Behavior of (111) grains during the thermal treatment of copper film studied in situ by electron back-scatter diffraction An annealed Cu blanket film was investigated in situ at high temperature using electron back-scatter diffraction (EBSD). The primary aim of the experiment was to study the changes in the (111) texture in the Cu film where the microstructure was already stabilized by previous annealing treatment. Two separate investigations were carried out at the same location of the film for better statistical reliability of data. It was found that the (111) planes got increasingly inclined to the specimen surface with increasing temperature. Additionally, a change in the strength of {111}?110? and {111}?112? texture components was observed with increasing temperature. Absence of these phenomena in freestanding Cu film indicates the impact of substrate on the behavior of (111) grains. The effect of substrate on the peculiar behavior of the (111) grains has been explained by a model which describes the contribution of both dislocations and diffusion to the observed phenomenon. The tilting of the (111) grains is discussed with reference to the recently reported Bauschinger effect in the Cu films.

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


Approximately fair cost allocation in metric traveling salesman games A traveling salesman game is a cooperative game G = ( N, c(D)). Here N, the set of players, is the set of cities ( or the vertices of the complete graph) and cD is the characteristic function where D is the underlying cost matrix. For all S. N, define cD( S) to be the cost of a minimum cost Hamiltonian tour through the vertices of S. {0} where 0 is not an element of. N is called as the home city. Define Core( G) = {x. K vertical bar(N vertical bar) : x( N) = cD( N) and. S. N, x( S) = cD( S)} as the core of a traveling salesman game G. Okamoto ( Discrete Appl. Math. 138: 349 - 369, 2004) conjectured that for the traveling salesman game G = ( N, cD) with D satisfying triangle inequality, the problem of testing whether Core( G) is empty or not is NP-hard. We prove that this conjecture is true. This result directly implies the NP-hardness for the general case when D is asymmetric. We also study approximately fair cost allocations for these games. For this, we introduce the cycle cover games and show that the core of a cycle cover game is non-empty by finding a fair cost allocation vector in polynomial time. For a traveling salesman game, let is an element of- Core( G) = {x is an element of K vertical bar (N vertical bar) : x( N) >= c(D)( N) and. for all S subset of N, x( S) 1. By viewing an approximate fair cost allocation vector for this game as a sum of exact fair cost allocation vectors of several related cycle cover games, we provide a polynomial time algorithm demonstrating the non-emptiness of the log2(vertical bar N vertical bar - 1)- approximate core by exhibiting a vector in this approximate core for the asymmetric traveling salesman game. We improve it further by finding a (4/3 log(3)(vertical bar N vertical bar)+ c)- approximate core in polynomial time for some constant c. We also show that there exists an is an element of(0) > 1 such that it is NP-hard to decide whether is an element of(0)- Core( G) is empty or not.

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

fair cost allocations
traveling salesman game
approximate fair cost allocation

cooperative games
combinatorial optimization


Least

square

fitting

with

one

explicit

parameter

less

It

is

shown

that

whenever

the

multiplicative

normalization

of

a

fitting

function

is

not

known,

least

square

fitting

by

minimization

can

be

performed

with

one

parameter

less

than

usual

by

converting

the

normalization

parameter

into

a

function

of

the

remaining

parameters

and

the

data.

Program

title:

Catalogue

identifier:

Program

summary

Program

obtainable

from:

CPC

Program

Library,

Queens

University,

Belfast,

N.

Ireland

Licensing

provisions:

Standard

CPC

licence,

No.

of

lines

in

distributed

program,

including

test

data,

etc.:

No.

of

bytes

in

distributed

program,

including

test

data,

etc.:

Distribution

format:

tar.gz

Programming

language:

Fortran

with

standard

extensions

(tested

with

on

a

Mac).

Computer:

Any

which

supports

a

Fortran

compatible

compiler.

Operating

system:

Any

with

a

Fortran

compatible

compiler.

RAM:

Mbyte

Classification:

Nature

of

problem:

Least

square

minimization

when

one

of

the

free

parameters

is

the

multiplicative

normalization

of

the

fitting

function.

Solution

method:

Conversion

of

the

normalization

constant

into

a

function

of

the

other

parameters

and

the

data,

resulting

into

one

explicit

fitting

parameter

less.

Running

time:

Less

than

on

modern

PCs

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


Geosheet: A distributed visualization tool for geometric algorithms GeoSheet (version 1.0) is an interactive visualization tool for visualizing geometric algorithms in distributed environments. It provides features such as interactive visualization of program states for debugging, high-level graphical input/output manipulation facilities for geometric objects, reuse of existing data structures and algorithms implementation, and more importantly distributed executions on heterogeneous machines at different sites. To minimize development effort of the tool we make use of existing software packages available in public domain. Specifically we extend Xfig with a message-driven interface and a socket-based interprocess communication (IPC) mechanism. This extended-Xfig is the backbone of this version of the tool. Object-oriented programming methodology is used to construct the visualization interface. By deriving from traditional data type and algorithm libraries, our abstract GeoObject representation super-classes are easy to use, easy to construct, and highly portable. Although GeoSheet is not restricted to a particular application domain or any programming language, this release only contains geometric algorithm implementations in C++ and LEDA. We hope that the geometric algorithm designers will find it useful when they develop their algorithms.

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

geometric computing
objected-oriented programming
x windows
distributed environment


Efficient Abstractions for GPGPU Programming General purpose (GP)GPU programming demands to couple highly parallel computing units with classic CPUs to obtain a high performance. Heterogenous systems lead to complex designs combining multiple paradigms and programming languages to manage each hardware architecture. In this paper, we present tools to harness GPGPU programming through the high-level OCaml programming language. We describe the SPOC library that allows to handle GPGPU subprograms (kernels) and data transfers between devices. We then present how SPOC expresses GPGPU kernel: through interoperability with common low-level extensions (from Cuda and OpenCL frameworks) but also via an embedded DSL for OCaml. Using simple benchmarks as well as a real world HPC software, we show that SPOC can offer a high performance while efficiently easing development. To allow better abstractions over tasks and data, we introduce some parallel skeletons built upon SPOC as well as composition constructs over those skeletons.

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


Current induced along horizontal wire above an imperfectly conducting half-space The boundary element/exponential approximation technique for calculating the loaded straight wire horizontally located above a dissipative half-space is presented. The influence of a lossy ground is taken into account via Sommerfeld integrals appearing within the kernel of the electric field integral equation for thin wire. These integrals are computed by means of the exponential approximation technique. The resulting integral equation for loaded wire above an imperfect earth is solved by the boundary element method. Numerical results are obtained for current distribution along a resistively loaded dipole antenna and along a transmission line of a finite length.

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

sommerfeld integrals
electric field integral equation
boundary element method


Access time minimization for distributed multimedia applications The problem of minimizing the access time of a requested multimedia (MM) document on a network based environment is addressed. A generalized version of this problem is formulated and retrieval strategies that minimize the access time of the user-requested MM document from a pool of MM servers are proposed. To this end, we design single-installment and multi-installment MM document retrieval strategies, through which the minimization of access time can be carried out. The main idea is to utilize more than one MM server in downloading the requested document. Each server assumes the responsibility of uploading a predetermined portion of the entire document in a particular order. Single- and multi-installment strategies differ in the number of disjoint document pieces each server sends to the client. We first introduce a directed flow graph (DFG) model to represent the retrieval process and generate a set of recursive equations using this DFG. Then, we derive closed-form solutions for the portions of the MM document downloaded from the various servers and the corresponding access time. We present rigorous analysis for these two strategies and show their performance under MPEG-I and MPEG-II video streams playback rates. Their behavior under different network bandwidths is also examined, revealing in-depth information about their expected performance. We also show that in the case of a multi-installment strategy, the access time can be completely controlled by fine tuning the number of installments. Since the number of installments is software tunable, the adaptive nature of the strategies to different channel bandwidths is also demonstrated. Important trade-off studies with respect to the number of servers involved in the retrieval process and the number of installments are presented. In the case of a heterogeneous network employing a single-installment strategy, we prove that the access time is independent of the server sequence used. Illustrative examples are provided for ease of understanding.

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

video distribution
bandwidth
sequencing
multi-installments
retrieval schedule


Cross Correlation and Deconvolution of Noise Signals in Randomly Layered Media It is known that cross correlation of waves generated by noise sources, propagating in an unknown medium and recorded by a sensor array, can provide information about the medium. In this paper the medium is a three-dimensional small-scale randomly layered medium with slow macroscopic variations. The main objective here is to set forth a framework for analysis of cross correlations of waves generated by noise sources and propagating in such a medium and, moreover, to use this framework to design estimators for macroscale medium features. The noise sources are located at the bottom of a random medium slab and generate a random wave field that is scattered by the rapid random fluctuations of the medium and then recorded at the surface. Taking into account the pressure release boundary conditions at the surface, this situation corresponds to the so-called daylight configuration. The analysis is carried out in the asymptotic framework where the typical wavelength is small compared to the scale of the macroscopic variations of the background medium and large compared to the decoherence length of the microscopic random fluctuations of the medium. It is shown that the cross correlation of the waves recorded at the surface contains statistically stable information about the macroscopic background medium.

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


Using centrality indices in Ant Systems Lately, much attention has been posited on evolutionary strategies that bring together self-organizing systems and nature selection inspired methods. Among these, Ant Colony Optimization algorithms have been suggested by the foraging behaviour of real ants. They can solve any optimization problem involving complex and heterogenous nodes, so these algorithms have been used to obtain solutions for many real-world problems. This paper presents some conclusions on introducing centrality indices as heuristics in Ant Systems.

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


Optimal policies in continuous time inventory control models with limited supply In this paper, we deal with the problem of a fixed number of units of a certain perishable commodity over a continuous time horizon. Airline seats, hotel rooms, advertising space in newspapers, and some seasonal products that must be sold before the end of the season are examples of such commodities that cannot be carried over and are not storable for consumers. This paper considers such a problem of continuous time perishable inventory control by applying semi-Markov decision processes over a finite time horizon. It is shown that there is an optimal policy that is simple and stationary. Furthermore, some analytical properties of this optimal policy and its value function are explored under certain specific assumptions. (C) 2003 Elsevier Ltd. All rights reserved.

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

perishable products
yield management
semi-markov decision
contraction mapping


FreeRec: an anonymous and distributed personalization architecture We present and evaluate FreeRec, an anonymous decentralized peer-to-peer architecture, designed to bring personalization while protecting the privacy of its users. FreeRecs decentralized approach makes it independent of any entity wishing to collect personal data about users. At the same time, its onion-routing-like gossip-based overlay protocols effectively hide the association between users and their interest profiles without affecting the quality of personalization. The core of FreeRec consists of three layers of overlay protocols: the bottom layer, rps, consists of a standard random peer sampling protocol ensuring connectivity; the middle layer, PRPS, introduces anonymity by hiding users behind anonymous proxy chains, providing mutual anonymity; finally, the top clustering layer identifies for each anonymous user, a set of anonymous nearest neighbors. We demonstrate the effectiveness of FreeRec by building a decentralized and anonymous content dissemination system. Our evaluation by simulation, our PlanetLab experiments, and our probabilistic analysis show that FreeRec effectively decouples users from their profiles without hampering the quality of personalized content delivery.

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

distributed system
recommendation system
anonymous system
gossip
68m10 network design and communication
68m14 distributed systems


Visual speech synthesis by morphing visemes We present MikeTalk, a text-to-audiovisual speech synthesizer which converts input text into an audiovisual speech stream. MikeTalk is built using visemes, which are a small set of images spanning a large range of mouth shapes. The visemes are acquired from a recorded visual corpus of a human subject which is specifically designed to elicit one instantiation of each viseme. Using optical flow methods, correspondence from every viseme to every other viseme is computed automatically. By morphing along this correspondence, a smooth transition between viseme images may be generated. A complete visual utterance is constructed by concatenating viseme transitions. Finally, phoneme and timing information extracted from a text-to-speech synthesizer is exploited to determine which viseme transitions to use, and the rate at which the morphing process should occur. In this manner, we are able to synchronize the visual speech stream with the audio speech stream, and hence give the impression of a photorealistic talking face.

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

computer vision
machine learning
facial modelling
facial animation
lip synchronization


An extended growing self-organizing map for selection of clusters in sensor networks Sensor networks consist of wireless enabled sensor nodes with. limited energy. As sensors could be deployed in a large area, data transmitting and receiving art, energy consuming operations. One of the methods to save energy is to reduce the communication distance of each node by grouping them in to clusters. Each cluster will have a cluster-head (CH), which will communicate with all the other nodes of that cluster and transmit the data to the remote base station. In this paper, we propose an extension to Growing Self-Organizing Map (GSOM) and describe the use of evolutionary computing technique to cluster wireless sensor nodes and to identify the cluster-heads. We compare the proposed method with clustering solutions based on Genetic Algorithm (GA), an extended version of Particle Swarm Optimisation (PSO) and four general purpose clustering algorithms. This could help to discover the clusters to reduce the communication energy, used to transmit data when exact locations of all sensors are known and computational resources are centrally available. This method is useful in the applications where sensors are deployed in a controlled environment and are not moving. We have derived an energy minimisation model that is used as a criterion for clustering. The proposed method can also be used as a design tool to study and analyze the cluster formation for a given node placement.

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


Dynamic finite element model of oscillatory brushes In this work, the concept of oscillatory brushes is studied. The main aims are to develop a generic, dynamic finite element model of oscillatory brushes and to study the effects of brush oscillations on the dynamics and performance of a cup-shaped brush, which may be used for street sweeping. The model entails a transient nonlinear analysis, involving three-dimensional large deflections and contact between bristles and surface and between bristles. An exponential friction model is assumed, and the damping generated by internal friction and bristlebristle contact is modelled as Rayleigh damping. Existing experimental results on gutter brushes are used to validate the model and determine the coefficient of friction for bristlesurface interaction. The model is also validated through another finite element model derived by the authors. The Rayleigh damping coefficients and the normal contact stiffness for bristlesurface interaction have been obtained by means of experimental tests. The model is applied to study the behaviour of a horizontal gutter brush with a bristle mount orientation angle of 128. In order to assess brushing performance, a number of performance criteria are proposed. It is concluded that brush oscillations significantly affect brush dynamics and tend to increase bristle tip velocities and brushing forces. According to the model and the performance criteria defined, brush oscillations may improve sweeping effectiveness for certain ranges of frequency of oscillation.

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

finite element method (fem)
transient analysis
contact elements
inertia loads


Enhancing ontology-based antipattern detection using Bayesian networks Antipatterns provide information on commonly occurring solutions to problems that generate negative consequences. The antipattern ontology has been recently proposed as a knowledge base for SPARSE, an intelligent system that can detect the antipatterns that exist in a software project. However, apart from the plethora of antipatterns that are inherently informal and imprecise, the information used in the antipattern ontology itself is many times imprecise or vaguely defined. For example, the certainty in which a cause, symptom or consequence of an antipattern exists in a software project. Taking into account probabilistic information would yield more realistic, intelligent and effective ontology-based applications to support the technology of antipatterns. However, ontologies are not capable of representing uncertainty and the effective detection of antipatterns taking into account the uncertainty that exists in software project antipatterns still remains an open issue. Bayesian Networks (BNs) have been previously used in order to measure, illustrate and handle antipattern uncertainty in mathematical terms. In this paper, we explore the ways in which the antipattern ontology can be enhanced using Bayesian networks in order to reinforce the existing ontology-based detection process. This approach allows software developers to quantify the existence of an antipattern using Bayesian networks, based on probabilistic knowledge contained in the antipattern ontology regarding relationships of antipatterns through their causes, symptoms and consequences. The framework is exemplified using a Bayesian network model of 13 antipattern attributes, which is constructed using BNTab, a plug-in developed for the Protege ontology editor that generates BNs based on ontological information.

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

bayesian networks
ontology
antipatterns
antipattern detection


On the convex formulation of area for slicing floorplans We proved that the area of a compact slicing floorplan is convex. The proof is done without any assumption on constant area. Cases with and without empty space are included in the proof. Layouts with symmetry and proximity constraints are analyzed.

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

layout for analog circuits
area optimization
convexity of area


A scaling theory for fully-depleted, surrounding-gate MOSFETs: including effective conducting path effect A scaling theory for fully-depleted surrounding-gate (SG) MOSFETs is derived, which gives a basic idea how the effective conducting path affects the scaling theory. By investigating the subthreshold conducting phenomenon of SG MOSFETs, the effective conducting path effect (ECPE) is employed to obtain the natural length ?4 which is relevant to the scaling equation. With various substrate concentrations, the minimum channel potential ?deff,min ? d eff , min induced by effective conducting path shows the novel scaling factor ?4. Compared to conventional scaling rule, our model accounts for doping effect and hence provides a unified scaling rule for fully-depleted SG SOI MOSFETs.

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

sg mosfets
effective conducting path effect
scaling factor
natural length


The application of workflow technology in semantic B2B integration Workflow Management Systems (WFMSs) are often used in context of B2B integration as a base technology to implement business-to-business (B2B) integration processes across enterprises. In this context the notion of "distributed inter-organizational workflows" is introduced to indicate the collaboration of enterprises on a process level. This notion requires a thorough examination presented in this article since WFMSs were not designed with inter-enterprise distribution as one of the design goals. At a closer look, the proposed use of WFMSs in context of B2B integration is often very naive and inappropriate. Consequently it does not address the real requirements found in enterprises. Enterprises do not share common workflow definitions, let alone common workflow instance execution state and have no intent to do so due to competitive knowledge protection. Furthermore, trading partner specific business rules within enterprises are not accounted for leading to an unwanted "explosion" of workflow definitions. This article clarifies the notion of "distributed inter-organizational workflows" as well as private and public processes. Based on this definition, the appropriate use of WFMSs is shown in context of an overall B2B integration solution that allows enterprises to protect their competitive knowledge while participating in B2B integration.

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

business-to-business integration
private and public process
transformation
message exchange patterns
b2b standards


Proportional lot sizing and scheduling: Some extensions This contribution generalizes the work of Drexl and Haase about the so-called proportional lot sizing and scheduling problem which was published in 1995. While the early paper considered single-level cases only, the paper at hand describes multilevel problems, i.e., items are interconnected via a directed network of acyclic precedence constraints, It provides mixed-integer programs for several important extensions which differ in the allocation of resources. A generic solution method is presented, and following the preceding paper, a randomized regret-based sampling method is tested. A computational study proves that, even for the multilevel case which is far more complex than the single-level problem, promising results are obtained. (C) 1998 John Wiley & Sons, Inc.

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

multilevel lot sizing
plsp
precedence networks
random sampling


Real-time application mapping for many-cores using a limited migrative model Many-core platforms are an emerging technology in the real-time embedded domain. These devices offer various options for power savings, cost reductions and contribute to the overall system flexibility, however, issues such as unpredictability, scalability and analysis pessimism are serious challenges to their integration into the aforementioned area. The focus of this work is on many-core platforms using a limited migrative model (\( LMM \)). \( LMM \) is an approach based on the fundamental concepts of the multi-kernel paradigm, which is a promising step towards scalable and predictable many-cores. In this work, we formulate the problem of real-time application mapping on a many-core platform using \( LMM \), and propose a three-stage method to solve it. An extended version of the existing analysis is used to assure that derived mappings (i) guarantee the fulfilment of timing constraints posed on worst-case communication delays of individual applications, and (ii) provide an environment to perform load balancing for e.g. energy/thermal management, fault tolerance and/or performance reasons.

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

real-time systems
embedded systems
multiprocessors
many-core systems
worst-case analysis


A treatment of the quantum partial entropies in the atom-field interaction with a class of Schrodinger cat states This paper is an enquiry into the circumstances under which entropy and subentropy methods can give an answer to the question of quantum entanglement in the composite state. Using a general quantum dynamical system, we obtain the analytical solution when the atom initially starts from its excited state and the field in different initial states. Different features of the entanglement are investigated when the field is initially assumed to be in a coherent state, an even coherent state (Schrodinger cate state), and a statistical mixture of coherent states. Our results show that the setting of the initial state and the Stark shift play important roles in the evolution of the sub-entropies and entanglement.

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

schrodinger's cat
multi-photon processes


A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion This paper presents a hybrid discrete differential evolution (HDDE) algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion, which is not so well studied. The no-idle condition requires that each machine must process jobs without any interruption from the start of processing the first job to the completion of processing the last job. A novel speed-up method based on network representation is proposed to evaluate the whole insert neighborhood of a job permutation and employed in HDDE, and moreover, an insert neighborhood local search is modified effectively in HDDE to balance global exploration and local exploitation. Experimental results and a thorough statistical analysis show that HDDE is superior to the existing state-of-the-art algorithms by a significant margin.

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

scheduling
differential evolution
insert neighborhood
local search


Retrieval of images using rich-region descriptions Retrieval of images from databases using their visual features is a challenging and important problem. While the technical problem shares some aspects of image analysis with image understanding, the goal is not to obtain a correct interpretation of the image but to enhance the recall and precision of retrieval. The dominant visual features of an image depend on subjective interpretations and can vary from user to user. We present a technique to improve recall in region-based retrieval; the method is based upon a family of representations of images called 'rich-region descriptions'. We show in a simple experiment how this kind of representation can improve the flexibility allowed to users in obtaining desired results. We also discuss issues related to the user interface for segmentation and query systems. In this subject, the paper extends a previous work. (C) 2000 Academic Press.

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

content query
image database
regions
matching
similarity
distance
rich-region description


Morphological color image simplification by saturation-controlled regional levelings This paper deals with color image simplification using levelings. This class of connected filters suppresses details but preserves the contours of the remaining structures or objects. As the notion of "color structure" is not trivial, the formulation of morphological operators for color images involves many open issues. The principle choice of a well-defined color space is crucial and it is proposed to work on a luminance/saturation/hue representation defined by the norm L(1). A family of morphological color operators is then introduced using the classical formulation with total orderings by means of lexicographic cascades. In this framework, a methodology for color image simplification is introduced, which takes advantage of a saturation-controlled combination of the chromatic and the achromatic (or the spectral and the spatio-geometric) components. More precisely, it is based on the application of a color leveling to each significant region, specifically adapted to the nature (chromatic/achromatic) of the region and which needs an initial image partition into the homogenous regions. Experimental results illustrate the performance of the new developed algorithms.

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

mathematical morphology
lum/sat/hue
color connected filtering
morphological color segmentation
lexicographical ordering


A program for accurate solutions of two-electron atoms We present a comprehensible computer program capable of treating non-relativistic ground and excited states for a two-electron atom having infinite nuclear mass. An iterative approach based on the implicitly restarted Arnoldi method (IRAM) is employed. The Hamiltonian matrix is never explicitly computed. Instead the action of the Hamiltonian operator on discrete pair functions is implemented. The finite difference method is applied and subsequent extrapolations gives the continuous grid result. The program is written in C and is highly optimized. All computations are made in double precision. Despite this relatively low degree of floating point precision (48 digits are not uncommon), the accuracy in the results can reach about 10 significant figures. Both serial and parallel versions are provided. The parallel program is particularly suitable for shared memory machines such as the Sun Starcat series. The serial version is simple to compile and should run on any platform.

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

two-electron schrodinger equation
iterative methods
mpi


A Novel Forwarding Algorithm Using Prediction and Optimization Theory over Multipath Network In this work, a novel data forwarding algorithm based on prediction method and optimization theory is proposed for improving the quality of service (QoS) in real-time applications, in particular over the multipath network. The proposed prediction method is based on the time-series models of observed trends over all available paths at each pre-determined time. This predictive information is then used as an input for the forwarding decision. The forwarding algorithm is meant to minimize the packet loss rate by adjusting the forwarding rate of packets over each path for next prediction period by PSO (particle swarm optimization). To avoid solutions that operate near the capacity of the links and shift flows to less utilized links where they can increase more freely, the optimization problem also introduce the cost function. Numerical experiments with packet loss rate-sensitive traffic show that the optimal objective converges quickly to the optimal values. It demonstrates that running the proposed algorithm over multipath network can be more efficient and more flexible than equal cost multipath protocol.

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

forwarding algorithm
optimization theory
prediction


formal and graphical annotations for digital objects This paper presents graphical tools that facilitate manual building of formal semantic annotations for digital objects. These tools are intended to be integrated in digital object (DO) management systems requiring semantic metadata (e.g. precise indexation, comment, categorization, certification). We define a multidimensional graphical model of semantic annotations that specifically allows contextualization of annotations, and we propose a methodology for building such annotations. The graph-based formalism used (derived from Conceptual Graphs), provides graphical representations that users can easily understand, and are furthermore logically founded. A graphical generic API implementing elements of the SG family has been developed. CoGUI consists of three specialized tools: a tool for defining a CG ontology, another for creating annotations based on a CG ontology, and finally a tool that uses the CoGITaNT platform, for querying an annotated DO base.

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

semantic annotation
knowledge representation


Influence of proceedings papers on citation impact in seven sub-fields of sustainable energy research 20052011 This paper analyses the following seven sub-fields of Sustainable Energy Research with respect to the influence of proceedings papers on citation patterns across citing and cited document types, overall sub-field and document type impacts and citedness: the Wind Power, Renewable Energy, Solar and Wave Energy, Geo-thermal, Bio-fuel and Bio-mass energy sub-fields. The analyses cover peer reviewed research and review articles as well as two kinds of proceeding papers from conferences published 20052009 in (a) book series or volumes and (b) special journal issues excluding meeting abstracts cited 20052011 through Web of Science. Central findings are: The distribution across document types of cited versus citing documents is highly asymmetric. Predominantly proceedings papers from both proceeding volumes as well as published in journals cite research articles (6076%). Largely, journal-based proceedings papers are cited rather than papers published in book series or volumes and have field impacts corresponding to research articles. With decreasing proceedings paper dominance in research fields the ratio of proceeding paper volumes over journal-based proceedings papers decreases significantly and the percentage of proceedings papers in journals citing journal-based proceedings papers over all publications citing journal-based proceedings papers decreases significantly (from 26.3% in Wind Power to 4% in Bio Fuel). Further, the segment of all kinds of proceedings papers (the combined proceedings paper types) citing all proceedings papers over all publications citing all kinds of proceedings papers decreases significantly (from 36.1% in Wind Power to 11.3% in Bio Fuel). Simultaneously the field citedness increases across the seven research fields. The distribution of citations from review articles shows that novel knowledge essentially derives directly from research articles (5372%)to a much less extent from proceedings publications published in journals (913%).

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

document types
proceedings papers
research articles
review articles
citation impact
citedness
sustainable energy research


Comparative Proteomic Analysis of Antibiotic-Sensitive and Insensitive Isolates of Orientia tsutsugamushi Scrub typhus, caused by infection with Orientia tsutsugamushi, is probably the most common severe rickettsial disease. Early diagnosis followed by treatment with antibiotics such as doxycycline or chloramphenicol usually quickly decreases fever in patients, and they often recover well from other symptoms of the disease. However, poorly responsive cases have been reported from northern Thailand and southern India. In order to identify protein factors that may be partially responsible for differential drug sensitivity of isolates of Orientia, we compared the protein profiles of doxycycline sensitive (Karp) versus (vs.) insensitive (AFSC4 and AFSC7) isolates. Tryptic peptides from both total water-soluble proteins and from protein spots separated by 2D-PAGE were analyzed using LC-MS/MS. The identity of each protein was established using the published genomic sequence of Boryong strain O. tsutsugamushi. The profiles of protein released into water from these isolates were quite different. There were 10 proteins detected only in AFSC4, 3 only in Karp, and 1 only in AFSC7. Additionally, there were 2 proteins not detected only in AFSC4, 4 not found only in Karp, and 3 not found only in AFSC-7. A comparison of 2D-PAGE protein profiles of drug sensitive strain versus (vs.) insensitive isolates has led to the identification of 14 differentially expressed or localized proteins, including elongation factor Ts and Tu, DNA-directed RNA polymerase ?-subunit, ATP synthase ?-subunit, and several hypothetical proteins. These data confirm the tremendous proteomic diversity of isolates of Orientia and suggest that drug insensitivity in this species may arise from multiple mechanisms.

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


Risk Assessment for One-Counter Threads Threads as contained in a thread algebra are used for the modeling of sequential program behavior. A thread that may use a counter to control its execution is called a 'one-counter thread'. In this paper the decidability of risk assessment (a certain form of action forecasting) for one-counter threads is proved. This relates to Cohen's impossibility result on virus detection (Comput. Secur. 6(1), 22-35, 1984). Our decidability result follows from a general property of the traces of one-counter threads: if a state is reachable from some initial state, then it is also reachable along a path in which all counter values stay below a fixed bound that depends only on the initial and final counter value. A further consequence is that the reachability of a state is decidable. These properties are based on a result for omega-one counter machines by Rosier and Yen (SIAM J. Comput. 16(5), 779-807, 1987).

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

thread algebra
reachability
risk assessment


A Survey of SOA Technologies in NGN Network Architectures The SOA (Service Oriented Architecture) paradigm has been driving the definition of important technologies in the telecommunication field for the last decade, as it fosters the deployment of reusable components to support efficient seamless services across different networks. Most of these technologies have focused on the definition of high-level network service interfaces and functionalities, such as Parlay-X and IMS, guaranteeing the success of the SOA model in the telco market after that of web applications. Some works proposing the adoption of this model in the lower network layers have also been proposed, but they have not proved to have the same impact yet. This paper intends to provide the reader with a survey of the works that have been proposed in this field by following the NGN (Next Generation Network) functional architecture as defined by the ITU-T. Specifically, we focus on the service and transport strata of the NGN model and, within each of these, we highlight the main logic functions that have been the subject of investigation according to a service-oriented approach. From the literature review, it can be seen that most of the works fall in service stratum, mostly because of the need for an easy integration of distributed service components at this layer. Only a few papers focus on the transport functionalities, where the benefits of applying the SOA paradigm still need to be investigated.

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

service oriented architecture (soa)
web services
next generation networks (ngn)


A linear-time algorithm to find independent spanning trees in maximal planar graphs Given a graph G: a designated vertex r and a natural number k, we wish to iind k "independent" spanning trees of G rooted at r, that is, k spanning trees such that, for any vertex rr, the k paths connecting r and v in the k trees are internally disjoint in G. In this paper we give a linear-time algorithm to find I; independent spanning trees in a k-connected maximal planar graph rooted at any designated vertex.

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

graph
algorithm
independent spanning trees


Genetically optimized fuzzy polynomial neural networks with fuzzy set-based polynomial neurons In this paper, we propose and investigate a new category of neurofuzzy networksfuzzy polynomial neural networks (FPNN) endowed with fuzzy set-based polynomial neurons (FSPNs) We develop a comprehensive design methodology involving mechanisms of genetic optimization, and genetic algorithms (GAs) in particular. The conventional FPNNs developed so far are based on the mechanisms of self-organization, fuzzy neurocomputing, and evolutionary optimization. The design of the network exploits the FSPNs as well as the extended group method of data handling (GMDH). Let us stress that in the previous development strategies some essential parameters of the networks (such as the number of input variables, the order of the polynomial, the number of membership functions, and a collection of the specific subset of input variables) being available within the network are provided by the designer in advance and kept fixed throughout the overall development process. This restriction may hamper a possibility of developing an optimal architecture of the model. The design proposed in this study addresses this issue. The augmented and genetically developed FPNN (gFPNN) results in a structurally optimized structure and comes with a higher level of flexibility in comparison to the one we encounter in the conventional FPNNs. The GA-based design procedure being applied at each layer of the FPNN leads to the selection of the most suitable nodes (or FSPNs) available within the FPNN. In the sequel, two general optimization mechanisms are explored. First, the structural optimization is realized via GAs whereas the ensuing detailed parametric optimization is carried out in the setting of a standard least square method-based learning. The performance of the gFPNN is quantified through experimentation in which we use a number of modeling benchmarkssynthetic and experimental data being commonly used in fuzzy or neurofuzzy modeling. The obtained results demonstrate the superiority of the proposed networks over the models existing in the references.

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

genetically optimized fuzzy polynomial neural networks (gfpnn)

fuzzy set-based polynomial neuron (fspn)


Contact end resistance test structure applied for nanocontact measurements This paper presents an accurate method and test structure to evaluate ohmic nanocontacts. The procedure permits the characterization of the contact resistance between standard-in-microtechnology interconnect lines and a certain nanoscaled-in-width object. It is based on the adaption of the classic contact end resistance structure used for the measurement of the contact end resistance in microelectronic technologies. After the theoretical model study, the methodology is validated for the single-walled carbon nanotube case.

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

nanocontact
contact resistance
test structure


Robust object tracking using least absolute deviation ? The representation error is modelled as a Laplacian distribution. We derive our new LADLasso model based on a Bayesian MAP estimate. LADLasso model is robust to outliers. The number of optimisation variable in the new model reduces greatly. We use ADMM algorithm to solve the new optimisation problem.

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

object tracking
least absolute deviation


DTRAB: Combating Against Attacks on Encrypted Protocols Through Traffic-Feature Analysis The unbridled growth of the Internet and the network-based applications has contributed to enormous security leaks. Even the cryptographic protocols, which are used to provide secure communication, are often targeted by diverse attacks. Intrusion detection systems (IDSs) are often employed to monitor network traffic and host activities that may lead to unauthorized accesses and attacks against vulnerable services. Most of the conventional misuse-based and anomaly-based IDSs are ineffective against attacks targeted at encrypted protocols since they heavily rely on inspecting the payload contents. To combat against attacks on encrypted protocols, we propose an anomaly-based detection system by using strategically distributed monitoring stubs (MSs). We have categorized various attacks against cryptographic protocols. The MSs, by sniffing the encrypted traffic, extract features for detecting these attacks and construct normal usage behavior profiles. Upon detecting suspicious activities due to the deviations from these normal profiles, the MSs notify the victim servers, which may then take necessary actions. In addition to detecting attacks, the MSs can also trace back the originating network of the attack. We call our unique approach DTRAB since it focuses on both Detection and TRAceBack in the MS level. The effectiveness of the proposed detection and traceback methods are verified through extensive simulations and Internet datasets.

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

encrypted protocol (cryptographic protocol)


improved video categorization from text metadata and user comments We consider the task of assigning categories (e.g., howto/cooking, sports/basketball, pet/dogs) to YouTube videos from video and text signals. We show that two complementary views on the data -- from the video and text perspectives -- complement each other and refine predictions. The contributions of the paper are threefold: (1) we show that a text-based classifier trained on imperfect predictions of the weakly supervised video content-based classifier is not redundant; (2) we demonstrate that a simple model which combines the predictions made by the two classifiers outperforms each of them taken independently; (3) we analyse such sources of text information as video title, description, user tags and viewers' comments and show that each of them provides valuable clues to the topic of the video.

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

natural language processing
video classification


Inhibitory connections in the assembly neural network for texture segmentation A neural network with assembly organization is described. This assembly network is applied to the problem of texture segmentation in natural scenes. The network is partitioned into several subnetworks: one for each texture class. Hebb's assemblies are formed in the subnetworks during the process of training the excitatory connections. Also, a structure of the inhibitory connections is formed in the assembly network during a separate training process. The inhibitory connections result in inhibitory interactions between different subnetworks. Computer simulation of the network has been performed. Experiments show that an adequately trained assembly network with inhibitory connections is more efficient than without them.

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

excitatory connections
inhibitory connections
subnetworks
texture segmentation

connection matrix
negative features
neural assemblies
neurons


high occupancy vehicle lane performance assessment through operational, environmental impacts and cost-benefit analyses High Occupancy Vehicle (HOV) lanes are in operation in the U.S. for more than 30 years and used as a tool to alleviate urban freeway congestion. For new HOV projects a need exists to study the feasibility of implementation as well as assess their potential operational and environmental impacts prior to deployment. Equally important is to obtain a clear picture of expected cost and benefits of available options in order to determine the most effective strategy for implementation. This paper reports on a study that was undertaken to determine the need for and impact from the potential deployment of HOV lanes in Birmingham, Alabama. To meet the study objectives, a detailed alternatives analysis and cost-benefit analysis were performed using Traffic Software Integrated System (TSIS) and Integrated Development Assessment System (IDAS) respectively. Three different scenarios and a total of ten options were considered to quantify the operational, environmental, and economic impacts of HOV lanes on traffic operations. The paper provides background information on the models used, data gathered, assumptions made, and outputs obtained. A detailed description of the analysis and results is also presented.

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

traffic operations
environmental impacts
hov

high occupancy vehicle lanes
cost-benefits analysis
traffic management


Local systemic intervention This paper reviews Local Systemic Intervention (LSI). LSI results from learning about Total Systems Intervention (TSI). Learning followed application of TSI and by putting TSI through a postmodern critique. LSI is a complementarist approach. It encourages diversity through local decision making about the relevance of designs, consideredness of decisions and astuteness of judgements. It encourages developing discourse around these three centres of learning and designing action accordingly. There is a regular stream of applications of LSI in many types of organisations.

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

management
organisation
total systems intervention


Clustering by Sorting Potential Values (CSPV): A novel potential-based clustering method A novel clustering method called Clustering by Sorting Potential Values (CSPV) is proposed. The clustering is done in an efficient tree-growing fashion based on both the distances and the hypothetical potential values produced from the distribution of all the data points. The method is simple but is shown to be very effective in identifying different kinds of clusters. It outperforms four popular clustering methods in most of our experiments and is the only one that works for all the six studied data sets. Moreover, it is designed as a generic method which can be easily applied to different clustering problems.

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

potential field
spatial distribution
distance matrix
pattern recognition


active learning for automatic classification of software behavior A program's behavior is ultimately the collection of all its executions. This collection is diverse, unpredictable, and generally unbounded. Thus it is especially suited to statistical analysis and machine learning techniques. The primary focus of this paper is on the automatic classification of program behavior using execution data. Prior work on classifiers for software engineering adopts a classical batch-learning approach. In contrast, we explore an active-learning paradigm for behavior classification. In active learning, the classifier is trained incrementally on a series of labeled data elements. Secondly, we explore the thesis that certain features of program behavior are stochastic processes that exhibit the Markov property, and that the resultant Markov models of individual program executions can be automatically clustered into effective predictors of program behavior. We present a technique that models program executions as Markov models, and a clustering method for Markov models that aggregates multiple program executions into effective behavior classifiers. We evaluate an application of active learning to the efficient refinement of our classifiers by conducting three empirical studies that explore a scenario illustrating automated test plan augmentation.

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

empirical studies
scenario
plan
markov models
software behavior
paper
statistical analysis
software engineering
classification
machine learning
method
test
behavior
data
active learning

applications
efficiency
collect
stochastic process
model
automation
evaluation
exploration
software testing
software
aggregate
classifiation
refine
feature
effect
cluster


Mathematical modeling of chemical oil-soluble transport for water control in porous media High water-cut is a long-standing problem in the upstream petroleum industry. Typically one-fourth of the produced fluids from oil wells worldwide are hydrocarbons and the remaining is water. Self-selective in-situ gel formation is a new potential technology to decrease the production of water from oil reservoirs. In this method an oil-soluble chemical is being injected in the reservoir. The chemical, which in this case is tetra-methyl-ortho-silicate or tetramethoxysilane (TMOS) reacts with water and ultimately results in the formation of a semi-rigid gel in the water phase. Due to this gelation, the relative permeabilities of the formation to water and oil change in favor of the oil phase; therefore the ultimate effect of this gelation is a reduction of the water production rate from the reservoir. The subject of this paper was to model the flow of TMOS in a core, including the mass transfer of TMOS from oil phase to the water phase, and the occurring chemical reaction in the water phase.

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

tetra-methyl-ortho-silicate or tetramethoxysilane (tmos)


Virtual scan chains reordering using a RAM-based module for high test compression Scan chain reordering could be used for test compression by making the corresponding test set more easily compressed. However, it may adversely affect scan chain routing by creating very long routing path and modifying signal delays. The paper proposes a virtual scan chain reorder technique which targets on test compression. The approach simply uses a RAM-based module to control the orders of scan cells in circuits. To achieve high test compression, the scan cells can be virtually arranged into any order for different compression schemes. It does not do any real modification to scan chains, and has no any scan chain routing costs. Experimental results show that the proposed method can raise the compression ratio efficiently.

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


Fidelity of Network Simulation and Emulation: A Case Study of TCP-Targeted Denial of Service Attacks In this article, we investigate the differences between simulation and emulation when conducting denial of service (DoS) attack experiments. As a case study, we consider low-rate TCP-targeted DoS attacks. We design constructs and tools for emulation testbeds to achieve a level of control comparable to simulation tools. Through a careful sensitivity analysis, we expose difficulties in obtaining meaningful measurements from the DETER, Emulab, and WAIL testbeds with default system settings. We find dramatic differences between simulation and emulation results for DoS experiments. Our results also reveal that software routers such as Click provide a flexible experimental platform, but require understanding and manipulation of the underlying network device drivers. Our experiments with commercial Cisco routers demonstrate that they are highly susceptible to the TCP-targeted attacks when ingress/egress IP filters are used.

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

simulation
emulation
testbeds
denial of service attacks

tcp
congestion control
low-rate tcp-targeted attacks


A fully-coupled upwind discontinuous Galerkin method for incompressible porous media flows: High-order computations of viscous fingering instabilities in complex geometry ? We present a new approach to the simulation of viscous fingering instabilities in incompressible, miscible displacement flows in porous media. In the past, high resolution computational simulations of viscous fingering instabilities have always been performed using high-order finite difference or Fourier-spectral methods which do not posses the flexibility to compute very complex subsurface geometries. Our approach, instead, by means of a fully-coupled nonlinear implementation of the discontinuous Galerkin method, possesses a fundamental differentiating feature, in that it maintains high-order accuracy on fully unstructured meshes. In addition, the proposed method shows very low sensitivity to mesh orientation, in contrast with classical finite volume approximation used in porous media flow simulations. The robustness and accuracy of the method are demonstrated in a number of challenging computational problems.

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

viscous fingering
discontinuous galerkin method
porous media flows


Algorithms for processing K-closest-pair queries in spatial databases This paper addresses the problem of finding the K closest pairs between two spatial datasets (the so-called, K closest pairs query, K-CPQ), where each dataset is stored in an R-tree. There are two different techniques for solving this kind of distance-based query. The first technique is the incremental approach, which returns the output elements one-by-one in ascending order of distance. The second one is the non-incremental alternative, which returns the K elements of the result all together at the end of the algorithm. In this paper, based on distance functions between two MBRs in the multidimensional Euclidean space, we propose a pruning heuristic and two updating strategies for minimizing the pruning distance, and use them in the design of three non-incremental branch-and-bound algorithms for K-CPQ between spatial objects stored in two R-trees. Two of those approaches are recursive following a Depth-First searching strategy and one is iterative obeying a Best-First traversal policy. The plane-sweep method and the search ordering are used as optimization techniques for improving the naive approaches. Besides, a number of interesting extensions of the K-CPQ (K-Self-CPQ, Semi-CPQ, K-FPQ (the K-farthest pairs query), etc.) are discussed. An extensive performance study is also presented. This study is based on experiments performed with real datasets. A wide range of values for the basic parameters affecting the performance of the algorithms is examined in order to designate the most efficient algorithm for each setting of parameter values. Finally, an experimental study of the behavior of the proposed K-CPQ branch-and-bound algorithms in terms of scalability of the dataset size and the K value is also included.

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

branch-and-bound algorithms
query processing
r-tree
distance join
i/o and response time performance


Particle swarm optimisation for discrete optimisation problems: a review In many optimisation problems, all or some of decision variables are discrete. Solving such problems are more challenging than those problems with pure continuous variables. Among various optimisation techniques, particle swarm optimisation (PSO) has demonstrated more promising performance in tackling discrete optimisation problems. In PSO, basic variants are merely applicable to continuous problems. So, appropriate strategies should be adopted for enabling them to be applicable to discrete problems. This paper analyses all strategies adopted in PSO for tackling discrete problems and discusses thoroughly about pros and cons of each strategy.

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

particle swarm optimisation
optimisation


Visual analysis for textual relationships in digital forensic evidence We present a visual analytics framework for exploring the textual relationships in computer forensics. Based on a task analysis study performed with practitioners, our tool addresses the inefficiency of searching for related text documents on a hard drive. Our framework searches both allocated and unallocated sectors for text and performs some pre-analysis processing; this information is then presented via a visualization that displays both the frequency of relevant terms and their location on the disk. We also present a case study that demonstrates our framework's operation, and we report on an informal evaluation conducted with forensics analysts from the Mississippi State Attorney General's Office and National Forensics Training Center. Information Visualization (2011) 10, 134-144. doi: 10.1057/ivs.2010.15

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

computer forensics
visualization
visual analytics


The virtual wall approach to limit cycle avoidance for unmanned ground vehicles ? Robot Navigation in unknown and very cluttered environments constitutes one of the key challenges in unmanned ground vehicle (UGV) applications. Navigational limit cycles can occur when navigating (UGVs) using behavior-based or other reactive algorithms. Limit cycles occur when the robot is navigating towards the goal but enters an enclosure that has its opening in a direction opposite to the goal. The robot then becomes effectively trapped in the enclosure. This paper presents a solution named the Virtual Wall Approach (VWA) to the limit cycle problem for robot navigation in very cluttered environments. This algorithm is composed of three stages: detection, retraction, and avoidance. The detection stage uses spatial memory to identify the limit cycle. Once the limit cycle has been identified, a labeling operator is applied to a local map of the obstacle field to identify the obstacle or group of obstacles that are causing the deadlock enclosure. The retraction stage defines a waypoint for the robot outside the deadlock area. When the robot crosses the boundary of the deadlock enclosure, a virtual wall is placed near the endpoints of the enclosure to designate this area as off-limits. Finally, the robot activates a virtual sensor so that it can proceed to its original goal, avoiding the virtual wall and obstacles found on its way. Simulations, experiments, and analysis of the VWA implemented on top of a preference-based fuzzy behavior system demonstrate the effectiveness of the proposed method.

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


Dynamic parts scheduling in multiple job shop cells considering intercell moves and flexible routes Aiming at the problem of scheduling with flexible processing routes and exceptional parts that need to visit machines located in multiple job shop cells, a pheromone based approach (PBA) using multi-agent is presented in this paper, in which various types of pheromone inspired by ant colony optimization (ACO) are adopted as the basis of negotiation among agents. By removing redundant routes and constructing coalition agents, communication cost and negotiation complexity are reduced, and more importantly, the global performance of scheduling is improved. The performance of the PBA is evaluated via experiments with respect to the mean flow time, maximum completion time, mean tardiness, ratio of tardy parts, and ratio of intercell moves. Computational results show that compared with various heuristics, the PBA has significant advantages with respect to the performance measures considered in this paper. Crown Copyright (C) 2012 Published by 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 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

part scheduling
intercell move
flexible route
multi-agent system


Renal cell carcinomas in von Hippel-Lindau disease; tumor detection and management Twenty-seven renal cell carcinomas (RCCs) found in one family affected with von Hippel-Lindau disease were examined using ultrasound (US), CT, MRI and angiography. The sensitivity of the tumor detection using different imaging modalities was evaluated by macroscopic pathology (solid or cystic) and size (exceeding 2cm in diameter or not). In 18 of the RCC's exceeding 2cm in diameter (eight solid and ten cystic), all lesions were detected on US, CT, and MRI. However, on angiography, solid RCCs were detected in 88%, and cystic RCCs were detected in 60%. In nine RCCs less than 2cm in diameter (seven solid and two cystic), solid RCCs were detected in 86% on US, 86% on CT, 80% on MRI, and 43% on angiography, but cystic RCCs were detected in 50% on only CT and MRI. From the pathologic correlation, even renal simple cystic lesions in VHL are considered premalignant lesions and they had better be removed if the residual renal function after surgery is preserved. In case of the observation, they should be followed carefully using thin slice thickness dynamic CT to discover the wall irregularity, septation and irregular contour.

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

von hippel-lindau disease
renal cell carcinoma
dynamic mri


optimal register assignment to loops for embedded code generation Abstract: One of the challenging tasks in code generation for embedded systems is register assignment. When more live variables than registers exist, some variables are necessarily accessed from data memory. Because loops are typically executed many times and are often time-critical, good register assignment in loops is exceedingly important, since accessing data memory can degrade performance. The issue of finding an optimal register assignment to loops, one which minimizes the number of spills between registers and memory, has been open for some time. In this paper, we address this issue and present an optimal, but exponential, algorithm which assigns registers to loop bodies such that the resulting spill code is minimal. We also show that a heuristic modification performs as well as the exponential approach on typical loops from scientific code.

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

live variables
performance
paper
minimal
code
assignment
data
heuristic modification
exponential algorithm
loops
embedded systems

optimisation
addressing
real-time systems
timing
storage allocation
variability
live
abstraction
optimality
program control structures
optimal register assignment
memorialized
scientific code
heuristics
minimal spill code
algorithm
critic
embedded code generation
data memory access
code generation
embedding