Some families of hypergeometric transformations and generating relations By applying a quadratic transformation for the Gauss hypergeometric function, the authors derive a family of generating relations for a general polynomial system. Several interesting consequences of the main result, involving various classes of hypergeometric polynomials, are considered. Further generating relations associated with the Laguerre functions and polynomials are also investigated. (C) 2002 Elsevier Science Ltd. All rights reserved.

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

generating relations
hypergeometric polynomials
laguerre functions and polynomials

hypergeometric functions
quadratic transformations
reduction formulas
contiguous-function relations
jacobi polynomials
brafman polynomials


A new image rectification algorithm A novel and efficient image rectification method using the fundamental matrix is proposed. In this approach, camera calibration is not required, and image resampling becomes very simple by using the Bresenham algorithm to extract pixels along the corresponding epipolar line. The rectified images are guaranteed to be effective for all possible camera motions, large or small. The loss of pixel information along the epipolar lines is minimized, and the size of rectified image is much smaller. Furthermore, it never splits. the image and the connected regions will stay connected, even if the epipole locates inside an image. The effectiveness of our method is verified by an extensive set of real experiments. It shows that much more accurate matches of feature points can be obtained for a pair of images after the proposed rectification. (C) 2002 Elsevier Science B.V. All rights reserved.

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

disparity
epipolar geometry
binocular stereovision
uncalibration
minimal epipolar distortion


A 10-bit 100MSamples/s BiCMOS D/A converter This paper presents a IO-bit Digital-to-Analogue Converter (DAC) based on the current steering principle. The DAC is processed in a 0.8 mu m BICMOS process and is designed to operate at a sampling rate of 100MSamples/s. The DAC is intended for applications using direct digital synthesis, and focus has been set on reducing dynamic nonlinearities to achieve a high spurious free dynamic range (SFDR) at high generated frequencies. The main part of the DAC consists of a matrix of current cells. Each current cell contains an emitter-coupled logic (ECL) flip-flop, clocked by a global ECL clock to ensure accurate clocking. A bipolar differential pair, with a cascode CMOS current sink, steered by the differential output of the ECL flip-flop, is used in each current cell to steer the current. The DAC operates at 5V, and has a power consumption of approximately 650mW. The area of the chip-core is 2.2mm x 2.2mm. The measured integral nonlinearity (INL) and differential nonlinearity (DNL) are both approximately 2 LSB. At a generated frequency of f(g) approximate to 0.1 . f(s)(f(s) = 100MSamples/s) the measured SFDR is 50dB, and at f(g) approximate to 0.3 . f(s) the measured SFDR is as high as 43dB. The DAC is operating up to a sampling frequency of approximately 140MSamples/s. The DAC uses the hierarchical switching scheme and therefore the dynamic performance is not described well using the conventional glitch energy. A new energy measure that replaces the conventional glitch energy is therefore proposed. This energy measure is especially useful during the design phase.

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

digital-to-analogue converter (dac)
high spurious free dynamic range (sfdr)
clocked current cells
bicmos technique


a 3d j2me game utilizing autonomous moving agents This game is focused on the 3D single and multiplayer game possibilities of the J2ME platform. Mobile phones have become a common personal item that is available at all times. The aim is to present a 3D space fighting game utilizing an AI based on autonomous moving agents. This game demonstration will show viewers what is currently possible with J2ME mobile phones as well as foreshadow what is coming. As embedded mobile phone technology further improves, the gap between personal computers and mobile phones decreases. A possible multiplayer component will finally be described.

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

3d studio max
jsr-184
peer 2 peer
communication
modeling
steering behaviors
m3g


A new generalized p-value approach for testing equality of coefficients of variation in k normal populations A new generalized p-value method is proposed for testing the equality of coefficients of variation in k normal populations. Simulation studies show that the type I error probabilities are close to the nominal level. The proposed test is also compared with likelihood ratio test, modified Bennett's test and score test through Monte Carlo simulation, the results demonstrate that the generalized p-value method has satisfactory performance in terms of sizes and powers.

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

equality of coefficients of variation
likelihood ratio test
score test

generalized p-value
modified bennett's test


circuit optimization for leakage power reduction using multi-threshold voltages for high performance microprocessors A common concern as we scale down transistor threshold voltages while migrating to new process technologies is the requirement to achieve timing closure within a given power budget over various process corners. High performance microprocessors are designed keeping in mind the various process technologies, application space and multi-site fabrication requirements. Described here is an optimization methodology and a unique topology-aware heuristic algorithm employed for high speed microprocessor designs capable of simultaneous threshold voltage selection for library cells across various technology process corners. The algorithm uses knowledge of the circuit topology rather than considering only the immediate local connectivity as is suggested in other heuristic methods and evaluates timing criticalities originating from different input and output logic cones associated with every pin of a failing path. The V TH selection is done so as to affect multiple failing paths with each low VTH cell selection, hence reducing leakage power. Two sets of algorithms are used alternately. One takes advantage of the circuit topology to address multiple failing paths simultaneously. The other performs a fine tuned optimization that has more granularity while considering a particular failing path. This flow is not limited to dual threshold VTH selection but can also support the use of multi-V TH library cells. This flow and its algorithms reduced the usage of low V TH in a particular multi-million transistor design from 35.3\% to 10.7\% without any loss of performance thus resulting in a 55.6\% drop in leakage power. Reducing the usage of lower VTH cells results in significant power reduction. This reduction in power could also allow running the chip at a higher VDD and frequency within the original power envelope. Production results from this tool exceeded the optimization efforts of another commercially used EDA optimization tool.

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

timing
microprocessor
optimization
eda
leakage power


On the exponential representation problem The knowledge representation problem is understood as finding a reasonable joint distribution for a collection of marginal distributions. The problem is reformulated as a "moment problem", and the solution is searched in the exponential form. Further, an equivalent parametrization is introduced with a parameter which can be easily identified even in higher dimensional cases. The problem of evaluating relevant model characteristics is discussed.

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

exponential distribution
decomposable statistics


On the properties of regular increasing monotone (RIM) quantifiers with maximum entropy Compared with the large number of research papers dealing with the ordered weighted averaging (OWA) operators, the research on relative quantifiers has been relatively sparse so far. With the quantifier guided aggregation method of OWA operators and the generating function representation of regular increasing monotone (RIM) quantifiers, a parameterized RIM quantifier family with the maximum entropy principle is proposed. This quantifier family can be regarded as the continuous case of the commonly used maximum entropy OWA (MEOWA) operator. Like the MEOWA operator, the RIM quantifier with maximum entropy generating function also possesses some interesting properties. One of them is that the aggregation value for any aggregated set always monotonically increases with the orness level. This can be used to represent the decision maker's preference information, but with free dimension.

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

aggregation
rim quantifier
maximum entropy


Heterogeneity of learning material in synchronous computer-supported collaborative modelling This paper examines the effect of heterogeneous resources, available to students, during computer-supported collaborative problem solving. A study of collaborative modeling has been conducted in the frame of an authentic educational activity in a secondary school. The students involved were provided with sets of primitive resources of varying degrees of heterogeneity to be used during synchronous computer-mediated modeling activities. Analysis of students' peer interaction and of the produced solutions revealed that, contrary to our expectations, the group with heterogeneous resources produced solutions of similar quality to those of the reference group, although they were more active, they exchanged more messages, they were involved in deeper discussions and collaborated more for building the constituent parts of the solution. (C) 2004 Elsevier Ltd. All rights reserved.

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

computer-mediated communication
cooperative/collaborative learning
human-computer interaction


Polychotomous kernel Fisher discriminant via top-down induction of binary tree In spite of the popularity of Fisher discriminant analysis in the realm of feature extraction and pattern classification, it is beyond the capability of Fisher discriminant analysis to extract nonlinear structures from the data. That is where the kernel Fisher discriminant algorithm sets in the scenario of supervised learning. In this article, a new trail is blazed in developing innovative and effective algorithm for polychotomous kernel Fisher discriminant with the capability in estimating the posterior probabilities, which is exceedingly necessary and significant in solving complex nonlinear pattern recognition problems arising from the real world. Different from the conventional 'divide-and-combine' approaches to polychotomous classification problems, such as pairwise and one-versus-others, the method proposed herein synthesizes the multi-category classifier via the induction of top-to-down binary tree by means of kernelized group clustering algorithm. The deficiencies inherited in the conventional multi-category kernel Fisher discriminant are surmounted and the simulation on a benchmark image dataset demonstrates the superiority of the proposed approach. (C) 2010 Elsevier Ltd. All rights reserved.

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

kernel fisher discriminant
binary tree
kernelized group clustering

kernel-induced distance
posterior probability


Mining free-structured information based on hidden Markov models The potentials of hidden Markov models (HMM) in mining free-structured information are investigated in this study. The samples under test are relating to C4ISR information derived from the contents of Forecast International, which is a web-based database containing free-structured archive of forecast reports about aerospace systems, weapon systems, and military industries. This study focuses on three C4ISR relating target terms, namely, Company, System types, and cost, for information mining analysis. The experiments are performed in two stages. In the first stage, each HMM being built is exclusively serving for one target term information extraction so as to test the HMM fundamental information extraction capability. While in the second stage, the experiment is then extended to resolve a more complex, multiple term extraction issue. The results reveal that, by using HMMs as a basis, the accuracies can all achieve more than 80% for single target term extraction, and 76% in average for multi-term extraction case.

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

information extraction
forecast international
c4isr


Empowerment of patients and communication with health care professionals through an electronic health record Objective: The aim of this project was to design and develop a personal electronic health record (EHR) in order to support patient empowerment and additionally to enhance their communication and information exchange with health professionals through this EHR. Method: The functionality of a personal Electronic Healthcare Record (EHR) may vary from a simple web-based interface for interactive data entry and data review up to a much more powerful system additionally supporting electronic data/document communication between clinical information systems of primary care practitioners or hospitals and even reminder based support for the empowered citizen, to actively take care of his health, based on relevant disease management programs. It is one means to support patient empowerment, additionally supported by tools for building a patient community. Since storage and communication of data in an EHR comprises sensible personal health data, each of those functions needs specific security and access management requirements to be considered and implemented. Result: Clinical pilot projects are already done or under development.

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

electronic health record
patient empowerment

akteonline
akteonline.de
patient enlightenment
personal medical data


A process-driven computing model for reconfigurable semiconductor manufacturing Reconfigurability is essential for semiconductor manufacturing systems to remain competitive. Reconfigurable systems avoid costly modifications required to change and adapt to changes in product, production and services. A fully automated, collaborative, and integrated while reconfigurable manufacturing system proves cost-effective in the long term and is a promising strategy for the semiconductor manufacturing industry. However, there is a lack of computing models to facilitate the design and development of control and management systems in a truly reconfigurable manner. This paper presents an innovative computing model for reconfigurable systems and controlled manufacturing processes while allowing for the integration of modern technologies to facilitate reconfiguration, such as radio frequency identification (RFID) and reconfigurable field programmable gate array (FPGA). Shop floor manufacturing activities are modeled as processes from a business perspective. A process-driven formal method that builds on prior research on virtual production lines is proposed for the formation of a reconfigurable cross-facility manufacturing system. The trajectory of the controlled manufacturing systems is optimized for on-demand production services. Reconfigurable process controllers are introduced in support of the essential system reconfigurability of future semiconductor manufacturing systems. Implementation of this approach is also presented.

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

reconfigurable system
reconfigurable process controller
formal model
factory automation


Exploring the effect of control-flow and traversal direction on VPL usability for novices Programming is a hard cognitive activity, especially for novices who also have to struggle with learning the intricacies of the programming language syntax. We postulate that a well-designed diagrammatic visual programming language (VPL) to replace or substitute a textual programming language may help in the learning programming process. Our research focuses on the suitability of diagrammatic notations for such a VPL. In this paper, we report results from two experimental studies into diagrammatic notations. The first experiment shows the superiority of three visual representations over a conventional style textual program in both control- and data-flow paradigms. The result also shows the effect of programming paradigm on novices' performance. The second experiment focuses on two aspects of program flow representation: the graphical representation to be used for sequencing, and the traversal direction required of diagram users. It reveals that graphical representation does not affect performance in tracing program flow but that traversal direction makes a difference in cognitive demand on users. The evidence also indicates a control-flow preference among novices. (C) 2002 Elsevier Science Ltd. All rights reserved.

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

novice programmers
diagrammatic notation
control flow representations


Discovering

reliable

protein

interactions

from

high-throughput

experimental

data

using

network

topology

Current

proteinprotein

interaction

(PPI)

detection

via

high-throughput

experimental

methods,

such

as

yeast-two-hybrid

has

been

reported

to

be

highly

erroneous,

leading

to

potentially

costly

spurious

discoveries.

This

work

introduces

a

novel

measure

called

IRAP,

i.e.

interaction

reliability

by

alternative

path,

for

assessing

the

reliability

of

protein

interactions

based

on

the

underlying

topology

of

the

PPI

network.

A

candidate

PPI

is

considered

to

be

reliable

if

it

is

involved

in

a

closed

loop

in

which

the

alternative

path

of

interactions

between

the

two

interacting

proteins

is

strong.

We

devise

an

algorithm

called

AlternativePathFinder

to

compute

the

IRAP

value

for

each

interaction

in

a

complex

PPI

network.

Validation

of

the

IRAP

as

a

measure

for

assessing

the

reliability

of

PPIs

is

performed

with

extensive

experiments

on

yeast

PPI

data.

All

the

data

used

in

our

experiments

can

be

downloaded

from

our

supplementary

data

web

site

at

Results

show

consistently

that

IRAP

measure

is

an

effective

way

for

discovering

reliable

PPIs

in

large

datasets

of

error-prone

experimentally-derived

PPIs.

Results

also

indicate

that

IRAP

is

better

than

and

markedly

better

than

the

more

simplistic

measure.

Experimental

results

demonstrate

that

a

global,

system-wide

approachsuch

as

IRAP

that

considers

the

entire

interaction

network

instead

of

merely

local

neighborsis

a

much

more

promising

approach

for

assessing

the

reliability

of

PPIs.

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


A Generalization of Nash Bargaining and Proportional Fairness to Log-Convex Utility Sets With Power Constraints Many solutions and concepts in resource allocation and game theory rely on the assumption of a convex utility set. In this paper, we show that the less restrictive assumption of a logarithmic "hidden" convexity is sometimes sufficient. We consider the problems of Nash bargaining and proportional fairness, which are closely related. We extend the Nash bargaining framework to a broader family of log-convex sets. We then focus on the set of feasible signal-to-interference-plus-noise ratios (SINRs), for the cases of individual power constraints and a sum power constraint. Under the assumption of log-convex interference functions, we show how Pareto optimality of boundary points depends on the interference coupling between the users. Finally, we provide necessary and sufficient conditions for strict log-convexity of the feasible SINR region.

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

game theory
interference
nash bargaining
proportional fairness


Robot task planning and explanation in open and uncertain worlds A long-standing goal of AI is to enable robots to plan in the face of uncertain and incomplete information, and to handle task failure intelligently. This paper shows how to achieve this. There are two central ideas. The first idea is to organize the robot's knowledge into three layers: instance knowledge at the bottom, commonsense knowledge above that, and diagnostic knowledge on top. Knowledge in a layer above can be used to modify knowledge in the layer(s) below. The second idea is that the robot should represent not just how its actions change the world, but also what it knows or believes. There are two types of knowledge effects the robot's actions can have: epistemic effects (I believe X because I saw it) and assumptions (I'll assume X to be true). By combining the knowledge layers with the models of knowledge effects, we can simultaneously solve several problems in robotics: (i) task planning and execution under uncertainty; (ii) task planning and execution in open worlds; (iii) explaining task failure; (iv) verifying those explanations. The paper describes how the ideas are implemented in a three-layer architecture on a mobile robot platform. The robot implementation was evaluated in five different experiments on object search, mapping, and room categorization.

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

open-world planning
planning under uncertainty
mobile robotics
probabilistic reasoning
failure explanation
assumptive planning
retaskability


ManufAg: a multi-agent-system framework for production control of complex manufacturing systems In this paper, we present a framework for the implementation of multi-agent-systems for production control of complex manufacturing systems. We present the results of a requirement analysis for production control systems for complex manufacturing systems; then we describe the framework design criteria. Our framework supports the inclusion of distributed hierarchical decision-making schemes into the production control. Furthermore, in order to increase the coordination abilities of multi-agent-systems, we follow the decision-making and staff agent architecture suggested in the PROSA reference architecture. We indicate the usage of the framework for designing and implementing an agent-based production control system for semiconductor manufacturing processes in a case study.

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

production control
complex manufacturing systems

agent-based analysis and design
frameworks
software development


Uniqueness Results for Image Reconstruction from Features on Curves in ?-Scale Spaces A sufficient condition is presented for two-dimensional images on a finite rectangular domain ?=(?A,A)(?B,B) to be completely determined by features on curves t?(?(t),t) in the three-dimensional domain ?(0,?) of an ?-scale space. For any fixed finite set of points in the image, the values of the ?-scale space at these points at all scales together do not provide sufficient information to reconstruct the image, even if spatial derivatives up to any order are included as well. On the other hand, the image is completely fixed by the values of the scale space and its derivative along any straight line in ?(0,?) for which ?:(0,?)?? is linear but not constant. A similar result holds for curves for which ? is of the form ?(t)=(? 1(t),0) with ? 1 periodic and not constant. If the locations at which the scale space is evaluated form a curve on a cylinder in ?(0,?) with some periodic structure, like a helix, then it is sufficient to evaluate the ?-scale space without spatial derivatives.

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

?-scale space
multiscale representation
gaussian scale space
poisson scale space


boosting web-based public participation in urban planning with a group of key stakeholders Today, communication between planners and different stakeholders should be an integral part of participatory urban planning. In many cases, technologies supporting participation have been developed for the wider public separately from the existing ways of involvement, and even outside the planning context. In this paper, we report on three planning experiments that revealed a close connection between Web-based public participation and a group of key stakeholders involved in the planning. The results discussed in the paper give rise to hypothesize that the challenges of developing Web-based participation for the wider public can be overcome by tighter links between the technology development and actions of the key stakeholders.

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


Design of content-based publish/subscribe systems over structured overlay networks The management of subscriptions and events is an important task in the content-based publish/subscribe system. A good management mechanism can not only produce lower matching costs to speed up the delivery of matched events to the interested subscribers but can also induce good load balancing for subscription storage. In this paper, we consider the construction of this kind of system over a peer-to-peer overlay network and propose two message-to-node mapping schemes for system management. We both analyze and simulate the performance of the proposed schemes. The simulation results show the superiority of our schemes over existing ones.

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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 maximum entropy method to assess the predictability of financial and commodity prices We propose a novel signal processing method for financial time series analysis. We predict the entropy by a least square minimization approach. We evaluate (by theory and simulation) the mean and variance of the predictions. We apply our technique to several sets of historical financial data. The efficiency of our technique is shown versus conventional econometrics approach.

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

signal processing algorithms for financial engineering


A multi-application smart card system with authentic post-issuance program modification A multi-application smart card system consists of an issuer, service vendors and cardholders, where cardholders are recipients of smart cards (from the issuer) to be used in connection with applications offered by service vendors. Authentic post-issuance program modification is necessary for a multi-application smart card system because applications in the system are realized after the issuance of a smart card. In this paper, we propose a system where only authentic modification is possible. In the proposed system, the smart card issuer stores a unique long bitstring called PID in a smart card. The smart card is then given to the cardholder. A unique substring of the PID (subPID) is shared between the cardholder and a corresponding service vendor. Another subPID is shared between the issuer and the cardholder. During program modification, a protocol using the subPIDs, a one-way hash function and a pseudorandom number generator function verifies the identity of the parties and the authenticity of the program.

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

cryptographic protocols for smart cards
multi-application smart cards
security
authentication


combined terminal and network measurement system for bottleneck localization When a user experiences a poor quality of service (QoS) in a converged network environment, the operators or ISPs need to locate the bottleneck, i.e. to localize which part of the end-to-end (E2E) network path causes the degradation. We present a novel multipoint measurement system that gathers performance information not only from links in the network path, but also from the end devices. In wireless domain, this enables to separate the radio access network and fixed network segments. The measurement method is also applicable to pure fixed line networks. The system is able to perform one-way measurements and even break the E2E delay into one-way link-to-link components, which gives clear benefit over traditional round-trip time (RTT) measurements. The system was verified with laboratory 3G/HSPA (High Speed Packet Access) measurements that revealed a performance bottleneck in the studied 3G network. We also show measurement results in a live Wi-Fi city area network.

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


Verification and conformance test generation of communication protocol for railway signaling systems Verification and testing are complementary techniques that are used to increase the level of confidence in the correct functioning of communication systems as prescribed by their specifications. This paper presents an experience of model checking for Korean railway signaling protocol specified in LTS (Labeled Transition System). This formal approach checks deadlock, livelock and reachability for the state and action to verify whether properties expressed in modal logic are true on specifications. We also propose a formal method for semi-automated test case generation for Korean railway signaling protocol described in I/O FSM (Input/Output Finite State Machine). This enables the generation of more complete and consistent test sequence for conformance testing. The above functions are implemented by C++ language and included within RSPVTE (Railway Signaling Protocol Verification and Testing Environment) in the MS-windows environment.

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

i/o fsm (input/output finite state machine)


a collaborative ontology development tool for information security managers This paper explores the need for a collaborative development tool to allow information security experts to capture their interrelated knowledge in an ontology. Such a tool would enable organisations to make more informed security policy decisions around shared security issues. However, population of ontologies can be time-consuming and error-prone, and current collaborative ontology editing tools require a familiarity with ontology concepts. We present a Web-oriented tool which simplifies ontology population for information security experts, allowing them to develop ontology content without the need to understand ontology concepts. To understand how organisations manage information security knowledge within policies, we consulted two information security managers in large organisations. The Web-Protg collaborative ontology editor was then modified to create a tool with an appropriate knowledge ontology structure that meets their requirements. The same information security managers then evaluated the tool, judging it to be accessible and potentially useful in policy decision-making.

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


Geometric Flow Approach for Region-Based Image Segmentation Geometric flows have been successfully used for surface modeling and designing, largely because they are inherently good at controlling geometric shape evolution. Variational image segmentation approaches, on the other hand, detect objects of interest by deforming certain given shapes. This motivates us to revisit the minimal partition problem for segmentation of images, and propose a new geometric flow-based formulation and solution to it. Our model intends to derive a mapping that will evolve given contours or piecewise-constant regions toward objects in the image. The mapping is approximated by B-spline basis functions, and the positions of the control points are to be determined. Starting with the energy functional based on intensity averaging, we derive a Euler-Lagrange equation and then a geometric evolution equation. The linearized system of equations is efficiently solved via a special matrix-vector multiplication technique. Furthermore, we extend the piecewise-constant model to a piecewise-smooth model which effectively handles images with intensity inhomogeneity.

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

minimization
partial differential equations (pde)
variational method


Simulation of material behaviour under dynamic loading Experiments and FE-simulations are carried out in order to characterise the mechanical behaviour of metals at high strain rates between 10(3) s(-1) and 10(4) s(-1). The non-uniformity of strain distribution is studied for the cases of tensile impact and forging. The behaviour of fibre-reinforced metals is investigated under impact compressive loading regarding the buckling of the slim fibres within the softer matrix. Failure criteria are deduced considering the interaction between mechanical waves and internal inclusions or external notches. (C) 1999 Elsevier Science Ltd. All rights reserved.

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

buckling of fibre composites
ductile fracture
failure criterion


On the role of the basis of measurement in quantum gate teleportation Quantum teleportation is a powerful protocol with applications in several schemes of quantum communication, quantum cryptography and quantum computing. The present work shows the required conditions for a two-qubit quantum gate to be deterministically and probabilistically teleported by a quantum gate teleportation scheme using different bases of measurement. Additionally, we present examples of teleportation of two-qubit gates that do not belong to Clifford group as well the limitations of the quantum gate teleportation scheme employing a four-qubit state with genuine four-way entanglement. At last, we provide a general decomposition of Clifford operations.

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


Link prediction and classification in social networks and its application in healthcare and systems biology Prediction is one of the most attractive aspects in data mining. Link prediction has recently attracted the attention of many researchers as an effective technique to be used in graph based models in general and in particular for social network analysis due to the recent popularity of the field. Link prediction helps to understand associations between nodes in social communities. Existing link prediction-related approaches described in the literature are limited to predict links that are anticipated to exist in the future. To the best of our knowledge, none of the previous works in this area has explored the prediction of links that could disappear in the future. We argue that the latter set of links are important to know about; they are at least equally important as and do complement the positive link prediction process in order to plan better for the future. In this paper, we propose a link prediction model which is capable of predicting both links that might exist and links that may disappear in the future. The model has been successfully applied in two different though very related domains, namely health care and gene expression networks. The former application concentrates on physicians and their interactions while the second application covers genes and their interactions. We have tested our model using different classifiers and the reported results are encouraging. Finally, we compare our approach with the internal links approach and we reached the conclusion that our approach performs very well in both bipartite and non-bipartite graphs.

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


INDIRECT ADAPTIVE CONTROL OF NONLINEAR SYSTEMS BASED ON BILINEAR NEURO-FUZZY APPROXIMATION In this paper, we investigate the indirect adaptive regulation problem of unknown affine in the control nonlinear systems. The proposed approach consists of choosing an appropriate system approximation model and a proper control law, which will regulate the system under the certainty equivalence principle. The main difference from other relevant works of the literature lies in the proposal of a potent approximation model that is bilinear with respect to the tunable parameters. To deploy the bilinear model, the components of the nonlinear plant are initially approximated by Fuzzy subsystems. Then, using appropriately defined fuzzy rule indicator functions, the initial dynamical fuzzy system is translated to a dynamical neuro-fuzzy model, where the indicator functions are replaced by High Order Neural Networks (HONNS), trained by sampled system data. The fuzzy output partitions of the initial fuzzy components are also estimated based on sampled data. This way, the parameters to be estimated are the weights of the HONNs and the centers of the output partitions, both arranged in matrices of appropriate dimensions and leading to a matrix to matrix bilinear parametric model. Based on the bilinear parametric model and the design of appropriate control law we use a Lyapunov stability analysis to obtain parameter adaptation laws and to regulate the states of the system. The weight updating laws guarantee that both the identification error and the system states reach zero exponentially fast, while keeping all signals in the closed loop bounded. Moreover, introducing a method of "concurrent" parameter hopping, the updating laws are modified so that the existence of the control signal is always assured. The main characteristic of the proposed approach is that the a priori experts information required by the identification scheme is extremely low, limited to the knowledge of the signs of the centers of the fuzzy output partitions. Therefore, the proposed scheme is not vulnerable to initial design assumptions. Simulations on selected examples of well-known benchmarks illustrate the potency of the method.

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

indirect adaptive control
concurrent parameter hopping

neuro-fuzzy modelling
bilinear parametric modeling


More applicable environmental scanning systems leveraging modern information systems With Ansoffs article about weak signals as a flagship example, a substantial body of knowledge about environmental scanning systems exists. However, these concepts often go unused in practice. The 2008/2009 economic crisis provided a strong, ongoing impulse for redesigning such information systems (IS). This article develops six guidelines for the conceptual design of environmental scanning systems that are more applicable than those specified by previous research. We start with literature research, which reveals three gaps in existing approaches. Then we develop design guidelines to fill these gaps with the help of modern IS. To address the lack of sound requirements analysis, our first design principle proposes 360-degree environmental scanning systems for executives and suggests how to select the most important scanning areas. Three further findings cover weaknesses in the IS model perspective, focusing on more effective implications of weak signals. In terms of method, we propose incorporating scanning results more closely into executives decision-making processes. Applying the design guidelines at a raw materials and engineering company, we arrive at a prototype we call the corporate radar. It includes an IS-based tree with economic value added at risk on top. The resulting lessons learned help to evaluate our findings and the research method presented here, as well provide concrete starting points for future research.

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

balanced threat and opportunity management


Intervertebral disc segmentation in MR images using anisotropic oriented flux This study proposes an unsupervised intervertebral disc segmentation system based on middle sagittal spine MR scans. The proposed system employs the novel anisotropic oriented flux detection scheme which helps distinguish the discs from the neighboring structures with similar intensity, recognize ambiguous disc boundaries, and handle the shape and intensity variation of the discs. Based on minimal user interaction, the proposed system begins with vertebral body tracking to infer the information regarding the positions and orientations of the target intervertebral discs. The information is employed in a set of image descriptors, which jointly constitute an energy functional describing the desired disc segmentation result. The energy functional is minimized by a level set based active contour model to perform disc segmentation. The proposed segmentation system is evaluated using a database consisting of 455 intervertebral discs extracted from 69 middle sagittal slices. It is demonstrated that the proposed method is capable of delivering accurate results for intervertebral disc segmentation.

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

spine
intervertebral disc
segmentation
anisotropic oriented flux


Experiments in discourse analysis impact on information classification and retrieval algorithms Researchers in indexing and retrieval systems have been advocating the inclusion of more contextual information to improve results. The proliferation of full-text databases and advances in computer storage capacity have made it possible to carry out text analysis by means of linguistic and extra-linguistic knowledge. Since the mid 80s, research has tended to pay more attention to context, giving discourse analysis a more central role. The research presented in this paper aims to check whether discourse variables have an impact on modern information retrieval and classification algorithms. In order to evaluate this hypothesis, a functional framework for information analysis in an automated environment has been proposed, where the n-grams (filtering) and the k-means and Chens classification algorithms have been tested against sub-collections of documents based on the following discourse variables: Genre, Register, Domain terminology, and Document structure. The results obtained with the algorithms for the different sub-collections were compared to the MeSH information structure. These demonstrate that n-grams does not appear to have a clear dependence on discourse variables, though the k-means classification algorithm does, but only on domain terminology and document structure, and finally Chens algorithm has a clear dependence on all of the discourse variables. This information could be used to design better classification algorithms, where discourse variables should be taken into account. Other minor conclusions drawn from these results are also presented.

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

discourse-model context-analysis computational-linguistics text-analysis-methods n-grams k-means co-wording


Rendezvous Planning in Wireless Sensor Networks with Mobile Elements Recent research shows that significant energy saving can be achieved in wireless sensor networks by using mobile elements (MEs) capable of carrying data mechanically. However, the low movement speed of MEs hinders their use in data-intensive sensing applications with temporal constraints. To address this issue, we propose a rendezvous-based approach in which a subset of nodes serves as the rendezvous points (RPs) that buffer data originated from sources and transfer to MEs when they arrive. RPs enable MEs to collect a large volume of data at a time without traveling long distances, which can achieve a desirable balance between network energy saving and data collection delay. We develop two rendezvous planning algorithms: RP-CP and RP-UG, RP-CP finds the optimal RPs when MEs move along the data routing tree, while RP-UG greedily chooses the RPs with maximum energy saving to travel distance ratios. We design the Rendezvous-based Data Collection protocol that facilitates reliable data transfers from RPs to MEs in presence of significant unexpected delays in ME movement and network communication. Our approach is validated through extensive simulations.

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

sensor networks
mobile elements
data collection


Human cognition as an intelligent decision support system for plastic products design Engineering work is a complex task mainly supported by computer aids. This paper highlights its deficiencies when the designer cannot obtain any expert recommendations or guidelines from the computers program regarding a decision-making process such as material selection. Particular products development design process, within a well-known enterprise from the white goods industry is presented and supported by a case study. The advantages and disadvantages are set out, and any potential benefits gained from using an intelligent decision support system for plastic products design are introduced. The proposed decision support system contains human cognition within the field of design knowledge and special domain knowledge expertise regarding plastics supported by design methodology called Design for Manufacturing (DFM).

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

design for manufacturing
plastic
material selection
decision support system


Nanocrystalline electrochromic displays Nanocrystalline electrochromic electrodes offer a promising outlook for the realization of displays characterized by sharp contrast and fast switching. These electrodes are constituted of sintered nanoparticles of a semiconductor, for instance titanium dioxide. Owing to the high porosity of the material, the signal produced by the color change associated to the oxidation or reduction of an adsorbed molecular monolayer can be amplified by a factor of 1001000, allowing transmittance changes from 79 to 11% of the complete electrode in less than 1s.

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

electrochromism
viologen
prussian blue
zinc


Distributions of citations of papers of individual authors publishing in different scientific disciplines: Application of Langmuir-type function Citation distributions of papers of authors working in different fields are studied. Langmuir-type (LT) function describes citation distributions satisfactorily. Parameters K, Nc and ? of LT function are mutually related. Quantity KNc=(KNc)0/(??1) where proportionality constant (KNc)0<1. Value of constant (KNc)0 is related to the nature of sources of items (citations).

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

citation analysis
citation distribution
langmuir-type function


Simultaneous two-view epipolar geometry estimation and motion segmentation by 4D tensor voting We address the problem of simultaneous two-view epipolar geometry estimation and motion segmentation from nonstatic scenes. Given a set of noisy image pairs containing matches of n objects, we propose an unconventional, efficient, and robust method, 4D tensor voting, for estimating the unknown n epipolar geometries, and segmenting the static and motion matching pairs into n independent motions. By considering the 4D isotropic and orthogonal joint image space, only two tensor voting passes are needed, and a very high noise to signal ratio (up to five) can be tolerated. Epipolar geometries corresponding to multiple, rigid motions are extracted in succession. Only two uncalibrated frames are needed, and no simplifying assumption (such as affine camera model or homographic model between images) other than the pin-hole camera model is made. Our novel approach consists of propagating a local geometric smoothness constraint in the 4D joint image space, followed by global consistency enforcement for extracting the fundamental matrices corresponding to independent motions. We have performed extensive experiments to compare our method with some representative algorithms to show that better performance on nonstatic scenes are achieved. Results on challenging data sets are presented.

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

nonstatic scene
robust estimation
higher dimensional inference


The super connectivity of augmented cubes The augmented cube AQ(n), proposed by Choudum and Sunitha [S.A. Choudum, V. Sunitha, Augmented cubes, Networks 40 (2) (2002) 71-84], is a (2n - 1)-regular (2n - 1)-connected graph (n not equal 3). This paper determines that the super connectivity of AQ(n) is 4n - 8 for n >= 6 and the super edge-connectivity is 4n - 4 for n >= 5. That is, for n >= 6 (respectively, n >= 5), at least 4n - 8 vertices (respectively, 4n - 4 edges) of AQ(n) are removed to get a disconnected graph that contains no isolated vertices. When the augmented cube is used to model the topological structure of a large-scale parallel processing system, these results can provide more accurate measurements for reliability and fault tolerance of the system. (C) 2007 Elsevier B.V. All rights reserved.

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

interconnection networks
super edge-connectivity


DETECTING EMERGENT BEHAVIOR IN DISTRIBUTED SYSTEMS USING SCENARIO-BASED SPECIFICATIONS Emergent behavior is an important issue in distributed systems' design. Detecting and removing emergent behavior during the design phase will lead to huge savings in deployment costs of such systems. An effective approach for the design of distributed systems is to describe system requirements using scenarios. A scenario, commonly known as a message sequence chart or a sequence diagram, is a temporal sequence of messages sent between system components. However, scenario-based specifications are prone to subtle deficiencies with respect to analysis and validation known as incompleteness and partial description. In this research, a method for detecting emergent behavior of scenario-based specification is proposed. The method is demonstrated and verified using a mine-sweeping robot as an example. Furthermore it has been demonstrated in this paper that scenario-based specifications can be used in agile software development and that the proposed methodologies in this research can be utilized effectively in agile approaches.

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


Model relaxations for the fuel cost minimization of steady-state gas pipeline networks Natural gas, driven by pressure, is transported through pipeline network systems. As the gas flows through the network, energy and pressure are lost due to both friction between the gas arid the pipes' inner wail, and heat transfer between the gas and its environment. The lost energy of the gas is periodically restored at the compressor stations which are installed in the network. These compressor stations typically consume about 3-5% of the transported gas. This transportation cost is significant because the amount of gas being transported worldwide is huge. These facts make the problem of how to optimally operate the compressors driving the gas in a pipeline network important. In this paper, we address the problem of minimizing the fuel cost incurred by the compressor stations driving the gas in a transmission network under steady-state assumptions. In particular, the decision variables include pressure drops at each node of the network, mass flow rate at each pipeline leg, and the number of units operating within each compressor station. We present a mathematical model of this problem and an in-depth study of the underlying mathematical structure of the compressor stations. Then, based on this study, we propose two model relaxations tone in the compressor domain and another in the fuel cost function and derive a lower bounding scheme. We also present empirical evidence that shows the effectiveness of the lower bounding scheme. For the small problems, where we were able to find optimal solutions, the proposed lower bound yields a relative optimality gap of around 15-20%. For a larger, more complex instance, it was not possible to find optimal solutions but we were able to compute lower and upper bounds, finding a large relative gap between the two. We show this wide gap is mainly due to the presence of nonconvexity in the set of feasible solutions, since the proposed relaxations do a very good job of approximating the problem within each individual compressor station. We emphasize that this is. to the best of our. knowledge, the first time such a procedure (lower bound) has been proposed in over 30 years of research in the natural gas pipeline area. (C) 2000 Elsevier Science Ltd. All rights Reserved.

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

pipelines
transmission networks
steady state
lower bounds
nonconvex objective


Solution of differential equations via rationalized Haar functions Rationalized Haar functions are developed to approximate the solution of the differential equations. Properties of rationalized Haar functions are first presented, the operational matrix of integration together with product operational matrix are utilized to reduce the computation of differential equations into algebraic equations. The method is computationally attractive, and applications are demonstrated through illustrative examples. (C) 2001 IMACS. Published by Elsevier Science B.V. All rights reserved.

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

rationalized haar functions
differential equations


Investigating some special sequence lengths generated in an external exclusive-NOR type LFSR The study of the length of Pseudo-Random Binary Sequences (PRBS) generated by Linear Feedback Shift Registers (LFSRs) play an important role in design approaches of Built-In Self Test (BIST), cryptosystems, and other applications. It is not taken to be granted that primitive characteristic polynomials always generate maximal length PRBSs. This paper investigates many such conditions where LFSR structures restrict the PRBS generation to a certain fixed length. This study will surely help the designers of the BIST equipments and cryptosystems. The outcome of this paper is presented in the forms of theorems, simulations, and analyses which strongly supports the findings.

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

seed
feedback taps
periodicity
exclusive-nor


FAULT DIAGNOSIS AND FAULT TOLERANT CONTROL USING SET-MEMBERSHIP APPROACHES: APPLICATION TO REAL CASE STUDIES This paper reviews the use of set-membership methods in fault diagnosis (FD) and fault tolerant control (FTC). Set-membership methods use a deterministic unknown-but-bounded description of noise and parametric uncertainty (interval models). These methods aims at checking the consistency between observed and predicted behaviour by using simple sets to approximate the exact set of possible behaviour (in the parameter or the state space). When an inconsistency is detected between the measured and predicted behaviours obtained using a faultless system model, a fault can be indicated. Otherwise, nothing can be stated. The same principle can be used to identify interval models for fault detection and to develop methods for fault tolerance evaluation. Finally, some real applications will be used to illustrate the usefulness and performance of set-membership methods for FD and FTC.

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

fault-tolerant control
robustness
set-membership


Maximum nonlinearity of symmetric Boolean functions on odd number of variables In this correspondence, we establish that for odd n, the maximum nonlinearity achievable by an n-variable symmetric Boolean function is 2(n-1) - 2(n-1/2) and characterize the set of functions which achieve this value of nonlinearity. In particular, we show that for each odd n greater than or equal to 3, there are exactly four possible symmetric Boolean functions achieving the nonlinearity 2(n-1) - 2(n-1/2).

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


Simulation based neuro-fuzzy hybrid intelligent PI control approach in four-area load frequency control of interconnected power system A novel control approach of hybrid neuro-fuzzy for load frequency control of four area power system is presented. This controller can handle the non-linearities at the same time it is faster than other existing controllers. The effectiveness of proposed controller is to damps out local and inter area modes of oscillation. Performance evaluation is carried out by using fuzzy, ANN, ANFIS and conventional PI and PID control approaches. The intelligent HNF controller is having improved dynamic response and faster than other controllers.

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

load frequency control (lfc)
ann and fuzzy
area control error (ace)
matlab/simulink


Energy-efficient routing for correlated data in wireless sensor networks In this paper, we investigate the reduction in the total energy consumption of wireless sensor networks using multi-hop data aggregation by constructing energy-efficient data aggregation trees. We propose an adaptive and distributed routing algorithm for correlated data gathering and exploit the data correlation between nodes using a game theoretic framework. Routes are chosen to minimize the total energy expended by the network using best response dynamics to local data. The cost function that is used for the proposed routing algorithm takes into account energy, interference and in-network data aggregation. The iterative algorithm is shown to converge in a finite number of steps. Simulations results show that multi-hop data aggregation can significantly reduce the total energy consumption in the network.

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

data aggregation
wireless sensor networks

energy-efficiency
routing trees
nash equilibrium


Rank-Constrained Fundamental Matrix Estimation by Polynomial Global Optimization Versus the Eight-Point Algorithm The fundamental matrix can be estimated from point matches. The current gold standard is to bootstrap the eight-point algorithm and two-view projective bundle adjustment. The eight-point algorithm first computes a simple linear least squares solution by minimizing an algebraic cost and then projects the result to the closest rank-deficient matrix. We propose a single-step method that solves both steps of the eight-point algorithm. Using recent results from polynomial global optimization, our method finds the rank-deficient matrix that exactly minimizes the algebraic cost. In this special case, the optimization method is reduced to the resolution of very short sequences of convex linear problems which are computationally efficient and numerically stable. The current gold standard is known to be extremely effective but is nonetheless outperformed by our rank-constrained method for bootstrapping bundle adjustment. This is here demonstrated on simulated and standard real datasets. With our initialization, bundle adjustment consistently finds a better local minimum (achieves a lower reprojection error) and takes less iterations to converge.

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


Reduced basis approximation and a posteriori error estimates for a multiscale liquid crystal model We present a reduced basis framework and associated a posteriori error estimates for the multiscale Stokes Fokker-Planck system that governs the flow of a dilute suspension of rod-like molecules immersed in a Newtonian solvent, relevant in liquid crystals modelling. The Fokker-Planck equation dictates the microscale behaviour and must be solved at every quadrature point of the macroscale finite element mesh - this is a natural example of a many-query problem for which the certified reduced basis method is well suited. We focus on a Poiseuille flow problem to simplify the presentation of ideas, but we note that the methods developed in this article generalize directly to more complicated problems. Numerical results demonstrate that our reduced basis approach leads to significant computational savings and also that our error estimator performs well for moderate parameter values.

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

multiscale modelling
fokker-planck equation
a posteriori error bounds


trace-based evaluation of job runtime and queue wait time predictions in grids Large-scale distributed computing systems such as grids are serving a growing number of scientists. These environments bring about not only the advantages of an economy of scale, but also the challenges of resource and workload heterogeneity. A consequence of these two forms of heterogeneity is that job runtimes and queue wait times are highly variable, which generally reduces system performance and makes grids difficult to use by the common scientist. Predicting job runtimes and queue wait times have been widely studied for parallel environments. However, there is no detailed investigation on how the proposed prediction methods perform in grids, whose resource structure and workload characteristics are very different from those in parallel systems. In this paper, we assess the performance and benefit of predicting job runtimes and queue wait times in grids based on traces gathered from various research and production grid environments. First, we evaluate the performance of simple yet widely used time series prediction methods and the effect of applying them to different types of job classes (e.g., all jobs submitted by single users or to single sites). Then, we investigate the performance of two kinds of queue wait time prediction methods for grids. Last, we investigate whether prediction-based grid-level scheduling policies can have better performance than policies that do not use predictions.

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

time series prediction methods
predictions

trace-based simulation
grid scheduling
performance evaluation


response prediction using collaborative filtering with hierarchies and side-information In online advertising, response prediction is the problem of estimating the probability that an advertisement is clicked when displayed on a content publisher's webpage. In this paper, we show how response prediction can be viewed as a problem of matrix completion, and propose to solve it using matrix factorization techniques from collaborative filtering (CF). We point out the two crucial differences between standard CF problems and response prediction, namely the requirement of predicting probabilities rather than scores, and the issue of confidence in matrix entries. We address these issues using a matrix factorization analogue of logistic regression, and by applying a principled confidence-weighting scheme to its objective. We show how this factorization can be seamlessly combined with explicit features or side-information for pages and ads, which let us combine the benefits of both approaches. Finally, we combat the extreme sparsity of response prediction data by incorporating hierarchical information about the pages and ads into our factorization model. Experiments on three very large real-world datasets show that our model outperforms current state-of-the-art methods for response prediction.

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

hierarchies
collaborative filtering
response prediction


completing high-quality global routes To ensure chip manufacturability, all routes must be completed without violations. Furthermore, the chip's power consumption and performance are determined by the length of its routed wires. Therefore, our work focuses on minimizing wirelength. Our key innovations include: (1) a novel branch-free representation (BFR) for routed nets, (2) a trigonometric penalty function (TPF), (3) dynamic adjustment of Lagrange multipliers (DALM), (4) cyclic net locking (CNL), and (5) aggressive lower-bound estimates (ALBE) for A*-search, resulting in faster routing. We complete all routable ISPD 2008 contest benchmarks and re-placed adaptec suite without violation and produce shorter routes.

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


Optimization of electrical discharge machining parameters on hardened die steel using Firefly Algorithm Electric discharge machining (EDM) is one of the most widely used die-making processes especially in aerospace, automobile and electronics industries. The profile manufactured by EDM process should be dimensionally and geometrically accurate apart from good finish. This expectation is very much important as the die manufactured from EDM process is subjected to subsequent mass production. The material normally selected for die making will be superior in quality and hence time and cost of production will also be high. Selection of optimum EDM parameters may reduce the machining time along with maintaining required surface finish and dimensional accuracy. So there is a need to develop a technique for selecting the optimal EDM parameters to achieve the desired performance measures. In the present work, a recently developed Firefly Algorithm (FA) was implemented in the developed mathematical model based on the experiments conducted on an EDM. Investigations are also carried out to study the effect of EDM parameters such as current and pulse-on time on the surface roughness and machining time. The optimized machining parameters and the developed empirical relations are validated by confirmatory experiments. Machining parameters limits and desired surface finish are considered as practical constraints for both experimental and theoretical approaches. The predicted and actual machining time and surface roughness values reveals that FA is very much suitable for solving machining parameters optimization problems.

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

electric discharge machining
machining parameters
machining time
surface roughness
firefly algorithm


A new fusion scheme for multifocus images based on focused pixels detection In this paper, a new multifocus image fusion scheme based on the technique of focused pixels detection is proposed. First, a new improved multiscale Top-Hat (MTH) transform, which is more effective than the traditional Top-Hat transform in extracting focus information, is introduced and utilized to detect the pixels of the focused regions. Second, the initial decision map of the source images is generated by comparing the improved MTH value of each pixel. Then, the isolated regions removal method is developed and employed to refine the initial decision map. In order to improve the quality of the fused image and avoid the discontinuity in the transition zone, a dual sliding window technique and a fusion strategy based on multiscale transform are developed to achieve the transition zones fusion. Finally, the decision maps of the focused regions and the transition zones are both used to guide the fusion process, and then the final fused image is formed. The experimental results show that the proposed method outperforms the conventional multifocus image fusion methods in both subjective and objective qualities.

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


Finite mixtures of unimodal beta and gamma densities and the \(k\)-bumps algorithm This paper addresses the problem of estimating a density, with either a compact support or a support bounded at only one end, exploiting a general and natural form of a finite mixture of distributions. Due to the importance of the concept of multimodality in the mixture framework, unimodal beta and gamma densities are used as mixture components, leading to a flexible modeling approach. Accordingly, a mode-based parameterization of the components is provided. A partitional clustering method, named \(k\)-bumps, is also proposed; it is used as an ad hoc initialization strategy in the EM algorithm to obtain the maximum likelihood estimation of the mixture parameters. The performance of the \(k\)-bumps algorithm as an initialization tool, in comparison to other common initialization strategies, is evaluated through some simulation experiments. Finally, two real applications are presented.

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

finite mixtures of densities
pearson system
bump hunting
partitional clustering methods


Godel pro and contra AI: dismissal of the case Godel's incompleteness theorem is used by both advocates and adversaries of strong AI to show that computers can(not) perform the same feats as humans. This article extends the construction through which Godel proved his theorem, in order to allow a broader interpretation, showing that neither side has exploited its arguments to the fullest extent, and that the evidence can never be conclusive. (C) 1999 Elsevier Science Ltd. All rights reserved.

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

godel's theorem
proof constructions
paradox of ai
turing machine
metamathematics


An adaptive discretization of shallow-water equations based on discontinuous Galerkin methods In this paper, we present a discontinuous Galerkin formulation of the shallow-water equations. An orthogonal basis is used for the spatial discretization and an explicit Runge-Kutta scheme is used for time discretization. Some results of second-order anisotropic adaptive calculations are presented for dam breaking problems. The adaptive procedure uses an error indicator that concentrates the computational effort near discontinuities like hydraulic jumps. Copyright (c) 2006 John Wiley & Sons, Ltd.

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

shallow-water equations
anisotropic meshes
discontinuous galerkin method


A Monte Carlo NewtonRaphson procedure for maximizing complex likelihoods on pedigree data The Monte Carlo NewtonRaphson (MCNR) method is an iterative procedure that can be used to approximate the maximum of a likelihood function in situations where direct likelihood computation is infeasible because of the existence of unmeasured variables, missing data, or measurement error. We describe the method in the context of pedigree analysis, where genotypes are unmeasured. Parameter values are set to an initial estimate of the MLE and are repeatedly updated using the following three steps: (1) A Monte Carlo Markov chain procedure such as the Gibbs sampler is used to generate multiple samples of genotypes at the current parameter values, (2) the genotype samples are used to estimate the score (gradient) and observed information matrix (Hessian), and (3) the estimated gradient and Hessian are used in a standard NewtonRaphson step to obtain updated parameter values. The resulting sequence of parameter values converges to a neighborhood of the MLE, then varies randomly around it. The parameter values that are generated after convergence are averaged to provide an approximation to the MLE, and an additional set of genotype samples can then be obtained and used to approximate standard errors of the estimates. We present simulation studies indicating that MCNR provides close approximations to the MLE in several standard genetic models. We also apply the method to an analysis of high-density lipids (HDL) in the Berkeley data set (Austin et al., 1988. Amer. J. Hum. Genet. 43, 838846), showing evidence that the expression of HDL depends on a dominant major gene and an interaction between this gene and body mass index.

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

gibbs sampling
genetic analysis
parameter estimation


Signaling Pathways in Adrenocortical Cancer Adrenocortical carcinoma is a rare tumor that carries a very poor prognosis. Despite efforts to develop new therapeutic regimens to treat this disease, surgery remains the mainstay of treatment. Laboratory studies of adrenocortical cancers have revealed a wide variety of signaling pathways that can be altered in these neoplasms. Although ACTH signaling through adenylyl cyclase and protein kinase A is important for normal adrenal cellular physiology, there is evidence to suggest that this pathway may inhibit the growth of adrenocortical tumors, and that inactivation of the ACTH receptor may promote tumor formation. Although multiple signal transduction pathways are essential for normal adrenal growth and hormone secretion, efforts to identify events required for neoplastic transformation have met with limited success. Alterations that have frequently been observed in adrenocortical carcinoma include up-regulation of the IGF-II system, as well as mutations in TP53 and RAS. Current studies aim to elucidate the mechanisms of tumor growth by studying proproliferative signaling pathways, such as those involving Akt/PKB and the mitogen-activated protein kinases (MAPKs). Although studies of single pathways have been helpful in guiding investigations, new tools to study the integration and multiplicity of signaling pathways hold the hope of improved understanding of the signaling pathway alterations in adrenocortical cancer.

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

adrenocortical carcinoma
signal transduction
acth receptor
ras

adrenal cancer
growth factors
g proteins
protein kinase a (pka)
mitogen-activated protein kinase (mapk)
p53
insulin-like growth factor
egf


Generalized structured additive regression based on Bayesian P-splines Generalized additive models (GAM) for modeling nonlinear effects of continuous covariates are now well established tools for the applied statistician. A Bayesian version of GAM's and extensions to generalized structured additive regression (STAR) are developed. One or two dimensional P-splines are used as the main building block. Inference relies on Markov chain Monte Carlo (MCMC) simulation techniques, and is either based on iteratively weighted least squares (IWLS) proposals or on latent utility representations of (multi)categorical regression models. The approach covers the most common univariate response distributions, e.g., the binomial, Poisson or gamma distribution, as well as multicategorical responses. For the first time, Bayesian semiparametric inference for the widely used multinormal logit model is presented. Two applications on the forest health status of trees and a space-time analysis of health insurance data demonstrate the potential of the approach for realistic modeling of complex problems. Software for the methodology is provided within the public domain package BayesX. (c) 2004 Elsevier B.V. All rights reserved.

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

geoadditive models
multicategorical response
structured additive predictors
surface smoothing


A BUILT-IN SELF-TEST CIRCUITRY BASED ON RECONFIGURATION FOR ANALOG AND MIXED-SIGNAL IC Application of built-in self-test circuitries allows to improve the testing quality and reliability of complex analog and mixed-signal IC. BIST-circuitry is integrated to original circuit for the purpose of test signal generation, measurement of output responses and decision-making about correctness of circuit under test functioning. The most part of BIST-circuitries for analog and mixed-signal IC uses generators of sine wave or multifrequency wave for test signal generation, but it is not applicable for majority of practical implementations because of crucial increasing the chip area required for in-circuit realization of generator. The built-in self test circuitry for analog and mixed-signal IC based on reconfiguring original circuit in oscillator, which does not need the generator of input test signals, has been proposed. The principles of functioning and main components of the solution have been considered. The correct and incorrect behaviour of analog subcircuit is reflected in digital way by logical 0 or 1. The proposed circuitry provides possibility for joint testing analog and digital subcircuits of mixed-signal IC. The experimental results for benchmark second-order active filter demonstrating high efficiency of proposed BIST-circuitry have been represented. The fault coverage obtained by application of proposed BIST-circuitry is not inferior to results of other authors for the same filter, but measuring and estimation of output responses are performed in-circuit.

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

analog and mixed-signal integrated circuits


An adjoint network approach for RLCG interconnect model order reductions This work proposes a new method for RLCG interconnect model-order reductions in consideration with the adjoint network. Relationships between an original MNA network and its corresponding adjoint MNA network will be explored first. It will be shown that the congruence transformation matrix used in the one-sided projection can be constructed by using the bi-orthogonal bases developed from the Lanezos-type algorithms. In particular, if the multi-port driving-point impedance of RLCG interconnect circuits is the main concern, the transfer functions and system moments of the adjoint network can be directly calculated from those of the original RLCG interconnect network by exploring symmetric properties of the MNA formulation. Therefore, the cost of constructing the congruence transformation matrix can be simplified by up to 50% of the previous methods. Comparative studies among various standard methods and the proposed methods are also investigated. Experimental results on large-scale RLCG interconnect circuits will demonstrate the accuracy and the efficiency of the proposed method.

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

rlcg interconnects
model-order reduction
arnoldi algorithm
lanczos algorithm


An FPTAS for uniform machine scheduling to minimize makespan with linear deterioration This paper consider m uniform (parallel) machine scheduling with linear deterioration to minimize the makespan. In an uniform machine environment, all machines have different processing speeds. Linear deterioration means that job's actual processing time is a linear increasing function on its execution starting time. We propose a fully polynomial-time approximation scheme (FPTAS) to show the problem is NP-hard in the ordinary sense.

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

scheduling
uniform machine
linear deterioration
makespan
fptas


learning optimal ranking with tensor factorization for tag recommendation Tag recommendation is the task of predicting a personalized list of tags for a user given an item. This is important for many websites with tagging capabilities like last.fm or delicious. In this paper, we propose a method for tag recommendation based on tensor factorization (TF). In contrast to other TF methods like higher order singular value decomposition (HOSVD), our method RTF ('ranking with tensor factorization') directly optimizes the factorization model for the best personalized ranking. RTF handles missing values and learns from pairwise ranking constraints. Our optimization criterion for TF is motivated by a detailed analysis of the problem and of interpretation schemes for the observed data in tagging systems. In all, RTF directly optimizes for the actual problem using a correct interpretation of the data. We provide a gradient descent algorithm to solve our optimization problem. We also provide an improved learning and prediction method with runtime complexity analysis for RTF. The prediction runtime of RTF is independent of the number of observations and only depends on the factorization dimensions. Besides the theoretical analysis, we empirically show that our method outperforms other state-of-the-art tag recommendation methods like FolkRank, PageRank and HOSVD both in quality and prediction runtime.

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

tensor factorization
ranking
tag recommendation


Jointly rate and power control in contention based MultiHop Wireless Networks This paper presents a new algorithm for jointly optimal control of session rate, link attempt rate, and link power in contention based MultiHop Wireless Networks. Formulating the problem in the framework of nonlinear optimization, we derive the required updates at end points and links to reach the optimal operating point. The proposed algorithm is a cross layer algorithm considering power control at the physical layer, attempt rate control at the Medium Access Control (MAC) layer and rate control at the transport layer of the network. The optimization variables are coordinated through two shadow prices. The first one regulates each session rate to the throughput of the links in its path, and the second one controls the attempt rates to meet maximal clique capacity constraint. Considering a model for successful transmission, the excitatory and inhibitory factors affecting each variable are derived. The proposed algorithm can be implemented in distributed fashion by message passing in the network. Simulation results at the link level verify the analytical approach and show that the algorithm converge and reach joint optimal point. (C) 2007 Elsevier B.V. All rights reserved.

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