an efficient chopper amplifier, using a switched gm-c filter technique In this paper, a chopper amplifier built with Gm-C filters that are alternatively turned on and off will be introduced. First, a theoretical framework to estimate the output of a generic switched continuous-time filter in the frequency domain is presented. This study is later employed to determinate the behaviour of the chopper amplifier: transfer function, and noise. Final conclusions and preliminary measurements are presented at the end. Due to its simplicity, the circuit is suitable for example in the field of implantable nerve signal amplification, where ultra low noise and minimal power consumption are mandatory.

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


Reputation-based crowdsourced Wi-Fi topology discovery The ubiquity of Wi-Fi networks, coupled with their anarchic deployment, gives rise to the problem of accurately determining their topology in order to employ it for tuning and optimization. Knowledge of the Wi-Fi topology is particularly important for reconfiguration mechanisms, such as channel assignment and power control schemes, which depend on it to operate. Furthermore, with the advent of WLAN-based positioning schemes, the robustness of the spatial databases where wireless topology is encoded becomes crucial for the accuracy of the respective localization algorithms. In this work, we propose a scheme where monitoring the topology of Wi-Fi deployments is crowdsourced to mobile users, who submit reports about Wi-Fi coverage in their vicinity. However, users cannot be assumed trustworthy. They can engage in fraudulent reporting, which, unless specific countermeasures are in place, can severely impact ones view of the network topology. To this end, we have designed and implemented an architecture for accurate Wi-Fi topology discovery, devising a reputation-based mechanism to tackle realistic and simple to implement (and therefore potentially widespread) attacks. We show analytically and via simulation that, even in the presence of large numbers of attackers, our user-centric scheme significantly outperforms pure infrastructure-based approaches, where monitoring is carried out only by trusted Access Points.

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

wireless networking
security
network management
reputation systems
crowdsourcing
ieee 802.11k


Listing all connected plane triangulations A "rooted" plane triangulation is a plane triangulation with one designated vertex r and one designated edge incident to r on the outer face. In this paper we give a simple algorithm to generate all connected rooted plane triangulations with at most m edges. The algorithm uses O(m) space and generates such triangulations in O(1) time per triangulation without duplications. The algorithm does not output entire triangulations but the difference from the previous triangulation. By modifying the algorithm we can generate all connected (nonrooted) plane triangulations with at most m edges in O(m(3)) time per triangulation.

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

internally maximal plane graphs
reverse search technique


Multifractal modeling of counting processes of long-range dependent network traffic Source traffic streams as well as aggregated traffic flows often exhibit Iona-range-dependent (LRD) properties. In this paper, we study traffic stream through their counting process representation. We first study the condition for the measured LRD traffic, as described by the interarrival time and packet size sequences, to be sufficiently well approximated by a synthesized stream formed by recording the counting state of the traffic at the start of each time slot. We then demonstrate that the burstiness of the counting processes is not well characterized by the Hurst parameter. We model a counting process by constructing a multiplicative multifractal process, which contains only one or two parameters. We study the LRD property of such processes, and show that the model has well-defined burstiness descriptors, and are easy to construct. We consider a single server queueing system, which is loaded, on one hand, by the measured processes, and, on the other hand, by properly parameterized multifractal processes. In comparing the system-size tail distributions, we demonstrate our model to effectively track the behavior exhibited by the system driven by the actual traffic processes. Our study may help resolve a hot debate on the modeling of an often used trace of VBR video traffic. (C) 2001 Elsevier Science B.V. Ail rights reserved.

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

network traffic modeling
long-range-dependence
lan, wan, www, and vbr video traffic


Interhemispheric effects on map organization following simulated cortical lesions During recent years there has been increasing use of neural models to investigate the implications of hypotheses about brain and cognitive disorders. Here we systematically study the effects of sudden simulated lesions on cortical maps in a neural model consisting of left and right hemispheric regions connected by a corpus callosum. The model identifies conditions under which damage to one hemispheric region leads to reorganization of the contralateral, intact hemispheric region. The intact hemispheres participation in the recovery process is found to be a function of pre-existing map lateralization/symmetry and lesion size, indicating that interpretation of future experimental work should take these factors into account.

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


Agent-based modelling and simulation for the analysis of social patterns Agent-based modelling facilitates the implementation of tools for the analysis of social patterns. This comes from the fact that agent related concepts allow the representation of organizational and behavioural aspects of individuals in a society and their interactions. An agent can characterize an individual with capabilities to perceive and react to events in the environment, taking into account its mental state (beliefs, goals), and to interact with other agents in its social environment. There are already tools to perform agent-based social simulation but these are usually hard to use by social scientists, as they require a good expertise in computer programming. In order to cope with such difficulty, we propose the use of agent-based graphical modelling languages, which can help to specify social systems as multi-agent systems in a more convenient way. This is complemented with transformation tools to be able to analyse and derive emergent social behavioural patterns by using the capabilities of existing simulation platforms. In this way, this framework can facilitate the specification and analysis of complex behavioural patterns that may emerge in social systems.

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

social simulation
behavioural patterns
social patterns

agent-based modelling
agent-based simulation


Agents, games and HLA ? Over the past decade, there has been a growing interest in utilising intelligent agents in computer games and virtual environments. At the same time, computer game research and development has increasingly drawn on technologies and techniques originally developed in the large scale distributed simulation community, such as the HLA IEEE standard for simulator interoperability. In this paper, we address a central issue for HLA-based games, namely the development of HLA-compliant game agents. We present hla_agent, an HLA-compliant version of the sim_agent toolkit for building cognitively rich agents. We outline the changes necessary to the sim_agent toolkit to allow integration with the HLA, and show that, given certain reasonable assumptions, all necessary code can be generated automatically from the FOM and the object class publications and subscriptions. The integration is transparent in the sense that the existing sim_agent code runs unmodified and the agents are unaware that other parts of the system are running remotely. We present some preliminary performance results, which indicate that the overhead introduced by the HLA extension is modest even for lightweight agents with limited computational requirements.

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

agent-based systems
high level architecture


The 4-source photometric stereo technique for three-dimensional surfaces in the presence of highlights and shadows We present an algorithm for separating the local gradient information and Lambertian color by using 4-source color photometric stereo in the presence of highlights and shadows. We assume that the surface reflectance can be approximated by the sum of a Lambertian and a specular component. The conventional photometric method is generalized for color images. Shadows and highlights in the input images are detected using either spectral or directional cues and excluded from the recovery process, thus giving more reliable estimates of local surface parameters.

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


A process-oriented methodology for evaluating the impact of IT: A proposal and an application in healthcare We propose a process-oriented methodology for evaluating the impact of IT. The methodology is based on process mining and discrete event simulation. The proposed methodology can be applied to complex and distributed business processes. The methodology is illustrated using a detailed dental case study.

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

discrete event simulation
process mining

business process simulation
digital dentistry


Least squares twin support vector machine classification via maximum one-class within class variance A twin support vector machine (TWSVM), as an effective classification tool, tries to find two non-parallel planes that can be produced by solving two quadratic programming problems (QPPs). The QPPs lead to higher computational costs. The least squares twin SVM (LSTSVM), as a variant of TWSVM, attempts to avoid the above deficiency and obtain two non-parallel planes directly by solving two sets of linear equations. Both TWSVM and LSTSVM operate directly on patterns using two optimizations with constraints and, respectively, use such constraints to estimate the distance between each plane for its own class and patterns of other classes. However, such approaches weaken the geometric interpretation of the generalized proximal SVM (GEPSVM) so that in many Exclusive Or examples for different distributions, they may obtain the worse classification performance. Moreover, in addition to failing to discover the local geometry inside the samples, they are sensitive to outliers. In this paper, inspired by several geometrically motivated learning algorithms and the advantages of LSTSVM, we first propose a new classifier, called LSTSVM classification via maximum one-class within-class variance (MWSVM), which is specially designed for avoiding the aforementioned deficiencies and keeping the advantages of LSTSVM. The new method directly incorporates the one-class within-class variance to the classifier, such that it is expected that the genuine geometric interpretation of GEPSVM can be kept in LSTSVM. Undoubtedly, like LSTSVM, MWSVM may lead to a worse classification performance in many cases, especially when the outliers are present. Therefore, a localized version (LMWSVM) of MWSVM is further proposed to remove the outliers effectively. Another advantage of LMWSVM is that it takes the nearby points which are closest to each other as a training set, such that the MWSVM classifier is determined by smaller size of training samples than that of LSTSVM. Naturally, it can reduce the storage space of LSTSVM, especially when extended to nonlinear cases. Experiments carried out on both toy and real-world problems disclose the effectiveness of both MWSVM and LMWSVM.

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

non-parallel plane classifiers
within-class variance


A moment-method characterization of V-Koch fractal dipole antennas This article compares input impedances and radiation characteristics of half wavelength Koch fractal Velectric dipoles having included angles 60, 90 and 120. The study considers three structures. In the 1st structure the Koch arms open into the V-region, in 2nd structure they open away from the V-region and in the third structure, one arm opens into and the other away from the V-region. A first iteration, structure 1 of V-Koch electric dipole antenna with included angle of 120 was fabricated and the experimental return loss was in good agreement with simulation. At their first resonances the antennas gain and input resistance decrease with decrease in included angles, an observation synonymous to Euclidian electric dipoles. In terms of gain, the first structure is found to give better performance than the other two. For this structure, the pattern distortion at the second resonance was also less compared to the other structures.

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


On pinning synchronisability of complex networks with arbitrary topological structure This article aims to investigate the pinning synchronisability of complex networks under arbitrary topological structures with a focus on the case with directed graph topology. More specifically, we explore the necessary and sufficient conditions on choosing the pinned nodes to guarantee the pinning synchronisability of complex networks. It is found that the pinning synchronisability of complex networks relies totally on the way to pin the nodes as long as the coupling strength is large enough. Furthermore, it is proven that the entire network can synchronise exponentially fast. The least synchronisation speed can be specified as well. Finally, based on the theoretical findings proposed in this article, we provide the specific procedures for finding a least number of pinned nodes to realise the pinning synchronisability of complex networks.

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

complex networks
pinning synchronisability
topological structure
least synchronisation speed

linearly and nonlinearly coupled networks


All capacities modular cost survivable network design problem using genetic algorithm with completely connection encoding We study the survivable network design problem (SNDP) for simultaneous unicast and anycast flows in networks where the link cost follows All Capacities Modular Cost (ACMC) model. Given a network modeled by a connected, undirected graph and a set of flow demands, this problem aims at finding a set of connections with a minimized network cost in order to protect the network against any single failure. This paper proposes a new Genetic Algorithm with an efficient encoding to solve the SNDP in networks with ACMC model (A-SNDP). Our encoding scheme is simple and allows large search space. Extensive simulation results on real large topology instances show that the proposed algorithm is much more efficient than the Tabu Search and other conventional Genetic Algorithm in terms of minimizing the network cost.

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

survivable network design
all capacities modular cost
anycast
unicast
genetic algorithm


A practical constitutive model for AZ31B Mg alloy sheets with unusual stressstrain response A practical constitutive model representing yielding asymmetry and anisotropy of Mg alloys is proposed. The model is formulated and implemented in the sheet forming oriented FE software by user subroutine. The unique concave-up and sigmoidal stressstrain curves during in-plane cyclic loadings of AZ31B Mg sheets could be exactly reproduced.

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

twining/untwining
tension/compression loading
user-defined material subroutine
pam-stamp


architecture and information technology as factors in surgical suite information sharing and coordination Scheduling surgeries in hospitals is one of the most challenging activities for surgical staff. Schedule changes occur as often as every few moments, affecting necessary coordination of tasks, resources, and people within and across staff groups, and the stress people feel. In prior fieldwork at four sites, we observed that the physical layout of hallways and rooms, and barriers and spaces around schedule displays and key coordinators, affected information sharing and coordination of the surgery schedule. To generalize beyond the sites studied, we conducted a survey of 135 surgical suite directors across the USA. Our findings suggest how the architecture of the physical space and information availability and practices influence information sharing and coordination outcomes. Visual access between the shared surgery schedule display and the nursing control desk influenced whether staff groups congregated around schedule boards. Traffic-free areas around the surgery schedule display and up-to-date surgery schedule display information reduced coordination stress. We discuss implications for information practices and new information technology in hospital settings.

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

physical environment
whiteboards
electronic scheduling
shared displays


A

simulation

study

on

the

effect

of

channel

thickness

on

the

characteristics

of

Ga0.52In0.48P/In0.2Ga0.8As/Ga0.52In0.48P

DH-pHEMT

The

dc

performance

of

a

double

heterojunction

pseudomorphic

high

electron

mobility

transistor

(DH-pHEMT)

grown

on

GaAs

substrate

has

been

simulated

using

a

two-dimensional

device

simulator,

to

investigate

the

dependence

of

the

intrinsic

and

extrinsic

transconductance

on

the

device

channel

thickness.

The

electron

sheet

concentration

values

for

different

channel

thicknesses

have

been

calculated

using

an

analytical

model,

and

correspond

very

well

to

Hall

effect

measurements

of

the

electron

mobility.

Simulation

results

reveal

that

the

optimum

channel

thickness

for

maximum

intrinsic

transconductance

is

between

and

while

there

is

no

significant

difference

in

the

maximum

extrinsic

transconductance

for

channel

thicknesses

between

and

This

is

due

to

a

trade-off

between

electron

sheet

concentration

and

gate-to-channel

separation.

In

addition,

narrow

channels

give

larger

effective

band

gap

due

to

energy

quantization,

which

could

contribute

to

an

optimum

design

for

DH-pHEMTs.

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

channel thickness
gaas substrate
transconductance


Improvement on the accuracy of the polynomial form extrapolation model in distributed virtual environment In this paper, we studied the relationship between the accuracy of the extrapolating data and the update interval in a distributed virtual environment (DVE). Based on the properties of the polynomial models, we proposed the new method to extrapolate the attribute data which arrives at a discrete time period. Theoretical models were formulated and showed that the average error of the proposed method is less than that of current methods. Finally, we confirmed that the proposed method can improve the accuracy in comparison with current methods by conducting experiments with the motion of a pen for a series of letters written by a human.

O O O O O O O O B O O B I I O O O O O O O O O O O O O O O O B I O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 virtual environment
update interval
extrapolation


The throughput of hybrid-ARQ protocols for the Gaussian collision channel In next-generation wireless communication systems, packet-oriented data transmission will be implemented in addition to standard mobile telephony. We take an information-theoretic view of some simple protocols for reliable packet communication based on "Hybrid-ARQ," over a slotted multiple-access Gaussian channel with fading and study their throughput (total bit per second per hertz) and average delay under idealized but fairly general assumptions, As an application of the renewal-reward theorem, we obtain closed-form throughput formulas. Then, we consider asymptotic behaviors with respect to various system parameters. The throughput of automatic retransmission request (ARQ) protocols is compared to that of code division multiple access (CDMA) with conventional decoding. Interestingly, the ARQ systems are not interference-limited even if no multiuser detection or joint decoding is used, as opposed to conventional CDMA.

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

information theory
multiuser systems
packet radio
wireless communications


Recovery from control plane failures in the RSVP-TE signaling protocol The Resource Reservation Protocol for Traffic Engineering (RSVP-TE) must recover its state after a control plane failure so that the established connections in the data plane continue to be provided full services, are not disrupted by new connection setup requests, and survive any data plane failures. We outline the RSVP-TE Graceful Restart (GR) mechanism defined by the IETF. In this paper, we provide a comprehensive survey of the information that may be carried by RSVP-TE signaling messages when a connection is to be established and the state information that is stored in an RSVP-TE signaling module. We then propose an enhancement for RSVP-TE GR to alleviate the requirement of local recovery of the data plane state. Our proposal includes a two-step RSVP-TE state recovery, which uses a fast recovery to recover the RSVP-TE state in which labels were idle before a control plane failure and a detailed recovery to recover all of the RSVP-TE state. The fast RSVP-TE state recovery is realized as an extension to the RSVP-TE Hello mechanism, allowing a restarting node to process new connection setup requests as quickly as possible without interfering with existing connections. The detailed RSVP-TE state recovery generally follows RSVP-TE GR with minor modifications that can be performed in the background in parallel with normal RSVP-TE operations for connection setup and removal. Our performance evaluations show that our proposal shortens the waiting time for new connection setups being processed by a restarting node. Crown Copyright (C) 2011 Published by Elsevier B.V. All rights reserved.

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

gmpls control plane
rsvp-te
control plane failure recovery


Parallel frequent itemset mining using systolic arrays Since extraction of frequent itemsets from a transaction database is crucial to several data mining tasks such as association rule generation, so frequent itemset mining is one of the most important concepts in data mining. One of the major problems in frequent itemset mining is the explosion of the number of results which is directly effecting on the execution time of itemset mining algorithms. To address this problem, closed itemsets have been proposed, which provides concise lossless representations of the original collection of frequent itemsets. Henceforth, the frequencies of all itemsets in the original collection can be reconstructed from the reduced collection. However, the reduction provided by this exact method is not sufficient to solve the pattern explosion problem, mainly because of high dimensional datasets which have large number of items in each transaction. Colossal itemset mining is another solution to reduce the output size which will not be useful if the set of all frequent itemsets have been required. Higher level of performance improvement can be obtained from efficient scalable parallel mining methods. In this paper we represent an efficient scalable parallel algorithm using systolic arrays to conduct mining of frequent itemsets in very large, such as high dimensional, datasets. In our algorithm, we use a bit matrix to compress the dataset and mapping the mining algorithm on the systolic arrays architecture. For this purpose, each transaction of dataset represents as a row in the bit matrix. We use this bit matrix structure to model the pattern mining as a systolic array problem. Our experimental results and performance study show that this algorithm outperforms substantially the best previously developed parallel algorithms.

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

itemset mining
systolic arrays
bit matrix

frequent pattern mining
parallel pattern mining


Two Sources Are Better than One for Increasing the Kolmogorov Complexity of Infinite Sequences The randomness rate of an infinite binary sequence is characterized by the sequence of ratios between the Kolmogorov complexity and the length of the initial segments of the sequence. It is known that there is no effective procedure that transforms one input sequence into another sequence with higher randomness rate. By contrast, we display such a uniform effective procedure having as input two independent sequences with positive but arbitrarily small constant randomness rate. Moreover the transformation is a truth-table reduction and the output has randomness rate arbitrarily close to 1.

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


Applying data mining techniques for spatial distribution analysis of plant species co-occurrences We used association rules for extracting patterns of co-occurrences. We obtained pairs and groups of species with positive and negative correlation. One multiscale, spatially explicit and multi-species method was proposed. Data mining can be useful to produce lists of species with co-occurrences.

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

data analysis
knowledge management applications
knowledge discovery


Linear Stability via Lyapunov Exponents in Electrical Power Systems This paper deals with linear systems under sustained random perturbations. The stochastic perturbation model is given by a bounded Markov diffusion process, as it appears, e. g., in the description of load or generation uncertainties of power systems. For such systems, the Lyapunov exponents describe necessary and sufficient conditions for almost sure asymptotic stability. The present article reviews several numerical methods for the computation of Lyapunov exponents and applies this methodology to international test systems: four machines - ten bus and ten machines-thirty nine bus.

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

small signal stability
stochastic systems


dynamic window based multihop authentication for wsn Per-hop authentication is the most effective way to prevent DOS attacks during multihop data delivery. Although the study results show that Public Key Cryptography (PKC) is feasible on sensor nodes with limited resources, it is still very expensive to perform per-hop authentication using public key digital signature. To solve the problem that the resources of WSN is exhausted quickly by PKC, Dynamic Window Based Multihop Authentication(DWMA) for WSN is proposed in this paper. Dynamic window makes it possible to pay only a small number of authentication based on digital signature for confining DoS attacks effectively in a small scope and locating suspicious nodes quickly. Experimental results show that DWMA could save more resources than per-hop authentication for WSN, defend DoS attacks effectively and locate malicious nodes. It's an effective protocol for ensuring the resistance of DoS in routing.

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

multihop authentication
dynamic window
dos


Analysis of average burst-assembly delay and applications in proportional service differentiation In Optical Burst-Switched (OBS) networks, the limitation of optical buffering devices make it impractical to deploy conventional delay-based differentiation algorithms such as Active Queue Management, Weighted Fair Queuing, etc. Furthermore, only the delay that appears due to the burst-assembly process constitutes a variable quantity (all the other sources of delay are mostly fixed), it is then reasonable to make use of the burst-assembly algorithm to provide class-based delay differentiation. The aim of the following study is twofold: first it defines an average assembly delay metric, which represents the assembly delay experienced by a random arrival at the burst assembler of an edge OBS node; and second, this metric is used to define and configure a two-class burst-assembly policy, which gives preference to high-priority traffic over low-priority packet arrivals. The results show that, (1) tuning the parameters of the two-class assembly algorithm, the two classes of traffic exhibit different burst-assembly delay; and, (2) such parameters can be adjusted to provide a given differentiation ratio in the light of the proportional QoS differentiation approach proposed in the literature. A detailed analysis of the two-class assembly algorithm is given, along with an exhaustive set of experiments and numerical examples that validate the equations derived.

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

proportional delay-based service differentiation


Modelling spatio-temporal movement of tourists using finite Markov chains This paper presents a novel method for modelling the spatio-temporal movements of tourists at the macro-level using Markov chains methodology. Markov chains are used extensively in modelling random phenomena which results in a sequence of events linked together under the assumption of first-order dependence. In this paper, we utilise Markov chains to analyse the outcome and trend of events associated with spatio-temporal movement patterns. A case study was conducted on Phillip Island, which is situated in the state of Victoria, Australia, to test whether a stationary discrete absorbing Markov chain could be effectively used to model the spatio-temporal movements of tourists. The results obtained showed that this methodology can indeed be effectively used to provide information on tourist movement patterns. One significant outcome of this research is that it will assist park managers in developing better packages for tourists, and will also assist in tracking tourists' movements using simulation based on the model used. (C) 2008 IMACS. Published by Elsevier B.V. All tights reserved.

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

modelling
finite markov chains
movements
tourists


Experimental study of stochastic noise propagation in SPECT images reconstructed using the conjugate gradient algorithm Thanks to an experimental study based on simulated and physical phantoms, the propagation of the stochastic noise in slices reconstructed using the conjugate gradient algorithm has been analysed versus iterations. After a first increase corresponding to the reconstruction of the signal, the noise stabilises before increasing linearly with iterations. The level of the plateau as well as the slope of the subsequent linear increase depends on the noise in the projection data.

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


a methodology for quality-based mashup of data sources The concept of mashup is gaining tremendous popularity and its application can be seen in a large number of domains. Enterprises using and relying upon mashup have improved their mass collaboration and personalization. In order for mashup technology to be widely accepted and widely used, we need a methodology by which can make use of the quality of the input to the mashup process as a governing principle to carry out mashup. This paper reviews the concept of mashup in different domains and proposes a conceptual solution framework for providing quality based mashup process.

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


Learnable tabu search guided by estimation of distribution for maximum diversity problems This paper presents a learnable tabu search (TS) guided by estimation of distribution algorithm (EDA), called LTS-EDA, for maximum diversity problem. The LTS-EDA introduces knowledge model and can extract knowledge during the search process of TS, and thus it adopts dual or cooperative evolution/search structure, consisting of probabilistic model space in clustered EDA and solution space searched by TS. The clustered EDA, as a learnable constructive method, is used to create a new starting solution, and the simple TS, as an improvement method, attempts to improve the solution created by the clustered EDA in the LTS-EDA. A distinguishing feature of the LTS-EDA is the usage of the clustered EDA with effective linkage learning to guide TS. In the clustered EDA, different clusters (models) focus on different substructures, and the combination of information from different clusters (models) effectively combines substructures. The LTS-EDA is tested on 50 large size benchmark problems with the size ranging from 2,000 to 5,000. Simulation results show that the LTS-EDA is better than the advanced algorithms proposed recently.

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

tabu search
estimation of distribution
linkage learning
maximum diversity problem


Neural network classification of homomorphic segmented heart sounds A novel method for segmentation of heart sounds (HSs) into single cardiac cycle (S1-Systole-S2-Diastole) using homomorphic filtering and K-means clustering is presented. Feature vectors were formed after segmentation by using Daubechies-2 wavelet detail coefficients at the second decomposition level. These feature vectors were then used as input to the neural networks. Grow and Learn (GAL) and Multilayer perceptron-Backpropagation (MLP-BP) neural networks were used for classification of three different HSs (Normal, Systolic murmur and Diastolic murmur). It was observed that the classification performance of GAL was similar to MLP-BP. However, the training and testing times of GAL were lower as compared to MLP-BP. The proposed framework could be a potential solution for automatic analysis of HSs that may be implemented in real time for classification of HSs.

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

multilayer perceptron-backpropagation neural network


A Lagrangean heuristic for a two-echelon storage capacitated lot-sizing problem In this paper, we study a structure issued from a real case. Raw materials (RMs) are sent by suppliers to a distribution center (DC) and then transported to a unique plant where they can be stored. The inventory capacity is limited in the plant as well as in the DC. The transportation capacity between the DC and the plant is also limited. The objective is to determine the flows between suppliers and the DC, and from the DC to the plant in order to satisfy the demand during the planning horizon while minimizing the global cost. A mixed-integer programming (MIP) formulation is presented and a Lagrangean relaxation solution procedure is proposed. Computational experiments are carried out.

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


proportional response dynamics leads to market equilibrium One of the main reasons of the recent success of peer to peer (P2P)file sharing systems such as BitTorrent is their built-in tit-for-tat mechanism. In this paper, we model the bandwidth allocation in a P2P system as an exchange economy and study a tit-for-tat dynamics, namely the proportional response dynamics, in this economy. In aproportional response dynamics each player distributes its good to its neighbors proportional to the utility it received from them in thelast period. We show that this dynamics not only converges but converges to a market equilibrium, a standard economic characterization of efficient exchanges in a competitive market. In addition, for some classes of utility functions we consider, it converges much faster than the classical tat process and any existingalgorithms for computing market equilibria. As a part of our proof we study the double normalization of a matrix, an operation that linearly scales the rows of a matrix sothat each row sums to a prescribed positive number, followed by a similar scaling of the columns. We show that the iterative double normalization process of any non-negative matrix always converges. This complements the previous studies in matrix scaling that has focused on the convergence condition of the process when the row and column normalizations are considered as separate steps.

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

peer to peer sharing
proportional response dyanmics
matrix equilibrium


Measurement of disproportionality in proportional representation systems Nineteen indices characterizing the disproportionality in a parliament are studied. A classification of these indices is suggested, and computational experiments and an axiomatic approach are used to study their properties. Effects of the number of parties and the degree of disproportionality are considered. The indices are evaluated for parliamentary elections ( 1995 - 2007) in Russia. (C) 2008 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


Graph rigidity, cyclic belief propagation, and point pattern matching A recent paper [1] proposed a provably optimal polynomial time method for performing near-isometric point pattern matching by means of exact probabilistic inference in a chordal graphical model. Its fundamental result is that the chordal graph in question is shown to be globally rigid, implying that exact inference provides the same matching solution as exact inference in a complete graphical model. This implies that the algorithm is optimal when there is no noise in the point patterns. In this paper, we present a new graph that is also globally rigid but has an advantage over the graph proposed in [1]: Its maximal clique size is smaller, rendering inference significantly more efficient. However, this graph is not chordal, and thus, standard Junction Tree algorithms cannot be directly applied. Nevertheless, we show that loopy belief propagation in such a graph converges to the optimal solution. This allows us to retain the optimality guarantee in the noiseless case, while substantially reducing both memory requirements and processing time. Our experimental results show that the accuracy of the proposed solution is indistinguishable from that in [1] when there is noise in the point patterns.

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

point pattern matching
belief propagation

graph matching
graphical models
global rigidity
chordal graphs


Patent strategy in Chinese universities: a comparative perspective Patenting and licensing is not only a significant method of university knowledge transfer, but also an important indicator for measuring academic R&D strength and knowledge utilization. The methodologies of quantitative and qualitative analysis, including a special patent h-index indicator to assess patenting quality, were used to examine university patenting worldwide. Analysis of university patenting from 1998 to 2008 showed a significant overall global increase in which Chinese academia stands out: most of the top 20 universities in patenting in 2008 were in China. However, a low rate of utilization of Chinese academic patents may have roots in: (1) university research evaluation system encourages the patent production more, rather than the utilization; (2) problems in the formal mechanisms for university technology transfer and licensing, (3) industrys limited expectation and receptive capabilities and/or (4) a mismatch between the interests of the two institutional spheres. The next action to be taken by government, university and industry in China will be to explore strategies for improving academic patent quality and industry take-up.

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

university patenting
university technology transfer

patentometric
patent quality strategy
academic patent industrialization


A Novel Algorithm for View and Illumination Invariant Image Matching The challenges in local-feature-based image matching are variations of view and illumination. Many methods have been recently proposed to address these problems by using invariant feature detectors and distinctive descriptors. However, the matching performance is still unstable and inaccurate, particularly when large variation in view or illumination occurs. In this paper, we propose a view and illumination invariant image-matching method. We iteratively estimate the relationship of the relative view and illumination of the images, transform the view of one image to the other, and normalize their illumination for accurate matching. Our method does not aim to increase the invariance of the detector but to improve the accuracy, stability, and reliability of the matching results. The performance of matching is significantly improved and is not affected by the changes of view and illumination in a valid range. The proposed method would fail when the initial view and illumination method fails, which gives us a new sight to evaluate the traditional detectors. We propose two novel indicators for detector evaluation, namely, valid angle and valid illumination, which reflect the maximum allowable change in view and illumination, respectively. Extensive experimental results show that our method improves the traditional detector significantly, even in large variations, and the two indicators are much more distinctive.

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

feature detector evaluation
valid angle (va)
valid illumination (vi)


the power of two min-hashes for similarity search among hierarchical data objects In this study we propose sketching algorithms for computing similarities between hierarchical data. Specifically, we look at data objects that are represented using leaf-labeled trees denoting a set of elements at the leaves organized in a hierarchy. Such representations are richer alternatives to a set. For example, a document can be represented as a hierarchy of sets wherein chapters, sections, and paragraphs represent different levels in the hierarchy. Such a representation is richer than viewing the document simply as a set of words. We measure distance between trees using the best possible super-imposition that minimizes the number of mismatched leaf labels. Our distance measure is equivalent to an Earth Mover's Distance measure since the leaf-labeled trees of height one can be viewed as sets and can be recursively extended to trees of larger height by viewing them as set of sets. We compute sketches of arbitrary weighted trees and analyze them in the context of locality-sensitive hashing (LSH) where the probability of two sketches matching is high when two trees are similar and low when the two trees are far under the given distance measure. Specifically, we compute sketches of such trees by propagating min-hash computations up the tree. Furthermore, we show that propagating one min-hash results in poor sketch properties while propagating two min-hashes results in good sketches.

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


Who leads research productivity growth? Guidelines for R&D policy-makers This paper evaluates to what extent policy-makers have been able to promote the creation and consolidation of comprehensive research groups that contribute to the implementation of a successful innovation system. Malmquist productivity indices are applied in the case of the Spanish Food Technology Program, finding that a large size and a comprehensive multi-dimensional research output are the key features of the leading groups exhibiting high efficiency and productivity levels. While identifying these groups as benchmarks, we conclude that the financial grants allocated by the program, typically aimed at small-sized and partially oriented research groups, have not succeeded in reorienting them in time so as to overcome their limitations. We suggest that this methodology offers relevant conclusions to policy evaluation methods, helping policy-makers to readapt and reorient policies and their associated means, most notably resource allocation (financial schemes), to better respond to the actual needs of research groups in their search for excellence (micro-level perspective), and to adapt future policy design to the achievement of medium-long term policy objectives (meso and macro-level).

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


SPC: Fast and Efficient Scalable Predictive Coding of Animated Meshes Animated meshes are often represented by a sequence of static meshes with constant connectivity. Due to their frame-based representation they usually occupy a vast amount of bandwidth or disk space. We present a fast and efficient scalable predictive coding (SPC) scheme for frame-based representations of animated meshes. SPC decomposes animated meshes in spatial and temporal layers which are efficiently encoded in one pass through the animation. Coding is performed in a streamable and scalable fashion. Dependencies between neighbouring spatial and temporal layers are predictively exploited using the already encoded spatio-temporal neighbourhood. Prediction is performed in the space of rotation-invariant coordinates compensating local rigid motion. SPC supports spatial and temporal scalability, and it enables efficient compression as well as fast encoding and decoding. Parts of SPC were adopted in the MPEG-4 FAMC standard. However, SPC significantly outperforms the streaming mode of FAMC with coding gains of over 33%, while in comparison to the scalable FAMC, SPC achieves coding gains of up to 15%. SPC has the additional advantage over FAMC of achieving real-time encoding and decoding rates while having only low memory requirements. Compared to some other non-scalable state-of-the-art approaches, SPC shows superior compression performance with gains of over 16% in bit-rate.

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

mesh compression
real-time
low complexity


Architectural Approaches for HL7-based Health Information Systems Implementation Objective: Information systems integration is hard, especially when semantic and business process interoperability requirements need to be met. To succeed, a unified methodology, approaching different aspects of systems architecture such as business, information, computational, engineering and technology viewpoints, has to be considered. The paper contributes with an analysis and demonstration on how the HL7 standard set can support health information systems integration. Methods: Based on the Health Information Systems Development Framework (HIS-DF), common architectural models for HIS integration are analyzed. The framework is a standard-based, consistent, comprehensive, customizable, scalable methodology that supports the design of semantically interoperable health information systems and components. Results: Three main architectural models for system integration are analyzed: the point to point interface, the messages server and the mediator models. Point to point interface and messages server models are completely supported by traditional HL7 version 2 and version 3 messaging. The HL7 v3 standard specification, combined with service-oriented, model-driven approaches provided by HIS-DF, makes the mediator model possible. The different integration scenarios are illustrated by describing a proof-of-concept implementation of an integrated public health surveillance system based on Enterprise Java Beans technology. Conclusion: Selecting the appropriate integration architecture is a fundamental issue of any software development project. HIS-DF provides a unique methodological approach guiding the development of healthcare integration projects. The mediator model offered by the HIS-DF and supported in HL7 v3 artifacts is the more promising one promoting the development of open, reusable, flexible, semantically interoperable, platform-independent, service-oriented and standard-based health information systems.

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

system architectures
semantic interoperability
middleware
j2ee


Point cloud to CAD model registration methods in manufacturing inspection Modern computer vision and coordinate metrology systems provide an ever-increasing flow of information from the physical world we live in to the virtual world inside computer systems. Often the coordinate system of the metrology device has a different coordinate frame from that of the existing objects in the virtual world. To rectify these differences, a process called registration is often applied. This paper uses a case study to highlight the the differences between various registration techniques.

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


A selective DVS technique based on battery residual Conventional research on DVS assumes that the battery, which is the power source of most mobile devices, provides constant power; the battery, however, has unique discharge characteristics due to its chemical properties. Based on the residual characteristics of the battery, this paper presents a practical approach towards a battery-aware DVS mechanism that can easily be applied to conventional operating systems. The proposed policy monitors the battery residual in runtime, classifies the current battery state as one of threethe recovery effect region, the rate capacity region and the alarm regionthen applies a suitable DVS algorithm according to each region, which takes advantage of the underlying battery characteristics. Experiments on commercial PDAs (iPAQ5550 and Zaurus SL-860 PDA) running MPEG applications showed that our policy significantly extends the battery lifetime, compared to the conventional DVS method, with only a marginal QoS degradation.

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

power management
dvs policy
battery monitoring


A multiresolution diffused expectationmaximization algorithm for medical image segmentation In this paper a new method for segmenting medical images is presented, the multiresolution diffused expectation-maximization (MDEM) algorithm. The algorithm operates within a multiscale framework, thus taking advantage of the fact that objects/regions to be segmented usually reside at different scales. At each scale segmentation is carried out via the expectationmaximization algorithm, coupled with anisotropic diffusion on classes, in order to account for the spatial dependencies among pixels. This new approach is validated via experiments on a variety of medical images and its performance is compared with more standard methods.

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

image segmentation
expectationmaximization
multiresolution


A note on clustering the functionally-related paralogues and orthologues of proteins: a case of the FK506-binding proteins (FKBPs) The expression patterns of 18 FK506-binding proteins (FKBPs) encoded in the human genome have been established whereas the functional significance of the numerous ORFs coding for FKBP-like sequences remains unknown. Nominal masses of the human FKBPs vary from 12 to 135kDa. Some large FKBPs consist up to four repeats of the 12kDa FK506-like binding domain (FKBD) whereas other large FKBPs contain one FKBD linked to different functional domains such as TPRs, leucine-zipper, calmodulin-binding domain etc. The genomes of other eukaryotic organisms, namely D. melanogaster, C. elegans, A. thaliana, S. pombe and S. cerevisiae encode different numbers of the FKBPs paralogues some of which are orthologues to the human FKBPs. A library of novel algorithms was developed and used for computation of the level of conservation of the hydrophobicity and bulkiness profiles, and the amino acid compositions (AACs) of 247 aligned sequences of FKBPs. The pairwisely-compared hydrophobicity and bulkiness profiles for some combinations of the aligned sequences of the FKBDs yielded high values of the correlation coefficients (CCF). The AACs of some combinations of the aligned sequences of the FKBDs also differed to a low degree. The functionally-related orthologues and paralogues of the FKBPs were clustered by using the following criteria: 1 apparent conservation of the crucial amino acid (AA) residues for peptidylprolyl cis/trans isomerase (PPIase) acitity and binding of some immunosuppressive drugs; 2 convergence of the three mentioned above properties of the polypeptide chain; 3 similarity in the sequence attributes pI and total hydrophobicity index (HI). The clustering method was used for setting up several hypotheses on the emergence of certain classes of the FKBPs in the eukaryotic kingdom.

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

ppiase peptidylprolyl cis/trans isomerase


A learning algorithm for fault tolerant feedforward neural networks A new learning algorithm is proposed to enhance fault tolerance ability of the feedforward neural networks. The algorithm focuses on;he links (weights) that may cause errors at the output when they are open faults. The relevances of the synaptic weights to the output error (i.e. the sensitivity of the output error to the weight fault) are estimated in each training cycle of the standard backpropagation using the Taylor expansion of the output around fault-free weights. Then the weight giving the maximum relevance is decreased. The approach taken by the algorithm described in this paper is to prevent the weights from having large relevances. The simulation results indicate that the network trained with the proposed algorithm do have significantly better fault tolerance than the network trained with the standard backpropagation algorithm. The simulation results show that the fault tolerance and the generalization abilities are improved.

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

feedforward neural network
relevance of synaptic weights
essential link


A new proof of nonexistence of probabilistic quantum cloning machine We give a simple proof of the impossibility of probabilistic exact 1 -> 2 cloning for any three different states of a qubit. The simplicity of the proof is due to the use of a stronger version of no violation of the causality principle. The proof is also extended to higher-dimensional Hilbert space, but for a special ensemble of states.

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


the nist smart data flow system ii multimodal data transport infrastructure Multimodal interfaces require numerous computing devices, sensors, and dynamic networking, to acquire, transport, and process the sensor streams necessary to sense human activities and respond to them. The NIST Smart Data Flow System Version II embodies many improvements requested by the research community including multiple operating systems, simplified data transport protocols, additional language bindings, an extensible object oriented architecture, and improved fault tolerance.

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

data streams
smart spaces
distributed computing


Mid-term electricity market clearing price forecasting: A hybrid LSSVM and ARMAX approach A mid-term electricity MCP forecasting hybrid LSSVM and ARMAX model is proposed. Mid-term electricity MCP forecasting is different from short-term forecasting. The proposed work assumes that all forecasting input data are given. The forecast output contains 720 continuous hourly electricity MCPs. MAE and MSRE are selected for regression computation performance evaluation.

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

auto-regressive moving average with external input (armax)

least squares support vector machine (lssvm)


Effects of term distributions on binary classification In order to support decision making, text classification is an important tool. Recently, in addition to term frequency and inverse document frequency, term distributions have been shown to be useful to improve classification accuracy in multi-class classification. This paper investigates the performance of these term distributions on binary classification using a centroid-based approach. In such one-against-the-rest, there are only two classes, the positive (focused) class and the negative class. To improve the performance, a so-called hierarchical EM method is applied to cluster the negative class. which is usually much larger and more diverse than the positive one, into several homogeneous groups. The experimental results on two collections of web pages, namely Drug Information (DI) and WebKB, show the merits of term distributions and clustering on binary classification. The performance of the proposed method is also investigated using the Thai Herbal collection where the texts are written in Thai language.

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

term distribution
text classification/categorization


An approaching genetic algorithm for automatic beam angle selection in IMRT planning A method named approaching genetic algorithm (AGA) is introduced to automatically select the beam angles for intensity-modulated radiotherapy (IMRT) planning. In AGA, the best individual of the current population is found at first, and the rest of the normal individuals approach the current best one according to some specially designed rules. In the course of approaching, some better individuals may be obtained. Then, the current best individual is updated to try to approach the real best one. The approaching and updating operations of AGA replace the selection, crossover and mutation operations of the genetic algorithm (GA) completely. Using the specially designed updating strategies, AGA can recover the varieties of the population to a certain extent and retain the powerful ability of evolution, compared to GA. The beam angles are selected using AGA, followed by a beam intensity map optimization using conjugate gradient (CG). A simulated case and a clinical case with nasopharynx cancer are employed to demonstrate the feasibility of AGA. For the case investigated, AGA was feasible for the beam angle optimization (BAO) problem in IMRT planning and converged faster than GA.

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

genetic algorithm
conjugate gradient
beam angle optimization


Optimization of ovalround pass design using genetic algorithm The primary purpose of this paper is to propose a computer aided optimal design system to support a generalized ovalround pass design, which is widely used as both intermediate and final passes in the process of rod rolling. This system, which is based on a hybrid model and the genetic algorithm, is developed to improve the efficiency, to reduce the manufacturing errors, as well as to extend the useful life of rolls through uniform wear design. Generalized parametric equations are established for geometrical modeling, graphic plotting of ovalround passes, as well as calculation of the cross section area, contact area and the lengths of contact arcs along the cross section of round groove in the MATLAB programming environment. Moreover, these equations can also realize the parametric transformation between roll profile and mathematical models for the ovalround pass design and optimization. The genetic algorithm is employed for the optimal design of ovalround passes in this paper. The objective functions are formulated for minimization of power consumption in the rolling process, variances between ideal dimensions and design dimensions, as well as variances between the lengths of contact arcs. To reduce the complexity and computational burden of the system, some reliable empirical formulas for the calculations of contact area and contact arc length are applied. Finally, the proposed approach is applied to an ovalround pass design. Through simulation and comparison of results against experimental data acquired from literature, it is found that this system is reliable, effective and easier to use.

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

ovalround pass
rod rolling
hybrid model
genetic algorithm


Second Life: the seventh face of the library? Purpose - The purpose of this paper is to give a brief introduction to Second Life, and to provide an outline of how one academic librarian has got involved with using it and reviews the issues that have arisen from a library perspective. Design/methodology/approach - The paper offers a reflection on whether library activities in Second Life are different from library services in the real world and suggests that Second Life is just another "face" of the library. Findings - Second Life is still in the Very early stages of development. There are various barriers and challenges to overcome before it can be used widely within universities. However, this paper shows it does provide an opportunity to experiment and explore what information resources are required in this environment and how librarianship and librarians need to evolve to cater for users in a three dimensional world. Originality/value - This paper is based on personal experience and offers as many questions as answers.

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

virtual organizations
skills
communication technologies


Stability Analysis and Control of Discrete Type-1 and Type-2 TSK Fuzzy Systems: Part II. Control Design This paper proposes a new control system design methodology for type-1 and type-2 Takagi-Sugeno-Kang (TSK) fuzzy systems that are based on new stability conditions. The stability conditions are discussed in a companion paper (Part I) and are used in the proofs of our main results. A major advantage of the new methodology is that it does not require a common Lyapunov function and is therefore applicable to systems with nonstabilizable consequents. Our controllers include fuzzy type-1 proportional and proportional-integral (PI) controllers, as well as constant state feedback for the same systems. The controller results in an exponentially stable system, and the designer can specify the rate of exponential convergence. The controller designs can be tested by the usage of linear matrix inequalities (LMIs). The design methodology is demonstrated by the usage of simple examples where methods that are based on a common Lyapunov function fail and physical systems where the new methodology provides better performance.

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

feedback control
takagi-sugeno-kang (tsk) systems
type-2 fuzzy systems


Estimation of mean monthly air temperatures in Turkey We model monthly temperature values by MLR, ANN and ANFIS models. Input variables are latitude, longitude, altitude and the month numbers. ANFIS model is found to perform better than the ANN and MLR models.

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

maximum monthly temperature
minimum monthly temperature
mean monthly temperature


A review on computational intelligence methods for controlling traffic signal timing We have a review of applying machine learning methods (ML) for traffic signal timing. Signal timing through ML methods for a single intersection. Using genetic algorithm to determine NN and FLS parameters. Showing the better performance of ML methods compared to the pre-defined method. Showing better performance of proposed NN and FLS controllers compared to QL.

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

q-learning
neural network
fuzzy logic system
isolated intersection


A two dimensional combined discrete and finite element scheme for simulating the flow and compaction of systems comprising irregular particulates The paper describes the development and application of a combined discrete finite element scheme to simulate the flow and compaction of irregular randomly packed particles to form a tabletted product. The techniques which have been adopted to achieve computational efficiency are described. These include contact detection, particle level deformation analysis and the presentation of results via a homogenisation strategy. The computing scheme in question is validated against published data and is shown to be capable of simulating the expected trends associated with the effects of particle shape, size and friction on the flow rate. The flow simulations also exhibit noticeable differences when compared with a geometric packing model. Over the relevant compaction regime, for which elastic behaviour is applicable, the present scheme also compares well with published work that uses a distinct element simulation approach and with experimental data. The advantage of the current scheme is the flexibility that it offers to capture a mixture of material properties and particle shape and that no restrictions are necessary on the contact models since these are integral in the calculation procedures.

O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 element
contact detection
homogenisation


Detecting parametric objects in large scenes by Monte Carlo sampling Point processes constitute a natural extension of Markov random fields (MRF), designed to handle parametric objects. They have shown efficiency and competitiveness for tackling object extraction problems in vision. Simulating these stochastic models is however a difficult task. The performances of the existing samplers are limited in terms of computation time and convergence stability, especially on large scenes. We propose a new sampling procedure based on a Monte Carlo formalism. Our algorithm exploits the Markovian property of point processes to perform the sampling in parallel. This procedure is embedded into a data-driven mechanism so that the points are distributed in the scene in function of spatial information extracted from the input data. The performances of the sampler are analyzed through a set of experiments on various object detection problems from large scenes, including comparisons to the existing algorithms. The sampler is also tested as optimization algorithm for MRF-based labeling problems.

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

monte carlo sampling
object detection
large scenes
point processes
markov random fields


Theoretical analysis of a time-frequency-PCNN auditory cortex model A particular pulsed neural model of the auditory cortex, the Time-Frequency Pulse Coupled Neural Network (TF-PCNN), has shown to decompose its stimulus from the cochlea into characteristic pulse-coded time-frequency (TF) stop and pass regions. A derived sum of spectrograms representation with these zero- or one-valued TF weightings has already been applied for the denoising of speech in a previous work. This decomposition is now related to the concept of TF projection filters, which allows to reinterpret the model equations. The functionality imposed by the model equations can so be accessed and justified from a TF signal processing perspective, in addition to its biological motivation from experimentally observed neurophysiological behavior and simulations.

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

pulsed neural networks
time-frequency analysis
spectro-temporal receptive fields
population coding
sparse neural code


Computer forensics: The modern crime fighting tool The study of computer forensics has quickly emerged and technology used in this type of forensics is being developed quite rapidly. Many public and private companies are using computer forensics on a daily basis, thus creating another area of technological jobs. As swiftly as the field and its importance are growing, many practitioners still remain unaware of computer forensics and its role in the technological world. This paper provides an overview of the relatively new field of computer forensics. The paper also illustrates why, in the wake of 9-11 and other terrorist acts, the research and development of computer forensics is of international importance.

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

anadisk
bait
computer fraud and abuse act
computer investigative specialists
ctin
dirt
electronic communications privacy act
fourth amendment
g8
htcia
mirror image
nbi
ph-cert


A new family of four-valued cross correlation between m-sequences of different lengths The cross-correlation function between or-sequences of period 2(m)-1, where or = 6k, and m-sequences of shorter period 2(m/2) -1 is investigated. The first infinite family of pairs of m-sequences with four-valued cross correlation is constructed and the complete correlation distribution of this family is determined.

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

affine polynomials
linearized polynomials
m-sequences


Microgravity Experiments on Phase Change of Self-Rewetting Fluids A series of microgravity experiments on self-rewetting fluids has been conducted at the 10-second drop shaft of the Japan Microgravity Center (JAMIC). In all the experiments, 1.5 wt% of 1-butanol aqueous solution were employed as a self-rewetting fluid. The objective of the first experiment was to observe the boiling behavior of two-dimensional adjacent dual vapor bubbles with the aid of a two-wavelength interferometer and tracer particles. A significant difference was observed between a self-rewetting fluid and a normal fluid (CFC-113 in this experiment) in bubble interaction and flow developed along vapor/bubble interface. The second experiment focused on the flow at the bubble/heater contact area and around the three-phase interline, visualized with tracer particles. Differing behavior among three fluids, 1-butanol aqueous solution, CFC-113, and ethanol aqueous solution, was observed. The last microgravity experiment was a demonstration of wickless heat pipes containing three different fluids as a working fluid, 1-butanol aqueous solution, water, and ethanol aqueous solution. The temperature variation of working fluid in the heat pipe was monitored, and the liquid flow returning from the condensation region to the evaporation region was visualized by tracer particles. In addition to microgravity experiments, the performance of conventional heat pipes with 1-butanol aqueous solution was evaluated on the ground, and compared with water heat pipes. Our preliminary results are presented.

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

boiling phenomena
marangoni effect
aqueous solutions
non-azeotropic mixtures


low power rendezvous in embedded wireless networks In the future, wireless networking will be embedded into a wide variety of common, everyday objects [1]. In many embedded networking situations, the communicating nodes will be very small and battery powered. For this reason, it is crucial that power consumption is as low as possible. A technique for reducing power consumption is to place nodes into a sleep mode whenever possible, and have them occasionally awaken to interact with other nodes. This type of action is referred to as a node rendezvous , and can be used in a variety of different ways.In this paper we consider power-efficient service rendezvous in embedded wireless networks with external triggering. We first define two basic rendezvous mechanisms, namely, server beaconing and client beaconing . We show that server beaconing is preferred when the client arrival rate is below a parameter dependent threshold. Above this level, the use of client beaconing results in lower power consumption. We also consider a hybrid technique whereby server nodes independently select the beaconing mode so that total power consumption is reduced over a wide range of system parameter values. The operation of the client nodes is transparent to this selection.We also introduce the use of adaptive server beaconing . In a static server beaconing system, the optimum beaconing rate is an increasing function of the client loading level. It is shown that by adapting the server beacon rate in an intelligent way, total power consumption can be greatly reduced over a large range of traffic loading conditions. A very simple method is introduced for performing this adaptation.Several other innovations are discussed which can be used to reduce power consumption in embedded networks. We investigate the use of an AC mains-powered rendezvous server for power reduction, and we discuss a distributed power reduction technique referred to as client beacon proxying . It is shown that by performing rendezvous in an intelligent manner, total power consumption may be greatly reduced in many situations.

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

wireless networks
use
reduction
paper
traffic
select
place
threshold
method
power consumption
values
low power
power
distributed
future
server
hybrid
action

communication
network
innovating
intelligence
batteries
object
situated
dependencies
adapt
systems
transparency
functional
power efficiency
embedding


an investigation of decompounding for cross-language patent search Decompounding has been found to improve information retrieval (IR) effectiveness in general domains for languages such as German or Dutch. We investigate if cross-language patent retrieval can profit from decompounding. This poses two challenges: i) There may be few resources such as parallel corpora available for training an machine translation system for a compounding language. ii) Patents have a specific writing style and vocabulary ("patentese"), which may affect the performance of decompounding and translation methods. Experiments on data from the CLEF-IP 2010 task show that decompounding patents for translation can overcome out-of-vocabulary problems (OOV) and that decompounding improves IR performance significantly for small training corpora.

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


Bayesian relevance feedback for content-based image retrieval Despite the efforts to reduce the so-called semantic gap between the user's perception of image similarity and the feature-based representation of images, the interaction with the user remains fundamental to improve performances of content-based image retrieval systems. To this end, relevance feedback mechanisms are adopted to refine image-based queries by asking users to mark the set of images retrieved in a neighbourhood of the query as being relevant or not. In this paper, the Bayesian decision theory is used to estimate the boundary between relevant and non-relevant images. Then, a new query is computed whose neighbourhood is likely to fall in a region of the feature space containing relevant images. The performances of the proposed query shifting method have been compared with those of other relevance feedback mechanisms described in the literature. Reported results show the superiority of the proposed method.

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

relevance feedback
query shifting
bayesian decision theory

image databases
query by content
linear discriminant analysis


Optimal bidding in multiple concurrent auctions In the face of multiple electronic sales sites, buyers can benefit from considering multiple opportunities and devising their purchase strategy to reduce risk and increase expected utility. However, human users cannot approach and rapidly monitor multiple sites. In particular, sites where prices change dynamically such as auction sites pose a major difficulty for human concurrent activity. Even without concurrency, the majority of human users do not have the ability or the resources to compute optimal purchase decisions. Such activities can be performed by computational agents. In this paper, we present mechanisms that allow agents to perform purchases on behalf of users. In particular, we devised methods that allow an agent that faces multiple dynamic sales sites to compute bids that optimize the expected utility of the user, or instead manage the winning probability of the purchase.

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


Semidefinite representation of convex sets Let S = {x is an element of R(n) : g(1)(x) >= 0, ..., g(m)(x) >= 0} be a semialgebraic set defined by multivariate polynomials g(i) (x). Assume S is convex, compact and has nonempty interior. Let S(i) = {x is an element of R(n) : g(i)(x) >= 0}, and partial derivative S (resp. partial derivative S(i) ) be the boundary of S (resp. S(i) ). This paper, as does the subject of semidefinite programming (SDP), concerns linear matrix inequalities (LMIs). The set S is said to have an LMI representation if it equals the set of solutions to some LMI and it is known that some convex S may not be LMI representable (Helton and Vinnikov in Commun Pure Appl Math 60(5):654-674, 2007). A question arising from Nesterov and Nemirovski (SIAM studies in applied mathematics. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, 1994), see Helton and Vinnikov in Commun Pure Appl Math 60(5):654-674, 2007 and Nemirovski in Plenary lecture, International Congress of Mathematicians (ICM), Madrid, Spain, 2006, is: given a subset S of R(n), does there exist an LMI representable set (S) over cap in some higher dimensional space R(n+N) whose projection down onto R(n) equals S. Such S is called semidefinite representable or SDP representable. This paper addresses the SDP representability problem. The following are the main contributions of this paper: (i) assume g(i) (x) are all concave on S. If the positive definite Lagrange Hessian condition holds, i.e., the Hessian of the Lagrange function for optimization problem of minimizing any nonzero linear function l(T) x on S is positive definite at the minimizer, then S is SDP representable. (ii) If each g(i) (x) is either sos-concave ( - del(2) g(i) (x) = W(x) (T) W(x) for some possibly nonsquare matrix polynomial W(x)) or strictly quasi-concave on S, then S is SDP representable. (iii) If each S(i) is either sos-convex or poscurv-convex (S(i) is compact convex, whose boundary has positive curvature and is nonsingular, i.e., del g(i) (x) not equal 0 on partial derivative S(i) boolean AND S), then S is SDP representable. This also holds for S(i) for which partial derivative S(i) boolean AND S extends smoothly to the boundary of a poscurv-convex set containing S. (iv) We give the complexity of Schmudgen and Putinar's matrix Positivstellensatz, which are critical to the proofs of (i)-(iii).

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

schmudgen and putinar's matrix positivstellensatz

positive definite lagrange hessian (pdlh) condition


The computation of CournotNash equilibria for the time-definite freight delivery industry under an oligopolistic market Time-definite freight delivery common carriers provide time-guaranteed door-to-door service for small shipment shippers. For a carrier, the pricing planning problem with inverse demand function requires simultaneous determination of the demand for its service and development of an operating plan to fill the available network capacity in a manner which maximizes its profit. In an oligopolistic market, the CournotNash price equilibrium is all of the carriers achieving the highest individual profit with respect to the market shares and operational plans of the other carriers. This model is applicable to an integral-constrained spatially separated oligopolistic market. We chose the path formulation and proposed a diagonalization algorithm to determine the CournotNash price equilibria. The time-definite freight delivery market in Taiwan was used for numerical testing. The results showed that this approach is suitable for determining the market equilibria for the industry. In addition we discussed the sensitivity on parameters of this approach and the economic implications for carriers.

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

cournotnash price equilibria
oligopolistic market
diagonalization algorithm


An area-efficient universal cryptography processor for smart cards Cryptography circuits for smart cards and portable electronic devices provide user authentication and secure data communication. These circuits should, in general, occupy small chip area, consume low power, handle several cryptography algorithms, and provide acceptable performance. This paper presents, for the first time, a hardware implementation of three standard cryptography algorithms on a universal architecture. The microcoded cryptography processor targets smart card applications and implements both private key and public key algorithms and meets the power and performance specifications and is as small as 2.25 mm(2) in 0.18-mu m 6LM CMOS. A new algorithm is implemented by changing the contents of the memory blocks that are implemented in ferroelectric RAM (FeRAM). Using FeRAM allows nonvolatile storage of the configuration bits, which are changed only when a new algorithm instantiation is required.

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

computer security
microprocessors
smart cards.


Principal whitened gradient for information geometry ? We propose two strategies to improve the optimization in information geometry. First, a local Euclidean embedding is identified by whitening the tangent space, which leads to an additive parameter update sequence that approximates the geodesic flow to the optimal density model. Second, removal of the minor components of gradients enhances the estimation of the Fisher information matrix and reduces the computational cost. We also prove that dimensionality reduction is necessary for learning multidimensional linear transformations. The optimization based on the principal whitened gradients demonstrates faster and more robust convergence in simulations on unsupervised learning with synthetic data and on discriminant analysis of breast cancer data.

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

natural gradient
principal components
riemannian manifold