Nonlinear model predictive control of fed-batch cultures of micro-organisms exhibiting overflow metabolism: Assessment and robustness Overflow metabolism characterizes cells strains that are likely to produce metabolites as, for instance, ethanol for yeasts or acetate for bacteria, resulting from an excess of substrate feeding and inhibiting the cell respiratory capacity. The critical substrate level separating the two different metabolic pathways is generally not well defined. This occurs for instance in Escherichia coli cultures with aerobic acetate formation. This work addresses the control of a lab-scale fed-batch culture of E. coil with a nonlinear model predictive controller (NMPC) to determine the optimal feed flow rate of substrate. The objective function is formulated in terms of the kinetics of the main metabolic pathways, and aims at maximizing glucose oxidation, while minimizing glucose fermentation. As bioprocess models are usually uncertain, a robust formulation of the NMPC scheme is proposed using a min-max optimization problem. The potentials of this approach are demonstrated in simulation using a Monte-Carlo analysis. (c) 2011 Elsevier Ltd. All rights reserved.

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

predictive control
overflow metabolism
fermentation


Combinatorial Groupoids, Cubical Complexes, and the Lovasz Conjecture This paper lays the foundation for a theory of combinatorial groupoids that allows us to use concepts like "holonomy", "parallel transport", "bundles", "combinatorial curvature", etc. in the context of simplicial (polyhedral) complexes, posets, graphs, polytopes and other combinatorial objects. We introduce a new, holonomy-type invariant for cubical complexes, leading to a combinatorial "Theorema Egregium" for cubical complexes that are non-embeddable into cubical lattices. Parallel transport of Hom-complexes and maps is used as a tool to extend Babson Kozlov-Lovasz graph coloring results to more general statements about nondegenerate maps (colorings) of simplicial complexes and graphs.

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

combinatorial groupoids
lovasz conjecture
cubical complexes


a forensic signature based on spatial distributed bag of features for image alignment and tampering detection The distribution of digital images with the classic and newest technologies available on Internet has induced a growing interest on systems able to protect the visual content against malicious manipulations performed during their transmission. One of the main problems addressed in this context is the authentication of the image received in a communication. This task is usually performed by localizing the regions of the image which have been tampered. To this aim the received image should be first aligned with the one at the sender by exploiting the information provided by a specific component of the forensic hash associated with the image. In this paper we propose a robust alignment method which makes use of an image hash component based on the Bag of Features paradigm. In order to deal with highly textured and contrasted tampering patterns the spatial distribution of the image features has been encoded in the alignment signature. A block-wise tampering detection based on histograms of oriented gradients representation is also proposed. Specifically, a non-uniform quantization of the histogram of oriented gradient space is used to build the signature of each image block for tampering purposes. Experiments show that the proposed approach obtains good margin in terms of performances with respect to state-of-the-art methods.

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

image forensics
image authentication
tampering localization
image registration


Non-uniform Deblurring for Shaken Images Photographs taken in low-light conditions are often blurry as a result of camera shake, i.e. a motion of the camera while its shutter is open. Most existing deblurring methods model the observed blurry image as the convolution of a sharp image with a uniform blur kernel. However, we show that blur from camera shake is in general mostly due to the 3D rotation of the camera, resulting in a blur that can be significantly non-uniform across the image. We propose a new parametrized geometric model of the blurring process in terms of the rotational motion of the camera during exposure. This model is able to capture non-uniform blur in an image due to camera shake using a single global descriptor, and can be substituted into existing deblurring algorithms with only small modifications. To demonstrate its effectiveness, we apply this model to two deblurring problems; first, the case where a single blurry image is available, for which we examine both an approximate marginalization approach and a maximum a posteriori approach, and second, the case where a sharp but noisy image of the scene is available in addition to the blurry image. We show that our approach makes it possible to model and remove a wider class of blurs than previous approaches, including uniform blur as a special case, and demonstrate its effectiveness with experiments on synthetic and real images.

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

motion blur
blind deconvolution
non-uniform/spatially-varying blur


Modelling defeasible and prioritized support in bipolar argumentation Cayrol and Lagasquie-Schiex introduce bipolar argumentation frameworks by introducing a second relation on the arguments for representing the support among them. The main drawback of their approach is that they cannot encode defeasible support, for instance they cannot model an attack towards a support relation. In this paper, we introduce a way to model defeasible support in bipolar argumentation frameworks. We use the methodology of meta-argumentation in which Dung's theory is used to reason about itself. Dung's well-known admissibility semantics can be used on this meta-argumentation framework to compute the acceptable arguments, and all properties of Dung's classical theory are preserved. Moreover, we show how different contexts can lead to the alternative strengthening of the support relation over the attack relation, and converse. Finally, we present two applications of our methodology for modeling support, the case of arguments provided with an internal structure and the case of abstract dialectical frameworks.

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

defeasible support
prioritized support
modelling


reusable framework for location-aware mobile applications A fundamental dilemma in location-aware mobile applications is how to determine their physical location. Because pervasive computing is still immature, and its ubiquitous infrastructure is not set to serve location-aware applications, much research has been conducted in the last few years to use available technologies to determine physical location. This paper describes the definition and implementation of a generic location identification framework which is reusable by most location-aware mobile applications. A review of technologies for location determination leads to the design of a Location Abstract Framework (LAF) to implement different location sensing techniques under a common Application Programming Interface (API). A Java Micro-Edition (J2ME) implementation of LAF using Radio Frequency Identification (RFID) based location sensing methods is described

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

gps
object oriented framework
location aware


Dynamic programming based algorithms for set multicover and multiset multicover problems Given a universe N containing is elements and a collection of multisets or sets over N, the multiset multicover (MSMC) problem or the set multicover (SMC) problem is to cover all elements at least a number of times as specified in their coverage requirements with the minimum number of multisets or sets. In this paper, we give various exact algorithms for these two problems with or without constraints on the number of times a multiset or set may be chosen. First, we show that the MSMC without multiplicity constraints problem can be solved in O* ((b +1)(n)vertical bar F vertical bar) time and polynomial space, where b is the maximum coverage requirement and vertical bar F vertical bar denotes the total number of given multisets over N. (The O* notation suppresses a factor polynomial in n.) To our knowledge, this is the first known exact algorithm for the MSMC without multiplicity constraints problem. Second, by combining dynamic programming and the inclusion-exclusion principle, we can exactly solve the SMC without multiplicity constraints problem in O((b + 2)(n)) time. Compared with two recent results, in [Q.-S. Hua, Y. Wang, D. Yu, F.C.M. Lau, Set multi-covering via inclusion-exclusion, Theoretical Computer Science, 410 (38-40) (2009) 3882-3892] and [J. Nederlof. Inclusion exclusion for hard problems, Master Thesis, Utrecht University, The Netherlands, 2008], respectively, ours is the fastest exact algorithm for the SMC without multiplicity constraints problem. Finally, by directly using dynamic programming, we give the first known exact algorithm for the MSMC or the SMC with multiplicity constraints problem in O((b + 1)(n)vertical bar F vertical bar) time and O* ((b + 1)(n)) space. This algorithm can also be easily adapted as a constructive algorithm for the MSMC without multiplicity constraints problem. (C) 2010 Elsevier B.V. All rights reserved.

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

set multicover
multiset multicover
dynamic programming
algorithm


Energy-Efficient Tree-Based Multipath Power Control for Underwater Sensor Networks Due to the use of acoustic channels with limited available bandwidth, Underwater Sensor Networks (USNs) often suffer from significant performance restrictions such as low reliability, low energy-efficiency, and high end-to-end packet delay. The provisioning of reliable, energy-efficient, and low-delay communication in USNs has become a challenging research issue. In this paper, we take noise attenuation in deep water areas into account and propose a novel layered multipath power control (LMPC) scheme in order to reduce the energy consumption as well as enhance reliable and robust communication in USNs. To this end, we first formalize an optimization problem to manage transmission power and control data rate across the whole network. The objective is to minimize energy consumption and simultaneously guarantee the other performance metrics. After proving that this optimization problem is NP-complete, we solve the key problems of LMPC including establishment of the energy-efficient tree and management of energy distribution and further develop a heuristic algorithm to achieve the feasible solution of the optimization problem. Finally, the extensive simulation experiments are conducted to evaluate the network performance under different working conditions. The results reveal that the proposed LMPC scheme outperforms the existing mechanism significantly.

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

underwater sensor networks
packet delay
optimization

multipath communication
energy efficiency


Performance evaluation of metaheuristic search techniques in the optimum design of real size pin jointed structures In recent years a number of metaheuristic search techniques have been widely used in developing structural optimization algorithms. Amongst these techniques are genetic algorithms, simulated annealing, evolution strategies, particle swarm optimizer, tabu search, ant colony optimization and harmony search. The primary goal of this paper is to objectively evaluate the performance of abovementioned seven techniques in optimum design of pin jointed structures. First, a verification of the algorithms used to implement the techniques is carried out using a benchmark problem from the literature. Next, the techniques compiled in an unbiased coding platform are evaluated and compared in terms of their solution accuracies as well as convergence rates and reliabilities using four real size design examples formulated according to the design limitations imposed by ASD-AISC (Allowable Stress Design Code of American Institute of Steel Institution). The results reveal that simulated annealing and evolution strategies are the most powerful techniques, and harmony search and simple genetic algorithm methods can be characterized by slow convergence rates and unreliable search performance in large-scale problems.

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

structural optimization
pin jointed structures

metaheuristic techniques
combinatorial optimization


Interface integral BEM for solving multi-medium heat conduction problems In this paper, a new and simple boundary element method, called interface integral boundary element method (IIBEM), is presented for solving heat conduction problems consisting of multiple media. In the method, the boundary integral equation is derived by a degeneration technique from domain integrals involved in varying heat conductivity problems into interface integrals in multi-medium problems. The main feature of the presented technique is that only a single boundary integral equation is used to solve heat conduction problems with different material properties. The effect of nonhomogeneity between adjacent materials is embodied in the interface integrals including the material property difference between the two adjacent materials. Comparing with conventional multi-domain boundary integral equation techniques, the presented method is more efficient in computational time, data preparing, and program coding. Numerical examples are given to verify the correctness of the presented technique.

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

boundary integral equation
heat conduction

multi-domain method
nonhomogeneous problem


Weakly Set Valued Generalized Vector Variational Inequalities In this paper we discuss the weak and strong solutions for setvalued generalized vector variational inequalities in real topological vector spaces. These two sets of solutions coincide whenever the mapping T is single valued but not setvalued. We use the Ferro Minimax Theorem to prove the existence of strong solutions for weakly setvalued generalized vector variational inequality problems.

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


Computational methods for complex eigenproblems in finite element analysis of structural systems with viscoelastic damping treatments In this paper efficient numerical methods to approximate the complex eigenvalues and eigenvectors in non-proportional and non-viscous systems are presented. These methods are specially conceived for practical engineering applications making use of the finite element analysis to determinate the effect that potential damping treatments have on the natural frequencies and mode shapes of structural systems. Considering the solution of the undamped problem, the complex eigenpair is estimated by finite increments using the eigenvector derivatives. For non-proportional viscous systems with low and medium damping, a simple single-step technique is presented whose rapidity and accuracy is verified by means of numerical applications. For higher damped systems an incremental approach is proposed that keeps the accuracy without significantly increasing the computational time. For non-viscously damped systems a fast iterative modality is suggested, which allows to approximate, in an efficient and simple way, the complex eigenpair. As numerical applications, the study of a metallic beam with free layer damping treatment is completed using finite element procedures, where the damping material is modelized by an exponential model whose parameters are obtained from curve fitting to experimental data.

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

damping treatments
finite element analysis

complex modes
non-classical damping
non-viscous damping


Quasi-optimal energy-efficient leader election algorithms in radio networks Radio networks (RN) are distributed systems (adhoc networks) consisting in n >= 2 radio stations. Assuming the number n unknown, two distinct models of RN without collision detection (no-CD) are addressed: the model with weak no-CD RN and the one with strong no-CD RN. We design and analyze two distributed leader election protocols, each one running in each of the above two (no-CD RN) models, respectively. Both randomized protocols are shown to elect a leader within O(log (n)) expected time, with no station being awake efficient). Therefore, a new class for more than O(log log (n)) time slots (such algorithms are said to be energy-efficient algorithms is set up that match the Omega(log (n)) time lower-bound established by Kushilevitz and Mansour [E. Kushilevitz, Y. Mansour, An Omega(D log (N/D)) lower-bound for broadcast in radio networks, SIAM J. Comp. 27 (1998) 702-712).]. (c) 2006 Elsevier Inc. All rights reserved.

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

election
radio networks
distributed systems


evolutionary multiobjective optimization and multiobjective fuzzy system design Evolutionary multiobjective optimization (EMO) is one of the most active research areas in evolutionary computation. EMO algorithms have been successfully used in various application areas. Among them are multiobjective design of neural networks and fuzzy systems. Especially, fuzzy system design has often been discussed as multiobjective problems. This is because we have two conflicting objectives in the design of fuzzy systems: accuracy maximization and complexity minimization. In this paper, we first explain some basic concepts in multiobjective optimization, a basic framework of EMO algorithms and some hot research issues in the EMO community. Next we explain EMO-based approaches to the design of fuzzy systems. We demonstrate through computational experiments that a large number of non-dominated fuzzy systems with different accuracy-complexity tradeoffs can be obtained by a single run of an EMO algorithm. Then we describe the use of EMO algorithms in other areas such as neural networks, genetic programming, clustering, feature selection, and data mining.

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

accuracy-complexity tradeoff
many-objective optimization
fuzzy rule-based systems


A study on strengthening security awareness programs based on an RFID access control system for inside information leakage prevention Systematic security policies and plans of many organizations or enterprises can be degraded due to users inattention and unconcern. Therefore, it is very important to guide establishing security policies through the education for users. However, existing security awareness program has problems that is not reflect for different users security level and not evaluation of the security policy that is established and implemented, because it use educating for users in the form of a cluster education on uniform contents. Thus in this study, we proposed a strengthening security awareness program using an intensive training method for users based on detecting violations of the established security policy. For detecting violation of established security policy, we use a physical access control method by RFID that protects data from an information system accessed by unauthorized persons through physical ways for visual checking. The strengthening security awareness program proposed in this study increases security levels for the users who have low security awareness levels and can intercept potential leakage paths of important information through improving minimum security levels in organizations or enterprises.

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


GeoViSRelativistic

ray

tracing

in

four-dimensional

spacetimes

The

optical

appearance

of

objects

moving

close

to

the

speed

of

light

or

orbiting

a

black

hole

is

of

interest

for

educational

purposes

as

well

as

for

scientific

modeling

in

special

and

general

relativity.

The

standard

approach

to

visualize

such

settings

is

ray

tracing

in

four-dimensional

spacetimes

where

the

direction

of

the

physical

propagation

of

light

is

reversed.

GeoViS

implements

this

ray

tracing

principle

making

use

of

the

library

that

handles

the

spacetime

metrics,

the

integration

of

geodesics,

and

the

description

of

objects

defined

with

respect

to

local

reference

frames.

In

combination

with

the

GeodesicViewer,

GeoViS

might

be

a

valuable

tool

for

graduate

students

to

get

a

deeper

understanding

in

the

visual

effects

of

special

and

general

relativity.

Program

title:

GeoViS

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:

C++,

Scheme.

Computer:

Linux

platforms.

Operating

system:

Linux.

Has

the

code

been

vectorized

or

parallelized?:

Yes,

Parallelized

using

MPI.

RAM:

Bytes

Classification:

External

routines:

Gnu

Scientific

Library

(GSL),

MPI.

Nature

of

problem:

First-person

visualization

of

four-dimensional

spacetimes

in

the

theory

of

relativity.

Solution

method:

Integration

of

ordinary

differential

equations

for

ray

tracing.

Running

time:

Scene

dependentfrom

seconds

to

hours.

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

relativity and gravitation
relativistic visualization


Reliability prediction for evolutionary product in the conceptual design phase using neural network-based fuzzy synthetic assessment Reliability prediction plays an important role in product lifecycle management. It has been used to assess various reliability indices (such as reliability, availability and mean time to failure) before a new product is physically built and/or put into use. In this article, a novel approach is proposed to facilitate reliability prediction for evolutionary products during their early design stages. Due to the lack of sufficient data in the conceptual design phase, reliability prediction is not a straightforward task. Taking account of the information from existing similar products and knowledge from domain experts, a neural network-based fuzzy synthetic assessment (FSA) approach is proposed to predict the reliability indices that a new evolutionary product could achieve. The proposed approach takes advantage of the capability of the back-propagation neural network in terms of constructing highly non-linear functional relationship and combines both the data sets from existing similar products and subjective knowledge from domain experts. It is able to reach a more accurate prediction than the conventional FSA method reported in the literature. The effectiveness and advantages of the proposed method are demonstrated via a case study of the fuel injection pump and a comparative study.

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

reliability prediction
evolutionary product
neural network
fuzzy synthetic assessment


Exact error bounds for the reconstruction processes using interpolating wavelets It is known that a multiresolution scheme without control on the infinity norm can produce numerical artifacts. This work is intended to provide explicit error bounds for the reconstruction process associated with the interpolating wavelets introduced by Donoho [D. Donoho, Interpolating Wavelet Transforms, Preprint, Department of Statistics, Stanford University, 1992]. The stability constants related to the interpolatory wavelets defined by the use of the Daubechies filters [I. Daubechies, Ten Lectures oil Wavelets, SIAM, Philadelphia, 19921, also called the Deslaurier-Dubuc wavelets, are tabulated. Our study present two important facts: The first is that the obtained stability constants are much better approximated than those given by other approaches motivated by IS. Amat, J. Liandrat, On the stability of the PPH multiresolution algorithm, Appl. Comp. Harmon. Anal. 18 (2005) 198-206] and the second is that our analysis uses basic rules easily understood by a wide pan of the scientific community interested in this kind of explicit numerical results. (C) 2009 IMACS. Published by Elsevier B.V. All rights reserved.

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

error bounds
interpolating wavelets
stability


Channel Estimation for Opportunistic Spectrum Access: Uniform and Random Sensing The knowledge of channel statistics can be very helpful in making sound opportunistic spectrum access decisions. It is therefore desirable to be able to efficiently and accurately estimate channel statistics. In this paper, we study the problem of optimally placing sensing/sampling times over a time window so as to get the best estimate of the parameters of an on-off renewal channel. We are particularly interested in a sparse sensing regime with a small number of samples relative to the time window size. Using Fisher information as a measure, we analytically derive the best and worst sensing sequences under a sparsity condition. We also present a way to derive the best/worst sequences without this condition using a dynamic programming approach. In both cases the worst turns out to be the uniform sensing sequence, where sensing times are evenly spaced within the window. Interestingly the best sequence is also uniform but with a much smaller sensing interval that requires a priori knowledge of the channel parameters. With these results we argue that without a priori knowledge, a robust sensing strategy should be a randomized strategy. We then compare different random schemes using a family of distributions generated by the circular beta ensemble, and propose an adaptive sensing scheme to effectively track time-varying channel parameters. We further discuss the applicability of compressive sensing in the context of this problem.

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

channel estimation
fisher information
random sensing
sparse sensing
uniform sensing


A low-complexity region-based video coder using backward morphological motion field segmentation We introduce a novel region-based video compression framework based on morphology to efficiently capture motion correspondences between consecutive frames in an image sequence. Our coder is built on the observation that the motion field associated with typical image sequences can be segmented into component motion subfield "clusters" associated with distinct objects or regions in the scene, and further, that these clusters fan be efficiently captured using morphological operators in a "backward" framework that avoids the need to send region shape information. Region segmentation is performed directly on the motion field by introducing a small "core" for each cluster that captures the essential features of the cluster and reliably represents its motion behavior. Cluster matching is used in lieu of the conventional black matching methods of standard video coders to define a cluster motion representation paradigm. Furthermore, a region-based pel-recursive approach is applied to find the refinement motion held for each cluster and the cluster motion prediction error image is coded by a novel adaptive scalar quantization method. Experimental results reveal a 10-20% reduction in prediction error energy and 1-3 dB gain in final reconstructed peak signal-to-noise ratio (PSNR) over the standard MPEG-I coder at typical bit rates of 500 Kb/s to 1 Mb/s on standard test sequences, while also requiring lower computational complexity.

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

morphological operations
motion estimation
object recognition
video coding


A robust mosaicking procedure for high spatial resolution remote sensing images With the rapid development of sensor manufacturing technology, high spatial resolution (HR) images are becoming more easily acquired and more widely used. However, it is common that a region of interest (ROI) cannot be completely acquired from a single image. Image mosaicking can resolve the problem by creating a new large-area image from multiple images with overlapping areas. A typical mosaicking procedure for HR remote sensing images includes three successive steps: tonal adjustment, seamline detection, and image blending. In this paper, we propose a robust mosaicking procedure featuring novel ideas in all three steps, which is aimed at processing HR remote sensing images of urban areas. Firstly, the tonal adjustment is realized by a local moment matching (LMM) algorithm, which solves the nonlinear photometric correlation problem between adjacent images. Secondly, an automatic piecewise dynamic program (APDP) algorithm for seamline detection is proposed to detect the optimal seamline on the overlapped area. Last but not least, we propose a cosine distance weighted blending (CDWB) method to ensure that the seamline is as invisible as possible. Compared to the state-of-the-art methods, the proposed method was proved to be effective in experiments with high resolution aerial and satellite images.

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

cosine distance weighted blending
image mosaicking
high spatial resolution
local moment matching
piecewise dynamic program
remote sensing


Effect of varying concentration and temperature on steady and dynamic parameters of low concentration photovoltaic energy system Low concentration photovoltaic (LCPV) system is designed and developed. Commercially available crystalline silicon solar PV cells used under concentration. Dynamic behavior of LCPV system is modeled and estimated. Real-time analysis of LCPV system is presented.

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

low-concentration photovoltaic (lcpv) system


Stochastic processes for computer network traffic modeling Computer networks such as local area and wide area networks possess complex characteristics due to the heterogeneous nature of the supported traffic. The network traffic exhibits highly irregular fractal-like structure and long term correlations. Various stochastic processes such as fractional Gaussian noise, multiplicative cascades, linear fractional stable motion have been proposed to model network traffic. These stochastic processes are relatively unheard of in the networking community, until recently. This paper provides a thorough review of these stochastic processes and their application to wireless traffic modeling. (c) 2005 Elsevier B.V. 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 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 O O O O O O O

fractional stable motion
traffic modeling

self-similarity
long-range dependence
fractals
multifractals
1/f process
point process
infinitely divisible cascade


Optical constants of InSe and In4Se3 thin films in the far infrared region By using the flash evaporation technique we have obtained InSe and In4Se3 thin films, their reflectance measurements are recorded at ambient temperatures, in the far infrared range (50400 cm?1) and for E polarisation. The theoretical curves of reflectivity show that optical properties are strongly dependent on the thickness of thin films. In order to determine the optical constants (i.e. the real and imaginary parts of respectively the refractive index and the dielectric function). Finally electrical parameters such as free carrier concentration and their scattering times and vibrational frequencies of phonons are determined by the fit of the reflectivity spectrum.

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


itv and changing social interactions In this paper, we present findings from empirical studies on end users' attitudes towards peer-to-peer (P2P) networked television. This paper sheds light on the changing trends of consumers' media usage and television watching. We aim to understand the meanings people associate with TV in their everyday lives and to discuss further how interactive TV (iTV) might change the social situations in which TV is being viewed.

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

user experiences
peer-to-peer tv
social media


non-photorealistic virtual environments We describe a system for non-photorealistic rendering (NPR) of virtual environments. In real time, it synthesizes imagery of architectural interiors using stroke-based textures. We address the four main challenges of such a system interactivity, visual detail, controlled stroke size, and frame-to-frame coherence through image based rendering (IBR) methods. In a preprocessing stage, we capture photos of a real or synthetic environment, map the photos to a coarse model of the environment, and run a series of NPR filters to generate textures. At runtime, the system re-renders the NPR textures over the geometry of the coarse model, and it adds dark lines that emphasize creases and silhouettes. We provide a method for constructing non-photorealistic textures from photographs that largely avoids seams in the resulting imagery. We also offer a new construction, art-maps , to control stroke size across the images. Finally, we show a working system that provides an immersive experience rendered in a variety of NPR styles.

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

stroke geometry experience model runtime control coherence method environments rendering size

immersant
challenge
silhouette
interactive virtual environments
addressing
image-based rendering
photo
imaging
filtering
real-time
texture mapping
interaction
non-photorealistic rendering
visualization
texture
systems
architecture
virtual environment


Reducing the number of processors elements in systolic arrays for matrix multiplication using linear transformation matrix different definitions, in this work is given the so called transformation matrix, which maps the given index space in another index space. Transformation used in this new index space reduces the number of processing elements in the array. We illustrate all possible instances of transformation matrices and we show the importance of using the transformation matrix by comparing the number of processing elements of the array where we use it with another array where this transformation is not used. For this purpose also is given a mathematical explanation. The comparison is made using the matrices of size N=4.

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

matrix multiplication
linear transformation matrix

systolic array
number of processor elements


A

novel

differential

multiuser

detection

algorithm

for

multiuser

MIMO-OFDM

systems

We

propose

an

efficient

low

bit

error

rate

(BER)

and

low

complexity

multiple-input

multiple-output

(MIMO)

multiuser

detection

(MUD)

method

for

use

with

multiuser

MIMO

orthogonal

frequency

division

multiplexing

(OFDM)

systems.

It

is

a

hybrid

method

combining

a

multiuser-interference-cancellation-based

decision

feedback

equalizer

using

error

feedback

filter

(MIMO

MIC

DFE-EFF)

and

a

differential

algorithm.

The

proposed

method,

termed

'MIMO

MIC

DFE-EFF

with

a

differential

algorithm'

for

short,

has

a

multiuser

feedback

structure.

We

describe

the

schemes

of

MIMO

MIC

DFE-EFF

and

MIMO

MIC

DFE-EFF

with

a

differential

algorithm,

and

compare

their

minimum

mean

square

error

(MMSE)

performance

and

computational

complexity.

Simulation

results

show

that

a

significant

performance

gain

can

be

achieved

by

employing

the

MIMO

MIC

DFE-EFF

detection

algorithm

in

the

context

of

a

multiuser

MIMO-OFDM

system

over

frequency

selective

Rayleigh

channel.

MIMO

MIC

DFE-EFF

with

the

differential

algorithm

improves

both

computational

efficiency

and

BER

performance

in

a

multistage

structure

relative

to

conventional

DFE-EFF,

though

there

is

a

small

reduction

in

system

performance

compared

with

MIMO

MIC

DFE-EFF

without

the

differential

algorithm.

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

orthogonal frequency division multiplexing (ofdm)


RIDED-2D: A RULE-BASED INSTANTANEOUS DENOISING AND EDGE DETECTION METHOD FOR 2D RANGE SCAN LINE Edge detection is often regarded as a basic step in range image processing by virtue of its crucial effect. The majority of existing edge detection methods cannot satisfy the requirement of efficiency in many industrial applications due to huge computational costs. In this paper, a novel instantaneous method, named RIDED-2D is proposed for denoising and edge detection for 2D scan line in range images. In the method, silhouettes of 2D scan line are classified into eight types by de fining a few new coefficients. Several discriminant criteria on large noise filtering and edge detection are stipulated based on qualitative feature analysis on each type. Selecting some feature point candidates, a practical parameter learning method is provided to determine the threshold set, along with the implementation of an integrated algorithm by merging calculation steps. Because all the coefficients are established based on distances among the points or their ratio, RIDED-2D is inherently invariant to translation and rotation transformations. Furthermore, a forbidden region approach is proposed to eliminate interference of the mixed pixels. Key performances of RIDED-2D are evaluated in detail by including computational complexity, time expenditure, accuracy and stability. The results indicate that RIDED-2D can detect edge points accurately from several real range images, in which large noises and systematic noises are involved, and the total processing time is less than 0.1 millisecond on an ordinary PC platform using the integrated algorithm. Comparing with other state-of-the-art edge detection methods qualitatively, RIDED-2D exhibits a prominent advantage on computational efficiency. Thus, the proposed method qualifies for real-time processing in stringent industrial applications. Besides, another contribution of this paper is to introduce CPU clock counting technique to evaluate the performance of the proposed algorithm, and suggest a convenient and objective way to estimate the algorithm's time expenditure in other platforms.

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

instantaneous edge detection
real-time image processing
laser range finder
3d range image understanding
computer vision
rided


consistency checking of uml model diagrams using the xml semantics approach A software design is often modeled as a collection of unified Modeling Language (UML) diagrams. There are different aspects of the software system that are covered by many different UML diagrams. This leads for big risk that the overall specification of the system becomes inconsistent and incompleteness. This inherits the necessary to check the consistency between these related UML diagrams. In addition, as the software system gets evolution, those diagrams get modified that leads again to possible inconsistency and incompleteness between the different versions of these diagrams. In this paper, we plan to employ our previous novel XML semantics approach, which proposed for checking the semantic consistency of XML documents using attribute grammar techniques, to check the consistency of UML diagrams. The key idea here is translating the UML diagrams to its equivalent XMI documents. Then checking the consistency of these XMI documents, they are special forms of XML, by employing them to our previous XML semantics approach.

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


Detection of T.b. rhodesiense Trypanosomes in Humans and Domestic Animals in South East Uganda by Amplification of Serum Resistance-Associated Gene The human serum resistance-associated (SRA) gene was identified in 28 (80%) of the 35 T.b. rhodesiense trypanosomes from parasitologically confirmed sleeping sickness cases, using the primers designed by Radwanska and in 27 (77.1%) of the same 35 T.b. rhodesiense trypanosomes using the primers designed by Gibson. However, about 20% of the 35 T.b. rhodesiense trypanosomes could not be detected by SRApolymerase chain reaction (PCR) even when an aliquot of the first PCR was used in the second PCR, indicating that the gene may be absent in those trypanosomes or the trypanosomes could be having another variant of SRA not detectable by these primers since three variants of SRA genes have so far been identified or the amount of trypanosomal DNA extracted from infected blood was too low to be detected. The trypanosome isolates that are SRA gene negative may indicate the presence of some T.b. rhodesiense trypanosomes with modified or lack SRA genes or simple loss of the SRA gene from the expression site in which it resides during antigenic variation.Analysis of trypanosomes derived from domestic animals showed that 79 (90.8%) of the 87 trypanosomes isolated from cattle were positive by Trypanosoma brucei (TBR)PCR, indicating that they were Trypanozoon while 8 (9.2%) of the trypanosome isolates which were negative by TBRPCR could be T. vivax, T. congolense, or T. theileri. When subjected to SRAPCR, 10 (11.5%) of the 87 trypanosomes isolates derived from cattle were positive, indicating that there could be T.b. rhodesiense circulating in cattle, which is similar to the percentage of T.b. rhodesiense previously obtained in cattle in Serere, Soroti district

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

detection
humans
domestic animals
amplification

trypanosoma brucei rhodesiense
serum resistance-associated gene


A factorization approach for cone-beam reconstruction on a circular short-scan In this paper, we introduce a new algorithm for 3-D image reconstruction from cone-beam (CB) projections acquired along a partial circular scan. Our algorithm is based on a novel, exact factorization of the initial 3-D reconstruction problem into a set of independent 2-D inversion problems, each of which corresponds to finding the object density on one, single plane. Any such 2-D inversion problem is solved numerically using a projected steepest descent iteration scheme. We present a numerical evaluation of our factorization algorithm using computer-simulated CB data, without and with noise, of the FORBILD head phantom and of a disk phantom. First, we study quantitatively the impact of the reconstruction parameters on the algorithm performance. Next, we present reconstruction results for visual assessment of the achievable image quality and provide, for comparison, results obtained with two other state-of-the-art reconstruction algorithms for the circular short-scan.

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


Benefits of averaging lateration estimates obtained using overlapped subgroups of sensor data ? In this paper, we suggest averaging lateration estimates obtained using overlapped subgroups of distance measurements as opposed to obtaining a single lateration estimate from all of the measurements directly if a redundant number of measurements are available. Least squares based closed form equations are used in the lateration. In the case of Gaussian measurement noise the performances are similar in general and for some subgroup sizes marginal gains are attained. Averaging laterations method becomes especially beneficial if the lateration estimates are classified as useful or not in the presence of outlier measurements whose distributions are modeled by a mixture of Gaussians (MOG) pdf. A new modified trimmed mean robust averager helps to regain the performance loss caused by the outliers. If the measurement noise is Gaussian, large subgroup sizes are preferable. On the contrary, in robust averaging small subgroup sizes are more effective for eliminating measurements highly contaminated with MOG noise. The effect of high-variance noise was almost totally eliminated when robust averaging of estimates is applied to QR decomposition based location estimator. The performance of this estimator is just 1 cm worse in root mean square error compared to the CramrRao lower bound (CRLB) on the variance both for Gaussian and MOG noise cases. Theoretical CRLBs in the case of MOG noise are derived both for time of arrival and time difference of arrival measurement data.

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

least squares time of arrival location estimator

least squares time difference of arrival location estimator


New cyclic difference sets with singer parameters constructed from d-homogeneous functions In this paper, for a prime power q, new cyclic difference sets with Singer parameters ((q(n) - 1/q - 1), (q(n-1) - 1/q - 1), (q(n-2) - 1/q - 1)) are constructed by using q-ary sequences (d-homogeneous functions) of period q(n) - 1 and the generalization of GMW difference sets is proposed by combining the generation methods of d-form sequences and extended sequences. When q is a power of 3, new cyclic difference sets with Singer parameters ((q(n) - 1/q - 1), (q(n-1) - 1/q - 1), (q(n-2)-1/q-1)) are constructed from the ternary sequences of period q(n)-1 with ideal autocorrelation introduced by Helleseth, Kumar, and Martinsen.

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

cyclic difference sets
gmw difference sets
sequences

d-homogeneous functions
generalized gmw difference sets


A game-theoretic study of CSMA/CA under a backoff attack CSMA/CA, the contention mechanism of the IEEE 802.11 DCF medium access protocol, has recently been found vulnerable to selfish backoff attacks consisting in nonstandard configuration of the constituent backoff scheme. Such attacks can greatly increase a selfish station's bandwidth share at the expense of honest stations applying a standard configuration. The paper investigates the distribution of bandwidth among anonymous network stations, some of which are selfish. A station's obtained bandwidth share is regarded as a payoff in a noncooperative CSMA/CA game. Regardless of the IEEE 802.11 parameter setting, the payoff function is found similar to a multiplayer Prisoners' Dilemma; moreover, the number (though not the identities) of selfish stations can be inferred by observation of successful transmission attempts. Further, a repeated CSMA/CA game is defined, where a station can toggle between standard and nonstandard backoff configurations with a view of maximizing a long-term utility. It is argued that a desirable station strategy should yield a fair, Pareto efficient, and subgame perfect Nash equilibrium. One such strategy, called CRISP, is described and evaluated.

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

ad hoc lan
game theory
mac protocol
selfish behavior


Structure-Aware Lighting Design for Volume Visualization Lighting design is a complex, but fundamental, problem in many fields. In volume visualization, direct volume rendering generates an informative image without external lighting, as each voxel itself emits radiance. However, external lighting further improves the shape and detail perception of features, and it also determines the effectiveness of the communication of feature information. The human visual system is highly effective in extracting structural information from images, and to assist it further, this paper presents an approach to structure-aware automatic lighting design by measuring the structural changes between the images with and without external lighting. Given a transfer function and a viewpoint, the optimal lighting parameters are those that provide the greatest enhancement to structural information - the shape and detail information of features are conveyed most clearly by the optimal lighting parameters. Besides lighting goodness, the proposed metric can also be used to evaluate lighting similarity and stability between two sets of lighting parameters. Lighting similarity can be used to optimize the selection of multiple light sources so that different light sources can reveal distinct structural information. Our experiments with several volume data sets demonstrate the effectiveness of the structure-aware lighting design approach. It is well suited to use by novices as it requires little technical understanding of the rendering parameters associated with direct volume rendering.

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

automatic lighting design
lighting similarity
volume rendering

structural dissimilarity
lighting stability


General absolute summability factor theorems involving quasi-power-increasing sequences In this paper a general theorem concerning the vertical bar A, delta vertical bar(k) summability methods has been proved, which generalizes two results of Sevli and Leindler [H. Sevli and L. Leindler, n the absolute summability factors of infinite series involving quasi-power-increasing sequences, Computers and Mathematics with Applications 57 (2009), 702-709]. We obtain sufficient conditions for Sigma a(n)lambda(n) to be summable vertical bar A, delta vertical bar(k), k >= 1, 0 <= delta < 1/k, by using quasi-power- increasing sequences. (C) 2009 Elsevier Ltd. All rights reserved.

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

summability factors
absolute summability
infinite series

quasi-monotone sequences
almost increasing sequences


motivated reinforcement learning for adaptive characters in open-ended simulation games Recently a new generation of virtual worlds has emerged in which users are provided with open-ended modelling tools with which they can create and modify world content. The result is evolving virtual spaces for commerce, education and social interaction. In general, these virtual worlds are not games and have no concept of winning, however the open-ended modelling capacity is nonetheless compelling. The rising popularity of open-ended virtual worlds suggests that there may also be potential for a new generation of computer games situated in open-ended environments. A key issue with the development of such games, however, is the design of non-player characters which can respond autonomously to unpredictable, open-ended changes to their environment. This paper considers the impact of open-ended modelling on character development in simulation games. Motivated reinforcement learning using context-free grammars is proposed as a means of representing unpredictable, evolving worlds for character reasoning. This technique is used to design adaptive characters for the Second Life virtual world to create a new kind of open-ended simulation game.

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

computer games
adaptive characters
motivated reinforcement learning


The chromatic and clique numbers of random scaled sector graphs Random scaled sector graphs were introduced as a generalization of random geometric graphs to model networks of sensors using optical communication. In the random scaled sector graph model vertices are placed uniformly at random into the [0, 1](2) unit square. Each vertex i is assigned uniformly at random sector Si, of central angle alpha(i), in a circle of radius r(i) (with vertex i as the origin). An arc is present from vertex i to any vertex j, if j falls in S-i. In this work, we study the value of the chromatic number chi(G(n)), directed clique number omega(G(n)), and undirected clique number (omega(2)) over cap (G(n)) for random scaled sector graphs with n vertices, where each vertex spans a sector of alpha degrees with radius r(n) = root ln n/n.We prove that for values alpha infinity w.h.p., chi(G(n)) and (G(n)) are Theta(ln n/ln ln n),while omega(G(n)) is O(1), showing a clear difference with the random geometric graph model. For alpha > pi w.h.p., chi(G(n)) and (omega(2)) over cap (G(n)) are Theta(ln n), being the same for random scaled sector and random geometric graphs, while omega(G(n)) is Theta(ln n/ln ln n). (c) 2005 Elsevier B.V. All rights reserved.

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

random scaled sector graphs
random geometric graphs
chromatic number
clique number


LTCP: Improving the performance of TCP in highspeed networks In this paper, we propose Layered TCP (LTCP for short), a set of simple modifications to the congestion window response of TCP to make it more scalable in highspeed networks. LTCP modifies the TCP flow to behave as a collection of virtual flows to achieve more efficient bandwidth probing. The number of virtual flows emulated is determined based on the dynamic network conditions by using the concept of virtual layers, such that the convergence properties and RTT-unfairness behavior is maintained similar to that of TCP. In this paper, we provide the intuition and the design for the LTCP protocol modifications and evaluation results based on ns-2 simulations and Linux implementation. Our results show that LTCP has promising convergence properties, is about an order of magnitude faster than TCP in utilizing high bandwidth links, employs few parameters and retains AIMD characteristics.

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


Props: 3D-game-like mediator for improvisational storytelling ? 3D-game-like system for mediating collaborative and improvisational storytelling. Field trials with three different age groups, children, adolescents and adults. Interaction from props and prop masters to narrators dominates storytelling. More immersive setting for storytelling enhances the enjoyment of the participants.

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

storytelling support system
improvisational theatre
fictional narrative


a new permutation approach for distributed association rule mining Privacy preserving distributed data mining has become a promising research area. This paper addresses the problem of association rule mining where the global database is vertically partitioned. When transactions are distributed in different sites, scalar product is a feasible tool to discover frequent itemsets. We present a new protocol to compute scalar product between two parties with a permutation approach. We analyze the protocol in detail and demonstrate its effectiveness and high privacy properties, and compare it to other published protocols.

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

distributed data mining
privacy
scalar product


Understanding the role of gender in bloggers' switching behavior Blog has become an increasingly popular form of social networking technology in recent years. Many world famous web sites (e.g., Microsoft, Yahoo!, and Google) are providing blog services on the Internet. Bloggers, therefore, can easily establish and maintain their blogs through such services. However, research on blogs' adoption and diffusion is rare. In this study, we attempt to study bloggers' post-adoption behaviors. We examine bloggers' intention to switch their blog services by building upon studies in the marketing and IS literature. Particularly, the role of gender is explored and an online survey is conducted to test the research model. Findings confirm that bloggers' intention to switch their blog services is strongly associated with three factors: satisfaction, sunk costs, and attractive alternatives. Meanwhile, moderating effects are found in gender, but not in sunk costs. Implications for both researchers and practitioners are provided.

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

blog
gender
intention to switch
satisfaction
sunk costs
attractive alternatives


Energy efficiency in wireless sensor networks: A top-down survey The design of sustainable wireless sensor networks (WSNs) is a very challenging issue. On the one hand, energy-constrained sensors are expected to run autonomously for long periods. However, it may be cost-prohibitive to replace exhausted batteries or even impossible in hostile environments. On the other hand, unlike other networks, WSNs are designed for specific applications which range from small-size healthcare surveillance systems to large-scale environmental monitoring. Thus, any WSN deployment has to satisfy a set of requirements that differs from one application to another. In this context, a host of research work has been conducted in order to propose a wide range of solutions to the energy-saving problem. This research covers several areas going from physical layer optimisation to network layer solutions. Therefore, it is not easy for the WSN designer to select the efficient solutions that should be considered in the design of application-specific WSN architecture. We present a top-down survey of the trade-offs between application requirements and lifetime extension that arise when designing wireless sensor networks. We first identify the main categories of applications and their specific requirements. Then we present a new classification of energy-conservation schemes found in the recent literature, followed by a systematic discussion as to how these schemes conflict with the specific requirements. Finally, we survey the techniques applied in WSNs to achieve trade-off between multiple requirements, such as multi-objective optimisation.

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


A majorizationminimization weighted soft thresholding algorithm for weighted nuclear norm minimization Matrix completion problem refers to complete a low-rank matrix by observing only a few elements of the matrix. A traditional model to solve this problem is to transfer the minimization of rank into a nuclear norm minimization by replacing the rank function with nuclear norm. Another feasible solution is to build a model of minimizing weighted nuclear norm, which is more difficult to solve than the traditional one since the model denotes a non-convex optimization problem. Based on the majorizationminimization approach, this paper proposes a weighted soft-thresholding algorithm which is used to solve the model of minimizing weighted nuclear norm. Our proposed algorithm can be regarded as an improvement of the Iterative Shrinking Thresholding which is a famous l 1-norm optimization problem in the field of compressed sensing. Focusing on the matrices generated randomly and image recovery problems, our proposed algorithm experimentally shows a significant improvement with respect to the accuracy and running time in comparison with the existing matrix completion algorithms.

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

nuclear norm minimization
majorizationminimization approach
weighted soft thresholding algorithm


Biologically plausible learning in neural networks: a lesson from bacterial chemotaxis Learning processes in the brain are usually associated with plastic changes made to optimize the strength of connections between neurons. Although many details related to biophysical mechanisms of synaptic plasticity have been discovered, it is unclear how the concurrent performance of adaptive modifications in a huge number of spatial locations is organized to minimize a given objective function. Since direct experimental observation of even a relatively small subset of such changes is not feasible, computational modeling is an indispensable investigation tool for solving this problem. However, the conventional method of error back-propagation (EBP) employed for optimizing synaptic weights in artificial neural networks is not biologically plausible. This study based on computational experiments demonstrated that such optimization can be performed rather efficiently using the same general method that bacteria employ for moving closer to an attractant or away from a repellent. With regard to neural network optimization, this method consists of regulating the probability of an abrupt change in the direction of synaptic weight modification according to the temporal gradient of the objective function. Neural networks utilizing this method (regulation of modification probability, RMP) can be viewed as analogous to swimming in the multidimensional space of their parameters in the flow of biochemical agents carrying information about the optimality criterion. The efficiency of RMP is comparable to that of EBP, while RMP has several important advantages. Since the biological plausibility of RMP is beyond a reasonable doubt, the RMP concept provides a constructive framework for the experimental analysis of learning in natural neural networks.

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

learning
neural networks
bacterial chemotaxis
modification probability


Filtering noise on mammographic phantom images using local contrast modification functions This paper deals with filtering signal-dependent noise on digitized mammographic phantom images using a direct contrast modification method. First, a local contrast is computed for each pixel depending on the statistical properties of its neighbourhood. An optimal modification contrast function is then applied. This function is found by solving an optimisation problem using the mean squared error as a criterion. At last the enhanced pixel value is calculated using an inverse local contrast method. Simulated images containing objects similar to those observed in the phantom are built with different contrast and Signal to Noise Ratio (SNR) levels. Noise reduction results obtained are then compared to those of classical noise filtering methods. This comparison shows that the developed method gives better results. Evaluation was also done on real phantom images with the help of radiologists. Good results obtained lead us to consider the developed method as a good preprocessing step for quality control in mammographic facilities using image processing techniques.

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

contrast modification
noise reduction
quality control


Evaluation of Leakage Reduction Alternatives for Deep Submicron Dynamic Nonuniform Cache Architecture Caches Wire delays and leakage energy consumption are both growing problems in designing large on-chip caches. Nonuniform cache architecture (NUCA) is a wire-delay aware design paradigm based on the sub-banking of a cache, which allows the banks closer to the controller to be accessed with reduced latencies with respect to the other banks. This feature is leveraged by dynamic NUCA (D-NUCA) caches via a migration mechanism which speeds up frequently used data access, further reducing the effect wire delays have on performance. To reduce leakage power consumption of static random access memory caches, various micro-architectural techniques have been proposed. In this brief, we compare the benefits and limits of the application of some of these techniques to a D-NUCA cache memory, and propose a novel hybrid scheme based on the Drowsy and Way Adaptable techniques. Such a scheme allows further improvement in leakage reduction and limits the impact of process variation on the effectiveness of the Drowsy technique.

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

nonuniform cache architecture (nuca) cache


meta-algorithmic systems for document classification To address cost and regulatory concerns, many businesses are converting paper-based elements of their workflows into fully electronic flows that use the content of the documents. Scanning the document contents into workflows, however, is a manual, error-prone, and costly process especially when the data extraction process requires high accuracy. These manual costs are a primary barrier to widespread adoption of distributed capture solutions for business critical workflows such as insurance claims, medical records, or loan applications. Software solutions using artificial intelligence and natural language processing techniques are emerging to address these needs, but each have their individual strengths and weaknesses, and none have demonstrated a high level of accuracy across the many unstructured document types included in these business critical workflows. This paper describes how to overcome many of these limitations by intelligently combining multiple approaches for document classification using meta-algorithmic design patterns. These patterns explore the error space in multiple engines, and provide improved and "emergent" results in comparison to voting schemes and to the output of any of the individual engines. This paper considers the results of the individual engines along with traditional combinatorial techniques such as voting, before describing prototype results for a variety of novel metaalgorithmic patterns that reduce individual document error rates by up to 13\% and reduce system error rates by up to 38\%.

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

document indexing
confusion matrix
engine combination
meta-algorithmics


Contract type and decision right of sales promotion in supply chain management with a capital constrained retailer ? A consignment contract should match with manufacturers sales promotion (MC). A wholesale price contract should match with retailers sales promotion (RP). Each one prefers to fully control demand if it has more power and enough capital. Mode MC matches for low price customers, RP for those also enjoying sales promotions. Our results are consistent with the practice of Best Buy, Gome and Suning.

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

supply chain management
decision right of sales promotion
wholesale price contract
consignment contract


Locating and Characterizing the Stationary Points of the Extended Rosenbrock Function Two variants of the extended Rosenbrock function are analyzed in order to find the stationary points. The first variant is shown to possess a single stationary point, the global minimum. The second variant has numerous stationary points for high dimensionality. A previously proposed method is shown to be numerically intractable, requiring arbitrary precision computation in many cases to enumerate candidate solutions. Instead, a standard Newtonian method with multi-start is applied to locate stationary points. The relative magnitude of the negative and positive eigenvalues of the Hessian is also computed, in order to characterize the saddle points. For dimensions Lip to 100, only two local minimizers are found, but many saddle points exist. Two saddle points with a single negative eigenvalue exist for high dimensionality, which may appear as "near" local minima. The remaining saddle points we found have a predictable form, and a method is proposed to estimate their number. Monte Carlo simulation indicates that it is unlikely to escape these saddle points using uniform random search. A standard particle swarm algorithm also struggles to improve upon a saddle point contained within the initial population.

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

numerical optimization
benchmark functions


Frontier between decidability and undecidability: a survey After recalling the definition of decidability and universality, we first give a survey of results on the as exact as possible border betweeen a decidable problem and the corresponding undecidablity question in various models of discrete computation: diophantine equations, word problem, Post systems, molecular computations, register machines, neural networks, cellular automata, tiling the plane and Turing machines with planar tape. We then go on with results more specific to classical Turing machines, with a survey of results and a sketchy account on technics. We conclude by an illustration on simulating the 3x + 1 problem. (C) 2000 Elsevier Science B.V. All rights reserved.

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

discrete computations
decidability versus undecidability
halting problem


Convergence of batch gradient learning algorithm with smoothing L1/2 regularization for SigmaPiSigma neural networks ? SigmaPiSigma neural networks are known to provide more powerful mapping capability than traditional feed-forward neural networks. The L1/2 regularizer is very useful and efficient, and can be taken as a representative of all the Lq(0<q<1) L q ( 0 < q < 1 ) regularizers. However, the nonsmoothness of L1/2 regularization may lead to oscillation phenomenon. The aim of this paper is to develop a novel batch gradient method with smoothing L1/2 regularization for SigmaPiSigma neural networks. Compared with conventional gradient learning algorithm, this method produces sparser weights and simpler structure, and it improves the learning efficiency. A comprehensive study on the weak and strong convergence results for this algorithm are also presented, indicating that the gradient of the error function goes to zero and the weight sequence goes to a fixed value, respectively.

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

sigmapisigma neural networks
batch gradient learning algorithm
convergence


The optimized model of multiple invasion percolation We study the optimized version of the multiple invasion percolation model. Some topological aspects as the behavior of the acceptance profile, coordination number and vertex type abundance were investigated and compared to those of the ordinary invasion. Our results indicate that the clusters show a very high degree of connectivity, spoiling the usual nodes-links-blobs geometrical picture.

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


a novel technique for indexing video surveillance data Recent worldwide events have renewed interest in the use of video surveillance as a tool for private security, law enforcement and military applications. After appropriate feature extraction has taken place, most video surveillance problems are reduced to the problem of efficiently and robustly matching motion streams. Since all natural motion typically has some variability in the time axis, Dynamic Time Warping (DTW), a technique that aligns the motion streams before calculating their similarity, is typically used. However, DTW can only address the problem of local scaling. As we demonstrate in this work, uniform scaling may be just as important for meaningful automatic analysis of video surveillance data streams. In this work, we demonstrate a novel technique to index of similarity search under uniform scaling. As we will demonstrate, our technique is simple and intuitive, and can achieve a speedup of 2 to 3 orders of magnitude under realistic settings.

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

indexing
surveillance data
uniform scaling


Analysis of the impact of different methods for division/square root computation in the performance of a superscalar microprocessor An analysis of the impact of different methods for double-precision computation of division and square root in the performance of a superscalar processor is presented in this paper. This analysis is carried out combining the SimpleScalar toolset, estimates of the latency and throughput for the compared methods and a set of benchmarks with typical features of intensive computing applications. Simulation results show the importance of having an efficient unit for the computation of these operations, since changes in the density of division and square root below 1% lead to changes in the performance around a 20%.

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

superscalar processors
computational intensive applications


Integrating GI with non-GI servicesshowcasing interoperability in a heterogeneous service-oriented architecture The concept of a service-oriented architecture provides a technical foundation for delivering, using, and integrating software. It can serve as an approach to integrate GIS with other, non-GIS applications. This paper presents and discusses a service-oriented architecture that embraces a GIS and an enterprise resource planning system. The two information systems make mutually required functionalities available as services. This defines the showcase for making GI and non-GI services syntactically and semantically interoperable. The services-based integration leverages open-standard interfacing and, thus, removes syntactic heterogeneity. The integration is discussed in terms of an emergency management scenario. This scenario also helps to outline challenging semantic interoperability issues. When services provided by GIS and non-GIS applications interact, the problem arises how their different conceptualizations should be mapped. This paper analyzes essential ontological distinctions for mapping conceptual schemes in GI locator services and non-GI services. It proposes a hybrid decentralized approach of concept mapping, based on a common top-level ontology.

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

enterprise resource planning (erp) system


Guided exploration with dynamic potential fields: the CubicalPath system Exploring unknown models or scenes is a highly interactive and dynamic process. Systems for automatic presentation of models or scenes either require cinematographic rules, direct human interaction, framesets, or pre-calculation of paths to a known goal. In this paper we present a system which can deal with rapidly changing user interest in objects of a scene or model as well as with dynamic models and changes of the camera position introduced interactively by the user or through cuts. We describe Cubical Path, a new potential field-based camera control system that helps with the exploration of virtual environments.

B I O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 potential fields
guided exploration


Performance of Walsh-based hybrid-mixed stress analysis The most relevant aspects involved in the implementation of the stress model of the hybrid-mixed finite element formulation are presented and discussed. In this formulation, the stress and displacement fields in the domain of the element and the displacements on the boundary are simultaneously approximated. Digital Walsh functions are used in all three approximations. Due to the special properties of these functions, it is possible to obtain closed form solutions for the integrals involved in the computation of the structural operators. The governing system is usually very large in dimension, but also well structured and highly sparse. Consequently, the use of adequate algorithms to store and manipulate sparse matrices is essential to ensure the numerical efficiency of the model. The direct and iterative methods most used in the solution of large, sparse systems of linear equations are tested and assessed. Fast transform algorithms are used in the post-processing phase to perform the linear combinations of digital Walsh functions needed to construct the stress and displacement fields from their direct approximations. Linear elastostatic problems are used to illustrate the implementation of the Walsh-based hybrid-mixed stress elements.

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

hybrid-mixed formulations
stress models
elasticity


SIPPI: A Matlab toolbox for sampling the solution to inverse problems with complex prior information: Part 2Application to crosshole GPR tomography We present an application of the SIPPI Matlab toolbox, to obtain a sample from the a posteriori probability density function for the classical tomographic inversion problem. We consider a number of different forward models, linear and non-linear, such as ray based forward models that rely on the high frequency approximation of the wave-equation and fat ray based forward models relying on finite frequency theory. In order to sample the a posteriori probability density function we make use of both least squares based inversion, for linear Gaussian inverse problems, and the extended Metropolis sampler, for non-linear non-Gaussian inverse problems. To illustrate the applicability of the SIPPI toolbox to a tomographic field data set we use a cross-borehole traveltime data set from Arrens, Denmark. Both the computer code and the data are released in the public domain using open source and open data licenses. The code has been developed to facilitate inversion of 2D and 3D travel time tomographic data using a wide range of possible a priori models and choices of forward models.

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

inversion
tomography
sampling
a priori
a posteriori


Fractional-Neuro-Optimizer: A Neural-Network-Based Optimization Method Up to now, there have been many attempts in the use of artificial neural networks (ANNs) for solving optimization problems and some types of ANNs, such as Hopfield network and Boltzmann machine, have been applied for combinatorial optimization problems. However, there are some restrictions in the use of ANNs as optimizers. For example: (1) ANNs cannot optimize continuous variable problems; (2) discrete problems should be mapped into the neural networks architecture; and (3) most of the existing neural networks are applicable only for a class of smooth optimization problems and global convexity conditions on the objective functions and constraints are required. In this paper, we introduce a new procedure for stochastic optimization by a recurrent ANN. The concept of fractional calculus is adopted to propose a novel weight updating rule. The introduced method is called fractional-neuro-optimizer (FNO). This method starts with an initial solution and adjusts the networks weights by a new heuristic and unsupervised rule to reach a good solution. The efficiency of FNO is compared to the genetic algorithm and particle swarm optimization techniques. Finally, the proposed FNO is used for determining the parameters of a proportionalintegralderivative controller for an automatic voltage regulator power system and is applied for designing the water distribution networks.

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

numerical optimization
neural network
avr power system
water distribution system


Integration of the global positioning system and geographical information systems for traffic congestion studies The Transport Systems Centre (TSC) has developed an integrated Global Positioning System (GPS) Geographical Information System (GIS) for collecting on-road traffic data from a probe vehicle. This system has been further integrated with the engine management system of a vehicle to provide time-tagged data on GPS position and speed, distance travelled, acceleration, fuel consumption, engine performance, and air pollutant emissions on a second-by-second basis. These data are handled within a GIS and can be processed and queried during the data collection (from a notebook PC in the vehicle) or saved to a file for later analysis. The database so generated provides a rich source of information for studies of travel times and delays, congestion levels, and energy and emissions. A case study application of the system is described focusing on studies of congestion levels on two parallel routes in a major arterial corridor in metropolitan Adelaide, South Australia. As part of these investigations, a discussion of the nature of traffic congestion is given. This provides both a general definition of traffic congestion and the discussion of a number of parametric measures of congestion. The computation of these parameters for the study corridor on the basis of data collected from the integrated GPSGIS system is described. The GIS provides a database management platform for the integration, display, and analysis of the data collected from GPS and the in-vehicle instrumentation.

O O O B I I O O O O O B I O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 congestion
global positioning system

moving observer traffic studies
geographic information system
traffic data analysis


A convolutional recursive modified Self Organizing Map for handwritten digits recognition It is well known that the handwritten digits recognition is a challenging problem. Different classification algorithms have been applied to solve it. Among them, the Self Organizing Maps (SOM) produced promising results. In this paper, first we introduce a Modified SOM for the vector quantization problem with improved initialization process and topology preservation. Then we develop a Convolutional Recursive Modified SOM and apply it to the problem of handwritten digits recognition. The computational results obtained using the well known MNIST dataset demonstrate the superiority of the proposed algorithm over the existing SOM-based algorithms.

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

self organizing maps
vector quantization

som initialization
som topology
recursive neural network
convolutional neural network


Space complexity equivalence of P systems with active membranes and Turing machines We prove that arbitrary single-tape Turing machines can be simulated by uniform families of P systems with active membranes with a cubic slowdown and quadratic space overhead. This result is the culmination of a series of previous partial results, finally establishing the equivalence (up to a polynomial) of many space complexity classes defined in terms of P systems and Turing machines. The equivalence we obtained also allows a number of classic computational complexity theorems, such as Savitch's theorem and the space hierarchy theorem, to be directly translated into statements about membrane systems.

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

p systems with active membranes
turing machines
computational complexity