branch-and-bound algorithms on a hypercube The parallel implementation of branch-and-bound algorithms on multiprocessors has received an increasing amount of attention in recent years. This paper describes research currently being conducted at Clemson University. We study the job scheduling problem: given n jobs, each with processing time, p i , and due date, d i , schedule these jobs on a single machine such that total tardiness is minimized. Total tardiness, T, is defined as: T = n ? i=1 w i * max { 0, C i - d i } where C i is the completion time and w i is the weight of job i. The hypercube used is a Floating Point Systems T-20: sixteen INMOS Transputers, synchronous communication, programmed in OCCAM. We describe an implementation focusing specifically on efficient communication and load balancing algorithms.

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

communication
attention
scheduling
research
systems
parallel
implementation
load balancing
floating point
hypercube
paper

efficiency
synchronization
branch-and-bound
job scheduling
process
timing
algorithm
completeness


Biosafety and Selectable Markers Francisella tularensis (F. tularensis) is one of the most infectious pathogens known. Although the disease caused by this bacterium is rarely fatal with appropriate antibiotic therapy, it is often severely debilitating. Laboratory work with F. tularensis poses a significant hazard, and it is essential that appropriate laboratory facilities, trained personnel, and suitable working practices are in place in any organization working with this pathogen. Work with human virulent strains should be carried out at containment level 3. Vaccines play an important potential role in the protection of individuals working with F. tularensis, but the live vaccine strain (LVS) vaccine is not currently licensed for use in humans. Because antibiotic therapy is central to the treatment of human tularemia, antibiotic resistance markers for use in genetic manipulation studies should be carefully selected

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

francisella tularensis
containment
laboratory
biosafety
genetic manipulation
vaccine


Dynamic surface error constrained adaptive fuzzy output-feedback control of uncertain nonlinear systems with unmodeled dynamics ? In this paper, an adaptive fuzzy output-feedback dynamic surface control (DSC) design with prescribed performance is investigated for a class of uncertain nonlinear systems in strict-feedback form. The considered nonlinear systems contain unknown nonlinear functions, unmodeled dynamics and immeasurable states. The fuzzy logic systems are used to model the unknown nonlinear system, and a fuzzy state observer is designed to estimate the immeasurable states. By transforming the errors into new virtual error variables, and based on DSC backstepping design technique and changing supply function, a new robust adaptive fuzzy output feedback control scheme is developed. It is proved that the proposed control approach can guarantee that all the signals of the resulting closedloop system are bounded, and the dynamic surface errors are confined within the prescribed bounds for all times. Two simulation examples are provided to show the effectiveness of the proposed control approach.

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

nonlinear systems
prescribed performance
unmodeled dynamics
changing supply function


bag-of-colors

for

improved

image

search

This

paper

investigates

the

use

of

color

information

when

used

within

a

state-of-the-art

large

scale

image

search

system.

We

introduce

a

simple

yet

effective

and

efficient

color

signature

generation

procedure.

It

is

used

either

to

produce

global

or

local

descriptors.

As

a

global

descriptor,

it

outperforms

several

state-of-the-art

color

description

methods,

in

particular

the

bag-of-words

method

based

on

color

SIFT.

As

a

local

descriptor,

our

signature

is

used

jointly

with

SIFT

descriptors

(no

color)

to

provide

complementary

information.

This

significantly

improves

the

recognition

rate,

outperforming

the

state

of

the

art

on

two

image

search

benchmarks.

We

provide

an

open

source

package

of

our

signature

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


Supporting Network Evolution and Incremental Deployment with XIA eXpressive Internet Architecture (XIA) [1] is an architecture that natively supports multiple communication types and allows networks to evolve their abstractions and functionality to accommodate new styles of communication over time. XIA embeds an elegant mechanism for handling unforeseen communication types for legacy routers. In this demonstration, we show that XIA overcomes three key barriers in network evolution (outlined below) by (1) allowing end-hosts and applications to start using new communication types (e.g., service and content) before the network supports them, (2) ensuring that upgrading a subset of routers to support new functionalities immediately benefits applications, and (3) using the same mechanisms we employ for 1 and 2 to incrementally deploy XIA in IP networks.

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


amalgam ideas in noiseless black-box optimization benchmarking This paper describes the application of a Gaussian Estimation-of-Distribution (EDA) for real-valued optimization to the noiseless part of a benchmark introduced in 2009 called BBOB (Black-Box Optimization Benchmarking). Specifically, the EDA considered here is the recently introduced parameter-free version of the Adapted Maximum-Likelihood Gaussian Model Iterated Density-Estimation Evolutionary Algorithm (AMaLGaM-IDEA). Also the version with incremental model building (iAMaLGaM-IDEA) is considered.

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

evolutionary computation
black-box optimization


(r vertical bar p)-centroid problems on networks with vertex and edge demand This paper analyzes (r vertical bar p)-centroid problems on networks with vertex and edge demand under a binary choice rule. Bilevel programming models are presented for the discrete problem class. Furthermore, NPhardness proofs for the discrete and continuous (1 vertical bar p-centroid problem on general networks with edge demand only are provided. Nevertheless, an efficient algorithm to determine a discrete (1 vertical bar p)-centroid of a tree network with vertex and edge demand can be derived. (C) 2012 Elsevier Ltd. All rights reserved.

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


The virtual company: a re-configurable open shell for problem-based learning in industrial engineering The interactive multimedia e-leaming system (IMELS) is an e-learning courseware for industrial engineering developed at the University of Hong Kong. The system adopts a problem-based learning approach to the teaching and teaming through the delivery of realistic case problems using interactive multimedia technology over the World-Wide-Web. The main features of the system include a multimedia portfolio of industrial engineering, an electronic knowledge base and the virtual company suit that presents the case problem that exists in two virtual enterprises. As the system is designed to enhance the effectiveness of teaching industrial engineers who will become more capable individuals to fit into their future careers through the exposition of vivid case problems in their learning process, one of the main features of the system is its ability to create computer-based material for case problems in a flexible and efficient manner. In this respect, the open-shell architecture of the virtual company, which consists of a client-based interface that runs on user PCs and a server-based repository, enables web-based materials to be loaded and organized in real time so that the content of individual virtual companies can be dynamically configured to cater for each case problem. Apart from the introduction of the IMELS, this paper focuses on the design and the functionality of the virtual company. The unique feature of the configurable animated entities will be explained and is illustrated with a case problem that exists in the GX Port Holdings Corporation virtual company. (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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

industrial engineering education
e-learning
problem-based learning


Generalized arithmetic operators and their relationship to t-norms in interval-valued fuzzy set theory In this paper we study extensions of the arithmetic operators +, -, ., divided by to the lattice L(1) of closed subintervals of the unit interval. Starting from a minimal set of axioms that these operators must fulfill, we investigate which properties they satisfy. We also investigate some classes of t-norms on L(1) which can be generated using these operators; these classes provide natural extensions of the Lukasiewicz, product, Frank, Schweizer-Sklar and Yager t-norms to L(1). (c) 2009 Elsevier B.V. All rights reserved.

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

interval-valued fuzzy set
lukasiewicz t-norm
product t-norm
frank t-norm
schweizer-sklar t-norm
yager t-norm


Consistency of posterior distributions for neural networks In this paper we show that the posterior distribution for feedforward neural networks is asymptotically consistent. This paper extends earlier results on universal approximation properties of neural networks to the Bayesian setting. The proof of consistency embeds the problem in a density estimation problem, then uses bounds on the bracketing entropy to show that the posterior is consistent over Hellinger neighborhoods. It then relates this result back to the regression setting. We show consistency in both the setting of the number of hidden nodes growing with the sample size, and in the case where the number of hidden nodes is treated as a parameter. Thus we provide a theoretical justification for using neural networks for nonparametric regression in a Bayesian framework.

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

nonparametric regression
bracketing entropy

bayesian statistics
asymptotic consistency
posterior approximation
sieve asymptotics
hellinger distance


a resource-allocation queueing fairness measure Fairness is a major issue in the operation of queues, perhaps it is the reason why queues were formed in the first place. Recent studies show that the fairness of a queueing system is important to customers not less than the actual delay they experience. Despite this observation little research has been conducted to study fairness in queues, and no commonly agreed upon measure of queue fairness exists. Two recent research exceptions are Avi-Itzhak and Levy [1], where a fairness measure is proposed, and Wierman and Harchol-Balter [18] (this conference, 2003), where a criterion is proposed for classifying service policies as fair or unfair; the criterion focuses on customer service requirement and deals with fairness with respect to service times.In this work we recognize that the inherent behavior of a queueing system is governed by two major factors: Job seniority (arrival times) and job service requirement (service time). Thus, it is desired that a queueing fairness measure would account for both. To this end we propose a Resource Allocation Queueing Fairness Measure, (RAQFM), that accounts for both relative job seniority and relative service time. The measure allows accounting for individual job discrimination as well as system unfairness. The system measure forms a full scale that can be used to evaluate the level of unfairness under various queueing disciplines. We present several basic properties of the measure. We derive the individual measure as well as the system measure for an M/M/1 queue under five fundamental service policies: Processor Sharing (PS), First Come First Served (FCFS), Non-Preemptive Last Come First Served (NP-LCFS), Preemptive Last Come First Served (P-LCFS), and Random Order of Service (ROS). The results of RAQFM are then compared to those of Wierman and Harchol-Balter [18], and the quite intriguing observed differences are discussed.

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

processor sharing
resource allocation
fairness
ps
fcfs
unfairness


Group-based memory oversubscription for virtualized clouds We identify the limitations of system-wide memory oversubscription in a public cloud. We propose a group-based scheme for inter-group isolation and intra-group efficiency. We design and evaluate the proposed group-based oversubscription policies. We found that the system-wide oversubscription can break inter-group isolation.

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

virtualization
resource isolation
cloud computing


Static and dynamic analysis of beam assemblies using a differential system on an oriented graph Many systems in engineering, theoretical physics and other domains of natural sciences can be investigated using a linear mathematical model having the character of a differential system defined within a given network. This network may consist of one-dimensional elements characterised by local coordinate systems. These elements (recti- or curvilinear) are interconnected at nodes, through which energy, mass and stiffness properties of the elements are transmitted as a function of time. The system as a whole is generally determined by some boundary conditions or assumed to be interconnected with other subsystems. Elements of the system are considered to have continuously distributed parameters (mass, stiffness, conductivity, etc.). External energy may be supplied through boundary conditions or by excitation of elements at nodes. The problem of the systems response, or a relevant eigenvalue problem, can be understood as a problem of a differential system on an oriented graph. This graph is a corresponding geometrical representation of the system investigated, where elements of the graph represent individual beams of the system. Therefore the physical part of the problem is fully included in the original differential system, but without any indication of its domain shape. As illustrations of this theoretical study, the conventional Slope Deflection Method (SDM), developed in the past for statics and later for dynamics of continuous frames are outlined in this paper, along with some illustrations from other branches. It should be noted that the character of the resulting algorithm is similar to the FEM if special macro-elements provided by direct solution of the relevant differential system are used. High numerical stability of the approach used here is a significant strength in comparison with other procedures. This follows from the principal attributes of the proposed method. Easy implementation of the theory into existing software packages is possible.

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

symmetric operators
dynamic stiffness matrix
finite element method


2-D frictionless dynamic contact analysis of large deformable bodies by PetrovGalerkin natural element method This paper presents a PetrovGalerkin natural element method for the nonlinear analysis of 2-D dynamic contact problems without friction. The frictionless dynamic contact problem is formulated according to the linearized total Lagrangian method incorporated with the linearized penalty method. The displacement increment is approximated with Laplace interpolation functions defined with the help of Voronoi polygons, while the admissible virtual displacement is expanded with constant strain functions which are supported on Delaunay triangles. The spatial numerical integration is carried out by applying the conventional Gauss quadrature rule to Delaunay triangles and the temporal time integration is performed by the implicit Newmark method. The validity of the proposed method is examined through the illustrating numerical experiments.

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

petrovgalerkin natural element method
large deformable bodies
frictionless dynamic contact analysis
laplace interpolation
linearized total lagrangian method


Inductive transfer with context-sensitive neural networks Context-sensitive Multiple Task Learning, or csMTL, is presented as a method of inductive transfer which uses a single output neural network and additional contextual inputs for learning multiple tasks. Motivated by problems with the application of MTL networks to machine lifelong learning systems, csMTL encoding of multiple task examples was developed and found to improve predictive performance. As evidence, the csMTL method is tested on seven task domains and shown to produce hypotheses for primary tasks that are often better than standard MTL hypotheses when learning in the presence of related and unrelated tasks. We argue that the reason for this performance improvement is a reduction in the number of effective free parameters in the csMTL network brought about by the shared output node and weight update constraints due to the context inputs. An examination of IDT and SVM models developed from csMTL encoded data provides initial evidence that this improvement is not shared across all machine learning models.

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

inductive transfer
machine lifelong learning

artificial neural networks
context-sensitive learning
context attributes
task relatedness


The Politecast Communication Primitive for Low-Power Wireless In low-power wireless networks, nodes need to duty cycle their radio transceivers to achieve a long system lifetime. Counter-intuitively, in such networks broadcast becomes expensive in terms of energy and bandwidth since all neighbors must be woken up to receive broadcast messages. We argue that there is a class of traffic for which broadcast is overkill: periodic redundant transmissions of semi-static information that is already known to all neighbors, such as neighbor and router advertisements. Our experiments show that such traffic can account for as much as 20% of the network power consumption. We argue that this calls for a new communication primitive and present politecast, a communication primitive that allows messages to be sent without explicitly waking neighbors up. We have built two systems based on politecast: a low-power wireless mobile toy and a full-scale low-power wireless network deployment in an art gallery and our experimental results show that politecast can provide up to a four-fold lifetime improvement over broadcast.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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
experimentation
measurement
performance
low-power wireless
sensor networks
duty cycling


Applications of partially balanced incomplete block designs in developing (2, n) visual cryptographic schemes The aim of our paper is to show how Partially Balanced Incomplete Block Designs (PBIBD) may be used to construct (2,n) visual cryptographic schemes for black and white images with small pixel expansion. In situations where uniformity of the participants with respect to the relative contrast is not important, our schemes work well since by allowing the relative contrast to vary depending on which two participants are recovering the image, they can keep the pixel expansion quite small. Thus our schemes have considerably smaller pixel expansion than many of the existing schemes. For some n and some pairs of participants recovering the image, our schemes have larger relative contrast than some existing schemes.

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

participants
pixel expansion
relative contrast


An efficient method for nonlinearly constrained networks Many nonlinear network flow problems (in addition to the balance constraints in the nodes and capacity constraints on the arc flows) have nonlinear side constraints, which specify a flow relationship between several of the arcs in the network flow model. The short-term hydrothermal coordination of electric power generation is an example of this type. In this work we solve this kind of problem using an approach in which the efficiency of the well-known techniques for network flow can be preserved. It lies in relaxing the side constraints in an augmented Lagrangian function, and minimizing a sequence of these functions subject only to the network constraints for different estimates of the Lagrange multipliers of the side constraints. This method gives rise to an algorithm, which combines first- and superlinear-order multiplier methods to estimate these multipliers. When the number of free variables is very high we can obtain a superlinear-order estimate by means of the limited memory BFGS method fitted to our problem. An extensive computational comparison with other methods has been performed. The numerical results reported indicate that the algorithm described may be employed advantageously to solve large-scale network flow problems with nonlinear side constraints.

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

hydrothermal scheduling of electricity generation


Coding-error based defects in enterprise resource planning software: Prevention, discovery, elimination and mitigation Software defects due to coding errors continue to plague the industry with disastrous impact, especially in the enterprise application software category. Identifying how much of these defects are specifically due to coding errors is a challenging problem. In this paper, we investigate the best methods for preventing new coding defects in enterprise resource planning (ERP) software, and discovering and fixing existing coding defects. A large-scale survey-based ex-post-facto study coupled with experiments involving static code analysis tools on both sample code and real-life million lines of code open-source ERP software were conducted for such purpose. The survey-based methodology consisted of respondents who had experience developing ERP software. This research sought to determine if software defects could be merely mitigated or totally eliminated, and what supporting policies, procedures and infrastructure were needed to remedy the problem. In this paper, we introduce a hypothetical framework developed to address our research questions, the hypotheses we have conjectured, the research methodology we have used, and the data analysis methods used to validate the stated hypotheses. Our study revealed that: (a) the best way for ERP developers to discover coding-error based defects in existing programs is to choose an appropriate programming language; perform a combination of manual and automated code auditing, static code analysis, and formal test case design, execution and analysis, (b) the most effective ways to mitigate defects in an ERP system is to track the defect densities in the ERP software, fix the defects found, perform regression testing, and update the resulting defect density statistics, and (c) the impact of epistemological and legal commitments on the defect densities of ERP systems is inconclusive. We feel that our proposed model has the potential to vastly improve the quality of ERP and other similar software by reducing the coding-error defects, and recommend that future research aimed at testing the model in actual production environments.

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

defect density
coding defects
erp
code auditing
static code analysis

software development
defect reduction
software testing


On the construction of mutual fund portfolios: A multicriteria methodology and an application to the Greek market of equity mutual funds The evaluation of the performance of mutual funds (MFs) has been a very interesting research topic not only for researchers, but also for managers of financial, banking and investment institutions. In this paper, an integrated methodological framework for the evaluation of MF performance is proposed. The proposed methodology is based on the combination of discrete and continuous multicriteria decision aid (MCDA) methods for MFs selection and composition. In the first stage of the analysis the UTADIS MCDA method is employed in order to develop mutual fund's performance models supporting the selection of a small set of MFs, which will compose the final portfolios. In the second stage, a goal programming model is employed to determine the proportion of the selected MFs in the final portfolios. The methodology is applied on data of Greek MFs over the period 19992001 with encouraging results.

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

multiple criteria analysis
utadis method


Spatial Preference Modelling for equitable infrastructure provision: an application of Sens Capability Approach To determine whether the inclusion of spatial neighbourhood comparison factors in Preference Modelling allows spatial decision support systems (SDSSs) to better address spatial equity, we introduce Spatial Preference Modelling (SPM). To evaluate the effectiveness of this model in addressing equity, various standardisation functions in both Non-Spatial Preference Modelling and SPM are compared. The evaluation involves applying the model to a resource location-allocation problem for transport infrastructure in the Special Province of Yogyakarta in Indonesia. We apply Amartya Sens Capability Approach to define opportunity to mobility as a non-income indicator. Using the extended Morans I interpretation for spatial equity, we evaluate the distribution output regarding, first, the spatial distribution patterns of priority targeting for allocation (SPT) and, second, the effect of new distribution patterns after location-allocation (ELA). The Morans I index of the initial map and its comparison with six patterns for SPT as well as ELA consistently indicates that the SPM is more effective for addressing spatial equity. We conclude that the inclusion of spatial neighbourhood comparison factors in Preference Modelling improves the capability of SDSS to address spatial equity. This study thus proposes a new formal method for SDSS with specific attention on resource location-allocation to address spatial equity.

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

capability approach
spatial preference modelling


context sensitive access control We investigate the practical feasibility of using context information for controlling access to services. Based solely on situational context, we show that users can be transparently provided anonymous access to services and that service providers can still impose various security levels. Thereto, we propose context-sensitive verification methods that allow checking the user's claimed authenticity in various ways and to various degrees. More precisely, conventional information management approaches are used to compare historic contextual (service usage) data of an individual user or group. The result is a relatively strong, less intrusive and more flexible access control process that mimics our natural way of authentication and authorization in the physical world.

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

authentication
context sensitive
access control

context verification
service usage patterns


Evaluation of diurnal hyperspectral HDRF data acquired with the RSL field goniometer during the DAISEX'99 campaign A directional data set of bare soil and Alfalfa acquired using the FIeld GOniometer System (FIGOS) during the DAIS Experiment 1999 (DAISEX'99) campaign is preprocessed and analyzed for its quality. Two different normalization methods to derive anisotropy factors, i.e., dividing by nadir reflectance and by spectral albedo, are tested and discussed. The effect of varying reflectances on the prediction of vegetation variables due to changing Sun and viewing geometries is demonstrated by the derivation of the weighted difference vegetation index (WDVI) for Alfalfa multiangular data and proves to be significant. The results described in this work are a contribution to the preprocessing and validation of ground-based directional remote sensing data, with a special emphasis on the spectral component and the diurnal dynamics of multiangular ground-based observations of soil and an Alfalfa canopy. The study is a step towards the generation of BRDF databases for the validation and calibration of air- and spaceborne remote sensing data.

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


Vibration monitoring of motorized spindles using spectral analysis techniques High speed machining (HSM) technology is used in a broad range of applications to machine ferrous metals and nonmetallic material. The motorized spindle is one of the major elements to keep the machine running at high productivity. Though the motorized spindle will generate high power and torque at high speed, high removable rate, but the thermal characteristics are more dynamical, speed-dependent and non-linear. The air gap between rotor and stator changes with speed and time, the expansion of rotor, the highly complicated mechanical coupling as well as interface of the mechanical structure. All these factors create centrifugal force to the rotating bearings which not only heat these bearings up. causing bad tolerance, but also create the vibration problem. The worse situation may cause the bearings choked. In this paper, a piezo transducer is used to check the spindle vibration. Once the spindle is out of balance, the transducer gives a dialog response to computerized numerical controller (CNC) which is set with a control level. Based on ISO standard, 2 mm/s is the max acceptable vibration and designed in accordance with 2 V output voltage. Any higher voltage will enable the CNC shut down the spindle before the bearings are damaged. This new concept will prevent spindle from turning dead. As a result, the spectral analysis techniques can record the condition of spindle rotation even under the condition of misoperation. (C) 2009 Elsevier Ltd. All rights reserved.

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

hsm
motorized spindle
spectral analysis techniques
vibration


a multipopulation cultural algorithm based on genetic algorithm for the mkp Genetic Algorithms (GAs) have been used to solve the NP-complete problems effectively such as the Multi Knapsack Problem (MKP). This work presents a combination between CAs and GAs with multipopulation model for the MKP. The benchmark simulation results indicate that the addition of multipopulation model improving optimization performance for CAs. To show the importance of multipopulation in the CAs, several MKP computational tests are performed for some benchmark problems

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

multipopulation
multi knapsack problem
genetic algorithms

cultural algorithms
combinatorial optimization


Parameterless Local Discriminant Embedding In this paper, we propose a parameterless Local Discriminant Embedding. Recently, local discriminant embedding (LDE) method was proposed in order to tackle some limitations of the global linear discriminant analysis (LDA) method. LDE splits the graph Laplacian into two components: within-class adjacency graph and between-class adjacency graph to better characterize the discriminant property of the data. However, it is very difficult to set in advance the within- and between-class graphs. Our proposed LDE variant has two important characteristics: (i) while all graph-based manifold learning techniques (supervised and unsupervised) are depending on several parameters that require manual tuning, ours is parameter-free, and (ii) it adaptively estimates the local neighborhood surrounding each sample based on the data similarity. The resulting revisited LDE approach has been applied to the problem of model-less coarse 3D head pose estimation (person independent 3D pose estimation). It was tested on two large databases: FacePix and Pointing04. It was conveniently compared with other linear techniques. The experimental results confirm that our method outperforms, in general, the existing ones.

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

modelless and coarse 3d head pose estimation


Segmentation of objects in a detection window by Nonparametric Inhomogeneous CRFs This paper presents a method for segmenting objects of a specific class in a given detection window. The task is to label each pixel as belonging to the foreground or the background. We pose the problem as that of finding the maximum a posterior (MAP) estimation in a modified form of Conditional Random Field model that we call a Nonparametric Inhomogeneous CRF (NICRFs). An NICRF, like a conventional CRF, has nodes representing pixels and pairwise links connecting neighboring pixels; however, both the unary and pairwise energy terms are inhomogeneous in the sense of being dependent on pixel positions to account for prior information of the known object class. It differs from earlier methods in that position information is in form of unique term functions for each individual pixel, rather than the same parametric function but with varying parameters. Unary terms are given by a learned boosted classifier based on novel Adaptive Edgelet Features (AEFs) for inferring probability of a pixel being foreground; pairwise terms are learned by joint probabilities for neighboring pixels as a function of contrast; a monotonicity constraint is used to reduce possible over-fit effects. We expand the neighborhood used for pairwise terms, and add inhomogeneous weighting factors for different pairwise terms. We use the Loopy Belief Propagation (LBP) algorithm for MAP estimation. A local search process is proposed to deal with inaccurate detection windows. We evaluate our approach on examples of pedestrians and cars and demonstrate significant improvements compared to earlier methods.

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

nonparametric inhomogeneous conditional random field


a synthetic traffic model for quake3 This paper presents our development of a synthetic traffic model for the interactive online computer game Quake3. The goal is a traffic model that can be used by researchers and Internet Service Provider engineers to estimate the potential future impact of Quake3 traffic over IP networks. We developed our ns2 simulation model for Quake3's IP traffic by running live network experiments and characterising the observed packet length, packet inter-arrival times, and data rates (in packets- and bits- per second). Our observations are documented in this paper, and we expect our traffic model will assist network planners who wish to better support real-time game traffic.

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


A Fast Algorithm for Computing Geodesic Distances in Tree Space Comparing and computing distances between phylogenetic trees are important biological problems, especially for models where edge lengths play an important role. The geodesic distance measure between two phylogenetic trees with edge lengths is the length of the shortest path between them in the continuous tree space introduced by Billera, Holmes, and Vogtmann. This tree space provides a powerful tool for studying and comparing phylogenetic trees, both in exhibiting a natural distance measure and in providing a euclidean-like structure for solving optimization problems on trees. An important open problem is to find a polynomial time algorithm for finding geodesics in tree space. This paper gives such an algorithm, which starts with a simple initial path and moves through a series of successively shorter paths until the geodesic is attained.

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

geometrical problems and computations
graph theory
biology and genetics
phylogenetics


Empirical mode decomposition on skeletonization pruning ? Usage of Ensemble Empirical Mode Decomposition (EEMD) on object skeletonization Modeling of object contour with a 2D EEMD-like procedure The produced IMFs provide a very good and novel workspace for image skeletonization. The proposed method is fully automated and unsupervised.

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

empirical mode decomposition
skeletonization
pruning

ensemble empirical mode decomposition
intrinsic mode
skeleton


A Generalized Construction of Zero-Correlation Zone Sequence Set with Sequence Subsets The present paper introduces a new approach to the construction of a sequence set with a zero-correlation zone for both periodic and aperiodic correlation functions. The proposed sequences can be constructed from a pair of Hadamard matrices of orders n(0) and n(1). The constructed sequence set consists of n(0)n(1) ternary sequences, each of length n(0)((m+2))(n(1) + Delta), for a non-negative integer in and Delta >= 2. The zero-correlation zone of the proposed sequences is |tau| <= n(0)(m+1) -1, where tau is the phase shift. The proposed sequence set consists of no subsets, each with a member size n1. The correlation function of the sequences of a pair of different subsets, referred to as the inter-subset correlation function, has a zero-correlation zone with a width that is approximately Delta times that of the correlation function of sequences of the same subset (intra-subset correlation function). The inter-subset zero-correlation zone of the proposed sequences is |tau| <= Delta n(0)(m+1), where tau is the phase shift. The wide inter-subset zero-correlation enables performance improvement during application of the proposed sequence set.

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

finite-length sequence
inter-subset zero-correlation
zero-correlation zone
aperiodic correlation function
periodic correlation function


Relay characteristic impact on energy consumption in heterogeneous sensor network Indoor heterogeneous wireless sensor networks are considered in this paper. We analyze the power consumption for multihop communications with non-regenerative relays. Since sensor nodes are battery operated, energy consumption is a crucial issue. We determine the optimal relay gains and transmitted power that minimize the dissipated power for a given quality of service in a narrow band fading channel. Our work includes two main contributions: firstly, we study the energy consumption taking into account hardware aspects, especially the relays efficiency. In an AWGN channel, carefully analyzing the energy gain as a function of the position, we show that relay characteristics have an important impact on the multihop link consumption budget. We then use a Rice channel model based on simulations and further study the hardware impact on energy saving.

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

multihop transmission
non-regenerative relay
rice fading channel


Optimization of olfactory model in software to give 1/f power spectra reveals numerical instabilities in solutions governed by aperiodic (chaotic) attractors We present a general connectionist model for an olfactory system. The dynamical behavior of each node (neural ensemble) of the model is governed by a second-order ordinary differential equation (ODE) followed by an asymmetric sigmoidal function, relating the aggregate activity of neurons to system parameters and stimuli from an outside environment. A digital implementation of the general connectionist model simulates the characteristics of a mammalian olfactory system having modifiable synaptic connections and spatio-temporal interactions among neural ensembles. Each of four distributed delay terms is represented by a second-order ODE. A parameter optimization algorithm is an integral component of the model. The parameter optimization discussed in this paper results in aperiodic oscillations having a near 1/f-type power spectrum with a peak in the gamma range, simulating the electro-encephalographic (EEG) potentials from the neural olfactory system. Random optimization is used for a rough search in a global parameter domain and the parameter self-adaptation rule serves for fine tuning within a local domain after the global search. By design the model is started from an unstable zero point by an external impulse input. It requires 650850ms to pass through an initializing transient before settling into a strange attractor. The attractor persists for at least 1500ms, which is 7.520 times longer than the duration of the maximal stationary states observed in the EEGs and it is stable under perturbation by simulated sensory inputs giving response amplitudes less than 2 times the basal aperiodic activity. However, the optimization to 1/f-type activity reveals an inherent limit on digital simulation of chaotic states, owing to attractor crowding such that the size of basins decreases with increasing size of the model, until it approaches the size of digitizing step in computation, here a 64-bit word (?10?16). Outputs that are not optimized to approach 1/f-type power spectra transit earlier to limit cycle activity, usually well before 2000ms. The duration of stationarity is increased by randomizing the terminal bit of the 64-bit words representing the state variables. The 1/f-type solutions are also exquisitely sensitive to parameter truncation; parameter values must be saved in their full binary form for re-starting. The implications in terms of numerical instability, chaos, attractor crowding and the shadowing theorem are discussed.

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

attractor crowding
chaos
neural ensemble
olfactory system
shadowing

1/f power spectrum
eeg wave
pseudo-trajectory


Object-based vectorization for interactive image editing We present a technique for creating an editable vector graphic from an object in a raster image. Object selection is performed interactively in subsecond time by calling graph cut with each mouse movement. A renderable mesh is then computed automatically for the selected object and each of its subobjects by (1) generating a coarse object mesh; (2) performing recursive graph cut segmentation and hierarchical ordering of subobjects; (3) applying error-driven mesh refinement to each (sub)object. The fully layered object hierarchy compares favorably with current approaches and is computed in a few 10s of seconds, facilitating object-level editing without leaving holes.

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

image-based rendering and modeling
interaction techniques
computer vision for graphics
non-photorealistic rendering


Estimation of transitional probabilities of discrete event systems from cross-sectional survey and its application in tobacco control In order to find better strategies for tobacco control, it is often critical to know the transitional probabilities among various stages of tobacco use. Traditionally, such probabilities are estimated by analyzing data from longitudinal surveys that are often time-consuming and expensive to conduct. Since cross-sectional surveys are much easier to conduct, it will be much more practical and useful to estimate transitional probabilities from cross-sectional survey data if possible. However, no previous research has attempted to do this. In this paper, we propose a method to estimate transitional probabilities from cross-sectional survey data. The method is novel and is based on a discrete event system framework. In particular, we introduce state probabilities and transitional probabilities to conventional discrete event system models. We derive various equations that can be used to estimate the transitional probabilities. We test the method using cross-sectional data of the National Survey on Drug Use and Health. The estimated transitional probabilities can be used in predicting the future smoking behavior for decision-making, planning and evaluation of various tobacco control programs. The method also allows a sensitivity analysis that can be used to find the most effective way of tobacco control. Since there are much more cross-sectional survey data in existence than longitudinal ones, the impact of this new method is expected to be significant.

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

discrete event systems
tobacco control
smoking behavior

cross-sectional survey
transitional probability


Ensembles and locality: Insight on improving software effort estimation Ensembles of learning machines and locality are considered two important topics for the next research frontier on Software Effort Estimation (SEE). We aim at (1) evaluating whether existing automated ensembles of learning machines generally improve SEEs given by single learning machines and which of them would be more useful; (2) analysing the adequacy of different locality approaches; and getting insight on (3) how to improve SEE and (4) how to evaluate/choose machine learning (ML) models for SEE. A principled experimental framework is used for the analysis and to provide insights that are not based simply on intuition or speculation. A comprehensive experimental study of several automated ensembles, single learning machines and locality approaches, which present features potentially beneficial for SEE, is performed. Additionally, an analysis of feature selection and regression trees (RTs), and an investigation of two tailored forms of combining ensembles and locality are performed to provide further insight on improving SEE. Bagging ensembles of RTs show to perform well, being highly ranked in terms of performance across different data sets, being frequently among the best approaches for each data set and rarely performing considerably worse than the best approach for any data set. They are recommended over other learning machines should an organisation have no resources to perform experiments to chose a model. Even though RTs have been shown to be more reliable locality approaches, other approaches such as k-Means and k-Nearest Neighbours can also perform well, in particular for more heterogeneous data sets. Combining the power of automated ensembles and locality can lead to competitive results in SEE. By analysing such approaches, we provide several insights that can be used by future research in the area.

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

software effort estimation
ensembles of learning machines
locality


observing the evolution of internet as topology Characterizing the evolution of Internet topology is important to our understanding of the Internet architecture and its interplay with technical, economic and social forces. A major challenge in obtaining empirical data on topology evolution is to identify real topology changes from the observed topology changes, since the latter can be due to either topology changes or transient routing dynamics. In this paper, we formulate the topology liveness problem and propose a solution based on the analysis of BGP data. We find that the impact of transient routing dynamics on topology observation decreases exponentially over time, and that the real topology dynamics consist of a constant-rate birth process and a constant-rate death process. Our model enables us to infer real topology changes from observation data with a given confidence level. We demonstrate the usefulness of the model by applying it to three applications: providing more accurate views of the topology, evaluating theoretical evolution models, and empirically characterizing the trends of topology evolution. We find that customer networks and provider networks have distinct evolution trends, which can provide an important input to the design of future Internet routing architecture.

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

challenge
applications
input
analysis
evolution
design
social
paper
model
internet topology
future internet
views
architecture
data
process
routing
demonstrate
internet

network
understandability
use
topologies
timing
change
observability
dynamic
custom
topology evolution
internet architecture


Rearrangement of DNA fragments: a branch-and-cut algorithm ? We consider a problem called minimum k-contig problem (MkCP), whose specialization to an alphabet with four symbols can be seen as a problem that arises in the process of arranging DNA fragments to reconstruct a molecule. We present a graph theoretical formulation of MkCP and mention some extensions. We show this problem to be -hard for every k?1 (for an alphabet that is not of fixed cardinality). A 0/1 integer linear programming formulation of the problem is given and some results of a branch-and-cut algorithm based on this formulation are discussed.

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

integer programming
computational biology
branch-and-cut
polyhedral combinatorics


The scaled boundary finite-element method - a primer: solution procedures The scaled boundary finite-element equations in displacement and dynamic stiffness, which are ordinary differential equations, derived in the accompanying paper involve the discretization of the boundary only. The general solution procedure is demonstrated addressing an illustrative example which consists of a two-dimensional out-of-plane (anti-plane) motion with a single degree of freedom on the boundary. For statics and dynamics in the frequency domain, the displacements in the domain and the stiffness matrix with degrees of freedom on the boundary only are obtained analytically for bounded and unbounded media. The radiation condition is satisfied exactly using the high-frequency asymptotic expansion for the dynamic-stiffness matrix of an unbounded medium. The mass matrix for a bounded medium is determined analytically. Body loads in statics are calculated analytically. Numerical procedures to calculate the dynamic-stiffness and unit-impulse response matrices for an unbounded medium are also presented. The scaled boundary finite-element method is semi-analytical as the ordinary differential equations in displacement are solved analytically, which permits an efficient calculation of displacements, stresses and stress intensity factors. This boundary-element method based on finite elements leads to a reduction of the spatial dimension by one. As no fundamental solution is required, no singular integrals are evaluated and anisotropic material is analysed without additional computational effort. (C) 2000 Civil-Comp Ltd. and 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 B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

boundary element
finite element
soil-structure interaction
wave motion


hardware evaluation of the luffa hash family Efficient hardware architectures for the Luffa hash algorithm are proposed in this work. We explore different tradeoffs and propose several architectures, targeting both compact and high-throughput designs. Implemented using UMC 0.13 ?m CMOS standard cell library, the most compact architecture of Luffa -224/256 contains 18,260 GE. The same version, optimized for speed, achieves a throughput of almost 32 Gbps, while the throughput of the pipelined design approaches 291.7 Gbps. Concerning the final throughput, our implementations outperform state of the art implementations of the existing hash standards.

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


Computation of multiple bifurcation point Purpose - The aim of this paper is to develop a new method for finding multiple bifurcation points in structures. Design/methodology/approach - A brief review of nonlinear analysis is presented. A powerful method (called arc-length) for tracing nonlinear equilibrium path is described. Techniques for monitoring critical points are discussed to find the rank deficiency of the stiffness matrix. Finally, by using eigenvalue perturbation of tangent stiffness matrix, load parameter associated with multiple bifurcation points is obtained. Findings - Since other methods of finding simple bifurcation points diverge in the neighborhood of critical points, this paper introduces a new method to find multiple bifurcation points. It should be remembered that a simple bifurcation point is a multiple bifurcation point with rank deficiency equal to one. Therefore, the method is applicable to simple critical points as well. Practical implications - Global buckling of the structures should be considered in design. Many structures (specially symmetric space structures) have multiple bifurcation points, therefore, analyst and designer should be aware of these points and should control them (for example, by changing the geometry or other related factors) for obtaining a safe and optimum design. Originality/value - In this paper a robust method to find multiple bifurcation points is introduced. By using this method, engineers can be aware of critical load of multiple bifurcation points to control global buckling of related structures.

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

stability (control theory)
optimization techniques
stiffness matrices


Blind source separation of more sources than mixtures using sparse mixture models In this paper, blind source separation is discussed with more sources than mixtures. This blind separation technique assumes a linear mixing model and involves two steps: (1) learning the mixing matrix for the observed data using the sparse mixture model and (2) inferring the sources by solving a linear programming problem after the mixing matrix is estimated. Through the experiments of the speech signals, we demonstrate the efficacy of this proposed approach.

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

blind source separation
sparse mixture model

overcomplete representation
independent component analysis
signal processing


visualizing gyrokinetic simulations The continuing advancement of plasma science is central to realizing fusion as an inexpensive and safe energy source. Gryokinetic simulations of plasmas are fundamental to the understanding of turbulent transport in fusion plasma. This paper discusses the visualization challenges presented by gyrokinetic simulations using magnetic field line following coordinates, and presents an effective solution exploiting programmable graphics hardware to enable interactive volume visualization of 3D plasma flow on a toroidal coordinate system. The new visualization capability can help scientists better understand three-dimensional structures of the modeled phenomena. Both the limitations and future promise of the hardware-accelerated approach are also discussed.

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

plasma physics
non-rectilinear mesh
texture methods
scientific visualization


Use-case components for interactive information systems Specification-oriented components (SOC's) are designed to facilitate the implementation of a system directly from its specifications. An earlier study has shown cases in which SOC's enabled information systems to be implemented with considerably less code than when implemented with components designed by a typical object-oriented approach. This study goes a further step by considering the essence of an information system to be the flow and processing of data. The components based on this abstraction attempt to hide code that is not implementing data flow or data processing. Based on this approach, an experimental framework called WebSI has been developed. WebSI components hide the code for the construction of the user interface (UI), the database access code and the Web-related code. WebSI was designed to facilitate the manual translation of English language use-case specifications into Java code. WebSI enabled the construction of information systems with a modest amount of code. The similarity between the WebSI-based Java code and the English language use-case specifications facilitated verifying that the code implements the specifications correctly. The automatically produced UI's were relatively easy to learn and to use. The modification of WebSI-based legacy code was facilitated by the high level of the code and its use-case structure, but remained a labor-intensive task. (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 B I O O O O O O O O O O O O O O O O O O O O O O O O O O O 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

component
specification-oriented
specification-oriented component
use case
world wide web
web


GPU enabled XDraw viewshed analysis Performed performance experiments on four different viewshed analysis algorithms across CPU and GPU domains. Utilized the C++ AMP framework to ensure cross-platform generalizability. Optimized the XDraw viewshed analysis algorithm for efficiency on a GPU and compared to previous algorithms. Optimized GPU XDraw algorithm performed well when compared to similar GPU and CPU algorithms.

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

visibility
gpgpu
c++ amp
digital terrain visibility


fiber grating-based fabry-perot filters and applications In this paper, a distributed Fabry-Perot (F-P) interferometer filter has been formed in a fiber core by UV laser inscribing of two overlapped chirped-fiber Bragg gratings. Tuning of wavelength spacing has been realized by using a beam-bending chirp rate tuning method for the gratings. The achieved filter has been used for fiber lasers with different gain media of a Raman fiber amplifier or a semiconductor optical amplifier. Multiwavelength fiber laser operation with tunable wavelength spacing of 0.3-0.6 nm has been achieved.

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

optical filters
interferometers
fiber bragg grating


Automatic algorithm for filtering kinematic signals with impacts in the Wigner representation An automatic filtering algorithm is proposed for the accurate estimation of the second derivatives of kinematic signals with impacts. The impacts considered here occur when a moving object hits a rigid surface. The algorithm performs time-frequency filtering in the Wigner representation, to deal efficiently with the non-stationarities caused by such impacts, and adjusts the parameters of its time-frequency filtering function so that the filtering process adapts to the individual characteristics of the signal in hand. Performance analysis and comparative evaluation with experimentally acquired kinematic impact signals demonstrated a higher accuracy, with performance advantages over two widely used conventional automatic methods: linear phase autoregressive model-based derivative assessment (LAMBDA) and generalised cross-validation using quintic splines (GCVQS). For high impacts, the average absolute relative error in estimating the peak acceleration was 5.7% with the proposed method, 17.2% with a Butterworth low-pass filter optimised to yield minimum overall acceleration RMS error (best-case result), 18.3% with the LAMBDA method, and 37.2% with the GCVQS method. For signals with low impacts, the average absolute relative error was 19.4%, 6.9%, 8.3% and 19.1%, respectively, in each case, which indicates that, for signals with a low-frequency content, there is no need for such time-frequency filtering.

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

time-frequency filtering
wigner function
signal differentiation


Using Broadcast Networks to Create On-demand Extremely Large Scale High-throughput Computing Infrastructures A growing number of very simple parallel applications can benefit from the availability of very large computing resource pools that are exploited in an opportunistic way to considerably speed up the processing of these applications. In particular, many applications can scale out to take advantage of the availability of thousands, or even millions, of processors that can be simultaneously used. Some large-scale distributed computing infrastructures (DCI) have already been successfully assembled to this end. However, these DCI are normally designed to cater to specific kinds of applications, and their assemblage is not only costly, but also time consuming. We propose a novel architecture, named OddCI (On-demand DCI), for the cheap, fast and on-demand instantiation and dismantle of very large DCI. These characteristics allow application users to dynamically commission DCI that can cost-effectively be customized to their particular needs, and disposed after being used. Our approach leverages on broadcast communication as an efficient mechanism to enable aggregation of geographically distributed computing resources, including millions of non-traditional processing devices such as mobile phones, and digital television (DTV) receivers. We discuss how the proposed architecture can be implemented on top of a network of DTV receivers, providing evidences of both the technical, as well as the operational feasibility of the OddCI architecture.

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

distributed computing infrastructure
emerging technologies
grid computing
high-throughput computing


Determination of scale elasticity in the existence of non-discretionary factors in performance analysis Discretionary models of data envelopment analysis (DEA) assume that all inputs and outputs can be varied at the discretion of management or other users. In any realistic situation, however, there may exist exogenously fixed or non-discretionary factors that are beyond the control of a DMUs management, which also need to be considered. In this paper, Bankers definition of scale elasticity and returns to scale is modified so that it includes the non-discretionary factors, as well. Then, an efficient algorithm which is capable of determining scale elasticity in the existence of non-discretionary factors is provided.

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

linear programming
non-discretionary factors


interlocked open linkages with few joints We advance the study of collections of open linkages in 3-space that may be interlocked in the sense that the linkages cannot be separated without one bar crossing through another. We consider chains of bars connected with rigid joints, revolute joints, or universal joints and explore the smallest number of chains and bars needed to achieve interlock. Whereas previous work used topological invariants that applied to single or to closed chains, this work relies on geometric invariants and concentrates on open chains.

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

knots
geometry
protein models
robotic arms
configurations


Running memory span: A comparison of behavioral capacity limits with those of an attractor neural network We studied a computational model of short term memory capacity that performs a simulated running memory span task using Hebbian learning and rapid decay of connection strengths to keep recent items active for later recall. This model demonstrates recall performance similar to humans performing the same task, with a capacity limit of approximately three items and a prominent recency effect. The model also shows that this capacity depends on decay to release the model from accumulating interference. Model findings are compared with data from two behavioral experiments that used varying task demands to tax memory capacity limits. Following additional theoretical predictions from the computational model, behavioral data support that when task demands require attention to be spread too thin to keep items available for later recall, capacity limits suffer. These findings are important both for understanding the mechanisms underlying short term memory capacity, and also to memory researchers interested in the role of attention in capacity limitations.

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

computational model
short term memory
attractor neural network


developing a car gesture interface for use as a secondary task Existing gesture-interface research has centered on controlling the user's primary task. This paper explores the use of gestures to control secondary tasks while the user is focused on driving. Through contextual inquiry, ten iterative prototypes, and a Wizard of Oz experiment, we show that a gesture interface is a viable alternative for completing secondary tasks in the car.

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

gesture interfaces
divided attention
in-car telematics
glance


phase tracking and prediction In a single second a modern processor can execute billions of instructions. Obtaining a bird's eye view of the behavior of a program at these speeds can be a difficult task when all that is available is cycle by cycle examination. In many programs, behavior is anything but steady state, and understanding the patterns of behavior, at run-time, can unlock a multitude of optimization opportunities.In this paper, we present a unified profiling architecture that can efficiently capture, classify, and predict phase-based program behavior on the largest of time scales. By examining the proportion of instructions that were executed from different sections of code, we can find generic phases that correspond to changes in behavior across many metrics. By classifying phases generically, we avoid the need to identify phases for each optimization, and enable a unified prediction scheme that can forecast future behavior. Our analysis shows that our design can capture phases that account for over 80\% of execution using less that 500 bytes of on-chip memory.

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

task analysis design account paper predict processor program behavior architecture code tracking future scheme generic

understandability metrication timing forecasting change pattern optimality instruction memorialized classifiation profiles


Evaluation of the flexible information sharing capabilities of view media Since it is necessary to realize virtual organizations in networks, to develop systems to be used for realizing various kinds of cooperation support among users is very important as a basis of virtual organizations. VIEW Media has been developed for such a purpose, utilizing CSCW (Computer Supported Cooperative Work) and database technologies. By introducing the concept of environment, VIEW Media supports flexible information sharing mechanisms. The major purpose of this paper is to show the advantages of the environment model for flexible sharing. Several well-known models are compared and then a representative model, the room model, is selected for comparison to develop the same application. Since the environment model is more general than the room model, we decided to develop "debate systems" which are rather complicated yet can be realized by both models. Debate systems can be regarded as generalization of conference systems and thus we believe the comparison is appropriate. By real usage of debate systems developed by VIEW Media (the environment model) and TeamWave (the room model), the environment model is shown to be suitable for such applications.

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

database views
virtual organization
room metaphor


Miniaturized coplanar waveguide-fed disk monopole antenna for ultra-wideband applications with improved wireless local area network band rejection In this article, we first propose a miniaturized coplanar waveguide-fed disk monopole antenna with overall size of 14 mm 22 mm. Measurement results show that the antenna has an ultrawide impedance bandwidth from 3 to 12 GHz and omnidirectional radiation pattern. Next, we introduce two U-shaped slots in the ground plane of the antenna to provide an improved band rejection in the wireless local area network frequency band. Experimental results indicate that the proposed band notch antenna has maximum voltage standing wave ratio (VSWR) of 25 in the desired rejection band. Measured gain for the proposed band notch antenna is around 0 dB and reduces to ?15dB in the desired rejection band. Time domain performance of both the initial antenna and band notch antenna is also examined and the best detection template is presented. Computed total fidelity factors for both the initial and band notch antenna are greater than 0.9. 2012 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2013

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

monopole antenna
ultrawideband
wireless local area network

coplanar waveguide
truncated ground plane


Stafford Beer in memoriam - "An argument of change" three decades on Purpose - This paper is written in memory of the late Stafford Beer. The paper engages with only one dimension of the whole man: Stafford Beer as the diagnostician and prognostician of the social conditions that he so keenly observed. Design/methodology/approach - The paper revisits a talk that Stafford Beer gave, over three decades ago, to administrators of the UK National Health Service (NHS). It uses the content of the talk, entitled "Health and Quiet Breathing", to diagnose the problems that have been encountered in the development of NHS information management strategies. The paper concludes with some brief personal recollections of Stafford Beer as a friend and as a teacher. Findings - The paper finds Stafford Beer's managerial cybernetics to be a useful tool in understanding many of the problems that have beset NHS information management strategies: lack of operational research, problems in the commodification of information, financial scandal, and bureaucracy. In its examination of these issues, the paper recognises Stafford Beer's status as a legatee of not only Norbert Wiener but also of the great philosophers. Originality/value - The paper demonstrates how the problem-orientation of Stafford Beer's managerial cybernetics continues to be fresh and relevant to today's society and provides a brief portrait of him both as a friend and as a teacher.

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

cybernetics
information
national health service


PDMS-based optical waveguide layer for integration in electricaloptical circuit boards This paper reports on the optical properties of polydimethylsiloxane (PDMS) as a high-performance optical material system for optical interconnects. It is shown that optical PDMS layers laminated into printed circuit boards meet the requirements for low cost, low loss (0.06dB/cm at 850nm), high temperature ( > 290 ? C ) stable and mechanically robust electricaloptical circuit boards. A first production line for optical waveguide layers will be discussed.

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

optical interconnect
electricaloptical circuit board
polymer waveguide


Heinz and Stafford - a tribute to Heinz von Foerster and Stafford Beer In June 1996, Stafford Beer and Heinz von Foerster were invited to Colombia to contribute to a number of events, among others to a symposium about second-order auditing organized by the National Controller's Office of Colombia in Cartagena de Indias. As part of the occasion, they visited Mompox, a colonial town in the delta of the Magdalena river. During that trip, the author met Stafford and from there on she developed a special relationship with him, similar to that six already had with Heinz. The sad death of both great men of cybernetics within a short period of time was the origin of this tribute.

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


Three-dimensional fundamental solution of wave propagation and transient heat transfer in non-homogenous media The main purpose of this paper is developing fundamental solutions of three-dimensional wave and transient heat conduction in non-homogenous media. A variable transformation method is used to change the basic equations into a simple standard Helmholtz form. First, two different ways, i.e. harmonic excitation method and Laplace transform are used to eliminate time expression, and final solutions are expressed in the time-space domain. In addition, FE approach is applied to solve transient heat conduction in functionally graded material (FGM) domain. Different numerical examples are used to validate the proposed methodology by comparing the results with others and FE method. Fundamental solutions are found for both homogenous and non-homogenous media separately. For each example, appropriate graphs are provided to show the differences between the results of homogenous and non-homogenous media.

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

green's function
non-homogenous media
heat equation
wave equation


On vague logics and approximate reasoning based on vague linear transformation As a generalisation of the Fuzzy Sets theory, vague set has been proven to be a new tool in dealing with vague information. In this article, we attempt to generalise the techniques of fuzzy inference in a vague environment. In the rule-based inference system, an 'if... then...' rule can be considered a transformer that implements information conversion between input-output ends. Thus, according to the logical operations of vague linguistic variables, we introduce an approach to approximation inference based on linear transformation, and then discuss the representations for several inference structures regarding single rule, multi-rules and compound rules. By defining the inclusion function of vague sets, we provide vague rough approximation based on measure of inclusion, and then present a method on rule creation from a decision system. A case study on the prediction for welding deformation is used to illustrate the effectiveness of the proposed approaches.

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

vague sets
logical operations
linear transformation
approximate reasoning


Gaithashing: A two-factor authentication scheme based on gait features Recently, gait recognition has attracted much attention as a biometric feature for real-time person authentication. The main advantage of gait is that it can be observed at a distance in an unobtrusive manner. However, the security of an authentication system, based only on gait features, can be easily broken. A malicious actor can observe the gait of an unsuspicious person and extract the related biometric template in a trivial manner and without being noticed. Another major issue of gait as an identifier has to do with their high intra-variance, since human silhouettes can be significantly modified, when for example the user holds a bag or wears a coat. This paper proposes gaithashing, a two-factor authentication that interpolates between the security features of biohash and the recognition capabilities of gait features to provide a high accuracy and secure authentication system. A novel characteristic of gaithashing is that it enrolls three different human silhouettes types. During authentication, the new extracted gait features and the enrollment ones are fused using weighted sums. By selecting appropriate weight values, the proposed scheme eliminates the noise and distortions caused by different silhouette types and achieves to authenticate a user independently of his/her silhouette. Apart from high accuracy, the proposed scheme provides revocability in case of a biometric template compromise. The performance of the proposed scheme is evaluated by carrying out a comprehensive set of experiments. Numerical results show that gaithashing outperforms existing solutions in terms of authentication performance, while at the same time achieves to secure the gait features.

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


Hierarchical Aggregation for Information Visualization: Overview, Techniques, and Design Guidelines We present a model for building, visualizing, and interacting with multiscale representations of information visualization techniques using hierarchical aggregation. The motivation for this work is to make visual representations more visually scalable and less cluttered. The model allows for augmenting existing techniques with multiscale functionality, as well as for designing new visualization and interaction techniques that conform to this new class of visual representations. We give some examples of how to use the model for standard information visualization techniques such as scatterplots, parallel coordinates, and node-link diagrams, and discuss existing techniques that are based on hierarchical aggregation. This yields a set of design guidelines for aggregated visualizations. We also present a basic vocabulary of interaction techniques suitable for navigating these multiscale visualizations.

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

clustering
clutter reduction
massive data sets
visual exploration
visual analytics


adaptive a Agents often have to perform repeated on-line searches as they gain additional knowledge about their environment. We describe an incremental version of A*, called Adaptive A*, that solves series of similar search problems faster than running A* repeatedly from scratch because it updates its heuristics between search episodes. It is simpler than other incremental versions of A* and thus likely easier to extend and adapt to new applications.

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

planning with the freespace assumption
incremental search
d* lite
a*
heuristic search


THE EFFECTS OF BUS STOP ON TRAFFIC FLOW In this paper, we use the traffic flow model proposed by Tang et al. [Physica A 387, 6845 (2008)] to study the effects of bus stop on traffic flow. Our numerical tests show that bus stop will have great effects on the stability of traffic flow and that the effects are related to the initial density and the number of bus stops. The numerical results are accordant with the real traffic, which shows that the model proposed by Tang et al. can describe some complex traffic phenomena resulted by bus stop.

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


Local Scalar Trust Metrics with a Fuzzy Adjustment Method The interactions between people who do not know each other have been greatly increased with the on-going increase of people's cyberspace activities. In this situation, there exist potential risk factors such as the possibility of fraud, so we need a method to reduce or eliminate those risk factors. Concerning this necessity, rating systems are widely used, and many trust metrics calculated from rate values that people give to each other are proposed to help them make decisions. However, the trust metrics decrease the accuracy, and this is caused by the different rating scales and ranges of each person. So, we propose a fuzzy adjustment method to solve this problem. It is possible to catch the exact meaning of the trust value that each person selects through applying fuzzy sets, which improve the accuracy of the trust metric calculated from the trust values. We have applied our fuzzy adjustment method to the TidalTrust algorithm, a representative algorithm for calculating the local scalar trust metric, and we performed an experimental evaluation with four data sets and three evaluation methods.

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


Adding a parity-check bit The correspondence gives a new condition for a q-ary linear code of length n and minimum distance d to be extendable to a code of the same dimension, Length n + 1, and minimum distance > d.

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

code extension
linear codes
parity-check bit


A study on the medium-term forecasting using exogenous variable selection of the extra-virgin olive oil with soft computing methods Time series forecasting is an important task for the business sector. Agents involved in the olive oil sector consider that, for the olive oil price, medium-term predictions are more important than short-term predictions. In collaboration with these agents the forecasting of the price of extra-virgin olive oil six months ahead has been established as the aim of this work. According to expert opinion, the use of exogenous variables and technical indicators can help in this task and must be included in the forecasting process. The amount of variables that can be considered makes necessary the use of feature selection algorithms in order to reduce the number of variables and to increase the interpretability and usefulness of the obtained forecasting system. Thus, in this paper CO(2)RBFN, a cooperative-competitive algorithm for Radial Basis Function Network design, and other soft computing methods have been applied to the data sets with the whole set of input variables and to the data sets with the selected set of input variables. The experimentation carried out shows that CO(2)RBFN obtains the best results in medium term forecasting for olive oil prices with the whole and with the selected set of input variables. Moreover, the feature selection methods applied to the data sets highlighted some influential variables which could be considered not only for the prediction but also for the description of the complex process involved in the medium-term forecasting of the olive oil price.

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

forecasting
feature selection
technical indicators

olive-oil price
cooperative-competitive
evolutionary algorithms