Autonomous adaptation inspired by the model of a minimal living system provided by chemoton theory Future computing machines will have to meet increasing requirements regarding the computational power and the efficient use of resources. Whatever the technology may be, in all likelihood it will be based on parallel operation of a large number of interconnected nanoscale units. Further challenges lie in the choice of basic units and their mutual communication. Moreover, an additional design challenge comes from the sensitivity to environmental variations which is pronounced at such a low scale. Biological creations are living examples of similar designsthey are built of a number of cells, numbers ranging from one to thousands of millions. The cells are organised in a particular way and interconnected by subtle mechanisms in achieving the ultimate common goalthe preservation of viability. In doing so, living systems incessantly adapt to ever-varying environments. In this paper, we investigate adaptive mechanisms at a very low levelthe protocell leveland consider a minimal living system in a form provided by chemoton theory by Tibor Ganti. We suggest that adaptive traits of the Chemoton be used as guidelines for the design of an adaptive cell within a modular man-made system. As a proof of concept, we propose a basic circuitry in silicon and argue in favour of such implementation of the proposed adaptive cell.

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

environmental fluctuations
the organisation of living systems
homoeostasis
operational transconductance amplifiers


Non-axisymmetric buckling of stiffened supercavitating shells: static and dynamic analysis Supercavitating vehicles undergo high longitudinal forces as a result of their high underwater velocity. The drag force compresses axially the body and may cause its buckling. In addition, the time-dependent properties of the cavity generate time-varying longitudinal loads, which are sources of parametric resonances. Static and dynamic buckling need to be considered as limiting factors for the operating speed of this class of vehicles. The stability of supercavitating underwater vehicles is here investigated through a finite element model that predicts the behavior of plain and stiffened shells and is used to obtain stability maps for varying vehicles velocity, as well as frequency and amplitude of the force oscillations. Periodically placed circumferential stiffeners are proposed as means to enhance the stability of the considered class of shells. The results indicate the effectiveness of the stiffening rings in extending the range of stable operating conditions, by increasing the critical static buckling loads, and more importantly by reducing the extension of the regions corresponding to dynamic instability.

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

supercavitating vehicles
static and dynamic buckling


Residual diagnostics for variogram fitting ? The variogram cloud is increasingly employed in geostatistics both as an exploratory tool as well as for variogram fitting. Unfortunately in its pure form the variogram cloud cannot be effectively used to assess the fit of a corresponding parametric variogram model. This is due to the fact that its entries are highly correlated and heteroscedastic (and possibly distorted by anisotropy). We propose fitting of a model by feasible generalized least squares, suggest some diagnostics for assessing the fit and identifying potential outliers. For illustrative purposes we apply them to an example data set of chloride concentrations in the Sdliche Tullnerfeld in Austria. An R-package called vardiag for the interactive exploration of the proposed diagnostics was provided.

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

diagnostic plots
interactive graphics
outlier detection
spatial dependence
r


An implementation model for WEGS in WLAN applications: a Taiwanese case The advances in wireless communication technologies in recent years have caused enterprises to pay more attention to the development of mobile commerce (m-commerce). Studies have indicated that many enterprises have failed in the implementation of information systems (ISs). A meaningful model is needed as a reference for the implementation of wireless systems (WS). This paper therefore proposes such a model on the basis of the relevant literature and a practical case study. The paper begins with a case study of a wireless exhibition guide system (WEGS) based on a wireless local area network (WLAN). The implementation is investigated on the basis of the key success factors in m-commerce as identified in the literature, and by comparing the differences between an information system and a wireless system. Finally, a reference model for implementing a wireless system is proposed to help enterprises reduce the risks associated with m-commerce.

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


Multi-agent human-machine dialogue: issues in dialogue management and referring expression semantics This paper presents an implemented model of dialogue management for simple dialogues involving multiple speakers. In our model, the user is one speaker, and the system 'plays' a number of other speakers. We present a number of principles governing dialogue management in such cases, which relate to turn-taking and the identification of the addressees of utterances. We also consider how to extend a syntactic and semantic treatment of first- and second-person personal pronouns, and of addressee terms, in order to deal with the multi-speaker scenario. We give some examples of our current system, and conclude by outlining some extensions of the system to include disagreements, interruptions, and private communication between subgroups of dialogue participants. (C) 2007 Published by Elsevier B.V.

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

human-machine dialogue
computer-assisted language learning


Advanced mobile agent security models for code integrity and malicious availability check Mobile agent technology is an emerging paradigm in distributed computing environment and it holds a potential status in the relevant research field due to its unique capabilities like flexibility, dynamic customization and robust interaction in unreliable networks. But the limited security perspectives and shortfalls of the mobile agent environments degrade its usage in a variety of application domains. Even though some of the protection models are available for protecting the environments, they are not efficient in handling the security issues. To make the mobile agent environment secure, this paper proposed advanced models to improve the efficiency of the existing Malicious Identification Police model for scanning the incoming agent to detect the malicious activities and to overcome the availability of vulnerabilities in the existing Root Canal algorithm for code integrity checks. The MIP model is extended with the policy to differentiate the agent owners in the distributed environment and the Root Canal algorithm is improved as eXtended Root Canal algorithm. The experimental results of the advanced models show that though these mechanisms take more time complexity than the existing malicious identification police model and Root Canal model, these models are efficient in protecting the agent code integrity and scanning the agent for malicious activities. Also the new models possess less time complexity compared to the other related existing models in the secure mobile agent environment.

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

mobile agent security
code integrity check
attack code identification
mobile agent platform protection


A complementary method for automated detection of microaneurysms in fluorescein angiography fundus images to assess diabetic retinopathy Algorithm is not based on morphological functions in order to find microaneurysms. Algorithm can find microaneurysms for evaluating diabetic retinopathy. Algorithm is robust to noise because of its linear integral transformation concept. Identifying the retinal landmarks improves the classification of microaneurysms.

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

diabetic retinopathy
fluorescein angiography
fundus images
microaneurysms

computer aided diagnosis
radon transform


SCS:

Signal,

Context,

and

Structure

Features

for

Genome-Wide

Human

Promoter

Recognition

This

paper

integrates

the

signal,

context,

and

structure

features

for

genome-wide

human

promoter

recognition,

which

is

important

in

improving

genome

annotation

and

analyzing

transcriptional

regulation

without

experimental

supports

of

ESTs,

cDNAs,

or

mRNAs.

First,

CpG

islands

are

salient

biological

signals

associated

with

approximately

percent

of

mammalian

promoters.

Second,

the

genomic

context

of

promoters

may

have

biological

significance,

which

is

based

on

n-mers

sequences

of

n

bases

long)

and

their

statistics

estimated

from

training

samples.

Third,

sequence-dependent

DNA

flexibility

originates

from

DNA

structures

and

plays

an

important

role

in

guiding

transcription

factors

to

the

target

site

in

promoters.

Employing

decision

trees,

we

combine

above

signal,

context,

and

structure

features

to

build

a

hierarchical

promoter

recognition

system

called

SCS.

Experimental

results

on

controlled

data

sets

and

the

entire

human

genome

demonstrate

that

SCS

is

significantly

superior

in

terms

of

sensitivity

and

specificity

as

compared

to

other

state-of-the-art

methods.

The

SCS

promoter

recognition

system

is

available

online

as

supplemental

materials

for

academic

use

and

can

be

found

on

the

Computer

Society

Digital

Library

at

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

feature extraction
classifier combination
genome analysis


Anomaly detection in diurnal data In this paper we present methodological advances in anomaly detection tailored to discover abnormal traffic patterns under the presence of seasonal trends in data. In our setup we impose specific assumptions on the traffic type and nature; our study features VoIP call counts, for which several traces of real data has been used in this study, but the methodology can be applied to any data following, at least roughly, a non-homogeneous Poisson process (think of highly aggregated traffic flows). A performance study of the proposed methods, covering situations in which the assumptions are fulfilled as well as violated, shows good results in great generality. Finally, a real data example is included showing how the system could be implemented in practice.

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


Multiclass LS-SVMs: Moderated outputs and coding-decoding schemes A common way of solving the multiclass categorization problem is to reformulate the problem into a set of binary classification problems. Discriminative binary classifiers like, e.g., Support Vector Machines (SVMs), directly optimize the decision boundary with respect to a certain cost function. In a pragmatic and computationally simple approach, Least Squares SVMs (LS-SVMs) are inferred by minimizing a related regression least squares cost function. The moderated outputs of the binary classifiers are obtained in a second step within the evidence framework. In this paper, Bayes' rule is repeatedly applied to infer the posterior multiclass probabilities, using the moderated outputs of the binary plug-in classifiers and the prior multiclass probabilities. This Bayesian decoding motivates the use of loss function based decoding instead of Hamming decoding. For SVMs and LS-SVMs with linear kernel, experimental evidence suggests the use of one-versus-one coding. With a Radial Basis Function kernel one-versus-one and error correcting output codes yield the best performances, but simpler codings may still yield satisfactory results.

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

bayesian decoding
evidence framework
hamming decoding
regression
support vector machines

discriminant analysis
multiclass classification


Bit Commitment From Nonsignaling Correlations Central cryptographic functionalities such as encryption, authentication, or secure two-party computation cannot be realized in an information-theoretically secure way from scratch. This serves as a motivation to study what ( possibly weak) primitives they can be based on. We consider as such starting points general two-party input-output systems that do not allow for message transmission and show that they can be used for realizing unconditionally secure bit commitment as soon as they are nontrivial, i.e., cannot be securely realized from distributed randomness only.

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


An analysis of the performance of Artificial Neural Network technique for apple classification The purpose of this paper is to develop Artificial Neural Network (ANN)-based apple classifier. Testing effort is calculated using ANN method. The complete system is divided into two modules. In the first module, input (surface level apple quality parameter) from the different sources is collected by the software developed in Visual Basic through different input device like web camera, weight machine, etc. In the second module, the input data are used by ANN simulator to classify the apple according to their quality. The final result of an ANN model for apple classification is discussed; however, the modeling results showed that there is excellent agreement between the experimental data and predicted values. A low level of error prediction confirmed the fact that the Neural Network model is an effective instrument of the apple quality estimation. There is not any misclassification during testing. The paper presents alternative method for quality assessment of apple and provides consumers with a safer food supply.

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

machine vision
scaled conjugate gradient
mean square error
back propagation
root mean square error


creating contextual help for guis using screenshots Contextual help is effective for learning how to use GUIs by showing instructions and highlights on the actual interface rather than in a separate viewer. However, end-users and third-party tech support typically cannot create contextual help to assist other users because it requires programming skill and source code access. We present a creation tool for contextual help that allows users to apply common computer skills-taking screenshots and writing simple scripts. We perform pixel analysis on screenshots to make this tool applicable to a wide range of applications and platforms without source code access. We evaluated the tool's usability with three groups of participants: developers, in-structors, and tech support. We further validated the applicability of our tool with 60 real tasks supported by the tech support of a university campus.

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


Analysis of performance trade-offs for an adaptive channel-aware wireless scheduler In this paper, we consider the scheduling problem where data packets from K input-flows need to be delivered to K corresponding wireless receivers over a heterogeneous wireless channel. Our objective is to design a wireless scheduler that achieves good throughput and fairness performance while minimizing the buffer requirement at each wireless receiver. This is a challenging problem due to the unique characteristics of the wireless channel. We propose a novel idea of exploiting both the long-term and short-term error behavior of the wireless channel in the scheduler design. In addition to typical first-order Quality of Service (QoS) metrics such as throughput and average delay, our performance analysis of the scheduler permits the evaluation of higher-order metrics, which are needed to evaluate the buffer requirement. We show that variants of the proposed scheduler can achieve high overall throughput or fairness as well as low buffer requirement when compared to other wireless schedulers that either make use only of the instantaneous channel state or are channel-state independent in a heterogenous channel.

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

adaptive wireless scheduling
buffer requirements


Neural network approaches to fractal image compression and decompression In image compression technologies, fractal image compression/decompression has the advantages of a high compression ratio and a low loss ratio. However, it requires a great deal of computation, which limits its applications, and so far, no parallel processing technique has been designed and implemented. In this study, we use neural networks to perform a large number of computations in fractal image compression and decompression in parallel. The simulation results show that the quality of images generated by neural networks is similar to that produced using traditional methods, which verifies the high value of our research, which has shown that the neural network technology is useful and efficient when applied to fractal image compression and decompression.

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


an incremental methodology for quantitative software architecture evaluation with probabilistic models Probabilistic models are crucial in the quantification of non-functional attributes in safety-and mission-critical software systems. These models are often re-evaluated in assessing the design decisions. Evaluation of such models is computationally expensive and exhibits exponential complexity with the problem size. This research aims at constructing an incremental quality evaluation framework and delta evaluation scheme to address this issue. The proposed technique will provide a computational advantage for the probabilistic quality evaluations enabling their use in automated design space exploration by architecture optimization algorithms. The expected research outcomes are to be validated with a range of realistic architectures and case studies from automotive industry.

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

delta evaluation
architecture evaluation

incremental evaluation models
probabilistic properties


An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers In this paper, an effective hybrid algorithm based on particle swarm optimization (HPSO) is proposed for permutation flow shop scheduling problem (PFSSP) with the limited buffers between consecutive machines to minimize the maximum completion time (i.e., makespan). First, a novel encoding scheme based on random key representation is developed, which converts the continuous position values of particles in PSO to job permutations. Second, an efficient population initialization based on the famous NawazEnscoreHam (NEH) heuristic is proposed to generate an initial population with certain quality and diversity. Third, a local search strategy based on the generalization of the block elimination properties, named block-based local search, is probabilistically applied to some good particles. Moreover, simulated annealing (SA) with multi-neighborhood guided by an adaptive meta-Lamarckian learning strategy is designed to prevent the premature convergence and concentrate computing effort on promising solutions. Simulation results and comparisons demonstrate the effectiveness of the proposed HPSO. Furthermore, the effects of some parameters are discussed.

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

flow shop scheduling
limited buffers
hybrid algorithm
particle swarm optimization
simulated annealing


Combined iron chelation therapy Patients with thalassemia major accumulate body iron over time as a consequence of continuous red blood cell transfusions which cause hepatic, endocrine, and cardiac complications. Despite the availability of three iron chelators, some patients fail to respond adequately to monotherapy with any of them. Combination therapy, consisting in the use of two chelators on the same day, has been introduced to increase the efficacy and to induce negative iron balance in patients with severe iron overload. Extensive long-term experience has shown that combined chelation with deferiprone and deferoxamine (DFO) rapidly reduces liver iron, serum ferritin, and myocardial siderosis, improves cardiac function, reverses and prevents endocrine complications, reduces cardiac mortality, and improves survival. Side effects, though significant, are manageable if properly monitored. Preliminary promising results have been obtained using combined chelation with deferasirox and DFO. As more drug combination regimes are evaluated, it should be possible to better tailor iron chelation to the needs of the patients, minimizing toxicity and maximizing efficacy throughout life.

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

combined therapy
thalassemia and chelators


Detecting breakdown points in metabolic networks A complex network of biochemical reactions present in an organism generates various biological moieties necessary for its survival. It is seen that biological systems are robust to genetic and environmental changes at all levels of organization. Functions of various organisms are sustained against mutational changes by using alternative pathways. It is also seen that if any one of the paths for production of the same metabolite is hampered, an alternate path tries to overcome this defect and helps in combating the damage. Certain physical, chemical or genetic change in any of the precursor substrate of a biochemical reaction may damage the production of the ultimate product. We employ a quantitative approach for simulating this phenomena of causing a physical change in the biochemical reactions by performing external perturbations to 12 metabolic pathways under carbohydrate metabolism in Saccharomyces cerevisae as well as 14 metabolic pathways under carbohydrate metabolism in Homo sapiens. Here, we investigate the relationship between structure and degree of compatibility of metabolites against external perturbations, i.e., robustness. Robustness can also be further used to identify the extent to which a metabolic pathway can resist a mutation event. Biological networks with a certain connectivity distribution may be very resilient to a particular attack but not to another. The goal of this work is to determine the exact boundary of network breakdown due to both random and targeted attack, thereby analyzing its robustness. We also find that compared to various non-standard models, metabolic networks are exceptionally robust. Here, we report the use of a Resilience-based score for enumerating the concept of network-breakdown. We also use this approach for analyzing metabolite essentiality providing insight into cellular robustness that can be further used for future drug development. We have investigated the behavior of metabolic pathways under carbohydrate metabolism in S. cerevisae and H. sapiens against random and targeted attack. Both random as well as targeted resilience were calculated by formulating a measure, that we termed as Resilience score. Datasets of metabolites were collected for 12 metabolic pathways belonging to carbohydrate metabolism in S. cerevisae and 14 metabolic pathways belonging to carbohydrate metabolism in H. sapiens from Kyoto Encyclopedia for Genes and Genomes (KEGG).

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


The spatio-temporal modeling for criminal incidents Law enforcement agencies monitor criminal incidents. With additional geographic and demographic data, law enforcement analysts look for spatio-temporal patterns in these incidents in order to predict future criminal activity. When done correctly these predictions can inform actions that can improve security and reduce the impact of crime. Effective prediction requires the development of models that can find and incorporate the important associative and causative variables available in the data. This paper describes a new approach that uses spatio-temporal generalized additive models (ST-GAMs) to discover underlying factors related to crimes and predict future incidents. In addition, the paper shows extensions of the ST-GAM approach to produce local spatio-temporal generalized additive models (LST-GAMs). These local models can better predict criminal incidents conditioned on regions. Both models can fully utilize a variety of data types, such as spatial, temporal, geographic, and demographic data, to make predictions. We describe how to estimate the parameters for ST-GAM using iteratively re-weighted least squares and maximum likelihood and show that the resulting estimates provide for model interpretability. This paper also discusses methods to generate regions for LST-GAM. Lastly the paper discusses the evaluation of LST-GAM and ST-GAM with actual criminal incident data from Charlottesville, Virginia. The evaluation results show that both models from this new approach outperform previous spatial models in predicting future criminal incidents.

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

spatio-temporal modeling
generalized additive model
criminal forecasting


ON CENTRAL ATOMS OF ARCHIMEDEAN ATOMIC LATTICE EFFECT ALGEBRAS If element z of a lattice effect algebra (E,circle plus,0,1) is central, then the interval [0, z] is a lattice effect algebra with the new top element z and with inherited partial binary operation circle plus. It is a known fact that if the set C(E) of central elements of E is an atomic Boolean algebra and the supremum of all atoms of C(E) in E equals to the top element of E, then E is isomorphic to a direct product of irreducible effect algebras ([16]). In [10] Paseka and Riecanova published as open problem whether C(E) is a bifull sublattice of an Archimedean atom c lattice effect algebra E. We show that there exists a lattice effect algebra (E,circle plus,0,1) with atomic C(E) which is not a bifull sublattice of E. Moreover, we show that also B(E), the center of compatibility, may not be a bifull sublattice of E.

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


Expressive speech-driven facial animation Speech-driven facial motion synthesis is a well explored research topic. However, little has been done to model expressive visual behavior during speech. We address this issue using a machine learning approach that relies on a database of speech-related high-fidelity facial motions. From this training set, we derive a generative model of expressive facial motion that incorporates emotion control, while maintaining accurate lip-synching. The emotional content of the input speech can be manually specified by the user or automatically extracted from the audio signal using a Support Vector Machine classifier.

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

algorithms
lip synching
expression synthesis
independent component analysis


Computational indistinguishability: A sample hierarchy We consider the existence of pairs of probability ensembles that may be efficiently distinguished given k samples, but cannot be efficiently distinguished given k' < k samples. It is well known that in any such pair of ensembles it cannot be that both are efficiently computable land that such phenomena cannot exist for nonuniform classes of distinguishers, say, polynomial-size circuits). It was also known that there exist pairs of ensembles that may be efficiently distinguished based on two samples, but cannot be efficiently distinguished, based on a single sample. In contrast, it was not known whether the distinguishing power increases when one moves from two samples to polynomially-many samples. We show the existence of pairs of ensembles which may be efficiently distinguished given k + 1 samples but cannot be efficiently distinguished given It samples, where k can be any function bounded above by a polynomial in the security parameter. In the course of establishing the above result, we prove several technical lemmas regarding polynomials and graphs. We believe that these may be of independent interest. (C) 1999 Academic Press.

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

extractors
expanders
eigenvalues
rapid mixing


Application-directed voltage scaling Clock (and voltage) scheduling is an important technique to reduce the energy consumption of processors that support voltage scaling. It is difficult, however, to achieve good results using only statistics from the operating system level when applications show bursty (unpredictable) behavior. We take the approach that such applications must be made power-aware and specify their average execution time (AET) and the deadline to the scheduler controlling the clock speed and processor voltage. This paper describes our energy priority scheduling (EPS) algorithm supporting power-aware applications. EPS orders tasks according to how tight their deadlines are and how often tasks overlap. Low-priority tasks are scheduled first, since they can be easily preempted to accommodate for high-priority tasks later. The EPS algorithm does not always yield the optimal schedule, but has a low complexity. We have implemented EPS on a StrongARM-based variable-voltage platform. We conducted experiments with a modified video decoder that estimates the AET of each frame. Measurements show that application-directed voltage scaling reduces processor power consumption with 50% for the bursty video decoder without missing any frame deadlines.

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

adaptive software
low power
power awareness


Directional medium access control for ad hoc networks Using directional antennas in ad hoc networks may introduce the well-known deafness problem, exacerbate the hidden terminal problem and the exposed terminal problem, add difficulty on mobile communication, and distort the operation of existing routing and TCP protocols. Although a lot of studies have been undertaken on the directional MAC protocols, most of them focus only on one or several aspects in their design and performance evaluations, and a comprehensive comparative study is missing. In this paper, we first explore the design space of directional MAC and present a taxonomy of existing schemes. Then, we discuss the major problems in using directional antennas under different category of MAC schemes. After that, we propose coordinated directional medium access control (CDMAC), a novel directional MAC protocol to improve throughput via facilitating the simultaneous contention-free communications for multiple local node-pairs. We evaluate our CDMAC, one representative existing scheme and IEEE 802.11 via extensive ns2 simulations. Our results show CDMAC provides a satisfactory solution to all the major problems and significantly improves the throughput performance.

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


Experimental analysis and modeling of the anisotropic response of titanium alloy Ti-X for quasi-static loading at room temperature This paper deals with the characterization and modeling of the deformation behavior of titanium alloy Ti-X under quasi-static conditions at room temperature. The material investigated is a 1.2mm thick rolled sheet with a strong basal texture. Monotonic tensile, compressive and cyclic tests in various directions relative to the rolling direction were conducted in order to characterize the material behavior. Textural information was obtained from electron backscatter diffraction (EBSD) data. Strip drawing tests were also carried out. The experimental data has been extended to biaxial stress states using the visco-plastic self-consistent texture model (VPSC). The CPB06ex2 model Plunkett et al. (Int J Plast 24:847866, 2008) was used to describe the yield surface. This model can describe the anisotropy and the tension-compression asymmetry. Distortional hardening was described taking account of the evolution of the model parameters. An extension of the model using the Armstrong and Frederick approach makes it possible to account for the Bauschinger effect during cyclic loading. There was a high level of correlation between the FE simulation and experimental data.

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


Augmented reality registration algorithm based on nature feature recognition This paper presents an improved key frame based augmented reality registration algorithm for real-time motion tracking in outdoor environment. In such applications, wide-baseline feature matching is a critical problem. In this paper, we apply randomized tree method to match key points extracted from the input image to those key frames as a classification problem. Extended Kalman filter is also utilized for jitter correction. A video see-through mobile augmented reality system is built for the on-site digital reconstruction of Yuanmingyuan Garden. Experimental results demonstrate that this algorithm is real-time, robust and effective for outdoor tracking.

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

outdoor augmented reality
camera tracking


A non-linear 3D FEM model to simulate timber-concrete joints This paper, presents 3D non-linear FEM models developed to predict the mechanical behaviour of timber-concrete joints made with dowel-type-fasteners. They consider isotropic behaviour for steel and concrete and orthotropic behaviour for timber, all the materials are modelled with non-linear mechanical behaviour. Besides, the interaction between materials is modelled using contact elements associated with friction. The results obtained in the numerical simulations are evaluated and compared with results obtained in laboratory shear tests. The model developed showed the capacity to simulate the behaviour of the joints if the materials used are properly modelled. Nevertheless further research is still necessary to improve the modelling of the materials particularly timber. (C) 2006 Elsevier Ltd. and Civil-Comp Ltd. All rights reserved.

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

timber-concrete
3d fem models
non-linear analysis
dowel type fasteners
constitutive law
yield criterion


Weighted Coxeter graphs and generalized geometric representations of Coxeter groups We introduce the notion of weighted Coxeter graph and associate to it a certain generalization of the standard geometric representation of a Coxeter group. We prove sufficient conditions for faithfulness and non-faithfulness of such a representation. In the case when the weighted Coxeter graph is balanced we discuss how the generalized geometric representation is related to the numbers game played on the Coxeter graph.

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

coxeter groups
coxeter graphs
geometric representation
numbers game

signed graphs
weighted graphs
balanced functions on graphs


Adaptive optimization of join trees for multi-join queries over sensor streams Data processing applications for sensor streams have to deal with multiple continuous data streams with inputs arriving at highly variable and unpredictable rates from various sources. These applications perform various operations (e.g. filter, aggregate, join, etc.) on incoming data streams in real-time according to predefined queries or rules. Since the data rate and data distribution fluctuate over time, an appropriate join tree for processing join queries must be adaptively maintained in response to dynamic changes to prevent rapid degradation of the system performance. In this paper, we address the problem of finding an optimal join tree that maximizes throughput for sliding window based multi-join queries over continuous data streams and prove its NP-Hardness. We present a dynamic programming algorithm, OptDP, which produces the optimal tree but runs in an exponential time in the number of input streams. We then present a polynomial time greedy algorithm, XGreedyJoin. We tested these algorithms in ARES, an adaptively re-optimizing engine for stream queries, which we developed by extending Jess (Jess is a popular RETE-based, forward chaining rule engine written in java). For almost all instances, trees from XGreedyJoin perform close to the optimal trees from OptDP, and significantly better than common heuristics-based XJoin algorithms. (C) 2007 Elsevier B.V. All rights reserved.

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

adaptive optimization
dynamic programming

stream query
join query
sensor stream
sliding windows


Low-cost binding update schemes based on mobility type in HMIPv6 Mobile IP represents a global solution that provides mobility management for a wide variety of radio technologies, devices, and applications. Significant research results relating to extensions for Mobile IPv6 have been reported over the last several years. However, practical issues exist within the technology. In particular, specification of the binding update lifetime has a substantial impact on system performance. In Mobile IPv6, the binding update message should be delivered periodically for the purpose of user-location notification and binding authorization. If the lifetime is too short, the traffic load resulting from the messages may be significant. In addition, energy-efficiency problems may surface for mobile nodes in standby mode, and issues related to authorization can be problematic. In this paper, therefore, binding update schemes are devised to obtain high-energy-efficiency mobile nodes in hierarchical Mobile These solutions also affect authorization for binding between the mobile node and correspondent nodes. Advance information about the mobility pattern of each mobile node can be very useful in decreasing the required frequency of binding update messages; that is, if each user maintains a locally based profile of moving history, this information can be very useful in fixing the lifetime in term of current location. In addition, the resident Lime is occasionally affected by the daily arrival time as well as the subnet. Thus, an expanded scheme that considers the time region of the arrival time per subnet is also proposed. Through extensive experiments, the performance improvement achieved by die proposed schemes is presented.

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

binding update
lifetime
mobility type
profile


Development of correlation-based clustering method and its application to software sensing The individuality of production devices should be taken into account when soft-sensors are designed for parallelized devices. Since it is expressed as differences of the correlation among measured variables, it is useful to cluster samples on the basis of the correlation among variables for adopting a multi-model approach. In addition, changes in process characteristics can be coped with in the same way. In the present work, a new clustering method, referred to as NC-spectral clustering, is proposed by integrating the nearest correlation (NC) method and spectral clustering. Spectral clustering is a graph partitioning method that can be used for sample classification when an affinity matrix of a weighted graph is given. The NC method can detect samples that are similar to the query from the viewpoint of the correlation without a teacher signal. In the proposed method, the NC method is used for constructing the weighted graph that expresses the correlation-based similarities between samples and the constructed graph is partitioned by using spectral clustering. In addition, a new soft-sensor design method is proposed on the basis of the proposed NC-spectral clustering. The usefulness of the proposed methods is demonstrated through a numerical example and a case study of parallelized batch processes. The performance of the proposed correlation-based method is better than that of the conventional distance-based methods. (C) 2010 Elsevier B.V. All rights reserved.

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

nearest correlation method
soft-sensor
batch process
graph theory


Adaptive branch and bound algorithm for selecting optimal features We propose a new adaptive branch and bound algorithm for selecting the optimal subset of features in pattern recognition applications. The algorithm improves the search speed by avoiding unnecessary criterion function calculations at nodes in the solution tree. Our algorithm includes the following new properties: (i) ordering the tree nodes by the significance of features during construction of the tree, (ii) obtaining a large good initial bound by a floating search method, (iii) a new method to select an initial starting search level in the tree, and (iv) a new adaptive jump search strategy to select subsequent search levels to avoid redundant criterion function calculations. Our experimental results for four different databases demonstrate that our method is significantly faster than other versions of the branch and bound algorithm when the database has more than 30 features.

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

dimensionality reduction
feature selection
optimal subset search


Optimized electrode and interface for enhanced reliability of high-k based metalinsulatormetal capacitors Lowering top electrode deposition temperature improves MIM-capacitor performance. Substrate pre-treatment with chemical oxide improves reliability of MIM-capacitor. PooleFrenkel conduction was fitted for higher voltage regions.

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


joint deduplication of multiple record types in relational data Record deduplication is the task of merging database records that refer to the same underlying entity. In relational data-bases, accurate deduplication for records of one type is often dependent on the decisions made for records of other types. Whereas nearly all previous approaches have merged records of different types independently, this work models these inter-dependencies explicitly to collectively deduplicate records of multiple types. We construct a conditional random field model of deduplication that captures these relational dependencies, and then employ a novel relational partitioning algorithm to jointly deduplicate records. For two citation matching datasets, we show that collectively deduplicating paper and venue records results in up to a 30\% error reduction in venue deduplication, and up to a 20\% error reduction in paper deduplication.

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

merging
task
dependencies
deduplication
conditional random field
types
reduction
matching
data
paper
algorithm
model
database
records

partition
data base
relation
conditional random
errors
fields
record linkage


Modeling behavioral considerations related to information security ? ?? The authors present experimental and simulation results of an outcome-based learning model for the identification of threats to security systems. This model integrates judgment, decision-making, and learning theories to provide a unified framework for the behavioral study of upcoming threats.

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

computer security
threat detection
judgment and decision-making
system dynamics
computer simulation
theory integration
experimental data


Built-in Jitter Measurement Circuit With Calibration Techniques for a 3-GHz Clock Generator This paper proposes a 3-GHz built-in jitter measurement (BIJM) circuit to measure clock jitter on high-speed transceivers and system-on-chip (SoC) systems. The proposed BIJM circuit adopts a high timing resolution and self-calibration techniques. To eliminate process variation effects in 3 GHz systems, this study proposes an auto-calibration technique for the self-refereed circuit and other calibration techniques for the time amplifier (TA) and vernier ring oscillator (VRO), respectively. These calibration techniques can reduce the timing resolution variation of the vernier ring oscillator and the gain variation of the TA by 66% and 65%, respectively. This reduces the timing resolution variation of BIJM by 60%. Because the vernier ring oscillator and time amplifier achieve a small timing resolution, the BIJM circuit does not need an additional jitter-free reference signal using the self-refereed circuit. This study fabricated the BIJM circuit using the UMC 90-nm CMOS process. The BIJM circuit has a power consumption measuring 11.4 mW, and its core area is 120 mu m x 320 mu m. The BIJM circuit measured the Gaussian distribution jitter at a 1.8 ps timing resolution with a 3-GHz input clock frequency.

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

auto-calibration
built-in jitter measurement (bijm)
measurement error
vernier ring oscillator (vro)


Analysis and comparison of current control methods on bridgeless converter to improve power quality Performance analysis of PFC control methods is presented for a bridgeless converter. PIC, ASC and PCC methods are compared under continuous conduction mode (CCM). Unity PF and lower THD of input current are obtained. They are verified by simulations and experiments carried out on 600W and 50kHz. The experiments performed in the laboratory under input voltage and load variation.

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

unity power factor
pi control
predictive current control
average sliding control
matlab/simulink


DIVA: a visualization system for exploring document databases for technology forecasting Database Information Visualization and Analysis system (DIVA) is a computer program that helps perform bibliometric analysis of collections of scientific literature and patents for technology forecasting. Documents, drawn from the technological field of interest, are visualized as clusters on a two dimensional map, permitting exploration of the relationships among the documents and document clusters and also permitting derivation of summary data about each document cluster. Such information, when provided to subject matter experts performing a technology forecast, can yield insight into trends in the technological field of interest. This paper discusses the document visualization and analysis process: acquisition of documents, mapping documents, clustering, exploration of relationships, and generation of summary and trend information. Detailed discussion of DIVA exploration functions is presented and followed by an example of visualization and analysis of a set of documents about chemical sensors. (C) 2002 Published by Elsevier Science Ltd.

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

technology forecasting
information visualization

knowledge discovery in databases
kdd
data mining
citation analysis
document mapping
bibliometrics
scientometrics


Thermal image enhancement using bi-dimensional empirical mode decomposition in combination with relevance vector machine for rotating machinery fault diagnosis In this study, a novel fault diagnosis system for rotating machinery using thermal imaging is proposed. This system consists of bi-dimensional empirical mode decomposition (BEMD) for image enhancement, a generalized discriminant analysis (GDA) for feature reduction, and a relevance vector machine (RVM) for fault classification. Firstly, the thermal image obtained from machine conditions is decomposed into intrinsic mode functions (IMFs) by using BEMD. At each decomposed level, the IMF is expanded and fused with the residue by gray-scale transformation and principal component analysis fusion technique, respectively. The enhanced image is then formed by the improved IMFs in reconstruction process. Subsequently, feature extraction is applied for the enhanced images to obtain histogram features which characterize the thermal image and contain useful information for diagnosis. The high dimensionality of the achieved feature set can be reduced by GDA implementation. Moreover, GDA also assists in the increase of the feature cluster separation. Finally, the diagnostic results are performed by RVM. The proposed system is applied and validated with the thermal images of a fault simulator. A comparative study of the classification results obtained from RVM, support vector machines, and adaptive neuro-fuzzy inference system is also performed to appraise the accuracy of these models. The results show that the proposed diagnosis system is capable of improving the classification accuracy and efficiently assisting in rotating machinery fault diagnosis.

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

thermal image
rotating machinery fault diagnosis
generalized discriminant analysis


A GEOMETRIC PROOF OF THE UPPER BOUND ON THE SIZE OF PARTIAL SPREADS IN H(4n+1, q(2)) We give a geometric proof of the upper bound of q(2n+1) + 1 on the size of partial spreads in the polar space H(4n + 1, q(2)). This bound is tight and has already been proved in an algebraic way. Our alternative proof also yields a characterization of the partial spreads of maximum size in H(4n + 1, q(2)).

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


Preparation of multi-qubit W states in multiple resonators coupled by a superconducting qubit via adiabatic passage We propose an efficient scheme to prepare W state of \(N\) superconducting (SC) qubits in \(N\) spatially separated coplanar waveguide (CPW) resonators via adiabatic passage. The \(N\) CPW resonators, each trapping a SC qubit, are coupled only by a superconducting coupler (SCC) qubit. Based on a circuit quantum electrodynamics system, our scheme can be controlled and implemented easily in experiment. As a model of a plurality of separated cavities coupled to a SCC qubit, our protocol can be useful in scalable distributed quantum networks. By introducing adiabatic passage into our model, there is no need to control the Rabi frequency of classical field and the interaction time precisely during the whole operation. Also, the dissipation from the resonators and the energy relaxation can be omitted approximately.

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

w entangled state
circuit quantum electrodynamics (qed)
adiabatic technology


Regulation 3.0 for Telecom 3.0 Telecommunications infrastructure goes through technology-induced phases, and the regulatory regime follows. Telecom 1.0, based on copper wires, was monopolistic in market structure and led to a Regulation 1.0 with government ownership or control. Wireless long-distance and then mobile technologies enabled the opening of that system to one of multi-carrier provision, with Regulation 2.0 stressing privatization, entry, liberalization, and competition. But now, fiber and high-capacity wireless are raising scale economies and network effects, leading to a more concentrated market. At the same time, the rapidly growing importance of infrastructure, coupled with periodic economic instabilities, increase the importance of upgrade investments. All this leads to the return for a larger role for the state in a Regulation 3.0 which incorporates many elements (though using a different terminology) of the traditional regulatory systemuniversal service, common carriage, cross-subsidies, structural restrictions, industrial policy, even price and profit controls. At the same time, the growing role of telecommunications networks of carriers of mass media and entertainment content will also lead to increasing obligations on network providers to police their networks and assure the maintenance of various societal objectives tied to mass media. These are predictions, not recommendations.

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

ict
telecommunications infrastructure
investment
internet


A practical off-line digital money system with partially blind signatures based on the discrete logarithm problem We propose an untraceable electronic money system. Our system uses the partially blind signature based on the discrete logarithm problem, and applies secret key certificates to the payment protocol.

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

partially blind signature
discrete logarithm
untraceable electronic money


Low-Power Correlation for IEEE 802.16 OFDM Synchronization on FPGA This brief compares the use of multiplierless and DSP slice-based cross-correlation for IEEE 802.16d orthogonal frequency division multiplexing (OFDM) timing synchronization on Xilinx Virtex-6 and Spartan-6 field programmable gate arrays (FPGAs). The natural approach, given the availability of embedded DSP blocks on these FPGAs, would be to implement standard multiplier-based cross-correlation. However, this can consume a significant number of DSP blocks, which may not fit on low-power devices. Hence, we compare a DSP48E1 slice-based design to four different quantizations of multiplierless correlation in terms of resource utilization and power consumption. OFDM timing synchronization accuracy is evaluated for each system at different signal-to-noise ratios. Results show that even relatively coarse multiplierless coefficient quantization can yield accurate timing synchronization, and does so at high clock speeds. Multiplierless designs enjoy reduced power consumption over the DSP48E1 Slice-based design, and can be used where DSP Slice resources are insufficient, such as on low-power FPGA devices.

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

orthogonal frequency division multiplexing (ofdm)


Fast Gaussian wavepacket transforms and Gaussian beams for the Schrodinger equation This paper introduces a wavepacket-transform-based Gaussian beam method for solving the Schrodinger equation. We focus on addressing two computational issues of the Gaussian beam method: how to generate a Gaussian beam representation for general initial conditions and how to perform long time propagation for any finite period of time. To address the first question, we introduce fast Gaussian wavepacket transforms and develop on top of them an efficient initialization algorithm for general initial conditions. Based on this new initialization algorithm, we address the second question by reinitializing the beam representation when the beams become too wide. Numerical examples in one, two, and three dimensions demonstrate the efficiency and accuracy of the proposed algorithms. The methodology can be readily generalized to deal with other semi-classical quantum mechanical problems. (C) 2010 Elsevier Inc. All rights reserved.

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

fast gaussian wavepacket transforms
gaussian beams
schrodinger equation


using converging methods across disciplines to guide the redesign of a large, information-rich web site This paper summarizes how differing research methodologies were sequenced during formative evaluation of a large-scale government Web site in order to generate consensus for site redesign and a clear typology of users. Each method was selected by an interdisciplinary research team to bring to the study a convergence of approaches across the fields of human computer interaction, information science, health communication, and social marketing. Researchers can use the study framework in optimizing their own program of organizational and user research, particularly if they are designing and testing large-scale information-rich sites with varied content accessed by a diverse set of users.

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

communication
framework
order
human computer interaction
use
user research
social
research methodologies
paper
evaluation
convergence
science
research
method
users
health
web site
interdisciplinary
consensus

market
large-scale
organizational research
informal
formative research
contention
methodology
optimality
user-centered design
test
web evaluation
user segmentation
strategic planning
governance
audience research


Managing knowledge on the Web - Extracting ontology from HTML Web In recent years, the Internet has become one of the most important sources of information and it is now imperative that companies are able to collect, retrieve. process, and manage information from the Web. However, due to the sheer amount of information available, browsing web content by searches using keywords is inefficient, largely because unstructured HTML web pages are written for human comprehension and not for direct machine processing. For the same reason, the degree of web automation is limited. It is recognized that semantics can enhance web automation, but it but it will take an indefinite amount of effort to convert the current HTML Web into the Semantic Web. This study proposes a novel ontology extractor, called OntoSpider, for extracting ontology from the HTML Web. The contribution of this work is the design and implementation of a six-phase process that includes the preparation. transformation, clustering recognition, refinement, and revision for extracting ontology from unstructured HTML pages. The extracted ontology provides structured and relevant information for applications such as e-commerce and knowledge management that can be compared and analyzed more effectively. We give detailed information on the system and provide a series of experimental results that validate the system design and illustrate the effectiveness of OntoSpider. (C) 2009 Elsevier B.V. All rights reserved.

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

knowledge management application
intelligent web services


Non-uniform sampled cubic phase function Parameter estimation of polynomial phase signals (PPSs) based on the cubic phase function (CPF) and its extensions cannot be performed by using the fast Fourier transform (FT) algorithm. Therefore, in order to express the CPF by means of the FT, in this paper we propose a scheme for the CPF evaluation based on non-uniform sampling. Calculation complexity of the estimation procedure is significantly reduced, whereas the accuracy is the same or better compared to the original algorithm.

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


On the arc-length and other quadratic control methods: Established, less known and new implementation procedures The use of control methods to compute geometrically nonlinear equilibrium paths is now well established. This paper reviews the arc-length method and other quadratic control methods, discussing implementation issues like (i) the root selection at the predictor and corrector stages, (ii) the use of partial corrections and the conjugation of arc-length and line search procedures, (iii) switching from spherical predictions to cylindric corrections, (iv) adopting constraint surfaces not centred at the last computed equilibrium point, (v) aligning elipsoidal constraint surfaces with the equilibrium path and (vi) the use of contractions from a plane surface to the quadratic surface. While most of these issues are not new, it seems useful to revisit some valuable techniques that a large number of researchers are unaware of thus, they are presented in an unified way and geometric interpretations are provided whenever possible. Some original contributions are also made, mainly concerning the elipsoidal constraint surfaces. The paper concludes with the presentation of a few numerical tests to assess and compare the efficiency of the various implementations addressed.

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

arc-length method
geometrical nonlinearity


Metamaterials: Definitions, properties, applications, and FDTD-based modeling and simulation (Invited paper) In this article, we review definition, origin, terminology, fundamental properties, design concepts and procedures, basic applications, modeling, and numerical simulation of metamaterials. It is shown that metamaterial origin can be easily understood by placing metamaterials in the more general context of artificial electromagnetic materials and of the efforts performed by the scientific community working in complex materials to mimic and overcome the properties of natural materials. The basic properties of some classes of metamaterials as well as the related limitations are reviewed and discussed. A new application-oriented definition of metamaterials is given in terms of a functionalizing layer placed in between the traditional concepts of materials and devices. Metamaterial applications and the design steps of metamaterial-based and metamaterial-inspired components are also discussed, with particular emphasis on the numerical simulation of ideal metamaterials through available solvers. In this frame, finite-difference time-domain (FDTD) modeling and simulation of the electromagnetic properties of metamaterials are deeply discussed. The recently introduced virtual MTM-FDTD tool is used to simulate the interaction between the electromagnetic field and metamaterials and show some metamaterial effects, such as beam focusing, existence of negative refractive angle, and so forth, through various examples in different scenarios. 2012 Wiley Periodicals, Inc. Int J RF and Microwave CAE 22:422438, 2012.

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

dng
eng
mng
dps
lhm
nim
bwm
kramers-kronig relations
energy conservation
material dispersion
metamaterial inclusions
characterization
retrieval of constitutive parameters
perfect lens
cloaking devices
metamaterial-based components
metamaterial-inspired components
lorentz model
drude model
debye model
wave propagation
snell law
gaussian beam
goos-hnchen shift


Relating weight constraint and aggregate programs: Semantics and representation Weight constraint and aggregate programs are among the most widely used logic programs with constraints. In this paper, we relate the semantics of these two classes of programs, namely, the stable model semantics for weight constraint programs and the answer set semantics based on conditional satisfaction for aggregate programs. Both classes of programs are instances of logic programs with constraints, and in particular, the answer set semantics for aggregate programs can be applied to weight constraint programs. We show that the two semantics are closely related. First, we show that for a broad class of weight constraint programs, called strongly satisfiable programs, the two semantics coincide. When they disagree, a stable model admitted by the stable model semantics may be circularly justified. We show that the gap between the two semantics can be closed by transforming a weight constraint program to a strongly satisfiable one so that no circular models may be generated under the current implementation of the stable model semantics. We further demonstrate the close relationship between the two semantics by formulating a transformation from weight constraint programs to logic programs with nested expressions, which preserves the answer set semantics. Our study on the semantics leads to an investigation of a methodological issue, namely, the possibility of compact representation of aggregate programs by weight constraint programs. We show that almost all standard aggregates can be encoded by weight constraints compactly. This makes it possible to compute the answer sets of aggregate programs using the answer set programming solvers for weight constraint programs. This approach is compared experimentally with the ones where aggregates are handled more explicitly, which show that the weight constraint encoding of aggregates enables a competitive approach to answer set computation for aggregate programs.

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

stable model
weight constraint
aggregates
logic programs with constraints


Teacherstudent relationship in online classes: A role of teacher self-disclosure The study explores the role of teacher self-disclosure (SD) in online classes. The study focuses on teacherstudent relationship (TSR) in online classes. The effect of teacher SD on TSR is stronger online compared to FtF classes. TSR mediates the relationship between teacher SD and learning experiences.

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


Social psychophysiological compliance in a four-person research team A continuous, non-invasive and objective measure of teamwork effectiveness could be very useful to the human factors design community. Social psychophysiological compliance (SPC), estimated by scoring theextent that heart rate variation was synchronous across team members, was explored as a predictor of teamwork effectiveness during 20 real planning meetings over a 6-month period. Speech activity and heart rate variability of all four (2 male, 2 female) team members were continuously monitored. Exploratory analyses tested if team member ratings of various aspects of teamwork effectiveness were predicted by SPC scored (1) over whole meetings, (2) during one team member's speech, (3) during periods in which two team members spoke in sequence or (4) over 30-s periods and averaging highest values. SPC during periods of sequential speech negatively predicted team members' ratings of Team productivity, Quality of communication, and Ability to work together. SPC shows potential as an objective, non-invasive means to monitor teamwork effectiveness but this relationship warrants further investigation and replication before use in ergonomics applications.

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


Enhancing the detection of metamorphic malware using call graphs Malware stands for malicious software. It is software that is designed with a harmful intent. A malware detector is a system that attempts to identify malware using Application Programming Interface (API) call graph technique and/or other techniques. API call graph techniques follow two main steps, namely, transformation of malware samples into an API call graph using API call graph construction algorithm, and matching the constructed graph against existing malware call graph samples using graph matching algorithm. A major issue facing malware API call graph construction algorithms is building a precise call graph from information collected about malware samples. On the other hand call graph matching is an NP-complete problem and is slow because of computational complexity. In this study, a malware detection system based on API call graph is proposed. In the proposed system, each malware sample is represented as an API call graph. API call graph construction algorithm is used to transform input malware samples into API call graph by integrating API calls and operating system resource to represent graph nodes. Moreover, the dependence between different types of nodes is identified and represented using graph edges. After that, graph matching algorithm is used to calculate similarity between the input sample and malware API call graph samples that are stored in a database. The graph matching algorithm is based on an enhanced graph edit distance algorithm that simplifies the computational complexity using a greedy approach to select best common subgraphs from the integrating API call graph with high similarity, which helps in terms of detecting metamorphic malware. Experimental results on 514 malware samples demonstrate that the proposed system has 98% accuracy and 0 false positive rates. Detailed comparisons against other detection methods have been carried out and significant improvement over them is shown.

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

computer security
malware detection
api call graph construction algorithm
api call graph matching algorithm


THE COMBINED STATISTICAL STEPWISE AND ITERATIVE NEURAL NETWORK PRUNING ALGORITHM In this paper. we present a new pruning algorithm formed by combining the Statistical Stepwise Method (SSM) [1] with the Iterative Pruning (IP) [4] algorithms. This proposed algorithm (SSIP) is used to simultaneously remove unnecessary neurons or weight connections from a given feed-forward neural network (NN) in order to "Optimize" its structure. Some modifications to the previous pruning algorithms published in [1] and [4] are also reported. Two versions of the combined SSIP are considered: In the first version, SSIP1, the modified IP is first applied to the given neural network in order to prune insignificant units, and their tire modified SSM is applied to the pruned network to remove unnecessary links. In the second version. SSIP2. the above procedure is applied to each layer in turn. working from the input layer to the output layer. The performances of the algorithms are compared using two real world applications, brain disease detection and texture classification. and the superiority of the SSIP pruning algorithm is demonstrated. This new algorithm can eliminate approximately 59% of the links in the initial oversized network in order to improve performance by approximately +39% and +26% for the sensitivity of learning, and generalization, respectively.

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

feed-forward neural network (nn)
iterative pruning algorithm (ip)
statistical stepwise method (ssm)
ssm-iterative pruning algorithm (ssip)


Dynamic Programming Algorithms and Grammatical Modeling for Protein Beta-Sheet Prediction Protein structure prediction is one major task in computational biology, and various methods have been proposed for secondary structure prediction. In particular, it is a challenge to predict beta-sheet structures since they range over several discontinuous regions in an amino acid sequence. In this article, we propose dynamic programming algorithms for several kinds of antiparallel beta-sheets, where the proposed approach can be extended for more general classes of beta-sheets. Experimental results for real data show that our prediction algorithms have good performance in accuracy. We also show a relation between the proposed algorithms and an existing grammar-based method, and present another grammatical modeling. Furthermore, we prove that prediction of planar beta-sheet structures is NP-hard.

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

formal grammar
computational complexity
beta-sheet


Np-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem The minimum vertex ranking spanning tree problem (MVRST) is to find a spanning tree of G whose vertex ranking is minimum. In this paper, we show that MVRST is NP-hard. To prove this, we polynomially reduce the 3-dimensional matching problem to MVRST. Moreover, we present a (?Ds/2?+1)/(?log2(Ds+1)?+1) ( ? D s / 2 ? + 1 ) / ( ? log 2 ( D s + 1 ) ? + 1 ) -approximation algorithm for MVRST where Ds D s is the minimum diameter of spanning trees of G.

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

vertex ranking
spanning tree
approximation algorithm

graph theory
np-hard
computational complexity


Real-time automatic recognition of omnidirectional multiple barcodes and DSP implementation Barcodes have been extensively adopted in daily life, such as in merchandise labels, inventory control, storage/retrieval systems and inspection. Computer-vision-based barcode recognition can definitely facilitate barcode reading, especially for multiple barcodes and free orientation and in complex scenarios. This work, presents an automatic barcode detection and recognition algorithm for multiple and rotation invariant barcode decoding. The proposed system comprises three stages. First, the barcode is extracted by coarse-to-fine segmentation in four steps: background small clutter reduction, candidate barcode segmentation, barcode verification and barcode rotation and regularization. To enhance the barcode region, thin and small background noise clusters are eliminated using Max-Min Differencing. The approach combines several image-processing schemes, namely Gaussian smoothing filtering, connected component analysis, orientation homogeneity, moment analysis and iterative thresholding. The second stage decodes the barcode by scanning multiple traversal lines, thus preventing decoding errors due to minor barcode defects. Finally, the proposed system is implemented and optimized on a DM6437 DSP EVM board. Experimental results indicate that the proposed approach can locate multiple and omnidirectional barcodes, even with a complex background and minor distortion. The recognition rates for 10,395 lottery barcodes and 388 merchandise barcodes are 99.74 and 90.7%, respectively. The proposed system is promising and has been successfully adopted in commercial applications of lottery reading and verification of winning numbers.

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

1-d barcode
barcode extraction
dm6437 fixed point dsp
optimization


A branch-and-cut algorithm uncapacitated, fixed-charge for the single-commodity, network flow problem We present a branch-and-cut algorithm to solve the single-commodity, uncapacitated, fixed-charge network flow problem, which includes the Steiner tree problem, uncapacitated lot-sizing problems, and the fixed-charge transportation problem as special cases. The cuts used are simple dicut inequalities and their variants. A crucial problem when separating these inequalities is to find the right cut set on which to generate the inequalities. The prototype branch-and-cut system, bc-nd, includes a separation heuristic for the dicut inequalities and problem-specific primal heuristics, branching, and pruning rules. Computational results show that bc-nd is competitive compared to a variety of special purpose algorithms for problems with explicit flow costs. We also examine how general purpose MIP systems perform on such problems when provided with formulations that have been tightened a priori with dicut inequalities. (C) 2003 Wiley Periodicals, Inc.

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

network design
fixed charge
branch and cut
minimum-cost flow


Entropy, complexity, and spatial information We pose the central problem of defining a measure of complexity, specifically for spatial systems in general, city systems in particular. The measures we adopt are based on Shannons (in Bell Syst Tech J 27:379423, 623656, 1948) definition of information. We introduce this measure and argue that increasing information is equivalent to increasing complexity, and we show that for spatial distributions, this involves a trade-off between the density of the distribution and the number of events that characterize it; as cities get bigger and are characterized by more eventsmore places or locations, information increases, all other things being equal. But sometimes the distribution changes at a faster rate than the number of events and thus information can decrease even if a city grows. We develop these ideas using various information measures. We first demonstrate their applicability to various distributions of population in London over the last 100years, then to a wider region of London which is divided into bands of zones at increasing distances from the core, and finally to the evolution of the street system that characterizes the built-up area of London from 1786 to the present day. We conclude by arguing that we need to relate these measures to other measures of complexity, to choose a wider array of examples, and to extend the analysis to two-dimensional spatial systems.

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


A fast method for solving three-dimensional arbitrarily shaped inclusions in a half space This paper presents a fast method for solving the problem of three-dimensional arbitrarily shaped inclusions in an isotropic half space. The solution utilizes the closed-form solution for a cuboidal inclusion in an infinite space by breaking up the arbitrarily shaped inclusions into multiple cuboids. A combination of three-dimensional and two-dimensional fast Fourier transform algorithms is applied to evaluate the solution. Both theoretical estimates and computational tests demonstrate that the present method can achieve significant computational efficiency as well as effective data space reduction. Numerical results are also presented that show the applicability of the method to available solutions for error analysis and to new solutions.

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

arbitrarily shaped
inclusion
half space
fast fourier transform


eye-tracking for avatar eye-gaze and interactional analysis in immersive collaborative virtual environments Participants' eye-gaze is generally not captured or represented in immersive collaborative virtual environment (ICVE) systems. We present EyeCVE , which uses mobile eye-trackers to drive the gaze of each participant's virtual avatar, thus supporting remote mutual eye-contact and awareness of others' gaze in a perceptually unfragmented shared virtual workspace. We detail trials in which participants took part in three-way conferences between remote CAVE systems linked via EyeCVE . Eye-tracking data was recorded and used to evaluate interaction, confirming the system's support for the use of gaze as a communicational and management resource in multiparty conversational scenarios. We point toward subsequent investigation of eye-tracking in ICVEs for enhanced remote social-interaction and analysis.

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

telecommunication
eye-gaze
social presence
eye-tracking
avatars


Smartphone information security awareness: A victim of operational pressures ? Smartphone information security awareness describes the knowledge, attitude and behaviour that employees apply to the security of the organisational information that they access, process and store on their smartphone devices. The surge in the number of smartphone devices connecting to organisational systems and used to process organisational data has enabled a new level of operational efficiency. While employees are aware of the benefits they enjoy by bringing their personal devices into the workplace, managers too are aware of the benefits of having a constantly connected workforce. Unfortunately, those aware of the risks to information security do not share an equal level of enthusiasm. These devices are owned by employees who are not adequately skilled to configure the security settings for acceptable security of that information. Moreover, routine information security awareness programmes, even if applied, gradually fade into the daily rush of operations from the day they are completed. This paper explores the factors which influence these oscillating levels of information security awareness. By applying an adapted version of an awareness model from the domain of accident prevention, the factors which cause diminishing awareness levels are exposed. Subsequently, information security awareness emerges as a symptom of such factors. Through geometrical modelling of the boundaries and pressures that govern our daily operations, an awareness model emerges. This model ensures that organisations are better equipped to monitor their information security awareness position, their boundaries and the daily pressures affecting the organisation, thus allowing them to design better integrated policies and procedures to encourage safe operating limits. The model is evaluated using a theory evaluation framework through an expert review process.

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

smartphone
information security
awareness

bring your own device (byod)
mobile computing


Wavelength conversion in WDM optical networks: Strategies and algorithms for limiting the number of converters in the optical cross-connects This paper considers the problem of wavelength conversion in optical networks using wavelength division multiplexing technique. In the previous literature, two main wavelength routing and assignment strategies have been introduced: wavelength path (WP) and virtual wavelength path (VWP), depending on whether the signal stays on the same wavelength or is converted to another during its travel throughout the network. While the former method does not require any wavelength conversion, the latter needs wavelength conversion in each optical node and, in particular, a wavelength converter per each signal handled by the node itself. From the previous literature emerged that the VWP leads to optical cross-connect (OXC) with lower dimensions compared to the ones required by the WP scheme, and that the difference between the WP and VWP schemes increases as the number of wavelengths carried by each fiber increases. In this paper a new strategy is introduced, named partial virtual wavelength path (PVWP), with the related wavelength routing and assignment algorithm, which makes limited use of wavelength conversion compared to the VWP scheme, and allows the same advantages of VWP to be attained with lower OXC dimensions. The paper reports a comparative analysis among the different strategies, considering both the cases of a network without failures and a network with the possibility of failure restoration. The main result is that the proposed PVWP strategy allows the same advantages of the VWP scheme with a strongly reduced number of wavelength converters (around 5% of the number required by VWP scheme). This figure does not vary appreciably if failure restoration is considered. The new strategy can be adopted by using an opportune OXC architecture, as illustrated in the paper, which allow a limited number of converters to be shared among all the channels as a common pool.

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

optical networks
wdm
oxc
wavelength conversion

routing policies
wavelength routing algorithms
wavelength assignment algorithms