A novel theory of Legendre polynomials We reformulate the theory of Legendre polynomials using the method of integral transforms, which allow us to express them in terms of Hermite polynomials. We show that this allows a self consistent point of view to their relevant properties and the possibility of framing generalized forms like the Humbert polynomials within the same framework. The multi-index multi-variable case is touched on. (C) 2011 Elsevier Ltd. All rights reserved.

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

integral transforms
legendre polynomials
humbert polynomials

multi-variable hermite polynomials
bell polynomials


Protocols that hide user's preferences in electronic transactions The Internet creates many new threats to personal privacy and raises some unique privacy concerns. In this paper we study the problem of how to protect users' privacy in web transactions of digital products. In particular, we introduce a system which (1) allows a user to disclose his/her identity information (such as user account or credit card number) to a web site in exchange for a digital product, but (2) prevents the web site from learning which specific product the user intends to obtain. The problem concerned here is orthogonal to the problem of anonymous transactions [M. Reed, P. Syverson, D. Goldschag, Anonymous connections and Onion Routing, IEEE Journal of Selected Areas in Communication 16 (4) (1998) 482-494; M. Reiter, A. Rubin, Crowds: anonymity for web transactions, ACM Transactions on Information System Security, 1 (1) (1998) 66-92] but commensurate with the general problem of PIR (private information retrieval) [B. Chor, O. Goldreich, E. Kushilevita, M. Sudan, Private information retrieval, in: Proceedings of 36th FOCS, 1995, pp. 41-50; B. Chor, N. Gilboa, Computational private information retrieval, in: Proceedings of 29th STOC, 1997, pp. 304-313]. Most of the existing results in PIR, however, are theoretical in nature and can not be applied in practice due to their huge communication and computational overheads. In the present paper, we introduce two practical solutions that satisfy the above two requirements and analyze their security and performance. Another issue we study in this paper is how to recover sales statistics data in our user privacy-protected system. We present a novel solution to the problem along with its security analysis. (c) 2004 Elsevier B.V. All rights reserved.

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

anonymizer
encryption
privacy protection
on-line transaction


The Phosphorylation of the Heat Shock Factor as a Modulator for the Heat Shock Response The heat shock response is a well-conserved defence mechanism against the accumulation of misfolded proteins due to prolonged elevated heat. The cell responds to heat shock by raising the levels of heat shock proteins (hsp), which are responsible for chaperoning protein refolding. The synthesis of hsp is highly regulated at the transcription level by specific heat shock (transcription) factors (hsf). One of the regulation mechanisms is the phosphorylation of hsf's. Experimental evidence shows a connection between the hyper-phosphorylation of hsfs and the transactivation of the hsp-encoding genes. In this paper, we incorporate several (de) phosphorylation pathways into an existing well-validated computational model of the heat shock response. We analyze the quantitative control of each of these pathways over the entire process. For each of these pathways we create detailed computational models which we subject to parameter estimation in order to fit them to existing experimental data. In particular, we find conclusive evidence supporting only one of the analyzed pathways. Also, we corroborate our results with a set of computational models of a more reduced size.

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

simulation
modeling
computing methodologies
biology and genetics
computer applications
protein phosphorylation
quantitative refinement


Concurrent Generation of Concurrent Programs for Post-Silicon Validation The continuing trend toward increased parallelism in processor design can be seen in both the growing number of processor cores per system and in on-core hardware mechanisms that assist parallelism, such as multithreading and cache hierarchies. This complexity exacerbates the problem of ensuring the functional correctness of such hardware systems. The growing importance of post-silicon validation is leading to an emerging type of parallel application, namely, the hardware exerciser. We describe a method for exercising parallel hardware by generating pseudorandom concurrent test programs. The test generation is carried out on the tested parallel platform and thus the generator itself is also a concurrent program. We describe the challenges associated with this technology and the approach used by the Threadmill hardware exerciser, a tool developed for the post-silicon validation of the IBM POWER7 processor.

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

functional verification
multiprocessor verification
post-silicon validation
stimuli generation


MobileRMI: upgrading Java remote method invocation towards mobility Code mobility is recognized as a promising design technique, able to improve flexibility, adaptability and bandwidth utilization in mobile computing applications. To promote and facilitate its use, researchers argue that code mobility should be made available to programmers in combination with, and not as an alternative to, more traditional programming models. This paper describes the design and implementation of the MobileRMI toolkit which, unlike agent-based systems, enables mobility-based programming within a widely accepted middleware platform, Java Remote Method Invocation (RMI). Our toolkit provides a set of mobility primitives that allow programmers to create, clone and move remote objects across a network. To preserve location transparency we implemented a novel, efficient scheme for automatically updating remote references by exploiting the distributed garbage collector. Programming examples are given and a case study where an adaptive application uses logical mobility to minimize communication over a mobile ad hoc network is presented. Experience from using MobileRMI confirmed the benefit of designing both static and mobile applications within the same programming framework. Copyright (c) 2005 John Wiley & Sons, Ltd.

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

java rmi
distributed object middleware
mobile agents


Hierarchies of weakly monotone restarting automata It is known that the weakly monotone restarting automata accept exactly the growing context-sensitive languages. We introduce a measure on the degree of weak monotonicity and show that the language classes obtained in this way form strict hierarchies for the various types of deterministic and nondeterministic restarting automata without auxiliary symbols.

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

restarting automata
weak monotonicity
hierarchies


Weighted Online Sequential Extreme Learning Machine for Class Imbalance Learning Most of the existing sequential learning methods for class imbalance learn data in chunks. In this paper, we propose a weighted online sequential extreme learning machine (WOS-ELM) algorithm for class imbalance learning (CIL). WOS-ELM is a general online learning method that alleviates the class imbalance problem in both chunk-by-chunk and one-by-one learning. One of the new features of WOS-ELM is that an appropriate weight setting for CIL is selected in a computationally efficient manner. In one-by-one learning of WOS-ELM, a new sample can update the classification model without waiting for a chunk to be completed. Extensive empirical evaluations on 15 imbalanced datasets show that WOS-ELM obtains comparable or better classification performance than competing methods. The computational time of WOS-ELM is also found to be lower than that of the competing CIL methods.

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

online sequential learning
extreme learning machine (elm)
weighted least squares
total error rate


A Survey of Approaches to Web Service Discovery in Service-Oriented Architectures Discovering services acquires importance as Service-Oriented Computing (SOC) becomes an adopted paradigm. SOC's most popular materializations, namely Web Services technologies, have different challenges related to service discovery and, in turn, many approaches have been proposed. As these approaches are different, one solution may be better than another according to certain requirements. In consequence, choosing a service discovery system is a hard task. To alleviate this task, this paper proposes eight criteria, based on the requirements for discovering services within common service-oriented environments, allowing the characterization of discovery systems. These criteria cover functional and non-functional aspects of approaches to service discovery. The results of the characterization of 22 contemporary approaches and potential research directions for the area are also shown.

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

service-oriented architecture
service-oriented computing
web service discovery
web service technology


On inception of cracking in composite materials with brittle matrix The primary mechanism that leads to failure in composite materials with brittle matrix is the formation of macrocracks. In general, the specification of the conditions at the onset of cracking requires an elaborate analysis of the stress field throughout the domain. Such an analysis is not always feasible in view of the complexity of the problem. In this work, an attempt is made to formulate some macroscopic criteria that define the conditions at the inception of macrocracks. The approach involves generating a set of data from a homogenization analysis that is subsequently used for the identification of closed-form criteria derived based on critical plane approach and/or microstructure tensor approach. The methodology is illustrated using an example of reinforced concrete specimen subjected to different loading conditions. A numerical study is conducted to examine the efficiency of this approach. The primary focus is on assessment of the influence of volume fraction of the reinforcement and its orientation (relative to the loading direction) on the onset of macrocracking. It is noted that the proposed approach can be employed for other composite materials, such as fiber-reinforced composites with ceramic or brittle polymeric matrix.

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

composite materials
reinforced concrete
homogenization
critical plane approach

macrostructure tensor
macrocrack inception


Time-frequency

analysisG(?)

G

-stationary

processes

Methods

such

as

wavelets,

short

term

Fourier

transforms

and

time

deformation

[Gray

and

Zhang,

On

a

class

of

nonstationary

processes.

J.

Time

Ser.

Anal.

and

Gray,

Vijverberg

and

Woodward,

Nonstationary

data

analysis

by

time

deformation.

Commun.

Statist.

A,

to

appear]

have

been

developed

to

analyze

the

time-frequency

properties

of

a

process

where

frequency

changes

with

time.

When

the

frequencies

of

a

process

are

either

monotonically

increasing

or

monotonically

decreasing

with

time,

a

rather

general

time

deformation

approach

is

to

apply

an

appropriate

BoxCox

transformation

to

the

time

axis

for

the

given

signal

in

order

to

obtain

a

new

stationary

data

set.

This

data

set

can

then

be

analyzed

by

standard

methods.

Processes

which

are

transformed

to

a

stationary

process

after

BoxCox

transformation

of

the

time

scale

are

called

G(?)

G

-stationary

processes,

where

is

the

corresponding

parameter

of

the

BoxCox

transformation.

In

this

paper

it

is

shown

that

the

standard

concept

of

stationarity

can

be

viewed

as

stationarity

under

a

linear

transformation

of

the

index

set,

while

transforming

time

(time

deformation)

by

a

non-linear

monotonic

transformation

introduces

the

concept

of

stationarity

on

a

non-linear

index

set.

Thus

the

notion

of

stationarity

is

broadened

considerably

to

allow

stationarity

on

different

scales.

The

method

is

illustrated

with

analysis

of

both

simulated

and

real

data.

Finally,

it

is

shown

that

such

processes

can

be

transformed

to

stationarity

by

sampling

properly.

The

software

for

performing

the

analysis

discussed

in

this

paper

can

be

downloaded

from

the

website

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


feedback-directed memory disambiguation through store distance analysis Feedback-directed optimization has developed into an increasingly important tool in designing optimizing compilers. Based upon profiling, memory distance analysis has shown much promise in predicting data locality and memory dependences, and has seen use in locality based optimizations and memory disambiguation. In this paper, we apply a form of memory distance, called store distance , to the problem of memory disambiguation in out-of-order issue processors. Store distance is defined as the number of store references between a load and the previous store accessing the same memory location. By generating a representative store distance for each load instruction, we can apply a compiler/micro-architecture cooperative scheme to direct run-time load speculation. Using store distance, the processor can, in most cases, accurately determine on which specific store instruction a load depends according to its store distance annotation. Our experiments show that the proposed store distance method performs much better than the previous distance based memory disambiguation scheme, and yields a performance very close to perfect memory disambiguation. The store distance based scheme also outperforms the store set technique with a relatively small predictor space and achieves performance comparable to that of a 16K-entry store set implementation for both floating point and integer programs.

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


Curves on a sphere, shift-map dynamics, and error control for continuous alphabet sources We consider two codes based on dynamical systems, for transmitting information from a continuous alphabet, discrete-time source over a Gaussian channel. The first code, a homogeneous spherical code, is generated by the linear,dynamical system (s) over dot = As, with A a square skew-symmetric matrix. The second code is generated by the shift map s(n) = b(n)s(n-1) (mod 1). The performance of each of these codes is determined by the geometry of its locus or signal set, specifically, its arc length and minimum distance, suitably defined. We show that the performance analyses for these systems are closely related, and derive exact expressions and bounds for relevant geometric parameters. We also observe that the lattice Z(N) underlies both modulation systems and we develop a fast decoding algorithm that relies on this observation. Analytic results show that for fixed bandwidth expansion, good scaling behavior of the mean squared error (mse) is obtained relative to the channel signal-to-noise ratio (SNR); Particularly interesting is the resulting observation that sampled, exponentially chirped modulation codes are good bandwidth expansion codes.

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

analog modulation
doubling map
error correction
flat torus
nonlinear mappings


1-vertex-fault-tolerant cycles embedding on folded hypercubes In this paper, we focus on a hypercube-like structure, the folded hypercube, which is basically a standard hypercube with some extra links between its nodes. Let f f be a faulty vertex in an n n -dimensional folded hypercube FQn F Q n . We show that FQn?{f} F Q n ? { f } contains a fault-free cycle of every even length from 4 to 2n?2 2 n ? 2 if n?3 n ? 3 and, furthermore, every odd length from n+1 n + 1 to 2n?1 2 n ? 1 if n?2 n ? 2 and n n is even.

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

interconnection networks
bipartite graphs
fault-tolerant embedding


Impact of demand correlation on the value of and incentives for information sharing in a supply chain Research on information sharing partnerships between manufacturers and retailers in a supply chain is relatively recent. The research has generally focused on models involving a single retailer or multiple retailers with independent demands. We analyze the value of demand information sharing in a one manufacturerN retailer model in which demands at the retailers during a time period may be correlated. We use the well known Shapley value concept from game theory to analyze the expected manufacturer and retailer shares of the surplus generated from information sharing. We find that demand correlation affects the magnitude and shape of the surplus function, which, in turn, impacts the relative incentives of the manufacturer and retailers to form such partnerships. Higher correlation increases (reduces) the manufacturer (retailer) surplus. However, the declining marginal manufacturer surplus under high correlation condition may induce the manufacturer to limit the number of retailer partners. The impact of correlation among retailer demands on the value of and incentives for information sharing can be explained using the substitutable and complementary nature of demand information when they are highly and weakly correlated respectively.

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

supply chain management
inter-organizational systems
value of information


Adaptive penalty likelihood for reconstruction of multidimensional confocal microscopy images In this paper we devise a penalty likelihood with noise constraints method to restore 2D and 3D confocal microscope images. Regularization is a commonly used technique in image restoration to balance restored image quality and noise suppression, but despite this noise is usually amplified. Taking into account common confocal imaging system degradation, we develop an algorithm by using a gradient descent method (PLGDA) to approach the minimum solution of the penalty likelihood equation. A Lagrange parameter controls the balance between the penalty and likelihood terms and is estimated using an adaptive method. We show that the a priori information is key to the regularization and Lagrange parameter estimation. The convergence characteristics are analysed and discussed. PLGDA and a traditional maximum likelihood expectation maximization are used to restore 2D and 3D confocal images. The point spread function (PSF), used to restore the data is collected from an experiment and modelled by bi-cubic splines to give an accurate noise free representation. Our experimental results show that the restored images are significantly improved by PLGDA.

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


eliciting domain expert misuseability conceptions In previous work we proposed the M-score measure for assigning a misuseability (i.e., sensitivity) score to data records. The M-score uses sensitivity score functions that should be acquired from domain experts. In this paper we present two different approaches for acquiring the required knowledge. In the first method the expert is asked to explicitly assign a sensitivity score to displayed records. The second method employs pairwise comparison approach. A field study indicates that the later method is preferable.

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

sensitivity score function
misuseability weight
m-score


Computer simulation of an adaptive control system for a free-flying space robotic module with flexible payload's transportation The synthesis and computer simulation of a control system for a free-flying space robotic module (SRM) are considered. It is assumed that the control system includes relay actuators. The mode of flexible payload transportation is analyzed. The control system is designed on the base of an adaptive coordinate-parametric control principle. The procedure of computer synthesis for a three-dimensional modal-physical dynamics model of the SRM plus a non-rigid payload (SRM-P) is described. The synthesis is made in MATLABs and MAPLEs computer systems. On the basis of numerical analyses of the space module's dynamic portrait, we have obtained the intensity dependence of the oscillations excited by relay control moments on the coordinates of the payload capture point. This dependence is represented by a multi-extremal function. Its global extremum (minimum) in the domain of admissible values for the argument is considered as the criterion in the task of choosing the optimal values of the payload capture point coordinates. The results of this task are used in the tuning of the capture point that makes it possible to avoid the resonance swing of the flexible payload and SRM-P as a whole. (C) 2002 IMACS. Published by Elsevier Science B.V. All rights reserved.

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


Location-based assisted handover for the IP Multimedia Subsystem The IP Multimedia Subsystem (IMS) is one promising candidate for merging currently deployed circuit-switched and packet-switched voice and data networks into a service-based All-IP architecture. One requirement common to all of these Next Generation Network (NGN) architectures is seamless user mobility - a mandatory feature in order to match with the tremendous success of today's circuit-switched GSM voice networks. In addition most NGN architectures mandate the support for heterogeneous access technologies like WLAN, WiMAX, GPRS/EDGE, UMTS/HSDPA which raises the need for seamless vertical handover between these access technologies. Despite ongoing standardisation and technology developments like Generic Access Network (GAN), Voice Call Continuity (VCC) or Media Independent handover (MIH, IEEE 802.21) we argue that there is currently no solution to enable seamless and application-transparent vertical handover in the IMS. In this paper, we review vertical handover standards for IMS and propose a novel vertical handover architecture which relies on geographical location and global network information as primary trigger or support for handover initiation. The underlying Session Initiation Protocol (SIP) notification framework - a Terminal-Centric IMS Location Enabler (LE) - is based on the key concept that location information is one specific kind of presence information which is optimally provisioned by mobile devices: the terminal knows best where it is located. The Location Enabler solicits notifications from the mobile device on specific events - e.g., entering or leaving specific geographical areas - thus dramatically reducing the amount of data transferred over the radio interface when compared to tracking or polling. The SIP registration and Re-Invite message flow is used to convey all handover-relevant information between the IMS core network and the mobile terminal. Using accurate access network measurement results the paper presents a performance estimation of the proposed vertical handover architecture with respect to handover duration and required handover area width at different velocities. (C) 2008 Elsevier B.V. All rights reserved.

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

handover
presence
location enabler
ip multimedia subsystem


A L-MCRS dynamics approximation by ELM for Reinforcement Learning Autonomous task learning for Linked Multicomponent Robotic Systems (L-MCRS) is an open research issue. Pilot studies applying Reinforcement Learning (RL) on Single Robot Hose Transport (SRHT) task need extensive simulations of the L-MCRS involved in the task. The Geometrically Exact Dynamic Spline (GEDS) simulator used for the accurate simulation of the dynamics of the overall system is a time expensive process, so that it is infeasible to carry out extensive learning experiments based on it. In this paper we address the problem of learning the dynamics of the L-MCRS encapsulated on the GEDS simulator using an Extreme Learning Machine (ELM) approach. Profiting from the adaptability and flexibility of the ELMs, we have formalized the problem of learning the hose geometry as a multi-variate regression problem. Empirical evaluation of this strategy achieves remarkable accurate approximation results.

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

linked multicomponent robotic systems
reinforcement learning


Effort flow analysis: a methodology for directed product evolution Part count reduction through part combination is a recognized goal of design for assembly (DFA). Some of the many benefits of part count reduction are: a reduced number of assembly operations, reduced procurement costs, cycle time reduction, supply chain reduction, and higher potential profits. In previous work, force flow analysis, a new technique to map forces as they flow across interfaces in a product, was shown to be successful at systematically providing creative insights for part combination. These insights arise by highlighting components having no relative motion between them. This paper presents a novel concept that extends the theoretical basis of force flow analysis to a much broader scope, referred to as effort flow analysis, addressing component combinations having varying degrees of relative motion. A systematic method for classifying these sets of components is given, and compliant mechanisms are presented as an example of successful combinations across interfaces with relative motion. Examples are provided for the redesign of a Quick Grip Clamp and a staple remover, both of which highlight a specific class of relative motion components.

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

design methods
product design
component combination
product modelling


AN ALGORITHMIC APPROACH TO PREFERENCE REPRESENTATION In a previous paper, the authors proposed an alternative approach to classical dimension theory, based upon a general representation of strict preferences not being restricted to partial order sets. Without any relevant restriction, the proposed approach was conceived as a potential powerful tool for decision making problems where basic information has been modeled by means of valued binary preference relations. In fact, assuming that each decision maker is able to consistently manage intensity values for preferences is a strong assumption even when there are few alternatives being involved (if the number of alternatives is large, the same criticism applies to crisp preferences). Any representation tool, as the one proposed by the authors, will in principle play a key role in order to help decision makers to understand their preference structure. In this paper we introduce an alternative approach in order to avoid certain complexity issues of the initial proposal, allowing a close representation easier to be obtained in practice.

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

preference representation
dimension theory

fuzzy preferences
multicriteria decision making


Information Rates of Densely Sampled Data: Distributed Vector Quantization and Scalar Quantization With Transforms for Gaussian Sources This paper establishes rates attainable by several lossy schemes for coding a continuous parameter source to a specified mean-squared-error distortion based on sampling at asymptotically large rates. First, a densely sampled, spatiotemporal, stationary Gaussian source is distributively encoded. The Berger-Tung bound to the distributed rate-distortion function and three convergence theorems are used to obtain an upper bound, expressed in terms of the source spectral density, to the smallest attainable rate at asymptotically large sampling rates. The bound is tighter than that recently obtained by Kashyap et al. Both indicate that with ideal distributed lossy coding, dense sensor networks can efficiently sense and convey a field, in contrast to the negative result obtained by Marco et al. for encoders based on scalar quantization and Slepian-Wolf distributed lossless coding. The second scheme is transform coding with scalar coefficient quantization. A new generalized transform coding analysis, as well as the aforementioned convergence theorems, is used to find the smallest attainable rate at asymptotically large sampling rates in terms of the source spectral density and the operational rate-distortion function of the family of quantizers, which in contrast to previous analyses need not be convex. The result shows that when a transform is used, scalar quantization need not cause the poor performance found by Marco et al. As a corollary, the final result pursues an approach, originally proposed by Berger, to show that the inverse water-pouring formula for the rate-distortion function can be attained at high sampling rates by transform coding with ideal vector quantization to encode the coefficients. Also established in the paper are relations between operational rate-distortion and distortion-rate functions for a continuous parameter source and those for the discrete parameter source that results from sampling.

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

continuous-time source coding
distributed source coding
lossy source coding
oversampling
rate-distortion theory


Knowledge input for the domain of information science A bibliometric and citation analysis study Purpose - The aim of this paper is to explore the knowledge input and the subject relationship with other disciplines for the domain of information science through a citation analysis, from the references of each article from 1998 to 2008, of four leading information science journals, Journal of the American Society for Information Science and Technology, Information Processing and Management, Journal of Information Science, and Journal of Documentation. Design/methodology/approach - The Ulrich's Periodical Directory, Library of Congress Subject Heading, retrieved from the WorldCat and LISA database were used to identify the main class, subclass and subject of cited journals and books. The highly cited journals and books, the main classes and subclasses of cited journals and books in papers of the four journals, the highly cited subjects in journals and books of library and information science were identified and analyzed. Findings - The study reveals that information science possessing strong self knowledge flow as these four source journals are also the four most cited. The class library science, book industries and trade, general information resources consists of a mainstream of knowledge flow into information science. The highly cited subjects of LIS journals encompass searching, online information retrieval, information work, subject indexing, World Wide Web, technical services, citation analysis, information seeking behavior, etc. The three most cited LCSH subjects on WorldCat of books are information storage and retrieval, information science, human-computer interaction, etc. Originality/value - The knowledge inputs for information science include mainly information science itself and social sciences and general science as well. Moreover, there are minor inputs from various subjects.

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

cited journals
knowledge input
journals
information science

bibliometric study
cited books
subject analysis
information science journal
information studies


performance of phase-silence-shift-keying for additive white gaussian noise and fading channels Both power- and bandwidth-efficient modulation method, Phase-Silence-Shift-Keying, is presented and its performance for additive white Gaussian and fading channels is investigated. Simulation results show that its power-efficiency property is maintained for both white Gaussian and fading channels.

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

bandwidth efficiency
power efficiency
orthogonal modulation
fading channel


A Theta(root n)-Depth Quantum Adder on the 2D NTC Quantum Computer Architecture In this work, we propose an adder for the 2-Dimensional Nearest-Neighbor, Two-Qubit gate, Concurrent (2D NTC) architecture, designed to match the architectural constraints of many quantum computing technologies. The chosen architecture allows the layout of logical qubits in two dimensions with root n columns where each column has root n qubits and the concurrent execution of one- and two-qubit gates with nearest-neighbor interaction only. The proposed adder works in three phases. In the first phase, the first column generates the summation output and the other columns do the carry-lookahead operations. In the second phase, these intermediate values are propagated from column to column, preparing for computation of the final carry for each register position. In the last phase, each column, except the first one, generates the summation output using this column-level carry. The depth and the number of qubits of the proposed adder are Theta(root n) and O(n), respectively. The proposed adder executes faster than the adders designed for the 1D NTC architecture when the length of the input registers n is larger than 51.

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

design
theory
quantum circuit
quantum arithmetic algorithms
2d ntc quantum computer architecture


Counterfactuals, Computation, and Consciousness Using a specially designed cellular automaton capable of emulating completely the function of a human brain, we explore ways in which counterfactual sensitivity, that is, the ability of a computational system to respond to any valid inputs, relates to discrete-state machine consciousness. In this computational framework, the distinction between a computation and the recording of a computation can be blurred arbitrarily, yet the physical implementation of the computation itself is unchanged. From this, we conclude that a purely computational account of consciousness is unsatisfactory.

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

computationalism
whole-brain emulation
cellular automata


MOSFET layout modifications for hump effect removal A statistics method of parametric measurement enabled the characterization of hump effect. With TCAD simulation in three dimensions, hump effect can be put in evidence. Hump effect can be suppressed by a MOSFET layout modification without impacted the reliability performances.

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

hump effect
reliability
characterization
simulation


Reorder buffer structure with shelter buffer for out-of-order issue superscalar processors The reorder buffer is usually employed to maintain the instruction execution in the correct order for a superscalar pipeline with out-of-order issue. In this paper, we propose a reorder buffer structure with shelter buffer for out-of-order issue superscalar processors not only to control stagnation efficiently, but also to reduce the buffer size. We can get remarkable performance improvement with only one or two buffers. Simulation results show that if the size of reorder buffer is between 8 and 32, performance gain obtained from the shelter is noticeable. For the shelter buffer of size 4, there is no performance improvement compared to that of size a,which means that the shelter buffer of size 2 is large enough to handle most of the stagnation. If the shelter buffer of size 2 is employed, we can reduce the reorder buffer by 44% in Whetstone, 50% in FFT. 60% in FM, and 75% in Linpack benchmark program without loss of any throughput. Execution time is also improved by 19.78% in Whetstone, 19.67% in FFT,23.93% in FM, and 8.65% in Linpack benchmark when the shelter buffer is used.

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

reorder buffer
stagnation
shelter buffer

superscalar processor
out-of-order issue


SHAPEan approach for self-healing and self-protection in complex distributed networks Increasing complexity of large scale distributed systems is creating problem in managing faults and security attacks because of the manual style adopted for management. This paper proposes a novel approach called SHAPE to self-heal and self-protect the system from various kinds of faults and security attacks. It deals with hardware, software, and network faults and provides security against DDoS, R2L, U2L, and probing attacks. SHAPE is implemented and evaluated against various standard metrics. The results are provided to support the approach.

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

grid computing
cloud computing
fault tolerance


Improved SAP based on adaptive directional prediction for HEVC lossless intra prediction ? It introduces a new method to estimate the prediction direction of each pixel. It introduces the frame-level pretreatment which greatly improves the speed. It could save the output bitrate by about 9.4158%. The encoding and decoding time are reduced by about 11%. When the PU size gets larger, the increase of output bitrate is the least.

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

intra-coding
lossless video coding
linear interpolation
prediction modes
adsap
frame-level pretreatment


Term disambiguation techniques based on target document collection for cross-language information retrieval: An empirical comparison of performance between techniques Dictionary-based query translation for cross-language information retrieval often yields various translation candidates having different meanings for a source term in the query. This paper examines methods for solving the ambiguity of translations based on only the target document collections. First, we discuss two kinds of disambiguation technique: (1) one is a method using term co-occurrence statistics in the collection, and (2) a technique based on pseudo-relevance feedback. Next, these techniques are empirically compared using the CLEF 2003 test collection for German to Italian bilingual searches, which are executed by using English language as a pivot. The experiments showed that a variation of term co-occurrence based techniques, in which the best sequence algorithm for selecting translations is used with the Cosine coefficient, is dominant, and that the PRF method shows comparable high search performance, although statistical tests did not sufficiently support these conclusions. Furthermore, we repeat the same experiments for the case of French to Italian (pivot) and English to Italian (non-pivot) searches on the same CLEF 2003 test collection in order to verity our findings. Again, similar results were observed except that the Dice coefficient outperforms slightly the Cosine coefficient in the case of disambiguation based on term co-occurrence for English to Italian searches.

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

cross-language information retrieval
dictionary-based query translation
term co-occurrence statistics
pseudo-relevance feedback
statistical comparison


automatic synthesis of near-threshold circuits with fine-grained performance tunability Near-Threshold Circuits achieve ultra-low energy operating with significant performance improvement and noise immunity as compared to sub-threshold circuits. However, near-threshold circuit performance is highly sensitive to static and dynamic threshold voltage variations. This makes designing circuits for a target performance very difficult, and post-silicon tunability is required to achieve performance targets without taking huge design margins. In this work, we tackle this problem by proposing a novel dual-Vdd technique for near-threshold operation and show that one can tune the performance of a circuit in a fine-grained manner by powering an optimal sub-set of rows with a slightly higher supply voltage than the rest, without incurring the large cost of distributed level shifters. By varying the percentage of rows at a slightly higher voltage, one can trade-off performance and power in a fine-grained manner. Experimental results show that by employing our dual-Vdd technique, we can improve the performance of several benchmarks up-to 45\% while achieving more than 50\% lower power as compared to single-V dd implementations.

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

sub-threshold performance
near threshold
dual vdd
sub-threshold
variability compensation
low power
ultra low power


Mobile-agent-based collaborative sensor fusion Information fusion can assist in the development of sensor network applications by merging capabilities, raw data and decisions from multiple sensors through distributed and collaborative integration algorithms. In this paper, we introduce a multi-layered, middleware-driven, multi-agent, interoperable architecture for distributed sensor networks that bridges the gap between the programmable application layer consisting of software agents and the physical layer consisting of sensor nodes. We adopt an energy-efficient, fault-tolerant approach for collaborative information processing among multiple sensor nodes using a mobile-agent-based computing model. In this model the sink/base-station deploys mobile agents that migrate from node to node following a certain itinerary, either pre-determined or determined on-the-fly, and fuse the information/data locally at each node. This way, the intelligence is distributed throughout the network edge and communication cost is reduced to make the sensor network energy-efficient. We evaluate the performance of our mobile-agent-based approach as well as that of the traditional client/server-based computing model, vis-a-vis energy consumption and execution time, through both analytical study and simulation. We draw important conclusions based on our findings. Finally, we consider a collaborative target classification application, supported by our architectural framework, to illustrate the efficacy of the mobile-agent-based computing model. (C) 2007 Elsevier B.V. All rights reserved.

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

sensor networks
collaborative information processing
mobile agents

agent-based systems
interoperable agent model


system-level exploration of run-time clusterization for energy-efficient on-chip communication System-level exploration of run-time power clusterization for energy-efficient on-chip communication is presented. Facilitated by multiple on-chip power-delivery-networks, areas of heavy or low traffics can be dynamically identified and adaptively supplied with new power schemes. This method is superior to design-time voltage island partitioning, in dealing with unpredictable spatial and temporal variations of communication traffics in large NoCs. Architectural design of the platform and online iterative configuration process are presented. The effectiveness of the proposed approach is demonstrated quantitatively on a NoC simulator with 65 nm power models. With synthetic traffic traces characterizing various communication patterns, run-time power clusterization achieves considerable energy benefits compared to existing energy-efficient architectures (9\%--42\% lower). The latency penalty is predictable and moderately bounded with minimal area overhead. The proposed architecture presents an ideal tradeoff, prioritizing energy efficiency, for massively parallel on-chip computing.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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-chip communication
run-time clusterization
energy-efficiency
system-level design
network-on-chip


An ESDIRK method with sensitivity analysis capabilities A new algorithm for numerical sensitivity analysis of ordinary differential equations (ODEs) is presented. The underlying ODE solver belongs to the Runge-Kutta family. The algorithm calculates sensitivities with respect to problem parameters and initial conditions, exploiting the special structure of the sensitivity equations. A key feature is the reuse of information already computed for the state integration, hereby minimizing the extra effort required for sensitivity integration. Through case studies the new algorithm is compared to an extrapolation method and to the more established BDF based approaches. Several advantages of the new approach are demonstrated, especially when frequent discontinuities are present, which renders the new algorithm particularly suitable for dynamic optimization purposes. (C) 2004 Elsevier Ltd. All rights reserved.

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

sensitivity analysis
dynamic optimization

runge-kutta methods
nonlinear model predictive control


best practices for designing third party applications for contextually-aware tools This experience report examines the user interface designs of Twitter and selected third party Twitter applications: Tweetdeck and Brizzly. Since participants are using different tools to communicate across the same system, Twitter users have different communication expectations. Evaluating Twitter and these tools based on usability heuristics found in activity theory and Morville's notion of findability, we argue for the normalization of these tools based on a set of mental models and affordances for Twitter. From this basis, we will report on how third-party clients more effectively exploit Twitter's affordances by making the streams, and thus the user's experiences, modular, emergent, and contextual. By comparing the UIs of Tweetdeck and Brizzly, along with that of Twitter's own web-based UI, we will assess how these clients allow participants to adapt Twitter streams to their own communication needs. The flexibility given to users via such clients serves as a tremendous signpost to the nature of and need for modular, context-aware experiences in communication channels as information content evolves. Not only do the social networks themselves need to be articulated and modular, but so do the UIs through which users engage with these networks. We argue that these features are critical for social media participants. Based on our analysis of Tweetdeck and Brizzly, we develop a set of best practices that should guide the research and design of participant experiences in social media and the third-party applications that many of them often use.

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

heuristics
usability
twitter
design
social media

social networking systems
third party tools


Combining conformational sampling and selection to identify the binding mode of zinc-bound amyloid peptides with bifunctional molecules The pathogenesis of Alzheimer's disease (AD) has been suggested to be related with the aggregation of amyloid beta (A beta) peptides. Metal ions (e.g. Cu, Fe, and Zn) are supposed to induce the aggregation of A beta. Recent development of bifunctional molecules that are capable of interacting with A beta and chelating biometal ions provides promising therapeutics to AD. However, the molecular mechanism for how A beta, metal ions, and bifunctional molecules interact with each other is still elusive. In this study, the binding mode of Zn2+-bound A beta with bifunctional molecules was investigated by the combination of conformational sampling of full-length A beta peptides using replica exchange molecular dynamics simulations (REMD) and conformational selection using molecular docking and classical MD simulations. We demonstrate that Zn2+-bound A beta((1-40)) and A beta((1-42)) exhibit different conformational ensemble. Both A beta peptides can adopt various conformations to recognize typical bifunctional molecules with different binding affinities. The bifunctional molecules exhibit their dual functions by first preferentially interfering with hydrophobic residues 17-21 and/or 30-35 of Zn2+-bound A beta. Additional interactions with residues surrounding Zn2+ could possibly disrupt interactions between Zn2+ and A beta, which then facilitate these small molecules to chelate Zn2+. The binding free energy calculations further demonstrate that the association of A beta with bifunctional molecules is driven by enthalpy. Our results provide a feasible approach to understand the recognition mechanism of disordered proteins with small molecules, which could be helpful to the design of novel AD drugs.

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


An ensemble uncertainty aware measure for directed hill climbing ensemble pruning This paper proposes a new measure for ensemble pruning via directed hill climbing, dubbed Uncertainty Weighted Accuracy (UWA), which takes into account the uncertainty of the decision of the current ensemble. Empirical results on 30 data sets show that using the proposed measure to prune a heterogeneous ensemble leads to significantly better accuracy results compared to state-of-the-art measures and other baseline methods, while keeping only a small fraction of the original models. Besides the evaluation measure, the paper also studies two other parameters of directed hill climbing ensemble pruning methods, the search direction and the evaluation dataset, with interesting conclusions on appropriate values.

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


Embodied cognition and the Orwells problem in cognitive science Embodied approach to cognition has taken roots in cognitive studies with developments in diverse fields such as robotics, artificial life and cognitive linguistics. Taking cue from the metaphor of a Watt governor, this approach stresses on the coupling between the organism and the environment and the continuous nature of the cognitive processes. This results in questioning the viability of computationalrepresentational understanding of mind as a comprehensive theory of cognition. The paper, after giving an overview of embodied approach based on some examples from conceptual metaphor theory, looks into a special case of Orwells problem in cognitive science. The problem is that there is so much evidence for embodiment to be true, yet there is little understanding of the same. I shall try to solve this problem by pointing out that it is our inveterate habits of perceiving ourselves that makes the embodied approach appear implausible. Studies on free will as well as the importance of the unconscious in overall cognitive processing raise challenging questions on our self-conception. A revision in the self-conception in the light of these findings will pave the way for a better appreciation of the embodied approach to cognition.

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

embodied cognition
orwells problem
conceptual metaphor theory


Using RDF to describe networks Conventions such as iGrid 2005 and SuperComputing show that there is increasing demand for more service options on networks. For such networks, large teams of experts are needed to configure and manage them. In order to make the full potential of hybrid networks available to the ordinary user, the complexity must be reduced. This paper presents the idea of the Network Description Language (NDL), which builds on Semantic Web techniques to create a distributed Topology Knowledge Base (TKB). The TKB can provide a collection of reachability graphs, showing connectivity rules among physical and/or virtual entities. Latching onto the Semantic Web provides network management with a new breed of toolsbots, compilers, browsers, both commercial off-the-shelf (COTS) and open source. The approach appears to be applicable to the Global Lambda Integrated Facility (GLIF) as well as other experimental communities.

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

network descriptions
resource description framework


sensation-based photo cropping This paper proposes a novel method for automatically cropping a photo using a quality classifier that assesses whether the cropped region is agreeable to users. We statistically build this quality classifier using large photo collections available on websites where people manually insert quality scores to photos. We first trim the original image and then decide on the candidates for cropping. We find the cropped region with the highest quality score by applying the quality classifier to the candidates. Current automatic photo cropping techniques search for attention grabbing regions that consist of salient pixels from the original photo. They are not always pleasant to users because they do not take into account the quality of the cropped region. Our method with the quality classifier outperforms a state-of-the-art method that takes into consideration only the user's attention for automatic photo cropping.

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


compiling fortran 8x array features for the connection machine computer system The Connection Machine computer system supports a data parallel programming style, making it a natural target architecture for Fortran 8x array constructs. The Connection Machine Fortran compiler generates VAX code that performs scalar operations and directs the Connection Machine to perform array operations. The Connection Machine virtual processor mechanism supports elemental operations on very large arrays. Most array operators and intrinsic functions map into single instructions or short instruction sequences. Noncontiguous array sections, array-valued subscripts, and parallel constructs such as WHERE and FORALL are also readily accommodated on the Connection Machine. In addition to such customary optimizations as common subexpression elimination, the CM Fortran compiler minimizes data motion for aligning array operations, minimizes transfers between the Connection Machine and the VAX and minimizes context switching for masked computations.

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

processor aligning parallel architecture code context arrays instruction data connection motion

program
systems
optimality
computation
operability
compilation
switch
data parallelism
feature
virtualization
sequence


A review on the public benchmark databases for static keystroke dynamics Keystroke dynamics allows to authenticate individuals through their way of typing their password or a free text on a keyboard. In general, in biometrics, a novel algorithm is validated through a comparison to the state of the art one's using some datasets in an offline way. Several benchmark datasets for keystroke dynamics have been proposed in the literature. They differ in many ways and their intrinsic properties influence the performance of the algorithms under evaluation. In this work, we (a) provide a literature review on existing benchmark datasets of keystroke dynamics; (b) present several criteria and tests in order to characterize them; (c) and apply these criteria on these available public benchmark datasets. The review analysis shows a great disparity in the acquisition protocol, the population involved, the complexity of the passwords, or the expected performance (there is a relative difference of 76% between the EER on the worst and best performing datasets with the same authentication method).

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

benchmark algorithms
biometric performance evaluation
online and offline computation


Efficient index generation for compiling two-level mappings in data-parallel programs This paper presents compilation techniques used to compress holes, which are caused by the nonunit alignment stride in a two-level data-processor mapping. Holes are the memory locations mapped by useless template cells. To fully utilize the memory space, memory holes should be removed, In a two-level data-processor mapping, there is a repetitive pattern for array elements mapped onto processors. We classify blocks into classes and use a class table to record the distribution of each class in the first repetitive data distribution pattern. Similarly, data distribution on a processor also has a repetitive pattern. We use a compression table to record the distribution of each block in the first repetitive data distribution pattern on a processor. By using a class table and a compression table, hole compression can be easily and efficiently achieved. Compressing holes can save memory usage, improve spatial locality and further improve system performance, The proposed method is efiicient, stable, and easy to implement. The experimental results do confirm the advantages of our proposed method over existing methods. (C) 2000 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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

communication set
distributed-memory multicomputers
high performance fortran
two-level data-processor mapping


Numerical modelling and finite element analysis of stress wave propagation for ultrasonic pulse velocity testing of concrete Stress wave propagation through concrete is simulated by finite element analysis. The concrete medium is modeled as a homogeneous material with smeared properties to investigate and establish the suitable finite element analysis method (explicit versus implicit) and analysis parameters (element size, and solution time increment) also suitable for rigorous investigation. In the next step, finite element analysis model of the medium is developed using a digital image processing technique, which distinguishes the mortar and aggregate phases of concrete. The mortar and aggregate phase topologies are, then, directly mapped to the finite element mesh to form a heterogeneous concrete model. The heterogeneous concrete model is then used to simulate wave propagation. The veracity of the model is demonstrated by evaluating the intrinsic parameters of nondestructive ultrasonic pulse velocity testing of concrete. Quantitative relationships between aggregate size and testing frequency for nondestructive testing are presented.

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

concrete
nondestructive testing
ultrasonic pulse velocity
finite element analysis
digital image processing

explicit dynamic analysis
heterogeneous model


A globally stable adaptive congestion control scheme for Internet-style networks with delay In this paper, we develop, analyze and implement a congestion control scheme in a noncooperative game framework, where each user's cost function is composed of a pricing function proportional to the queueing delay experienced by the user, and a fairly general utility function which captures the user demand for bandwidth. Using a network model based on fluid approximations and through a realistic modeling of queues, we establish the existence of a unique equilibrium as well as its global asymptotic stability for a general network topology, where boundary effects are also taken into account. We also provide sufficient conditions for system stability when there is a bottleneck link shared by multiple users experiencing nonnegligible communication delays. In addition, we study an adaptive pricing scheme using hybrid systems concepts. Based on these theoretical foundations, we implement a window-based, end-to-end congestion control scheme, and simulate it in ns-2 network simulator on. various network topologies with sizable propagation delays.

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

control theory
economics
internet
mathematical programming/optimization
noncooperative games
simulations


Assessment of Sex Offenders Notwithstanding significant progress in the areas of risk appraisal and treatment of sex offenders, the contention is that further advancements could be realized through attention to research on non-sex offenders. Specifically, it is proposed that sex offenders share many characteristics of non-sex offenders and research with these populations should be integrated, not discrete. In particular, work in the area of multi-method offender assessment regarding criminogenic need is highlighted to suggest common treatment targets for sex offenders and non-sex offenders. As well, recent research in terms of treatment readiness is described and contrasted with the constructs of denial and minimization. Measurement strategies for cognitive schemas in use with violent offenders are also presented in order to expand the repertoire of approaches clinicians might consider as part of an assessment protocol. Further, performance-based measures of empathy and relapse prevention are described and compared with self-reports in terms of program participation and social desirability. Finally, a brief discussion of change scores and their application to post-treatment risk appraisal is provided, as is the requirement for a systematic decision model to inform post-treatment supervision.

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


Orthogonal slicing for additive manufacturing We propose an accuracy optimization algorithm for additive manufacturing methods. We decompose 3D shapes into parts that are fabricated along an optimal direction. Benefits of our method show for objects that do not fit the fabrication space.

O O O O O O O O O O O O O O O O O O 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 study on the mining access patterns from Web log data Nowadays, the World Wide Web is continuing to expand at an amazing rate as a medium for conducting business in addition to disseminating information. and Web users are remarkably increasing, Human activities in virtual space as the Web are producing large volumes of data. and Web data mining to extract information from Web data has become an important research area. In this paper, we examine the features of Web log data and propose a method for transaction identification, We also introduce a new problem of user segmentation and present a method for solving this problems.

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

transaction identification
user segmentation
web data mining


Adaptive fuzzy mimo control of induction motors This paper presents a new adaptive fuzzy control technique applied to induction motors (IM). The control task of such motors is considered complicated by the fact that these motors have uncertain time-varying parameters and are subjected to unknown load disturbance. A nonlinear multi-input multi-output (MIMO) state feedback linearizing control is designed for the IM modeled in a stationary reference frame. An adaptive fuzzy controller is proposed to estimate the unknown nonlinear functions that appear in the state feedback inputoutput linearizing control. Simulation results are presented to validate the effectiveness of the proposed controller even in the presence of motor parameter variations and unknown load disturbance.

O O O O O B I O O O O O O B I O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 control
feedback linearization
nonlinear mimo system


On-board Pedestrian Detection by the Motion and the Cascaded Classifiers This paper presents a general algorithm for pedestrian detection by on-board monocular camera, which can be applied to cameras of various viewing angle. The foreground objects which have discriminative motion-differences compared to that of background buildings are extracted as Regions of Interest (ROIs). Then, those ROIs are tracked by Spatio-Temporal MRF(S-T MRF) model as a possible pedestrian. Before classification process, some ROIs are rejected quickly by geometric constraints, calculated from coordinates between position of ROI and heights in real-world. Finally, ROIs are verified by HOG/Fisher cascade. The geometrical pre-processing saves the overall computational costs as well as decrease false positive rate. Also, algorithm compensates the detection rate due to temporal classification error in tracking cues, which improves the stability of tracking.

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


Affine invariant object shape matching using genetic algorithm with multi-parent orthogonal recombination and migrant principle Genetic algorithm has served as a viable means for object shape matching. However, the success rate of correctly matching a pair of contours is generally low and inconsistent. In this paper a novel scheme based on the integration of two techniques: the migrant principle and multi-parent orthogonal recombination, are introduced to alleviate the problem. The proposed algorithm has been evaluated with object contours that are captured under good lighting condition, as well as images that have been contaminated with noise. In both cases experimental results revealed that the proposed method exhibited superior performance over its peers in terms of stability, speed, and success rate.

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

latin square
multi-parent crossover
affine invariant shape matching


Titanium nitride electrodes for micro-gap discharge Titanium and titanium nitride (TiN) were used as thin film electrodes for a micro-gap discharge device. The titanium electrodes were fabricated by sputter deposition of pure titanium accompanied with a lift-off process. The TiN electrodes were prepared by nitriding the titanium electrodes with nitrogen plasma. Gas discharges between the electrodes at various argon pressures were characterized and their breakdown voltages were compared. Both the titanium and TiN electrodes have a minimum breakdown voltage about 220V at a pressure spacing product (Pd) of 0.8mbarcm. The nitrided electrodes were more durable than the as-deposited titanium electrodes upon a DC discharge for 5s or 200 cycles of electrostatic discharge.

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


Pseudo d-algebras We introduce the notion of a pseudo d-algebra as a generalization of the idea of a d-algebra. The class of pseudo d-algebras can be included in the class of coupled d-algebras. We show that the class of pseudo d-algebras behaves well with respect to standard mappings such as direct products and standard mappings such as homomorphisms. Indeed, we are able to prove a fundamental theorem of homomorphisms and we are able to identify kernel objects as d-ideals in this theory. We also discuss several large classes of examples of pseudo d-algebras which occur in different settings and we identify properties sufficient for or equivalent to membership in important subclasses of the class of pseudo d-algebras in these settings.

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


High performance dynamic voltage/frequency scaling algorithm for real-time dynamic load management Modern cyber-physical systems assume a complex and dynamic interaction between the real world and the computing system in real-time. In this context, changes in the physical environment trigger changes in the computational load to execute. On the other hand, task migration services offered by networked control systems require also management of dynamic real-time computing load in nodes. In such systems it would be difficult, if not impossible, to analyse off-line all the possible combinations of processor loads. For this reason, it is worthwhile attempting to define new flexible architectures that enable computing systems to adapt to potential changes in the environment. We assume a system composed by three main components: the first one is responsible of the management of the requests arisen when new tasks require to be executed. This management component asks to the second component about the resources available to accept the new tasks. The second component performs a feasibility analysis to determine if the new tasks can be accepted coping with its real-time constraints. A new processor speed is also computed. A third component monitors the execution of tasks applying a fixed priority scheduling policy and additionally controlling the frequency of the processor. This paper focus on the second component providing a correct (a task never is accepted if it is not schedulable) and near-exact (a task is rarely rejected if it is schedulable) algorithm that can be applicable in practice because its low/medium and predictable computational cost. The algorithm analyses task admission in terms of processor frequency scaling. The paper presents the details of a novel algorithm to analyse tasks admission and processor frequency assignment. Additionally, we perform several simulations to evaluate the comparative performance of the proposed approach. This evaluation is made in terms of energy consumption, task rejection ratios, and real computing costs. The results of simulations show that from the cost, execution predictability, and task acceptance points of view, the proposed algorithm mostly outperforms other constant voltage scaling algorithms.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 voltage scaling
real-time scheduling
power consumption


Inconsistency-Tolerant Integrity Checking All methods for efficient integrity checking require all integrity constraints to be totally satisfied, before any update is executed. However, a certain amount of inconsistency is the rule, rather than the exception in databases. In this paper, we close the gap between theory and practice of integrity checking, i.e., between the unrealistic theoretical requirement of total integrity and the practical need for inconsistency tolerance, which we define for integrity checking methods. We show that most of them can still be used to check whether updates preserve integrity, even if the current state is inconsistent. Inconsistency-tolerant integrity checking proves beneficial both for integrity preservation and query answering. Also, we show that it is useful for view updating, repairs, schema evolution, and other applications.

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

integrity checking
inconsistency tolerance


Drawing colored graphs on colored points Let G be a planar graph with n vertices and with a partition of the vertex set into subsets V(0), ... , V(k-1) for some positive integer 1 <= k <= n. Let S be a set of n distinct points in the plane with a partition into subsets So, ... ,S(k-1) with vertical bar V(i)vertical bar=vertical bar S(i)vertical bar (0 <= i <= k - 1). This paper studies the problem of computing a planar polyline drawing of G, such that each vertex of V(i) is mapped to a distinct point of S(i). Lower and upper bounds on the number of bends per edge are proved for any 2 <= k <= n. In the special case k = n, we improve the upper and lower bounds presented in a paper by Pach and Wenger [J. Pach, R. Wenger, Embedding planar graphs at fixed vertex locations, Graphs and Combinatorics 17 (2001) 717-728]. The upper bound is based on an algorithm for computing a topological book embedding of a planar graph, such that the vertices follow a given left-to-right order and the number of crossings between every edge and the spine is asymptotically optimal, which can be regarded as a result of independent interest. (C) 2008 Elsevier B.V. All rights reserved.

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

graph drawing
computational geometry
point-set embedding
graph hamiltonicity


Ubiquitous e-learning with multimodal multimedia devices The Sharable Content Object Reference Model (SCORM) is a set of specifications and guidelines for the representation and operation of asynchronous distance learning. Since it was announced in late 1990s, the reference model has been used by software developers and academics in the development of authoring tools, learning management systems, and repositories for distance learning content. To date, most e-learning systems have been based on multimedia and Web technologies on personal computers. Our project, Hard SCORM, advances the field by implementing an integrated system which allows learners to read SCORM-compliant textbooks using multimodal multimedia devices. Hard SCORM employs a pen-like optical character reader device (called Hyper Pen) as an input mechanism. A computer, a personal digital assistant, or a cellular phone can be used for user behavior supervision using the Hard SCORM Machine. With an authoring tool, specially designed tags are printed in textbooks and recognized by Hyper Pen for user navigation control. In this way, users can read hardcopy textbooks in a traditional manner while the process of reading conforms to the SCORM specification. Part of the implemented system (Pocket SCORM on PDA) received the 2005 Brandon Hall Excellence in Learning Awards. The system has also been used by an airline company for online security checking and a high school for online mobile learning.

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

augmented paper
ieee lom
mobile devices
web service


Modeling geological objects with the XML Schema Interchange, storage, and management of geological data require the development of knowledge-based, standardized vocabularies and data structures. Concepts modeled and designed with the Unified Markup Language (UML), can be mapped into XML Schema Definition Language (XSDL) to compose modular markup languages for each discipline. Developing such efficient, intra-disciplinary, modular and reusable components, based on the XSDL namespace facility and the principles of object-oriented design, reduces redundancy, increases efficiency, scalability, and extensibility, and simplifies the maintenance and future extension of the code. This paper discusses the best practices of composition and reuse of modular intra-disciplinary components by applying XML Schema namespace syntax. In addition to several small examples given for a variety of geological cases, the paper constructs a UML conceptual model and markup language, applying an XML-type library, for a component of the plate tectonics knowledge base (TectonicsML) that deals with the divergent plate boundary.

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

knowledge management
modeling with uml
metadata


GPU-Based Local Tone Mapping in the Context of Virtual Night Driving Virtual prototyping of automotive headlights requires a realistic illumination model, capable of rendering scenes of high contrast in fine detail. Due to the high dynamic range (HDR) nature of headlight beam-pattern data, which is projected onto the virtual road, high dynamic range illumination models are required. These are used as the basis for illumination in simulations for automotive headlight virtual prototyping. Since high dynamic range illumination models operate on brightness ranges commensurate with the real world, a postprocessing operation, known as tone mapping, is required to map each frame into the device-specific range of the display hardware. Algorithms for tone mapping, called tone-mapping operators, can be classified as global or local. Global operators are efficient to compute at the expense of scene quality. Local operators preserve scene detail, but, due to their additional computational complexity, are rarely used with interactive applications. Local tone-mapping methods produce more usable visualization results for engineering tasks. This paper proposes a local tone-mapping method suitable for use with interactive applications. To develop a suitable tone-mapping operator, a state of the art local tone-mapping method was accelerated using modern, work-efficient GPU (graphics processing unit) algorithms. Optimal performance, both in terms of memory and speed, was achieved by means of general-purpose GPU programming with CUDA (compute unified device architecture). A prototypic implementation has shown that the method works well with high dynamic range OpenGL applications. In the near future, the tone mapper will be integrated into the virtual night driving simulator at our institute.

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

local tone mapping
virtual prototyping
automotive headlights
cuda

hdr rendering
general-purpose gpu programming
summed area tables


simulation in pascal with micro passim The micro PASSIM package is designed to support combined simulation modeling in Pascal, including the coordinated sequencing of discrete events and the integration of continuous variables. The package features dynamic interaction through user and system menus, resource and queue management, random number streams and generation of statistical distributions, the collection of statistics, report generation, tracing of transactions, dynamic model interaction and character graphics display of model evolution. Event scheduling and process interaction world views are supported. The modeler writes the model in Pascal using the procedures from the simulation library for support. The model and support procedures are compiled together to provide a stand-alone simulation program. Version mP 3.1 using Turbo Pascal supports high resolution graphics. Complete source code is provided for either Turbo or Vax Pascal. Version mp 3.1 M2 in Modula-2 is now available.

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

scheduling statistics generation simulation event evolution graphics model user management interaction character views dynamic process support version resource

traces collect libraries randomization variability systems procedure packaging source-code distributed feature continuation transaction sequence completeness integrability


Inferring Boolean functions via higher-order correlations Both the Walsh transform and a modified Pearson correlation coefficient can be used to infer the structure of a Boolean network from time series data. Unlike the correlation coefficient, the Walsh transform is also able to represent higher-order correlations. These correlations of several combined input variables with one output variable give additional information about the dependency between variables, but are also more sensitive to noise. Furthermore computational complexity increases exponentially with the order. We first show that the Walsh transform of order 1 and the modified Pearson correlation coefficient are equivalent for the reconstruction of Boolean functions. Secondly, we also investigate under which conditions (noise, number of samples, function classes) higher-order correlations can contribute to an improvement of the reconstruction process. We present the merits, as well as the limitations, of higher-order correlations for the inference of Boolean networks.

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

boolean networks
correlation
noise
walsh transform

systems biology
network inference
fourier transform


Analyzing and shaping human attentional networks In this paper we outline a conception of attentional networks arising from imaging studies as connections between activated brain areas carrying out localized mental operations. We consider both the areas of functional activation (nodes) and the structural (DTI) and functional connections (I)CM) between them in real time (EEG, frequency analysis) as important tools in analyzing the network. The efficiency of network function involves the time course of activation of nodes and their connectivity to other areas of the network. We outline landmarks in the development of brain networks underlying executive attention from infancy and childhood. We use individual differences in network efficiency to examine genetic alleles that are related to performance. We consider how animal studies might be used to determine the genes that influence network development. Finally we indicate how training may aid in enhancing attentional networks. Our goal is to show the wide range of methods that can be used to suggest and analyze models of network function in the study of attention. (c) 2006 Elsevier Ltd. All rights reserved.

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

dcm (dynamic causal model for connectivity analysis)

fmri (functional magnetic resonance imaging)