Finite element vertical slices model: Validation and application to an embedded square footing under combined loading This paper describes an efficient formulation for the analysis of three-dimensional (3-D) soil/structure interaction problems. The technique which is called vertical slices model (VSM) subdivides the structure and the surrounding soil into vertical slices. It takes profit of finite element 2-D numerical solutions in plane stress for building approximate 3-D solutions by replacing the inter-slice interactions by fictitious body forces. The 2-D finite element and finite difference methods are combined in a relatively simple and compact procedure, and applied iteratively to each vertical slice. The 3-D aspect of the considered problem is kept by satisfying the continuity of shear stresses developed at the inter-slices. First, the theory of the vertical slices model is presented and then a Fortran computer program is elaborated. Next, the capabilities of this program are illustrated by applying the approach to the problems of both laterally and axially loaded piles founded in both homogeneous and non-homogeneous soils. A third problem of a rigid rectangular foundation resting on top of a homogeneous elastic stratum has also been investigated. Comparisons with other numerical solutions show good agreement and consequently they prove that the model is successfully able to capture the behavior of the three boundary value problems. Finally, in terms of stiffness factors the method is used to predict the behavior of an embedded square footing under combined loading, in a half-space where the stiffness exhibits a power-law variation with depth.

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

finite element method
finite difference method
iterative analysis


An s s t t connection problem with adaptability We study a new two-stage version of an s s t t path problem, which we call adaptable robust connection path (ARCP) . Given an undirected graph G=(V,E) G = ( V , E ) , two vertices s,t?V s , t ? V and two integers f,r?Z+ f , r ? Z + , ARCP asks to find a set S?E S ? E of minimum cardinality which connects s s and t t , such that for any failure set F?E F ? E with |F|?f | F | ? f , the set of edges S?F S ? F can be completed to a set which connects s s and t t by adding at most r r edges from E?F E ? F . We show the problem is NP-hard, and there is no polynomial-time ? ? -approximation algorithm for the problem for ?<2 ? < 2 unless P=NP. For f=r=1 f = r = 1 we provide an exact polynomial algorithm, and for f=1 f = 1 and arbitrary r r we provide a polynomial 2-approximation algorithm. A characterization of the feasible set is provided for f=1 f = 1 and several links are established between ARCP and other combinatorial optimization problems, including a new combinatorial optimization problem, the minimum reduced cost cycle problem whose complexity is open.

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

s s t t connectivity s s s s s t t t t t


S-adapted Equilibria in Games Played Over Event Trees with Coupled Constraints This article deals with the general theory of games played over uncontrolled event trees, i.e., games where the transition from one node to another is natures decision and cannot be influenced by the players actions. The solution concept for this class of games was introduced under the name of S-adapted equilibrium, where S stands for sample of realizations of the random process. In this paper, it is assumed that the players also face a coupled constraint at each node, and therefore the relevant solution concept is the normalized equilibrium la Rosen. Existence and uniqueness conditions for this equilibrium are provided, as well as a stochastic-control formulation of the game and a maximum principle. A simple illustrative example in environmental economics is presented.

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

normalized equilibrium
coupled constraint

dynamic games
event tree
pollution control


Correlation between parameter sensitivity and counter-intuitive phenomenon of elastic-plastic beam dynamics Method of parameter sensitivity is applied to study the counter-intuitive phenomenon observed in numerical, analytical and experimental studies on the dynamic response of elastic-plastic beams. Direct differentiation approach and central difference approach are used in parameter sensitivity analysis. It is shown that the direct differentiation approach is more suitable for extremely parameter-sensitive problems. A correlation between the parameter sensitivity analysis and the occurrence of the counter-intuitive phenomenon of beam dynamics is established, which is then used to identify the range of the loading parameters for the occurrence of the counter-intuitive phenomenon. (c) 2005 Elsevier Ltd. All rights reserved.

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


Communication set generations with CSD calculus and expression-rewriting framework ? In this paper, we present a new framework based on expression-rewritings and a calculus form called common-stride descriptor (CSD) calculus to generate the local enumeration set and communication set for High Performance Fortran (HPF) programs with Block-Cyclic distributions. Our framework is a practical software framework, and can handle the general cases so that the communication set of HPF programs of block-cyclic distributions with two-level alignments (or multiple-level alignments), multi-dimensional arrays, array intrinsic functions (such as Transpose operation), and affine indices and axis exchanges in the array subscript, can be calculated in a systematic way with a sound software foundation. Previously, existing works do not report a software framework to solve a problem with such general cases. In addition, our expression-rewriting framework is based on a new representative form, CSD, to describe the regularity of the access patterns of HPF programs with block-cyclic distribution. We also demonstrate a calculus of CSD that CSD is closed under intersection and normalization, which helps the process of calculating local enumeration and communication sets of HPF programs with block-cyclic distributions. We also utilize the characteristics of CSD calculus to provide a global-to-local mapping function for multiple level alignments and block-cyclic distributions. Experimental results show that our software scheme not only can be easily implemented in the practice, but also is with good efficiency

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

hpf compiler
distributed memory machines
compiler optimization
parallelizing compiler
block-cyclic distributions


A novel fault detection method for VSC-HVDC transmission system of offshore wind farm A novel and reliable method to detect faults in VSC-HVDC transmission system. The method uses signals obtained from cable sheath to analyze system conditions. The method is capable of detecting different DC faults and AC faults nearby.

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

fault detection
offshore wind farm
cable sheath


Development of an auxiliary system for the execution of vascular catheter interventions with a reduced radiological risk; system description and first experimental results Vascular catheterization is a common procedure in clinical medicine. It is normally performed by a specialist using an X-ray fluoroscopic guide and contrast-media. In the present paper, an image-guided navigation system which indicates a path providing guidance to the desired target inside the vascular tree is described with the aim of reducing the exposure of personnel and patients to X-rays during the catheterization procedure. A 3D model of the patient vascular tree, reconstructed with data collected by an angiography before starting the intervention, is used as a guide map instead of fluoroscopic scans. An accurate spatial correspondence between the body of the patient and the 3D reconstructed vascular model is established and, by means of a position indicator installed over the catheter tip, the real-time position/orientation of the tip is indicated correctly. This paper describes the system and the operational procedures necessary to use the proposed method efficiently during a catheter intervention. Preliminary experimental results on a phantom are also reported.

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

vascular catheterization
position indicator
angiography

model reconstruction
3d representation
x-ray reduction


building analytical models into an interactive performance prediction tool In this paper we describe an interactive tool designed for performance prediction of parallel programs. Static performance prediction, in general, is a very difficult task. In order to avoid some inherent problems, we concentrate on reasonably structured scientific programs. Our prediction system, which is built as a sub-system of a larger interactive environment, uses a parser, dependence analyzer, database and an X-window based front end in analyzing programs. The system provides the user with execution times of different sections of programs. When there are unknowns involved, such as number of processors or unknown loop bounds, the output is an algebraic expression in terms of these variables. We propose a simple analytical model as an attempt to predict performance degradation due to data references in hierarchical memory systems. The predicted execution times of some Lawrence Livermore loop kernels are given together with the experimental values obtained by executing the loops on Alliant FX/8.

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

task order parser performance tool general paper model user predict systems values data database

analytic models
memory system
express
interaction
processor
program
variability
hierarchic
dependencies
structure
experimentation
parallel programming
kernel
windows
interaction environment
performance prediction


PTAS for routing-cost constrained minimum connected dominating set in growth bounded graphs Connected dominating set (CDS) has played an important role in building virtual backbone, which is used on unicast, multicast, and fault-tolerant routing in wireless sensor networks. In order to reduce traffic congestion and communication delay, a routing-cost constrained minimum CDS (ROCCDS) has been studied extensively in the literature. In this paper, we present a PTAS for \(\alpha \) ROCCDS where \(\alpha \ge 5\), that is, there exists a polynomial-time \((1+\varepsilon )\)-approximation for minimum CDS under constraint that for every pair of nodes u and v, \(m_{CDS}(u,v) \le m(u,v)\) where \(m(u,v)\) denotes the number of intermediate nodes in the shortest path between u and v, and \(m_{CDS}(u,v)\) denotes the number of intermediate nodes of the shortest path between u and v through CDS produced by the approximation algorithm.

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

growth bounded graphs
minimum connected dominating set


On the stationary distribution of queue lengths in a multi-class priority queueing system with customer transfers This paper deals with a multi-class priority queueing system with customer transfers that occur only from lower priority queues to higher priority queues. Conditions for the queueing system to be stable/unstable are obtained. An auxiliary queueing system is introduced, for which an explicit product-form solution is found for the stationary distribution of queue lengths. Sample path relationships between the queue lengths in the original queueing system and the auxiliary queueing system are obtained, which lead to bounds on the stationary distribution of the queue lengths in the original queueing system. Using matrix-analytic methods, it is shown that the tail asymptotics of the stationary distribution is exact geometric, if the queue with the highest priority is overloaded.

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

priority queueing system
tail asymptotics

matrix-analytic methods
sample path relationship


A fuzzy classifier approach to estimating software quality With the increasing sophistication of todays software systems, it is often difficult to estimate the overall quality of underlying software components with respect to attributes such as complexity, utility, and extensibility. Many metrics exist in the software engineering literature that attempt to quantify, with varying levels of accuracy, a large swath of qualitative attributes. However, the overall quality of a software object may manifest itself in ways that the simple interpretation of metrics fails to identify. A better strategy is to determine the best, possibly non-linear, subset of many software metrics for accurately estimating software quality. This strategy may be couched in terms of a problem of classification, that is, determine a mapping from a set of software metrics to a set of class labels representing software quality. We implement this strategy using a fuzzy classification approach. The software metrics are automatically computed and presented as features (input) to a classifier, while the class labels (output) are assigned via an experts (software architect) thorough assessment of the quality of individual software objects. A large collection of classifiers is presented with subsets of the software metric features. Subsets are selected stochastically using a fuzzy logic based sampling method. The classifiers then predict the quality, specifically the class label, of each software object. Fuzzy integration is applied to the results from the most accurate individual classifiers. We empirically evaluate this approach using software objects from a sophisticated algorithm development framework used to develop biomedical data analysis systems. We demonstrate that the sampling method attenuates the effects of confounding features, and the aggregated classification results using fuzzy integration are superior to the predictions from the respective best individual classifiers.

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

fuzzy logic
software metric
software engineering

computational intelligence
pattern classification


signal to noise ratio of information in documentation The signal to noise ratio is a common concept in radio communications and electronic communication in general. For a radio, the static is the noise. Too much static and the storm report gets drowned out, or at least you must listen closely to understand the announcer. Unfortunately, information designers do not posses a clear cut set of techniques available to electrical engineers. For information systems, taking the raw data in a system and deciding what is signal and what is noise proves to be extremely difficult. This paper will examine how the concept of signal to noise ratio can be applied to documentation. It will consider how the need to address different tasks and audience forces compromises on the writer to meet those different needs, when each audience has different definitions of which information constitutes signal and which constitutes noise.

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


empirical justification of the gain and discount function for ndcg The nDCG measure has proven to be a popular measure of retrieval effectiveness utilizing graded relevance judgments. However, a number of different instantiations of nDCG exist, depending on the arbitrary definition of the gain and discount functions used (1) to dictate the relative value of documents of different relevance grades and (2) to weight the importance of gain values at different ranks, respectively. In this work we discuss how to empirically derive a gain and discount function that optimizes the efficiency or stability of nDCG. First, we describe a variance decomposition analysis framework and an optimization procedure utilized to find the efficiency- or stability-optimal gain and discount functions. Then we use TREC data sets to compare the optimal gain and discount functions to the ones that have appeared in the IR literature with respect to (a) the efficiency of the evaluation, (b) the induced ranking of systems, and (c) the discriminative power of the resulting nDCG measure.

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

value framework ndcg use efficiency analysis definition relevance decomposition stability systems evaluation values retrieval proven data power ranking

measurement
generalizability theory
optimality
functional
relation
documentation
effect
information retrieval


Performance analysis of dual automatic censoring and detection in heterogeneous Weibull clutter: A comparison through extensive simulations Non-stationary Weibull background. No prior knowledge about the Weibull parameters distribution. Dual automatic censoring and detection with constant false censoring and alarm rates. Logarithmic amplifier and best linear unbiased distribution parameters estimators. Comparison through extensive Monte Carlo simulations.

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

dual automatic censoring
weibull clutter

fixed-point(s) censoring
linear biparametric adaptive threshold
blu estimators
cfcar detection
gumbel distribution


Two-dimensional shape identification for the unsteady conduction problem A transient heat conduction problem within an anisotropic: domain is formulated. The variation of an arbitrary behavioural functional corresponding to the infinitesimal variation of structural domain is considered. The first-order sensitivity is presented using the material derivative concept and both direct and adjoint approaches. The results obtained are particularized for the specific form of the identification functional defined in the form of "distance" between temperature of the identified body and the measured temperature of the real structure. Stationarity conditions are derived. Numerical examples of internal boundary identification are presented.

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

shape identification
unsteady conduction problem


A Geometric Interpretation of Fading in Wireless Networks: Theory and Applications In wireless networks with random node distribution, the underlying point process model and the channel fading process are usually considered separately. A unified framework is introduced that permits the geometric characterization of fading by incorporating the fading process into the point process model. Concretely, assuming nodes are distributed in a stationary Poisson point process in R(d), the properties of the point processes that describe the path loss with fading are analyzed. The main applications are single-hop connectivity and broadcasting.

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

broadcasting
connectivity
fading
point process
wireless networks


AUG-Segmenter: a user-friendly tool for segmentation of long time series In this study, three algorithms are presented for time series segmentation. The first algorithm is based on the branch-and-bound approach, the second on the dynamic programming while the third is a modified version of the latter into which the remaining cost concept of the former is introduced. A user-friendly computer program called AUG-Segmenter is developed. Segmentation-by-constant and segmentation-by-linear-regression can be performed by the program. The program is tested on real-world time series of thousands of terms and found useful in performing segmentation satisfactorily and fast.

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

dynamic programming
remaining cost
segmentation
time series


Polynomial and APX-hard cases of the individual haplotyping problem SNP haplotyping problems have been the subject of extensive research in the last few years, and are one of the hottest areas of Computational Biology today. In this paper we report on our work of the last two years, whose preliminary results were presented at the European Symposium on Algorithms (Proceedings of the Annual European Symposium on Algorithms (ESA), Vol. 2161. Lecture Notes in Computer Science, Springer, 2001, pp. 182-193.) and Workshop on Algorithms in Bioinformatics (Proceedings of the Annual Workshop on Algorithms in Bioinformatics (WABI), Vol. 2452. Lecture Notes in Computer Science, Springer, 2002, pp. 29-43.). We address the problem of reconstructing two haplotypes for an individual from fragment assembly data. This problem will be called the Single Individual Haplotyping Problem. On the positive side, we prove that the problem can be solved effectively for gapless data, and give practical, dynamic programming algorithms for its solution. On the negative side, we show that it is unlikely that polynomial algorithms exist, even to approximate the solution arbitrarily well, when the data contain gaps. We remark that both the gapless and gapped data arise in different real-life applications. (c) 2005 Elsevier B.V. All rights reserved.

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


Scale-separating operators for variational multiscale large eddy simulation of turbulent flows A general class of scale-separating operators based on combined multigrid operators is proposed and analyzed in this work. The operators of this class are designed for variational multiscale large eddy simulation using a finite volume or finite element method. Two representatives are compared to discrete smooth filters, which are widely used in the traditional large eddy simulation literature; the comparison shows that they are not only theoretically different, but also yield considerable differences in the respective numerical results. Dynamic as well as constant-coefficient-based subgrid-scale modeling is used within the multiscale environment. All of the scale-separating operators are implemented in a second-order accurate energy-conserving finite volume method and tested for the case of a turbulent channel flow. One operator shows particularly remarkable results in the framework of the variational multiscale large eddy simulation, that is, profiles are obtained for velocity and kinetic energy which are considerably closer to the respective profiles from a direct numerical simulation than are the profiles resulting from the application of the other operators considered in the present study. Furthermore, this particular operator proves to be very efficient with regard to the important aspect of computational cost, that is, a reduction in computing time ranging from about 25% up to about 150% compared to the other operators. The introduction of a substantial amount of subgrid viscosity to the small scales, particularly in the buffer layer of the channel, appears to be crucial for the good results achieved with this method.

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

turbulence
variational multiscale method
scale separation
subgrid-scale modeling


A Logic Framework for Incremental Learning of Process Models Standardized processes are important for correctly carrying out activities in an organization. Often the procedures they describe are already in operation, and the need is to understand and formalize them in a model that can support their analysis, replication and enforcement. Manually building these models is complex, costly and error-prone. Hence, the interest in automatically learning them from examples of actual procedures. Desirable options are incrementality in learning and adapting the models, and the ability to express triggers and conditions on the tasks that make up the workflow. This paper proposes a framework based on First-Order Logic that solves many shortcomings of previous approaches to this problem in the literature, allowing to deal with complex domains in a powerful and flexible way. Indeed, First-Order Logic provides a single, comprehensive and expressive representation and manipulation environment for supporting all of the above requirements. A purposely devised experimental evaluation confirms the effectiveness and efficiency of the proposed solution.

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


a time-and-value centric provenance model and architecture for medical event streams Provenance becomes a critical requirement for healthcare IT infrastructures, especially when pervasive biomedical sensors act as a source of raw medical streams for large-scale, automated clinical decision support systems. Medical and legal requirements will make it obligatory for such systems to answer queries regarding the underlying data samples from which output alerts are derived, the IDs of the processing components used and the privileges of the individuals and software components accessing the medical data. Unfortunately, existing models of either annotation or process based provenance are designed for transaction-oriented systems and do not satisfy the unique requirements for systems processing high-volume, continuous medical streams. This paper proposes a simple, but useful, hybrid provenance model called Time-Value Centric (TVC) provenance.

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


Prototyping electronic commerce systems using Esterel In this article I present the advantages of using the synchronous programming language Esterel to prototype electronic commerce systems. I first outline a technique to model HTML tags, which is then specialized to document types. A simple example illustrates the coding ideas for both the static and dynamic aspects of behavior. This is then extended to handle certain other features found in electronic commerce systems. I also show how the Esterel environment can be used to formally verify certain properties.

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

program simulator
automatic verification


Mining moving patterns for predicting next location We propose three models (PMM, GMM and RMM) and combine them in different ways to obtain new models to predict the next location of a moving object. GMM uses all available trajectories to discover collective patterns; PMM models the individual patterns of each moving object using its own past trajectories; RMM clusters the trajectories to mine the movement patterns. Based on the observation that the movement patterns often change over time, we propose methods that can capture the relationships between the patterns in different time periods, and use this knowledge to build more refined models. To the best of our knowledge, the proposed models are the first ones that take a holistic approach and consider individual, collective movement patterns and the similarity between trajectories in making prediction. We conduct extensive experiments using a real dataset and the results demonstrate the effectiveness of the proposed models.

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

moving patterns mining
next location prediction
time factor


Application portfolio management: a decision-oriented view of enterprise architecture Today large companies operate 100s of computer-based information systems (IS), also called applications, to support their businesses. Enterprise Architecture (EA) is regarded as a promising concept to cope with the complexity caused by large application portfolios (AP). This article focuses on senior IT managers decision-making with regard to their AP, and EAs role therein. Through multiple case studies in large companies, we found that these managers consider and balance a set of aspects, each of which is supported by partial EA models maintained by specific groups within their IT departments. These models are, however, not sufficiently integrated. Based on the empirical findings, we propose indicators for each of the partial EA models to aggregate the AP-relevant characteristics per application, which are then integrated into an AP dashboard to support senior IT managers holistic AP management. Consequently, a decision-oriented view is created of the overall EA, which the managers of the case studies companies deemed to be very helpful for steering their AP.

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

enterprise architecture
application portfolio management

chief information officer
it department
information capital readiness


The EOQ repair and waste disposal model with switching costs This paper addresses the problem of determining the optimal batch sizes for production and recovery in an EOQ (economic order/production quantity) repair and waste disposal model context. This paper assumes that a first shop is manufacturing new products as well as repairing products used by a second shop. The used products can either be stored in the second shop and then be brought back to the first shop in an approach used to reduce inventory costs, or be disposed outside the system. The works available in the literature assumed a general time interval and ignored the very first time interval where no repair runs are performed. This assumption resulted in an over estimation of the average inventory level and subsequently the holding cost. These works also have not accounted for switching costs when alternating between production and recovery runs, which are common when switching among products or jobs in a manufacturing facility. This paper addresses these two limitations. Mathematical models are developed with numerical examples presented and results discussed. (C) 2008 Elsevier Ltd. All rights reserved.

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

eoq model
production/recovery
reuse
switching cost


Using time topic modeling for semantics-based dynamic research interest finding Researchers interests finding has been an active area of investigation for different recommendation tasks. Previous approaches for finding researchers interests exploit writing styles and links connectivity by considering time of documents, while semantics-based intrinsic structure of words is ignored. Consequently, a topic model named Author-Topic model is proposed, which exploits semantics-based intrinsic structure of words present between the authors of research papers. It ignores simultaneous modeling of time factor which results in exchangeability of topics problem, which is, important factor to deal with when finding dynamic research interests. For example, in many real world applications, like finding reviewers for papers and finding taggers in the social tagging systems one needs to consider different time periods. In this paper, we present time topic modeling approach named Temporal-Author-Topic (TAT) which can simultaneously model text, researchers and time of research papers to overcome the exchangeability of topic problem. The mixture distribution over topics is influenced by both co-occurrences of words and timestamps of the research papers. Consequently, topics occurrence and their related researchers change over time, while the meaning of particular topic almost remains unchanged. Proposed approach is used to discover topically related researchers for different time periods. We also show how their interests and relationships change over a time period. Empirical results on large research papers corpus show the effectiveness of our proposed approach and dominance over Author-Topic (AT) model, by handling the exchangeability of topics problem, which enables it to obtain similar meaning of a particular topic overtime.

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

dynamic research interests
exchangeability of topics
time topic modeling

social networks
unsupervised machine learning


automating discovery of software tuning parameters Software Tuning Panels for Autonomic Control (STAC) is a project to assist in the integration of existing software into autonomic frameworks. It works by identifying tuning parameters and rearchitecting to expose them as a separate control panel module. The project poses three distinct research challenges: automating the identification of tuning parameters, rearchitecting to centralize and expose them, and combining these two capabilities to facilitate the integration of existing software into autonomic frameworks. Our previous work focused on the second problem, automating the rearchitecture to expose and isolate tuning parameters. In this paper we concentrate on the first problem, automating the identification of tuning parameters. We begin with an empirical study of documented tuning parameters in a number of open source applications. From our observations of these known tuning parameters, we create a catalogue of different kinds and organize them into a taxonomy. Finally, we characterize a member of the taxonomy as a source code pattern that is used to find similar tuning parameters. We report our experience in applying this methodology in the context of a large, open source Java system.

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

static analysis
autonomic computing
tuning parameter
design recovery


A Recombinant Fragment of Human Surfactant Protein D Reduces Alveolar Macrophage Apoptosis and Pro-Inflammatory Cytokines in Mice Developing Pulmonary Emphysema Rapid removal of apoptotic cells is an important mechanism for immune homeostasis and the resolution of inflammation. Delayed clearance of apoptotic alveolar macrophages may cause activation of healthy bystander macrophages and contribute to high macrophage number and emphysema in surfactant protein D (SP-D) knock-out mice. Using flow cytometry and Annexin V and propidium iodide as markers for apoptosis and necrosis, respectively, SP-D-deficient mice were found to have a 5- to 10-fold increase in the number of apoptotic and necrotic alveolar macrophages in the lungs. SP-D-deficient mice accumulate apoptotic macrophages in the lung, and this accumulation can be reduced by treatment with recombinant SP-D (but not SP-A). The recombinant SP-D binds preferentially to apoptotic cells. The data are consistent with a specific role in vivo for SP-D in promoting apoptotic cell clearance in the lungs to limit macrophage-mediated inflammation and reveal a potential new mechanism for therapeutic targeting in the prevention of emphysema.

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


Evaluating a robust contour tracker on echocardiographic sequences In this paper we present an evaluation of a robust visual image tracker on echocardiographic image sequences. We show how the tracking framework can be customized to define an appropriate shape space that describes heart shape deformations that can be learnt from a training data set. We also investigate energy-based temporal boundary enhancement methods to improve image feature measurement. Results are presented demonstrating real-time tracking on real normal heart motion data sequences and abnormal synthesized and real heart motion data sequences. We conclude by discussing some of our current research efforts.

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

2-d+t ultrasound
echocardiography
energy filters
heart wall motion
real-time tracking


ON THE ISSUE OF DEFUZZIFICATION AND SELECTION BASED ON A FUZZY SET We are concerned with the problem of selecting a crisp element based on information provided by a fuzzy set, a problem which manifests itself in the defuzzification step in fuzzy logic controllers. We provide a unifying approach to this selection process. Among other characteristics this unification puts the defuzzification methods of mean of maxima and center of gravity in the same framework. We show that this selection can be viewed as a three step operation: transformation of the decision fuzzy set; normalization to probability distribution; selection based on the probability distribution. A number of different procedures for selection are discussed.

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


Measures of similarity between qualitative descriptions of shape, colour and size applied to mosaic assembling A computational approach for obtaining a similarity measure between qualitative descriptions of shape, colour and size of objects within digital images is presented. According to the definition of the qualitative features, the similarity values determined are based on conceptual neighbourhood diagrams or interval distances. An approximate matching algorithm between object descriptions is defined and applied to tile mosaic assembling and results of previous approaches are improved.

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

qualitative shape
qualitative colour
qualitative size
conceptual neighbourhood diagram
interval distance
trencads


Visual correction for mobile robot homing We present a method to send a mobile robot to locations specified by images previously taken from these positions, which sometimes has been referred as homing. Classically this has been carried out using the fundamental matrix, but the fundamental matrix is ill conditioned with planar scenes, which are quite usual in man made environments. Many times in robot homing, small baseline images with high disparity due to rotation are compared, where the fundamental matrix also gives bad results. We use a monocular vision system and we compute motion through an homography obtained from automatically matched lines. In this work we compare the use of the homography and the fundamental matrix and we propose the correction of motion directly from the parameters of the 2D homography, which only needs one calibration parameter. It is shown that it is robust, sufficiently accurate and simple.

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

mobile robots
lines and homographies
teaching by doing


MULTIPLE RELEASES OF k-ANONYMOUS DATA SETS AND k-ANONYMOUS RELATIONAL DATABASES In data privacy, the evaluation of the disclosure risk has to take into account the fact that several releases of the same or similar information about a population are common. In this paper we discuss this issue within the scope of k-anonymity. We also show how this issue is related to the publication of privacy protected databases that consist of linked tables. We present algorithms for the implementation of k-anonymity for this type of data.

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


Distance paired-domination problems on subclasses of chordal graphs Let G = (V, E) be a graph without isolated vertices. For a positive integer k, a set S subset of V is a k-distance paired-dominating set if each vertex in V - S is within distance k of a vertex in S and the subgraph induced by S contains a perfect matching. In this paper, we present two linear time algorithms to find a minimum cardinality k-distance paired-dominating set in interval graphs and block graphs, which are two subclasses of chordal graphs. In addition, we present a characterization of trees with unique minimum k-distance paired-dominating set. (C) 2009 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 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

algorithm
paired-domination
k-distance domination
interval graph


Matlab software for inversion of describing functions New Matlab functions for inversion of describing function models are developed. These functions are based on a newly developed computer-aided procedure. The procedure starts by guessing the initial values for the independent variables of an assumed nonlinear function. Then, the describing function model of the nonlinearity is numerically generated. This is followed by minimizing an objective function that yields the desired parameters of the nonlinear function. Such software has applications in synthesizing nonlinear gains of a controller. The printout of the software is given, and three demonstration problems are presented.

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

static nonlinearities
memory nonlinearities
nonlinear controllers
optimization


A hybrid modified PSO approach to VaR-based facility location problems with variable capacity in fuzzy random uncertainty This paper studies a facility location model with fuzzy random parameters and its swarm intelligence approach. A Value-at-Risk (VaR) based fuzzy random facility location model (VaR-FRFLM) is built in which both the costs and demands are assumed to be fuzzy random variables, and the capacity of each facility is unfixed but a decision variable assuming continuous values. Under this setting, the VaR-FRFLM is inherently a two-stage mixed 01 integer fuzzy random programming problem, to which analytical nonlinear programming methods are not applicable. A hybrid modified particle swarm optimization (MPSO) approach is proposed to solve the VaR-FRFLM. In this hybrid mechanism, an approximation algorithm is utilized to compute the fuzzy random VaR objective, a continuous NbestGbest-based PSO and a genotypephenotype-based binary PSO vehicles are designed to deal with the continuous capacity decisions and the binary location decisions, respectively, and two mutation operators are incorporated into the PSO to further decrease the possibility of becoming trapped in the local optima. A numerical experiment illustrates the application of the proposed hybrid MPSO algorithm and lays out its robustness to the system parameter settings. The comparison shows that the hybrid MPSO exhibits better performance than that when hybrid regular continuous-binary PSO and genetic algorithm (GA) are used to solve the VaR-FRFLM.

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


An LMI approach for exponential synchronization of switched stochastic competitive neural networks with mixed delays This paper investigates the problem of exponential synchronization of switched stochastic competitive neural networks (SSCNNs) with both interval time-varying delays and distributed delays. The distributed delays can be unbounded or bounded; the stochastic perturbation is of the form of multi-dimensional Brownian motion, and the networks are governed by switching signals with average dwell time. Based on new multiple Lyapunov-Krasovkii functionals, the free-weighting matrix method, Newton-Leibniz formulation, as well as the invariance principle of stochastic differential equations, two sufficient conditions ensuring the exponential synchronization of drive-response SSCNNs are developed. The provided conditions are expressed in terms of linear matrix inequalities, which are dependent on not only both lower and upper bounds of the interval time-varying delays but also delay kernel of unbounded distributed delays or upper bounds for bounded distributed delays. Control gains and average dwell time restricted by given conditions are designed such that they are applicable in practice. Numerical simulations are given to show the effectiveness of the theoretical results.

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

competitive neural networks
exponential synchronization
lmi

switched systems
unbounded distributed delay
vector-form noise


Intra Prediction for the Hardware H.264/AVC High Profile Encoder The hardware implementation of the intra prediction described in this paper allows the H.264/AVC encoder to achieve optimal compression efficiency in real-time conditions. The architecture has some features that distinguish it from other solutions described in literature. Firstly, the architecture supports all intra prediction modes defined in High Profile of the H.264/AVC standard for all chroma formats. Secondly, the architecture can generate predictions for several quantization parameters. Thirdly, the hardware cost is reduced as the same resources are used to compute prediction samples for all the modes. Fourthly, the high sample-generation rate enables the encoder to achieve high throughputs. Fifthly, 4??4 block reordering and interleaving with other modes minimize the impact of the long-delay reconstruction loop on the encoder throughput. The architecture is verified against the JM.12 reference model and within the real-time FPGA hardware encoder. The synthesis results show that the design can operate at 100MHz and 200MHz for FPGA Aria II and 0.13?m TSMC technology, respectively. These frequencies allow the encoder to support 720p and 1080p video at 30 fps.

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

video coding
h.264/avc
very large-scale integration (vlsi)


Fast electron resist contrast determination by fitting before measurement approach A new method for fast electron resist contrast definition is presented. It can be characterized as fitting before measurement method. Exposure and development of a specially designed test structure allows the resist contrast to be determined by using only an optical microscope. This makes the contrast definition procedure simpler and faster. Typically, the design, exposure, development and contrast selection take 30min.

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


Standard Sturmian words and automata minimization algorithms ? The study of some close connections between the combinatorial properties of words and the performance of the automata minimization process constitutes the main focus of this paper. These relationships have been, in fact, the basis of the study of the tightness and the extremal cases of Hopcroft's algorithm, that is, up to now, the most efficient minimization method for deterministic finite state automata. Recently, increasing attention has been paid to another minimization method that, unlike the approach proposed by Hopcroft, is not based on refinement of the set of states of the automaton, but on automata operations such as determinization and reverse, and is also applicable to non-deterministic finite automata. However, even for deterministic automata, it was proved that the method incurs, almost surely, in an explosion of the number of the states. Very recently, some polynomial variants of Brzozowski's method have been introduced. In this paper, by using some combinatorial properties of words, we analyze the performance of one of such algorithms when applied to a particular infinite family of automata, called standard word automata , constructed by using standard sturmian words. In particular, ?(nlog?n) ? ( n log ? n ) is the worst case time complexity when the algorithm is applied to the infinite family of word automata associated to Fibonacci words representing also the worst case of Hopcroft's minimization algorithm.

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

standard sturmian words
automata minimization


Highly corrosion resistant bright silver metallization deposited from a neutral cyanide-free solution In this paper, we describe a new method for preparing the high-quality silver films that can be used for packaging level interconnects. Silver has excellent optical and electrical properties but its application in microelectronics is compromised due to its tendency to sulfide corrosion. Another problem is hazardous cyanide electrolytes/bath technology that has to be improved. We present bright silver films obtained by electrodeposition from near to neutral non cyanide solution. High corrosion resistance was achieved by Ag protection with organic SAMs. The SAM protection power was quantified by comparison of para-amino phenol (PAP) peak current decrease in Cyclic Voltammetry (CV) and the Electron (charge) Transfer Resistance (CTR) increase from Electrochemical Impedance Spectroscopy (EIS). The accelerated tarnishing tests in H2S atmosphere well support the electrochemical test results.

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

silver electrodeposition
self-assembled monolayers
corrosion protection
sam characterization


Understanding changes in belief and attitude toward information technology usage: A theoretical model and longitudinal test User beliefs and attitudes are key perceptions driving information technology usage. These perceptions, however, may change with time as users gain first-hand experience with IT usage, which, in turn, may change their subsequent IT usage behavior. This paper elaborates how users' beliefs and attitudes change during the course of their IT usage, defines emergent constructs driving such change, and proposes a temporal model of belief and attitude change by drawing on expectation-disconfirmation theory and the extant IT usage literature. Student data from two longitudinal studies in end-user computing (computer-based training system usage) and system development (rapid application development software usage) contexts provided empirical support for the hypothesized model, demonstrated its generalizability across technologies and usage contexts, and allowed us to probe context-specific differences. Content analysis of qualitative data validated some of our quantitative results. We report that emergent factors such as disconfirmation and satisfaction are critical to understanding changes in IT users' beliefs and attitudes and recommend that they be included in future process models of IT usage.

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

information systems
acceptance
perceived usefulness
expectation disconfirmation theory


An end-to-end prototyping framework for compliant wireless LAN transceivers with smart antennas OFDM Wireless LANs based on the IEEE802.11 standard are complex systems in themselves. When smart antennas are used in such systems, both the MAC and the PHY layers must be redefined in order to achieve application-specific goals. As a result, the development of such systems can become impressively heavy. A complete development framework is presented here. It makes use of hardware/software co-design in order to implement all required layers to develop a wireless access point. The entire framework is targeted at an FPGA platform, providing full flexibility and processing power for the development of PHY layers. (C) 2008 Elsevier B.V. All rights reserved.

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

field programmable gate arrays
logic design
integrated circuit design
signal design
communication system software
communication systems
programming environments
software prototyping


Generalizations of the Hamming associative memory This Letter reviews four models of associative memory which generalize the operation of the Hamming associative memory: the grounded Hamming memory, the cellular Hamming memory, the decoupled Hamming memory, and the two-level decoupled Hamming memory. These memory models offer high performance and allow for a more practical hardware realization than the Hamming net and other fully interconnected neural net architectures.

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

artificial neural network
capacity
error correction


An analytic approach to better understanding and management of coronary surgeries Demand for high-quality, affordable healthcare services increasing with the aging population in the US. In order to cope with this situation, decision makers in healthcare (managerial, administrative and/or clinical) need to be increasingly more effective and efficient at what they do. Along with expertise, information and knowledge are the other key sources for better decisions. Data mining techniques are becoming a popular tool for extracting information/knowledge hidden deep into large healthcare databases. In this study, using a large, feature-rich, nationwide inpatient databases along with four popular machine learning techniques, we developed predictive models; and using an information fusion based sensitivity analysis on these models, we explained the surgical outcome of a patient undergoing a coronary artery bypass grafting. In this study, support vector machines produced the best prediction results (87.74%) followed by decision trees and neural networks. Studies like this illustrate the fact that accurate prediction and better understanding of such complex medical interventions can potentially lead to more favorable outcomes and optimal use of limited healthcare resources.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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
machine learning
sensitivity analysis

heart disease
coronary artery bypass surgery (cabg)
clinical decision support systems
survival prediction


Models for random constraint satisfaction problems We introduce a class of models for random constraint satisfaction problems. This class includes and generalizes many previously studied models. We characterize those models from our class which are asymptotically interesting in the sense that the limiting probability of satisfiability changes significantly as the number of constraints increases. We also discuss models which exhibit a sharp threshold for satisfiability in the sense that the limiting probability jumps from 0 to 1 suddenly as the number of constraints increases.

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

constraint satisfaction problems
threshold


Research on decision tree induction from self-map space based on web This paper proposes an improved decision tree method for web information retrieval with self-map attributes. Our self-map tree has a value of self-map attribute in its internal node, and information based on dissimilarity between a pair of map sequences. Our method selects self-map which exists between data by exhaustive search based on relation and attribute information. Experimental results confirm that our improved method constructs comprehensive and accurate decision tree. Moreover, an example shows that our self-map decision tree is promising for data mining and knowledge discovery. (c) 2006 Elsevier B.V. All rights reserved.

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

web information retrieval
decision tree
data mining


Inflation of correlation in the pursuit of drug-likeness Drug-likeness is a frequently invoked, although not always precisely defined, concept in drug discovery. Opinions on drug-likeness are to a large extent shaped by the relationships that are observed between surrogate measures of drug-likeness (e.g. aqueous solubility; permeability; pharmacological promiscuity) and fundamental physicochemical properties (e.g. lipophilicity; molecular size). This article draws on examples from the literature to highlight approaches to data analysis that exaggerate trends in data and the term correlation inflation is introduced in the context of drug discovery. Averaging groups of data points prior to analysis is a common cause of correlation inflation and results from analysis of binned continuous data should always be treated with caution.

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

correlation lipophilicity solubility promiscuity


Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem with availability constraint In this paper the problem of minimizing maximum earliness on a single machine with an unavailability period ( 1 , h 1 ? E max ) and also the same problem with simultaneous minimization of the two criteria of maximum earliness and number of tardy jobs ( 1 , h 1 ? E max , N T ) are studied. It is shown that the problem 1 , h 1 ? E max is NP-hard. For this problem a branch and bound approach is proposed which is based on a binary search tree. Proposing a heuristic algorithm named MMST, lower bound and efficient dominance rules, results in some instances with up to 3000 jobs being solved. The purpose in the problem 1 , h 1 ? E max , N T is to find the set of efficient solutions, i.e. the Pareto frontier. For this reason, for each measure E max and NT N T at first changes domain are calculated. A heuristic algorithm named PH and a branch and bound approach are developed to solve the problem. Proposing a lower bound and some dominance rules resulted in 96.4% of instances being solved optimally which proves the efficiency of the proposed method.

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

scheduling
availability constraint
maximum earliness
tardy jobs


Wavelet adaptive multiresolution representation: Applications to viscous multiscale flow simulations We present a new wavelet-based adaptive multiresolution representation (WAMR) algorithm for the numerical solution of multiscale evolution problems. Key features of the algorithm are fast procedures for grid rearrangement, computation of derivatives, as well as the ability to minimize the degrees-of-freedom for a prescribed solution accuracy. To demonstrate the efficiency and accuracy of the algorithm, we use it to solve the two-dimensional benchmark problem of incompressible fluid-flow in a lid-driven cavity at large Reynolds numbers. The numerical experiments demonstrate the great ability of the algorithm to adapt to different scales at different locations and at different times so as to produce accurate solutions at low computational cost. Specifically, we show that solutions of comparable accuracy as the benchmarks are obtained with more than an order of magnitude reduction in degrees-of-freedom.

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

wavelets
adaptive grid
viscous flow simulations


Approximating minimum cocolorings A cocoloring of a graph G is a partition of the vertex set of G such that each set of the partition is either a clique or an independent set in G. Some special cases of the minimum cocoloring problem are of particular interest. We provide polynomial-time algorithms to approximate a minimum cocoloring on graphs, partially ordered sets and sequences. In particular, we obtain an efficient algorithm to approximate within a factor of 1.71 a minimum partition of a partially ordered set into chains and antichains, and a minimum partition of a sequence into increasing and decreasing subsequences. (C) 2002 Elsevier Science B.V. All-rights reserved.

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


Three-dimensional convex hull as a fruitful source of diagrams The relationship between a three-dimensional convex hull and many important two-dimensional diagrams is surveyed, and a unifying approach to robust software for those diagrams is proposed. In this approach, instead of implementing individual algorithms, we first construct a robust algorithm for the three-dimensional convex hull, and next use it as an oracle for computing the other diagrams. The diagrams computable by this approach include the Voronoi diagram and its farthest-point Versions both on the plane and on the sphere, the Laguerre Voronoi diagram and its farthest-point version both on the plane and on the sphere, and the intersection of half-spaces. (C) 2000 Elsevier Science B.V. All rights reserved.

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

three-dimensional convex hull
laguerre voronoi diagram
intersection of half-spaces


Visual tracking in occlusion environments by autonomous switching of targets Visual tracking is required by many vision applications such as human-computer interfaces and human-robot interactions. However, in daily living spaces where such applications are assumed to be used, stable tracking is often difficult because there are many objects which can cause the visual occlusion. While conventional tracking techniques can handle, to some extent, partial and short-term occlusion, they fail when presented with complete occlusion over long periods. They also cannot handle the case that an occluder such as a box and a bag contains and carries the tracking target inside itself, that is, the case that the target invisibly moves while being contained by the occluder. In this paper, to handle this occlusion problem, we propose a method for visual tracking by a particle, filter, which switches tracking targets autonomously. In our method, if occlusion occurs during tracking, a model of the occluder is dynamically created and the tracking target is switched to this model. Thus, our method enables the tracker to indirectly track the "invisible target" by switching its target to the occluder effectively. Experimental results show the effectiveness of our method.

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

visual tracking
occlusion
autonomous switching of targets
particle filter


almost settling the hardness of noncommutative determinant In this paper, we study the complexity of computing the determinant of a matrix over a noncommutative algebra. In particular, we ask the question: "Over which algebras is the determinant easier to compute than the permanent?" Towards resolving this question, we show the following results for noncommutative determinant computation: [Hardness] Computing the determinant of an n x n matrix whose entries are themselves 2 x 2 matrices over any field of zero or odd characteristic is as hard as computing the permanent over the field. This extends the recent result of Arvind and Srinivasan, which required the entries to be matrices of dimension linear in n. [Easiness] The determinant of an n x n matrix whose entries are themselves d x d upper triangular matrices can be computed in poly(n d ) time. Combining the above with the decomposition theorem for finite dimensional algebras (and in particular exploiting the simple structure of 2 x 2 matrix algebras), we can extend the above hardness and easiness statements to more general algebras as follows. Let A be a finite dimensional algebra over a finite field of odd characteristic with radical R(A). [Hardness] If the quotient A/R(A) is noncommutative, then computing the determinant over the algebra A is as hard as computing the permanent. [Easiness] If the quotient A/R(A) is commutative, and furthermore R(A) has nilpotency index d (i.e., d is the smallest integer such that R(A) d =0), then there exists a poly(n d )-time algorithm that computes determinants over the algebra A. In particular, for any constant dimensional algebra A over a finite field of odd characteristic, since the nilpotency index of R(A) is at most a constant, we have the following dichotomy theorem: if A/R(A) is commutative then efficient determinant computation is possible, and otherwise determinant is as hard as permanent.

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

noncommutative algebras
computational algebra


Analyzing Correspondence between Sound Objects and Body Motion Links between music and body motion can be studied through experiments called sound-tracing. One of the main challenges in such research is to develop robust analysis techniques that are able to deal with the multidimensional data that musical sound and body motion present. The article evaluates four different analysis methods applied to an experiment in which participants moved their hands following perceptual features of short sound objects. Motion capture data has been analyzed and correlated with a set of quantitative sound features using four different methods: (a) a pattern recognition classifier, (b) t-tests, (c) Spearman's. correlation, and (d) canonical correlation. This article shows how the analysis methods complement each other, and that applying several analysis techniques to the same data set can broaden the knowledge gained from the experiment.

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

experimentation
human factors
sound-tracing
music-related motion


Optimal manufacturers replenishment policies in the EPQ model under two levels of trade credit policy In 2007, Huang proposed the optimal retailers replenishment decisions in the EPQ model under two levels of trade credit policy, in which the supplier offers the retailer a permissible delay period M, and the retailer in turn provides its customer a permissible delay period N (with N<M). In this paper, we extend his EPQ model to complement the shortcoming of his model. In addition, we relax the dispensable assumptions of N<M and others. We then establish an appropriate EPQ model to the problem, and develop the proper theoretical results to obtain the optimal solution. Finally, a numerical example is used to illustrate the proposed model and its optimal solution.

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

inventory
trade credits
permissible delay in payments


An evaluation of crowd counting methods, features and regression models ? This paper presents an evaluation of existing crowd counting algorithms. We evaluate 5 datasets: UCSD, PETS 2009, Fudan, Mall, Grand Central. We evaluate holistic, local and histogram features (size, shape, edges, keypoints). GPR outperforms linear, KNN and neural network regression. Multiple local features outperform holistic and histogram based features.

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

crowd counting
local features
histogram features
regression


Efficient algorithm for simultaneous reduction to the \(m\)-Hessenberg-triangular-triangular form This paper proposes an efficient algorithm for simultaneous reduction of three matrices by using orthogonal transformations, where \(A\) is reduced to \(m\)-Hessenberg form, and \(B\) and \(E\) to triangular form. The algorithm is a blocked version of the algorithm described by Miminis and Paige (Int J Control 35:341354, 1982). The \(m\)-Hessenberg-triangulartriangular form of matrices \(A\), \(B\) and \(E\) is specially suitable for solving multiple shifted systems \((\sigma E-A)X=B\). Such shifted systems naturally occur in control theory when evaluating the transfer function of a descriptor system, or in interpolatory model reduction methods. They also arise as a result of discretizing the time-harmonic wave equation in heterogeneous media, or originate from structural dynamics engineering problems. The proposed blocked algorithm for the \(m\)-Hessenberg-triangular-triangular reduction is based on aggregated Givens rotations, and is a generalization of the blocked algorithm for the Hessenberg-triangular reduction proposed by Kgstrm et al. (BIT 48:563584, 2008). Numerical tests confirm that the blocked algorithm is much faster than its non-blocked version based on regular Givens rotations only. As an illustration of its efficiency, two applications of the \(m\)-Hessenberg-triangular-triangular reduction from control theory are described: evaluation of the transfer function of a descriptor system at many complex values, and computation of the staircase form used to identify the controllable part of the system.

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

orthogonal transformations
blocked algorithm
staircase form


low power requirements for future digital life style Rapid advancement of semiconductor, personal computing, and mobile communications technology during last decades has been transforming one's life style into "Digital Life Style", in which one can create, share, and enjoy multimedia information in his own personalized virtual space in mobile environment. There are, in general, three key enabling factors to realize the future digital life style: easily accessible multimedia contents for diversified user applications, communication and information infrastructure to support such access from user, and intelligent user devices to deliver such digital contents in an user friendly manner. In this talk, future prospect of user devices in consumer electronics space and associated technological challenges, especially in low power aspects, will be discussed. Brief overview of current state of low power technology employed by many portable devices and wireless data collection systems will be followed by the suggestion of future research areas for low power user devices in the areas of portable power sources, components, software architecture, and SOC (System-On-Chips) technology. Finally, Samsung's R&D strategy in low power technology will be discussed.

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

digital life style
components
portable power sources
software architecture
soc


XZP+1d and XZP+1d-DKH basis sets for second-row elements: application to CCSD(T) zero-point vibrational energy and atomization energy calculations Recently, segmented all-electron contracted double, triple, quadruple, quintuple, and sextuple zeta valence plus polarization function (XZP, X = D, T, Q, 5, and 6) basis sets for the elements from H to Ar were constructed for use in conjunction with nonrelativistic and Douglas-Kroll-Hess Hamiltonians. In this work, in order to obtain a better description of some molecular properties, the XZP sets for the second-row elements were augmented with high-exponent d "inner polarization functions," which were optimized in the molecular environment at the second-order Moller-Plesset level. At the coupled cluster level of theory, the inclusion of tight d functions for these elements was found to be essential to improve the agreement between theoretical and experimental zero-point vibrational energies (ZPVEs) and atomization energies. For all of the molecules studied, the ZPVE errors were always smaller than 0.5 %. The atomization energies were also improved by applying corrections due to core/valence correlation and atomic spin-orbit effects. This led to estimates for the atomization energies of various compounds in the gaseous phase. The largest error (1.2 kcal mol(-1)) was found for SiH4.

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


a history of clu The idea of a data abstraction has had a significant impact on the development of programming languages and on programming methodology. CLU was the first implemented programming language to provide direct linguistic support for data abstraction. This paper provides a history of data abstraction and CLU. CLU contains a number of other interesting and influential features, including its exception handling mechanism, its iterators, and its parameterized types.

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

abstraction
methodology
exception handling
types
data
direct
support
paper
programming language

program histories developer feature linguistics iter


Directly Lower Bounding the Information Capacity for Channels With IID Deletions and Duplications In this paper, we directly lower bound the information capacity for channels with independent identically distributed (i.i.d.) deletions and duplications. Our approach differs from previous work in that we focus on the information capacity using ideas from renewal theory, rather than focusing on the transmission capacity by analyzing the error probability of some randomly generated code using a combinatorial argument. Of course, the transmission and information capacities are equal, but our change of perspective allows for a much simpler analysis that gives more general theoretical results. We then apply these results to the binary deletion channel to improve existing lower bounds on its capacity.

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

channel capacity
deletion channels
insertion channels


Generic multivariate model for color texture classification in RGB color space This paper presents a new method for modeling magnitudes of dual-tree complex wavelet coefficients, in the context of color texture classification. Based on the characterization of dependency between RGB color components, Gaussian copula associated with Generalized Gamma marginal function is proposed to design the multivariate generalized Gamma density (MG\(\Gamma \)D) modeling. MG\(\Gamma \)D has the advantages of genericity in terms of fitting over a variety of existing joint models. On the one hand, the generalized Gamma density function offers free-shape parameters to characterize a wide range of heavy-tailed densities, i.e., the genericity. On the other hand, the inter-component, inter-band dependency is captured by the Gaussian Copula which offers adapted flexibility. Moreover, this model leads to a closed form for the probabilistic similarity measure in terms of parameters, i.e., KullbackLeibler divergence. By exploiting the separability between the copula and the marginal spaces, the closed form enables us to minimize the computational time needed to measure the discrepancy between two Multivariate Generalized Gamma densities in comparison to other models which imply using a Monte Carlo method characterized by an expensive time computing. For evaluating the performance of our proposal, a K-nearest neighbor (KNN) classifier is then used to test the classification accuracy. Experiments on different benchmarks using color texture databases are conducted to highlight the effectiveness of the proposed model associated to the KullbackLeibler divergence.

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

classification
texture
copula
kullbackleibler divergence


Geometrical parameter estimation for industrial manipulators using two-step estimation schemes This paper proposes a new solution for estimating the kinematic parameters of a manipulator, using a two-step linear estimator. The estimator is based on the recursive least-squares (RLS) method. The main characteristics of the method are that one singularity in estimation is overcome and parameters estimates approach the true values more quickly and smoothly than for algorithms using a one-step estimator. The algorithm can be applied for the estimation of parameters of both serial-link robots and robots having a kinematic closed-loop. Simulation results are given, comparing the proposed method with conventional approaches.

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


A SIGNAL-TUNED GABOR TRANSFORM WITH APPLICATION TO EEG ANALYSIS We introduce a time-frequency transform based on Gabor functions whose parameters are given by the Fourier transform of the analyzed signal. At any given frequency, the width and the phase of the Gabor function are obtained, respectively, from the magnitude and the phase of the signal's corresponding Fourier component, yielding an analyzing kernel which is a representation of the signal's content at that particular frequency. The resulting Gabor transform tunes itself to the input signal, allowing the accurate detection of time and frequency events, even in situations where the traditional Gabor and S-transform approaches tend to fail. This is the case, for instance, when considering the time-frequency representation of electroencephalogram traces (EEG) of epileptic subjects, as illustrated by the experimental study presented here.

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

time-frequency analysis
s-transform
eeg signal processing


high effective-resolution built-in jitter characterization with quantization noise shaping A novel built-in jitter characterization architecture combining quantization noise shaping and a partial Vernier delay structure is proposed for high resolution jitter measurement. The effective resolution is optimized at the system level as well as the circuit level. Using 90nm CMOS technology, an area of 0.008mm 2 is occupied. The power consumption is 1.85mW. An effective resolution of 1.5ps is achieved.

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

gated ring oscillator
built-in jitter characterization
vernier delay line


Ocean waves synthesis and animation using real world information In Computer Graphics, existing ocean waves models still suffer from lack of realism and/or complexity of use essentially due to empirical definition of parameters by the user. In this paper, we propose an easy to use spectral ocean waves model whose parameters are obtained automatically from real world information. These parameters can be computed in two different ways. The first one makes use of measured oceanographic data and the second one is image based. Both are very fast and simple to use. By using real world information, we can achieve more realistic results than previous models. Ocean waves animation is very easy to perform with our spectral model. In addition, this model is procedural and allows a continuous representation of ocean surface away from shore with any size and any level of detail, while requiring very low memory storage.

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

realistic ocean waves
automatic synthesis
buoy data


Linear and quadratic algorithms for scheduling chains and opposite chains One basic scheduling problem of parallel systems is the scheduling of chains, the simplest form of precedence constraints between tasks. When tasks have unit-execution-times, the simple level algorithm minimizes the schedule length (or makespan). However, the time complexity is linear in the number of tasks and exponential in the size of the problem if a succinct coding is used. If some tasks are multiprocessor tasks, which require more than one processor at a time, the problem becomes more complicated and several NP-hardness results as well as polynomial algorithms (in the number of tasks) for practically important special cases (e.g. opposite chains) were obtained in the literature. Again, these solutions are exponential in the size of the problem if a succinct coding is used. In this paper we re-address the problem of scheduling chains and opposite chains. We consider both preemptive and nonpreemptive schedules. We first propose variants of largest remaining task (LRT) and highest level first (HLF) algorithms for chains of unit-width tasks. We then apply these new algorithms to the scheduling of unit-width chains and opposite chains. For the case of unit-width chains, we assume that tasks may have different ready (arrival) times. For both preemptive and nonpreemptive tasks, we obtain optimal scheduling algorithms of quadratic time complexity in the number of chains.

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

scheduling
multiprocessor tasks
level algorithm

parallel computing
preemptive and nonpreemptive scheduling
chain
opposite chain
largest-remaining-task algorithm


Information systems success in the context of different corporate cultural types: An empirical investigation Previous studies surrounding the DeLone and McLean model of information systems (IS) success have called for future research and further examination of its measure in different contexts. We draw from the literature on strategic IS planning and organizational culture to contextualize the DeLone and McLean model. There is some evidence that a high-quality information technology (IT) plan leads to system success; therefore, we empirically examine the inclusion of the IT plan quality construct as an antecedent to IS success. We also empirically examine the relationships among constructs in the model of IS success in the context of different corporate cultural types-entrepreneurial and formal. The results provide strong support for the research model and suggest that variations in IS success are explained by the quality of the IT plan and the corporate culture exhibited by a firm. We discuss implications related to our finding that IT plan quality has a greater impact on IS success in organizations that exhibit an entrepreneurial corporate culture than in those that exhibit a formal corporate culture. Furthermore, we discuss how the relationships in the DeLone and McLean model of IS success differ in diverse corporate cultural types and the meaning of these differences.

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

corporate culture
information systems success

impact of information systems use
information technology plan quality


A computational model of intention reading in imitation Imitation in artificial systems involves a number of important aspects, such as extracting the relevant features of the demonstrated behaviour, inverse mapping observations, and executing motor commands. In this article we focus on how an artificial system can infer what the demonstrator intended to do. The model that we propose draws inspiration from developmental psychology and contains three crucial features. One is that the imitating agent needs repeated trials, thus stepping away from the one-shot learning by demonstration paradigm. The second is that the imitating agent needs a learning method in which it keeps track of intentions to reach goals. The third feature is that the model does not require an external measure of equivalence; instead, the demonstrator decides whether an attempted imitation was equivalent to the demonstration or not. We present a computational model and its simulation results, which underpin our theory of goal-directed imitation on an artificial system.

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

imitation on robots
goal-directed imitation


Mutualism promotes diversity and stability in a simple artificial ecosystem This work investigates the effect of ecological interactions between organisms on the evolutionary dynamics of a community. A spatially explicit, individual-based model is presented, in which organisms compete for space and resources, We investigated how introducing the potential for mutualistic relationships (where the presence of one type of organism stimulates the growth of another type, and vice versa) affected the evolutionary dynamics of the system. Without this potential, one or a small number of individual types of organisms dominated the simulated community from the onset. When mutualistic relationships were allowed, many persisting types arose, with new types appearing continually. Furthermore, we investigated how the stability of the community differed when mutualistic relationship,, were allowed and disallowed. Our results suggest that the existence of mutualistic relationships improved community stability.

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

ecosystern
evolution
ecological interaction
ecosystem diversity
ecosystern stability