A series of new circuits based on CFTAs The paper presents a series of basic circuits based on CFTAs (current follower transconductance amplifier), which contain amplifier, lossless integrator, first-order universal current-mode filter, simulation resistor, negative resistance converter, gyrator, capacitor multiplier, and frequency-dependent negative resistance circuit. Having used canonic number of grounded capacitors and resistors, the circuits are easy to be integrated and the parameters of the circuits can be adjusted electronically by tuning bias currents of the CFTAs. It is noted that the results of circuit simulations are in agreement with theory.

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

current-mode circuit
basic applications
cfta


A multi-level ant-colony mining algorithm for membership functions Fuzzy data mining is used to extract fuzzy knowledge from linguistic or quantitative data. It is an extension of traditional data mining and the derived knowledge is relatively meaningful to human beings. In the past, we proposed a mining algorithm to find suitable membership functions for fuzzy association rules based on ant colony systems. In that approach, precision was limited by the use of binary bits to encode the membership functions. This paper elaborates on the original approach to increase the accuracy of results by adding multi-level processing. A multi-level ant colony framework is thus designed and an algorithm based on the structure is proposed to achieve the purpose. The proposed approach first transforms the fuzzy mining problem into a multi-stage graph, with each route representing a possible set of membership functions. The new approach then extends the previous one, using multi-level processing to solve the problem in which the maximum quantities of item values in the transactions may be large. The membership functions derived in a given level will be refined in the subsequent level. The final membership functions in the last level are then outputted to the rule-mining phase to find fuzzy association rules. Experiments are also performed to show the performance of the proposed approach. The experimental results show that the proposed multi-level ant colony systems mining approach can obtain improved results.

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

ant system
ant colony system
fuzzy set
membership function
multi-stage graph


the effect of register-transfer design tradeoffs on chip area and performance This paper describes an experiment to determine how register-transfer tradeoffs affect the resultant silicon area and performance of layouts. Six register-transfer level designs, each performing the same function with different register transfer level structures, were implemented using a library of CMOS/SOS standard cells, and an automatic placement and routing program. The consumption of area and the critical path timing were calculated for each design. The results show that register-transfer design variations do produce changes in area and performance at the layout level. However, optimistic timing analysis at the RT level, variations in relative storage timing across technologies, and omission of fanout and path length delays altered the resultant area and timing from that predicted at the RT level.

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

technologies affect storage design performance layout placement routing timing paper effect

time analysis
standard cell
variation
functional
delay
experience
relation
critic
libraries
change


leveraging behavioral models of sounding objects forgesture-controlled sound design Sound designers and Foley artists have long struggled to create expressive soundscapes using standard editing software, devoting much time for the calibration of multiple sound samples and parameter adjustments. We present an intuitive approach that exploits the capabilities of off-theshelf motion-sensing input devices to enable quick and fluid interaction with sound to trigger and modulate digital sound generators based on adaptable behavioral models of familiar physical sounding objects. Rather than requiring profound technical knowledge of sound design, the system leverages the user's motor memory and motion skills to mimic generic and familiar interactions with everyday sounding objects. This allows the user to fully focus on the expressive act of sound creation while enjoying a fluent workflow and a satisfying user experience.

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

hci
motion gestures
sound effects
foley art
audio editing


Modeling contextual modulation in the primary visual cortex Contextual modulation is a universal phenomenon in the primary visual cortex (V1). It is often allocated to the two categories of suppression and facilitation, which are either weakened or strengthened by the contextual stimuli, respectively. A number of experiments in neurophysiology have elucidated their important functions in visual information processing, such as contour integration, figure-ground segregation, saliency map and so on. A computational model, inspired by visual cortical mechanisms of contextual modulation, is presented in this paper. We first give separate models for surround suppression (SS), collinear facilitation (CF) and cross-orientation facilitation (COF), respectively, then unify them to a mixed model. Model behavior has then been tested using synthetical images and nature images, and is consistent with the data of physiological experimentation. We achieve fine results using the model to extract salient structures and contours from images. This work develops a computational model, using the perceptual mechanisms in V1, and provides a biologically plausible strategy for computer vision.

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

contextual modulation
primary visual cortex
computational model
surround suppression
collinear facilitation


Comparison of kinetic theory and discrete element schemes for modelling granular Couette flows Discrete element based simulations of granular flow in a 2d velocity space are compared with a particle code that solves kinetic granular flow equations in two and three dimensions. The binary collisions of the latter are governed by the same forces as those governing the discrete elements. Both methods are applied to a granular shear flow of equally sized discs and spheres. The two dimensional implementation of the kinetic approach shows excellent agreement with the results of the discrete element simulations. During change to a three dimensional velocity space, the qualitative features of the flow are maintained. However, some flow properties change quantitatively. (C) 1999 Academic Press.

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


Fuzzy tolerance quotient spaces and fuzzy subsets The structure and characteristic of fuzzy subsets are discussed by using the concepts of granulation and hierarchy in quotient space theory. First, the equivalence relation based quotient space theory is extended to the fuzzy tolerance relation. Second, the isomorphism and its discriminant of fuzzy tolerance relations are discussed. Finally, by using the fuzzy tolerance relation to define the fuzzy subset, its properties are addressed. The main results are given below: (1) several equivalent statements of fuzzy tolerance relations; (2) the definition of isomorphism of fuzzy tolerance relations; (3) the isomorphic discriminant of fuzzy tolerance relations; (4) the definition and properties of fuzzy subsets based on the fuzzy tolerance relations; and (5) the necessary and sufficient condition of the isomorphism of fuzzy subsets. These results will help us further comprehend the concepts of fuzzy tolerance relations and fuzzy subsets.

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

fuzzy tolerance relation
quotient space
isomorphism
fuzzy subset


as-awareness in tor path selection Tor is an anonymous communications network with thousands of router nodes worldwide. An intuition reflected in much of the literature on anonymous communications is that, as an anonymity network grows, it becomes more secure against a given observer because the observer will see less of the network. In particular, as the Tor network grows from volunteers operating relays all over the world, it becomes less and less likely for a single autonomous system (AS) to be able to observe both ends of an anonymous connection. Yet, as the network continues to grow significantly, no analysis has been done to determine if this intuition is correct. Further, modifications to Tor's path selection algorithm to help clients avoid an AS-level observer have not been proposed and analyzed. Five years ago a previous study examined the AS-level threat against client and destination addresses chosen a priori to be likely or interesting to examine. Using an AS-level path inference algorithm with improved accuracy, more extensive Internet routing data, and, most importantly, a model of typical Tor client AS-level sources and destinations based on data gathered from the live network, we demonstrate that the threat of a single AS observing both ends of an anonymous Tor connection is greater than previously thought. We look at the growth of the Tor network over the past five years and show that its explosive growth has had only a small impact on the network's robustness against an AS-level attacker. Finally, we propose and evaluate the effectiveness of some simple, AS-aware path selection algorithms that avoid the computational overhead imposed by full AS-level path inference algorithms. Our results indicate that a novel heuristic we propose is more effective against an AS-level observer than other commonly proposed heuristics for improving location diversity in path selection.

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


on the robustness of relevance measures with incomplete judgments We investigate the robustness of three widely used IR relevance measures for large data collections with incomplete judgments. The relevance measures we consider are the bpref measure introduced by Buckley and Voorhees [7], the inferred average precision (infAP) introduced by Aslam and Yilmaz [4], and the normalized discounted cumulative gain (NDCG) measure introduced by Jrvelin and Keklinen [8]. Our main results show that NDCG consistently performs better than both bpref and infAP. The experiments are performed on standard TREC datasets, under different levels of incompleteness of judgments, and using two different evaluation methods, namely, the Kendall correlation measures order between system rankings and pairwise statistical significance testing; the latter may be of independent interest.

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

inferred average precision
order
infap
incomplete judgments
normalized discounted cumulative gain
ndcg
bpref
correlation
relevance

precise
measurement
statistics
systems
data collection
cranfield methodology
evaluation method
standardization
experience
relevance measures
robust
information retrieval


Ubiquitous antenna system for joint detection of COFDM signals In this paper, we propose a new coded orthogonal frequency division multiplex (COFDM)-based ubiquitous antenna system, which is composed of multiple radio base stations (RBSs) deployed over the service area and Radio-on-Fiber (RoF) link that connects RBSs to the central control station (CCS). The proposed system is capable of receiving multiple mobile terminals simultaneously operating at the same frequency by making effective use of joint detection. However, the propagation delay due to the RoF link could be a major problem for realizing the ubiquitous antenna system. In order to overcome this delay problem, we assume that the guard interval of COFDM is longer than the delay difference. Furthermore, in order to improve BER performance in a multipath Rayleigh fading channel, we also propose the MSE normalization scheme followed by the use of an MMSE-based joint detector. Computer simulation results show that the proposed system can improve the frequency utilization efficiency of the broadband wireless access system.

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

ubiquitous antenna system
cofdm
joint detection


Discretization Error Analysis and Adaptive Meshing Algorithms for Fluorescence Diffuse Optical Tomography: Part II In the first part of this work, we analyze the effect of discretization on the accuracy of fluorescence diffuse optical tomography (FDOT). Our error analysis provides two new error estimates which present a direct relationship between the error in the reconstructed fluorophore concentration and the discretization of the forward and inverse problems. In this paper, based on these error estimates, we develop two new adaptive mesh generation algorithms for the numerical solutions of the forward and inverse problems in FDOT, with the objective of error reduction in the reconstructed optical images due to discretization while keeping the size of the discretized forward and inverse problems within the allowable limits. We present three-dimensional numerical simulations to demonstrate the improvements in accuracy, resolution and detectability of small heterogeneities in reconstructed images provided by the use of the new adaptive mesh generation algorithms. Finally, we compare our algorithms both analytically and numerically with the existing conventional adaptive mesh generation algorithms.

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

adaptive meshing algorithms
error analysis
fluorescence diffuse optical tomography


Quantification of biofilm on flooring surface using image classification technique The deteriogenic biofilms on the outdoor-exposed surfaces of concrete structures impair the structural integrity and esthetic quality. There is a growing need for precise and reliable methods to assess the bio-deterioration in concrete structures and identify the extent of biodeposition. This study proposes statistical image analysis method and application of the neural network classification approach to quantify bio-depositories on flooring surface that is exposed to outdoor environment. The results yield percentages of various bio-depositories on the sample.

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

concrete
image classification
quantification


Comparison of remotely sensed water stages from LiDAR, topographic contours and SRTM Digital elevation models (DEMs) are at the core of most environmental process modelling and disaster management. In flood inundation modelling, surface elevation constitutes one of the most important model boundary conditions. With the availability of high-precision DEMs (e.g. LiDAR) and globally available DEMs (e.g. SRTM InSAR) a big step seems to have been taken in terms of hydraulic modelling application or hydraulic information retrieval from such DEMs, with high potential in particular for ungauged basins. Comparative studies exist that report on both the validation of different remotely sensed elevation sources and their use for both hydrologic and hydraulic studies. To contribute to the existing literature on DEMs and hydraulic information, this study aims at comparing water stages derived from LiDAR, topographic contours and SRTM. A flood inundation model calibrated with distributed ground-surveyed high water marks is used to evaluate the remotely sensed water stages. The results show that, as expected, LiDAR derived water stages exhibit the lowest RMSE (0.35m), followed by the contour DEM (0.7m). A relatively good performance of the SRTM (1.07m), which is possibly linked to the low-lying floodplain, suggests that the SRTM is a valuable source for initial vital flood information extraction in large, homogeneous floodplains. Subsequent 3D flood mapping from remotely sensed water stages confirms this but also indicates that flood mapping with low-resolution, low-precision surface elevation data is hardly possible on the small scale, as the accuracy of the resulting map depends too much on DEM uncertainties and errors both in the horizontal and vertical directions.

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


Cooperative media data streaming with scalable video coding Peer-to-peer (P2P) streaming has become a promising approach for disseminating streaming media content from the server to a large number of interested clients. It still faces many challenges, however, such as high churn rate of peer clients, uplink bandwidth constraints of participating peers, and heterogeneity of client capacities. To resolve these issues, this paper presents a new P2P streaming framework that combines with the advantages of both mesh-based multisource overlay networks and scalable video coding techniques, specifically with multiple description coding (MDC), to improve the streaming quality of participating clients. In this paper, an optimized allocation policy (OAP) algorithm was proposed for multidescriptions allocation. Extensive simulations show that the proposed system achieves higher quality of service by peer-assisted cooperative streaming and MDC coding. In addition, we investigate an efficient cooperative caching mechanism for streaming service. The target is to provide low-latency and high-quality services by virtue of peer collaboration. The storage and replacement of caching content are based on a segment-based strategy. Through comparison, we demonstrate the effectiveness of the proposed scheme and compare with the traditional LRUF scheme through extensive experiments over large Internet-like topologies. Results show that the system outperforms some previous schemes in resource utilization and is more robust and resilient to node departure, which demonstrate that it is well suited for quality adaptive cooperative streaming applications.

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

p2p overlay network
media streaming
multimedia communication
cooperative cache


Design of wideband diplexer in suspended substrate stripline medium A wideband diplexer is designed and developed in suspended substrate medium using wide-bandpass filters of 10-14 GHz and 14-18 GHz. Tight coupling between resonators is achieved by etching the resonators on the top and bottom layers of the substrate. The diplexer is designed by combining these filters on a common transformer. Each filter is channelised to avoid waveguide modes. Suspended substrate striplines (SSSs) are characterized using the Finite-Difference Method (FDM). The theoretical and measured results of the diplexer are presented. (c) 2006 Wiley Periodicals, Inc. Int J RF and Microwave CAE 16: 625-628, 2006.

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

suspended substrate stripline (sss)
wide-bandpass filter


Critical Success Factors in SOA Implementation: An Exploratory Study In recent years, the movement to establish a concept of service science has consolidated itself as a new academic discipline (NESSI, 2007; IBM Academic Initiative, 2007; Spohrer, Maglio, Bailey, Gruhl, 2007). Service science is taking a growing interest in Service Oriented Architecture (SOA), a framework which promises to develop a flexible and a robust IT-based service capable of responding efficiently to business demands. However, the development of SOA remains at a nascent stage and many early adopting firms find it difficult to establish effective strategies for adopting the framework, especially since they cannot be sure of its successful implementation. The current paper takes the form of an exploratory study based on a review of 34 SOA literatures and 22 interviews and claims to identify twenty factors in successful SOA adoption; the paper subsequently defines a concrete implementation policy for each factor. Comparative analysis, drawing on interviews with vendors and users, demonstrates both similarities and differences in the perspectives presented by a range of research literatures, proceeding to suggest complementary methods of SOA adoption that take account of both vendors' and users' needs. Thus far, research on SOA implementation has not offered a detailed account of the critical success factors (CSFs) conducive to successful SOA adoption. This work thus fills a gap in more closely reflecting the reality of putting SOA into practice.

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

critical success factors
service oriented architecture
soa implementation


Sparse

systems

solving

on

GPUs

with

GMRES

Scientific

applications

very

often

rely

on

solving

one

or

more

linear

systems.

When

matrices

are

sparse,

iterative

methods

are

preferred

to

direct

ones.

Nevertheless,

the

value

of

nonzero

elements

and

their

distribution

(i.e.,

the

sketch

of

the

matrix)

greatly

influence

the

efficiency

of

those

methods

(in

terms

of

computation

time,

number

of

iterations,

result

precision)

or

simply

prevent

the

convergence.

Among

iterative

methods,

GMRES

(Saad,

Iterative

methods

for

sparse

linear

systems.

PWS

Publishing,

New

York,

is

often

chosen

when

dealing

with

general

nonsymmetric

matrices.

Indeed

its

convergence

is

very

fast

and

more

stable

than

the

biconjugate

gradient.

Furthermore,

it

is

mainly

based

on

mathematical

operations

(matrix-vector

and

dot

products,

norms,

etc.)

that

can

be

heavily

parallelized

and

is

thus

a

good

candidate

to

implement

a

solver

for

sparse

systems

on

Graphics

Processing

Units

(GPU).

This

paper

presents

a

GMRES

method

for

such

an

architecture.

It

is

based

on

the

modified

Gram-Schmidt

approach

and

is

very

similar

to

that

of

Sparselib

(Barrett

et

al.,

Templates

for

the

solution

of

linear

systems:

building

blocks

for

iterative

methods,

SIAM,

Philadelphia,

Our

version

uses

restarting

and

a

very

basic

preconditioning.

For

its

implementation,

we

have

based

our

code

on

CUBLAS

(NVIDIA,

and

SpMV

(Bell

and

Garland,

Efficient

sparse

matrix-vector

multiplication

on

CUDA.

NVIDIA

technical

report

libraries,

in

order

to

achieve

a

good

performance

whatever

the

matrix

sizes

and

their

sketch

are.

Our

experiments

exhibit

encouraging

results

on

the

comparison

between

Central

Processing

Units

(CPU)

and

GPU

executions

in

double

precision,

obtaining

a

speedup

ranging

from

up

to

for

a

large

variety

of

problems.

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


System-theoretical algorithmic solution to waiting times in semi-Markov queues Markov renewal processes with matrix-exponential semi-Markov kernels provide a generic tool for modeling auto-correlated interarrival and service times in queueing systems. In this paper, we study the steady-state actual waiting time distribution in an infinite capacity single-server semi-Markov queue with the auto-correlation in interarrival and service times modeled by Markov renewal processes with matrix-exponential kernels. Our approach is based on the equivalence between the waiting time distribution of this semi-Markov queue and the output of a linear feedback interconnection system. The unknown parameters of the latter system need to be determined through the solution of a SDC (Spectral-Divide-and-Conquer) problem for which we propose to use the ordered Schur decomposition. This approach leads us to a completely matrix-analytical algorithm to calculate the steady-state waiting time which has a matrix-exponential distribution. Besides its unifying structure, the proposed algorithm is easy to implement and is computationally efficient and stable. We validate the effectiveness and the generality of the proposed approach through numerical examples.

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

semi-markov queues
lindley equation
correlated arrivals and services
matrix-analytical approach


Modeling and analysis of power-tail distributions via classical teletraffic methods We propose a new methodology for modeling and analyzing power-tail distributions, such as the Pareto distribution, in communication networks. The basis of our approach is a fitting algorithm which approximates a power-tail distribution by a hyperexponential distribution. This algorithm possesses several key properties. First, the approximation can be achieved within any desired degree of accuracy. Second, the fitted hyperexponential distribution depends only on a few parameters. Third, only a small number of exponentials are required in order to obtain an accurate approximation over many time scales. Once equipped with a fitted hyperexponential distribution, we have an integrated framework for analyzing queueing systems with power-tail distributions. We consider the GI/G/1 queue with Pareto distributed service time and show how our approach allows to derive both quantitative numerical results and asymptotic closed-form results. This derivation shows that classical teletraffic methods can be employed for the analysis of power-tail distributions.

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

communication networks
fitting
hyperexponential distribution

gi/g/1 queue
multiple time-scale traffic
heavy-tail distribution
mixture of exponentials


workshop

on

recommender

systems

and

the

social

web

The

exponential

growth

of

the

Social

Web

both

poses

challenges,

and

presents

opportunities

for

Recommender

System

research.

The

Social

Web

has

turned

information

consumers

into

active

contributors

who

generate

large

volumes

of

rapidly

changing

online

data.

Recommender

Systems

strive

to

identify

relevant

content

for

users

at

the

right

time

and

in

the

right

context

but

achieving

this

goal

has

become

more

difficult,

in

part

due

to

the

volume

and

nature

of

information

contributed

through

the

Social

Web.

The

emergence

of

the

Social

Web

marked

a

change

in

Web

users'

attitude

to

online

privacy

and

sharing.

Social

media

systems

encourage

users

to

implicitly

and

explicitly

provide

large

volumes

of

information

which

previously

they

would

have

been

reluctant

to

share.

This

information

includes

personal

details

such

as

location,

age,

and

interests,

friendship

networks,

bookmarks

and

tags,

opinion

and

preferences

which

can

be

captured

explicitly

or

more

often

by

monitoring

user

interaction

with

the

systems

(e.g.

commenting,

friending,

rating,tagging

etc).

These

new

sources

of

knowledge

can

be

leveraged

by

Recommender

Systems

to

improve

existing

techniques

and

develop

new

strategies

which

focus

on

social

recommendation.

In

turn

recommender

technologies

can

play

a

huge

part

in

fuelling

the

success

of

the

Social

Web

phenomenon

by

reducing

the

information

overload

problem

facing

social

media

users.

The

goal

of

this

one

day

workshop

was

to

bring

together

researchers

and

practitioners

to

explore,

discuss,

and

understand

challenges

and

new

opportunities

for

Recommender

Systems

and

the

Social

Web.

The

workshop

consisted

both

of

technical

sessions,

in

which

selected

participants

presented

their

results

or

ongoing

research,

as

well

as

informal

breakout

sessions

on

more

focused

topics.

Papers

discussing

various

aspects

of

recommender

system

in

the

Social

Web

were

submitted

and

selected

for

presentation

and

discussion

in

the

workshop

in

a

formal

reviewing

process.

The

topics

of

the

submitted

papers

included,

among

others,

the

following

main

areas:

Case

studies

and

novel

fielded

social

recommender

applications

Economy

of

community-based

systems:

Using

recommenders

to

encourage

users

to

contribute

and

sustain

participation

Social

network

and

folksonomy

development:

Recommending

friends,

tags,

bookmarks,

blogs,

music,

communities

etc.

Recommender

system

mash-ups,

Web

user

interfaces,

rich

media

recommender

systems

Recommender

applications

involving

users

and

groups

directly

in

the

recommendation

process

Exploiting

folksonomies,

social

network

information,

interaction

user

context

and

communities

or

groups

for

recommendations

Trust

and

reputation

aware

social

recommendations

Semantic

Web

recommender

systems,

use

of

ontologies

and

microformats

Empirical

evaluation

of

social

recommender

techniques,

success

and

failure

measures

Social

recommender

systems

in

the

enterprise

The

list

of

short

papers,

the

workshop

schedule

and

downloadable

versions

of

the

papers

can

be

found

at

the

workshop's

homepage

at:

and

are

also

published

at:

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

tags
semantic web
social network
recommender system
trust
reputation

algorithm
online community
social software
bookmark


A parallel multi-unit resource deadlock detection algorithm with O ( log 2 ( min ( m , n ) ) ) overall run-time complexity Current MPSoCs typically consist of less than a dozen processing units. Future MPSoCs are likely to integrate many more. With this trend, dozens of applications can be running on an MPSoC concurrently and application deadlock on MPSoCs will become a severe problem. To address the application deadlock problem in current and future MPSoCs, this article proposes a parallel multi-unit resource deadlock detection algorithm, incorporating four contributions: (1)a classification of resource events that enables each category of events to be handled efficiently, (2)a parallel node hopping mechanism that explores the entire graph exponentially in parallel to obtain information about reachable processes of every resource, (3)an innovative hardware implementation of the node hopping mechanism using bit-wise computations, and (4)proofs of correctness and run-time complexity of the proposed algorithm. Based on information about reachable processes as well as sink nodes in the graph, the proposed algorithm detects deadlock in O(1) run-time. Compared with the worst case run-time of any previous algorithm, which employs a single scheme to handle all resource events, ours is considerably reduced to O(log2(min(m,n))) O ( log 2 ( min ( m , n ) ) ) when implemented in hardware, where m m and n n are the number of processes and resources, respectively.

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

deadlock detection in hardware
multi-unit resource systems
chip multiprocessor
graph traversing
reachability computation
parallel algorithm
digital logic design
rtos
real-time embedded systems


HypEs: an architecture for hypermedia-enabled expert systems Expert systems and hypermedia constitute two important technologies for organizations to create, store, and manage information products. The purpose of our research is to develop an architectural blueprint for the construction of hypermedia-enabled expert systems. We propose an architecture termed HypEs (Hypermedia-enabled Expert System) for the development of media-rich expert systems. The integration of hypermedia technologies and expert systems can provide significant potential benefits by enabling the storage and manipulation of non-textual knowledge, enhancing the effectiveness of both knowledge acquisition from the sources of expertise and knowledge transfer to non-expert users. An experimental analysis that contrasts the hypermedia-enabled and text-restricted expert systems provides results that underscore the usefulness of hypermedia techniques in enhancing the effectiveness of expert systems in practical applications.

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

system architecture
knowledge-based system


Impacts of the use of e-mail and the Internet on personal trip-making behavior This article presents the results of a web survey of 118 residents in the Knoxville, Tennessee, metropolitan region to explore the impacts of the use of e-mail and the Internet on personal trip-making behavior. Respondents were required to be active drivers and users of e-mail and/or the Internet. Approximately 40% reported that their use of these information technologies has led to less driving overall, and 18% reported less rush hour driving. Although use of the Internet has led to both trip reduction and new trip generation, overall, weekly trips appear to be reduced by 8% from the national average of almost 28 person trips per week in 2001. The number of places respondents have access to e-mail and the Internet is highly related to trip reduction and new trip generation. Education and income were positively related to new trip generation.

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


New robust forecasting models for exchange rates prediction This paper introduces two robust forecasting models for efficient prediction of different exchange rates for future months ahead. These models employ Wilcoxon artificial neural network (WANN) and Wilcoxon functional link artificial neural network (WFLANN). The learning algorithms required to train the weights of these models are derived by minimizing a robust norm called Wilcoxon norm. These models offer robust exchange rate predictions in the sense that the training of weight parameters of these models are not influenced by outliers present in the training samples. The Wilcoxon norm considers the rank or position of an error value rather than its amplitude. Simulation based experiments have been conducted using real life data and the results indicate that both models, unlike conventional models, demonstrate consistently superior prediction performance under different densities of outliers present in the training samples. Further, comparison of performance between the two proposed models reveals that both provide almost identical performance but the later involved low computational complexity and hence is preferable over the WANN model.

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

wilcoxon artificial neural network (wann)

wilcoxon functional link artificial neural network (wflann)


A Spline-Based Trajectory Representation for Sensor Fusion and Rolling Shutter Cameras The use of multiple sensors for ego-motion estimation is an approach often used to provide more accurate and robust results. However, when representing ego-motion as a discrete series of poses, fusing information of unsynchronized sensors is not straightforward. The framework described in this paper aims to provide a unified solution for solving ego-motion estimation problems involving high-rate unsynchronized devices. Instead of a discrete-time pose representation, we present a continuous-time formulation that makes use of cumulative cubic B-Splines parameterized in the Lie Algebra of the group \(\mathbb {SE}3\). This trajectory representation has several advantages for sensor fusion: (1) it has local control, which enables sliding window implementations; (2) it is \(C^2\) continuous, allowing predictions of inertial measurements; (3) it closely matches torque-minimal motions; (4) it has no singularities when representing rotations; (5) it easily handles measurements from multiple sensors arriving a different times when timestamps are available; and (6) it deals with rolling shutter cameras naturally. We apply this continuous-time framework to visualinertial simultaneous localization and mapping and show that it can also be used to calibrate the entire system.

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

sensor fusion
visualinertial
rolling shutter


Hardware-assisted signal activity analysis for power estimation in rapid prototyped systems In this paper, a technique is proposed to gather statistical data concerning the activity of the internal signals in a complex application. By using an architecture precise rapid prototyping system, the signals can be analyzed over a long period of time and therefore, a realistic estimation of the signal characteristics is obtained. This information can be used for estimating the power consumption in the final system as well as for a later refinement of the communication structures and processing blocks. In order to account for deep submicron effects, not only transition activity but also inter-wire correlations are considered. Because of the huge amount of data that would be generated by a real-time monitoring, a statistical hardware compression module was implemented for embedding it into prototyped designs. It allows the trade off between hardware efficiency and estimation accuracy, in order to offer a flexible usage of the prototyping resources. The proposed approach has been validated in a baseband implementation and prototype of a simplified OFDM transmitter.

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 B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 estimation
signal activity
rapid prototyping


analytical element method for modeling of groundwater flow in anisotropic aquifer Modeling of groundwater flow using the analytical element method (AEM) is, in general, restricted to simulations of groundwater flow in an isotropic medium. In many cases, this deficiency forces the users to turn to numerical modeling techniques in favor of otherwise advantageous and user-friendly analytical models. This paper discusses hydrologic simplifications and a transformation of coordinates using the "rubber sheeting" technique that, if used judiciously, can produce a defensible simulation of groundwater flow in a horizontally anisotropic aquifer. The modeling work was performed for an aquifer contaminated with hydrocarbons present in aqueous and separate phases. The aquifer, formed in saprolite rock with relict foliation, displayed an exceptionally high ratio of anisotropy in a horizontal plane. Modeling was conducted using the Multi Layer Analytical Element Model (MLAEM) developed at University of Minnesota.

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

mlaem
analytical element
anisotropic aquifer


Parallel unmixing of remotely sensed hyperspectral images on commodity graphics processing units Hyperspectral imaging instruments are capable of collecting hundreds of images, corresponding to different wavelength channels, for the same area on the surface of the Earth. One of the main problems in the analysis of hyperspectral data cubes is the presence of mixed pixels, which arise when the spatial resolution of the sensor is not enough to separate spectrally distinct materials. Hyperspectral unmixing is one of the most popular techniques to analyze hyperspectral data. It comprises two stages: (i) automatic identification of pure spectral signatures (endmembers) and (ii) estimation of the fractional abundance of each endmember in each pixel. The spectral unmixing process is quite expensive in computational terms, mainly due to the extremely high dimensionality of hyperspectral data cubes. Although this process maps nicely to high performance systems such as clusters of computers, these systems are generally expensive and difficult to adapt to real-time data processing requirements introduced by several applications, such as wildland fire tracking, biological threat detection, monitoring of oil spills, and other types of chemical contamination. In this paper, we develop an implementation of the full hyperspectral unmixing chain on commodity graphics processing units (GPUs). The proposed methodology has been implemented, using the CUDA (compute device unified architecture), and tested on three different GPU architectures: NVidia Tesla C1060, NVidia GeForce GTX 275, and NVidia GeForce 9800 GX2, achieving near real-time unmixing performance in some configurations tested when analyzing two different hyperspectral images, collected over the World Trade Center complex in New York City and the Cuprite mining district in Nevada. Copyright (C) 2011 John Wiley & Sons, Ltd.

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

endmember extraction
abundance estimation
parallel processing


image space advection on graphics hardware The scientific visualization and computer graphics communities have witnessed a tremendous rise in graphics processing unit (GPU) related literature and methodology recently. This is due in part to the rapidly increasing processing speed offered by graphics cards. Parallel to this, we have seen several advances made in the area of texture-based flow visualization. We present a texture-based flow visualization technique, Image Space Advection (ISA), that takes advantage of the computing power offered by recent, state-of-the-art GPUs. We have implemented a completely GPU-based version of the ISA algorithm. Here we describe our implementation in detail, including both the advantages and disadvantages of implementing ISA on the GPU. The result is state-of-the-art technique that demonstrates the latest in terms of both flow visualization methodology and GPU programming.

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

graphics hardware
flow visualization
gpu programming


a case for numa-aware contention management on multicore systems On multicore systems contention for shared resources occurs when memory-intensive threads are co-scheduled on cores that share parts of the memory hierarchy, such as last-level caches and memory controllers. Previous work investigated how contention could be addressed via scheduling. A contention-aware scheduler separates competing threads onto separate memory hierarchy domains to eliminate resource sharing and, as a consequence, mitigate contention. However, all previous work on contention-aware scheduling assumed that the underlying system is UMA (uniform memory access latencies, single memory controller). Modern multicore systems, however, are NUMA, which means that they feature non-uniform memory access latencies and multiple memory controllers. We discovered that contention management is a lot more difficult on NUMA systems, because the scheduler must not only consider the placement of threads, but also the placement of their memory. This is mostly required to eliminate contention for memory controllers contrary to the popular belief that remote access latency is the dominant concern. In this work we quantify the effects on performance imposed by resource contention and remote access latency. This analysis inspires the design of a contention-aware scheduling algorithm for NUMA systems. This algorithm significantly outperforms a NUMA-unaware algorithm proposed before as well as the default Linux scheduler. We also investigate memory migration strategies, which are the necessary part of the NUMA contention-aware scheduling algorithm. Finally, we propose and evaluate a new contention management algorithm that is priority-aware.

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

shared resource contention
multicore processors


A model for the dynamic coordination of multiple competing goals A general framework for the problem of coordination of multiple competing goals in dynamic environments for physical agents is presented. This approach to goal coordination is a novel tool to incorporate a deep coordination ability to pure reactive agents. The framework presented is based on the notion of multi-objective optimisation. In this article we propose a kind of 'aggregating functions' formulation with the particularity that the aggregation is weighted by means of a dynamic weighting unitary vector [image omitted], which is dependent from the system dynamic state allowing the agent to dynamically coordinate the priorities of its single goals. This dynamic weighting unitary vector is represented as a (n - 1) set of angles. The dynamic coordination must be established by means of a mapping between the state of the agent's environment S to the set of angles i(S) by means of any sort of machine-learning tool. In this work, we investigate the use of Reinforcement Learning as a first approach to learn that mapping.

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

goal coordination
reinforcement learning

conflicting goals
multi-objective optimisation


Clustering with multilayer perceptrons and self-organized (Hebbian) learning A new local (Hebbian) learning algorithm for artificial neurons is presented. It is shown that, in spite of its implementation simplicity, this new algorithm, applied to neurons with sigmoidal activation function, performs data clustering by finding valleys of the probability density function (PDF) of the multivariate random variables that model incoming data. Some interesting features of this new algorithm are illustrated by some experiments based on both artificial data and real world data.

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

hierarchical clustering
deterministic annealing
pdf valleys


Optimizing computations for effective block-processing Block-processing can decrease the time and power required to perform any given computation by simultaneously processing multiple samples of input data. The effectiveness of block-processing can be severely limited, however, if the delays in the dataflow graph of the computation are placed suboptimally. In this paper we investigate the application of retiming for improving the effectiveness of block-processing in computations. In particular, we consider the k-delay problem: Given a computation dataflow graph and a positive integer k, we wish to compute a retimed computation graph in which the original delays have been relocated so that k data samples can be processed simultaneously and fully regularly. We give an exact integer linear programming formulation for the k-delay problem. We also describe an algorithm that solves the k-delay problem fast in practice by relying on a set of necessary conditions to prune the search space. Experimental results with synthetic and random benchmarks demonstrate the performance improvements achievable by block-processing and the efficiency of our algorithm.

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

combinatorial optimization
computation dataflow graphs
embedded systems
high-level synthesis
scheduling
vectorization


Development of a quantitative model of the impact of customers personality and perceptions on Internet banking use Despite the rapid increase of Internet users and cited benefits of using Internet banking, the number of Internet banking users has not risen as strongly as expected. In order to understand this problem, it is critical to understand how customers personalities and perceptions influence Internet banking use. In this study, a quantitative model of Internet banking use was developed, which incorporates four dimensions, namely, (1) openness toward advanced technology as an individual personality dimension, (2) website usability, including perceived usefulness and ease of use, (3) perceived security concern, and (4) green concern for conserving nature resources as the social influence dimension. The study investigates the moderating effect between these dimensions on Internet banking use. A survey instrument was used to gather data to estimate the proposed research model. The results show that openness, website usability, and perceived security concern significantly influence customers Internet banking use. In terms of moderating effects, all dimensions play an important role as a moderator on the relation between other dimensions and Internet banking use. Overall, the model helps to increase our understanding of how these dimensions interact to influence Internet banking use, which can help in the design of Internet banking and other e-channel systems.

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

internet banking
perceived usefulness
security
openness
green concern


The Coupled Viscous Burgers Equations with Fractional-Time Derivative by the Homotopy Perturbation Method In this paper, the Homotopy Perturbation Method (HPM) which is an approximate analytical method has been used to solve the nonlinear coupled viscous Burgers equations with fractional-time derivative. With the HPM, the solution can be obtained in the form of a convergent power series with terms that can be easily computed. The method does not need linearization and provides an analytical solution by utilizing only the initial condition. We also show that the HPM can generate highly accurate analytical solutions.

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

coupled viscous burgers equations
homotopy perturbation method


Insights into software testing MARTIN WOODWARD aims to provide a brief insight into some of the many aspects of software testing. The various stages required when testing large software systems are outlined and then a selection of possible testing techniques are described and illustrated. Given the increased use of formal specifications in software development, one could exploit such a specification during testing and some of the ways this might be done are indicated. Similarly, the nature of the design approach used in the development of the software or even the nature of the particular application being developed can lead to particular test strategies. Finally, testing is not purely a technical matter; people issues and management of the process have a significant impact on the success or otherwise of this activity. A brief discussion of these topics rounds off this review. Copyright 2001 John Wiley & Sons, Ltd.

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

test management
specification-based testing
design-based testing


Image association using a Complex-Valued Associative Memory Model This paper presents an application of Complex Valued Associative Memory Model(CAMM) for image processing. An image association system applying CAMM I, combined with a 2-dimensional discrete Fourier transform (2-D DFT) process is proposed. Discussed are how a gray level image can be expressed using CAMM, and the image association that can be performed by CAMM. In the proposed system, input images are transformed to phase matrices and the image association can be performed-by making use of the phase information. Practical examples are also presented.

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

discrete fourier transform
gray level image

complex-valued associative memory
muiti-valued neuron


A subscribable peer-to-peer RDF repository for distributed metadata management In this paper, we present a scalable peer-to-peer RDF repository, named RDFPeers, which stores each triple in a multi-attribute addressable network by applying globally known hash functions. Queries can be efficiently routed to the nodes that store matching triples. RDFPeers also enables users to selectively subscribe to RDF content. In RDFPeers, both the neighbors per node and the routing hops for triple insertion, most query resolution and triple subscription are logarithmic to the network size. Our experiments with real-world RDF data demonstrated that the triple-storing load among nodes differs by less than an order of magnitude.

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

semantic web
peer-to-peer
distributed rdf repositories


A wavelet Galerkin method for the Stokes equations The purpose of this paper is to investigate Galerkin schemes for the Stokes equations based on a suitably adapted multiresolution analysis. In particular, it will be shown that techniques developed in connection with shift-invariant refinable spaces give rise to trial spaces of any desired degree of accuracy satisfying the Ladysenskaja-Babuska-Brezzi condition for any spatial dimension. Moreover, in the time dependent case efficient preconditioners for the Schur complements of the discrete systems of equations can be based on corresponding stable multiscale decompositions. The results are illustrated by some concrete examples of adapted wavelets and corresponding numerical experiments.

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

multiresolution analysis
wavelets
schur complements

saddle point problems
lbb condition
time dependent problems
preconditioning


A neural network based retrainable framework for robust object recognition with application to mobile robotics In this paper, we address object recognition for a mobile robot which is deployed in a multistory building. To move to another floor, a mobile robot should recognize various objects related to an elevator, e.g., elevator control, call buttons, and LED displays. To this end, we propose a neural network based retrainable framework for object recognition, which consists of four components-preprocessing, binary classification, object identification, and outlier rejection. The binary classifier, a key component of our system, is a neural network that can be retrained, the motivation of which is to adapt to varying environments, especially with illuminations. Without incurring any extra process to prepare new training samples for retraining, they are freely obtained as a result of the outlier rejection component, being extracted on-line. To realize a practical system, we adopt a parallel architecture integrating both recognition and retraining processes for seamless object recognition, and furthermore detect and cope with the deterioration of a retrained neural network to ensure high reliability. We demonstrate the positive effect of retraining on the object recognition performance by conducting experiments over hundreds of images obtained in daytime and nighttime.

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


Agent-based computational modeling of the stock price-volume relation From the perspective of the agent-based model of stock markets, this paper examines the possible explanations for the presence of the causal relation between stock returns and trading volume. Using the agent-based approach, we find that the explanation for the presence of the stock price-volume relation may be more fundamental. Conventional devices such as information asymmetry, reaction asymmetry, noise traders or tax motives are not explicitly required. In fact, our simulation results show that the stock price-volume relation may be regarded as a generic property of a financial market, when it is correctly represented as an evolving decentralized system of autonomous interacting agents. One striking feature of agent-based models is the rich profile of agents' behavior. This paper makes use of the advantage and investigates the micro-macro relations within the market. In particular, we trace the evolution of agents' beliefs and examine their consistency with the observed aggregate market behavior. We argue that a full understanding of the price-volume relation cannot be accomplished unless the feedback relation between individual behavior at the bottom and aggregate phenomena at the top is well understood. (C) 2003 Elsevier Inc. All rights reserved.

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

agent-based model
artificial stock markets
genetic programming
granger causality test
stock price-volume relation
micro-macro relation


DCCII based frequency compensation method for three stage amplifiers A new frequency compensation scheme using a second generation differential current conveyor (DCCII) for three-stage amplifiers is proposed. By adding a DCCII as a feedback path from output of the second and the third stage to the output of the first stage, feed-forward path and the right-half plane zero will be removed subsequently, which significantly improves phase margin and gain-bandwidth product. Calculations are derived for two states. First state, a DCCII and two miller capacitors form the feedback paths and in the second state, two nulling resistors will be set series with miller capacitors. Analyses show that in both states, stability can be perfectly ensured. To demonstrate advantages of this technique over the traditional RNMC architecture, a three-stage amplifier is designed and simulated employing the proposed technique in a standard 0.18?m CMOS process. Simulation results show that, with the same load capacitance, the new amplifier achieved 85 and 9.63MHz as phase margin and gain-bandwidth product, respectively. The proposed amplifier dissipates only 0.31mW of power with a 1.8V supply.

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


Random redundant storage in disk arrays: Complexity of retrieval problems Random redundant data storage strategies have proven to be a good choice for efficient data storage in multimedia servers. These strategies lead to a retrieval problem in which it is decided for each requested data block which disk to use for its retrieval. In this paper, we give a complexity classification of retrieval problems for random redundant storage.

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

load balancing
video servers
complexity analysis


Decomposition Algorithms for the Design of a Nonsimultaneous Capacitated Evacuation Tree Network In this article, we examine the design of an evacuation tree, in which evacuation is subject to capacity restrictions on arcs. The cost of evacuating people in the network is determined by the sum of penalties incurred on arcs on which they travel, where penalties are determined according to a nondecreasing function of time. Given a discrete set of disaster scenarios affecting network population, arc capacities, transit times, and penalty functions, we seek to establish an optimal a priori evacuation tree that minimizes the expected evacuation penalty. The solution strategy is based on Benders decomposition, in which the master problem is a mixed-integer program and each subproblem is a time-expanded network flow problem. We provide efficient methods for obtaining primal and dual subproblem solutions, and analyze techniques for improving the strength of the master problem formulation, thus reducing the number of master problem solutions required for the algorithm's convergence. We provide computational results to compare the efficiency of our methods on a set of randomly generated test instances. (C) 2008 Wiley Periodicals, Inc. NETWORKS, Vol. 53(2), 91-103 2009

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


Optimal scheduling for UET/UET-UCT generalized n-dimensional grid task graphs The ii-dimensional grid is one of the most representative patterns of data now in parallel computation. Many scientific algorithms, which require nearest neighbor communication in a lattice space, are modeled by a task graph with the properties of a simple or enhanced grid. The two most frequently used scheduling models for grids are the unit execution time-zero communication delay (UET) and the unit execution time-unit communication time (UET-UCT). In this paper we introduce an enhanced model of the ii-dimensional grid by adding extra diagonal edges and allowing unequal boundaries for each dimension. For this generalized grid topology we establish the optimal makespan for both cases of UET/UET-UCT grids. Then we give a closed formula that calculates the minimum number of processors required to achieve the optimal makespan. Finally, we propose a low-complexity optimal time and processor scheduling strategy for both cases. (C) 1999 Academic Press.

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

uet-uct scheduling
optimal number of processors


Invariant and attracting sets of Volterra difference equations with delays We will be concerned with the invariant and asymptotic properties of Volterra difference equations with delays. Sufficient conditions for determining the invariant and attracting sets of the equations are obtained. Examples are given to illustrate the obtained results. (C) 2003 Elsevier Science Ltd. All rights reserved.

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

invariant set
attracting set
stability
delay systems


Assessing dynamic inefficiency of the Spanish construction sector pre- and post-financial crisis Overall dynamic cost inefficiency is decomposed into the contributions of technical, scale and allocative inefficiency. Dynamic cost inefficiency and its components are compared with static cost inefficiency and its components. Dynamic cost inefficiency is larger before the financial crisis than during it.

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

dynamic inefficiency
construction sector


WEB PAGE CLASSIFICATION THROUGH PROBABILISTIC RELATIONAL MODELS In the last decade, new approaches focused on modeling uncertainty over complex relational data have been developed. In this paper, one of the most promising of such approaches, known as probabilistic relational model (PRM), has been investigated and extended in order to measure and include semantic relationships for addressing web page classification problems. Experimental results show the potential of the proposed method of capturing the "strength" of existing relationships (links) and the capacity of including this information into the probability model.

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


A modified decoupling scheme for receiving antenna arrays with application to DOA estimation Mutual coupling in antenna arrays can critically degrade the performance of subsystems, such as those aiming at the estimation of the direction of arrival (DOA) of incident signals. In this article, an accurate form of mutual impedance matrix (MIM) and decoupling methodology is introduced. The methodology for computing the MIM is presented. In the modified MIM and decoupling method, extreme care has been taken to account for all self-impedance and mutual impedance terms, relating to the mutual coupling effects. It is shown that the new method results in an essential improvement in DOA estimation applications. The resolution and accuracy, achieved using the modified MIM and decoupling methodology, are unmatched with those of the previous techniques. 2012 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2013.

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

mutual coupling
mutual impedance matrix
direction of arrival


Individual and Contextual Influences on Adolescent Smoking Cigarette smoking among adolescents remains one of the most important public health challenges. Despite much attention to research on the etiology of smoking, notably the examination of factors that differentiate adolescent smokers from never smokers, much less is known about factors that predict the development of dependence once an adolescent tries smoking. This paper reviews individual and contextual influences on the progression of smoking among adolescents. Highlights include a consideration of multiple levels of influence, from intra-individual factors, such as genetics, demographics, temperament and comorbidities, to social influences, such as families and peers, to the more macro, societal/cultural levels of influence, including advertising and tobacco-related policies. More recent work examining microcontextual influences through the use of Ecological Momentary Assessments is also discussed. Finally, the need to consider both developmental and transdisciplinary approaches to understanding the development of nicotine dependence in adolescents is emphasized.

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

adolescent smoking social transdisciplinary


Imposing maximum length scale in topology optimization This paper presents a technique for imposing maximum length scale on features in continuum topology optimization. The design domain is searched and local constraints prevent the formation of features that are larger than the prescribed maximum length scale. The technique is demonstrated in the context of structural and fluid topology optimization. Specifically, maximum length scale criterion is applied to (a) the solid phase in minimum compliance design to restrict the size of structural (load-carrying) members, and (b) the fluid (void) phase in minimum dissipated power problems to limit the size of flow channels. Solutions are shown to be near 0/1 (void/solid) topologies that satisfy the maximum length scale criterion. When combined with an existing minimum length scale methodology, the designer gains complete control over member sizes that can influence cost and manufacturability. Further, results suggest restricting maximum length scale may provide a means for influencing performance characteristics, such as redundancy in structural design.

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

manufacturing constraints
structural redundancy
pore size
stokes flow


A global semi-Lagrangian spectral model of the shallow water equations with variable resolution A new formulation of a semi-implicit, semi-Lagrangian spectral method is given together with a conformal mapping of the underlying Gaussian grid. The mapping based on the Schmidt transformation focuses grid resolution on a particular region. The advective form of the vorticitydivergence equations allows the conformal map to be incorporated in a semi-Lagrangian transport step while maintaining an efficient spectral transform algorithm. The shallow water equations on the sphere are solved to test the variable resolution spectral model. By focusing on a specified location, local details of the flow are more accurately resolved. Accuracy and stability of the method are compared with uniform spectral solutions.

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

spectral
variable resolution
shallow water equations


Improving associative classification by incorporating novel interestingness measures Associative classification has aroused significant attention in recent years and proved to generate good results in previous research efforts. This paper aims to contribute to this line of research by the development of more effective associative classifiers. Our goal is to achieve this by the incorporation of two novel interesting measures, i.e. intensity of implication and dilated chi-square, into an existing associative classification algorithm, respectively. The former interesting measure was merely proposed with the purpose of mining meaningful association rules, while the latter was designed to reveal the interdependence between condition and class variables. Each of these two measures is applied as the primary sorting criterion within the context of the well-known CBA algorithm in an attempt to organize the composition of the rule sets in a more reasonable sequence. Benchmarking experiments on 16 popular UCI datasets revealed that our algorithms could empirically generate accurate and significantly more compact decision lists. In addition to this, the algorithm was validated on a separate credit scoring dataset, which contained 7190 credit scoring samples.

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

associative classification
intensity of implication
credit scoring


Stability indices for a self-organizing fuzzy controlled robot: A case study This study developed a model-free self-organizing fuzzy controller (SOFC) for manipulating multiple-input multiple-output systems. The SOFC has an online learning algorithm that can continually update fuzzy rules during the control process, beginning from an empty rule table. The SOFC was used to control a three-link robot with a complex dynamic model in order to evaluate its applicability. Stability and robustness of the SOFC were demonstrated using a state-space approach. Simulation results confirmed that the control performance of the SOFC outperforms that of the fuzzy logic controller for the control of the robot.

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

fuzzy logic controller
robot
stability and robustness

self-organizing fuzzy controller
state-space approach


system-level exploration tools for mpsoc designs In this paper, we describe the challenges users face for software development on Systems on Chip (SoC) involving multiple cores. We will briefly review the trends and challenges for MPSoC design and will derive from them the resulting requirements. We will then discuss briefly the required exploration tools and close with an analysis of which type of providers will be able to provide appropriate solutions to the MPSoC challenge.

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


Robust speech recognition using spatial-temporal feature distribution characteristics Histogram equalization (HEQ) is one of the most efficient and effective techniques that have been used to reduce the mismatch between training and test acoustic conditions. However, most of the current HEQ methods are merely performed in a dimension-wise manner and without allowing for the contextual relationships between consecutive speech frames. In this paper, we present several novel HEQ approaches that exploit spatial-temporal feature distribution characteristics for speech feature normalization. The automatic speech recognition (ASR) experiments were carried out on the Aurora-2 standard noise-robust ASR task. The performance of the presented approaches was thoroughly tested and verified by comparisons with the other popular HEQ methods. The experimental results show that for clean-condition training, our approaches yield a significant word error rate reduction over the baseline system, and also give competitive performance relative to the other HEQ methods compared in this paper. (C) 2011 Elsevier B.V. All rights reserved.

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

speech recognition
histogram equalization


Accurate alignment of functional EPI data to anatomical MRI using a physics-based distortion model Mapping of functional magnetic resonance imaging (fMRI) to conventional anatomical MRI is a valuable step in the interpretation of fMRI activations. One of the main limits on the accuracy of this alignment arises From differences in the geometric distortion induced by magnetic field inhomogeneity. This paper describes an approach to the registration of echo planar image (EPI) data to conventional anatomical images which takes into account this difference in geometric distortion. We make use of an additional spin echo EPI image and use the known signal conservation in spin echo distortion to derive a specialized multimodality nonrigid registration algorithm. We also examine a plausible modification using log-intensity evaluation of the criterion to provide increased sensitivity in areas of low EPI signal, A phantom-based imaging experiment is used to evaluate the behavior of the different criteria, comparing nonrigid displacement estimates to those provided by a magnetic field mapping acquisition, The algorithm is then applied to a range of nine brain imaging studies illustrating global and local improvement in the anatomical alignment and localization of fMRI activations.

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

geometric imaging distortion
nonrigid mri registration
normalized mutual information


Location leakage in distance bounding: Why location privacy does not work In many cases, we can only have access to a service by proving we are sufficiently close to a particular location (e.g.in automobile or building access control). In these cases, proximity can be guaranteed through signal attenuation. However, by using additional transmitters an attacker can relay signals between the prover and the verifier. Distance-bounding protocols are the main countermeasure against such attacks; however, such protocols may leak information regarding the location of the prover and/or the verifier who run the distance-bounding protocol. In this paper, we consider a formal model for location privacy in the context of distance-bounding. In particular, our contributions are threefold: we first define a security game for location privacy in distance bounding; secondly, we define an adversarial model for this game, with two adversary classes; finally, we assess the feasibility of attaining location privacy for distance-bounding protocols. Concretely, we prove that for protocols with a beginning or a termination, it is theoretically impossible to achieve location privacy for either of the two adversary classes, in the sense that there always exists a polynomially-bounded adversary winning the security game. However, for so-called limited adversaries, who cannot see the location of arbitrary provers, carefully chosen parameters do, in practice, enable computational location privacy.

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

distance-bounding
authentication
location indistinguishability
relay attacks


Continuity of triple I methods based on several implications This paper focuses on the Continuity problem of fully implicational triple I methods for fuzzy reasoning. Based on the residual implications generated by continuous triangular norms, the residual implication generated by nilpotent minimum with the standard negation and the Zadeh implication. respectively, continuity and uniform continuity properties of triple I methods are examined in Hamming and uniform metrics. We also investigate the Continuity of the model of a fuzzy if-then rule corresponding to the triple I methods. (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 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 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

fuzzy reasoning
continuity and uniform continuity
residual implication


automatic k-complex detection using hjorth parameters and fuzzy decision K-complex is a stereotyped transient wave in the human electroencephalogram (EEG), it appears frequently during sleep recordings. Its role and significance have been disregarded since its discovery until recently, when the American Association of Sleep Medicine (AASM) proposed a new classification of sleep with a relevant role for the K-complexes in the definition of the sleep stages. It is now one of the key features that contribute to sleep stage assessment. K-complexes are associated with sleep arousal and can occur spontaneously or as an evoked response to external stimuli. Since the EEG has a stochastic nature, K-complex can have a wide variety of shapes and it can be difficult to distinguish it from other EEG waves. The visual scoring of K-complex is a very complex, time consuming and expensive procedure and reported agreement between human expert scorers is very poor. In this paper a new method for K-complex automatic detection is presented. The detection method is based on Hjorth parameters and employs fuzzy decision. The performance of the detection system is compared to the visual human scoring.

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


Computers, justification, and mathematical knowledge The original proof of the four-color theorem by Appel and Haken sparked a controversy when Tymoczko used it to argue that the justification provided by unsurveyable proofs carried out by computers cannot be a priori. It also created a lingering impression to the effect that such proofs depend heavily for their soundness on large amounts of computation-intensive custom-built software. Contra Tymoczko, we argue that the justification provided by certain computerized mathematical proofs is not fundamentally different from that provided by surveyable proofs, and can be sensibly regarded as a priori. We also show that the aforementioned impression is mistaken because it fails to distinguish between proof search (the context of discovery) and proof checking (the context of justification). By using mechanized proof assistants capable of producing certificates that can be independently checked, it is possible to carry out complex proofs without the need to trust arbitrary custom-written code. Vie only need to trust one fixed, small, and simple piece of software: the proof checker. This is not only possible in principle, but is in fact becoming a viable methodology for performing complicated mathematical reasoning. This is evinced by a new proof of the four-color theorem that appeared in 2005, and which was developed and checked in its entirety by a mechanical proof system.

O B O B I O O O O O O O O O O O O O O O O O O O O O O B O O O B 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 B O O O O O B 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 B O O O O O O O O B O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 priori
justification
proofs
certificates
mathematical knowledge


e-voting in the 2005 local elections in estonia and the broader impact for future e-voting projects In this project, we analyze the introduction of voting by internet (e-voting) in political elections. In particular, we focus on the Estonian municipal elections held on 16 October 2005, where the possibility of casting a vote via the internet was newly introduced. This introduction of e-voting represented a true world-premire : even though internet voting has so far been used in consultative decision making processes around the globe, in private elections and in a number of formally binding referendums, the local elections in Estonia were the first time that an electorate of an entire country could cast its vote over the Internet in a public election. On behalf of the Council of Europe, and in close collaboration with the Estonian authorities, our research team academically accompanied this landmark event in e-democracy. Completing the process-tracing of the internet voting implementation, we conducted a survey among over 900 citizens, allowing us to conduct an in-depth study on voting behaviour in e-elections. Our research shows what voting channels have been used by what type of citizes and contains a fine-grained analysis of participation patterns and political behaviour of the citizens in these elections. Finally, the data and findings of our research allows us to make a selective comparisons with other studies in the field of e-democracy, which we conducted in several elections and referendums in Switzerland.

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


development support for qos-aware service-adaptation in ubiquitous computing applications In ubiquitous computing environments services may be discovered and bound dynamically. Adaptive applications may utilize such services to improve their offered functional and nonfunctional properties. Generally, the adaptation decision depends on the quality of service (QoS) of discovered services. The development of such adaptive applications is a complex, challenging task. In this paper, we present a general methodology for facilitating the development of QoS-dependent self-adaptive applications. We present several lessons learned from application case studies using the new approach.

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

model-driven development
adaptive systems
service-oriented computing


building bridges for learning within and between organizations Two panels explore examples of fruitful collaboration between, and across, higher education organizations. Panel 1: Panel members discuss how Lehigh's instructional technologists use an effective, team-based approach to evaluate new technologies and their potential as academic applications. Panel 2: Members of The Boston Consortium's IT Training Group discuss how trustful relationships enabled innovative collaboration between schools, resulting in improved IT learning services at the local level.

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

higher education
academic
learning
evaluate
collaboration
training

technologist
pilot
innovation
teaching
model
web-based training
consortia
wbt
boston consortium
campus needs
application
education
relationship
teamwork
service
support
technology
instructional technology
trust


the deployment of pda accessible clinical-log for medical education in pbl-approach This study was undertaken to determine the important features, advantages and disadvantages of PDA-based/web-based clinical-log for PBL-based medical curriculum at the Graduate School of Medicine, University of Wollongong for the incorporation of personal digital assistants (PDAs) in the future. Method: The in-depth interviews were designed and conducted with medical faculty, clinicians and medical education technology specialists. Results: Four major features, benefits and limitation of PDA-based/web-based clinical-log were identified. Conclusion: PDA-based/web-based clinical-log is a vital learning tool to be incorporated as a in PBL-medical curriculum in particular while offsite.

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

personal digital assistants
medical education

clinical-log
information technology
problem-based learning


A logic of categorization The reasoning system known as NARS constitutes a model of categorization. NARS is designed to be an adaptive system that works under the constraint of insufficient knowledge and resources. It consists of a categorical language, an experience-grounded semantics, a set of syllogistic inference rules, a dynamic memory structure, and a control mechanism that manages asynchronized parallel inference. In the system, reasoning and categorization are two aspects of the same underlying process. As a model of categorization, NARS unifies several existing theories.

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