Classical communication and non-classical fidelity of quantum teleportation In quantum teleportation, the role of entanglement has been much discussed. It is known that entanglement is necessary for achieving non-classical teleportation fidelity. Here we focus on the amount of classical communication that is necessary to obtain non-classical fidelity in teleportation. We quantify the amount of classical communication that is sufficient for achieving non-classical fidelity for two independent 1-bit and single 2-bits noisy classical channels. It is shown that on average 0.208 bits of classical communication is sufficient to get non-classical fidelity. We also find the necessary amount of classical communication in case of isotropic transformation. Finally we study how the amount of sufficient classical communication increases with weakening of entanglement used in the teleportation process.

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

quantum teleportation
classical communication
teleportation fidelity


Estimation of heart rate signals for mental stress assessment using neuro fuzzy technique This paper presents the evaluation of mental stress assesment using heart-rate variability (HRV). The activity of the autonomic nervous system (ANS) is studied by means of time-frequency analysis (TFA) of the heart-rate variability signal. Spectral decomposition of the heart-rate variability before smoking and after smoking was obtained. Mental stress is accompanied by dynamic changes in ANS activity. HRV analysis is a popular tool for assessing the activities of autonomic nervous system. The approach consists of (1) monitoring of heart rate signals, (2) signal processing using wavelet transform (WT) (different wavelets), (3) neuro fuzzy evaluation techniques to provide robustness in HRV analysis, (4) monitoring the function of ANS under different stress conditions. Our experiment involves 20 physically fit persons under different times (before smoking and after smoking). Nero fuzzy technique have been used to model the experimental data.

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

adaptive neuro fuzzy inference system (anfis)


Approximately optimal bidding policies for repeated first-price auctions We suggest approximately optimal bidding strategies for games, where similar items are auctioned repeatedly. Considering players bounded rationality in practice, the results can further motivate the application of market-based approaches in resource allocation problems. We specialize the bidding algorithm for first-price payment schemes, the building blocks of several simplified selling mechanisms, that are common in practice.

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

mathematical optimization
approximation methods
game theory
bayesian equilibrium
repeated games
decision-making problems


system design and implementation of bgraf2 BGRAF2 is a real-time interactive 2D graphics language. Its supporting system contends with an unusual combination of features: timing, events, parallelism, image manipulation, user interaction and procedural structures. This combination creates within the system many unpredictable interrelated tasks competing for execution. A BGRAF2 program is compiled into an object module consisting of a sequence of pure code blocks, tasks, and a set of data blocks. The real-time environment is a hierarchical structure, where the highest level is a Scheduler, and the next level is composed of the object module and five additional processors: Graphics Processor, Control Processor, Input-Output Processor, Real-Time Processor and Memory Manager. The Scheduler is an abstract monitor responsible for scheduling tasks in accordance with a multi-level priority from a multi-queue scheme.

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

scheduling
hierarchical structure
object
graphics
timing
control
processor
interaction
system design
code
language
module
implementation
data
image
manipulation
monitor
sequence
scheme

concurrent processing
buddy system
input
hard real time
graphics language system
event
one-way barrier
slippage
side-effects
computer graphics
real-time
combinational
management
hierarchic
structure
systems
abstraction
environments
procedure
parallel
user interaction
memorialized
graphic processor
feature
priorities


An efficient KPCA algorithm based on feature correlation evaluation Classic kernel principal component analysis (KPCA) is less computationally efficient when extracting features from large data sets. In this paper, we propose an algorithm, that is, efficient KPCA (EKPCA), that enhances the computational efficiency of KPCA by using a linear combination of a small portion of training samples, referred to as basic patterns, to approximately express the KPCA feature extractor, that is, the eigenvector of the covariance matrix in the feature extraction. We show that the feature correlation (i.e., the correlation between different feature components) can be evaluated by the cosine distance between the kernel vectors, which are the column vectors in the kernel matrix. The proposed algorithm can be easily implemented. It first uses feature correlation evaluation to determine the basic patterns and then uses these to reconstruct the KPCA model, perform feature extraction, and classify the test samples. Since there are usually many fewer basic patterns than training samples, EKPCA feature extraction is much more computationally efficient than that of KPCA. Experimental results on several benchmark data sets show that EKPCA is much faster than KPCA while achieving similar classification performance.

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

feature extraction
feature correlation
cosine distance

kernel principal component analysis (kpca)


Microwave imaging of dielectric cylinders from experimental scattering data based on the genetic algorithms, neural networks and a hybrid micro genetic algorithm with conjugate gradient The application of three techniques for the reconstruction of the permittivity profile of cylindrical objects from scattered field measurements is studied in the present paper. These approaches are applied to two-dimensional configurations. After an integral formulation, a discretization using the method of moments (MoM) is applied. Considering that the microwave imaging is recast as a nonlinear optimization problem, a cost functional is defined by the norm of a difference between the measured scattered electric field and that calculated for an estimated relative permittivity distribution. Thus, the permittivity profile can be obtained by minimizing the cost functional. In order to solve this inverse scattering problem, three techniques are employed. The first is based on a basic real coded genetic algorithms (GAs). The second is a hybrid technique (mGA-CG) which is based on a conjunction of a micro genetic algorithm (mGA) approach with the conjugate gradient based method (CG). The third is an application of an artificial neural network (ANN) having multilayered perceptrons architecture (MLPs). Three algorithms: conjugate gradient with PolakRibiere updates (CGP), LevenbergMarquardt (LM) and gradient descent (GD) are used to train the ANN. Computer simulations of these methods are performed for reconstruction of circular cylinders against laboratory-controlled microwave data.

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

microwave imaging
hybrid technique
neural network

micro genetic algorithms
reconstruction of permittivity profile.


Yi An Editor in Haskell for Haskell Yi is a text editor written in Haskell and extensible in Haskell. We take advantage of Haskell's expressive power to define embedded DSLs that form the foundation of the editor. In turn, these DSLs provide a flexible mechanism to create extended versions

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


On using multivariate polynomial regression model with spectral difference for statistical model-based speech enhancement In this paper, we propose a statistical model-based speech enhancement technique using a multivariate polynomial regression (MPR) based on spectral difference scheme. In the analyzing step, three principal parameters, the weighting parameter in the decision-directed (DD) method, the long-term smoothing parameter for the noise estimation. The control parameter of the minimum gain value is estimated as optimal operating points technique by using to the spectral difference under various noise conditions. The MPR technique offers an effective scheme to represent complex nonlinear input-output relationship between the optimal operating points and spectral differences so that operating points can be determined according to various noise conditions in the off-line step.

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

speech enhancement
polynomial regression
spectral difference

decision-directed method
noise power estimation


Compiling almost-whole Java programs This paper presents a strategy, called almost-whole-program compilation, for extending the benefits of whole-program optimization to large collections of Java components that are,packaged as a group after the development phase. This strategy has been implemented in a framework that uses Java visibility and scoping rules to transform a collection of classes into a package that is amenable to whole-program optimizations, without precluding extensions to the optimized and compiled code. Thus, it enables the Java developer to balance performance against flexibility of the program after the development phase, without compromising the design process. The transformation is shown to incur only modest performance penalties, which are more than compensated for by the interprocedural optimizations it enables. The paper concludes with experimental results showing the benefits that can be achieved using this approach. Copyright (c) 2005 John Wiley & Sons, Ltd.

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

whole-program compilation
almost whole-program compilation
incremental compilation
object-oriented optimization


tutoring tool for logical schemes design Tutoring tool for logical schemes design with a Graphical User Interface having been a part of an intelligent environment for analysis and synthesis of Boolean functions is presented in this paper. The tool affords an opportunity of drawing logical schemes in a defined basis. It determines and if the user desires brings out the truth table of the synthesised structured scheme. It offers a list of Boolean functions for structured synthesis, formed like a number of tasks which the user can choose. The tool has a possibility to estimate the rightness of the drawing scheme and can save it as a file. It is designed to help the students giving them a way to practice and improve their skills in the area of logical schemes design. It can be used for testing or self-learning. Java programming language has been used. That allows to create it as an applet and to incorporate it in a Web document or as a stand-alone application. Thus this tool can find a large area of its application in the virtual universities, distance education and e learning.

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


A seepage computational model of face slab cracks based on equi-width joint constant flow Based on the law of equi-width joint steady flow, a seepage computational model was established. This model permits use of finite element method in seepage simulation and analysis. In addition, rock-fill dam seepage characteristics under an unusual condition with massive face slab cracks was obtained via a computational example.

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

concrete face rock-fill dam
face slab crack
computation model


Stabilizing leader election in partial synchronous systems with crash failures This article deals with stabilization and fault-tolerance. We consider two types of stabilization: the self- and pseudo-stabilization. Our goal is to implement the self- and/or pseudo-stabilizing leader election in systems with process crashes, weak reliability, and synchrony assumptions. We try to propose, when it is possible, communication-efficient implementations. Our approach allows to obtain algorithms that tolerate both transient and crash failures. Note that some of our solutions are adapted from existing fault-tolerant algorithms. The motivation here is not to propose new algorithms but merely to show some assumptions required to obtain stabilizing leader elections in systems with crash failures. In particular, we focus on the borderline assumptions where we go from the possibility to have self-stabilizing solutions to the possibility to only have pseudostabilizing ones. (C) 2009 Elsevier Inc. All rights reserved.

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


Developing a large electronic primary care database (Doctors Independent Network) for research Background and objectives: Primary care databases form a unique source of population-based clinical information on the prevalence and management of diagnosed disorders. Historically such databases have lacked individual level socio-economic markers. We describe the development of the Doctors Independent Network (DIN) database for epidemiological and health services research. DIN includes a socio-economic marker (ACORN) based on postcode linkage at individual patient level. The validity of DIN is assessed against the General Practice Research Database (GPRD). Methods: External validity is assessed by comparing the demographic structure and prevalence rates for treated ischemic heart disease (IHD) and treated hay fever with those from the GPRD. We assess the utility of a socio-economic measure (ACORN) based on postcode-linkage at individual patient level by examining the trend in prevalence rates of IHD and hay fever by ACORN index. Results: 142 practices providing high quality data were selected, with 1,827,361 fully registered patients contributing data between 1992 and 2001, representing an identical agesex structure to that for England & Wales and GPRD. Regionally adjusted prevalence of treated IHD (7.29 and 5.37%, respectively for men and women aged 35+ in 1998) in DIN was highly comparable to GPRD (7.27 and 5.42%). In DIN, the odds ratio of IHD was 1.37 (95% CI 1.301.44) in subjects living in striving compared to thriving areas. The prevalence of treated hay fever prevalence was similar across databases, with inverse associations seen with ACORN in DIN (higher rates in thriving areas). Conclusions: DIN provides comparable period prevalence rates to GPRD for two common conditions, with social trends as expected. Primary care databases such as these have the potential to replace the decennial national morbidity surveys carried out in UK general practices, with DIN having the important advantage of including a socio-economic index.

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

primary care databases
period prevalence rates
hay fever
ischemic heart disease


Information maximization in face processing This perspective paper explores principles of unsupervised learning and how they relate to face recognition. Dependency coding and information maximization appear to be central principles in neural coding early in the visual system. These principles may be relevant to how we think about higher visual processes such as face recognition as well. The paper first reviews examples of dependency learning in biological vision, along with principles of optimal information transfer and information maximization. Next, we examine algorithms for face recognition by computer from a perspective of information maximization. The eigenface approach can be considered as an unsupervised system that learns the first- and second-order dependencies among face image pixels. Eigenfaces maximize information transfer only in the case where the input distributions are Gaussian. Independent component analysis (ICA) learns high-order dependencies in addition to first- and second-order relations, and maximizes information transfer for a more general set of input distributions. Face representations based on ICA gave better recognition performance than eigenfaces, supporting the theory that information maximization is a good strategy for high level visual functions such as face recognition. Finally, we review perceptual studies suggesting that dependency learning is relevant to human face perception as well, and present an information maximization account of perceptual effects such as the atypicality bias, and face adaptation aftereffects.

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

face recognition
information maximization
independent component analysis
vision
learning

unsupervised learning
machine learning
visual learning


A stochastic radial basis function method for the global optimization of expensive functions We introduce a new framework for the global optimization of computationally expensive multimodal functions when derivatives are unavailable. The proposed Stochastic Response Surface (SRS) Method iteratively utilizes a response surface model to approximate the expensive function and identifies a promising point for function evaluation from a set of randomly generated points, called candidate points. Assuming some mild technical conditions, SRS converges to the global minimum in a probabilistic sense. We also propose Metric SRS (MSRS), which is a special case of SRS where the function evaluation point in each iteration is chosen to be the best candidate point according to two criteria: the estimated function value obtained from the response surface model, and the minimum distance from previously evaluated points. We develop a global optimization version and a multistart local optimization version of MSRS. In the numerical experiments, we used a radial basis function (RBF) model for MSRS and the resulting algorithms, Global MSRBF and Multistart Local MSRBF, were compared to 6 alternative global optimization methods, including a multistart derivative-based local optimization method. Multiple trials of all algorithms were compared on 17 multimodal test problems and on a 12-dimensional groundwater bioremediation application involving partial differential equations. The results indicate that Multistart Local MSRBF is the best on most of the higher dimensional problems, including the groundwater problem. It is also at least as good as the other algorithms on most of the lower dimensional problems. Global MSRBF is competitive with the other alternatives on most of the lower dimensional test problems and also on the groundwater problem. These results suggest that MSRBF is a promising approach for the global optimization of expensive functions.

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

global optimization
radial basis function
response surface model
expensive function


Wavelet transform analysis predicts outcome of DC cardioversion for atrial fibrillation patients The aim of this study was to examine whether wavelet transform analysis of the electrocardiogram (ECG) can improve the prediction of the maintenance of sinus rhythm in patients with atrial fibrillation (AF) after external DC cardioversion. We examined a variety of wavelet transform-based statistical markers as potential candidates for the prediction of patient status post-cardioversion. Considering a success as a patient who remains in normal sinus rhythm for one month post cardioversion and failure as a patient who does not, it was shown the proposed non-parametric classification system can achieve 89% specificity at 100% sensitivity using a non-parametric classification method.

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

atrial fibrillation
external dc cardioversion
wavelet transform analysis
classification


The service-oriented, interoperable and knowledge-sharing architecture for ship specifications In the shipbuilding process, the information flow connected with ship specification files is very complex. These files are usually scattered as different file formats in various departments or stored as a database in the heterogeneous systems within a shipyard. Therefore, it is extremely difficult to integrate the information coming from different stages of shipbuilding, much less to share integrated information among various departments. To address that problem, the authors employ the service-oriented architecture concept to develop the knowledge-sharing architecture for ship specifications (KSASS). Equipped with extensible mark-up language and Web services technology, the KSASS is used to integrate the outline, full and construction specification files, which originate from three phases of shipbuilding. In this way, the database of ship specifications is established which is easily accessible and highly interoperable. The integrated specification files can not only be structurally preserved but also conveniently transmitted among the heterogeneous systems, with the open system achieved. Eventually, the knowledge owned by the shipyard will be efficiently managed, applied and shared.

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

extensible mark-up language
knowledge-sharing
service-oriented architecture
interoperability
heterogeneous data


Experimental study and simulation of a hydraulic engine mount with fully coupled fluid-structure interaction finite element analysis model Non-linear properties of a generic hydraulic engine mount (HEM) are identified and characterized by experiment and simulation approaches. The experimental methods for obtaining static and dynamic performances of the HEM are presented. The characteristics of two configurations of the take-apart HEMs (one is with an inertia track and a free decoupler and the other one is only with an inertia track) and their rubber springs are studied. The relations between static stiffness of an HEM and its rubber springs in three orthogonal directions are investigated. The influences of pre-load, excitation amplitudes and frequencies on the dynamic stiffness of an HEM are verified. The effects of the free decoupler on dynamic characteristics of the HEM are studied by comparisons of the test results of the two HEMs. The dynamic fluid pressure and the temperature in the upper chamber of an HEM are measured under different excitation conditions. A fully coupled fluid-structure interaction (FSI) and finite element analysis (FEA) model for simulation of HEMs is developed in this paper, which can be used to simulate the static and dynamic performances of the HEMs with only stress versus strain relations of the rubber materials, the fluid physical parameters and the HEMs sizes. The simulated results of one HEM with the proposed model are given, and the results match well with the measured data, or in coincidence with the working mechanisms of HEMs. (C) 2004 Elsevier Ltd. All rights reserved.

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

hydraulic engine mount
experimental study
finite element analysis

fully coupled fluid-structure interaction model


Development of low dissipative high order filter schemes for multiscale Navier-Stokes/MHD systems Recent progress in the development of a class of low dissipative high order (fourth-order or higher) filter schemes for multiscale Navier-Stokes, and ideal and non-ideal magnetohydrodynamics (MHD) systems is described. The four main features of this class of schemes are: (a) multiresolution wavelet decomposition of the computed flow data as sensors for adaptive numerical dissipative control, (b) multistep filter to accommodate efficient application of different numerical dissipation models and different spatial high order base schemes, (c) a unique idea in solving the ideal conservative MHD system (a non-strictly hyperbolic conservation law) without having to deal with an incomplete eigensystem set while at the same time ensuring that correct shock speeds and locations are computed, and (d) minimization of the divergence of the magnetic field (del center dot B) numerical error. By design, the flow sensors, different choice of high order base schemes and numerical dissipation models are stand-alone modules. A whole class of low dissipative high order schemes can be derived at ease, making the resulting computer software very flexible with widely applicable. Performance of multiscale and multiphysics test cases are illustrated with many levels of grid refinement and comparison with commonly used schemes in the literature. (c) 2007 Elsevier Inc. All rights reserved.

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

multiresolution wavelet analysis of flow data


Development of a decision support system for supplier evaluation and order allocation This study aims to develop models and generate a decision support system (DSS) for the improvement of supplier evaluation and order allocation decisions in a supply chain. Supplier evaluation and order allocation are complex, multi criteria decisions. Initially, an analytic hierarchy process (AHP) model is developed for qualitative and quantitative evaluation of suppliers. Based on these evaluations, a goal programming (GP) model is developed for order allocation among suppliers. The models are integrated into a DSS that provides a dynamic, flexible and fast decision making environment. The DSS environment is tested at the purchasing department of a manufacturer and feedbacks are obtained.

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

supplier evaluation
order allocation
analytic hierarchy process
goal programming


User credit-based collaborative filtering Memory-based collaborative filtering is the state-of-the-art method in recommender systems and has proven to be successful in various applications. In this paper we develop novel memory-based methods that incorporate the level of a user credit instead of using similarity between users. The user credit is the degree of one's rating reliability that measures how adherently the user rates items as others do. Preliminary simulation results show that the proposed methods outperform the conventional memory-based ones. The methods are effective in a cold-starting problem. (C) 2008 Elsevier Ltd. All rights reserved.

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

memory-based method
recommender system
sparsity


Novel fuzzy inference system (FIS) analysis and design based on lattice theory We introduce novel (set- and lattice-theoretic) perspectives and tools for the analysis and design of fuzzy inference systems (FISs). We present an FIS, including both fuzzification and defuzzification, as a device for implementing a function f : R-N -> R-M. The family of FIS functions has cardinality N-2 = 2(N)1, where N-1 is the cardinality of the set R of real numbers. Hence the FIS family is much larger than polynomials, neural networks, etc.; furthermore a FIS has a capacity for local generalization. A formulation in the context of lattice theory allows us to define the set F* of fuzzy interval numbers (FINs), which includes both (fuzzy) numbers and intervals. We present a metric d(K) on F*, which can introduce tunable nonlinearities. FIS design based on d(K) has advantages such as: an alleviation of the curse of dimensionality problem and a potential for improved computer memory utilization. We present a new FIS classifier, namely granular self-organizing map (grSOM), which we apply to an industrial fertilizer modeling application.

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

classification
fuzzy interval number (fin)
industrial system modeling


provable data possession at untrusted stores We introduce a model for provable data possession (PDP) that allows a client that has stored data at an untrusted server to verify that the server possesses the original data without retrieving it. The model generates probabilistic proofs of possession by sampling random sets of blocks from the server, which drastically reduces I/O costs. The client maintains a constant amount of metadata to verify the proof. The challenge/response protocol transmits a small, constant amount of data, which minimizes network communication. Thus, the PDP model for remote data checking supports large data sets in widely-distributed storage system. We present two provably-secure PDP schemes that are more efficient than previous solutions, even when compared with schemes that achieve weaker guarantees. In particular, the overhead at the server is low (or even constant), as opposed to linear in the size of the data. Experiments using our implementation verify the practicality of PDP and reveal that the performance of PDP is bounded by disk I/O and not by cryptographic computation.

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

storage security
homorphic verifiable tags
archival storage


in support of city exploration The novel experience Anywhere allowed participants to explore an urban area, tying together information not normally available, new points of views and interaction embedded into physical places. Guided by 'unseen', on-the-street performers in an ongoing conversation maintained over mobile phones, they gained access to locative media and staged performances. Our analysis demonstrates how Anywhere produced engaging and uniquely personalised paths through a complex landscape of content, negotiated by the performer-participant pair around various conflicting constraints. We reflect our analysis through the lens of the key characteristics exhibited by mechanisms that support city exploration, before focussing on possible extensions to the technological support of teams of professional and amateur guides.

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

city guide
locative experiences
performance


1D wave propagation in saturated viscous geomaterials: Improvement and validation of a fractional step TaylorGalerkin finite element algorithm This paper tackles the numerical simulation of 1D wave propagation in saturated viscous porous media, and especially in soil-like geomaterials. For this purpose, an improved fractional step TaylorGalerkin algorithm is first formulated and then validated on the basis of a new analytical solution. The algorithm, based on a stressvelocitypressure formulation of the hydro-mechanical problem, combines an explicit TaylorGalerkin method with a fractional time-stepping, while an accurate RungeKutta-type integrator is introduced to treat the viscosity of the porous skeleton. The overall algorithm results in an efficient stabilized scheme allowing for linear equal interpolation of field variables, even when the so-called undrained incompressible limit is approached. The accuracy and stability of the method are verified with reference to a 1D benchmark problem, concerning the propagation of P waves along a saturated viscoelastic soil stratum. For this problem, a frequency-domain analytical solution is derived, assuming incompressible interstitial fluid and soil grains. The assumption of Maxwell viscoelastic soil skeleton is analytically convenient to preserve the linearity of the problem, while the same rheology of a more realistic elasto-viscoplastic non-linear behaviour is maintained. The performance of the fractional step TaylorGalerkin algorithm is explored simulating the dynamic response of the stratum to harmonic, impulsive and seismic input excitations. In particular, parametric analyses are performed to confirm the effectiveness of the method in reproducing fully undrained responses, as well as in dealing with weakly viscous materials.

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

fractional step
taylorgalerkin
viscosity
analytical solution


Dynamic fluidstructure interaction using finite volume unstructured mesh procedures A three-dimensional finite volume, unstructured mesh (FV-UM) method for dynamic fluidstructure interaction (DFSI) is described. Fluid structure interaction, as applied to flexible structures, has wide application in diverse areas such as flutter in aircraft, wind response of buildings, flows in elastic pipes and blood vessels. It involves the coupling of fluid flow and structural mechanics, two fields that are conventionally modelled using two dissimilar methods, thus a single comprehensive computational model of both phenomena is a considerable challenge. Until recently work in this area focused on one phenomenon and represented the behaviour of the other more simply. More recently, strategies for solving the full coupling between the fluid and solid mechanics behaviour have been developed. A key contribution has been made by Farhat et al. [Int. J. Numer. Meth. Fluids 21 (1995) 807] employing FV-UM methods for solving the Euler flow equations and a conventional finite element method for the elastic solid mechanics and the spring based mesh procedure of Batina [AIAA paper 0115, 1989] for mesh movement. In this paper, we describe an approach which broadly exploits the three field strategy described by Farhat for fluid flow, structural dynamics and mesh movement but, in the context of DFSI, contains a number of novel features: a single mesh covering the entire domain, a NavierStokes flow, a single FV-UM discretisation approach for both the flow and solid mechanics procedures, an implicit predictorcorrector version of the Newmark algorithm, a single code embedding the whole strategy.

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

fluid structure interaction
finite volume
newmark algorithm

transient structural dynamics
geometric conservation law


Metabolic network destruction: Relating topology to robustness Biological networks exhibit intriguing topological properties such as small-worldness. In this paper, we investigate whether the topology of a particular type of biological network, a metabolic network, is related to its robustness. We do so by perturbing a metabolic system in silico, one reaction at a time and studying the correlations between growth, as predicted by flux balance analysis, and a number of topological metrics, as computed from three network representations of the metabolic system. We find that a small number of metrics correlate with growth and that only one of the network representations stands out in terms of correlated metrics. The most correlated metrics point to the importance of hub nodes in this network, so-called currency metabolites. Since they are responsible for interconnecting distant functional modules in the network, they are important points in the network for predicting if reaction removal affects growth. A second set of correlations in contrast is related to loner nodes that uniquely connect important pathways and thus correspond to essential steps in metabolism.

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


Optimal per-edge processing times in the semi-streaming model We present semi-streaming algorithms for basic graph problems that have optimal per-edge processing times and therefore surpass all previous semi-streaming algorithms for these tasks. The semi-streaming model, which is appropriate when dealing with massive graphs, forbids random access to the input and restricts the memory to O(n center dot polylog n) bits. Particularly, the formerly best per-edge processing times for finding the connected components and a bipartition are O(alpha(n)), for determining k-vertex and k-edge connectivity O(k(2)n) and O(n center dot logn) respectively for any constant k and for computing a minimum spanning forest O(log n). All these time bounds we reduce to O(1). Every presented algorithm determines a solution asymptotically as fast as the best corresponding algorithm up to date in the classical RAM model, which therefore cannot convert the advantage of unlimited memory and random access into superior computing times for these problems. (c) 2007 Elsevier B.V. All rights reserved.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 algorithms
streaming algorithms
per-edge processing time


Cognitive load theory vs. constructivist approaches: which best leads to efficient, deep learning? Computer-assisted learning, in the form of simulation-based training, is heavily focused upon by the military. Because computer-based learning offers highly portable, reusable, and cost-efficient training options, the military has dedicated significant resources to the investigation of instructional strategies that improve learning efficiency within this environment. In order to identify efficient instructional strategies, this paper investigates the two major learning theories that dominate the recent literature on optimizing knowledge acquisition: cognitive load theory (CLT) and constructivism. According to CLT, instructional guidance that promotes efficient learning is most beneficial. Constructivist approaches, in contrast, emphasize the importance of developing a conceptual understanding of the learning material. Supporters of these theories have debated the merits and shortcomings of both positions. However, in the absence of consensus, instructional designers lack a well-defined model for training complex skills in a rapid, efficient manner. The current study investigates the relative utility of CLT and constructivist-based approaches for teaching complex skills using a military command and control task. Findings suggest that the acquisition of procedural, declarative, and conceptual knowledge, as well as decision-making skills, did not differ as a function of the type of instruction used. However, integrated knowledge was slightly better retained by the group provided with CLT-based instruction. These results are contrary to our expectation that constructivist approaches, which focus on the development and integration of information, would yield better performance in an applied problem-based environment. Thus, while contemporary researchers continue to defend the use of constructivist strategies for teaching, our research supports earlier findings that question the utility, efficiency, and impact of these strategies in applied domains.

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

cognitive load theory
constructivism
integrated knowledge
learning efficiency


performance analysis of credit re-authorization schemes in umts online charging system In 3GPP Release 6, the IP-based Online Charging System (OCS) is defined to support online charging for General Packet Radio Service (GPRS) and IP Multimedia core network Subsystem (IMS) services. During an online charging GPRS session, a number of mid-session events, such as Quality of Service (QoS) could dynamically affect the rating of the in-progress service. When such events occur, the GPRS support node needs to re-authorize the granted credit units with the OCS. If the change of QoS occurs frequently,the signaling load incurred by the re-authorization procedure increases heavily. In this paper, we propose a threshold-based scheme with parameter ? to reduce the traffic signaling for credit reauthorization procedure. By selecting an appropriate ? value, our study indicates that the signaling overhead in the OCS can be significantlyreduced while the inaccuracy of the credit informationinsignificantly increases. Based on our model, the mobile operator can choose appropriate parameter values in the threshold-based scheme for various traffic conditions.

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

credit reservation
telecommunications
streaming services


On-line algorithms for computing mean and variance of interval data, and their use in intelligent systems When we have only interval ranges [ x ? i , x i ] of sample values x1,,xn, what is the interval [ V ? , V ] of possible values for the variance V of these values? There are quadratic time algorithms for computing the exact lower bound V on the variance of interval data, and for computing V under reasonable easily verifiable conditions. The problem is that in real life, we often make additional measurements. In traditional statistics, if we have a new measurement result, we can modify the value of variance in constant time. In contrast, previously known algorithms for processing interval data required that, once a new data point is added, we start from the very beginning. In this paper, we describe new algorithms for statistical processing of interval data, algorithms in which adding a data point requires only O(n) computational steps.

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


Texture pattern analysis of kidney tissues for disorder identification and classification using dominant Gabor wavelet A study on ultrasound kidney images using proposed dominant Gabor wavelet is made for classifying a few important kidney categories. Three kidney categories, namely, normal (NR), medical renal diseases (MRD) and cortical cyst (CC) are considered for the analysis. Of the 30 Gabor wavelets, a unique dominant Gabor wavelet is determined by maximizing the similarity between original pre-processed image and reconstructed Gabor image. The dominant Gabor features "mu(D)(mn)" and "AAD(mn)(D)" are then evaluated to characterize the tissues of kidney region and compared with the Gabor features derived by considering all Gabor wavelets individually and as a whole using the resultant classification efficiency. The results obtained show that the proposed dominant Gabor wavelet features provide the classification efficiency of 86.66% for NR, 76.66% for MRD and 83.33% for CC, while individual wavelet features offer less than 70%, 63.33% and 66% for NR, MRD and CC. The overall classification efficiency improves by 18.89% with dominant Gabor features when compared to the classification efficiency obtained by considering all the Gabor wavelets features. The outputs of the proposed technique are validated with medical experts to assess the actual efficiency. The overall discriminating ability of the systems is also evaluated with performance evaluation measures, F-score and ROC. It has been observed that the dominant Gabor wavelet improves the classification efficiency appreciably and explores the possibility of implementing a computer-aided diagnosis system exclusively for ultrasound kidney 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 B I O O O O O O O O O O O O O O O O O O O O O O O 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 B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

ultrasound kidney images analysis
kidney classification
k-mean clustering
linear decision boundary
computer-aided diagnosis


An algorithm for the multiparametric 01-integer linear programming problem relative to the objective function The multiparametric 01-Integer Linear Programming (01-ILP) problem relative to the objective function is a family of 01-ILP problems in which the problems are related by having identical constraint matrix and right-hand side vector. In this paper we present an algorithm to perform a complete multiparametric analysis.

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

integer programming
parametric programming
knapsack problem


quick scheduler a time-saving tool for scheduling class sections QUICK Scheduler is a web-based application to help students and academic advisors with the scheduling process. At the point where a student knows what courses he or she will take in a given semester, the courses can be put into the scheduler and the scheduler will select sections of the courses that do not conflict with other classes or with other specified activities. The final result is a one-page graphic schedule showing activities the student has entered as well as sleep time, study time, and class times. The students get a visual representation of the time commitment required for the course load they are attempting, and save many hours of looking through the course schedule booklet for class times. The Scheduler is flexible, allowing students to enter section numbers for some courses if desired. The remaining courses will be scheduled around the selected sections. The paper and presentation will describe the application, its success at Texas Tech University over the last six years, and the issues involved in making such an application available. Issues in modifying the application for use at other universities will be discussed, with The University of Texas of the Permian Basin as an example. The issues will include availability, possible stress on the server, security and privacy, and interoperability with other University applications. Using student software development projects for production applications will be addressed. This application was originally written by Texas Tech University graduate students (including the author of this abstract).

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

registration tool
class scheduling
software maintenance


answering queries using views with arithmetic comparisons We consider the problem of answering queries using views, where queries and views are conjunctive queries with arithmetic comparisons (CQACs) over dense orders. Previous work only considered limited variants of this problem, without giving a complete solution. We have developed a novel algorithm to obtain maximally-contained rewritings (MCRs) for queries having left (or right) semi-interval-comparison predicates. For semi-interval queries, we show that the language of finite unions of CQAC rewritings is not sufficient to find a maximally-contained solution, and identify cases where datalog is sufficient. Finally, we show that it is decidable to obtain equivalent rewritings for CQAC queries.

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

conjunctive queries
queries
datalog
views
algorithm
comparisons
language


Optimal design of Information Centric Networks Information-Centric Networking (ICN) has recently gained momentum as a promising paradigm for the next-generation Internet architecture. The first prototypes for ICN-capable routers have already been developed; however, to migrate the devices to this novel architecture, non-negligible investments should be made. Therefore, it is of utter importance to provide clear quantitative insights of the expected economic benefits that operators will experience by switching to the ICN paradigm. For these reasons, in this paper we tackle the content-aware network-planning problem, and we formulate a novel optimization model to study the migration to an ICN, in a budget-constrained scenario. Our formulation takes into accurate account traffic routing and content caching. We prove that the optimization problem is NP-Hard, then we formulate heuristics to efficiently solve it. An extensive simulation campaign with real network topologies shows that our greedy heuristic cuts the computation time while finding close to optimal solutions, and therefore can effectively support network operators to evaluate the effects of a migration to ICN.

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

information-centric networking
planning
content distribution


A two-phase approach for mining weighted partial periodic patterns We propose a weighted partial periodic patterns mining algorithm to find important patterns. The two-phase upper-bound weighted model is adopted to speed up the mining process. The experiments in synthetic and oil price datasets prove the practicality in decision making.

O O O O O O O O O O O O O O O O O O O O O O O O O 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 mining
event
partial periodic pattern
projection
weight-based


Analyzing a class of pseudo-random bit generator through inductive machine learning paradigm Random number generation is an integral part of strong cipher systems. If a pseudo-random sequence can be predicted with better than chance probability then the generator is considered to be cryptographically weak. This paper deals with next bit prediction of pseudo-random binary sequences generated by Linear Feedback Shift Register (LFSR) and LFSR-based Pseudo-Random Bit Generators (PRBG), using inductive Machine Learning (ML) paradigm, namely C4.5 the most common and widely used inductive data mining algorithm. This machine learning technique has been introduced to convert the theoretical prediction problem into a classification problem, which we coined as Classificatory Prediction problem. We further extended the use of this technique to predict next bit without having any knowledge of subsequent bits of the PRBG and can be termed as true Next Bit Predictor. The technique used is independent of the parameters and domain knowledge of the pseudo-random bit generators. The present study is a comprehensive extension of the work done by Hernandez et al. [15]. We performed meticulous experiments (over wide range of LFSRs) and came out with a more explanatory analysis. Our classificatory prediction results paved the way for the evolution of the next bit prediction model.

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

machine learning
classificatory prediction problem
linear feedback shift register

next-bit prediction
stream cipher
pseudo random bit generator


Quality and power efficient architecture for the discrete cosine transform In recent years, the demand for multimedia mobile battery-operated devices has created a need for low power implementation of video compression. Many compression standards require the discrete cosine transform (DCT) function to perform image/video compression. For this reason, low power DCT design has become more and more important in today's image/video processing. This paper presents a new power-efficient Hybrid DCT architecture which combines Loeffler DCT and binDCT in terms of special property on luminance and chrominance difference. We use Synopsys PrimePower to estimate the power consumption in a TSMC 0.25-mu m technology. Besides, we also adopt a novel quality assessment method based on structural distortion measurement to measure the quality instead of peak signal to noise rations (PSNR) and mean squared error (MSE). It is concluded that our Hybrid DCT offers similar quality performance to the Loeffler, and leads to 25% power consumption and 27% chip area savings.

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


Within-document retrieval: A user-centred evaluation of relevance profiling We present a user-centred, task-oriented, comparative evaluation of two within-document retrieval tools. ProfileSkim computes a relevance profile for a document with respect to a query, and presents the profile as an interactive bar graph. FindSkim provides similar functionality to the web browser "Find" command. A novel simulated work task was devised, where participants are asked to identify (index) relevant pages of an electronic book, given topics from the existing book index. The original book index provides the ground truth, against which the indexing results of the participants can be compared. We confirmed a major hypothesis, namely ProfileSkim proved significantly more efficient than Find-Skim, as measured by time for task. The study indicates that ProfileSkim was as least as effective as FindSkim in identifying relevant pages, as measured by traditional information retrieval measures, and there is some evidence that ProfileSkim is a precision-enhancing tool. Based on qualitative data from questionnaires, we also provide strong evidence to support our conjecture that the participants would be more satisfied when using ProfileSkim than FindSkim. The experimental study confirmed the potential of relevance profiling for improving within-document retrieval. Relevance profiling should prove highly beneficial for users trying to identify relevant information within long documents.

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

within-document retrieval
interactive information retrieval
task-oriented evaluation
language models


The Brain of Musicians Musicians form an ideal subject pool in which one can investigate possible cerebral adaptations to unique requirements of skilled performance as well as cerebral correlates of unique musical abilities such as absolute pitch and others. There are several reasons for this. First, the commencement of musical training usually occurs when the brain and its components may still be able to adapt. Second, musicians undergo long-term motor training and continued practice of complicated bimanual motor activity. Third, imaging studies from our group as well as other groups have shown that motor learning and the acquisition of skills can lead to changes in the representation of motor maps and possibly also to microstructural changes. Whether the unique musical abilities and structural differences that musicians' brains show are due to learning, perhaps during critical periods of brain development and maturation, or whether they reflect innate abilities and capacities that might be fostered by early exposure to music is largely unknown. We will report studies that indicate that certain regions in the brain (corpus callosum, motor cortex, cerebellum) may show some form of adaptation to extraordinary challenges and requirements of performance. These challenges may eventually lead to functional and structural cerebral changes to accommodate the requirements for musical performance. Furthermore, we will also show the neural correlates of one unique musical ability, absolute pitch. This ability may be linked to one structure in the human brain (planum temporale), which is preferentially activated in musicians who have absolute pitch during tone tasks. This structure may undergo some form of functional plasticity that is possible only during a critical period of brain development.

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

brain
music
development
motor learning
absolute pitch


Sequential detection of targets in multichannel systems It is supposed that there is a multichannel sensor system which performs sequential detection of a target. Sequential detection is done by implementing a generalized Wald's sequential probability ratio test, which is based on the maximum-likelihood ratio statistic and allows one to fix the false-alarm rate and the rate of missed detections at specified levels. We present the asymptotic performance of. this sequential detection procedure and show that it is asymptotically optimal in the sense of minimizing the expected sample size when the probabilities of erroneous decisions are small. We do not assume that the observations are independent and identically distributed (i.i.d.). The first-order asymptotic optimality result holds for general statistical models that are not confined to the restrictive i.i.d. assumption. However, for i.i.d. and quasi-i.i.d. cases, where the log-likelihood ratios can be represented in the form of sums of random walks and slowly changing sequences, we obtain much stronger results. Specifically, using the nonlinear renewal theory we are able to obtain both tight expressions for the error probabilities and higher order approximations for the average sample size up to a vanishing term. The performance of the multichannel sequential detection algorithm is illustrated by an example of detection of a deterministic signal in correlated (colored) Gaussian noise. In this example, we provide both the results of theoretical analysis and the results of a Monte Carlo experiment. These results allow us to conclude that the use of the sequential detection algorithm substantially reduces the required resources of the system compared to the best nonsequential algorithm.

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

multichannel systems
nonlinear renewal theory

generalized sequential probability ratio test


discovery based network selection to improve fast vertical handoffs in heterogeneous networks This paper presents an improved link layer mechanism to assist FMIPv6 for seamless vertical handoffs. We introduce a new access router discovery method and propose a vertical handoff algorithm accordingly. Further, we report the implementation details performed through simulations. The simulations evidence performance improvements in terms of latency and packet loss. It is also analytically shown that by enabling access router discovery method and improving link layer event services, an MN can be well prepared for handoff and perform faster movements.

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

access router discovery
vertical handoff
heterogeneous networks
fmipv6


Incremental XPath Evaluation Incremental view maintenance for XPath queries asks to maintain a materialized XPath view over an XML database. It assumes an underlying XML database D and a query Q. One is given a sequence of updates U to D, and the problem is to compute the result of Q(U(D)): the result of evaluating query Q on database D after having applied updates U. This article initiates a systematic study of the Boolean version of this problem. In the Boolean version, one only wants to know whether Q(U(D)) is empty or not. In order to quickly answer this question, we are allowed to maintain an auxiliary data structure. The complexity of the maintenance algorithms is measured in, (1) the size of the auxiliary data structure, (2) the worst-case time per update needed to compute Q(U(D)), and (3) the worst-case time per update needed to bring the auxiliary data structure up to date. We allow three kinds of updates: node insertion, node deletion, and node relabeling. Our main results are that downward XPath queries can be incrementally maintained in time O(depth(D) . poly(vertical bar Q vertical bar)) per update and conjunctive forward XPath queries in time O(depth(D) . log(width(D)) . poly(vertical bar Q vertical bar)) per update, where vertical bar Q vertical bar is the size of the query, and depth(D) and width(D) are the nesting depth and maximum number of siblings in database D, respectively. The auxiliary data structures for maintenance are linear in vertical bar D vertical bar and polynomial in vertical bar Q vertical bar in all these cases.

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


RCCtrust: A Combined Trust Model for Electronic Community Previous trust models are mainly focused on reputational mechanism based on explicit trust ratings. However, the large amount of user-generated content and community context published on Web is often ignored. Without enough information, there are several problems with previous trust models: first, they cannot determine in which field one user trusts in another, so many models assume that trust exists in all fields. Second some models are not able to delineate the variation of trust scales, therefore they regard each user trusts all his friends to the same extent. Third, since these models only focus on explicit trust ratings, so the trust matrix is very sparse. To solve these problems, we present RCCtrust - a trust model which combines Reputation-, Content- and Context-based mechanisms to provide more accurate, fine-grained and efficient trust management for the electronic community. We extract trust-related information from user-generated content and community context from Web to extend reputation-based trust models. We introduce role-based and behavior-based reasoning functionalities to infer user's interests and category-specific trust relationships. Following the study in sociology, RCCtrust exploits similarities between pairs of users to depict differentiated trust scales. The experimental results show that RCCtrust outperforms pure user similarity method and linear decay trust-aware technique in both accuracy and coverage for a Recommender System.

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

content-based
context-based
reputation-based
web of trust


Multiobjective Optimization for Small Meander Wire Dipole Antennas in a Fixed Area Using Ant Colony System Fixed area meander line antennas designed on a 5 x 5 rectangular grid were optimized for efficiency and resonant frequency. The Pareto front was developed using ant colony optimization and the numerical electromagnetic code. The lowest frequency antenna fits an area of 0.11 lambda(0) x 0.05 lambda(0) with an efficiency of 88%. (C) 2009 Wiley Periodicals, Inc. Int J RF and Microwave CAE 19: 592-597, 2009.

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

meander line antenna
rfid
backbite operators
printed antennas


Efficient linear solution of exterior orientation This paper concerns an efficient algorithm for the solution of the exterior orientation problem. Orthogonal decompositions are used to first isolate the unknown depths of feature points in the camera reference frame, allowing the problem to be reduced to an absolute orientation with scale problem, which is solved using the SVD. The key feature of this approach is the low computational cost compared to existing approaches.

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

exterior orientation
absolute orientation


Relaxed stabilization conditions for continuous-time Takagi-Sugeno fuzzy control systems This paper deals with the stabilization of continuous-time Takagi-Sugeno (T-S) fuzzy control systems. Based on fuzzy Lyapunov functions and nonparallel distributed compensation (non-PDC) control laws, new stabilization conditions are represented in the form of linear matrix inequalities (LMIs). The theoretical proof shows that the proposed conditions can provide less conservatism than the existing results in the literature. Moreover, in order to demonstrate the effectiveness of the non-PDC control laws, the problem of H controller design for T-S fuzzy systems is also studied. Simulation examples are given to illustrate the merits of the proposed methods. (C) 2010 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 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

continuous-time t-s fuzzy systems
non-pdc control laws
linear matrix inequalities (lmis)


A roadmap to adopting emerging technology in e-business: an empirical study This study explores the readiness of enterprises for developing emerging e-business technology. A three-staged e-business technology roadmap is proposed, from pre-e-business, to transactional e-business, and then to on-demand e-business. We use the diffusion of innovation theory to identify a series of enterprises internal capabilities and environmental drivers that can explain enterprises e-business adoption along our proposed roadmap. The model is validated in a survey of 175 businesses from the Taiwanese PC industry. The results show that enterprises internal capabilities are more influential than the environmental drivers when the enterprises move from the pre-e-business stage to the transactional e-business stage. As enterprises start to migrate to on-demand e-business, environmental factors play a critical role in determining the adoption. The implications of this study are multi-fold. Enterprises can use this model to evaluate their current readiness for the adoption of emerging e-business technology. By locating their current status in the roadmap, they can also understand the steps they should take to improve their readiness.

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

e-business readiness
technology innovation and diffusion
on-demand business
e-commerce


Adaptive functional-link-based neural fuzzy controller design for a DC gear motor driver This paper proposes an adaptive functional-link-based neural fuzzy control (AFNFC) system based on complementary sliding-mode approach. The proposed AFNFC system is composed of a neural controller and a robust compensator. The neural controller uses a functional-link-based neural fuzzy system (FNFS) to approximate an ideal complementary sliding-mode controller, and the robust compensator is designed to eliminate the effect of the approximation error between a neural controller and an ideal complementary sliding-mode controller. Since the consequent part of the fuzzy rules in FNFS uses an orthogonal Hermite polynomial-based non-linear combination, the proposed FNFS can approximate an ideal complementary sliding-mode controller with good learning accuracy. Finally, to enhance the control performance of the proposed AFNFC system, a 32-bit 86-microprocessor is adopted for the implementation of the proposed control system. A comparison among the fuzzy sliding-mode control, the intelligent-complementary sliding-mode control, the supervisory fuzzy neural network control, and the proposed AFNFC system is made. The experimental results demonstrate that the proposed AFNFC system can achieve favorable tracking performance and robust with regard to parameter variations for a DC gear motor driver.

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

adaptive control
neural control
functional link


Geometric operations using sparse interpolation matrices The method applies to curves and (hyper) surfaces that may contain base point. We exploit sparseness of the parameterization and of the implicit equation. The interpolation matrix suffices for membership and sidedness predicates. Our Maple code implements exact as well as approximate computation.

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

matrix representation
implicitization
linear algebra
sparse polynomial
sidedness operation


a risk management capability model for use in medical device companies Medical device software is a risky business. Failure of the software can have potentially catastrophic effects, leading to injury of patients or even death. It is therefore no surprise that regulators throughout the world are penalising medical device manufacturers that do not demonstrate that sufficient attention is devoted to the areas of hazard analysis and risk management (RM) throughout the software lifecycle. If a medical device company fails to comply with the regulations of a given country, in effect they surrender their legal right to market their device in that country. With so much at stake, it is in everybody's best interest that the medical device manufacturer gets it right.However, with so many different standards, regulatory guidance papers and industry guides on RM, the task of collating this information into a usable model is itself daunting. This paper seeks to extract the important concepts from a number of industry accepted standards and guides, and present them as a generic usable model for the medical device software industry.

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

hazard analysis
risk management
medical device software

software process improvement
level of concern


Parkinson's Disease Prediction based on Multistate Markov Models In the real medical world, there are many symptoms or chronic diseases that cannot be characterized in a deterministic way, and which must be examined in a random way. In the study of these stochastic processes, Markov chains are used. There is a wide variety of phenomena that suggest a behavior in a Markov process manner such as: the probability that a patient's health to improve, to get worse, to remain stable or to progress to death within a certain time slot, depending on what happened in the previous time window. Our goal is to show that the Markov chains can be applied to the patients with Parkinson's disease in order to predict the evolution of the disease over time. So the doctor may decide a therapeutic solution that is adapted to the patient's needs, and that can improve the quality of the patient's life with Parkinson's disease in terminal stage.

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

markov chains
multistate markov models
prediction


On the adjustment problem for linear programs We propose a generalization of the inverse problem which we will call the adjustment problem. For an optimization problem with linear objective function and its restriction defined by a given subset of feasible solutions, the adjustment problem consists in finding the least costly perturbations of the original objective function coefficients, which guarantee that an optimal solution of the perturbed problem is also feasible for the considered restriction. We describe a method of solving the adjustment problem for continuous linear programming problems when variables in the restriction are required to be binary.

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

combinatorial optimization
inverse optimization


A formal theory for estimating defeaturing-induced engineering analysis errors Defeaturing is a popular CAD/CAE simplification technique that suppresses small or irrelevant features within a CAD model to speed-up downstream processes such as finite element analysis. Unfortunately, defeaturing inevitably leads to analysis errors that are not easily quantifiable within the current theoretical framework. In this paper, we provide a rigorous theory for swiftly computing such defeaturing-induced engineering analysis errors. In particular, we focus on problems where the features being suppressed are cutouts of arbitrary shape and size within the body. The proposed theory exploits the adjoint formulation of boundary value problems to arrive at strict bounds on defeaturing induced analysis errors. The theory is illustrated through numerical examples.

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


Complexity of implementing functions of k-valued logic by circuits and formulas in functionally complete bases ? Algorithmic problems are considered that are related to implementing bounded-deterministic functions by circuits and formulas of the minimum size in automaton bases. The problem of finding the asymptotics of the Shannon function is known to be algorithmically undecidable in the case of complete bases, but the coefficient in the formula for the Shannon function can be found with arbitrary accuracy. In the paper the so called strong algorithmic undecidability of the problem of finding the asymptotics of the Shannon function in the case of functionally complete bases is proved. A basis is called cf-equivalent if the constants in the asymptotic formulas for the Shannon function in the classes of circuits and formulas coincide. The existence of bases that are not cf-equivalent is proved in the case of functionally complete bases. It is proved that the recognition problem for the cf-equivalence of a basis is algorithmically undecidable in the strong sense.

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

algorithmic undecidability
shannon function
functionally complete bases


Efficient enumeration of all ladder lotteries and its application A ladder lottery, known as "Amidakuji" in Japan, is a common way to choose a permutation randomly. A ladder lottery L corresponding to a given permutation pi is optimal if L has the minimum number of horizontal lines among the ladder lotteries corresponding to pi. In this paper we show that for any two optimal ladder lotteries L(1) and L(2) of a permutation, there exists a sequence of local modifications which transforms L(1) into L(2). We also give an algorithm to enumerate all optimal ladder lotteries of a given permutation. By setting pi = (n, n - 1,..., 1), the algorithm enumerates all arrangements of n pseudolines efficiently. By implementing the algorithm we compute the number of arrangements of n pseudolines for each n <= 11. (C) 2010 Elsevier B.V. All rights reserved.

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

enumeration algorithm
family tree
pseudoline arrangement


approaches to object persistence in java projects This presentation discusses and demonstrates the advantages and limitations of a range of object persistence strategies for use in student projects.

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


Adaptive on-line similarity measure for direct visual tracking ? We present an adaptive metric for measuring the similarity of a target for the purpose of visual tracking. This metric assigns a robust weight to each matching error based on the error type. A histogram-based classifier is learned on-line to determine the error type. The proposed robust metric dynamically adapts to the actual appearance changes by tuning its parameters.

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

adaptive metric
similarity measure
visual tracking


Causal Bounds and Observable Constraints for Non-deterministic Models Conditional independence relations involving latent variables do not necessarily imply observable independences. They may imply inequality constraints on observable parameters and causal bounds, which can be used for falsification and identification. The literature on computing such constraints often involve a deterministic underlying data generating process in a counterfactual framework. If an analyst is ignorant of the nature of the underlying mechanisms then they may wish to use a model which allows the underlying mechanisms to be probabilistic. A method of computation for a weaker model without any determinism is given here and demonstrated for the instrumental variable model, though applicable to other models. The approach is based on the analysis of mappings with convex polytopes in a decision theoretic framework and can be implemented in readily available polyhedral computation software. Well known constraints and bounds are replicated in a probabilistic model and novel ones are computed for instrumental variable models without non-deterministic versions of the randomization, exclusion restriction and monotonicity assumptions respectively.

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

instrumental variables
instrumental inequality
convex polytope
directed acyclic graph


evaluation of dhts from the viewpoint of interpersonal communications This paper evaluates several O(log n) -hop DHT (Distributed Hash Table) algorithms' suitability for interpersonal communications. DHTs have been widely used for file sharing, but recent research and standardization efforts are exploring their use for interpersonal communication as well. We identify the desired features of DHTs from the viewpoint of interpersonal communications and evaluate several current DHTs with respect to these features.

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

distributed hash tables
peer-to-peer
p2psip


Efficient iterative solvers for structural dynamics problems Direct solvers are commonly used in implicit finite element codes for structural dynamics problems. This study explores an alternative approach to solving the resulting linear systems by using preconditioned iterative schemes such as the preconditioned conjugate gradient algorithm and its variants. Preconditioners used in this study include approximate Cholesky factorization, block Jacobi, and the symmetric GaussSeidel over-relaxation scheme. The effects of various preconditioners and ordering schemes on the solution time and required storage are investigated. Performance results of these iterative solver are compared against the MA57 direct solver routine of the commercial Harwell Software Library.

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

structural mechanics
finite element methods
iterative linear solvers
krylov subspace methods
incomplete cholesky factorization
sparse direct solvers


Provably secure timed-release public key encryption A timed- release cryptosystem allows a sender to encrypt a message so that only the intended recipient can read it only after a specified time. We formalize the concept of a secure timed- release public- key cryptosystem and show that, if a third party is relied upon to guarantee decryption after the specified date, this concept is equivalent to identity- based encryption; this explains the observation that all known constructions use identity- based encryption to achieve timed- release security. We then give several provably- secure constructions of timed- release encryption: a generic scheme based on any identity- based encryption scheme, and two more efficient schemes based on the existence of cryptographically admissible bilinear mappings. The first of these is essentially as efficient as the Boneh- Franklin Identity- Based encryption scheme, and is provably secure and authenticated in the random oracle model; the final scheme is not authenticated but is provably secure in the standard model ( i. e., without random oracles).

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

timed-release
authenticated encryption
key-insulated encryption


automatic pan control system for broadcasting ball games based on audience's face direction We propose an automatic pan control system for broadcasting ball games by tracking face direction of audience. Presuming that the audience's face is directed to a notable play, we can shoot a broadcasting video by controlling the camera toward the audience's face direction. In our method, a court sensor which detects rough region where players exist is used in addition to the face sensor in order to obtain higher accuracy. Based on these sensors, the broadcasting video is generated by cylindrical mosaicing off-line. We conducted objective and subjective evaluation experiments and the result shows that our approach is better than previously proposed methods in respect of stable tracking and easy watching. Conclusively our method is as effective as the optimum camerawork.

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

automatic shooting
cylindrical panoramas
template matching


Unsupervised segmentation of natural images via lossy data compression In this paper, we cast natural-image segmentation as a problem of clustering texture features as multivariate mixed data. We model the distribution of the texture features using a mixture of Gaussian distributions. Unlike most existing clustering methods, we allow the mixture components to be degenerate or nearly-degenerate. We contend that this assumption is particularly important for mid-level image segmentation, where degeneracy is typically introduced by using a common feature representation for different textures in an image. We show that such a mixture distribution can be effectively segmented by a simple agglomerative clustering algorithm derived from a lossy data compression approach. Using either 2D texture filter banks or simple fixed-size windows to obtain texture features, the algorithm effectively segments an image by minimizing the overall coding length of the feature vectors. We conduct comprehensive experiments to measure the performance of the algorithm in terms of visual evaluation and a variety of quantitative indices for image segmentation. The algorithm compares favorably against other well-known image-segmentation methods on the Berkeley image database.

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

image segmentation
mixture of gaussian distributions
clustering


Development of correlation-based clustering method and its application to software sensing The individuality of production devices should be taken into account when soft-sensors are designed for parallelized devices. Since it is expressed as differences of the correlation among measured variables, it is useful to cluster samples on the basis of the correlation among variables for adopting a multi-model approach. In addition, changes in process characteristics can be coped with in the same way. In the present work, a new clustering method, referred to as NC-spectral clustering, is proposed by integrating the nearest correlation (NC) method and spectral clustering. Spectral clustering is a graph partitioning method that can be used for sample classification when an affinity matrix of a weighted graph is given. The NC method can detect samples that are similar to the query from the viewpoint of the correlation without a teacher signal. In the proposed method, the NC method is used for constructing the weighted graph that expresses the correlation-based similarities between samples and the constructed graph is partitioned by using spectral clustering. In addition, a new soft-sensor design method is proposed on the basis of the proposed NC-spectral clustering. The usefulness of the proposed methods is demonstrated through a numerical example and a case study of parallelized batch processes. The performance of the proposed correlation-based method is better than that of the conventional distance-based methods. (C) 2010 Elsevier B.V. All rights reserved.

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

nearest correlation method
soft-sensor
batch process
graph theory


automatic scenario detection for improved wcet estimation Modern embedded applications usually have real-time constraints and they are implemented using heterogeneous multiprocessor systems-on-chip. Dimensioning a system requires accurate estimations of the worst-case execution time (WCET). Overestimation leads to over-dimensioning. This paper introduces a method for automatic discovery of scenarios that incorporate correlations between different parts of applications. It is based on the application parameters with a large impact on the execution time. We show on a benchmark that, using scenarios, the estimated WCET may be reduced with 16\%.

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


A classical linear lambda-calculus This paper proposes and studies a particular typed lambda-calculus for classical linear logic. I shall give an explanation of a natural deduction formulation of classical logic due to Parigot and compare it to more traditional treatments by Prawitz and others. I shall use Parigot's method to devise a natural deduction formulation of classical linear logic. This formulation is compared in detail to the sequent calculus formulation. (C) 1999 Elsevier Science B.V. All rights reserved.

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

lambda-calculus
type systems
proof theory