Bayesian estimation and prediction intervals for a Rayleigh distribution under a conjugate prior This paper is an effort to obtain Bayes estimators of Rayleigh parameter and its associated risk based on a conjugate prior (square root inverted gamma prior) with respect to both symmetric loss function (squared error loss), and asymmetric loss function (precautionary loss function). We also derive the highest posterior density (HPD) interval for the Rayleigh parameter as well as the HPD prediction intervals for a future observation from this distribution. An illustrative example to test how the Rayleigh distribution fits a real data set is presented. Finally, Monte Carlo simulations are performed to compare the performances of the Bayes estimates under different conditions.

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

bayes estimator
predictive distribution
predictive intervals
prior distribution


3D Hand Gesture Recognition using the Hough Transform This paper presents an automatic 3D dynamic hand gesture recognition algorithm relying on both intensity and depth information provided by a Kinect camera. Gesture classification consists of a decision tree constructed on six parameters delivered by the Hough transform of projected 3D points. The Hough transform is originally applied, for the first time, on the projected gesture trajectories to obtain a reliable decision. The experimental data obtained from 300 video sequences with different subjects validate the proposed recognition method.

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

gesture recognition
kinect camera
hough transform


Normal forms in a cyclically graded Lie algebra In a 1999 paper published in JSC the second author and Martin Kummer proved "that in all but one case the normal form of a real or complex Hamiltonian matrix which is irreducible and appropriately normalized can be computed by Lie series methods in formally the same manner as one computes the normal form of a nonlinear Hamiltonian function". In this paper we handle the final case using an extension of those Lie series methods developed by the present authors. Those extended methods make use of spectral sequences and are developed in considerable generality, i.e., their applicability is by no means restricted to the Hamiltonian context of this paper. A specific example is worked out in detail. (c) 2005 Elsevier Ltd. All rights reserved.

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

spectral sequence
linear hamiltonian system


using software testing to move students from trial-and-error to reflection-in-action Introductory computer science students rely on a trial and error approach to fixing errors and debugging for too long. Moving to a reflection in action strategy can help students become more successful. Traditional programming assignments are usually assessed in a way that ignores the skills needed for reflection in action, but software testing promotes the hypothesis-forming and experimental validation that are central to this mode of learning. By changing the way assignments are assessed--where students are responsible for demonstrating correctness through testing, and then assessed on how well they achieve this goal--it is possible to reinforce desired skills. Automated feedback can also play a valuable role in encouraging students while also showing them where they can improve.

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

pedagogy
cs1
test-driven development
automated grading
extreme programming


Arrival process-controlled adaptive media playout with multiple thresholds for video streaming To improve the playout quality of video streaming services, an arrival process-controlled adaptive media playout (AMP) mechanism is designed in this study. The proposed AMP scheme sets three threshold values, denoted by P n , L and H, for the playout controller to start playback and dynamically adjust the playout rate based on the buffer fullness. In the preroll period, the playout can start only when the buffer fullness n is not less than the dynamic playback threshold P n ,which is determined by the jitters of incoming video frames. In the playback period, if the buffer fullness is below L or over H,the playout rate will slow down or speed up in a quadratic manner. Otherwise, the playback speed depends on the instantaneous frame arrival rate, which is estimated by the proposed arrival process tracking algorithm. We employ computer simulations to demonstrate the performance of the proposed AMP scheme, and compare it with several conventional AMP mechanisms. Numerical results show that our AMP design can shorten the playout delay and reduce both buffer underflow and overflow probabilities. In addition, our proposed AMP also outperforms traditional AMP schemes in terms of the variance of distortion of playout and the playout curve. Hence, the proposed arrival process-controlled AMP is really an outstanding design.

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

video streaming
adaptive media playout
playout delay
buffer underflow
playout quality


A study of mixtures of HfO2 and TiO2 as high-k gate dielectrics HfxTi1?xO2 films have been deposited by chemical vapor deposition. Permittivities of approximately 50 have been obtained. The films are stable up to 1000 C. The interface properties and charge trapping appear to depend on composition. For films with approximately equal Hf and Ti concentration, transistor characteristics and inversion layer mobilities are comparable to those obtained when using pure HfO2.

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


genetic algorithm based approach for designing computer network topology One of the important features of computer networks is the potential for high reliability. The reliability of a network depends on many parameters such as connectivity, degree of each node, and average distance between any pair of nodes. The main focus of the problem considered in this paper is to design reliable computer network topologies. A generalized framework based on Genetic Algorithm is developed which is applicable to wide range of network design problems. Several topology design problems are solved to demonstrate the generality of this solution approach. The results obtained from genetic algorithm based solution approach are compared with the optimal solutions to illustrate the effectiveness of the proposed approach.

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

genetic algorithm
network
distance
framework
reliability
design
topologies
demonstrate
paper

optimality
computer network
computation
network topologies
general
network design
feature
connection
effect


Debugging unsatisfiable classes in OWL ontologies As an increasingly large number of OWL ontologies become available on the Semantic Web and the descriptions in the ontologies become more complicated, finding the cause of errors becomes an extremely hard task even for experts. Existing ontology development environments provide some limited support, in conjunction with a reasoner, for reporting errors in OWL ontologies. Typically, these are restricted to the mere detection of, for example, unsatisfiable concepts. However, the diagnosis and resolution of the bug is not supported at all. For example, no explanation is given as to why the error occurs (e. g., by pinpointing the root clash, or axioms in the ontology responsible for the clash) or how dependencies between classes cause the error to propagate (i.e., by distinguishing root from derived unsatisfiable classes). In the former case, information from the internals of a description logic tableaux reasoner can be extracted and presented to the user (glass box approach); while in the latter case, the reasoner can be used as an oracle for a certain set of questions and the asserted structure of the ontology can be used to help isolate the source of the problems (black box approach). Based on the two approaches, we have integrated a number of debugging cues generated from our reasoner, Pellet, in our hypertextual ontology development environment, Swoop. A conducted usability evaluation demonstrates that these debugging cues significantly improve the OWL debugging experience, and point the way to more general improvements in the presentation of an ontology to users. (c) 2005 Elsevier B.V. All rights reserved.

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


state-based incremental testing of aspect-oriented programs Taking aspects as incremental modifications to their base classes, this paper presents an incremental approach to testing whether or not aspect-oriented programs and their base classes conform to their respective behavior models. We exploit a rigorous aspect-oriented extension to state models for capturing the impact of aspects on the state transitions of base class objects as well as an explicit weaving mechanism for composing aspects into their base models. We generate abstract tests for base classes and aspect-oriented programs from their state models. As base class tests are not necessarily valid for aspect-oriented programs, we identify several rules for maximizing reuse of concrete base class tests for aspects according to the state-based impact of aspects on their base classes. To illustrate our approach, we use two examples that indicate distinctive types of aspect-oriented applications and exhibit fundamental features in complex applications: aspects removing state transitions from base classes and aspects adding and modifying state transitions in base classes. Our results show that majority of base class tests can be reused for aspects, but subtle modifications to some of them are necessary. In particular, positive (or negative) base class tests can become negative (or positive) aspect tests. We also discuss how several types of aspect-specific faults can be revealed by the state-based testing.

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

state model
aspect-oriented programming
aspect-oriented state model
model-based testing


A document binarization method based on connected operators An original binarization method based on connected operators is proposed in this paper. Connected operators enable to filter and/or segment an image by preserving its contours. The proposed binarization method enables to extract relevant document objects by means of the component-tree structure. This strategy was compared to other binarization methods and showed good behavior in various contexts.

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

document binarization
connected operators


seal object detection in document images using ght of local component shapes Due to noise, overlapped text/signature and multi-oriented nature, seal (stamp) object detection involves a difficult challenge. This paper deals with automatic detection of seal from documents with cluttered background. Here, a seal object is characterized by scale and rotation invariant spatial feature descriptors (distance and angular position) computed from recognition result of individual connected components (characters). Recognition of multi-scale and multi-oriented component is done using Support Vector Machine classifier. Generalized Hough Transform (GHT) is used to detect the seal and a voting is casted for finding possible location of the seal object in a document based on these spatial feature descriptor of components pairs. The peak of votes in GHT accumulator validates the hypothesis to locate the seal object in a document. Experimental results show that, the method is efficient to locate seal instance of arbitrary shape and orientation in documents.

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

character recognition
graphical symbol spotting


Bridging the gap between feature- and grid-based SLAM One important design decision for the development of autonomously navigating mobile robots is the choice of the representation of the environment. This includes the question of which type of features should be used, or whether a dense representation such as occupancy grid maps is more appropriate. In this paper, we present an approach which performs SLAM using multiple representations of the environment simultaneously. It uses reinforcement to learn when to switch to an alternative representation method depending on the current observation. This allows the robot to update its pose and map estimate based on the representation that models the surrounding of the robot in the best way. The approach has been implemented on a real robot and evaluated in scenarios, in which a robot has to navigate in- and outdoors and therefore switches between a landmark-based representation and a dense grid map. In practical experiments, we demonstrate that our approach allows a robot to robustly map environments which cannot be adequately modeled by either of the individual representations.

O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O B I O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 nonseparable VLSI architecture for two-dimensional discrete periodized wavelet transform A modified two-dimensional (2-D) discrete periodized wavelet transform (DPWT) based on the homeomorphic high-pass filter and the 2-D operator correlation algorithm is developed in this paper. The advantages of this modified 2-D DPWT are that it can reduce the multiplication counts and the complexity of boundary data processing in comparison to other conventional 2-D DPWT for perfect reconstruction. In addition, a parallel-pipeline architecture of the nonseparable computation algorithm is also proposed to implement this modified 2-D DPWT. This architecture has properties of noninterleaving input data, short bus width request, and short latency. The analysis of the finite precision performance shows that nearly half of the bit length can be saved by using this nonseparable, computation algorithm. The operation of the boundary data processing is also described in detail. In the three-stage decomposition of an N x N image, the latency is found to be N-2 + 2N + 18.

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

computing
design
digital filter
high performance
image processing
logic simulation
number representation


Change detection in desktop virtual environments: An eye-tracking study It is common knowledge that attention is important for learning. We need to utilize attention in order to learn something efficiently and effectively. Similarly, we may also need to acquire familiarity with (i.e., learn) our surroundings in order to utilize our attention. In this study, learning is defined as a product of ones exposure to natural visual stimuli. Using a virtual model of a natural scene, we investigate both attention and its relationship to learning, according to this definition. Specifically, our focus is the effect of environment familiarity on gaze direction. Our findings reveal that the factor of familiarity with ones surroundings in virtual reality environments exerts a significant influence on peoples ability to detect a variety of specific changes that occur within scenes under their observation.

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

spatial learning
eye movements
scene memory


A 9-bit multiple relaxation Lattice Boltzmann magnetohydrodynamic algorithm for 2D turbulence While a minimalist representation of 2D Magnetohydrodynamics (MHD) on a square lattice is a 9-bit scalar and 5-bit vector distribution functions, here we examine the effect of using the 9-bit vector distribution function on the effect of a magnetic field on the KelvinHelmholtz instability. While there is little difference in the simulation results between the 5-bit and the 9-bit vector distribution models in the vorticity, energy spectra, etc., the 9-bit model permits simulations with mean magnetic field a factor of approximately 2 greater than those attainable in the standard 5-bit model. Indeed a 9-bit single-relaxation model can attain such success over a 5-bit multiple-relaxation model at the same computational expense.

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


Trigonometric generalized T-splines The papers main aim consists of extending the T-spline approach to trigonometric generalized B-splines, a particularly relevant case of non-polynomial splines. Such goal can be achieved by a careful revision of some results concerning the basic properties of the trigonometric generalized B-splines and by a formalization of the concept of T-splines in the trigonometric setting. Moreover, fundamental for the use of this new tool is the study of the noteworthy case with constant frequencies and of the linear independence of the corresponding blending functions, which can be proved to be strongly linked to the linear independence of the polynomial blending functions associated to the same T-mesh.

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

t-spline
t-mesh
gb-spline
analysis-suitable
isogeometric analysis


SitEModelling (TM): A powerful tool for total site energy optimization To remain competitive on the international market companies have to improve the energy system of their chemical production sites. Many consultants who work in this field have developed appropiate methods and application programs to fulfill this task. The latest development is a procedure called SitEModelling(TM) which covers the thorough experience of experSCience. This paper describes the SitEModelling(TM)-procedure and the corresponding program. Case studies are included to present application and value of the program. (C) 1998 Published by Elsevier Science Ltd. All rights reserved.

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

heat integration
pinch technology
total site modelling


Task decomposition on abstract states, for planning under nondeterminism Although several approaches have been developed for planning in nondeterministic domains, solving large planning problems is still quite difficult. In this work, we present a new planning algorithm, called Yoyo, for solving planning problems in fully observable nondeterministic domains. Ybyo combines an HTN-based mechanism for constraining its search and a Binary Decision Diagram (BDD) representation for reasoning about sets of states and state transitions. We provide correctness theorems for Ybyo, and an experimental comparison of it with MBP and ND-SHOP2, the two previously-best algorithms for planning in nondeterministic domains. in our experiments, Yoyo could easily deal with problem sizes that neither MBP nor ND-SHOP2 could scale up to, and could solve problems about 100 to 1000 times faster than MBP and ND-SHOP2. (C) 2009 Elsevier B.V. All rights reserved.

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

hierarchical task-network (htn) planning


Hybridization of bee colony optimization and sequential quadratic programming for dynamic economic dispatch Dynamic economic dispatch deals with the scheduling of online generator outputs with predicted load demands over a certain period of time so as to operate an electric power system most economically. This paper proposes a hybrid methodology integrating bee colony optimization with sequential quadratic programming for solving dynamic economic dispatch problem of generating units considering valve-point effects. This hybrid method incorporates bee colony optimization as a base level search which can give a good direction to the optimal region and sequential quadratic programming as a local search procedure which is used to fine tune that region for achieving the final solution. Numerical results of a ten-unit system have been presented to demonstrate the performance and applicability of the proposed method. The results obtained from the proposed method are compared with those obtained from hybrid of particle swarm optimization and sequential quadratic programming and hybrid of evolutionary programming and sequential quadratic programming.

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

dynamic economic dispatch
bee colony optimization
sequential quadratic programming


A new module for on-line manipulation and display of molecular information in the brain architecture management system A new "Molecules" module of the Brain Architecture Management System (BAMS; http://brancusi.usc.edu/ bkms) is described. With this module, BAMS becomes the first on-line knowledge management system to handle central nervous system (CNS) region and cell-type chemoarchitectonic data in the context of axonal connections between regions and cell types, in multiple species. The "Molecules" module implements a general knowledge representation schema for data and metadata collated from published and unpublished material, and allows insertion of complex reports about the presence of molecules collated from the literature. For different CNS neural regions and cell types, the module's database structure includes representation of molecule expression revealed by various techniques including in situ hybridization and immunohistochemistry, molecule coexpression and time-dependent level changes, and physiological state of subjects. The metadata representation allows online comparison and evaluation of inserted experiments, and "Molecules" structure allows rapid development of data transfer protocols enabling neuroinformatics visualization tools to display gene expression patterns residing in BAMS, in terms of levels of expressed molecules and in situ hybridization data. The module's web interface allows users to construct lists of CNS regions containing a molecule (depending on physiological state), retrieve further details about inserted records, compare time-dependent data within and across experiments, reconstruct gene expression patterns, and construct complex reports from individual experiments.

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

coexpression
database
immunohistochemistry
in situ hybridization
molecules

chemoarchitecture
inference engine
molecular neuroanatomy


Single view metrology We describe how 3D affine measurements may be computed from a single perspective view of a scene given only minimal geometric information determined from the image. This minimal information is typically the vanishing line of a reference plane, and a vanishing point for a direction not parallel to the plane. It is shown that affine scene structure may then be determined from the image, without knowledge of the camera's internal calibration (e.g. focal length), nor of the explicit relation between camera and world (pose). In particular, we show how to (i) compute the distance between planes parallel to the reference plane (up to a common scale factor); (ii) compute area and length ratios on any plane parallel to the reference plane; (iii) determine the camera's location. Simple geometric derivations are given for these results. We also develop an algebraic representation which unifies the three types of measurement and, amongst other advantages, permits a first order error propagation analysis to be performed, associating an uncertainty with each measurement. We demonstrate the technique for a variety of applications, including height measurements in forensic images and 3D graphical modelling from single images.

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

3d reconstruction
video metrology
photogrammetry


Autocalibration in hydrologic modeling: Using SWAT2005 in small-scale watersheds SWAT is a physically based model that can simulate water quality and quantity at the watershed scale. Due to many of the processes involved in the manual- or autocalibration of model parameters and the knowledge of realistic input values, calibration can become difficult. An autocalibration-sensitivity analysis procedure was embedded in SWAT version 2005 (SWAT2005) to optimize parameter processing. This embedded procedure is applied to six small-scale watersheds (subwatersheds) in the central Texas Blackland Prairie. The objective of this study is to evaluate the effectiveness of the autocalibration-sensitivity analysis procedures at small-scale watersheds (4.08.4ha). Model simulations are completed using two data scenarios: (1) 1 year used for parameter calibration; (2) 5 years used for parameter calibration. The impact of manual parameter calibration versus autocalibration with manual adjustment on model simulation results is tested. The combination of autocalibration tool parameter values and manually adjusted parameters for the 20002004 simulation period resulted in the highest ENS and R2 values for discharge; however, the same 5-year period yielded better overall ENS, R2 and P-values for the simulation values that were manually adjusted. The disparity is most likely due to the limited number of parameters that are included in this version of the autocalibration tool (i.e. Nperco, Pperco, and nitrate). Overall, SWAT2005 simulated the hydrology and the water quality constituents at the subwatershed-scale more adequately when all of the available observed data were used for model simulation as evidenced by statistical measure when both the autocalibration and manually adjusted parameters were used in the simulation.

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

swat
hydrologic modeling
autocalibration
watershed


Big data challenge: a data management perspective There is a trend that, virtually everyone, ranging from big Web companies to traditional enterprisers to physical science researchers to social scientists, is either already experiencing or anticipating unprecedented growth in the amount of data available in their world, as well as new opportunities and great untapped value. This paper reviews big data challenges from a data management respective. In particular, we discuss big data diversity, big data reduction, big data integration and cleaning, big data indexing and query, and finally big data analysis and mining. Our survey gives a brief overview about big-data-oriented research and problems.

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


analysis of yield loss due to random photolithographic defects in the interconnect structure of fpgas This paper presents an analysis of the potential yield loss in FPGA due to random defects in metal layers. A proven yield model is adapted to target the FPGA interconnect layers in order to predict the manufacturing yield. Defect parameters from the 2003 SIA roadmap are used to investigate the trend in yield loss due to defects in interconnect layers in the future. It is shown that the low yield predicted for the 45nm technology node and beyond is a cause for concern. The potential impact on yield using two different approaches, namely redundant circuits and fault tolerant design, is also presented.

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

fault tolerance
catastrophic faults
interconnect model
fpga redundancy
yield enhancement
interconnect faults
yield prediction


QUANTUM UNIVERSALITY BY STATE DISTILLATION Quantum universality can be achieved using classically controlled stabilizer operations and repeated preparation of certain ancilla states. Which ancilla states suffice for universality? This "magic states distillation" question is closely related to quantum fault tolerance. Lower bounds on the noise tolerable on the ancilla help give lower bounds on the tolerable noise rate threshold for fault-tolerant computation. Upper bounds show the limits of threshold upper-bound arguments based on the Gottesman-Knill theorem. We extend the range of single-qubit mixed states that are known to give universality, by using a simple parity-checking operation. For applications to proving threshold lower bounds, certain practical stability characteristics are often required, and we also show a stable distillation procedure. No distillation upper bounds are known beyond those given by the Gottesman-Knill theorem. One might ask whether distillation upper bounds reduce to upper bounds for single-qubit ancilla states. For multi-qubit pure states and previously considered two-qubit ancilla states, the answer is yes. However, we exhibit two-qubit mixed states that are not mixtures of stabilizer states, but for which every postselected stabilizer reduction from two qubits to one outputs a mixture of stabilizer states. Distilling such states would require true multi-qubit state distillation methods.

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

fault-tolerant quantum computation
clifford operations
universal computation


A reactivity index study to monitor the role of solvation on the interaction of the chromophores with amino-functional silanol surface for colorimetric sensors Amino-functional silanol surface are mostly used for the immobilization of inorganic ions, molecules, organic or biochemical molecules onto the mesopore surface. In analytical chemistry, the metal ion uptake was visualized through colorimetric sensors using chromophore molecules. One needs to know the structureproperty correlation between the chromophore and silylating agent while choosing chromophore, which is very important to design the sensors. We have used two chromophores representative of hydrophobic and hydrophilic type. We used density functional calculation on all the interacting molecules in both the unsolvated phase and solvated medium within the domain of hard soft acid base principle (HSAB) to look at the localized activity of the interacting atoms of these reacting molecules to formulate a priori rule to choose of the best chromophore. We have as well postulated the mechanism of interaction between chromophore and the silylating agent. The results were compared with experiment and it is observed that solvation plays a detrimental role in the binding of chromophore with silylating agent. The results also show that, the range of reactivity index can be used as a suitable property to scale activity of chromophore molecules suitable for the sensing process. It is observed that the hydrophobic chromophore binds stronger with both the metal and the silylating agent; whereas for the hydrophilic one, it binds only with the silylating agent when solvated and in all cases the metal ion binding is weaker compared to that of the hydrophobic one.

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

chromophore
silylating agent
reactivity index

density-functional calculations
solvent effect


Mobility prediction in mobile wireless networks In realistic mobile ad-hoc network scenarios, the hosts usually travel to the pre-specified destinations, and often exhibit non-random motion behaviors. In such mobility patterns, the future motion behavior of the mobile is correlated with its past and current mobility characteristics. Therefore, the memoryless mobility models are not capable of realistically emulating such a mobility behavior. In this paper, an adaptive learning automata-based mobility prediction method is proposed in which the prediction is made based on the GaussMarkov random process, and exploiting the correlation of the mobility parameters over time. In this prediction method, using a continuous-valued reinforcement scheme, the proposed algorithm learns how to predict the future mobility behaviors relying only on the mobility history. Therefore, it requires no a prior knowledge of the distribution parameters of the mobility characteristics. Furthermore, since in realistic mobile ad hoc networks the mobiles move with a wide variety of the mobility models, the proposed algorithm can be tuned for duplicating a wide spectrum of the mobility patterns with various randomness degrees. Since the proposed method predicts the basic mobility characteristics of the host (i.e., speed, direction and randomness degree), it can be also used to estimate the various ad-hoc network parameters like link availability time, path reliability, route duration and so on. In this paper, the convergence properties of the proposed algorithm are also studied and a strong convergence theorem is presented to show the convergence of the algorithm to the actual characteristics of the mobility model. The simulation results conform to the theoretically expected convergence results and show that the proposed algorithm precisely estimates the motion behaviors.

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

mobility prediction
gaussmarkov random process


Intelligent Healthcare Service Provisioning Using Ontology with Low-Level Sensory Data Ubiquitous Healthcare (u-Healthcare) is the intelligent delivery of healthcare services to users anytime and anywhere. To provide robust healthcare services, recognition of patient daily life activities is required. Context information in combination with user real-time daily life activities can help in the provision of more personalized services, service suggestions, and changes in system behavior based on user profile for better healthcare services. In this paper, we focus on the intelligent manipulation of activities using the Context-aware Activity Manipulation Engine (CAME) core of the Human Activity Recognition Engine (HARE). The activities are recognized using video-based, wearable sensor-based, and location-based activity recognition engines. An ontology-based activity fusion with subject profile information for personalized system response is achieved. CAME receives real-time low level activities and infers higher level activities, situation analysis, personalized service suggestions, and makes appropriate decisions. A two-phase filtering technique is applied for intelligent processing of information (represented in ontology) and making appropriate decisions based on rules (incorporating expert knowledge). The experimental results for intelligent processing of activity information showed relatively better accuracy. Moreover, CAME is extended with activity filters and T-Box inference that resulted in better accuracy and response time in comparison to initial results of CAME.

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

ubiquitous healthcare
activity recognition
ontology


Comparison between physicochemical and calculated molecular descriptors It has earlier been proven that measured physicochemical properties are useful in the selection of building blocks for combinatorial chemistry as well as for investigation of the scope and limitations of organic reactions. However, measured physicochemical properties are only available for small subsets of reagents, starting materials or building blocks; therefore it is necessary to use calculated descriptors and it is essential that the descriptors are relevant. The objective was to investigate whether three different descriptor data sets contained similar information about the chemical structure, with the major aim to investigate whether calculated descriptors contain similar information as experimental data. A total of 205 heterogeneous primary amines were characterized using three different data sets of molecular descriptor variables. The first set consisted of four physicochemical variables compiled from the literature and commercially available chemicals in chemical catalogues. From these four descriptors together with molecular weight, three additional descriptors could be calculated, resulting in a total of eight descriptor variables in the first data set. The second data set consisted of 81 calculated molecular descriptor variables relating to size, connectivity, atom count, topology and electrotopology indices. The third data set consisted of 10 semi-empirical variables (AMI). All the calculated variables were generated using the software Tsar 3.11. The descriptor variable sets were compared using principal component analysis (PCA) and partial least squares projections to latent structures (PLS). The following result shows that the different descriptor sets do contain similar latent information and that the different types of calculated variables do correlate well with the experimental data, making them suitable to use for e.g. combinatorial library design. Copyright (C) 2000 John Wiley & Sons, Ltd.

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

amines
molecular descriptors
pls
combinatorial chemistry


using event segmentation to improve indexing of consumer photographs Automatic albuming --- the automatic organization of photographs, either as an end in itself or for use in other applications -- is an application that promises to be of great assistance to photographers. Relatively sophisticated image content analysis techniques have been used for image indexing, organization and retrieval. In this paper, we describe a method of organizing photographs into events using spoken photograph captions. The results of this process can be used to improve image indexing and retrieval.

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

indexing
organization
applications
use
method
event
retrieval
process
segmentation
image
content analysis
paper


Courseware development for semiconductor technology and its application into instruction This study reports on the development of ESP (English for specific purposes) courseware for semiconductor technology and its integration as a "silent partner" into instruction. This kind of team-teaching could help overcome current problems encountered in developing ESP in Taiwan. The content of the material under discussion includes general knowledge about fundamental theories, process technologies and applications within the semiconductor industry. In the design of the whole courseware, five skills for learning English (listening, speaking, reading, writing, and translation) have been considered and a 3D multimedia technique has been used to promote learning interest, student engagement, and efficiency. The design of the courseware endeavors to mainly follow principles by [Mayer, R. E. (2001). Multimedia learning. New York: Cambridge University Press]. Students report they have benefited from the courseware implementation. Initial evaluations suggest that students are satisfied with practices for learning professional knowledge and English skills provided by the courseware. They report that the multimedia-assisted environment of the courseware promotes learning effectiveness. Students with higher achievement on the posttest showed better participation and motivation, made greater use of the multimedia and had a better understanding of the English content so that they are more competent to function in a professional and learner-centered ESP course using the courseware. (C) 2008 Elsevier Ltd. All rights reserved.

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

improving classroom teaching
interactive learning environments
multimedia/hypermedia systems
post-secondary education


A simple approximation of the link model with reservation by a one-dimensional Markov chain This paper presents a new approximate calculation algorithm of the blocking probability in the full-availability group with reservation carrying a mixture of different multi-rate traffic streams. The algorithm is based on transforming multi-dimensional service processes in the system into a one-dimensional discrete Markov chain, which is characterised by a product form solution. Special attention is paid to the method for determining reverse transition rates and state probabilities in this Markov chain. The results of analytical calculations of the blocking probability are compared with the results of digital simulation of systems with bandwidth reservation. This research has shown a better accuracy of the proposed method as compared to the accuracy of other known solutions. The derived formulae can be useful for the analysis of ISDN and B-ISDN switching systems.

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


Factor metanetwork: a multilevel probabilistic meta-model based on factor graphs Factor graph (FG) is a recently developed graphical model. It subsumes many other graphical models, including Bayesian networks and Markov networks. This paper presents a multilevel probabilistic meta-model based on FGs - factor metanetwork. The model is a kind of context-enabled networks, and assumes that interoperability between component networks can be also modelled by another FG. It is composed of a set of FGs, which are put on each other in such a way that the probability distributions of single or multiple variables (function nodes) of every previous network (factor graph) depend on probability distributions associated with nodes of the next network. We assume parameters of function nodes in a FG as random variables, and allow all kinds of conditional dependencies between these probability functions. Several cases of two-level factor metanetworks are presented, and an example is presented to show the model's application.

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

graphical models
factor graphs
metanetwork


A method to account for non-steady state conditions in measuring traffic hysteresis This paper investigates the hysteresis loops commonly observed in freeway traffic flow by analyzing the evolution of speed-spacing relationships as vehicles undergo stop-and-go oscillations. The measurement method is based on the kinematic wave model with variable wave speed to account for non-steady state conditions that arise during acceleration/deceleration. We find that hysteresis takes place less frequently and in smaller amplitude than previously thought.

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

car-following behavior
traffic oscillations


Wrapping of soft IPs for interface-based design using heterogeneous metaprogramming We discuss the application of heterogeneous metaprogramming (MPG) for the interface-based design, which deals with the synthesis of the communication interfaces between Intellectual Property components (IPs). Heterogeneous MPG is based on the simultaneous usage of a domain language for describing domain functionality and a metalanguage for developing generic components and program generators. We present a design framework based on the MPG techniques. The novelty of our approach is that we apply the concept of heterogeneous MPG for the automatic generation of IP wrappers for communication between the third-party soft IPs systematically. We present a case study for the synthesis of the communication interfaces using a FIFO protocol.

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

interface-based design
interface synthesis
ip wrapper


Accounting for signal loss due to dephasing in the correction of distortions in gradient-echo EPI via nonrigid registration Gradient-echo (GE) echo planar imaging (EPI) is susceptible to both geometric distortions and signal loss. This paper presents a retrospective correction approach based on nonrigid image registration. A new physics-based intensity correction factor derived to compensate for intravoxel dephasing in GE EPI images is incorporated into a previously reported nonrigid registration algorithm. Intravoxel dephasing causes signal loss and thus intensity attenuation in the images. The new rephasing factor we introduce, which changes the intensity of a voxel in images during the registration, is used to improve the accuracy of the intensity-based nonrigid registration method and mitigate the intensity attenuation effect. Simulation-based experiments are first used to evaluate the method. A magnetic resonance (MR) simulator and a real field map are used to generate a realistic GE EPI image. The geometric distortion computed from the field map is used as the ground truth to which the estimated nonrigid deformation is compared. We then apply the algorithm to a set of real human brain images. The results show that, after registration, alignment between EPI and multishot, spin-echo images, which have relatively long acquisition times but negligible distortion, is improved and that signal loss caused by dephasing can be recovered.

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

intravoxel dephasing
nonrigid registration

gradient echo (ge) echo planar imaging (epi)


Shaping electrical field in heterostructure transistors The decrease of the electron transit time in FETs is achieved mainly by design of short transistors and minimization of scattering in the intrinsic layer of the HEMT channel. A penalty of this miniaturization trend is the creation of a poorly controlled, extremely high electric field along the channel of a transistor. The non-linear distribution of the electric field along the channel of HEMTs leads to the reduction of mobility by a factor of 57, causing sequential worsening of the performance parameters, such as gain (gm) and cut-off frequency (ft). The appearance of hot electrons around the drain is another issue on a long list of problems resulting from extreme field profiles. Fundamental dependence of electron velocity on electrical field strength was the foundation of field tailoring in variety of multi-gate transistors. In recent years, the intensified research was focused on reshaping the field profile by using various topologies of additional electrodes, called Field Plates (FPs), such as Overlapping Gate structures, Detached FP design, Stacked 2- and 3-floor FP systems, and others. The current study presents a review of the advantages and drawbacks of various HEMT designs where additional field plates were used. Although most of the FP topologies were used to increase the breakdown voltage of the new transistors, we offer another application for the field plates. They can be used to improve the average electron velocity. It is also shown that a new pHEMT with quasi-constant gm can be designed using FPs.

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


Computational method for decentralized integral controllability of low dimensional processes Decentralized integral controllability (DIC) concerns the existence of stable decentralized controllers with integral action having stable independent detuning. The only information needed for DIC is the steady state process gain matrix. Hence it can be used to select control structures systematically at the early stage of control system design. The problem to check the necessary and sufficient condition of DIC is a type of robust stability problems for real parameter uncertainties and it is very hard to compute except for low dimensional processes. Available necessary and sufficient conditions which can be computed exactly are for processes of dimension up to 3 x 3. Here, an algebraic method which checks positivity of multivariable polynomials is applied to calculate DIC of processes. It provides a computable procedure for processes of dimension up to 5 x 5. It is a necessary condition for DIC of higher dimension processes and can be applied before a complex necessary and sufficient condition. (C) 2000 Elsevier Science Ltd. All rights reserved.

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

decentralized integral controllability
necessary and sufficient condition
algebraic method


Lossless scalable coding of images via lossless multi-channel prediction A new lossless scalable coding based on a lossless wavelet transform (LWT) and a lossless multi-channel prediction (LMP) is proposed. A rough image can be expanded from a part of the bit stream for the use of progressive transmission. The LMP, a non-separable 2D filter bank, is optimized for an arbitrary input image signal so that remaining correlation of the band signals of the LWT can be utilized. Filter coefficients are optimized for each of input images under the lossless coding gain.

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


A multivariate approach to combine univariate calibration information It is common practice to calibrate a common value by combining information from different sources, e.g. days, instruments, laboratories, etc. Under each individual source a perfect univariate calibration can be used to calibrate the unknown. Then the common unknown can be estimated by combining the estimates from each source as a weighted mean (Johnson DJ, Krishnamoorthy K. J. Am. Statist. Assoc. 1996; 91: 1707-1715). However, this estimator can be obtained as a special solution directly from a multivariate calibration setting by combining information first and then estimating the common value. Two data sets were analyzed and they showed that the multivariate approach can possibly improve the univariate approach based on the closeness criterion. Copyright (C) 2001 John Wiley Sons, Ltd.

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

univariate calibration
multivariate calibration
closeness


Dynamic ensemble pruning based on multi-label classification Dynamic (also known as instance-based) ensemble pruning selects a (potentially) different subset of models from an ensemble during prediction based on the given unknown instance with the goal of maximizing prediction accuracy. This paper models dynamic ensemble pruning as a multi-label classification task, by considering the members of the ensemble as labels. Multi-label training examples are constructed by evaluating whether ensemble members are accurate or not on the original training set via cross-validation. We show that classification accuracy is maximized when learning algorithms that optimize example-based precision are used in the multi-label classification task. Results comparing the proposed framework against state-of-the-art dynamic ensemble pruning approaches in a variety of datasets using a heterogeneous ensemble of 200 classifiers show that it leads to significantly improved accuracy.

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

ensemble selection
multi-label classification
dynamic classifier fusion


A new approach for shape preserving interpolating curves ? In this paper, we present an new approach to construct the so-called shape preserving interpolation curves. The basic idea is first to approximate the set of interpolated points with a class of MQ quasi-interpolation operators and then pass through the set with the use of multivariate interpolation by using compactly supported radial basis functions. This approach possesses the advantages of certain shape preserving and good approximation behaviors. The proposed algorithm is easy to implement.

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


Designing and evaluating an energy efficient Cloud Cloud infrastructures have recently become a center of attention. They can support dynamic operational infrastructures adapted to the requirements of distributed applications. As large-scale distributed systems reach enormous sizes in terms of equipment, the energy consumption issue becomes one of the main challenges for large-scale integration. Like any other large-scale distributed system, Clouds face an increasing demand in energy. In this paper, we explore the energy issue by analyzing how much energy virtualized environments cost. We provide an energy-efficient framework dedicated to Cloud architectures and we validate it through different experimentations on a modern multicore platform. We show on a realistic example that our infrastructure could save 25% of the Cloud nodes' electrical consumption.

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

energy efficiency
virtualization
migration
energy awareness
power management


Fuzzy performance evaluation in Turkish Banking Sector using Analytic Hierarchy Process and TOPSIS The performance evaluation of banks has important results for creditors, investors and stakeholders since it determines banks capabilities to compete in the sector and has a critical importance for the development of the sector. The aim of this study is to propose a fuzzy multi-criteria decision model to evaluate the performances of banks.The largest five commercial banks of Turkish Banking Sector are examined and these banks are evaluated in terms of several financial and non-financial indicators. Fuzzy Analytic Hierarchy Process (FAHP) and Technique for Order Performance by Similarity to Ideal Solution (TOPSIS) methods are integrated in the proposed model. After the weights for a number of criteria are determined based on the opinions of experts using the FAHP method, these weights are input to the TOPSIS method to rank the banks. The results show that not only financial performance but also non-financial performance should be taken into account in a competitive environment.

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

performance evaluation
fuzzy
topsis
turkish banking sector


Study of intra-subject random variations of stabilometric parameters This study of intra-subject random variations of stabilometric parameters was achieved in the context of the standardized clinical stabilometry, in use in France and Southern Europe since 1985. The outstanding interest of stabilometry to follow up patients makes the results of this study indispensable for clinicians and their international publication is particularly important as, these days, the standardization Committee for clinical stabilometry resumes its work within the International Society for Postural and Gait Research. Such a study is possible only on the topological stabilometric parameters because of the stroboscopic effect on the dynamic parameters of the sampling rate of our computerized measuring chains.

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


constrained optimalities in query personalization Personalization is a powerful mechanism that helps users to cope with the abundance of information on the Web. Database query personalization achieves this by dynamically constructing queries that return results of high interest to the user. This, however, may conflict with other constraints on the query execution time and/or result size that may be imposed by the search context, such as the device used, the network connection, etc. For example, if the user is accessing information using a mobile phone, then it is desirable to construct a personalized query that executes quickly and returns a handful of answers. Constrained Query Personalization (CQP ) is an integrated approach to database query answering that dynamically takes into account the queries issued, the user's interest in the results, response time, and result size in order to build personalized queries. In this paper, we introduce CQP as a family of constrained optimization problems, where each time one of the parameters of concern is optimized while the others remain within the bounds of range constraints. Taking into account some key (exact or approximate) properties of these parameters, we map CQP to a state search problem and provide several algorithms for the discovery of optimal solutions. Experimental results demonstrate the effectiveness of the proposed techniques and the appropriateness of the overall approach.

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

network
order
conflict
web
context
response time
account
paper
user
search
mobile phone
users
size
device
demonstrate
queries
constrained optimization
connection
database
query

examples personality approximation timing constraint informal experimentation families optimality discoveries algorithm effect integrability


non-formal modelling for interaction design Motivation -- If modelling is included in the requirements analysis phase of a systematic interaction design method, it mostly focuses on some kind of formalism, e.g., task modelling and requirements specification. However, when designing in collaboration with non-expert, stakeholders this will not work. Approach -- This workshop will allow exchange of ideas, experiences, techniques and tools for collaboration with stakeholders of interaction design early in the design process, in order to aim at a more creative as well as more user-centred requirement development. Limitations/Implications -- Our finding will in no way guarantee "the best design solution", but they show a type of creative collaboration between stakeholders and designers in a very early design phase, which allows considering and exploring new solutions before these need to be prototyped or implemented. Originality/Value -- The techniques we intend to discuss are in no way new, however their application early in design in this open ended approach is not well documented and, hence, awareness and comparing notes on successes and failure experiences will allow us to learn from each other and help us develop a general understanding among interaction designers. Take away message -- Non-formal modelling tools and techniques for early collaboration with stakeholders are relatively cheap and, at the other hand, uniquely stimulating techniques for identifying both the boundaries and the opportunities of the design space for interactive systems.

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

sketching
story telling
stakeholder involvement
co-design
requirements elicitation
paper prototypes


Predictivereactive scheduling on a single resource with uncertain future jobs We consider a scheduling problem where the firm must compete with other firms to win future jobs. Uncertainty arises as a result of incomplete information about whether the firm will win future jobs at the time the firm must create a predictive (planned) schedule. In the predictive schedule, the firm must determine the amount of planned idle time for uncertain jobs and their positions in the schedule. When the planned idle time does not match the actual requirements, certain schedule disruptions occur. The firm seeks to minimize the sum of expected tardiness cost, schedule disruption cost, and wasted idle time cost. For the special case of a single uncertain job, we provide a simple algorithm for the optimal planned idle time and the best reactive method for schedule disruptions. For the case of multiple uncertain jobs, a heuristic dynamic programming approach is presented.

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

uncertainty modeling
project management and scheduling


Guiding robots' behaviors using pheromone communication This paper describes an ongoing project to investigate the uses of pheromones as a means of communication in robotics. The particular example of pheromone communication considered here was inspired by queen bee pheromones that have a number of crucial functions in a bee colony, such as keeping together and stabilizing the colony. In the context of a robotic system, one of the proposed applications for robot pheromones is to allow a group of robots to be guided by a robot leader. The robot leader could release different chemicals to elicit a range of behaviors from other members of the group. A change of the operating temperature of tin oxide gas sensors has been implemented in order to differentiate different chemicals. This paper provides details of the robots used in the project and their behaviors. The sensors, especially the method of using the tin oxide gas sensors, the robot control algorithms and experimental results are presented. In this project, pheromones were used to trigger congregating behavior and light seeking in a group of robots.

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

gas sensor temperature
pheromone discrimination
odour localization


Stochastic margin-based structure learning of Bayesian network classifiers The margin criterion for parameter learning in graphical models gained significant impact over the last years. We use the maximum margin score for discriminatively optimizing the structure of Bayesian network classifiers. Furthermore, greedy hill-climbing and simulated annealing search heuristics are applied to determine the classifier structures. In the experiments, we demonstrate the advantages of maximum margin optimized Bayesian network structures in terms of classification performance compared to traditionally used discriminative structure learning methods. Stochastic simulated annealing requires less score evaluations than greedy heuristics. Additionally, we compare generative and discriminative parameter learning on both generatively and discriminatively structured Bayesian network classifiers. Margin-optimized Bayesian network classifiers achieve similar classification performance as support vector machines. Moreover, missing feature values during classification can be handled by discriminatively optimized Bayesian network classifiers, a case where purely discriminative classifiers usually require mechanisms to complete unknown feature values in the data first.

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

bayesian network classifier
discriminative learning
maximum margin learning


replaying live-user interactions in the off-line evaluation of critique-based mobile recommendations Supporting conversational approaches in mobile recommender systems is challenging because of the inherent limitations of mobile devices and the dependence of produced recommendations on the context. In a previous work, we proposed a critique-based mobile recommendation approach and presented the results of a live users evaluation. Live-user evaluations are expensive and there we could not compare different system variants to check all our research hypotheses. In this paper, we present an innovative simulation methodology and its use in the comparison of different user-query representation approaches. Our simulation test procedure replays off-line, against different system variants, interactions recorded in the live-user evaluation. The results of the simulation tests show that the composite query representation, which employs both logical and similarity queries, does improve the recommendation performance over a representation using either a logical or a similarity query.

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

simulation test
query representation
mobile recommender systems


Modified genetic algorithm strategy for structural identification Genetic algorithms (GA) have proved to be a robust, efficient search technique for many problems. As the number of variables involved increases, classical GA will often have difficulty and/or require long computational time in obtaining acceptable results. In this paper, a modified GA strategy is proposed to improve the accuracy and computational time for parameter identification of multiple degree-of-freedom (DOF) structural systems. The strategy includes multiple populations or species, a search space reduction procedure and new operators designed to provide a robust and reliable identification. Average absolute error in the estimated stiffness values of 1.4% is achieved for a 20-DOF unknown mass system with 5% noise, and even more importantly the maximum error is reduced to only 3.8%.

O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 dynamics system identification


An expert system for reliability centered maintenance in the chemical industry A new framework for the implementation of reliability centered maintenance (RCM) in the initial design phases of industrial chemical processes was developed and implemented. Fuzzy reasoning algorithms were designed to evaluate and assess the likelihood of equipment failure mode precipitation and aggravation. Furthermore, an approximate reasoning scheme which considers local, product, and adjacent machinery effects was constructed to prioritize the equipment failure modes likely to precipitate in the process. The new RCM approach was implemented through an expert system. The computer system reads the process flowsheet generated by ASPEN Plus and, based on relevant machine operating data, it provides the user with the final process RCM availability structure diagram. This availability diagram consists of a listing of all critical machine failure modes likely to precipitate, prioritized according to their overall negative impact on the process, as well as important information on their corresponding local and system effects, and suggested controls for their detection.

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

reliability centered maintenance
fuzzy reasoning algorithms
approximate reasoning scheme


Optical activity in chiral gold nanogratings Nanogratings consisting of chiral gold particles were fabricated employing electron beam lithography, lift-off and argon sputter etching. Spectra of the transmittance and chirality induced polarization azimuth rotation of nanogratings were measured. A giant specific polarization azimuth rotation (?104 deg/mm) was observed near surface plasmon resonance. We found that the rotation direction changes its sign with a handedness of chiral particles. However, it remains the same for the light incident to the front and back sides of the specific grating, i.e., the effect is reciprocal and manifests conventional optical activity.

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


Principles of adjustable autonomy: a framework for resilient humanmachine cooperation Unmanned ground vehicles tend to be more and more autonomous, but both complete teleoperation and full autonomy are not efficient enough to deal with all possible situations. To be efficient, the humanrobot system must be able to anticipate, react and recover from errors of different kinds, i.e., to be resilient. From this observation, this paper proposes a survey on the resilience of a humanmachine system and the means to control the resilience. The resilience of a system can be defined as the ability to maintain or recover a stable state when subject to disturbance. Adjustable autonomy and humanmachine cooperation are considered as means of resilience for the system. This paper then proposes three indicators to assess different meanings of resilience of the system: foresight and avoidance of events, reaction to events and recovery from occurrence of events. The third of these metrics takes into consideration the concept of affordances that allows a common representation for the opportunities of action between the automated system and its environment.

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

resilience
adjustable autonomy
humanmachine cooperation
affordances


High reliability of real-time visual data transmission using superposition coding with receiver diversity Supporting visual data applications in the real-time communication systems are among the most challenging issues over the next generation wireless communication systems. This challenge is further magnified by the fact that the quality of reception is highly sensitive to transmission delay, data losses and bit error rate (BER) in such applications. In this paper, we proposed Superposition Coding with Receiver Diversity (SPC-RD) scheme, which employs unequal error protection (UEP) to improve the error performance, maximize the received signal to noise ratio (SNR) and optimize the reliability of the transmission system. In the transmitter side, the visual data is divided into a number of different priority layers based on their effects on the reception quality. These layers are modulated individually where the highest priority layer is modulated with the highest UEP level against error-prone channels, and vice versa. These modulated signals are then superimposed together and transmitted via wireless Single-Input Multiple-Output (SIMO) Rayleigh fading channel. In the receiver side, three different diversity combining approaches; selection combining (SC), equal gain combining (EGC) and maximal ratio combining (MRC) are considered. The combined signal is then passed through a multiuser demodulator so-called the ordered successive interference cancellation (O-SIC) demodulator to reconstruct and separate the data layers. This demodulation technique is evaluated and compared with the traditionally maximum likelihood joint detection (MLJD) technique. Extensive simulations have been carried out to validate the various assertions. Under the assumption of equal transmission power, the simulation results illustrate that the proposed SPC-RD scheme provides a SNR gain of 14.5dB over the Rayleigh fading channel at the diversity order of three for the acceptable BER level of 10?3 when BPSK scheme is exploited compared to the traditional equal error protection system. In addition, the proposed scheme with O-SIC demodulation technique achieves almost similar performance compared to MLJD technique but using less computational complexity.

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

real-time wireless data transmission
uep simo fading channels


two-way partitioning based on direction vector In the spectral method, the vertices in a graph can be mapped into the vectors in d-dimensional space, thus the vectors are partitioned instead of vertices to obtain graph partitioning. In this paper, we show a method to obtain optimal two-way vector partitioning based on an optimal direction vector. As the problem to find the optimal direction vector is NP-problem, we propose an efficient heuristic to obtain high quality direction vector. As we approximate a given netlist into the graph and only use ten eigenvectors in practice, there is a chance to improve the solution quality by local optimization. Fiduccia-Mattheyses algorithm is employed as a post processing. Compared with FM and MELO, the proposed algorithm PDV reduces cutsize on the average 40\% and 20.5\%, respectively.

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

graph partitioning
spectral method
eigenvectors
local optimization
efficient heuristic
optimal direction vector
netlist

circuit layout cad
fiduccia-mattheyses algorithm
two-way partitioning
pdv algorithm
cutsize reduction
np-problem


Treatment of stress variables in advanced multilayered plate elements based upon Reissner's mixed variational theorem The subject of the present work consists of multilayered finite elements that are able to furnish an accurate description of strain/stress fields in multilayer flat structure analysis. The formulation of the finite elements is based upon Reissner's mixed variational theorem, which allows one to assume two independent fields for displacements and transverse stress variables. The resulting advanced finite element can describe, a priori, the interlaminar continuous transverse shear and normal stress fields, and the so called C-z(0)-requirements can be satisfied. This paper is mainly concerned about the treatment of stress variables in the mixed formulation. In particular, two layer-wise finite elements are compared. The first finite element examined, called LMN, uses a layer-wise mixed formulation and the displacements and transverse stresses are expanded along the thickness of a generic layer using a Legendre polynomial of N degree. In the assembling process, the transverse stress variables are eliminated at element level (static-condensation technique) after the generation of the element multilayered matrices. In the second finite element, called LMNF, the approach taken in the first finite element (LMN) is used, except that the static-condensation technique is not applied, and both displacement and stress variables appear as problem unknown. This last approach guarantees that the transverse stresses between two adjacent elements are continuous functions (this does not happen if the static-condensation method is used). Therefore, it can be concluded that LMNF is a powerful two-dimensional tool to analyze very thick multilayered plates. (c) 2006 Civil-Comp Ltd. and Elsevier Ltd. All rights reserved.

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

fem
stress treatment
layer-wise theories


The complexity of weighted and unweighted #CSP We give some reductions among problems in (nonnegative) weighted #CSP which restrict the class of functions that needs to be considered in computational complexity studies. Our reductions can be applied to both exact and approximate computation. In particular, we show that the recent dichotomy for unweighted #CSP can be extended to rational-weighted #CSP. (C) 2011 Elsevier Inc. All rights reserved.

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

counting
constraint satisfaction
complexity theory


user interface description languages for next generation user interfaces In recent years HCI researchers have developed a broad range of new interfaces that diverge from the "window, icon, menu, pointing device" (WIMP) paradigm, employing a variety of novel interaction techniques and devices. Developers of these next generation user interfaces face challenges that are currently not addressed by state of the art user interface software tools. As part of the user interface software community's effort to address these challenges, the concept of a User Interface Description Language (UIDL), reemerge as a promising approach. To date, the UIDL research area has demonstrated extensive development, mainly targeting multi-platform and multi-modal user interfaces. However, many open questions remain regarding the usefulness and effectiveness of UIDLs in supporting the development of next generation interfaces. The aim of this workshop is to bring together both developers of next generation user interfaces and UIDL researchers in an effort to identify key challenges facing this community, to jointly develop new approaches aimed at solving these challenges and finally to consider future spaces for UIDL research.

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


an affective model of user experience for interactive art The development of Affective Interface technologies makes it possible to envision a new generation of Digital Arts and Entertainment applications, in which interaction will be based directly on the analysis of user experience. In this paper, we describe an approach to the development of Multimodal Affective Interfaces that supports real-time analysis of user experience as part of an Augmented Reality Art installation. The system relies on a PAD dimensional model of emotion to support the fusion of affective modalities, each input modality being represented as a PAD vector. A further advantage of the PAD model is that it can support a representation of affective responses that relate to aesthetic impressions.

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

affective computing
multimodal interaction


FAULT TOLERANCE IN PETASCALE/EXASCALE SYSTEMS: CURRENT KNOWLEDGE, CHALLENGES AND RESEARCH OPPORTUNITIES The emergence of petascale systems and the promise of future exascale systems have reinvigorated the community interest in how to manage failures in such systems and ensure that large applications, lasting several hours or tens of hours, are completed successfully. Most of the existing results for several key mechanisms associated with fault tolerance in high-performance computing (HPC) platforms follow the rollback-recovery approach. Over the last decade, these mechanisms have received a lot of attention from the community with different levels of success. Unfortunately, despite their high degree of optimization, existing approaches do not fit well with the challenging evolutions of large-scale systems. There is room and even a need for new approaches. Opportunities may come from different origins: diskless checkpointing, algorithmic-based fault tolerance, proactive operation, speculative execution, software transactional memory, forward recovery, etc. The contributions of this paper are as follows: (1) we summarize and analyze the existing results concerning the failures in large-scale computers and point out the urgent need for drastic improvements or disruptive approaches for fault tolerance in these systems; (2) we sketch most of the known opportunities and analyze their associated limitations; (3) we extract and express the challenges that the HPC community will have to face for addressing the stringent issue of failures in HPC systems.

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

fault tolerance
knowledge
challenges
opportunities


Generalized integer transform based reversible watermarking algorithm using efficient location map encoding and adaptive thresholding A novel algorithm that improves a generalized integer transform based reversible watermarking scheme is proposed in this paper. In our proposed algorithm, two main improvements have been achieved: adaptive thresholding and efficient location map encoding. With adaptive thresholding, suitable threshold \(t\) is selected adaptively, which ensures enough embedding capacity for the watermark while keeps the distortion introduced as low as possible. This modification is influential as an unsuitable threshold can lead to insufficient space for the watermark or even degrade the visual quality of the image. Moreover, efficient location map encoding helps in reducing the location map size, which down to 0.4 of the one unmodified in average. Therefore, more capacity is available for embedding as there is lesser overhead information. Overall, it provides more embedding capacity whereas improves the visual quality of the embedded image.

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

generalized integer transform
location map
reversible watermarking
threshold


Usage and perceived impact of data warehouses: A study in Korean financial companies Although several previous studies have investigated the success factors and implementations of data warehouses, only few of them have explored the end-users' perceptions of data warehouses. Moreover, none of these previous studies were conducted in a company outside North America. Thus, this study was conducted to identify the data waxehousing system characteristics affecting end-users' usage and perceived impact of using data warehouses in Korean financial companies. A research model for end-users' usage and perceived impact of using data warehouses was developed based on the Technology Acceptance Model and the IS Success Model. Then, a survey questionnaire was design to collect data from the data warehousing users in four leading Korean financial companies. We analyzed these data to test the proposed hypotheses by using Structural Equation Modeling. Results of this study suggest that Data Quality and End-user Support and Training axe significant system characteristics affecting end-users' usage of data warehouses and perceived impact of data warehouses.

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

data warehouse
user's perceptions
critical success factors


Theoretical analysis of expected payoff in an adversarial domain Adversarial decision making is aimed at finding strategies for dealing with an adversary who observes our decisions and tries to learn our behavior pattern. Based on a simple mathematical model, the present contribution provides analytical expressions for the expected payoff when using simple strategies which try to balance confusion and payoff. Additional insights are provided regarding the structure of the payoff matrix. Computational experiments show the agreement between theoretical expressions and empirical simulations, thus paving the way to make the assessment of new strategies easier.

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


tea table, come closer to me We present a new concept (named DA vinCi) of distributed agents, sensor networks and an intelligent server catered to the home environment. Instead of a single multi-tasking human-like robot, we propose a team of networked task-specific robotic agents that interface with each other and the environment through a spatial map built by the server. We also highlight how our server will be a proxy for all the human-robot interactions (HRI) in the system and discuss the challenges involved. The paper's title captures the jist of our system where even a tea table can be inexpensively mobilized and interacted with via the DA vinCi architecture.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 bibliometric analysis on tobacco regulation investigators To facilitate the implementation of the Family Smoking Prevention and Tobacco Control Act of 2009, the Federal Drug Agency (FDA) Center for Tobacco Products (CTP) has identified research priorities under the umbrella of tobacco regulatory science (TRS). As a newly integrated field, the current boundaries and landscape of TRS research are in need of definition. In this work, we conducted a bibliometric study of TRS research by applying author topic modeling (ATM) on MEDLINE citations published by currently-funded TRS principle investigators (PIs).

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

author topic modeling
bibliometric analysis
fda
principle investigators


Architectural design for resilience Resilience has become a new nonfunctional requirement for information systems. Many design decisions have to be made at the architectural level in order to deliver an information system with the resilience property. This paper discusses the relationships between resilience and other architectural properties such as scalability, reliability, and consistency. A corollary is derived from the CAP theorem, and states that it is impossible for a system to have all three properties of consistency, resilience and partition-tolerance. We present seven architectural constraints for resilience. The constraints are elicited from good architectural practices for developing reliable and fault-tolerant systems and the state-of-the-art technologies in distributed computing. These constraints provide a comprehensive reference for architectural design towards resilience.

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

software architecture
fault tolerance
virtualisation
service-oriented architecture
redundancy
self-management