Performance evaluation for implementations of a network of proxy caches In a network of proxy-level caches, such as IRCache (www.ircache.net), nodes collaborate with one another to satisfy object requests. However, since collaboration in current implementations of proxy cache networks is typically limited to sharing cache contents, there may be unnecessary redundancies in storing objects. It is expected that a mechanism that considers the objects cached at every node in the network would be more effective for reducing user delays. In this study we construct algorithms for different implementations of such a mechanism using the theoretical approach of Tawarmalani et al. [Tawarmalani, M., Karthik, K., and De, P., Allocating Objects in a Network of Caches: Centralized and Decentralized Analyses, (2007) Purdue University Working Paper] that investigate caching policies where nodes do consider objects held by their neighbors. The caching implementations are also compared and contrasted with numerical computations using simulated data. The performance results should provide useful directions for computer network administrators to develop proxy caching implementations that are suited for differing network and demand characteristics. There is a significant potential for deploying proxy cache networks in order to reduce the delays experienced by web users due to increasing congestion on the Internet. Therefore we believe that this study contributes to network caching research that is beneficial for Internet users.

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

proxy cache network
collaboration mechanism


UNBIASED QUANTUM RANDOM NUMBER GENERATION BASED ON SQUEEZED VACUUM STATE In this paper, a new quantum random number generation scheme which is implemented by measuring quantum noise of the squeezed vacuum state is proposed. In the proposed scheme, the Shannon entropy is employed to measure randomness of the generated random numbers. In addition, some characteristics of the generated random numbers are investigated. To reach the pure quantum randomness, an extraction approach based on universal hash functions for the generated quantum random numbers is presented. Results show that the proposed scheme based on squeezed vacuum state has remarkable advantages over the one associated with the vacuum state.

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


Parallel observability analysis on networks of workstations In this work we present the parallelisation of the global strategy with first least-connected node (GS-FLCN), which is a novel structural technique for the classification of unmeasured variables in process plant instrumentation design. The algorithm aims at partitioning the process' occurrence matrix to a specific block lower-triangular form. A parallel master-workers philosophy is employed to search for all the paths of a given length existing in the associated graph. The code was conceived for distributed environments and the implementation was carried out using the parallel virtual machine (PVM) library. The performance of the parallel algorithm was tested for industrial case studies and the results were compared with those yielded by the sequential version. The time savings achieved thanks to the parallelisation. were significant. Besides, in the parallel version, more paths can be explored per unit time. In practice, this implies greater robustness. (C) 2001 Elsevier Science Ltd. All rights reserved.

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

instrumentation design
observability
networks of workstations


Using XML for the exchange of updating information between geographical information systems The growth of institutional investment in Geographic Information Systems (GISs) testifies to their increasing importance as analytical decision-making tools utilising highly specialised data. However, a simple system still does not exist for the easy and consistent integration of evolutions into GIS. At present institutions either retrieve the updates themselves, often failing entirely results in information loss and major inconsistencies or they purchase reference data sets from geographic information producers. The problems and expense associated with the integration of updates for geographic databases are well documented. However, it is the lack of choice available in the method of delivering these updates that results in inefficiency, as a whole new database is often delivered even when there is relatively little real change in its data. This paper details the implementation of a new solution for the exchange of updating information for geographical information systems. Developed at the COGIT laboratory of IGN (the French National Mapping Agency) it is based on XML (eXtensible Markup Language) and aims to providing users with structured and detailed information concerning evolutions in order to make their integration into systems easier and more consistent. We highlight the challenges and benefits involved in implementing this transfer method, such as the interoperability between GIS software and the problems of real time updating of databases within client/server architectures. This paper aims to demonstrate that the use of XML in data exchanges is likely to become commonplace between GISs, especially with the aid of Java technology and the web-based client/server data access. It may even be possible to supply consumers with adapted updates on demand and enable real time maintenance of databases to be carried out.

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

sgml (standard generalised markup language)


The GMOseek matrix: a decision support tool for optimizing the detection of genetically modified plants Since their first commercialization, the diversity of taxa and the genetic composition of transgene sequences in genetically modified plants (GMOs) are constantly increasing. To date, the detection of GMOs and derived products is commonly performed by PCR-based methods targeting specific DNA sequences introduced into the host genome. Information available regarding the GMOs molecular characterization is dispersed and not appropriately organized. For this reason, GMO testing is very challenging and requires more complex screening strategies and decision making schemes, demanding in return the use of efficient bioinformatics tools relying on reliable information.

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

genetically modified organism (gmo)
gmo screening
matrix approach
genetically modified plant


Geometric property based ellipse detection method Improve positive and negative inner correlation to create symmetric center detector. Able to not just locate ellipse center but center of central symmetry shapes. Introduce the concept of distance distribution to locate the ellipse foci. Detect ellipse irrelevant to parameter space and avoid the quantification errors.

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

ellipse detection
distance distribution
geometric property

inner product
symmetry center location
shape detection
circle detection
ellipse foci location


promoting temporal diversity in video search results In this paper a number of methods for re-ranking video search results in order to introduce temporal diversity are presented. The usefulness of these approaches is evaluated in comparison with similarity based measures and visual diversity re-ranking approaches for TRECVID 2007 topics. The results of this evaluation indicate our temporal re-ranking has a negligible impact on retrieval performance. One of the most successful of these approaches was then implemented in an interactive search system for the TRECVID 2008 interactive search topics and compared with similarity based methods and a visual diversity re-ranking method. The results indicate that promoting temporal diversity does not have an adverse effect on user performance and in some cases can increase user performance.

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

retrieval temporal video diversity interactive


integrating a model of analytical quality assurance into the v-modell xt Economic models of quality assurance can be an important tool for decision-makers in software development projects. They enable to base quality assurance planning on economical factors of the product and the used defect-detection techniques. A variety of such models has been proposed but many are too abstract to be used in practice. Furthermore, even the more concrete models lack an integration with existing software development process models to increase their applicability. This paper describes an integration of a thorough stochastic model of the economics of analytical quality assurance with the systems development process model V-Modell XT. The integration is done in a modular way by providing a new process module - a concept directly available in the V-Modell XT for extension purposes - related to analytical quality assurance. In particular, we describe the work products, roles, and activities defined in our new process module and their effects on existing V-Modell XT elements.

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

v-modell
quality model
software quality economics
quality costs


Approximation quality for sorting rules A method is presented for the approximation quality for sorting rules, which is based on Rough Set Data Analysis. Several types of rules are discussed: The "nominal --> nominal" case (NN) (the classical Rough Set approach), "nominal --> ordinal" (NO) rules, and "ordinal --> ordinal" (OO) rules, and its gencralisation to "(nominal, ordinal) --> ordinal" rules (NO-O), We provide a significance test for the overall approximation quality, and a test for partial influence of attributes based on the bootstrap technology. For the bivariate case, the relationship of U-statistics and the proposed approximation quality measure is discussed. It can be shown that in this case a simple linear transformation of the Kendall tau correlation forms an upper bound for the approximation quality of sorting rules. A competing model is also studied. Whereas this method is a promising tool in case of searching for global consistency, we demonstrate that in case of local perturbations in the data set the method may offer questionable results, and that it is dissociated from the theory it claims to support. In the final Section, an example illustrates the introduced concepts and procedures. (C) 2002 Elsevier Science B.V. All rights reserved.

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

decision support systems
ordinal prediction


FASHION WAVES IN INFORMATION SYSTEMS RESEARCH AND PRACTICE Building on neo-institutional theory and theories of innovation and diffusion, recent work in the field of management has suggested that management research and practice is characterized by fashions. A management fashion is a relatively transitory belief that a certain management technique leads rational management progress. Using bibliographic research, we apply Abrahamson's management fashion theory to information systems research and practice. Our findings reveal that information systems research and practice, like management research and practice, is indeed characterized by fashions. These "IS fashion waves" are relatively transitory and represent a burst of interest in particular topics by IS researchers and practitioners. However, while our findings show that IS research closely parallels practice, we suggest that a more proactive engagement of IS academics is needed in the IS fashion-setting process.

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

adoption
information systems fashion
fashion setting
research agenda
information systems practice


Finger identification and hand posture recognition for human-robot interaction Natural and friendly interface is critical for the development of service robots. Gesture-based interface offers a way to enable untrained users to interact with robots more easily and efficiently. In this paper, we present a posture recognition system implemented on a real humanoid service robot. The system applies RCE neural network based color segmentation algorithm to separate hand images from complex backgrounds. The topological features of the hand are then extracted from the silhouette of the segmented hand region. Based on the analysis of these simple but distinctive features, hand postures are identified accurately. Experimental results on gesture-based robot programming demonstrated the effectiveness and robustness of the system. (c) 2006 Elsevier B.V. All rights reserved.

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

hand posture recognition
robot programming

hand finger identification
hand image segmentation
human-robot interaction


Interpolation Artifacts in Sub-Pixel Image Registration We consider the problem of registering (aligning) two images to sub-pixel accuracy by optimization of objective functions constructed from the images' intensity values. We show that some widely used interpolation methods can introduce multiple local optima in the energy, of the interpolated image which, if not counterbalanced by other terms, can cause local optima in registration objective functions including the sum of squared differences, cross correlation, and mutual information. We discuss different solutions to address the problem based on high degree B-spline interpolation, low pass filtering the images, and stochastic integration. Numerical examples using synthetic and real signals and images are shown.

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

artifacts
image registration
interpolation
mutual information


cognitive and software solutions for computer-related anxiety The goal of this workshop is to focus discussion on how to design inexpensive but effective techniques for the management of computer-related anxiety. These techniques may be geared either towards the design of software, or towards the design of training or stress-management techniques.

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

computer-related anxiety
coping techniques
minority groups
human-computer interaction


Two approaches to direct block-support conditional co-simulation ? Change of support is a common issue in the geosciences when the volumetric support of the available data is smaller than that of the blocks on which numerical modeling is required. In this paper, we present two algorithms for the direct block-support simulation of cross-correlated random fields that are monotonic transforms of stationary Gaussian random fields. The first algorithm is a variation of sequential Gaussian co-simulation, in which each block value is simulated in turn, conditionally to the original data and to the previously simulated block values, while the second algorithm is based on spectral co-simulation in the framework of the discrete Gaussian change-of-support model. These two algorithms are implemented in computer programs and applied to a synthetic case study and to a mining case study. Their properties and performances are compared and discussed.

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

support effect
linear model of coregionalization
sequential gaussian simulation
spectral simulation
fast fourier transform
discrete gaussian model


Transient analysis of a single server queue with catastrophes, failures and repairs A transient solution is obtained analytically using continued fractions for the system size in an M/M/1 queueing system with catastrophes, server failures and non-zero repair time. The steady state probability of the system size is present. Some key performance measures, namely, throughput, loss probability and response time for the system under consideration are investigated. Further, reliability and availability of the system are analysed. Finally, numerical illustrations are used to discuss the system performance measures.

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

catastrophes
continued fractions
steady state
throughput
loss probability


HCO-TERNARY: A FORTRAN code for calculating P-V-T-X properties and liquid vapor equilibria of fluids in the system H2O-CO2-CH4 The equation of state (EOS) for the system H2O-CO2-CH4 was programmed in a FORTRAN code which allows for its utilization in several modes. In one mode, specifically designed for mathematical modeling of two-phase, two-component flow, the code accepts as independent variables (1) pressure and (2) the composition of the gas phase. Other modes allow for the calculation of phase equilibria and/or the molar volumes of H2O and binary mixtures, with pressure and temperature as the input variables (just pressure in the case of H2O). Another mode is used to calculate phase equilibria for ternary mixtures, with pressure, temperature and the mole fraction of water in the gas phase as input variables. The algorithms for automatic convergence utilized in each mode are described. The code was tested extensively against experimental data from the literature. Some of these data were applied in the development of the EOS, and others were published subsequently. Analyses of the performance of the code and EOS for the modes described above, in the range 50-1000degreesC, 0-1000 bar, are presented. P-T-X regions of best applicability of the code and EOS are also identified. (C) 2003 Elsevier Science Ltd. All rights reserved.

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

volumetric properties
vapor-liquid equilibria
h2o-co2-ch4 fluids


Robosemantics: How Stanley the Volkswagen Represents the World One of the most impressive feats in robotics was the 2005 victory by a driverless Volkswagen Touareg in the DARPA Grand Challenge. This paper discusses what can be learned about the nature of representation from the cars successful attempt to navigate the world. We review the hardware and software that it uses to interact with its environment, and describe how these techniques enable it to represent the world. We discuss robosemantics, the meaning of computational structures in robots. We argue that the car constitutes a refutation of semantic arguments against the possibility of strong artificial intelligence.

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

semantics
intentionality
bayesian networks


Accelerated max-margin multiple kernel learning Kernel machines such as Support Vector Machines (SVM) have exhibited successful performance in pattern classification problems mainly due to their exploitation of potentially nonlinear affinity structures of data through the kernel functions. Hence, selecting an appropriate kernel function, equivalently learning the kernel parameters accurately, has a crucial impact on the classification performance of the kernel machines. In this paper we consider the problem of learning a kernel matrix in a binary classification setup, where the hypothesis kernel family is represented as a convex hull of fixed basis kernels. While many existing approaches involve computationally intensive quadratic or semi-definite optimization, we propose novel kernel learning algorithms based on large margin estimation of Parzen window classifiers. The optimization is cast as instances of linear programming. This significantly reduces the complexity of the kernel learning compared to existing methods, while our large margin based formulation provides tight upper bounds on the generalization error. We empirically demonstrate that the new kernel learning methods maintain or improve the accuracy of the existing classification algorithms while significantly reducing the learning time on many real datasets in both supervised and semi-supervised settings.

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


Cross-polarization in dual polarization switching antennas This paper presents the effect of the interaction between the switch and the antenna parameters on the cross-polarization of a dual polarization switching antenna. It is shown that the isolated antenna cross-polarization combines with the isolation of the switch giving place to a degradation of the polarization purity of the combined dual polarization switching antenna. Analytical expressions for the combination of the switch isolation and the antenna cross-polarization in the switched antenna element are given. Simulations and pattern measurements are presented. (C) 2007 Wiley Periodicals, Inc.

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

dual polarization
antenna crosspolarization

patch antenna radiation patterns
polarization agility
polarization diversity


A novel bi-vector encoding genetic algorithm for the simultaneous multiple resources scheduling problem To improve capital effectiveness in light of demand fluctuation, it is increasingly important for high-tech companies to develop effective solutions for managing multiple resources involved in the production. To model and solve the simultaneous multiple resources scheduling problem in general, this study aims to develop a genetic algorithm (bvGA) incorporating with a novel bi-vector encoding method representing the chromosomes of operation sequence and seizing rules for resource assignment in tandem. The proposed model captured the crucial characteristics that the machines were dynamic configuration among multiple resources with limited availability and sequence-dependent setup times of machine configurations between operations would eventually affect performance of a scheduling plan. With the flexibility and computational intelligence that GA empowers, schedule planners can make advanced decisions on integrated machine configuration and job scheduling. According to a number of experiments with simulated data on the basis of a real semiconductor final testing facility, the proposed bvGA has shown practical viability in terms of solution quality as well as computation time.

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

total resource management
manufacturing management
flexible manufacturing systems


Multi-Attribute Portfolio Selection: New Perspectives The Multi-Attribute portfolio selection problem involves the choice of a set of stocks (assets, securities) based on incommensurable and conflicting objectives such as return, risk and liquidity. These objectives cannot be optimized simultaneously. Thus, the Financial Decision Maker has to make some compromises between objectives in order to obtain the most satisfactory portfolio with a specified amount of money to invest. Various approaches have been proposed for the portfolio selection problem such as: stochastic dominance models, multi-attribute utility models, multi-objective programming models, discriminant analysis, heuristic methods, neural networks, optimization models and multi-criteria decision aid methods. The aim of this editorial note is to provide a summary of the contributions made by some papers presented during the second International Workshop on Multi-Attribute Portfolio Selection that took place in Montreal (Canada) in 2007.

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

financial decision maker's preferences
multi-criteria decision aid


A negotiation support system for resolving an international trans-boundary natural resource conflict Caspian Sea Negotiation Support System (NSS) is developed to facilitate negotiations. The NSS provides optimal results with a reasonable computational effort using a heuristic algorithm. Areal shares of the countries have a non-linear relation with their economic gains. Clarification of the gains under each division rule is essential to success of negotiations. Caspian Sea NSS can delineate optimal nautical borders under different division rules.

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

conflict resolution
resource allocation
combinatorial optimization


Automatic recognition of sleep spindles in EEG by using artificial neural networks In this paper, we introduce a two-stage procedure based on artificial neural networks for the automatic recognition of sleep spindles (SSs) in a multi-channel electroencephalographic signal. In the first stage, a discrete perceptron is used to eliminate definite non-SSs. The pre-classification done in the first stage not only reduces the computation time but also increases the overall detection performance of the procedure. In the second stage, the remaining SS candidates after pre-classification procedure are aimed to be separated from each other by an artificial neural network that would function as a post-classifier. Two different networks, i.e. a backpropagation multilayer perceptron and radial basis support vector machine (SVM), are proposed as the post-classifier and compared in terms of their classification performances. Visual evaluation, by two electroencephalographers (EEGers), of 19 channel EEG records of 6 subjects showed that the best performance is obtained with a radial basis SVM providing an average sensitivity of 94.6% and an average false detection rate of 4.0%.

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

sleep spindle recognition
support vector machines
backpropagation algorithm
pattern recognition


Analysis of Discrete \(L^2\) Projection on Polynomial Spaces with Random Evaluations We analyze the problem of approximating a multivariate function by discrete least-squares projection on a polynomial space starting from random, noise-free observations. An area of possible application of such technique is uncertainty quantification for computational models. We prove an optimal convergence estimate, up to a logarithmic factor, in the univariate case, when the observation points are sampled in a bounded domain from a probability density function bounded away from zero and bounded from above, provided the number of samples scales quadratically with the dimension of the polynomial space. Optimality is meant in the sense that the weighted \(L^2\) norm of the error committed by the random discrete projection is bounded with high probability from above by the best \(L^\infty \) error achievable in the given polynomial space, up to logarithmic factors. Several numerical tests are presented in both the univariate and multivariate cases, confirming our theoretical estimates. The numerical tests also clarify how the convergence rate depends on the number of sampling points, on the polynomial degree, and on the smoothness of the target function.

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


Nonlinear observer design for discrete-time bifurcating systems This paper is a geometric study of the nonlinear observer design for discrete-time bifurcating systems. First, we obtain necessary and sufficient conditions for local exponential observers for discrete-time nonlinear bifurcating systems under some stability assumptions. Next, using our characterization of local exponential observers, we derive a construction procedure for exponential observers for the discrete-time bifurcating systems. As applications of our observer design, we consider codimension one bifurcations such as the pitchfork bifurcation, and codimension two bifurcations such as the cusp bifurcation. (C) 2002 Elsevier Science Ltd. All rights reserved.

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

nonlinear observers
discrete-time systems


Hardness results on the gapped consecutive-ones property problem Motivated by problems in comparative genomics and paleogenomics, we study the computational complexity of the Gapped Consecutive-Ones Property ((k,?) ( k , ? ) -C1P) Problem: given a binary matrix M M and two integers k k and ? ? , decide if the columns of M M can be permuted such that each row contains at most k k blocks of ones and no two neighboring blocks of ones are separated by a gap of more than ? ? zeros. The classical C1P decision problem, which is known to be polynomial-time solvable is equivalent to the (1,0) ( 1 , 0 ) -C1P problem. We extend our earlier results on this problem [C. Chauve, J. Mauch, M. Patterson, On the gapped consecutive-ones property, in: Proceedings of the European Conference on Combinatorics, Graphs Theory and Applications (EuroComb), in: Electronic Notes in Discrete Mathematics, vol. 34, 2009, pp. 121125] to show that for every k?2,??1,(k,?)?(2,1) k ? 2 , ? ? 1 , ( k , ? ) ? ( 2 , 1 ) , the (k,?) ( k , ? ) -C1P Problem is NP-complete, and that for every ??1 ? ? 1 , the (?,?) ( ? , ? ) -C1P Problem is NP-complete. On the positive side, we also show that if k,? k , ? and the maximum degree of M M are constant, the problem is related to the classical Graph Bandwidth Problem and can be solved in polynomial time using a variant of an algorithm of Saxe [J.B. Saxe, Dynamic-programming algorithms for recognizing small-bandwidth graphs in polynomial time, SIAM Journal on Algebraic and Discrete Methods 1 (4) (1980) 363369].

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

computational complexity
graph bandwidth
algorithm

consecutive-ones property
ancestral genome reconstruction


A Substitution-Translation-Restoration Framework for Handling Unknown Words in Statistical Machine Translation Unknown words are one of the key factors that greatly affect the translation quality. Traditionally, nearly all the related researches focus on obtaining the translation of the unknown words. However, these approaches have two disadvantages. On the one hand, they usually rely on many additional resources such as bilingual web data; on the other hand, they cannot guarantee good reordering and lexical selection of surrounding words. This paper gives a new perspective on handling unknown words in statistical machine translation (SMT). Instead of making great efforts to find the translation of unknown words, we focus on determining the semantic function of the unknown word in the test sentence and keeping the semantic function unchanged in the translation process. In this way, unknown words can help the phrase reordering and lexical selection of their surrounding words even though they still remain untranslated. In order to determine the semantic function of an unknown word, we employ the distributional semantic model and the bidirectional language model. Extensive experiments on both phrase-based and linguistically syntax-based SMT models in Chinese-to-English translation show that our method can substantially improve the translation quality.

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

statistical machine translation
bidirectional language model


BirdVis: Visualizing and Understanding Bird Populations Birds are unrivaled windows into biotic processes at all levels and are proven indicators of ecological well-being. Understanding the determinants of species distributions and their dynamics is an important aspect of ecology and is critical for conservation and management. Through crowdsourcing, since 2002, the eBird project has been collecting bird observation records. These observations, together with local-scale environmental covariates such as climate, habitat, and vegetation phenology have been a valuable resource for a global community of educators, land managers, ornithologists, and conservation biologists. By associating environmental inputs with observed patterns of bird occurrence, predictive models have been developed that provide a statistical framework to harness available data for predicting species distributions and making inferences about species-habitat associations. Understanding these models, however, is challenging because they require scientists to quantify and compare multiscale spatial-temporal patterns. A large series of coordinated or sequential plots must be generated, individually programmed, and manually composed for analysis. This hampers the exploration and is a barrier to making the cross-species comparisons that are essential for coordinating conservation and extracting important ecological information. To address these limitations, as part of a collaboration among computer scientists, statisticians, biologists and ornithologists, we have developed BirdVis, an interactive visualization system that supports the analysis of spatio-temporal bird distribution models. BirdVis leverages visualization techniques and uses them in a novel way to better assist users in the exploration of interdependencies among model parameters. Furthermore, the system allows for comparative visualization through coordinated views, providing an intuitive interface to identify relevant correlations and patterns. We justify our design decisions and present case studies that show how BirdVis has helped scientists obtain new evidence for existing hypotheses, as well as formulate new hypotheses in their domain.

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

ornithology
species distribution models
multiscale analysis
spatial data
temporal data


Adaptive neural decentralized control for strict feedback nonlinear interconnected systems via backstepping An approximation based adaptive neural decentralized output tracking control scheme for a class of large-scale unknown nonlinear systems with strict-feedback interconnected subsystems with unknown nonlinear interconnections is developed in this paper. Within this scheme, radial basis function RBF neural networks are used to approximate the unknown nonlinear functions of the subsystems. An adaptive neural controller is designed based on the recursive backstepping procedure and the minimal learning parameter technique. The proposed decentralized control scheme has the following features. First, the controller singularity problem in some of the existing adaptive control schemes with feedback linearization is avoided. Second, the numbers of adaptive parameters required for each subsystem are not more than the order of this subsystem. Lyapunov stability method is used to prove that the proposed adaptive neural control scheme guarantees that all signals in the closed-loop system are uniformly ultimately bounded, while tracking errors converge to a small neighborhood of the origin. The simulation example of a two-spring interconnected inverted pendulum is presented to verify the effectiveness of the proposed scheme.

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

adaptive neural
rbf neural networks
backstepping
decentralized control


Issues in linking information technology capability to firm performance The resource-based view has been proposed to investigate the impact of information technology (IT) investments on firm performance. Researchers have shown that a firm's ability to effectively leverage its IT investments by developing a strong IT capability can result in improved firm performance. We test the robustness of this approach and examine several related issues. Our results indicate that firms with superior IT capability indeed exhibit superior current and sustained firm performance when compared to average industry performance, even after adjusting for effects of prior firm performance. However, the differences in the results from various analyses suggest that the impact of "halo effects" and prior financial performance of firms must be taken into consideration in future tests of IT capability, Further, it is critical to develop theoretically derived multidimensional measures of IT capability in order to continue to apply the RBV approach to assess the impact of IT investments on firm performance.

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


A vision system for an underwater cable tracker Nowadays, the surveillance and inspection of underwater installations, such as power and telecommunication cables and pipelines, is carried out by operators that, being on the surface, drive a remotely operated vehicle (ROV) with cameras mounted over it. This is a tedious and high time-consuming task, easily prone to errors mainly because of loss of attention or fatigue of the human operator. Besides, the complexity of the task is increased by the lack of quality of typical seabed images, which are mainly characterised by blurring, non-uniform illumination, lack of contrast and instability in the vehicle motion. In this study, the development of a vision system guiding an autonomous underwater vehicle (AUV) able to detect and track automatically an underwater power cable laid on the seabed is the main concern. The vision system that is proposed tracks the cable with an average success rate above 90%. The system has been tested using sequences coming from a video tape obtained in several tracking sessions of various real cables with a ROV driven from the surface. These cables were installed several years ago, so that the images do not present highly contrasted cables over a sandy seabed; on the contrary, these cables are partially covered in algae or sand, and are surrounded by other algae and rocks, thus making the sequences highly realistic.

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

features detection and tracking
image sequences
autonomous underwater vehicles
pipeline inspection


A one-point compactification for lattice-valued convergence spaces We define a lattice-valued one-point compactification for a non-compact lattice-valued T2-space and find criteria when it is smaller than another T2-compactification of the same space. Also the concept of local boundedness is introduced and characterized using the lattice-valued one-point compactification and the lattice-valued Richardson compactification. (C) 2011 Elsevier B.V. All rights reserved.

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

richardson compactification
local boundedness

l-fuzzy convergence
l-topology
l-filter
l-convergence space
compactness
one-point compactification
roundedness


A velocity divergence constraint for large-eddy simulation of low-Mach flows The velocity divergence (rate of fluid volumetric expansion) is a flow field quantity of fundamental importance in low-Mach flows. It directly affects the local mass density and therefore the local temperature through the equation of state. In this paper, starting from the conservative form of the sensible enthalpy transport equation, we derive a discrete divergence constraint for use in large-eddy simulation (LES) of low-Mach flows. The result accounts for numerical transport of mass and energy, which is difficult to eliminate in relatively coarse, engineering LES calculations when total variation diminishing (TVD) scalar transport schemes are employed. Without the correction terms derived here, unresolved (numerical) mixing of gas species with different heat capacities or molecular weights may lead to erroneous mixture temperatures and ultimately to an imbalance in the energy budget. The new formulation is implemented in a publicly available LES code called the Fire Dynamics Simulator (FDS). Accuracy of the flow solver for transport is demonstrated using the method of manufactured solutions. The conservation properties of the present scheme are demonstrated on two simple energy budget test cases, one involving a small fire in a compartment with natural ventilation and another involving mixing of two gases with different thermal properties.

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

large-eddy simulation
low-mach flow
projection scheme


An analog-digital merged neural circuit using pulse width modulation technique This paper presents a neural circuit using PWM technique based on an analog-digital merged circuit architecture. Some new PWM circuit techniques are proposed. A bipolar-weighted summation circuit is described which attains 8-bit precision in SPICE simulation at 5V supply voltage by compensating parasitic capacitance effects. A high performance differential-type latch comparator which can discriminate 1 mV difference at 100 MHz in SPICE simulation is also described. Next, we present a prototype chip fabricated using a 0.6 mu m CMOS process. The measurement results demonstrate that the overall precision in the weighted summation and the sigmoidal transformation is 5 bits. A neural network has been constructed using the prototype chips, and the experimental results for realizing the XOR function have successfully verified the basic neural operation.

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

lsi implementation
neural networks
pulse-width modulation


Bi-objective feature selection for discriminant analysis in two-class classification This works deals with the problem of selecting variables (features) that are subsequently used in discriminant analysis. The aim is to find, from a set of m variables, smaller subsets which enable an efficient classification of cases in two classes. We consider two objectives, each one associated with the misclassification error in each class (type I and type II errors). Thus, we establish a bi-objective problem and develop an algorithm based on the NSGA-II strategy to this specific problem, in order to obtain a set of non-dominated solutions. Managing these two objectives separately (and not jointly) allows an enhanced analysis of the obtained solutions by observing the approach to efficient frontier. This is especially significant when each type of error has a different level of importance or when they cannot be compared. To illustrate these issues, several known databases from literature are used, as well as an additional database with several Spanish firms featured by financial variables and two classes: creditworthy and non-creditworthy. Finally, we show that when solutions obtained by our NSGA-II implementation are evaluated from the classic mono-objective perspective (minimizing the ratio of both error types jointly) they are better than those obtained by classic methods for feature selection and similar than those provided by other recently published methods.

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

classification
discriminant analysis
feature selection

bi-objective optimization
nsga-ii algorithm


comparative analysis of hurst techniques In the paper is presented an algorithm of Durbin-Levinson for self-similar network traffic simulation. The key problem of self-similar processes studying is estimating the Hurst parameter. Determination the best Hurst techniques in the sense of Hurst parameter accuracy for network traffic simulation is based on comparative analyses between different estimators. The obtained results of investigation Hurst techniques shown that the periodogramm and wavelet-based estimators are the least biased in the sense of the accuracy of Hurst parameter.

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

self-similar traffic
fractional gaussian noise


On signal representations within the Bayes decision framework This work presents new results in the context of minimum probability of error signal representation (MPE-SR) within the Bayes decision framework. These results justify addressing the MPE-SR criterion as a complexity-regularized optimization problem, demonstrating the empirically well understood trade-off between signal representation quality and learning complexity. Contributions are presented in three folds. First, the stipulation of conditions that guarantee a formal tradeoff between approximation and estimation errors under sequence of embedded transformations are provided. Second, the use of this tradeoff to formulate the MPE-SR as a complexity regularized optimization problem, and an approach to address this oracle criterion in practice is given. Finally, formal connections are provided between the MPE-SR criterion and two emblematic feature transformation techniques used in pattern recognition: the optimal quantization problem of classification trees (CART tree pruning algorithms), and some versions of Fisher linear discriminant analysis (LDA).

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

signal representation
bayes decision framework
linear discriminant analysis

minimum risk decision
estimation-approximation error tradeoff
complexity regularization
mutual information
decision trees


Dynamics of human categorization in a collaborative tagging system: How social processes of semantic stabilization shape individual sensemaking We study how categories people develop in collaborative tagging change over time. Their internal cognitive categories and the tags they use are coordinated. Especially groups converging in the use of terms develop differentiated categories. Social processes around shared artefacts have a mediating effect on learning.

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

categorization
sensemaking
collaborative tagging


Estimating the rate constant in second-order kinetics using hard-soft-net analyte signal (HS-NAS) method Rank deficiency is the major problem associated with the chemometrics modeling of the second-order chemical reactions of the form of A + B -> C. In this article, the application of the hard-soft-net analyte signal (HS-NAS), as a newly proposed method in our research group, is described for modeling of second-order reactions. This combined hard-soft method is based on the net analyte signal (NAS) concept, which is defined as a part of total signal that is directly related to the concentration of the component of interest. Therefore, concentration changes versus time can be obtained by calculating NAS for any chemical species involved in the reaction without requiring any pure component spectra or extra runs. The power of the method was verified by applying it to the resolution of simulated data sets containing noises added at different levels. The resolution of the second-order reaction between amoxicillin and 1,2-naphthoqoinone was also tested as a real chemical system. (C) 2010 Elsevier B.V. All rights reserved.

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


a cluster-based scheduling for object detection in wireless multimedia sensor networks Network lifetime is always an important topic in wireless sensor networks. The case of Wireless Multimedia Sensor Networks present additional features such as the fact of transmitting multimedia rich data or the fact of having directional sensing areas. This paper presents a scheduling scheme for clustered nodes according to overlapped Field of View (FoV) regions. This approach schedules nodes applying coordination and collaborations among members of clusters to sense the environment while each cluster covers a specific region defined by the degree of overlapping FoV. The objective of this mechanism is to increase power conservation by avoiding similar sensing and redundant processing. Evaluation shows that the proposed scheduling reduces the average energy consumption and thus improves network lifetime.

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

field of view
object detection
scheduling
coordination

wireless multimedia sensor network
collaboration
clustering


Noise reduction in magnetocardiography by singular value decomposition and independent component analysis In the routine recording of magnetocardiograms (MCGs), it is necessary to underline the problem of noise cancellation. Source separation has often been suggested to solve this problem. In this paper, blind source separation (BSS), by means of singular value decomposition (SVD) and independent component analysis (ICA), was used for noise reduction in MCG data to improve the signal to noise ratio. Special techniques, based on statistical parameters, for identifying noise and disturbances, have been introduced to automatically eliminate noise-related and disturbance-related components before reconstructing cleaned data sets. The results show that ICA and SVD can detect and remove a variety of noise and artefact sources from MCG data, as well as from stress MCG.

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

magnetocardiography
noise reduction
independent component analysis
singular value decomposition


Exploring semantics in activity recognition using context lattices Studying human activities has significant implication in human beneficial applications such as personal healthcare. This research has been facilitated by the development of sensor technologies in pervasive computing with a large quantity of observational data collected about environments and user actions. By mining these data, traditional machine learning techniques have made great progress in recognising activities, but due to the increasing number of sensors and complexity of activities, they are subject to feasibility and scalability. These techniques may benefit from the inclusion of semantic information about the nature and relationships of sensor data and activities being observed. We introduce a new data structure, the context lattice, which allows designers to capture and explore this sort of knowledge. We demonstrate how context lattices can be used to infer human activities with the inclusion of such knowledge. We present comprehensive evaluations of the system against two third-party smart-home data sets, and demonstrate that our approach compares favourably with traditional analytic techniques in many circumstances. We conclude with a discussion of the strengths and weaknesses of context lattices in activity recognition.

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


Those "psychological tools" inside the design process In this paper, we present an interaction-oriented approach to the process of designing a document for the end-user. We emphasize exchange between subjects and the subjects' relationship with their environment. The analysis of verbal exchanges offers a way to apprehend such a situated collective. We attempt to unveil the cognitive processes underlying this task with special attention paid to the collective's ability to find in its environment the resources permitting the emergence of shared knowledge. We focus on this object's role as a vehicle for emergence and on its inscription in an interactional dynamics. (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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

situated action
distributed cognition
object


A novel biometric personal verification system based on the combination of palmprints and faces This paper presents it bimodal biometric verification system based on the fusion of palmprint and face features at the matching-score level. The system combines a new approach to palmprint principal lines recognition based on hypotheses generation and evaluation and the well-known eigenfaces approach for face recognition. The experiments with different matching-score normalization techniques have been performed in order to improve the performance of the fusion at the matching-score level. A "chimerical" database consisting of 1488 palmprint and face image pairs of 241 persons was used in the system design (440 image pairs of 110 persons) and testing (1048 image pairs of 131 persons). The experimental results show that system performance is significantly improved over unimodal subsystems.

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

verification normalization fusion palmprint face


Automatic

generation

of

outdoor

and

indoor

building

scenes

from

a

single

image

In

this

paper,

a

novel

approach

for

creating

models

of

building

scenes

is

presented.

The

proposed

method

is

fully

automated

and

fast,

and

accurately

reconstructs

both

outdoor

images

of

a

building

and

indoor

scenes,

with

perspective

cues

in

real-time,

using

only

one

image.

It

combines

the

extracted

line

segments

to

identify

the

vanishing

points

of

the

image,

the

orientation,

the

different

planes

that

are

depicted

in

the

image

and

concludes

whether

the

image

depicts

indoor

or

outdoor

scenes.

In

addition,

the

proposed

method

efficiently

eliminates

the

perspective

distortion

and

produces

an

accurate

model

of

the

scene

without

any

intervention

from

the

user.

The

main

innovation

of

the

method

is

that

it

uses

only

one

image

for

the

reconstruction,

while

other

state-of-the-art

methods

rely

on

the

processing

of

multiple

images.

A

website

and

a

database

of

images

were

created

to

prove

the

efficiency

of

the

proposed

method

in

terms

of

time

needed

for

the

reconstruction,

its

automation

and

model

accuracy

and

can

be

used

by

anyone

so

as

to

easily

produce

user-generated

content:

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

single-view 3d reconstruction
projective correction
vanishing point detection
uncalibrated camera


A Delay-Oriented Prioritization Policy Based on Cooperative Lossless Buffering in PTN Domains New kinds of services and data flows, such as cloud computing, server virtualization, or quality of service (QoS)-aware Internet services, have led to higher demands on network resources. Thus, they have also led to increased bandwidth consumption and unexpected congestion, especially in backbones. In this article a novel proposal is studied, with the aim of improving the performance of delay-sensitive flows. The congestion impact on those QoS-aware flows that require a high level of reliability and delay is analyzed. This management proposal has been implemented on multiprotocol label switching transport profile (MPLS-TP), which is a packet transport networks technology that provides QoS by means of flow differentiation in Internet backbones. In order to improve performance in congested networks, a guarantee of service is proposed. It allows local recovery of lost traffic of MPLS-TP privileged flows, and in order to fulfill the requirements for implementation on MPLS-TP, a minimum set of extensions to RSVP-TE has also been proposed to provide self-management capable routes. Finally, in this paper we have carried out a performance improvement measurement by means of an analytical model and simulations.

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


An R package for implementing simulations for seamless phase II/III clinical trials using early outcomes for treatment selection ? Adaptive seamless phase II/III clinical trial designs allowing treatment selection at an interim analysis have gained much attention because of their potential benefits compared to more conventional drug development programmes with separate trials for individual phases. A scenario of particular interest is that in which the final outcome in the trial is based on long-term follow-up, but the interim analysis can only realistically be based on early (short-term) outcomes. A new software package (asd) for the statistical software R implements simulations for designs of this type, in addition to the simpler scenario where treatment selection is based on the definitive (final) outcome. The methodology is briefly described and two examples of proposed trial designs in progressive multiple sclerosis are provided, with R code to illustrate application of the methodology.

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


Multi-objective evolutionary algorithms for fuzzy classification in survival prediction This paper presents a novel rule-based fuzzy classification methodology for survival/mortality prediction in severe burnt patients. Due to the ethical aspects involved in this medical scenario, physicians tend not to accept a computer-based evaluation unless they understand why and how such a recommendation is given. Therefore, any fuzzy classifier model must be both accurate and interpretable. The proposed methodology is a three-step process: (1) multi-objective constrained optimization of a patient's data set, using Pareto-based elitist multi-objective evolutionary algorithms to maximize accuracy and minimize the complexity (number of rules) of classifiers, subject to interpretability constraints; this step produces a set of alternative (Pareto) classifiers; (2) linguistic labeling, which assigns a linguistic label to each fuzzy set of the classifiers; this step is essential to the interpretability of the classifiers; (3) decision making, whereby a classifier is chosen, if it is satisfactory, according to the preferences of the decision maker. If no classifier is satisfactory for the decision maker, the process starts again in step (1) with a different input parameter set. The performance of three multi-objective evolutionary algorithms, niched pre-selection multi-objective algorithm, elitist Pareto-based multi-objective evolutionary algorithm for diversity reinforcement (ENORA) and the non-dominated sorting genetic algorithm (NSGA-II), was tested using a patient's data set from an intensive care burn unit and a standard machine learning data set from an standard machine learning repository. The results are compared using the hypervolume multi-objective metric. Besides, the results have been compared with other non-evolutionary techniques and validated with a multi-objective cross-validation technique. Our proposal improves the classification rate obtained by other non-evolutionary techniques (decision trees, artificial neural networks, Naive Bayes, and case-based reasoning) obtaining with ENORA a classification rate of 0.9298, specificity of 0.9385, and sensitivity of 0.9364, with 14.2 interpretable fuzzy rules on average. Our proposal improves the accuracy and interpretability of the classifiers, compared with other non-evolutionary techniques. We also conclude that ENORA outperforms niched pre-selection and NSGA-II algorithms. Moreover, given that our multi-objective evolutionary methodology is non-combinational based on real parameter optimization, the time cost is significantly reduced compared with other evolutionary approaches existing in literature based on combinational optimization.

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


Reconstruction of segmentally articulated structure in freeform movement with low density feature points Though a large body of research has focused on tracking and identifying objects from the domain of colour or grey-scale images, there is a relative dearth in the literature on complex articulated/non-rigid motion reconstruction from a collection of low density feature points. In this paper, we propose a segment-based articulated matching algorithm to establish a crucial self-initialising identification in model-based point-feature tracking of articulated motion with near-rigid segments. We avoid common assumptions such as pose similarity or small motion with respect to the model, and assume no prior knowledge of a specific movement from which to restrict pose identification. Experimental results based on synthetic pose and real-world human motion capture data demonstrate the ability of the algorithm to perform the identification task.

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

articulated point matching
non-rigid pose estimation
affine transformation
motion tracking and object recognition


Regularized correntropy criterion based feature extraction for novelty detection In this paper, a novel feature extraction method based on regularized correntropy criterion (FEND-RCC) is proposed for novelty detection. In FEND-RCC, the presented criterion aims to maximize the difference between the correntropy of the normal data with their mean and the correntropy of the novel data with the mean of the normal data. Moreover, the optimal projection vectors in the objective function of FEND-RCC are iteratively obtained by the half-quadratic optimization technique. Experimental results on two synthetic data sets and thirteen benchmark data sets for novelty detection demonstrate that FEND-RCC is superior to its related approaches.

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

novelty detection
feature extraction
correntropy


quantum chromodynamics simulation on nwt A portable QCD simulation program running on NWT with 128 PE's shows the performance 0.032 micro sec/link update, which is about 189 times faster than a highly optimized code on CRAY X-MP/48 with four processors. The performance corresponds to 178 GFLOPS sustained speed.

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

lattice quantum chromo dynamics (qcd)
parallel computation
quantum physics
numerical wind tunnel (nwt)
monte carlo


Evolutionary Extreme Learning Machine and Its Application to Image Analysis Extreme learning machine (ELM) and evolutionary ELM (E-ELM) were proposed as a new class of learning algorithm for single-hidden layer feedforward neural network (SLFN). In order to achieve good generalization performance, E-ELM calculates the error on a subset of testing data for parameter optimization. Since E-ELMemploys extra data for validation to avoid the overfitting problem, more samples are needed for model training. In this paper, the cross-validation strategy is proposed to be embedded into the training phase so as to solve the overtraining problem. Based on this new learning structure, two extensions of E-ELM are introduced. Experimental results demonstrate that the proposed algorithms are efficient for image analysis.

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


Implementing a class of structural change tests: An econometric computing approach The implementation of a recently suggested class of structural change tests, which test for parameter instability in general parametric models, in the R language for statistical computing is described: Focus is given to the question how the conceptual tools can be translated into computational tools that reflect the properties and flexibility of the underlying econometric methodology while being numerically reliable and easy to use. More precisely, the class of generalized M-fluctuation tests is implemented in the package strucchange providing easily extensible functions for computing empirical fluctuation processes and automatic tabulation of critical values for a functional capturing excessive fluctuations. Traditional significance tests are supplemented by graphical methods which do not only visualize the result of the testing procedure but also convey information about the nature and timing of the structural change and which component of the parametric model is affected by it. (C) 2005 Elsevier B.V. All rights reserved.

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

econometric computing
r
structural change


The Contrapositive of Countable Choice for Inhabited Sets of Naturals Within a fairly weak formal theory of numbers and number-theoretic sequences we give a direct proof of the contrapositive of countable finite choice for decidable predicates. Our proof is at the same time a proof of a stronger form of it. In that way we think that we improve a proof given by Diener and Schuster. Within the same theory we prove properties of inhabited sets of naturals satisfying the general contrapositive of countable choice. Extending our base theory with the continuity principle, we prove that each such set is finite. In that way we generalize a result of Veldman, who proved, actually within the same extension, the finiteness of these sets, supposing additionally their decidability.

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


A linear time algorithm for computing the most reliable source on a series-parallel graph with unreliable edges Given a network with n vertices and m edges where each edge has an independent operational probability, we are interested in finding a vertex of the network whose expected number of reachable vertices is maximum. Such a vertex is called a most reliable sourer of the network. This problem was studied by Melachrinoudis and Helander (1996) where an O(n(2)) time algorithm was proposed when the given network is a tree. In a more recent paper, Xue presented an O(n) time algorithm for this problem when the given network is a tree, in this paper, we present an O(n) time algorithm for computing the most reliable source on series-parallel graphs, using their embeddings in 2-trees. (C) 1998-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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

algorithms
time complexity
partial 2-trees
series-parallel graph
network reliability


Linezolid, the first oxazolidinone antibacterial agent Linezolid (Zyvox) is the first member of an entirely new class of antibiotics to reach the market in over 35 years; it was approved for use in 2000. A member of the oxazolidinone class of antibiotics, linezolid is highly effective for the treatment of serious Gram-positive infections and has activity that compares favorably with vancomycin for most clinically relevant pathogens. Zyvox is approved for use against serious Gram-positive infections, including those caused by Streptococcus pneumoniae, and the very challenging methicillin-resistant Staphylococcus aureus and vancomycin-resistant Enterococcus faecium organisms. Zyvox inhibits bacterial protein synthesis by binding to 23S rRNA in the catalytic site of the 50S ribosome. It can be administered both orally and intravenously and has good tissue distribution. Recent results have demonstrated that oxazolidinone analogs related to linezolid are effective in treating pulmonary tuberculosis caused by resistant Mycobacterium tuberculosis in animal infection models and suggest additional new therapeutic applications for these antibiotics.

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


Reducing the HPC-datastorage footprint with MAFISCMultidimensional Adaptive Filtering Improved Scientific data Compression Large HPC installations today also include large data storage installations. Data compression can significantly reduce the amount of data, and it was one of our goals to find out, how much compression can do for climate data. The price of compression is, of course, the need for additional computational resources, so our second goal was to relate the savings of compression to the costs it necessitates.

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


Sampling nested Archimedean copulas We give algorithms for sampling from non-exchangeable Archimedean copulas created by the nesting of Archimedean copula generators, where in the most general algorithm the generators may be nested to an arbitrary depth. These algorithms are based on mixture representations of these copulas using Laplace transforms. While in principle the approach applies to all nested Archimedean copulas, in practice the approach is restricted to certain cases where we are able to sample distributions with given Laplace transforms. Precise instructions are given for the case when all generators are taken from the Gumbel parametric family or the Clayton family; the Gumbel case in particular proves very easy to simulate.

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


Autoimmunity arising from bystander proliferation of T cells in an immune response model We study a mathematical model of immune response by T cells where the regulatory T cells (Treg) inhibit interleukin 2 secretion. The bystander proliferation to an immune response is modelled. We consider an asymmetry reflecting that the difference between the growth and death rates can be higher for the active T cells and Tregs than for the inactive. This asymmetry leads to a better understanding of the bystander proliferation. An exposure to a pathogen results in an increased proliferation rate of the bystander T cells. If the population of the bystander T cells becomes large enough, autoimmunity can arise, eventually after a long transient period. (C) 2010 Elsevier Ltd. All rights reserved.

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


Homogenization-based multivariable element method for pure torsion of composite shafts Application of the hybrid stress element to torsion of composite shafts is restricted, if the volume fraction of reinforcement is very large. The homogenization method is the most suitable for such problems because it gives not only the equivalent material properties but also detailed information of local fields with less computational cost. In this paper, the extension of the homogenization method to the pure torsion of composite shafts with reinforcing fibers aligned along its axis and the application of high performance multivariable elements are studied. The incompatible element based on a modified potential principle and the enhanced-strain element based on the HuWashizu principle are appropriate for the analysis of the representative unit cell, whereas the hybrid stress element is appropriate for the macro-homogenized problem. Numerical examples are provided and discussed.

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

homogenization
incompatible element
representative unit cell
torsion

composite shaft
enhanced-strain element
hybrid element


DETECTING WORMHOLE ATTACKS IN DELAY-TOLERANT NETWORKS Delay-tolerant networks are especially useful in providing mission-critical services including emergency scenarios and battlefield applications. However, DTNs are vulnerable to wormhole attacks, in which a malicious node records the packets at one location and tunnels them to another colluding node, which relays them locally into the network. Wormhole attacks are a severe threat to normal network operation in DTNs. In this article we describe various methods that have been developed to detect wormhole attacks. However, most of them cannot work efficiently in DTNs. To detect the presence of a wormhole attack, we propose a detection mechanism that exploits the existence of a forbidden topology in the network. We evaluated our approach through extensive simulations using both Random Way Point and Zebranet mobility models. Our results show that the proposed method can detect wormhole attacks efficiently and effectively in DTNs.

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

peer to peer computing
ad hoc networks
routing
routing protocols
network topology


An Aspect-Oriented Programming-based approach to software development for fault detection in measurement systems An Aspect-Oriented Programming-based approach to the development of software components for fault detection in automatic measurement systems is proposed. Faults are handled by means of specific software units, the aspects, in order to better modularize issues transversal to several components. As a case study, this approach was applied to the design of the fault detection software inside a flexible framework for magnetic measurements, developed at the European Organization for Nuclear Research (CERN). Experimental results of software modularity and performance measurements for comparing aspect- and object-oriented solutions in rotating coils tests on superconducting magnets are reported.

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

automatic measurement systems
fault detection
software development


Combining deterministic modelling with artificial neural networks for suspended sediment estimates The presented manuscript presents a novel approach to the applied ocean and coastal engineering problem of sediment concentration estimates. The approach has been developed on the basis of numerical modelling and with application of artificial neural networks. It has been demonstrated that the proposed methodology can be generalised onto near-by locations. Further generalisation must be tested before applying.

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

hydrodynamics
wind waves
artificial neural network
mermaid sound
western australia


Parallelisation of genetic algorithms for the 2-page crossing number problem Genetic algorithms (GAs) have been applied to solve the 2-page crossing number problem successfully, but since they work with one global population, the search time and space are limited. Parallelisation provides an attractive prospect to improve the efficiency and solution quality of GAs. This paper investigates the complexity of parallel genetic algorithms (PGAs) based on two evaluation measures: computation time to communication time and population size to chromosome size. Moreover, the paper unifies the framework of PGA models with the function PGA (subpopulation size, cluster size, migration period, topology), and explores the performance of PGAs for the 2-page crossing number problem. (C) 2006 Elsevier Inc. All rights reserved.

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

parallel genetic algorithms
evaluation measures


A simulated annealing algorithm based approach for balancing and sequencing of mixed-model U-lines It is known that two interrelated problems called as line balancing and model sequencing should be solved simultaneously for an efficient implementation of a mixed-model U-shape assembly line in a JIT (Just in Time) environment. On the other hand, three versions of assembly line balancing problem can be identified: Type I, Type II, and Type E. There are only two articles (Kara, Ozcan, & Peker, 2007a and Hamzadayi & Yildiz, 2012) related to simultaneous balancing and sequencing of mixed-model U-lines for minimizing the number of stations (Type 1 problem) by ignoring the fixed model sequence in the current literature. In this paper, a simulated annealing algorithm is proposed for solving a problem of type I by ignoring the fixed model sequence. Accordingly, simulated annealing based fitness evaluation approach proposed by Hamzadayi and Yildiz (2012) is enhanced by adding the tabu list, and inserted into the proposed algorithm. Implementation difficulties experienced in meta-heuristics based on solution modification for solving these types of problems are demonstrated. 'Absolute deviation of workloads' (ADW) is quite frequently used as performance criteria in the literature. It is found that ADW is an insufficient performance criterion for evaluating the performance of the solutions, and this is showed by means of an illustrative example. The parameters of the proposed algorithm are reviewed for calibrating the algorithm by means of Taguchi design of experiments. Performance of the proposed approach is tested through a set of test problems. The results of computational experiments indicate that the proposed approach is an effective method in solving simultaneous line balancing/model sequencing problems for mixed-model U-lines for minimizing the number of stations. (C) 2013 Elsevier Ltd. All rights reserved.

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

mixed-model u-shape balancing/sequencing problem


Structural parameters and dynamic loading identification from incomplete measurements: Approach and validation System identification is becoming more important in structural dynamic applications including structural model update, damage detection primarily due to the rapid increase in the number of damaged or deteriorated engineering structures, and load identification for remaining service life forecasting. Time-domain identification techniques based on measured vibration data, e.g. the least-squares estimation (LSE), have been studied for a relatively long time and shown to be useful. However, the traditional least-squares techniques require that all the external excitation measurements should be available, which may not be the case for many practical applications. In this paper, by introducing a weighted positive definite matrix to the objective function and a learning coefficient using the information in the previous iterations in the identification approach to improve the convergence performance, an alternative iterative approach for both structural parameters and dynamic loading identification, referred to as weighted adaptive iterative least-squares estimation with incomplete measured excitations (WAILSE-IME), was proposed. The accuracy, convergence, and robustness of the proposed approach was demonstrated via numerical simulation on a six-story shear building model with noise-free and different levels of noise-polluted structural dynamic response measurements. The effects of the positive weight matrix, the learning coefficient, and the sampling duration on the convergence and the accuracy of the proposed approach were discussed and the results were compared with available related literature results. Results show that the proposed approach can simultaneously identify structural parameters and unknown excitations within very limited iterations with high accuracy and shows its robustness even noise-polluted dynamic response measurements are utilized. Furthermore, the approach was validated via available experimental measurements for a four-story frame structure excited by impact excitations. The results show that the proposed approach is capable of identifying both structural parameters and the unmeasured excitations with acceptable accuracy and improved convergence.

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


RDFProv: A relational RDF store for querying and managing scientific workflow provenance Provenance metadata has become increasingly important to support scientific discovery reproducibility, result interpretation, and problem diagnosis in scientific workflow environments. The provenance management problem concerns the efficiency and effectiveness of the modeling, recording, representation, integration, storage, and querying of provenance metadata. Our approach to provenance management seamlessly integrates the interoperability, extensibility, and inference advantages of Semantic Web technologies with the storage and querying power of an RDBMS to meet the emerging requirements of scientific workflow provenance management. In this paper, we elaborate on the design of a relational RDF store, called RDFProv, which is optimized for scientific workflow provenance querying and management. Specifically, we propose: i) two schema mapping algorithms to map an OWL provenance ontology to a relational database schema that is optimized for common provenance queries; ii) three efficient data mapping algorithms to map provenance RDF metadata to relational data according to the generated relational database schema, and iii) a schema-independent SPARQL-to-SQL translation algorithm that is optimized on-the-fly by using the type information of an instance available from the input provenance ontology and the statistics of the sizes of the tables in the database. Experimental results are presented to show that our algorithms are efficient and scalable. The comparison with two popular relational RDF stores, Jena and Sesame, and two commercial native RDF stores, AllegroGraph and BigOWLIM, showed that our optimizations result in improved performance and scalability for provenance metadata management. Finally, our case study for provenance management in a real-life biological simulation workflow showed the production quality and capability of the RDFProv system. Although presented in the context of scientific workflow provenance management, many of our proposed techniques apply to general RDF data management as well.

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

provenance
scientific workflow
metadata management
ontology
rdf
owl
rdbms

sparql-to-sql translation
query optimization
rdf store


FFT Traffic Classification-Based Dynamic Selected IP Traffic Offload Mechanism for LTE HeNB Networks Traffic offloading is a promising technique to alleviate the traffic load in LTE core networks. Based on 3GPP SIPTO (Selected IP Traffic Offload) architecture, this paper proposes dynamic SIPTO mechanism (D-SIPTO) for traffic offloading in LTE HeNB networks, which combines fast fourier transform (FFT) based IP traffic classification scheme (FFTTCS) with the dynamic traffic offload path selection algorithm (DTOPSA). Simulation results show that FFTTCS can realize on-line traffic classification with similar precisions but only using less than 10 % of the time needed by existing methods. Combined with DTOPSA, the proposed D-SIPTO can reduce the core network traffic by 60 % while selecting the optimal offload path according to the type of traffic to be offloaded.

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

lte henb networks
traffic classification
traffic offload
fft


Interactive case-based planning for forest fire management This paper describes an AI system for planning the first attack on a forest fire. This planning system is based on two major techniques, case-based reasoning, and constraint reasoning, and is part of a decision support system called CHARADE. CHARADE is aimed at supporting the user in the whole process of forest fire management. The novelty of the proposed approach is mainly due to the use of a local similarity metric for case-based reasoning and the integration with a constraint solver in charge of temporal reasoning.

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

planning
local similarity metric
temporal reasoning

case-based reasoning
learning
constraint satisfaction


As-Rigid-As-Possible Surface Morphing This paper presents a new morphing method based on the "as-rigid-as-possible" approach. Unlike the original as-rigid-as-possible method, we avoid the need to construct a consistent tetrahedral mesh, but instead require a consistent triangle surface mesh and from it create a tetrahedron for each surface triangle. Our new approach has several significant advantages. It is much easier to create a consistent triangle mesh than to create a consistent tetrahedral mesh. Secondly, the equations arising from our approach can be solved much more efficiently than the corresponding equations for a tetrahedral mesh. Finally, by incorporating the translation vector in the energy functional controlling interpolation, our new method does not need the user to arbitrarily fix any vertex to obtain a solution, allowing artists automatic control of interpolated mesh positions.

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