Efficient 2-D DOA estimation for coherent sources with a sparse acoustic vector-sensor array This paper proposes a computationally efficient two-dimensional (2-D) direction-of-arrival (DOA) estimation algorithm based extended-aperture for acoustic coherent signals impinging on a sparse acoustic vector-sensor array. The coherency of incident signals is decorrelated through matrix averaging and the signal/noise subspaces are reconstructed through a linear operation of a matrix formed from the cross-correlations between some sensor data, where the effect of additive noise is eliminated. Consequently, DOAs can be estimated without performing eigen-decomposition (into signal/noise subspaces), and there is no need to evaluate all correlations of the array data. The derived estimates are automatically matched by translating eigenvalues into real-valued ones, furthermore, the proposed method can achieve the unambiguous direction estimates with enhanced accuracy by setting the vector sensors to space much farther apart than a half-wavelength, and it is also suitable for the case of spatially nonuniform noise, which may be more realistic scenario for the sparsely placed sensors. The performance of the proposed method is demonstrated through numerical examples.

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

coherent signals
spatially nonuniform noise
linear operation


Extraction of Informative Genes from Multiple Microarray Data Integrated by Rank-Based Approach By converting the expression values of each sample into the corresponding rank values, the rank-based approach enables the direct integration of multiple microarray data produced by different laboratories and/or different techniques. In this study, we verify through statistical and experimental methods that informative genes can be extracted from multiple microarray data integrated by the rank-based approach (briefly, integrated rank-based microarray data). First, after showing that a nonparametric technique can be used effectively as a scoring metric for rank-based microarray data, we prove that the scoring results from integrated rank-based microarray data are statistically significant. Next, through experimental comparisons, we show that the informative genes from integrated rank-based microarray data are statistically more significant than those of single-microarray data. In addition, by comparing the lists of informative genes extracted from experimental data, we show that the rankbased data integration method extracts more significant genes than the z-score-based normalization technique or the rank products technique. Public cancer microarray data were used for our experiments and the marker genes list from the CGAP database was used to compare the extracted genes. The GO database and the GSEA method were also used to analyze the functionalities of the extracted genes.

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


An algorithm framework of sparse minimization for positive definite quadratic forms An algorithm framework of sparse minimization for PDQF is proposed. The convergence to global minimum is proved. Its computational complexity is analyzed and compared with FISTA. Some well-known methods are illustrated to be optimized by the proposed algorithm. Illustrative experiments show that SRC and LASSO via the proposed method converges quickly.

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

l1-norm
positive definite quadratic form
pattern recognition


Consequence of one-electron oxidation and one-electron reduction for aniline Quantum-chemical calculations were performed for all possible isomers of neutral aniline and its redox forms, and intramolecular proton-transfer (prototropy) accompanied by pi-electron delocalization was analyzed. One-electron oxidation (PhNH(2) - e -> aEuro parts per thousand[PhNH(2)](+aEuro cent)) has no important effect on tautomeric preferences. The enamine tautomer is preferred for oxidized aniline similarly as for the neutral molecule. Dramatical changes take place when proceeding from neutral to reduced aniline. One-electron reduction (PhNH(2) + e -> aEuro parts per thousand[PhNH(2)](-aEuro cent)) favors the imine tautomer. Independently on the state of oxidation, pi- and n-electrons are more delocalized for the enamine than imine tautomers. The change of the tautomeric preferences for reduced aniline may partially explain the origin of the CH tautomers for reduced nucleobases (cytosine, adenine, and guanine).

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

charged radicals
dft
pi-electron delocalization
one-electron oxidation
one-electron reduction


Shuffled frog leaping algorithm and its application to 0/1 knapsack problem Here, a modified discrete shuffled frog leaping algorithm (MDSFL) is proposed to solve 01 knapsack problems. Different types of knapsack problem instances are generated to test the convergence property of MDSFLA. The result shows that it is very effective in solving small to medium sized knapsack problems. Computational experiments with a set of large-scale instances show that the MDSFL can be an efficient alternative for solving tightly constrained 01 knapsack problems.

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


Improvement of power systems damping using genetic algorithms aided proportional plus derivative output feedback for TCSC This paper develops a proportional plus derivative (PD) control scheme for a thyristor controlled series compensator (TCSC) to reinforce Power system damping performance. This PD control scheme is aided by the use of genetic algorithms (GAs). The effectiveness of the proposed method is demonstrated through computer simulation using a multi-machine power system associated with a single TCSC Results show that the proposed PD controller can achieve good damping performance.

O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O 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 concise survey of scheduling with time-dependent processing times We consider a class of machine scheduling problems in which the processing time of a task is dependent on its starting time in a schedule. On reviewing the literature on this topic, we provide a framework to illustrate how models for this class of problems have been generalized from the classical scheduling theory. A complexity boundary is presented for each model and related existing results are consolidated. We also introduce some enumerative solution algorithms and heuristics and analyze their performance. Finally, we suggest a few interesting areas for future research.

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

sequencing
time dependence
computational complexity


mining interlacing manifolds in high dimensional spaces Real world data are often composed of conceptually meaningful subspaces, e.g., for portraits in a facial image database, the illumination factor corresponds to a nonlinear subspace and the rotation factor corresponds to another. The interlacement of these subspaces may greatly increase the complexity of the data and impede our understanding and further processing. To identify interlacing subspaces and extract the essential structural knowledge from a given dataset, we present a novel approach termed Multi-Manifold Partition (MMP). Global manifolds that corresponds to conceptually meaningful subspaces are discovered in three steps: First, a neighborhood graph is built to capture the intrinsic topological structure of the input data; then, the uniformity of neighboring nodes is analyzed and segments of manifolds are created by connecting adjacent samples that are conform in dimension; finally, segments possibly from the same manifold are combined to obtain a global representation of underlying subspaces. Experimental results on two synthetic datasets and a practical Optical Character Recognition (OCR) problem show that MMP is effective in extracting interlacing structures and thus offers us better interpretation of the nature of the data.

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

dimension reduction
manifold learning
intrinsic dimension
multi-manifold partition
exploratory data analysis


An extensible, modular architecture for simulating urban development, transportation, and environmental impacts UrbanSim simulates the development of urban areas, including land use, transportation, and environmental impacts, over periods of 20 or more years. Its purpose is to aid urban planners, residents, and elected officials in evaluating the long-term results of alternate plans, particularly as they relate to such issues as housing, business and economic development, sprawl, open space, traffic congestion, and resource consumption. From a software perspective, it is a large, complex, system, with heavy demands for excellent space efficiency and support for software evolution. It consists of a collection of models that represent different urban actors and processes, an object store that holds the state of the simulated urban environment, a model coordinator that schedules models to run and notifies them when data of interest has changed, and a translation and aggregation layer that performs a range of data conversions to mediate between the object store and the models. The paper concludes with a discussion of the lessons learned regarding software architecture to support rapid evolution within the field of urban simulation.

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

urban simulation
software architecture
urbansim

land use and transportation
java
open source


Improvements in the analysis of domain motions in proteins from conformational change: DynDom version 1.50 DynDom is a program that analyses conformational change in proteins for dynamic domains, hinge axes, and hinge-bending regions. Here, a number of improvements and additions are reported which have been implemented in the new version 1.50. The most significant improvement is in the determination of the hinge-bending residues. A new routine also compares quantities relating to the main-chain dihedrals of bending residues with the hinge-bending motion. This version of the program can now be run from the DynDom website at: http://www.sys.uea.ac.uk/dyndom.

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

proteins conformational change
hinge bending


Bankruptcy prediction for Russian companies: Application of combined classifiers We use a dataset of more than 3,500 Russian manufacturing companies. We use different combined classifiers (LR, ANN, MDA, CRT) for bankruptcy prediction. Classical models of bankruptcy demonstrate low accuracy of bankruptcy prediction. Classifiers combined by AdaBoost approach show highest classification accuracy. Only one indicator stipulated by Russian legislation is effective for prediction.

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

logit-regression
artificial neural networks
classification and regression trees


Efficiency of a Combined Protection Method against Correlation Power Analysis Side-Attacks on Microsystems We analyze the efficiency of the masking of instruction patterns using a chaotic driven clock and power supply, in front of a side attack intruding the power supply of a microsystem. The differential analysis is supposedly conducted by correlation power analysis. We demonstrate that the use of a chaotically-driven masking based on relatively simple circuits may be a significant candidate for the protection of embedded systems.

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

physical security
hardware
chaos
control signal
security evaluation


Imaging the distribution of magnetic nanoparticles with ultrasound Magnetic nanoparticles can be caused to oscillate under the influence of an incident ultrasonic wave. If the particles are momentarily aligned with a magnetizing pulse creating a macroscopic magnetization, this oscillation will result in a time-varying magnetic moment which should be detectable as an induced voltage in a nearby pickup coil. In this way, focused ultrasound can be used to map, or image, the spatial distribution of the magnetic particles after these particles have been introduced into the body. The magnetic particles could be antibody-labeled to target tumor cells or used as a cardiovascular contrast agent, among other applications. The magnitude of the induced signal is estimated for one micron particles with a Fe/tissue volume fraction of 10(-6), which is about the limit of detectability for MRI superparamagnetic contrast agents consisting of single domain iron-oxide particles. One advantage of this method compared to conventional MRI is potentially greater sensitivity due to the absence of a large background signal.

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

acoustic propagation
biomedical imaging
electromagnetic induction
image reconstruction
magnetization processes
magnetoacoustic effects
nanotechnology


Why the magic number seven plus or minus two In 1956, Miller [1] conjectured that there is an upper limit on our capacity to process information on simultaneously interacting elements with reliable accuracy and with validity. This limit is seven plus or minus two elements. He noted that the number 7 occurs in many aspects of life, from the seven wonders of the world to the seven seas and seven deadly sins. We demonstrate in this paper that in making preference judgments on pairs of elements in a group, as we do in the analytic hierarchy process (AHP), the number of elements in the group should be no more than seven. The reason is founded in the consistency of information derived from relations among the elements. When the number of elements increases past seven, the resulting increase in inconsistency is too small for the mind to single out the element that causes the greatest inconsistency to scrutinize and correct its relation to the other elements, and the result is confusion to the mind from the existing information. The AHP as a theory of measurement has a basic way to obtain a measure of inconsistency for any such set of pairwise judgments. When the number of elements is seven or less the inconsistency measurement is relatively large with respect to the number of elements involved; when the number is more it is relatively small. The most inconsistent judgment is easily determined in the first case and the individual providing the judgments can change it in an effort to improve the overall inconsistency. In the second case, as the inconsistency measurement is relatively small, improving inconsistency requires only small perturbations and the judge would be hard put to determine what that change should be, and how such a small change could be justified for improving the validity of the outcome. The mind is sufficiently sensitive to improve large inconsistencies but not small ones. And the implication of this is that the number of elements in a set should be limited to seven plus or minus two. (C) 2003 Elsevier Ltd. All rights reserved.

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

paired comparisons
decision making
information processing
mental limits


Availability of a periodically inspected system, maintained under an imperfect-repair policy A periodically inspected system is maintained through a fixed number of imperfect-repairs before being replaced or perfectly repaired. The lifetime distribution of the system in its new and imperfectly repaired states is arbitrary. The times required for imperfect repairs and for perfect repair or replacement are random. The repaired system is restored to operation at the next scheduled inspection time. The system availability function is expressed as the weighted average of the survival functions and their shifts, and gives the limiting average availability.

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

continuous monitoring
exponential distribution
gamma distribution
lognormal distribution
random repair-time
weibull distribution


A controlled experiment to assess the impact of system architectures on new system requirements While much research attention has been paid to transitioning from requirements to software architectures, relatively little attention has been paid to how new requirements are affected by an existing system architecture. Specifically, no scientific studies have been conducted on the characteristic differences between the newly elicited requirements gathered in the presence or absence of an existing software architecture. This paper describes an exploratory controlled study investigating such requirements characteristics. We identify a multitude of characteristics (e.g., end-user focus, technological focus, and importance) that were affected by the presence or absence of an SA, together with the extent of this effect. Furthermore, we identify the specific aspects of the architecture that had an impact on the characteristics. The study results have implications for RE process engineering, post-requirements analysis, requirements engineering tools, traceability management, and future empirical work in RE based on several emergent hypotheses resultant from this study.

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

requirements engineering
software architecture
controlled study

empirical study
software engineering
software process


Mining high coherent association rules with consideration of support measure ? We propose a HCAR algorithm for mining high coherent association rules. The derived rules have the logical equivalence property. The derived rules are expected to be more reliable in terms of business. Lower and upper bounds of itemsets are defined for speeding up the process. Two datasets are used to show the proposed approach is effective.

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

data mining
propositional logic
coherent rules
highly coherent rules


linear

degree

extractors

and

the

inapproximability

of

max

clique

and

chromatic

number

A

randomness

extractor

is

an

algorithm

which

extracts

randomness

from

a

low-quality

random

source,

using

some

additional

truly

random

bits.

We

construct

new

extractors

which

require

only

log

n

additional

random

bits

for

sources

with

constant

entropy

rate.

We

further

construct

dispersers,

which

are

similar

to

one-sided

extractors,

which

use

an

arbitrarily

small

constant

times

log

n

additional

random

bits

for

sources

with

constant

entropy

rate.

Our

extractors

and

dispersers

output

fraction

of

the

randomness,

for

any

use

our

dispersers

to

derandomize

results

of

Hastad

and

Feige-Kilian

and

show

that

for

all

approximating

MAX

CLIQUE

and

CHROMATIC

NUMBER

to

within

n

are

NP-hard.

We

also

derandomize

the

results

of

Khot

and

show

that

for

some

no

quasi-polynomial

time

algorithm

approximates

MAX

CLIQUE

or

CHROMATIC

NUMBER

to

within

(log

n)

unless

NP

P.Our

constructions

rely

on

recent

results

in

additive

number

theory

and

extractors

by

Bourgain-Katz-Tao

Barak-Impagliazzo-Wigderson

Barak-Kindler-Shaltiel-Sudakov-Wigderson

and

Raz

We

also

simplify

and

slightly

strengthen

key

theorems

in

the

second

and

third

of

these

papers,

and

strengthen

a

related

theorem

by

Bourgain

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

disperser
approximation
explicit construction
pseudorandom
np-hard


Optimal selections of orthodontic mini-implant diameter and length by biomechanical consideration: A three-dimensional finite element analysis A finite element analysis was carried out to evaluate continuous and simultaneous variations of orthodontic mini-implant diameter and length, and to identify their optimal ranges in the maxillary posterior region. Within the ranges of diameter from 1.0mm to 2.0mm and the length from 6.0mm to 16.0mm, our results showed that the increases of the diameter and length reduced the maximum equivalent stresses in cortical, cancellous bones and mini-implant by 80.94%, 91.84% and 86.11%, respectively, and the maximum displacement in the mini-implant by 81.29%. When the diameter exceeded 1.5mm and the length exceeded 11.0mm, the mini-implant achieved the best stability and the lowest levels of stress and displacement. At the similar increment, the change in the diameter was more effective than the change of length in reducing bone-implant complex stresses and enhancing mini-implant stability. Diameter exceeding 1.5mm in combination with the longest length in safety range were the optimal biomechanical choice for the maxillary posterior region in a screwed orthodontic mini-implant.

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


Voting-Based Ensemble Classifiers to Detect Hedges and Their Scopes in Biomedical Texts Previous studies of pattern recognition have shown that classifiers ensemble approaches can lead to better recognition results. In this paper, we apply the voting technique for the CoNLL-2010 shared task on detecting hedge cues and their scope in biomedical texts. Six machine learning-based systems are combined through three different voting schemes. We demonstrate the effectiveness of classifiers ensemble approaches and compare the performance of three different voting schemes for hedge cue and their scope detection. Experiments on the CoNLL-2010 evaluation data show that our best system achieves an F-score of 87.49% on hedge detection task and 60.87% on scope finding task respectively, which are significantly better than those of the previous systems.

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


A meta-modeling approach to designing e-warehousing systems A business application that leverages the Internet for selling products and services or for information dissemination is called an e-business solution. In the past few years, organizations have moved aggressively towards deploying e-business solutions to improve process efficiencies, be competitive, access new markets, increase market share, reduce costs and satisfy an array of other business drivers. Within the domain of e-business initiatives, particular emphasis has been provided on e-warehousing initiatives. The differentiating facet of e-warehousing initiatives is that they are high-impact solutions that affect various parts of the organization, and ultimately the business goals of the enterprise, by providing relevant decision-making information at the manager's desktop, irrespective of geographic location. Despite this, many of these initiatives are technology based and have lacked strategic level sponsorship, leading to compromised results. Development of e-warehousing systems should be viewed as a strategic business initiative with distinctly different business models and processes. Traditional design approaches alone are not suited to such strategic initiatives. E-warehousing initiatives require new models for design in the early stages of development. In the later stages, traditional design approaches are applicable. In this article, we propose a meta-modeling approach for e-warehousing initiatives. The model has four components: developing business goals and strategies, defining functional business processes, developing an e-warehousing integration architecture, and designing metrics for evaluating the performance of the e-warehousing initiative. This model is illustrated by using an e-warehousing initiative for a government agency.

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


eliminating routing protocol anomalies in wireless sensor networks using ai techniques The specific nature of routing in sensor networks has made possible new sorts of attacks that can have closer insight and effect on the networks packets, the most important being the packet tampering. Routing attacks on the network level are the first step in tampering with the packets. In this work we propose a solution for detecting and eliminating these attacks that couples reputation systems with clustering techniques, namely unsupervised genetic algorithm and self-organizing maps, trained for detecting outliers in data. The algorithms use the feature space based on sequences of routing hops that provides ability of detecting wide range of attacks. We further present a flexible way of integrating the solution into targeted sensor network that can easily adapt its computational requirements to the existing network resources. The solution offers many benefits: scalable solution, fast response to adversarial activities, ability to detect unknown attacks, high adaptability, flexible integration, and high ability in detecting and confining attacks.

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

outlier detection
reputation system
routing protocols


View invariant action recognition using generalized 4D features ? We recognize actions independently of viewpoints using generalized 4D features. We developed new 4D-STIPs with 3D space volumes by extending the widely used 3D-STIPs. Arbitrary view point can be generated by projecting 3D space volumes and 4D-STIPs. We proposed non-motion features to encode stationary part of an action. The proposed method outperforms when the test view is not in the training set.

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


Revisiting a randomized algorithm for the minimum rainbow subgraph problem The minimum rainbow subgraph problem arises in bioinformatics. The graph is given as an edge-colored undirected graph. Our goal is to find a subgraph with minimum number of vertices such that there is exactly one edge from each color class. The currently best approximation ratio achieved by a deterministic approximation algorithm is O(?) O ( ? ) . (Here ? is the max degree of a graph.) In [4] he proposes a randomized algorithm which achieves an approximation ratio of O ( ? ln ? ? ) . However, we find that there is a flaw in his probability analysis which renders this approximation ratio invalid. We present a simple example to show why his analysis does not work. Instead, we propose an alternative analysis for his randomized algorithm. Our estimate shows that this randomized algorithm may achieve approximation ratio of O(?) O ( ? ) in general. However, if the number of colors is ?(n?r) ? ( n ? r ) for some positive r?1 r ? 1 , his randomized algorithm can beat the bound of O(?) O ( ? ) . Moreover, through our analysis, we also find that if we impose an extra constraint on the color function, the bound O ( ? ln ? ? ) still holds.

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

randomized algorithm
minimum rainbow subgraph


A Novel Grid Occupancy Criterion for Independent Component Analysis Transform each coordinate of the realizations of several random variables (RVs) by the distribution function of the corresponding RV and partition the range space into a uniform grid. The expected number of occupied grid-boxes will be greatest when these RVs are independent. Based on this fact, we propose a novel measure of independence named grid occupancy (GO). We also address the problem of how to make optimum selection of the parameters in GO, i.e., the number of observations and the number of quantization levels. In addition, we apply GO to independent component analysis (ICA). The GO based ICA algorithm can separate signals with arbitrary continuous distributions and favors digital hardware implementation.

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

independence
independent component analysis


Optimization of different welding processes using statistical and numerical approaches A reference guide Welding input parameters play a very significant role in determining the quality of a weld joint. The joint quality can be defined in terms of properties such as weld-bead geometry, mechanical properties, and distortion. Generally, all welding processes are used with the aim of obtaining a welded joint with the desired weld-bead parameters, excellent mechanical properties with minimum distortion. Nowadays, application of design of experiment (DoE), evolutionary algorithms and computational network are widely used to develop a mathematical relationship between the welding process input parameters and the output variables of the weld joint in order to determine the welding input parameters that lead to the desired weld quality. A comprehensive literature review of the application of these methods in the area of welding has been introduced herein. This review was classified according to the output features of the weld, i.e. bead geometry and mechanical properties of the welds.

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


A pipeline technique for dynamic data transfer on a multiprocessor grid This paper describes a pipeline technique which is used to redistribute data on a multiprocessor grid during runtime. The main purposes of the algorithm are to minimize the data transfer time, prevent congestion on the ports of the receiving processors, and minimize the number of idle processors. One of the key ideas for this algorithm is the creation of processor classes, firstly introduced by Desprez et al. [IEEE Transactions on Parallel and Distributed Systems 9(2):102 (1998).] Based on the idea of classes, we create the pipeline tasks used to organize the redistribution of data. Our experimental results show that this pipeline technique can significantly reduce the amount of time required to complete a dynamic data transfer task.

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

block-cyclic redistribution
high performance fortran


Goal-centric traceability: Using virtual plumblines to maintain critical systemic qualities Successful software development involves the elicitation, implementation, and management of critical systemic requirements related to qualities such as security, usability, and performance. Unfortunately, even when such qualities are carefully incorporated into the initial design and implemented code, there are no guarantees that they will be consistently maintained throughout the lifetime of the software system. Even though it is well known that system qualities tend to erode as functional and environmental changes are introduced, existing regression testing techniques are primarily designed to test the impact of change upon system functionality rather than to evaluate how it might affect more global qualities. The concept of using goal-centric traceability to establish relationships between a set of strategically placed assessment models and system goals is introduced. This paper describes the process, algorithms, and techniques for utilizing goal models to establish executable traces between goals and assessment models, detect change impact points through the use of automated traceability techniques, propagate impact events, and assess the impact of change upon systemic qualities. The approach is illustrated through two case studies.

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

quality goals
nonfunctional requirements
goal modeling
software maintenance
software evolution


Multiscale active contours We propose a new multiscale image segmentation model, based on the active contour/snake model and the Polyakov action. The concept of scale, general issue in physics and signal processing, is introduced in the active contour model, which is a well-known image segmentation model that consists of evolving a contour in images toward the boundaries of objects. The Polyakov action, introduced in image processing by Sochen-Kimmel-Malladi in Sochen et al. (1998), provides an efficient mathematical framework to define a multiscale segmentation model because it generalizes the concept of harmonic maps embedded in higher-dimensional Riemannian manifolds such as multiscale images. Our multiscale segmentation model, unlike classical multiscale segmentations which work scale by scale to speed up the segmentation process, uses all scales simultaneously, i.e. the whole scale space, to introduce the geometry of multiscale images in the segmentation process. The extracted multiscale structures will be useful to efficiently improve the robustness and the performance of standard shape analysis techniques such as shape recognition and shape registration. Another advantage of our method is to use not only the Gaussian scale space but also many other multiscale spaces such as the Perona-Malik scale space, the curvature scale space or the Beltrami scale space. Finally, this multiscale segmentation technique is coupled with a multiscale edge detecting function based on the gradient vector flow model, which is able to extract convex and concave object boundaries independent of the initial condition. We apply our multiscale segmentation model on a synthetic image and a medical image.

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

active contour
scale space
multiscale segmentation
polyakov action
riemannian manifolds
gradient vector flow


Synthesising carbon emission for mega-cities: A static spatial microsimulation of transport CO2 from urban travel in Beijing A static spatial microsimulation is developed at the sub-district level in urban Beijing. The realistic synthetic populations travel distance and mode choice are spatially simulated at micro-scale. Transport CO2 emission from urban travel is also synthesized at the disaggregate level. It presents a new bottom-up methodology to provide improved transport CO2 emission estimation.

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

spatial microsimulation
transport co2 emission
beijing


Mode-enriched dispersion models of periodic materials within a multiscale mixed finite element framework A group of methods is presented for the high frequency dispersive modeling of elastic wave propagation in periodic media. The methods fall within the framework of the multiscale assumed strain projection methodology. In previous work, the solution field was projected onto a subspace spanned by a set of high-order characteristic functions generated by a hierarchical homogenization analysis scheme. In the present study, the projection space is replaced, or alternatively enhanced, with periodic eigenvectors obtained from direct solution of the eigenvalue problem governing the dispersion relation. In a novel manner, these FloquetBloch eigenvectors are selected in both the spatial and temporal frequency domains. The new mode enrichment techniques are shown to provide excellent accuracy for dispersion curves calculations across wide frequency ranges. Substantial savings in computational costs are documented for large problems compared to the direct solution approach.

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

phononic crystals
high frequency dispersion
multiscale modeling
floquetbloch wave vectors
mixed finite elements


An investigation of user attitudes toward search engines as an information retrieval tool After the Internet has gained great popularity at homes and schools, there is much information on the Web. Today, one of the primary uses of the Internet is information retrieval from search engines. The main purpose of the current study is to develop and examine an individual attitude model towards search engines as a tool for retrieving information. This model integrates individual computer experience with perceptions. In addition, it also combines perception theories, such as technology acceptance model (TAM) and motivation, in order to understand individual attitudes toward search engines. The results show that individual computer experience, quality of search systems, motivation, and perceptions of technology acceptance are all key factors that affect individual feelings to use search engines as an information retrieval tool.

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

internet
individual attitude
tam
motivation


a reference-counting garbage collection algorithmfor cyclical functional programming Reference-counting garbage collection is known to have problems with the collection of cyclically connected data. There are two historically significant styles of cycle-aware algorithms: The style of Brownbridge that maintains a subset of marked edges and the invariant that every cycle contains at least one marked edge, and the style of Martinez-Lins-Wachenchauzer (MLW) that involves local mark-and-scan procedures to detect cycles. The former is known to be difficult to design and implement correctly, and the latter to have pathological efficiency for a number of very typical situations. We present a novel algorithm that combines both approaches to obtain reasonably efficient local mark-and-scan phases with a marking invariant that is rather cheap to maintain. We demonstrate that the assumptions of this algorithm about mutator activity patterns make it well-suited, but not limited, to a functional programming technique for cyclic data. We evaluate the approach in comparison with simple and more sophisticated MLW algorithms using a simple benchmark based on that functional paradigm.

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

garbage collection
functional programming
cycles


A novel interface-tracking method based on Lagrangian particles for deformation analysis of a red blood cell in a capillary A novel efficient interface-tracking method is developed to gain an insight into the interface in a multiphase or multifluid system, called the modified particle binary level set (MPBLS) method, in which the binary level set function is defined to distinguish the different phases or fluids and further modified by Lagrangian particles scattered along the interface for achieving higher accuracy. The validation of the MPBLS method is carried out first by simulating the free motion of a red blood cell (RBC) in the rotating, shear and Poiseuille flows, respectively. Subsequently, further validations are performed by comparing with the experimental and numerical results published previously. As one of important applications, the MPBLS method is employed to investigate the deformation behaviors of RBCs with different shapes in a capillary. The simulations show that the healthy RBC gradually changes the geometric shape from a biconcave to a steady parachute shape. It is thus guaranteed that the RBC successfully traverses through the smaller capillaries compared with undeformed RBC. However, the unhealthy RBC with the circular or elliptical shape has different deformation behaviors, in which the steady parachute shape is much less concave at the rear and more convex in the front. Copyright (C) 2011 John Wiley & Sons, Ltd.

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

front tracking method
two-fluid flow
rbc deformation
computational fluid dynamics


the information discovery framework This paper continues the movement from technology centered to human centered approaches in the study of tasks that involve finding, understanding, and using information, and tools that support these tasks. The iterative role of information as a stimulus to cognition is considered. The information discovery framework consists of a flowchart of connected human cognitive and digital computer states and processes. The purpose of the framework is to inform the design of tools for finding and using information. Divergent thinking laboratory tasks serve as an evaluation method.

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

mental models
working memory
berrypicking
information foraging
information seeking


A study of bidding-oriented collaborative product conceptualization Inter-organizational, collaborative product design plays an increasingly important role in new product development (NPD). To date, researchers in this field have emphasized embodiment design rather than product conceptualization, and approaches have rarely been tailored towards small- to medium-sized enterprises (SMEs). The collaborative processes of product conceptualization and contract bidding require coordination and trade-offs to be made between cost/complexity and performance. Hence, a bidding-oriented collaborative product conceptualization (BCPC) system has been developed that aims to enable cooperation among SMEs and negotiation with a main contractor. The BCPC system comprises three major inter-dependent perspectives: the business, process and technology perspectives. For initial product platform generation and eliciting design-bidding criteria, a well-established requirement acquisition technique known as general sorting was adapted and employed. To resolve subjective bid evaluation issues and select preferred product concepts containing ambiguous and qualitative information, the analytic hierarchy process (AHP) technique was subsequently employed. A case study on cellular phone design is presented for system illustration.

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

collaborative product conceptualization
general sorting
analytic hierarchy process

design attributes hierarchy
design-bidding criteria hierarchy
design-bidding decision-making


Intelligent distributed and supervised flow control methodology for production systems This paper deals with the development of an intelligent distributed and supervised control approach for high-volume production systems, in which the flow of parts can be approximated by a continuous (fluid) model. The proposed approach is based on the decomposition of the production system into elementary modules in order to reduce the control design computational complexity. In this context, a two levels control structure is proposed. At the local level, a surplus-based principle is adopted to regulate the production flow for each module according to the distributed structure. The proposed control methodology decides how to adjust the production rate in order to avoid system overloading and eliminate machine starvation or blocking. In this context, the local control law is synthesized by using the TakagiSugeno fuzzy systems. At the high level, a supervisory controller is designed to improve the overall system performances. A supervisor provides an additive component for each local controller when the overall system performances deviate from their acceptable domains (degraded mode). This is done by combining both local and global information into a unified formalism by using aggregation operators and according to fuzzy interval representation of the desired objectives. Finally, the feasibility of the proposed methodology is validated with simulation examples.

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

production systems
aggregation operators

intelligent control
distributed fuzzy control
supervisory control
continuous-flow simulation


An integrated architecture for simulation 'The explosion in computer performance allows average engineers to use simulation as part of the design process' and enables them 'to search all possible design alternatives, and find the one that best meets the overall design criteria' by performing hundreds of simulations rather than just one or two. Yet, 'the advanced analysts resist the effort, concerned that it would be hard to get the correct answers.' An integrated architecture for simulation is proposed in this paper, which reduces the effort required for finding of the correct answers through integration of the simulation package with data-management (DM) software. The integrated architecture is based on three elements: input/output (I/O) handling, autonomous operation and control. I/O handling is provided by an add-on interface constructed in the DM tool, taking advantage of the fact that simulation software tools are increasingly able to exchange information with other software tools in an integrated way. All user interaction with the simulation can be done via this interface-input data entry, triggering the execution of simulation runs, and analyses of the results, which are automatically transferred by the simulation and recorded in the DM tool. Autonomous operation allows the execution of batch of simulation runs in the background leaving the user free to engage in other activities. Control, beyond providing the means for autonomous operation, enables the inclusion of simulation within larger context such as simulation-optimization schemes. Consequently, the integrated architecture allows simulation to be 'routinely applied as a powerful, flexible and general purpose engine for optimization from the initial concept across the full product life cycle'. (C) 2004 Elsevier Ltd. All rights reserved.

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


A numerically validated probabilistic model of a simplified total hip replacement construct Hip replacement constructs are paradigms of uncertain systems, and as such are suited to the application of probabilistic methods to assess their structural integrity. In order to gain confidence in a probabilistic model, it would be useful to verify the findings with experimental data; however, this is difficult to achieve in practice because of the exhaustive number of parameter combinations that need to be tested. As an alternative to experimental testing, benchmarking can be carried out provided a known analytical solution is available. To this end, a simplified 2D two-beam model of the femoral part of a total hip replacement construct was utilised to analyse uncertainties and variability in the construct as it is subjected to load. The use of a simplified model enabled geometric parameters to be investigated; these are commonly not considered in probabilistic models due to the increased complexity involved. Analytical and finite element representations of the model were developed and compared. The probabilistic study used the Monte Carlo simulation technique and the first-order reliability method to look at the inducible displacement of a hip implant, a phenomenon that has been linked to the most common cause of hip implant failure, aseptic loosening. Excellent correlation was observed between the analytical and probabilistic solutions, and it was shown that probabilistic approaches could efficiently predict the response of the simplified beam model while readily identifying the parameters most likely to compromise the structural integrity of the construct.

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

total hip replacement
inducible displacement
benchmarking

geometry
probability of failure
sensitivity analysis


Inverse dynamic substructuring using the direct hybrid assembly in the frequency domain The paper deals with inverse dynamic substructuring, or decoupling. A reduced version of the 3-field formulation is presented. The formulation is particularly suited for experimental dynamic substructuring. Hybrid assembly is introduced to satisfy compatibility and equilibrium conditions. Dual and hybrid assembly are compared using data from an experimental test bed.

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

inverse dynamic substructuring
decoupling
hybrid assembly


Analytic and discrete fairing of three-dimensional B-spline curves using nonlinear programming In reverse engineering, curves are constructed by interpolating the data points digitized from existing products. However, the constructed curves could have errors due to the noises in the digitized data points. If the errors remain, designers may get undesirable results. Thus, fairing of the curves is performed during computer modeling process. This paper presents two fairing algorithms for three-dimensional B-spline curves. One is an analytic fairing algorithm, and the other is a discrete fairing algorithm. These algorithms are based on automatic repositioning of the control points or the data points of a B-spline curve using a constrained nonlinear optimization algorithm. We analyzed the tradeoffs of the two fairing algorithms in terms of fairing flexibility and shape preservation. (c) 2007 Elsevier Ltd. All rights reserved.

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

reverse engineering
constrained nonlinear optimization

local fairing
global fairing
b-spline curves


Developing guidance on the safe use of air-fed suits in the nuclear industry Air-fed suits are used for protection from radioactive particulate contamination. Managing air-fed suit operations safely and efficiently involves complex interactions between people, personal protective equipment and work systems. The nuclear industry and the Office for Nuclear Regulation identified the need for clear guidance on the non-radiological aspects of their use, especially the management of ergonomic and physiological issues, including thermal stress. We describe the key principles that need to be considered when managing the ergonomic and physiological risks from air-fed suits, and how we can tailor these to different applications. The information gathered in our research confirmed that the safety of operations employing air-fed suits will depend on a unified strategic approach to design and usage. Detailed implementation of this strategy can be adjusted according to specific tasks and hazards. We explain that the balance between engineering and behavioural safety issues for air-fed suits is different for operational and decommissioning activities.

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


Simulation of non-hydrostatic, density-stratified flow in irregular domains A numerical model has been developed for simulating density-stratified flow in domains with irregular but simple topography. The model was designed for simulating strong interactions between internal gravity waves and topography, e.g, exchange flows in contracting channels, tidally or convectively driven flow over two-dimensional sills or waves propagating onto a shoaling bed. The model is based on the non-hydrostatic, Boussinesq equations of motion for a continuously stratified fluid in a rotating frame, subject to user-confrgurable boundary conditions. An orthogonal boundary fitting co-ordinate system is used for the numerical computations, which rely on a fourth-order compact differentiation scheme, a third-order explicit time stepping and a multi-grid based pressure projection algorithm. The numerical techniques are described and a suite of validation studies are presented. The validation studies include a pointwise comparison of numerical simulations with both analytical solutions and laboratory measurements of non-linear solitary wave propagation. Simulation results for flows lacking analytical or laboratory data are analysed a posteriori to demonstrate satisfaction of the potential energy balance. Computational results are compared with two-layer hydraulic predictions in the case of exchange flow through a contracting channel. Finally, a simulation of circulation driven by spatially non-uniform surface buoyancy flux in an irregular basin is discussed. Copyright (C) 2000 John Wiley & Sons, Ltd.

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

density-stratified flow
compact differencing
curvilinear


A Triangulation Approach to Asymptotically Exact Conditions for Fuzzy Summations Many Takagi-Sugeno (T-S) fuzzy control-synthesis problems in the literature are expressed as the problem of finding decision variables in a double convex sum (fuzzy summation) of positive definite matrices. Matrices' coefficients in the summation take values in the standard simplex. This paper presents a triangulation approach to the problem of generating simplicial partitions of the standard simplex in order to set up a family of sufficient conditions and, in parallel, another family of necessary ones for fuzzy summations. The conditions proposed id this paper are asymptotically exact as the size of the involved simplices decreases; its conservativeness vanishes for a sufficiently fine partition (sufficiently dense mesh of vertex points). The set of conditions is in the form of linear matrix inequalities (LMIs), for which efficient software is available.

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

conservatism reduction
fuzzy control
linear matrix inequality (lmi)
nonlinear models
takagi-sugeno (t-s) models


The effects of download delay on performance and end-user satisfaction in an Internet tutorial The present study investigated the effects of a variable unique to Internet-based learning; download delay of instructional materials. A simulated online teaching tool was created to measure the effects of download delay of images on test performance, time spent on the material, end-user satisfaction, and perceived effectiveness. Overall, download delay of instructional material had mixed effects on all four dependent variables. The results from this study appear to be the first empirical evidence that the effects of download delay are not linear, rather they are moderated by academic experience of the subject and difficulty of the material.

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

online instruction
academic performance
end-user satisfaction


Coefficient-free adaptations of polynomial root-finders We adapt two celebrated polynomial root-finders. Performing one of them, we involve only the scaled values of the input polynomial c(lambda) at the points approximating the roots and recursively updated. Performing another root-finder, we also compute the values of the derivative c'(lambda) at these points. In neither case do we use the coefficients of c(lambda). We also relate our algorithms to approximating the eigenvalues of a matrix. (c) 2005 Elsevier Ltd. All rights reserved.

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

durand-kerner's method
aberth's method
coefficient-free adaptations


Multivariate quadrature on adaptive sparse grids In this paper, we study the potential of adaptive sparse grids for multivariate numerical quadrature in the moderate or high dimensional case, i.e. for a number of dimensions beyond three and up to several hundreds. There, conventional methods typically suffer from the curse of dimension or are unsatisfactory with respect to accuracy. Our sparse grid approach, based upon a direct higher order discretization on the sparse grid, overcomes this dilemma to some extent, and introduces additional flexibility with respect to both the order of the 1 D quadrature rule applied (in the sense of Smolyak's tensor product decomposition) and the placement of grid points. The presented algorithm is applied to some test problems and compared with other existing methods.

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

multivariate numerical quadrature
sparse grids
higher order


trust and mistrust of online health sites Do different design and information content factors influence trust and mistrust of online health sites? Fifteen women faced with a risky health decision were observed while searching the Internet for information and advice over four consecutive weeks. In some sessions their searches were unstructured, whilst in other sessions they were directed to review specific sites, chosen for their trust design elements. Content analysis of concurrent verbalisations and group discussion protocols provided support for a staged model wherein design appeal predicted rejection (mistrust) and credibility of information and personalisation of content predicted selection (trust) of advice sites.

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

computer-mediated communication
social identity


Forecasting the impact of transport improvements on commuting and residential choice This paper develops a probabilistic, competing-destinations, assignment model that predicts changes in the spatial pattern of the working population as a result of transport improvements. The choice of residence is explained by a new non-parametric model, which represents an alternative to the popular multinominal logit model. Travel times between zones are approximated by a normal distribution function with different mean and variance for each pair of zones, whereas previous models only use average travel times. The models forecast error of the spatial distribution of the Dutch working population is 7% when tested on 1998 base-year data. To incorporate endogenous changes in its causal variables, an almost ideal demand system is estimated to explain the choice of transport mode, and a new economic geography inter-industry model (RAEM) is estimated to explain the spatial distribution of employment. In the application, the model is used to forecast the impact of six mutually exclusive Dutch core-periphery railway proposals in the projection year 2020.

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


Dependence-space-based attribute reduction in consistent decision tables This paper proposes a novel approach to attribute reduction in consistent decision tables within the framework of dependence spaces. For a consistent decision table \((U,A\cup \{d\}),\) an equivalence relation r on the conditional attribute set A and a congruence relation R on the power set of A are constructed, respectively. Two closure operators, T r and T R , and two families of closed sets, \({\mathcal C}_r\) and \({\mathcal C}_R,\) are then constructed with respect to the two equivalence relations. After discussing the properties of \({\mathcal C}_r\) and \({\mathcal C}_R,\) the necessary and sufficient condition for \({\mathcal C}_r={\mathcal C}_R\) is obtained and employed to formulate an approach to attribute reduction in consistent decision tables. It is also proved, under the condition \({\mathcal C}_r={\mathcal C}_R,\) that a relative reduct is equivalent to a \(R\)-reduction defined by Novotny and Pawlak (Fundam Inform 16:275287, 1992).

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

attribute reduction
congruence relation
consistent decision table


Modeling the information behaviour of software engineers using a work - task framework Faced with the rapid proliferation of digital information resources within organizations, employees need targeted search systems in order to be effective in their jobs. The goal of this study is to develop a model of information behaviour within a work-task framework that can be used to inform the design of a workplace information search system. In a two-phase process, we conducted a series of studies using multiple methods to identify workplace characteristics and to understand how they influence the needs, search strategies, and information sources used by software engineers working as services consultants in a large high-tech company.

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

information storage and retrieval systems


algorithmic aspects of type inference with subtypes We study the complexity of type inference for programming languages with subtypes. There are three language variations that effect the problem: (i) basic functions may have polymorphic or more limited types, (ii) the subtype hierarchy may be fixed or vary as a result of subtype declarations within a program, and (iii) the subtype hierarchy may be an arbitrary partial order or may have a more restricted form, such as a tree or lattice. The naive algorithm for infering a most general polymorphic type, undervariable subtype hypotheses, requires deterministic exponential time. If we fix the subtype ordering, this upper bound grows to nondeterministic exponential time. We show that it is NP-hard to decide whether a lambda term has a type with respect to a fixed subtype hierarchy (involving only atomic type names). This lower bound applies to monomorphic or polymorphic languages. We give PSPACE upper bounds for deciding polymorphic typability if the subtype hierarchy has a lattice structure or the subtype hierarchy varies arbitrarily. We also give a polynomial time algorithm for the limited case where there are of no function constants and the type hierarchy is either variable or any fixed lattice.

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

tree
order
polynomial
case
general
lower bound
structure
language
lattice
type inference
types
polymorphic
complexity
algorithm
effect
subtype

hierarchies
timing
variability
partial ordering
aspect
atom
variation
functional
programming language


A Calculus for Uniform Feature Composition The goal of feature-oriented programming (FOP) is to modularize software systems in terms of features. A feature refines the content of a base program. Both base programs and features may contain various kinds of software artifacts, for example, source code in different languages, models, build scripts, and documentation. We and others have noticed that when composing features, different kinds of software artifacts can be refined in a uniform way, regardless of what they represent. We present gDEEP, a core calculus for feature composition, which captures the language independence of FOP; it can be used to compose features containing many different kinds of artifact in a type-safe way. The calculus allows us to gain insight into the principles of FOP and to define general algorithms for feature composition and validation. We provide the formal syntax, operational semantics, and type system of gDEEP and outline how languages like Java, Haskell, Bali, and XML can be plugged in.

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

design
theory
feature-oriented programming
type systems
principle of uniformity


Efficient and secure algorithms for GLV-based scalar multiplication and their implementation on GLVGLS curves (extended version) We propose efficient algorithms and formulas that improve the performance of side channel protected elliptic curve computations with special focus on scalar multiplication exploiting the GallantLambertVanstone (CRYPTO 2001) and GalbraithLinScott (EUROCRYPT 2009) methods. Firstly, by adapting Feng et al.s recoding to the GLV setting, we derive new regular algorithms for variable-base scalar multiplication that offer protection against simple side-channel and timing attacks. Secondly, we propose an efficient, side-channel protected algorithm for fixed-base scalar multiplication which combines Feng et al.s recoding with Lim-Lees comb method. Thirdly, we propose an efficient technique that interleaves ARM and NEON-based multiprecision operations over an extension field to improve performance of GLS curves on modern ARM processors. Finally, we showcase the efficiency of the proposed techniques by implementing a state-of-the-art GLVGLS curve in twisted Edwards form defined over \(\mathbb {F}_{p^2}\), which supports a four-dimensional decomposition of the scalar and is fully protected against timing attacks. Analysis and performance results are reported for modern \(\times \)64 and ARM processors. For instance, we compute a variable-base scalar multiplication in 89,000 and 244,000 cycles on an Intel Ivy Bridge and an ARM Cortex-A15 processor (respect.); using a precomputed table of 6KB, we compute a fixed-base scalar multiplication in 49,000 and 116,000 cycles (respect.); and using a precomputed table of 3KB, we compute a double-scalar multiplication in 115,000 and 285,000 cycles (respect.). The proposed techniques represent an important improvement of the state-of-the-art performance of elliptic curve computations, and allow us to set new speed records in several modern processors. The techniques also reduce the cost of adding protection against timing attacks in the computation of GLV-based variable-base scalar multiplication to below 10%. This work is the extended version of a publication that appeared at CT-RSA (Faz-Hernndez et al. Topics in Cryptology, CT-RSA 2014, vol. 8366, pp. 127 2014).

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

elliptic curves
side-channel protection
glv method
gls method
\(\times \)64 processor
arm processor
neon vector unit


determining an optimal membership function based on community consensus in a fuzzy database system A fuzzy set is one in which membership in a category is not boolean. Rather items have a degree of membership. Fuzzy databases expand on this idea by storing fuzzy data and allowing it to be retrieved based on its degree of membership. Determining the degree of membership in a category that best satisfies the largest number of users is difficult. A training phase is conducted in which a community that is representative of the final users is asked a series of questions about the category to which an element belongs. This input is then used to construct the membership function. However, the best way to construct the membership function is elusive. This paper evaluates different methods of constructing the membership function based on community opinions. It was determined that all of the methods produced similar results, however the Direct Rating and Weighted Average Methods arrive at their final value sooner and maintain that value for a longer period of time. More research is needed using a larger training community and a verification phase to distinguish between these two methods.

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

relational database
database
modifier
fuzzy logic


Test item prioritizing metrics for selective software testing In order to respond to the active market's needs for software with various new functions, the system testing must be completed within a limited period. Additionally, important faults, which are closely related to essential functions for users or the target system, have to be removed, preferably in system testing. Many techniques have been proposed to date for effective software testing. Among them, selective software testing is one of the most cost effective techniques. However, most of the previous techniques cannot be applied to short-term development and initial development of software with various new functions because much cost is needed for their testing preparation. In this paper, we propose a new method for selective system testing in which priorities assigned to functions play an essential role in the execution of testing. The priorities are determined based on the evaluation results of three metrics for functions: the frequency of use, the complexity of use scenario, and the fault impact to users. Detailed testing instructions are assigned to test items with high priority, and short and ordinal instructions are assigned to those with low priority. The difference in the volume of testing instruction controls the effort of checking test items. As a result of experimental application to actual software testing in a certain company, we have confirmed that the proposed selective system testing can detect both fatal faults related to key functions and critical faults for the system.

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

software resting
selective testing
prioritization


A Galerkin least-square stabilisation technique for hyperelastic biphasic soft tissue An hyperelastic biphasic model is presented. For slow-draining problems (permeability less than 110?2mm4N?1s?1), numerical instabilities in the form of non-physical oscillations in the pressure field are observed in 3D problems using tetrahedral TaylorHood finite elements. As an alternative to considerable mesh refinement, a Galerkin least-square stabilisation framework is proposed. This technique drastically reduces the pressure discrepancies and prevents these oscillations from propagating towards the centre of the medium. The performance and robustness of this technique are demonstrated on a 3D numerical example.

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

porous media
galerkin least-square
large strains


Application of Lagrangian relaxation approach to ?-reliable path finding in stochastic networks with correlated link travel times Link and path travel time are respectively fitted by lognormal and normal distribution. Cholesky decomposition is applied to handle the spatial correlation of link travel time. Lagrangian relaxation is used to handle the ?-reliable path problem. Applicability of ?-reliable path finding is validated by a real-world network.

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

reliable path
lagrangian relaxation
cholesky decomposition

stochastic network
correlated link travel time
navigation system


Generalization

of

building

data

based

on

a

scale-space

approach

In

image

analysis,

scale-space

theory

is

used,

e.g.,

for

object

recognition.

A

scale-space

is

obtained

by

deriving

coarser

representations

at

different

scales

from

an

image.

With

it,

the

behaviour

of

image

features

over

scales

can

be

analysed.

One

example

of

a

scale-space

is

the

reaction-diffusion-space,

a

combination

of

linear

scale-space

and

mathematical

morphology.

As

scale-spaces

have

an

inherent

abstraction

capability,

they

are

used

here

for

the

development

of

an

automatic

generalization

procedure

for

three-dimensional

building

models.

It

can

be

used

to

generate

level

of

detail

(LOD)

representations

of

city

models.

Practically,

it

works

by

moving

parallel

facets

towards

each

other

until

a

feature

under

a

certain

extent

is

eliminated

or

a

gap

is

closed.

As

not

all

building

structures

consist

of

perpendicular

facets,

means

for

a

squaring

of

non-orthogonal

structures

are

given.

Results

for

generalization

and

squaring

are

shown

and

remaining

problems

are

discussed.

The

conference

version

of

this

paper

is

Forberg

[Forberg,

A.,

Generalization

of

Building

Data

Based

on

a

Scale-Space

Approach.

The

International

Archives

of

the

Photogrammetry,

Remote

Sensing

and

Spatial

Information

Sciences

(Part

(accessed

January

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

multi-resolution representation
three-dimensional building model
rectification


SU-8 nanocomposite photoresist with low stress properties for microfabrication applications A new nanocomposite photoresist based on SU-8 epoxy resin has been developed. It consists in a homogeneous dispersion of nano-silica particles in the negative tone photosensitive SU-8. The nanocomposite photoresist is more sensitive than the SU-8 photoresist and the photopatterned composite structures show low stress and less cracks than pure SU-8 structures. No significant resolution difference has been observed for both materials.

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


flexible and efficient platform modeling for distributed interactive systems Distributed interactive systems often rely on platform information , used for example when migrating a user interface to a small-screen device, or when opportunistically recruiting available peripherals. There has been to-date little work in platform modeling for distributed applications. In this paper, we demonstrate that distributed platform models are well supported by a publish and subscribe architecture accompanied by a rich filtering language. This approach allows organic construction of networks with no centralized locus of control, high scalability and fault-tolerance, and flexible customization to the needs of heterogeneous device types.

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

groupware toolkits
distributed interactive applications
platform model


authoring educational multimedia content using learning styles and story telling principles This paper presents a methodology for authoring Educational Multimedia content using story telling as the underlying pedagogical technique. It introduces Movement Oriented Design (MOD) to provide a systematic framework for developing Educational Multimedia narratives using good story telling principles. A stage-by-stage process for developing and refining Educational Multimedia stories is described. This process includes conducting workshops for brainstorming the narrative of an Educational Multimedia story, and then improving it through feedback.

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

content creation
story development
movement oriented design (mod)
narrative model


Breaking the computational barriers of pairwise genome comparison Conventional pairwise sequence comparison software algorithms are being used to process much larger datasets than they were originally designed for. This can result in processing bottlenecks that limit software capabilities or prevent full use of the available hardware resources. Overcoming the barriers that limit the efficient computational analysis of large biological sequence datasets by retrofitting existing algorithms or by creating new applications represents a major challenge for the bioinformatics community.

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

comparative genomics
out-of-core algorithm
external memory
long sequences comparison


Detecting stress fields in an optimal structure Part I: Two-dimensional case and analyzer In this paper, we investigate the stress fields in optimal elastic structures by the necessary conditions of optimality, studying two-phase elastic composites in two dimensions. The necessary conditions show that an optimal design is characterized by three zones: Zone 1 of pure weak Material 1; Zone 2 of pure strong Material 2; and Zone 3, where Material 1 and Material 2 mix to form an optimal microstructure. To characterize these zones, we introduce two rotationally invariant norms N(1) and N(2) of a stress tensor. The derived optimality conditions state that the inequality N(1)(sigma) constant(2) holds in Zone 2; and two equalities hold simultaneously in Zone 3: N(1)(sigma)= constant(1), in Material 1; N(2)(sigma)= constant(2) in Material 2. Using this result, we analyze suboptimal projects and find how close the fields are to the regions of optimality.

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

stress fields
suboptimal projects
analyzer

composite
invariant norm
necessary and sufficient conditions
nonconvex


Geospatial Cyberinfrastructure: Past, present and future A Cyberinfrastructure (CI) is a combination of data resources, network protocols, computing platforms, and computational services that brings people, information, and computational tools together to perform science or other data-rich applications in this information-driven world. Most science domains adopt intrinsic geospatial principles (such as spatial constraints in phenomena evolution) for large amounts of geospatial data processing (such as geospatial analysis, feature relationship calculations, geospatial modeling, geovisualization, and geospatial decision support). Geospatial CI (GCI) refers to CI that utilizes geospatial principles and geospatial information to transform how research, development, and education are conducted within and across science domains (such as the environmental and Earth sciences). GCI is based on recent advancements in geographic information science, information technology, computer networks, sensor networks, Web computing, CI, and e-research/e-science. This paper reviews the research, development, education, and other efforts that have contributed to building GCI in terms of its history, objectives, architecture, supporting technologies, functions, application communities, and future research directions. Similar to how GIS transformed the procedures for geospatial sciences, GCI provides significant improvements to how the sciences that need geospatial information will advance. The evolution of GCI will produce platforms for geospatial science domains and communities to better conduct research and development and to better collect data, access data, analyze data, model and simulate phenomena, visualize data and information, and produce knowledge. To achieve these transformative objectives, collaborative research and federated developments are needed for the following reasons: (1) to address social heterogeneity to identify geospatial problems encountered by relevant sciences and applications, (2) to analyze data for information flows and processing needed to solve the identified problems, (3) to utilize Semantic Web to support building knowledge and semantics into future GCI tools, (4) to develop geospatial middleware to provide functional and intermediate services and support service evolution for stakeholders, (5) to advance citizen-based sciences to reflect the fact that cyberspace is open to the public and citizen participation will be essential, (6) to advance GCI to geospatial cloud computing to implement the transparent and opaque platforms required for addressing fundamental science questions and application problems, and (7) to develop a research and development agenda that addresses these needs with good federation and collaboration across GCI communities, such as government agencies, non-government organizations, industries, academia, and the public.

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

cyberinfrastructure
cloud computing
geospatial science

virtual organizations
spatial computing
sdi


A similarity-based mechanism to control genetic algorithm and local search hybridization to solve traveling salesman problem A big shortcoming of the simple genetic algorithm is that whenever it converges to a local optimum, its performance is continuously deteriorating, especially in the highly nonlinear problems such as traveling salesman problem (TSP). Therefore, some heuristics such as local search are needed to help genetic algorithm (GA) loops escaping such situations. The critical point in such hybridization is the determining a suitable time for applying local search to the GA population. In this study, a new hybridization of GA and local search based on a new similarity-based control mechanism is proposed, and its behavior on different TSP instances is compared with simple GA. The experimental results show that the proposed hybrid algorithm yields the optimal tour length in most of the cases, especially in the TSP instances with higher complexity.

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

genetic algorithm
local search
traveling salesman problem


Fixed point optimization algorithm and its application to power control in CDMA data networks We discuss the variational inequality problem for a continuous operator over the fixed point set of a nonexpansive mapping. One application of this problem is a power control for a direct-sequence code-division multiple-access data network. For such a power control, each user terminal has to be able to quickly transmit at an ideal power level such that it can get a sufficient signal-to-interference-plus-noise ratio and achieve the required quality of service. Iterative algorithms to solve this problem should not involve auxiliary optimization problems and complicated computations. To ensure this, we devise a fixed point optimization algorithm for the variational inequality problem and perform a convergence analysis on it. We give numerical examples of the algorithm as a power control.

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

variational inequality problem
power control
fixed point

two-stage non-convex optimization problem


A new skew generalization of the normal distribution: Properties and applications A new class of distribution functions with not-necessarily symmetric densities, which contains the normal one as a particular case, is introduced. The class thus obtained depends on a set of three parameters, with an additional one to the classical normal distribution being inserted. This new class of skewed distributions is presented as an alternative to the class of skew-normal and Balakrishnan skew-normal distributions, among others. The density and distribution functions of this new class are given by a closed expression which allows us to easily compute probabilities, moments and related measurements. Certain interesting regularity properties reduce the study of this class to one of a subset of standardized distributions. Finally, some applications are shown as examples.

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

collective risk model
marshall and olkin scheme
skew normal distribution


Parameterization of faceted surfaces for meshing using angle-based flattening We propose a new method to compute planar triangulations of faceted surfaces for surface parameterization. In contrast to previous approaches that define the flattening problem as a mapping of the three-dimensional node locations to the plane, our method defines the flattening problem as a constrained optimization problem in terms of angles (only). After applying a scaling that derives from the 'curvature' at a node, we minimize the relative deformation of the angles in the plane with respect to their counterparts in the three-dimensional surface. This approach makes the method more stable and robust than previous approaches, which used node locations in their formulations. The new method can handle any manifold surface for which a connected, valid, two-dimensional parameterization exists, including surfaces with large curvature gradients. It does not require the boundary of the flat two-dimensional domain to be predefined or convex. We use only the necessary and sufficient constraints for a valid two-dimensional triangulation. As a result, the existence of a theoretical solution to the minimization procedure is guaranteed.

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


Combining Invariant Features and the ALV Homing Method for Autonomous Robot Navigation Based on Panoramas Biologically inspired homing methods, such as the Average Landmark Vector, are an interesting solution for local navigation due to its simplicity. However, usually they require a modification of the environment by placing artificial landmarks in order to work reliably. In this paper we combine the Average Landmark Vector with invariant feature points automatically detected in panoramic images to overcome this limitation. The proposed approach has been evaluated first in simulation and, as promising results are found, also in two data sets of panoramas from real world environments.

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

visual homing
biologically inspired methods
local features