evaluation of cross-layer interactions for reconfigurable radio platforms The flexibility of cognitive and software defined radio heralds an opportunity for researchers to reexamine how network protocol layers operate with respect to providing quality of service aware transmission among wireless nodes. This opportunity is enhanced by the continued development of spectrally responsive devices; ones that can detect and respond to changes in the radio frequency environment. Present wireless network protocols define reliability and other performance related tasks narrowly within layers. For example, the frame size employed on 802.11 can substantially influence the throughput, delay and jitter experienced by an application, but there is no simple way to adapt this parameter. Furthermore, while the data link layer of 802.11 provides error detection capabilities across a link, it does not specify additional features, such as forward error correction schemes, nor does it provide a means for throttling retransmissions at the transport layer (currently the data link and transport layer can function counterproductively with respect to reliability). This paper presents analysis on the interaction of physical, data link and network layer parameters with respect to throughput, bit error rate, delay and jitter. This analysis relies on Design of Experiment (DOE) techniques to determine the relationships among input and output variables. With this technique, we are able to demonstrate statistically significant single and multi-factor interactions. The goal of this analysis is to identify opportunities where systems designers might exploit cross-layer interactions to improve the performance of Voice over IP (VoIP), Instant Messaging (IM) and file transfer applications. The views expressed in this article are those of the author and do not reflect the official policy or position of the United States Air Force, Department of Defense, or the U.S. Government.

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

optimization
cognitive radio
software-defined radio
wireless system
cross-layer
adaptive


Mechanobiological bone growth: comparative analysis of two biomechanical modeling approaches Mechanobiological growth is the process whereby bone growth is modulated by mechanical loading. Analytical formulations of mechanobiological growth have been developed by Stokes et al. (J Orthop Res 17(5):646653, 1990) and Carter et al. (J Orthop Res 6:804816, 1988). The purpose of this study was to compare these two modeling approaches in a finite element model of a vertebra to investigate whether growth pattern induced by these models were equivalent. A finite element model of a thoracic vertebra, integrating a conceptual model of the growth plate, was developed and combined with the mechanobiological growth models. This model was further used to simulate vertebral growth modulation resulting from different physiological loading conditions. Different growth magnitudes were obtained under compression and combined tension/shear loading, whereas dissimilar growth patterns were triggered by shear forces and combined compression/shear. These two models represent mechanobiological bone growth under limited mechanical environment. Carters model takes into account three-dimensional stress stimuli, but does not intrinsically incorporate the resulting growth orientation. Stokes model adequately represents the mechanobiological contribution of axial stresses but does not take into account the contribution of non-axial stresses, which can occur in complex mechanical environment.

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

mechanobiological growth
finite element model
vertebral growth
growth plate
mechanical loading


Numerical investigation of mid-infrared emission from Pr\(^{3+}\) doped GeAsGaSe fibre The experimentally obtained luminescence characteristics of a praseodymium (Pr\(^{3+})\) doped chalcogenide glass fiber are studied numerically using a rate equation approach. The numerical model includes both the radiative and non-radiative transition paths whilst it neglects the up-conversion processes. Photoluminescence spectra at mid-infrared wavelengths ranging from 3.5 to 6\({\upmu }\)m were obtained by using two pump wavelengths: 1.55 and 1.94\({\upmu }\)m. A good agreement between the experiment and theory is obtained for the photoluminescence decay profiles.

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 O O O O O O O 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 Markov-type inequality for multivariate polynomials on a convex body A Markov-type inequality for the k-homogeneous part of a multivariate polynomial on a convex centrally symmetric body is given and an extremal polynomial is found. This generalizes and extends some estimates for univariate and multivariate polynomials obtained by Markov, Bernstein, Visser, Reimer, and Rack.

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


Some effective approaches to check the identifiability of uncontrolled nonlinear systems The problem of identifiability of parameters has hardly ever been considered in the case of uncontrolled systems whereas many efficient methods have been developed for controlled systems. In this paper, we are pointing out two procedures to get global identifiability results of uncontrolled nonlinear systems. The first one derives from an algorithm. proposed by Ljung and Glad, It is based on differential algebra and its complexity, due to the system size, does not increase as fast as the complexity of their algorithm. The second one is a heuristic approach. It builds a new model from various input datasets which expresses an experimental reality. Therefore, we will analyze the identifiability of this new model. Indeed, this procedure has been tested on an intricate system for which the other methods failed and it has given global identifiability results. (C) 2001 WACS. Published by Elsevier Science 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 B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

structural (global and local) identifiability


How to psychoanalyze a robot: Unconscious cognition and the evolution of intentionality According to a common philosophical distinction, the 'original' intentionality, or 'aboutness' possessed by our thoughts, beliefs and desires, is categorically different from the 'derived' intentionality manifested in some of our artifacts - our words, books and pictures, for example. Those making the distinction claim that the intentionality of our artifacts is 'parasitic' on the 'genuine' intentionality to be found in members of the former class of things. In Kinds of Minds: Toward an Understanding of Consciousness, Daniel Dennett criticizes that claim and the distinction it rests on, and seeks to show that "metaphysically original intentionality" is illusory by working out the implications he sees in the practical possibility of a certain type of robot, i.e., one that generates 'utterances' which are 'inscrutable to the robot's designers' so that we, and they, must consult the robot to discover the meaning of its utterances. I argue that the implications Dennett finds are erroneous, regardless of whether such a robot is possible, and therefore that the real existence of metaphysically original intentionality has not been undermined by the possibility of the robot Dennett describes.

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

agreements and practices
fallacy of composition
false dichotomy
genetic fallacy
intrinsic/original intentionality
robot utterances


Data weighting method on the basis of binary encoded output to solve multi-class pattern classification problems Data weighting is of paramount importance with respect to classification performance in pattern recognition applications. In this paper, the output labels of datasets have been encoded using binary codes (numbers) and by this way provided a novel data weighting method called binary encoded output based data weighting (BEOBDW). In the proposed data weighting method, first of all, the output labels of datasets have been encoded with binary codes and then obtained two encoded output labels. Depending to these encoded outputs, the data points in datasets have been weighted using the relationships between features of datasets and two encoded output labels. To generalize the proposed data weighting method, five datasets have been used. These datasets are chain link (2 classes), two spiral (2 classes), iris (3 classes), wine (3 classes), and dermatology (6 classes). After applied BEOBDW to five datasets, the k-NN (nearest neighbor) classifier has been used to classify the weighted datasets. A set of experiments on used real world datasets demonstrated that the proposed data weighting method is a very efficient and has robust discrimination ability in the classification of datasets. BEOBDW method could be confidently used before many classification algorithms.

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

binary encoded output based data weighting (beobdw)


Cloudlet-screen computing: a client-server architecture with top graphics performance This paper presents a three-decoupling-boundary theory and classification for performance analysis of client-server architectures. Based on the analysis, a novel client-server architecture with top graphics performance is proposed. The client is only a display screen plus a few Human-Interface-Devices such as a mouse-keyboard-set or touchscreen with an optional mobile storage. The client is connected to a remote or nearby server (cloudlet) by a low latency link transferring primarily post-GPU display screen and HID data. By following exactly the same most-efficient CPU-GPU-screen graphics rendering pipeline from initial graphics primitives to final pixels as that in the traditional computer graphics architecture developed and optimised in the past decades, the architecture has higher graphics and multimedia performance than any other client-server and cloud-mobile computing architectures, e.g. VNC, Remote Desktop, VDI, Zero-client, and PCoIP. No read back of frame buffers as virtualised screen is necessary, so no CPU/GPU overhead occurs and display latency is minimised.

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

pervasive cloud-mobile computing
client-server
screen content coding
ubiquitous computing
graphics, video, network


A syntactic correspondence between context-sensitive calculi and abstract machines We present a systematic construction of environment-based abstract machines from context-sensitive calculi of explicit substitutions, and we illustrate it with ten calculi and machines for applicative order with an abort operation, normal order with generalized reduction and call/cc, the lambda-mu-calculus, delimited continuations, stack inspection, proper tail-recursion, and lazy evaluation. Most of the machines already exist but they have been obtained independently and are only indirectly related to the corresponding calculi. All of the calculi are new and they make it possible directly to reason about the execution of the corresponding machines. (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 B I O O O O O O O O O O O O O O O O O O O O O O O O O O B B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

continuations
explicit substitutions
stack inspection

refocusing
reduction semantics
contexts
delimited continuations
defunctionalization
environment-based machines
proper tail recursion


Stability and convergence of nonconforming hp finite-element methods The stability and convergence of nonconforming hp finite-element methods, in particular, the mortar finite-element method and its variants, are established based on a new stability measure for these methods. Using a generalized eigenvalue analysis, estimates for this measure are computed numerically. Our numerical results demonstrate that these nonconforming methods prove to be good candidates for hp, implementation and also behave as well as conforming finite-element methods. The discussion here is primarily in two dimensions, but some extensions to three dimensions are presented as well. (C) 2003 Elsevier Science Ltd. All rights reserved.

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

hp version
finite elements
mortar elements


Memory reconsolidation: an update Memory consolidation refers to the stabilization that a new memory has to undergo in order to persist. Recently, this dominant view of memory has been challenged by renewed interest in reconsolidation, where consolidated memories return to a transient unstable state following their retrieval, from which they must again stabilize in order to persist. In this review, we discuss how reconsolidation is supported by the same line of evidence as consolidation and recent findings of boundary conditions of reconsolidation. Furthermore, we discuss how recent controversies on the nature of amnesia following challenges to reconsolidation are using the same paradigm that failed to resolve the nature of amnesia after challenges to consolidation; we also discuss a new paradigm that can lead to more fruitful ways of studying amnesia in general.

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


Static behaviour of a shaft with an elliptical crack Cracks in mechanical components produce changes in their behaviour like increases of displacements or decreases of frequencies due to the flexibility increase. Some works related to the analysis of the behaviour of cracked shafts consider the front of the transversal fatigue cracks to be straight, but experience says that the front of these kind of cracks is approximately elliptical. Many expressions have been given for the flexibility of a cracked shaft with a straight front whereas, for elliptical cracks, only an approximate expression for the flexibility has been found in the literature. In the present work, flexibility expressions for cracked shafts having elliptical cracks are obtained, based on the polynomial fitting of the stress intensity factors, taking into account the size and shape of the elliptical cracks showing results according with reality. The static displacements in bending of the shaft for different support conditions have been calculated. The comparisons between these results and those obtained by FEM analysis and by experimental tests show that the closed-form expressions for the flexibility give us a very good approximation to the behaviour of the cracked shaft.

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


An empirical power comparison of univariate goodness-of-fit tests for normality A comprehensive power comparison study of existing tests for normality is proposed. Given the importance of this subject and the widespread development of normality tests, comprehensive descriptions and power comparisons of such tests are of considerable interest. Since recent comparison studies do not include several interesting and more recently developed tests, a further comparison of normality tests is considered to be of foremost interest. The study addresses the performance of 33 normality tests, for various sample sizes, considering several significance levels and for a number of symmetric, asymmetric and modified normal distributions. General recommendations for normality testing resulting from the study are defined according to the nature of the non-normality.

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

normality test
normal distribution
goodness-of-fit test


synchronized access to streams in simd vector multiprocessors The synchronized and simultaneous access to several vectors that form a single stream is typical in SIMD vector multiprocessors as well as in MIMD superscalar multiprocessors with decoupled access. In this paper we propose a block-interleaved storage scheme and an out-of-order access mechanism that allows conflict-free access to streams with an arbitrary initial address and constant stride between elements. The memory system can have any degree of unmatchness and we consider the use of either a crossbar or a multistage interconnection network. A maximal number of conflict-free families including the most commonly used strides can be obtained. We describe the hardware for address calculation and control and show that their additional costs are minimal compared with the cost of the hardware for in-order access. Finally, we evaluate the applicability of this technique to real loops from some programs of the Perfect Club and SPEC suites.

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

interconnection networks
vectors with constant stride
multi-module memories
conflict-free access


An object-oriented framework for modular chemical process simulation with semiconductor processing applications This paper discusses the development of a set of object-oriented modular simulation tools for solving lumped and spatially distributed models generated from chemical process design and simulation problems. Developed in the context of simulating semiconductor manufacture equipment, this framework reduces the software development cycle time associated with designing process systems and it improves the overall efficiency of the simulator development process. Modularized simulator components can be solved and analyzed individually, as well as formed into modular systems that can be solved using sequential or simultaneous approaches. A tungsten chemical vapor deposition simulation application is presented to illustrate the capability of the proposed tools in facilitating an evolutionary simulation approach. (c) 2006 Elsevier Ltd. All rights reserved.

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

object-oriented programming
semiconductor manufacturing
distributed parameter systems
weighted residual methods


EMPIRICAL ESTIMATES IN STOCHASTIC OPTIMIZATION VIA DISTRIBUTION TAILS "Classical" optimization problems depending on a probability measure belong mostly to nonlinear deterministic optimization problems that are, from the numerical point of view, relatively complicated. On the other hand, these problems fulfil very often assumptions giving a possibility to replace the "underlying" probability measure by an empirical one to obtain "good" empirical estimates of the optimal value and the optimal solution. Convergence rate of these estimates have been studied mostly for "underlying" probability measures with suitable (thin) tails. However, it is known that probability distributions with heavy tails better correspond to many economic problems. The paper focuses on distributions with finite first moments and heavy tails. The introduced assertions are based on the stability results corresponding to the Wasserstein metric with an "underlying" L(1) norm and empirical quantiles convergence.

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

stability
wasserstein metric
empirical estimates
convergence rate
heavy tails
empirical quantiles

stochastic programming problems
l(1) norm
lipschitz property
exponential tails
pareto distribution
risk functionals


PID feedback for load-balanced parallel gridless DSMC Parallel code presents a non-trivial problem of load balancing computational workload throughout a system of hardware and software resources. The task of load balancing is further complicated when the number of allowable processors changes through time. This paper presents a two-component load-balancing mechanism using optimal initial workload distribution and dynamic load maintenance. The initial guess is provided by inversion of the workload distribution function. Workload distribution inversion enables efficient domain decomposition for arbitrary workloads and easily compensates for changes in system resources. Dynamic load balancing is provided by process feedback control as used, for example, in control mechanisms of physical processes. Proportional, integral, and differential (PID) feedback readily allows controls to compensate for runtime-changes of the workload distribution function. This paper demonstrates a one-dimensional realization of the ideas presented here. We apply this load-balancing technique to our gridless direct simulation Monte Carlo algorithm. We demonstrate that the method does indeed maintain uniform workload distribution across available resources as the workload and usable system resources undergo change through time.

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


approximate factorization of polynomials over z We propose three algorithms for approximate factorization of univariate polynomials over Z ; the first one uses sums of powers of roots (SPR method), the second one utilizes factor-differentiated polynomials (FD method), and the third one is a robust but slow method. The SPR method is applicable to monic polynomials well but it is almost useless for non-monic polynomials unless their leading coefficients are sufficiently small. The FD method is applicable to both monic and non-monic polynomials, but it also becomes useless if both the leading and the tail coefficients increase. The third one is applicable to any polynomial factorizable approximately over Z , but it is slow. We discuss two types of polynomials which are ill-conditioned for rootfinding, Wilkinson-type polynomials and polynomials with close roots. Furthermore, we consider briefly approximate factorization of multivariate polynomials over Z .

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

factor-differentiated polynomials
knapsack method
sum of powers of roots
approximate factorization over z


Distributed, automatic file descriptor tuning in P2P file-sharing systems Peers in peer-to-peer file-sharing systems cannot effectively share their files if they are poorly described. Terms one user employs to describe an instance of a file may not be those that are commonly associated with the file, making this instance difficult to locate. To alleviate this problem, a server can ask its peers for help in improving the description of files they have in common. We consider the design of a fully distributed, automatic system for the exchange of descriptive metadata. Experimental results show that the proposed techniques are effective in improving search accuracy with reasonable cost.

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


Design of joint systems: a theoretical challenge for cognitive systems engineering In this paper the joint systems approach will be discussed. The approach is considered as a new paradigm in cognitive systems engineering (CSE). Its central idea, that human and technology form a functional unity, is as such not new. Why, then, has this idea become so appealing right now? In the first part of the paper we seek answers to this question by analysing the current situation in product design. The conclusion is that the focus of design is shifting from single products to intelligent environments. This change in focus induces tensions into the design process that urge for solutions. One of them is re-conceptualising the relationship between human and technology, precisely what the joint system approach is about. Three different joint system approaches are considered: the joint cognitive systems approach (JCS), the Ris extended CSE approach, and the joint intelligent systems (JIS) approach proposed by us. Comparisons are made with regard to how these approaches understand the joint system to be organised. While the JCS approach focuses on the humantechnology relationship, the other two consider this relationship as embedded in a context of object-oriented activity. As a consequence, environment becomes included in the joint system. In JIS approach we propose the use of the semiotic concept of habit to characterise the ways of functioning of the joint system. Habit is a tool for identifying generic patterns in the situation-specific behaviour of the system. Defining habits enables expressing the meaning or purpose of the systems functioning. In the end of the paper, we propose a design process model for the development of JIS. This approach is aimed at designing systems in usage i.e. to design of practices.

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

ecological approach
distributed cognitition
design of practice


interactive experience in a public context In this demonstration, we show an interactive artwork that responds to sound and describe a field study evaluating audience engagement within a public context. Audience in the public setting largely recognized the interactivity of the media immediately, engaged very briefly with the work and were highly self conscious about their behavior and voice during their engagement.

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

interactive art
audience experience
creative engagement


Molecular model checking This paper shows how to perform model checking, a technique for automatic program verification, by a DNA algorithm. Our method depends on two ideas. First, Kripke structures can be compactly represented in a DNA substrate, coding each state and each edge by a strand of DNA. Second, satisfaction of temporal eventualities can be achieved through a self-propagating molecular chain reaction.

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

biomolecular computation
formal verification


Similarity motion estimation and active tracking through spatial-domain projections on log-polar images To cope with the huge amount of visual data in the environment. foveal sending is not only an elegant biological solution. but also an appropriate mechanism in computer-based vision of artificial agents such as robots. Ail extremely important visual behavior in active vision systems is that of actively tracking moving targets, which is a problem closely related with foveal vision. The work described in this article has precisely to do with active tracking with space-variant images. The two main components of the proposed algorithm are the log-polar image format. and a projection-based motion estimator, whose joint use results in an efficient and effective active tracking scheme. For the successful real-time performance of the proposed approach, it is very important to have an appropriate combination of: (i) an efficient motion estimation technique, (ii) an adequate image representation, and (iii) the dynamic nature of purposive vision. (C) 2004 Elsevier Inc. All rights reserved.

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

active vision
motion estimation
projections
active tracking


Representative Segment-Based Emotion Analysis and Classification with Automatic Respiration Signal Segmentation Human respiration has been reported as having great relevance to the emotional state. However, the respiration signal obtained using traditional biosensors not only reflects changing emotions and emotion intensities, but also contains motion artifacts. The resulting information ambiguity limits the practical application of the respiration signal as a means of reliable affective state appraisal. Thus, the present study proposes a method for extracting representative Emotion Elicited Segments (EESs) from the respiration signal such that the affective state of the individual can be more reliably determined. The EES extraction process involves the combination of the following procedures, namely, 1) Mutual Information-Based Emotion Relevance Feature Ranking based on the Dynamic Time Warping Distance (MIDTW), and 2) Constraint-based Elicited Segment Density (CESD) analysis. Due to the innate regularity of the respiration signal, the respiration pattern under a particular emotional state would be relatively quasihomogeneous over time. Accordingly, a parameter-free Respiration quasi-Homogeneity Segmentation (RHS) algorithm is proposed for partitioning the respiration signal into quasi-homogenous segments from which the EESs can then be extracted. The experimental results obtained for five prototypical emotions (i.e., "love," "sadness," "joy," "anger," and "fear") show that the proposed segmentation/extraction methodology enables the EESs to be reliably identified and yields an average classification rate of 88 percent.

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

segmentation algorithm
emotion classification
dynamic time-warping
mutual information
constraint-based clustering analysis


Synthesis, experiments and simulation of heterogeneous batch distillation processes The presence of azeotropes in multicomponent mixtures complicates the design of batch distillation separation processes widely used in pharmaceutical and speciality chemical industries. Most of those processes include the use of a homogeneous entrainer to ease the separation. We describe novel methods to break azeotropes using an entrainer that is partially miscible with one of the initial binary mixture components. We depict some of the advantages of heterogeneous batch distillation processes: more design alternatives for the separation of an azeotropic binary mixture than with homogeneous batch distillation, batch distillation boundary crossing thanks to a controlled reflux of the entrainer-rich phase, simplified distillation sequences as a consequence of less distillation tasks. Three examples based on the separation of non-ideal azeotropic or close boiling point binary mixtures through heterogeneous batch distillation are simulated using a commercial batch distillation package. Experiments validate the simulated separation of a minimum boiling azeotropic mixture. (C) 2001 Elsevier Science Ltd. All rights reserved.

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

heterogeneous batch distillation
azeotropic mixture

close boiling mixture
heterogeneous entrainer


method-level phase behavior in java workloads Java workloads are becoming more and more prominent on various computing devices. Understanding the behavior of a Java workload which includes the interaction between the application and the virtual machine (VM), is thus of primary importance during performance analysis and optimization. Moreover, as contemporary software projects are increasing in complexity, automatic performance analysis techniques are indispensable. This paper proposes an off-line method-level phase analysis approach for Java workloads that consists of three steps. In the first step, the execution time is computed for each method invocation. Using an off-line tool, we subsequently analyze the dynamic call graph (that is annotated with the method invocations' execution times) to identify method-level phases. Finally, we measure performance characteristics for each of the selected phases. This is done using hardware performance monitors. As such, our approach allows for linking microprocessor-level information at the individual methods in the Java application's source code. This is extremely interesting information during performance analysis and optimization as programmers can use this information to optimize their code. We evaluate our approach in the Jikes RVM on an IA-32 platform using the SPECjvm98 and SPECjbb2000 benchmarks. This is done according to a number of important criteria: the overhead during profiling, the variability within and between the phases, its applicability in Java workload characterization (measuring performance characteristics of the various VM components) and application bottleneck identification.

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

applications
platform
use
analysis
performance
tool
virtual machine
paper
linking
interaction
variability
software
method
workload
code
behavior
dynamic
identification
graph
complexity
hardware

measurement
understandability
benchmark
computation
performance monitoring
project
timing
informal
evaluation
component
microprocessor
optimality
workload characterization
device
source-code
profiles
performance analysis
programmer


An empirical model of IT usage in the Malaysian public sector Whilst there have been many studies to determine the factors that influence the use of information technology (IT) in organisations, few have considered how these factors change with the level of IT use. This paper presents the results of such a study involving the use of IT to support Total Quality Management (TQM). The population studied consisted of those organisations in the Malaysian public sector that had applied for the Malaysian Prime Minister's Quality Award during the period 19921997. Three sets of factors were investigated for their impact on the use of IT to support TQM in this setting: external, organisational, and technological factors. Overall, the organisational and technological factors had more influence on IT usage than did the external factors. However, as organisations became more experienced in their use of IT, the major contextual influences on IT usage levels changed. At low levels of IT usage the major contextual influences were organisational. At medium levels of IT usage a combination of technological and organisational factors became important, whilst at high IT usage levels, the dominant factors were technological.

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

public sector
external factors
organisational factors
technological factors


An eighteen-node hybrid-stress solid-shell element for homogenous and laminated structures Solid-shell elements are often equipped with two layers of nodes. Thus, the thickness (normal) strain along the thickness direction is essentially constant. When these elements are subjected to pure bending, the shrinkage/expansion induced by the in-plane strain and the Poisson's ratio coupling in the upper and lower halves of the elements cancel each other. With a constant thickness strain, the plane strain state is resulted that leads to thickness locking. In this paper, a modified generalized laminate stiffness matrix is devised to resolve not only the thickness locking but also some abnormalities of solid-shell elements in laminate analyses. Associated with the modified matrix, a set of generalized stresses can be defined and a modified HellingerReissner functional can be derived by treating the generalized stresses as the independent variables. Based on the functional, an eigenteen-node hybrid-stress solid-shell element suitable for laminate analyses is proposed via a stabilization approach. All the benchmark tests indicate that the present stabilized element is close to the reduced integration element in accuracy.

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

solid shell
hybrid stress
finite element
composite
laminates


Nonconvex fuzzy mappings and the fuzzy pre-variational inequality In this paper, we introduce the concepts of fuzzy pseudoconvex, fuzzy invex, fuzzy pseudoinvex and fuzzy preinvex mapping from R-n to the set of fuzzy numbers, and put forward the concepts of fuzzy extended directional differential, subgradient and subdifferential. Some properties are obtained for fuzzy pseudoconvex, fuzzy invex, fuzzy pseudoinvex and fuzzy preinvex mapping; relations are discussed between the fuzzy pre-variational inequality and the fuzzy vector optimization problem. (c) 2007 Published by Elsevier B.V.

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

fuzzy numbers
nonconvex fuzzy mappings
fuzzy vector optimization


Synthesis of starch acetate: Statistical designed experiments to optimize the reaction conditions The synthesis conditions for Durabond A corn starch acetate (SA) were varied by using statistical designed experiments with the aim to optimize the yield and solubility, and to minimize the color. The thirty experiments in the design vary the: (1) Percentage water in the starch (0, 3, 6); (2) catalyst concentration (0.25, 0.60, 0.95 wt%); (3) total amount of acetic anhydride (1.0, 1.25, 1.5 mol times the number of hydroxyl groups on the starch); (4) starch concentration (15, 25, 35 wt%); (5) reaction time (1, 2.5, or 4 h); and (6) reaction temperature (60, 80 or 100 degrees C). The major factors controlling the acetyl value (AV), yield and the solubility are the reaction temperature (T) and the T squared. Some two factor interactions that effect the process are: (1) water percentage with T, (2) the reaction time with T, and (3) the catalyst concentration with starch concentration. The optimal conditions are: (1) a T range from 84 degrees C to 92 degrees C; (2) a sulfuric acid catalyst concentration of 0.25 wt% with respect to the starch concentration, (3) an acetic anhydride ratio of 1.0; (4) a 35 wt% starch concentration; (5) a 4 h reaction time, and (6) a percentage water in the starch of(0-6%). There is a strong correlation between the 10% and 20% SA solution solubility in acetone:water (96:4) with the AV. if the AV is > 55 then > 90% of the SA at a concentration of 10% is soluble in acetone:water (96:4).

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

statistical design
optimization of reaction conditions


An interleaving crescent broadcasting protocol for near video-on-demand services This work presents a novel interleaving crescent broadcasting protocol for near video-on-demand service. The interleaving crescent broadcasting protocol is a trade-off among the subscribers access latency, maximum buffer requirement, needed subscribers bandwidth, and maximum disk I/O transfer rate. A longer subscribers access latency may cause a subscriber to leave. A lower maximum buffer requirement, a lower needed subscribers bandwidth, and a lower maximum disk I/O transfer rate reduce subscribers costs. The interleaving crescent broadcasting protocol not only makes access latency shorter, but also lowers the overall systems cost. We prove the correctness of the interleaving crescent protocol; provide mathematical analyses to demonstrate its efficiency.

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

broadcasting protocol
access latency
maximum buffer requirement
needed subscribers bandwidth


Mean field approach for tracking similar objects In this paper, we consider the problem of tracking similar objects. We show how a mean field approach can be used to deal with interacting targets and we compare it with Markov Chain Monte Carlo (MCMC). Two mean field implementations are presented. The first one is more general and uses particle filtering. We discuss some simplifications of the base algorithm that reduce the computation time. The second one is based on suitable Gaussian approximations of probability densities that lead to a set of self-consistent equations for the means and covariances. These equations give the Kalman solution if there is no interaction. Experiments have been performed on two kinds of sequences. The first kind is composed of a single long sequence of twenty roaming ants and was previously analysed using MCMC. In this case, our mean field algorithms obtain substantially better results. The second kind corresponds to selected sequences of a football match in which the interaction avoids tracker coalescence in situations where independent trackers fail.

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

multi-target tracking
particle filter
kalman filter


VISIONARY: A viewpoint-based visual language for querying relational databases The adoption of a visual interface can simplify the query formulation process in DBMSs by enabling naive users to interact with a friendly environment. In this work, we propose a visual query language based on a diagrammatic paradigm, used for both data and query representation. The external data model is called vision and is made up of the visual primitives of concept and association. The external query model is based on the definition of a viewpoint, which is a perspective for accessing data defined dynamically by selecting a concept of primary interest. Internally, the data model is relational and the query language is SQL. An intermediate graph-based model ensures consistent mapping between the visual and the relational worlds. Our language has been implemented within a tool which can be mounted on top of any relational DBMS supporting ODBC. The system has been tested with naive users; the results of the experiment are reported and compared with those obtained with other visual languages. (C) 1999 Academic Press.

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

vpl-ii.b.1 : diagrammatic languages
vpl-v.b : database languages


the potential of using dynamic information flow analysis in data value prediction Value prediction is a technique to increase parallelism by attempting to overcome serialization constraints caused by true data dependences. By predicting the outcome of an instruction before it executes, value prediction allows data dependent instructions to issue and execute speculatively, hence increasing parallelism when the prediction is correct. In case of a misprediction, the execution is redone with the corrected value. If the benefit from increased parallelism outweighs the misprediction recovery penalty, overall performance could be improved. Enhancing performance with value prediction therefore requires highly accurate prediction methods. Most existing general value prediction techniques are local and future outputs of an instruction are predicted based on outputs from previous executions of the same instruction. In this paper, we explore the possibility of introducing highly accurate general correlating value predictor using dynamic information flow analysis. We use information theory to mathematically prove the validity and benefits of correlating value predictors. We also introduce the concept of linear value predictors, a new technique that predicts a new value from another one using a linear relation. We then conduct empirical analysis using programs from SPECjvm2008 and Siemens benchmarks. Our empirical measurements support our mathematical theory and allow us to make important observations on the relation between predictability of data values and information flow. Furthermore, we provide a scheme to select highly predictable variables, and explain when a specific value predictor can perform well and even outperform other predictors. Using a dynamic information flow analysis tool called DynFlow, we show that the values of a set of selected variables can be predicted with very high accuracy, up to 100\%, from previous history of the same variables or other variables that have strong information flow into the predicted variable.

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

information theory
value prediction
dynamic information flow analysis

instruction level parallelism
correlation
information flow strength
program dependence analysis
computer architecture


Learning material defect patterns by separating mixtures of independent component analyzers from NDT sonic signals This paper introduces the application of independent component analysis mixture modelling (ICAMM) in non-destructive testing (NDT). The application consists of discriminating patterns for material quality control from homogeneous and defective materials inspected by impact-echo testing. This problem is modelled as a mixture of independent component analysis (ICA) models, representing a class of defective or homogeneous material by an ICA model whose parameters are learned from the impact-echo signal spectrum. These parameters define a kind of particular signature for the different defects. The proposed procedure is intended to exploit to the maximum the information obtained with the cost efficiency of only a single impact. To illustrate this capability, four levels of classification detail (material condition, kind of defect, defect orientation, and defect dimension) are defined, with the lowest level of detail having up to 12 classes. The results from several 3D finite element models and lab specimens of an aluminium alloy that contain defects of different shapes and sizes in different locations are included. The performance of the classification by ICA mixtures is compared with linear discriminant analysis (LDA) and with multi-layer perceptron (MLP) classification. We demonstrate that the mass spectra from impact-echo testing fit ICAMM, and we also show the feasibility of ICAMM to contribute in NDT applications.

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

material quality classification
non-destructive testing
impact-echo testing


Cross-Layer Protocol Combining Tree Routing and TDMA Slotting in Wireless Sensor Networks Being different from other networks, the load and direction of data traffic for wireless sensor networks are rather predictable. The relationships between nodes are cooperative rather than competitive. These features allow the design approach of a protocol stack to be able to use the cross-layer interactive way instead of a hierarchical structure. The proposed cross-layer protocol CLWSN optimizes the channel allocation in the MAC layer Using the information from the routing tables, reduces the conflicting set, and improves the throughput. Simulations revealed that it outperforms SMAC and MINA in terms of delay and energy consumption.

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

wireless sensor network
cross layer protocol


A simulated annealing approach to speaker segmentation in audio databases In this paper we present a novel approach to the problem of speaker segmentation, which is an unavoidable previous step to audio indexing. Mutual information is used for evaluating the accuracy of the segmentation, as a function to be maximized by a simulated annealing (SA) algorithm. We introduce a novel mutation operator for the SA, the Consecutive Bits Mutation operator, which improves the performance of the SA in this problem. We also use the so-called Compaction Factor, which allows the SA to operate in a reduced search space. Our algorithm has been tested in the segmentation of real audio databases, and it has been compared to several existing algorithms for speaker segmentation, obtaining very good results in the test problems considered.

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

speaker segmentation
simulated annealing
audio indexing


Rating non-technical skills: developing a behavioural marker system for use in anaesthesia Studies of performance in medicine are often based on observation. Videotape provides a valuable tool for recording events from both real environments and simulators. When analysing observational data it is important that robust tools are used, particularly when investigating non-technical (cognitive and social) skills. This paper describes the method used to identify the key non-technical skills required in anaesthesia and to develop a behavioural marker system for their measurement. A prototype taxonomy was designed on the basis of a literature review; an examination of existing marker systems; cognitive task analysis interviews; an iterative development process involving workshops; and cross-checking in theatre. The resulting anaesthetists non-technical skills (ANTS) system comprises four skill categories (task management, team working, situation awareness, and decision making) that divide into 15 elements, each with example behaviours. Preliminary evaluation using ratings of videotaped scenarios indicated that the skills were observable and could be rated with reasonable agreement.

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

behavioural marker system
anaesthesia
cognitive task analysis

non-technical skills
performance assessment


building and supporting a massive data infrastructure for the masses On a typical university campus, the words "massive data storage" (MDS) usually bring to mind technology high-end, high performance computing (HPC) users might use. This is because academic supercomputer sites have traditionally provided a tightly interwoven HPC and high performance, MDS fabric to their users for decades. However, a new paradigm in data storage is now emerging where large, central, hierarchical storage management (HSM) services may play an increasingly important role in the non-HPC, general, academic user environment. For this user segment, information technology (particularly storage) is beginning to play a vital role in research. Personal computers or departmental storage systems are no longer adequate to store or to back up data. In fact, data volumes today are growing exponentially, without a concomitant increase in the human resources required to manage them. At Indiana University (IU), with around 100,000 users distributed geographically over eight campuses throughout the state of Indiana, we have started tackling these issues head on. Considerable thought, planning, and recent experiences lead us to conclude that extending a traditionally high-end, MDS system to "the masses" is a viable model for a large, research institution. Using the High Performance Storage System (HPSS) HSM software at IU, we have built a scalable storage infrastructure with a current capacity of 500 terabytes (TB hereafter; 1 TB = 1,000 gigabytes). Using a combination of secure, file system interface to HPSS and gateway software, we have extended the reach of this high-end HSM system over the network to all eight campuses of IU. It is now possible for a user at IU to easily and securely store and to retrieve terabytes of data from their Unix, Linux, Windows, Macintosh desktops or via the Web from anywhere. We have also developed a geographically distributed storage system that operates over a wide area network (WAN) between our Bloomington and Indianapolis campuses, located nearly fifty miles apart. We have recently implemented remote mirroring of data across this WAN for disaster recovery.In this paper, we provide an overview of Indiana University's distributed, massive data storage service infrastructure. We also discuss how it is being used and supported today at IU and how it is making an impact in research areas that have been poorly represented or un-represented among high-end information technology (IT) users in the past.

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

hpss
hierarchical storage management
hsm
massive data storage
distributed storage


intra-application shared cache partitioning for multithreaded applications In this paper, we address the problem of partitioning a shared cache when the executing threads belong to the same application.

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


The M-calculus: A higher-order distributed process calculus This paper presents a new distributed process calculus, called the M-calculus, that can be understood as a higher-order version of the Distributed Join calculus with programmable localities. The calculus retains the implementable character of the Distributed Join calculus while overcoming several important limitations: insufficient control over communication and mobility, absence of dynamic binding, and limited locality semantics. The calculus is equipped with a polymorphic type system that guarantees the unicity of locality names, even in presence of higher-order communications-a crucial property for the determinacy of message routing in the calculus.

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

design
languages
theory
process calculi
distribution
higher order
type systems


Importance of a rigorous evaluation of the cracking moment in RC beams and slabs The service loads are often decisive in the design of concrete structures. The evaluation of the cracking moment, M,, is an important issue to predict the performance of the structure, such as, the deflections of the reinforced concrete beams and slabs. To neglect the steel bars of the section is a simplification that is normally used in the computation of the cracking moment. Such simplification leads to small errors in the value of this moment (typically less than 20%). However, these small errors can conduce to significant errors when the values of deflections need to be computed from M-cr. The article shows that an error of 10% on the evaluation of M-cr can lead to errors over 100% in the deformation values. When the deformation of the structure is the decisive design parameter, the exact computing of the cracking moment is obviously very important. Such rigorous computing might lead to important savings in the cost of the structure. With this article the authors wish to draw the attention of the technical community to this fact. A simple equation to evaluate the cracking moment, M-cr, is proposed for a rectangular crosssection. This equation leads to cracking moments higher than those obtained by neglecting the reinforcement bars and is a simple rule that can be included in Eurocode 2. To verify the accuracy of the developed model, the results of the proposed equation was compared with a rigorous computational procedure. The proposed equation corresponds to a good agreement when compared with the previous approach and, therefore, this model can be used as a practical aid for calculating an accurate value of the cracking moment.

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

concrete beams
deformations
serviceability


Efficient geocasting with multi-target regions in mobile multi-hop wireless networks Geocasting, a variation on the notion of multicasting, is a mechanism to deliver messages of interest to all nodes within a certain geographical target region. Although several geocasting protocols have already been proposed for multi-hop wireless networks, most of these algorithms consider a single target region only. Here, when more than one target regions need to receive the same geocast messages, multiple transmissions need to be initiated separately by the message source. This causes significant performance degradation due to redundant packet transmissions, and it becomes more severe as the number of target regions increase. To solve this problem, we propose a basic scheme and its variations which utilize the geometric concept of Fermat point to determine the optimal junction point among multiple geocast regions from the source node. Our simulation study using ns-2 shows that the proposed schemes can effectively reduce the overhead of message delivery while maintaining a high delivery ratio in mobile multi-hop wireless networks.

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

mobile multi-hop wireless networks
geocasting with multiple target regions


Hypervolume-based multiobjective optimization: Theoretical foundations and practical implications In recent years, indicator-based evolutionary algorithms, allowing to implicitly incorporate user preferences into the search, have become widely used in practice to solve multiobjective optimization problems. When using this type of methods, the optimization goal changes from optimizing a set of objective functions simultaneously to the single-objective optimization goal of finding a set of mu points that maximizes the underlying indicator. Understanding the difference between these two optimization goals is fundamental when applying indicator-based algorithms in practice. On the one hand, a characterization of the inherent optimization goal of different indicators allows the user to choose the indicator that meets her preferences. On the other hand, knowledge about the sets of mu points with optimal indicator values - the so-called optimal mu-distributions-can be used in performance assessment whenever the indicator is used as a performance criterion. However, theoretical studies on indicator-based optimization are sparse. One of the most popular indicators is the weighted hypervolume indicator. It allows to guide the search towards user-defined objective space regions and at the same time has the property of being a refinement of the Pareto dominance relation with the result that maximizing the indicator results in Pareto-optimal solutions only. In previous work, we theoretically investigated the unweighted hypervolume indicator in terms of a characterization of optimal mu-distributions and the influence of the hypervolume's reference point for general bi-objective optimization problems. In this paper, we generalize those results to the case of the weighted hypervolume indicator. In particular, we present general investigations for finite mu, derive a limit result for mu going to infinity in terms of a density of points and derive lower bounds (possibly infinite) for placing the reference point to guarantee the Pareto front's extreme points in an optimal mu-distribution. Furthermore, we state conditions about the slope of the front at the extremes such that there is no finite reference point that allows to include the extremes in an optimal mu-distribution-contradicting previous belief that a reference point chosen just above the nadir point or the objective space boundary is sufficient for obtaining the extremes. However, for fronts where there exists a finite reference point allowing to obtain the extremes, we show that for mu to infinity, a reference point that is slightly worse in all objectives than the nadir point is a sufficient choice. Last, we apply the theoretical results to problems of the ZDT, DTLZ, and WFG test problem suites. (C) 2011 Elsevier B.V. All rights reserved.

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

multiobjective optimization
evolutionary algorithms
hypervolume indicator
reference point


Texture analysis using feature-based pairwise interaction maps Pairwise pixel interactions have proved to be a powerful tool in feature based [1,2] and model based [3,4] texture analysis. Various successful applications of the feature-based interaction map (FBIM) approach have already been presented [1,2,5,6]. Different aspects and components of the approach have been discussed, but no self-contained description of the FBIM method has been published yet. This paper provides a comprehensive up-to-date survey of the approach, including all major algorithms and a series of systematic experimental studies that demonstrate the capabilities of the approach. (C) 1999 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved.

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

feature-based interaction map
anisotropy
regularity
symmetry
pattern orientation


Damping control strategies of inter-area low-frequency oscillation for DFIG-based wind farms integrated into a power system The power regulations of wind farms can damp the power system interarea oscillation. Fuzzy logic control strategies of the active/reactive power regulations are proposed. The proposed damping control strategies of power regulations are validated.

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

wind power system
doubly fed induction generator (dfig)
inter-area low-frequency oscillation
shaft torsional oscillation
additional damping strategy


Cognitive load in hypermedia reading comprehension: Influence of text type and linearity In this paper the assumption of cognitive overhead in hypermedia learning is specified by cognitive load theory. This analysis is based on different types of cognitive load, the dimension of linearity/non-linearity as well as text characteristics. We propose a model stating that extraneous cognitive load in hypermedia learning is basically determined by the interaction of text presentation format (linear/non-linear) with text type (text with and without narrative structures). This assumption was tested by means of a 22 experimental design. Sixty participants completed a computer-based learning program that contained a narrative text or an encyclopaedia text in either linear or non-linear presentation format. Results confirm the suggested interaction hypothesis postulating that non-linear information presentation of narrative text structure increases cognitive load and decreases knowledge acquisition. However, for encyclopaedia text participants knowledge acquisition was not affected by linear or non-linear presentation format. Furthermore, results suggest a cross-validation of cognitive load measures and propositional analysis.

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

hypermedia
cognitive load
reading comprehension


Outage probability of fixed-gain dual-hop relay selection channels with heterogeneous fading In this paper, we develop a framework that can be used to analyze the outage probability of a dual-hop fixed-gain amplify-and-forward relay system performing single relay selection. We consider three selection strategies: (1) first-hop selection, whereby the relay is chosen to maximize the signal-to-noise ratio (SNR) at the relay irrespective of the second-hop channels; (2) second-hop selection, in which the relay is chosen such that the second-hop SNR is maximized; and (3) dual-hop selection, where the end-to-end SNR is maximized. The proposed analytical framework is capable of treating systems operating in heterogeneous fading conditions, where all or a subset of the source-relay and relay-destination channels has non-identical distributions or even experience completely different fading processes. We apply the framework to calculate new exact series representations of the outage probability for the three aforementioned cases of relay selection when all channels adhere to the Nakagami-m model. Our analysis is corroborated by simulations. Finally, we provide a discussion of how the proposed framework can be applied to analyze other fading configurations using the techniques detailed herein.

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

partial relay selection
diversity
performance analysis


Interactive GPU-based maximum intensity projection of large medical data sets using visibility culling based on the initial occluder and the visible block classification Maximum intensity projection (MIP) is an important visualization method that has been widely used for the diagnosis of enhanced vessels or bones by rotating or zooming MIP images. With the rapid spread of multidetector-row computed tomography (MDCT) scanners, MDCT scans of a patient generate a large data set. However, previous acceleration methods for MIP rendering of such a data set failed to generate MIP images at interactive rates. In this paper, we propose novel culling methods in both object and image space for interactive MIP rendering of large medical data sets. In object space, for the visibility test of a block, we propose the initial occluder resulting from a preceding image to utilize temporal coherence and increase the block culling ratio a lot. In addition, we propose the hole filling method using the mesh generation and rendering to improve the culling performance during the generation of the initial occluder. In image space, we find out that there is a trade-off between the block culling ratio in object space and the culling efficiency in image space. In this paper, we classify the visible blocks into two types by their visibility. And we propose a balanced culling method by applying a different culling algorithm in image space for each type to utilize the trade-off and improve the rendering speed. Experimental results on twenty CT data sets showed that our method achieved 3.85 times speed up in average without any loss of image quality comparing with conventional bricking method. Using our visibility culling method, we achieved interactive GPU-based MIP rendering of large medical data sets.

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

visibility culling
initial occluder
block classification

maximum intensity projection (mip)
graphics processing unit (gpu)
large volume data set


Guardband Optimization for Cellular Systems Applying Raised Cosine Windowed OFDM In this paper, we study the optimization of the guardbands between adjacent channels in OFDM-based cellular systems. It is well known that OFDM signals have strong sidelobes in spectrum, which lead to large necessary guardbands between adjacent channels to avoid severe adjacent channel interference. To reduce such guardbands and, thus, to increase the spectrum usage efficiency, we propose to apply raised cosine (RC) windowing of the time domain OFDM signals, which is a simple, efficient and effective method. In this context, an interesting tradeoff can be observed, i.e., a higher roll-off factor (ROF) of the RC-window is associated with higher signal overhead in time (in other words, longer OFDM symbol duration), but lower guardband overhead in frequency (due to better sidelobe suppression). We study this tradeoff and found out that the ROF and the guardband size can be jointly optimized, in the sense that the per-channel data rate can be maximized under adjacent channel interference constraints. Our mathematical analysis further shows that such joint optimization can be reduced to a single dimension optimization, i.e. the optimization of the ROF. Afterwards, this optimization procedure is illustrated and verified via numerical simulation, showing that large data rate increase can be achieved when using RC-windowing with an optimized ROF. Finally, practical analysis of the instantaneous per-OFDM symbol interference further verified the effectiveness of the proposed approach.

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

ofdm
sidelobe suppression
adjacent channel interference

raised cosine window
out-of-band
spectral shape


On the calculation of the water particle kinematics arising in a directionally spread wavefield This paper concerns the calculation of the water particle kinematics generated by the propagation of surface gravity waves. The motivation for this work lies in recent advances in the description of the water surface elevation associated with extreme waves that are highly nonlinear and involve a spread of wave energy in both frequency and direction. To provide these exact numerical descriptions the nonlinear free-surface boundary conditions are time-marched, with the most efficient solutions simply based upon the water surface elevation, ?, and the velocity potential, ?, on that surface. In many broad-banded problems, computational efficiency is not merely desirable but absolutely essential to resolve the complex interactions between wave components with widely varying length-scales and different directions of propagation. Although such models have recently been developed, the calculation of the underlying water particle kinematics, based on the surface properties alone, remains a significant obstacle to their practical application. The present paper tackles this problem, outlining a new method based upon an adaptation of an existing approximation to the DirichletNeumann operator. This solution, which is presently formulated for flow over a flat bed, is appropriate to the description of any kinematic quantity and has the over-riding advantage that it is both stable and computationally efficient. Indeed, its only limitation arises from the assumed Fourier series representations. As a result, both ? and ? must be single-valued functions and are not therefore appropriate to the description of overturning waves. The proposed method is compared favourably to both existing analytical wave models and laboratory data providing a description of the kinematics beneath extreme, near-breaking, waves with varying directional spread. The paper concludes by investigating two important characteristics of the flow field beneath large waves arising in realistic ocean environments.

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

water wave kinematics
directional water waves
extreme ocean waves
three-dimensional wave modelling
nonlinear wavewave interactions
wave groups


Functional morphology This paper presents a methodology for implementing natural language morphology in the functional language Haskell. The main idea behind is simple: instead of working with untyped regular expressions, which is the state of the art of morphology in computational linguistics, we use finite functions over hereditarily finite algebraic datatypes. The definitions of these datatypes and functions are the language-dependent part of the morphology. The language-independent part consists of an untyped dictionary format which is used for synthesis of word forms, and a decorated trie, which is used for analysis. Functional Morphology builds on ideas introduced by Huet in his computational linguistics toolkit Zen, which he has used to implement the morphology of Sanskrit. The goal has been to make it easy for linguists, who are not trained as functional programmers, to apply the ideas to new languages. As a proof of the productivity of the method, morphologies for Swedish, Italian, Russian, Spanish, and Latin have already been implemented using the library. The Latin morphology is used as a running example in this article.

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

design
performance
morphological description
functional programming
embedded languages


Estimating network proximity and latency Network proximity and latency estimation is an important component in discovering and locating services and applications. With the growing number of services and service providers in the large-scale Internet, accurately estimating network proximity/latency with minimal probing overhead becomes essential for scalable deployment. Although there exist a number of network distance estimation schemes, they either rely on extensive infrastructure support, require the IP address of the potential targets, falsely cluster distant nodes, or perform poorly with even few measurement errors. We propose Netvigator, a scalable network proximity and latency estimation tool that uses information obtained from probing a small number of landmark nodes and intermediate routers (termed milestones) that are discovered en route to the landmarks, to identify the closest nodes. With very little additional probing overhead, Netvigator uses distance information to the milestones to accurately locate the closest nodes. We developed a Netvigator prototype and report our performance evaluation on PlanetLab and in the intranet of a large enterprise. Netvigator is a running service on PlanetLab as a part of HP Labs' S-3 (Scalable Sensing Service).

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

management
algorithms
network measurement


Solo versus collaborative writing: Discrepancies in the use of tables and graphs in academic articles The number of authors collaborating to write scientific articles has been increasing steadily, and with this collaboration, other factors have also changed, such as the length of articles and the number of citations. However, little is known about potential discrepancies in the use of tables and graphs between single and collaborating authors. In this article, we ask whether multiauthor articles contain more tables and graphs than single-author articles, and we studied 5,180 recent articles published in six science and social sciences journals. We found that pairs and multiple authors used significantly more tables and graphs than single authors. Such findings indicate that there is a greater emphasis on the role of tables and graphs in collaborative writing, and we discuss some of the possible causes and implications of these findings.

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


Functional integration in CAD systems This paper examines the issue of integration in CAD systems and argues that for integration to be effective, it must address the functional aspects of a CAD system. It discusses the need for integrated systems and, within a structural engineering context, identifies several facets of integration that should be targeted. These include 2-D drafting and 3-D modelling, graphical and non-graphical design information, the CAD data structure and its user interface, as well as integration of the drafting function with other engineering applications. Means of achieving these levels of integration are briefly discussed and a prognosis for the future development of integrated systems explored. Particular attention is paid to the emergence (and potential role) of 'product models' which seek to encapsulate the full range of data elements required to define completely an engineering artefact. Copyright (C) 1996 Civil-Comp Limited and Elsevier Science Limited

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


Multiple orders per job formation and release strategies in large-scale wafer fabs: a simulation study In this paper, multiple orders per job type formation and release strategies are described for semiconductor wafer fabrication facilities (wafer fabs). Different orders are grouped into one job because orders of an individual customer very often fill only a portion of a Front-Opening Unified Pod (FOUP). After job formation, an FOUP is assigned to each job and is used to move the job throughout the wafer fab. We determine an acceptable number of FOUPs given a prescribed order release rate to find appropriate values for on-time delivery performance measures, cycle time, and throughput by discrete event simulation. On the other hand, given a prescribed number of FOUPs and target values for these performance measures, we look for an appropriate order release rate. Simulation experiments with models for large-scale wafer fabs are performed to solve these two problems. We also discuss a complementary analytical method to determine an appropriate number of FOUPs in some specific situations.

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


L(2,1) L ( 2 , 1 ) -labelings of Cartesian products of two cycles An L(2,1) L ( 2 , 1 ) -labeling of a graph is an assignment of nonnegative integers to its vertices so that adjacent vertices get labels at least two apart and vertices at distance two get distinct labels. The ? ? -number of a graph G , denoted by ?(G) ? ( G ) , is the minimum range of labels taken over all of its L(2,1) L ( 2 , 1 ) -labelings. We show that the ? ? -number of the Cartesian product of any two cycles is 6, 7 or 8. In addition, we provide complete characterizations for the products of two cycles with ? ? -number exactly equal to each one of these values.

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

l(2
1) l ( 2
1 ) -labeling l(2
1 ) l(2
1 ) l ( 2
1 )
1 ) -coloring l(2
product of cycles
vertex labeling
distance two labeling


User needs for location-aware mobile services Mobile contexts of use vary a lot, and may even be continuously changing during use. The context is much more than location, but its other elements are still difficult to identify or measure. Location information is becoming an integral part of different mobile devices. Current mobile services can be enhanced with location-aware features, thus providing the user with a smooth transition towards context-aware services. Potential application fields can be found in areas such as travel information, shopping, entertainment, event information and different mobile professions. This paper studies location-aware mobile services from the user's point of view. The paper draws conclusions about key issues related to user needs, based on user interviews, laboratory and field evaluations with users, and expert evaluations of location-aware services. The user needs are presented under five main themes: topical and comprehensive contents, smooth user interaction, personal and user-generated contents, seamless service entities and privacy issues.

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

location-aware services
usability
user evaluation


Output feedback LMI tracking control conditions with H? criterion for uncertain and disturbed TS models This work concerns the tracking problem of uncertain TakagiSugeno (TS) continuous fuzzy model with external disturbances. The objective is to get a model reference based output feedback tracking control law. The control scheme is based on a PDC structure, a fuzzy observer and a H? performance to attenuate the external disturbances. The stability of the whole closed-loop model is investigated using the well-known quadratic Lyapunov function. The key point of the proposed approaches is to achieve conditions under a LMI (linear matrix inequalities) formulation in the case of an uncertain and disturbed TS fuzzy model. This formulation facilitates obtaining solutions through interior point optimization methods for some nonlinear output tracking control problems. Finally, a simulation is provided on the well-known inverted pendulum testbed to show the efficiency of the proposed approach.

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

fuzzy takagisugeno models
linear matrix inequality (lmi)
quadratic stability
h? criterion


Informational correlation between two parties of a quantum system: spin-1/2 chains We introduce the informational correlation \(E^{AB}\) between two interacting quantum subsystems \(A\) and \(B\) of a quantum system as the number of arbitrary parameters \(\varphi _i\) of a unitary transformation \(U^A\) (locally performed on the subsystem \(A\)) which may be detected in the subsystem \(B\) by the local measurements. This quantity indicates whether the state of the subsystem \(B\) may be effected by means of the unitary transformation applied to the subsystem \(A\). Emphasize that \(E^{AB}\ne E^{BA}\) in general. The informational correlations in systems with tensor product initial states are studied in more details. In particular, it is shown that the informational correlation may be changed by the local unitary transformations of the subsystem \(B\). However, there is some non-reducible part of \(E^{AB}(t)\) which may not be decreased by any unitary transformation of the subsystem \(B\) at a fixed time instant \(t\). Two examples of the informational correlations between two parties of the four-node spin-1/2 chain with mixed initial states are studied. The long chains with a single initially excited spin (the pure initial state) are considered as well.

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

quantum information
quantum communication system
non-reducible correlations
local unitary transformation
spin-1/2 chain


Generalized Gibbs priors based positron emission tomography reconstruction ? Bayesian methods have been widely applied to the ill-posed problem of image reconstruction. Typically the prior information of the objective image is needed to produce reasonable reconstructions. In this paper, we propose a novel generalized Gibbs prior (GG-Prior), which exploits the basic affinity structure information in an image. The motivation for using the GG-Prior is that it has been shown to be effective noise suppression, while also maintaining sharp edges without oscillations. This feature makes it particularly attractive for the reconstruction of positron emission tomography (PET) where the aim is to identify the shape of objects from the background by sharp edges. We show that the standard paraboloidal surrogate coordinate ascent (PSCA) algorithm can be modified to incorporate the GG-Prior using a local linearized scheme in each iteration process. The proposed GG-Prior MAP reconstruction algorithm based on PSCA has been tested on simulated, real phantom data. Comparison studies with conventional filtered backprojection (FBP) method and Huber prior clearly demonstrate that the proposed GG-Prior performs better in lowering the noise, preserving the image edge and in higher signal noise ratio (SNR) condition.

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

bayesian reconstruction
positron emission tomography (pet)
local gibbs prior


An explicit dynamics extended finite element method. Part 2: Element-by-element stable-explicit/explicit dynamic scheme This paper presents a general explicit time integration scheme for dynamics simulations using the eXtended Finite Element Method with standard critical time step. We use the generalized mass lumping technique proposed in Part I of this paper. This technique allows us to consider arbitrary enrichment functions in the X-FEM for explicit dynamics simulations. In this second part, the proposed approach allows the use of standard finite elements critical time step estimates. For that purpose, we develop a classical element-by-element strategy that couples the standard central difference scheme with the unconditionally stable-explicit scheme proposed by Chang [S.Y. Chang, An explicit method with improved stability property, Int. J. Numer. Methods Engrg. 77 (8) (2008) 11001120]. This scheme coupled with X-FEM allows us to recover FE critical time steps independently of the enrichment functions considered. Furthermore, a study of the stability property of this new explicit scheme is proposed in the X-FEM framework, both with fixed enrichments and evolving enrichments with time. Some examples illustrate the good properties of the new explicit numerical time scheme and some applications to dynamics crack growth are given.

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