A possible mechanism of stochastic resonance in the light of an extra-classical receptive field model of retinal ganglion cells Traditionally the intensity discontinuities in an image are detected as zero-crossings of the second derivative with the help of a Laplacian of Gaussian (LOG) operator that models the receptive field of retinal Ganglion cells. Such zero-crossings supposedly form a raw primal sketch edge map of the external world in the primary visual cortex of the brain. Based on a new operator which is a linear combination of the LOG and a Dirac-delta function that models the extra-classical receptive field of the ganglion cells, we find that zero-crossing points thus generated, store in presence of noise, apart from the edge information, the shading information of the image in the form of density variation of these points. We have also shown that an optimal image contrast produces best mapping of the shading information to such zero-crossing density variation for a given amount of noise contamination. Furthermore, we have observed that an optimal amount of noise contamination reproduces the minimum optimal contrast and hence gives rise to the best representation of the original image. We show that this phenomenon is similar in nature to that of stochastic resonance phenomenon observed in psychophysical experiments.

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

extra-classical receptive field
zero-crossing map
low-level vision


term feedback for information retrieval with language models In this paper we study term-based feedback for information retrieval in the language modeling approach. With term feedback a user directly judges the relevance of individual terms without interaction with feedback documents, taking full control of the query expansion process. We propose a cluster-based method for selecting terms to present to the user for judgment, as well as effective algorithms for constructing refined query language models from user term feedback. Our algorithms are shown to bring significant improvement in retrieval accuracy over a non-feedback baseline, and achieve comparable performance to relevance feedback. They are helpful even when there are no relevant documents in the top.

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


Novel dynamics in the nonlinear evolution of the Kelvin-Helmholtz instability of supersonic anisotropic tangential velocity discontinuities A nonlinear stability analysis using a multiple-scales perturbation procedure is performed for the instability of two layers of immiscible, strongly anisotropic, magnetized, inviscid, arbitrarily compressible fluids in relative motion. Such configurations are of relevance in a variety of astrophysical and space configurations. For modes near the critical point of the linear neutral curve, the nonlinear evolution of the amplitude of the linear fields on the slow first-order scales is shown to be governed by a complicated nonlinear Klein-Gordon equation. The nonlinear coefficient turns out to be complex, which is, to the best of our knowledge, unlike previously considered cases and leads to completely different dynamics from that reported earlier. Both the spatially-dependent and space-independent versions of this equation are considered to obtain the regimes of physical parameter space where the linearly unstable solutions either evolve to final permanent envelope wave patterns resembling the ensembles of interacting vortices observed empirically, or are disrupted via nonlinear modulation instability. In particular, the complex nonlinearity allows the existence of quasi-periodic and chaotic wave envelopes, unlike in earlier physical models governed by nonlinear Klein-Gordon equations. (C) 2001 IMACS. Published by Elsevier Science B.V. All rights reserved.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 instability
compressible anisotropic
quasi-periodicity
chaos


UFOme: An ontology mapping system with strategy prediction capabilities Ontology mapping, or matching, aims at identifying correspondences among entities in different ontologies. Several strands of research come up with algorithms often combining multiple mapping strategies to improve the mapping accuracy. However, few approaches have systematically investigated the requirements of a mapping system both from the functional (i.e., the features that are required) and user point of view (i.e., how the user can exploit these features). This paper presents an ontology mapping software framework that has been designed and implemented to help users (both expert and non-expert) in designing and/or exploiting comprehensive mapping systems. It is based on a library of mapping modules implementing functions such as discovering mappings or evaluating mapping strategies. In particular, the strategy predictor module of the designed framework, for each specific mapping task, can predict mapping modules to be exploited and parameter values (e.g., weights and thresholds). The implemented system, called UFOme, assists users during the various phases of a mapping task execution by providing a user friendly ontology mapping environment. The UFOme implementation and its prediction capabilities and accuracy were evaluated on the Ontology Alignment Evaluation Initiative tests with encouraging results.

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

automatic ontology mapping strategy prediction


Ironclad C plus plus A Library-Augmented Type-Safe Subset of C plus The C++ programming language remains widely used, despite inheriting many unsafe features from C-features that often lead to failures of type or memory safety that manifest as buffer overflows, use-after-free vulnerabilities, or abstraction violations. Malicious attackers can exploit such violations to compromise application and system security. This paper introduces Ironclad C++, an approach to bringing the benefits of type and memory safety to C++. Ironclad C++ is, in essence, a library-augmented, type-safe subset of C++. All Ironclad C++ programs are valid C++ programs that can be compiled using standard, off-the-shelf C++ compilers. However, not all valid C++ programs are valid Ironclad C++ programs: a syntactic source-code validator statically prevents the use of unsafe C++ features. To enforce safety properties that are difficult to check statically, Ironclad C++ applies dynamic checks via templated "smart pointer" classes. Using a semi-automatic refactoring tool, we have ported nearly 50K lines of code to Ironclad C++. These benchmarks incur a performance overhead of 12% on average, compared to the original unsafe C++ code.

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

performance
security
c plus
memory safety

languages
reliability
type safety
local pointers


Modelling compression behaviour of delaminated composite panels In this work, a numerical tool was developed to take into account the fundamental phenomena involved in the compressive behaviour of composite panels with through-the-width and embedded delaminations. The modified virtual crack closure technique was applied to evaluate the delamination growth phenomenon. Stable and unstable propagations were considered in our analyses; the latter required some modifications in the numerical non-linear algorithm used in the analyses. First of all, a comparison with experimental data was performed to test the effectiveness of the numerical tool; then, a sensitivity analysis was introduced to underline the influence of delaminations' position along the thickness and their growth on the compressive behaviour.

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


On Total Unimodularity of EdgeEdge Adjacency Matrices We consider total unimodularity for edgeedge adjacency matrices that represent adjacency relations between pairs of edges in a graph. These matrices appear in integer programming formulations of the minimum maximal matching problem, the edge dominating set problem, and so on.

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


Extensibility of finite element class systemsa case study The paper deals with the robustness and extensibility of class systems for finite element analysis. The extension of an existing system designed for linear elastic problems to handle non-linearity is used as a case study. Only one substantive change was required to the existing classes in order to extend the system. The other changes involved the addition of new classes, and in these the additional code required was close to the minimum possible. The system does rely heavily on controlled typecasting. Therefore, an alternative system was developed which used iterators. This produced a system that did not require typecasting. The use of the object-oriented approach also allowed sub-structure based algorithms to be implemented in a straightforward manner, and thus to implement more flexible and efficient algorithms.

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


video watercolorization using bidirectional texture advection In this paper, we present a method for creating watercolor-like animation, starting from video as input. The method involves two main steps: applying textures that simulate a watercolor appearance; and creating a simplified, abstracted version of the video to which the texturing operations are applied. Both of these steps are subject to highly visible temporal artifacts, so the primary technical contributions of the paper are extensions of previous methods for texturing and abstraction to provide temporal coherence when applied to video sequences. To maintain coherence for textures, we employ texture advection along lines of optical flow. We furthermore extend previous approaches by incorporating advection in both forward and reverse directions through the video, which allows for minimal texture distortion, particularly in areas of disocclusion that are otherwise highly problematic. To maintain coherence for abstraction, we employ mathematical morphology extended to the temporal domain, using filters whose temporal extents are locally controlled by the degree of distortions in the optical flow. Together, these techniques provide the first practical and robust approach for producing watercolor animations from video, which we demonstrate with a number of examples.

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

non-photorealistic rendering
abstract stylization
animated textures


Invariant surface alignment in the presence of affine and some nonlinear transformations In this paper, we introduce a non-iterative geometric-based method to align 3D brain surfaces into standard coordinate system, which is based on a novel set of surface landmarks (e.g., inflection and/or zero torsion points residing on parabolic contours), which are intrinsic and are computed from the differential geometry of the surface. This is in contrast to existing methods that depend on anatomical landmarks that require expert intervention to locate - a very hard task. The landmarks are local and are preserved under affine transformations. To reduce the sensitivity of the landmarks to noise, we use a B-Spline surface representation that smoothes out the surface prior to the computation of the landmarks. The alignment is achieved by establishing correspondences between the landmarks after a sorting of the landmarks based on derived absolute invariants (volumes confined between parallelepipeds spanned by sets of the landmark point quadruplets). The method is tested for intra- and inter-brain alignments while entertaining affine, cubic and fourth-order polynomial nonlinear transformations using distance mapping as well as comparison with an expert alignment, and promising results are obtained. When comparing our automatic alignment with that of an expert we arrived at complete agreement for the more difficult case of partial alignment of sectional slab materials of five rats with an atlas (a whole brain of rat). This perfect alignment was only based on the surface structure for our procedure, whereas it was based on the staining and the external and internal structures for the expert. (C) 2003 Published by Elsevier B.V.

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

intrinsic landmarks
b-spline
surface alignment and registration
affine invariants


a cache management object oriented simulation for mobile environments Cache management in a real world mobile user system is too complex to allow for an analytical evaluation through a realistic mobility model. The recently proposed location-dependent applications request the design of simulation and the development of internet benchmarks. This paper presents the design of a random walk simulator that captures the movement of mobile users in Personal Communications Services (PCS) networks. A novel mathematical model is used and the validity of the data fetched from the server to identify a reduced subset of neighboring cells used to simulate the data caching computing paradigm for mobile computing. We demonstrate the capabilities of the simulator by simulating three key cache management replacement policies and measure the cache hit ratio performance.

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


Defining the structure of DPCA models and its impact on process monitoring and prediction activities Dynamic Principal Component Analysis (DPCA) is an extension of Principal Component Analysis (PCA), developed in order to add the ability to capture the autocorrelative behavior of processes, to the existent and well-known PCA capability for modeling cross-correlation between variables. The simultaneous modeling of the dependencies along the "variable" and "time" modes, allows for a more compact and rigorous description of the normal behavior of processes, laying the ground for the development of, for instance, improved Statistical Process Monitoring (SPM) methodologies, able to robustly detect finer deviations from normal operation conditions. A key point in the application of DPCA is the definition of its structure, namely the selection of the number of time-shifted replicates for each variable to include, and the number of components to retain in the final model. In order to address the first of these two fundamental design aspects of DPCA, and arguably the most complex one, we propose two new lag selection methods. The first method estimates a single lag structure for all variables, whereas the second one refines this procedure, providing the specific number of lags to be used for each individual variable. The application of these two proposed methodologies to several case studies led to a more rigorous estimation of the number of lags really involved in the dynamical mechanisms of the processes under analysis. This feature can be explored for implementing improved system identification, process monitoring and process control tasks that rely upon a DPCA modeling framework. (c) 2013 Elsevier B.V. All rights reserved.

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

dynamic principal component analysis (dpca)

multivariate statistical process control (mspc)


Collaborative planning of inner-city-railway-tracks: A generic description of the geographic context and its dynamic integration in a collaborative multi-scale geometry modelling environment We describe the geographical context for planning inner-city-railway-tracks. We show how collaborative work with geographical information can be improved. We integrate the geographical context into a collaborative planning process. Combined and collaborative use of geo-information in planning tools is demonstrated. Results are validated using an actual real world scenario.

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

collaboration
synchronous work
procedural model
geo web services
gis


A simple functional neural network for computing the largest and smallest eigenvalues and corresponding eigenvectors of a real symmetric matrix Efficient computation of the largest eigenvalue and the smallest eigenvalue of a real symmetric matrix is a very important problem in engineering. Using neural networks to complete these operations is in an asynchronous manner and can achieve high performance. This paper proposes a concise functional neural network (FNN) expressed as a differential equation and designs steps to do this work. Firstly, the mathematical analytic solution of the equation is received, and then the convergence properties of this FNN are fully gained. Finally, the computing steps are designed in detail. The proposed method can compute the smallest eigenvalue and the largest eigenvalue whether the matrix is non-definite, positive definite or negative definite. Compared with other methods based on neural networks, this FNN is very simple and concise, so it is very easy to realize.

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

functional neural network
real symmetric matrix
eigenvalues
eigenvectors


Computationally efficient active rule detection method: Algorithm and architecture In this paper, a new active rule detection algorithm is proposed which is efficiently implemented in dedicated fuzzy processors. Here, its advantages are analytically attested. A novel realization architecture is proposed that has higher performance and uses lower hardware resources In comparison to the other reported architectures. The Structure of the proposed active rule detection unit is scalable in terms of the number of inputs, the number of membership functions and their bit widths. The proposed architecture is flexible in term of membership function shape as well. (C) 2008 Elsevier B.V. All rights reserved.

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

active rule detection
algorithm
architecture
scalable


An ID-based online/offline signature scheme without random oracles for wireless sensor networks Online/offline signature schemes allow one to quickly compute a digital signature from a precomputed coupon. In this paper, we present an ID-based online/offline signature for wireless sensor networks (WSNs), which is based on Hohenberger RSA signature (Crypto 09). We argue that due to significant reduction in costs of computation and storage, our scheme is particularly suitable for the WSNs environment with severely constrained resources. Our scheme can be proved secure under the factoring assumption without random oracles.

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

online/offline signature
hohenberger signature


Measurement based analysis of temporal behaviour as support for scheduling problems in parallel and distributed real-time systems ? Static analysis, based on scheduling techniques, provides the most typical approach for validation of real-time systems. However, in the case of complex real-time systems such as parallel and distributed systems, many simplifications are made in order to make analysis tractable. This means that even if the system can be statically validated, the real behaviour of the system in execution may be different enough from its theoretical behaviour to make it invalid. In these cases, an analysis based on measurement of the system in execution constitutes an invaluable aid to the static analysis. This article describes a methodology for the analysis of the temporal behaviour of parallel and distributed real-time systems with end-to-end constraints. The analysis is based on the measurement of a prototype of the system in execution and is supported by a behavioural model. The main components of the model are the sequences of activities throughout the system tasks (transactions), which are carried out in response to input events, causing the corresponding output events. Thus, the temporal behaviour of the system is viewed as a set of real-time transactions competing for the available resources. This article also includes experimental results of applying the methodology to the analysis of a well-known case study.

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 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 B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 and distributed systems
measurement


a discriminative framework for clustering via similarity functions Problems of clustering data from pairwise similarity information are ubiquitous in Computer Science. Theoretical treatments typically view the similarity information as ground-truth and then design algorithms to (approximately) optimize various graph-based objective functions. However, in most applications, this similarity information is merely based on some heuristic; the ground truth is really the unknown correct clustering of the data points and the real goal is to achieve low error on the data. In this work, we develop a theoretical approach to clustering from this perspective. In particular, motivated by recent work in learning theory that asks "what natural properties of a similarity (or kernel) function are sufficient to be able to learn well?" we ask "what natural properties of a similarity function are sufficient to be able to cluster well?" To study this question we develop a theoretical framework that can be viewed as an analog of the PAC learning model for clustering, where the object of study, rather than being a concept class, is a class of (concept, similarity function) pairs, or equivalently, a property the similarity function should satisfy with respect to the ground truth clustering. We then analyze both algorithmic and information theoretic issues in our model. While quite strong properties are needed if the goal is to produce a single approximately-correct clustering, we find that a number of reasonable properties are sufficient under two natural relaxations: (a) list clustering: analogous to the notion of list-decoding, the algorithm can produce a small list of clusterings (which a user can select from) and (b) hierarchical clustering: the algorithm's goal is to produce a hierarchy such that desired clustering is some pruning of this tree (which a user could navigate). We develop a notion of the clustering complexity of a given property (analogous to notions of capacity in learning theory), that characterizes its information-theoretic usefulness for clustering. We analyze this quantity for several natural game-theoretic and learning-theoretic properties, as well as design new efficient algorithms that are able to take advantage of them. Our algorithms for hierarchical clustering combine recent learning-theoretic approaches with linkage-style methods. We also show how our algorithms can be extended to the inductive case, i.e., by using just a constant-sized sample, as in property testing. The analysis here uses regularity-type results of [FK] and [AFKK].

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

learning
similarity functions
clustering


Harvesting heterogeneous renewable resources: Uncoordinated, selfish, team-, and community-oriented strategies Using the example of a fishing fleet harvesting in different fishing zones with different carrying capacities and growth rates, we investigate strategies for the exploitation of distributed renewable resources by a crowd of agents without centralized coordination. In agent-based simulations we compare the performance of uncoordinated random harvesting, team playing, selfish individualistic and community-oriented (Collective Intelligence or COIN) behaviours operating with long and short time-horizon planning. Demonstrating the usefulness of COIN-based harvesting, more cooperative long-term planning strategies are found to relieve the pressure on the resource, reduce fluctuations and diminish the risk of overharvesting. Further, the outcome of an evolutionary dynamics where strategies in the agent population spread proportional to relative economic performance are strongly influenced by the harvesting pressure. In order of decreasing resource abundance we find that first an uncoordinated random, then a cooperative COIN-strategy and later the selfish strategy for an overharvested resource dominate the agent population. We also report that increasing harvesting pressure increasingly favours short-term and more individualistic strategies.

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

sustainable resource exploitation
evolutionary stable strategies
agent-based model


An Improved Magma Gemm For Fermi Graphics Processing Units We present an improved matrix-matrix multiplication routine (General Matrix Multiply [GEMM]) in the MAGMA BLAS library that targets the NVIDIA Fermi graphics processing units (GPUs) using Compute Unified Data Architecture (CUDA). We show how to modify the previous MAGMA GEMM kernels in order to make a more efficient use of the Fermi's new architectural features, most notably their extended memory hierarchy and memory sizes. The improved kernels run at up to 300 GFlop/s in double precision and up to 645 GFlop/s in single precision arithmetic (on a C2050), which is correspondingly 58% and 63% of the theoretical peak. We compare the improved kernels with the currently available version in CUBLAS 3.1. Further, we show the effect of the new kernels on higher-level dense linear algebra (DLA) routines such as the one-sided matrix factorizations, and compare their performances with corresponding, currently available routines running on homogeneous multicore systems.

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

gpu blas
cuda matrix mutiply
hybrid computing


emerging cooperation on complex networks The dynamic formation of coalitions is a well-known area of interest in multi-agent systems (MAS). Coalitions can help self-interested agents to successfully cooperate and coordinate in a mutually beneficial manner. Moreover, the organization provided by coalitions is particularly helpful for large-scale MAS. In this paper we present a distributed approach for coalition emergence in large-scale MAS. In particular, we focus on MAS with agents interacting over complex networks since they provide a realistic model of the nowadays interconnected world (e.g. social networks). Our experiments show the effectiveness of our coalition emergence approach in achieving full cooperation over different complex networks. Furthermore, they provide a clear picture of the strong influence the topology has on coalition emergence.

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


Computer-aided detection of multiple sclerosis lesions in brain magnetic resonance images: False positive reduction scheme consisted of rule-based, level set method, and support vector machine The purpose of this study was to develop a computerized method for detection of multiple sclerosis (MS) lesions in brain magnetic resonance (MR) images. We have proposed a new false positive reduction scheme, which consisted of a rule-based method, a level set method, and a support vector machine. We applied the proposed method to 49 slices selected from 6 studies of three MS cases including 168 MS lesions. As a result, the sensitivity for detection of MS lesions was 81.5% with 2.9 false positives per slice based on a leave-one-candidate-out test, and the similarity index between MS regions determined by the proposed method and neuroradiologists was 0.768 on average. These results indicate the proposed method would be useful for assisting neuroradiologists in assessing the MS in clinical practice.

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

computerized method
detection of multiple sclerosis
false positive reduction scheme
level set method
support vector machine


Incremental network design with shortest paths We study the optimal choice and timing of network expansions. We introduce a new class of incremental network design problems. We develop a 4-approximation algorithm for incremental network design with shortest paths. Analysis shows that coordinating timing of expansions increases the complexity of network design.

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

multi-period
heuristic
approximation algorithm
integer programming


A neural model of selective attention and object segmentation in the visual scene: An approach based on partial synchronization and star-like architecture of connections ? A brain-inspired computational system is presented that allows sequential selection and processing of objects from a visual scene. The system is comprised of three modules. The selective attention module is designed as a network of spiking neurons of the HodgkinHuxley type with star-like connections between the central unit and peripheral elements. The attention focus is represented by those peripheral neurons that generate spikes synchronously with the central neuron while the activity of other peripheral neurons is suppressed. Such dynamics corresponds to the partial synchronization mode. It is shown that peripheral neurons with higher firing rates are preferentially drawn into partial synchronization. We show that local excitatory connections facilitate synchronization, while local inhibitory connections help distinguishing between two groups of peripheral neurons with similar intrinsic frequencies. The module automatically scans a visual scene and sequentially selects regions of interest for detailed processing and object segmentation. The contour extraction module implements standard image processing algorithms for contour extraction. The module computes raw contours of objects accompanied by noise and some spurious inclusions. At the next stage, the object segmentation module designed as a network of phase oscillators is used for precise determination of object boundaries and noise suppression. This module has a star-like architecture of connections. The segmented object is represented by a group of peripheral oscillators working in the regime of partial synchronization with the central oscillator. The functioning of each module is illustrated by an example of processing of the visual scene taken from a visual stream of a robot camera.

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

selective visual attention
oscillatory neural network


Risk bounds for random regression graphs We consider the regression problem and describe an algorithm approximating the regression function by estimators piecewise constant on the elements of an adaptive partition. The partitions are iteratively constructed by suitable random merges and splits, using cuts of arbitrary geometry. We give a risk bound under the assumption that a "weak learning hypothesis" holds, and characterize this hypothesis in terms of a suitable RKHS. Two examples illustrate the general results in two particularly interesting cases.

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

regression graph
reproducing kernel hilbert space


Optimal Tuning of PID Controller using Adaptive Hybrid Particle Swarm Optimization Algorithm Particle swarm optimization (PSO) has proved its ability as an efficient search tool in many optimization problems. However, PSO is easy to be trapped into local minima due to its mechanism in information sharing. Under this circumstance, all the particles could quickly converge to a position by the attraction of the best particle; all particles could hardly be improved. To overcome premature convergence of the standard PSO algorithm, this paper presents an adaptive hybrid PSO, namely (AHPSO) by employing an adaptive mutation operator for local best particles instead of applying the mutation operator to the global best particle as has been done in previous work. The developed algorithm is a new approach which allows the swarm to be more diverse by making better exploration of the local search space instead of global search space investigated by previous researchers. The proposed algorithm holds on the properties of simple structure, fast convergence, and at the same time enhances the variety of the population, and extends the search space. It is applied to self-tuning of proportional-integral-derivative-(PID) controller in the ball and hoop system which represents a system of complex industrial processes. The results are compared with those obtained by applying standard PSO, and adaptive hybrid PSO based on global best particles. It has been shown that the developed AHPSO local best algorithm is faster in convergence and the obtained results are proved to have higher fitness than the other two algorithms.

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

pso
adaptive mutation
pid controller
ball and hoop system


The HEXACO model of personality and video game preferences ? Emotionality was negatively associated with daredevil preference. Extraversion was positively associated with daredevil and socializer preferences. Conscientiousness was positively associated with the achiever preference.

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


Pose estimation for objects with planar surfaces using eigenimage and range data analysis In this paper we present a novel method for estimating the object pose for 3D objects with well-defined planar surfaces. Specifically, we investigate the feasibility of estimating the object pose using an approach that combines the standard eigenspace analysis technique with range data analysis. In this sense, eigenspace analysis was employed to constrain one object rotation and reject surfaces that are not compatible with a model object. The remaining two object rotations are estimated by computing the normal to the surface from the range data. The proposed pose estimation scheme has been successfully applied to scenes defined by polyhedral objects and experimental results are reported.

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

image segmentation
eigenimage analysis
surface orientation
3d pose estimation


Integrating analytical network process and fuzzy logic to prioritize the strategies - A case study for tile manufacturing firm SWOT analysis is the most important tool for decision makers in strategic management process, because it enables the managers to discover and collect the facts that resulted from internal and external analysis. This analysis can be a good base for strategy formulation, but it is not non-defect. It includes no means of analytically determining the importance of factors or assessing the fit between SWOTS factors and decision alternatives and is mainly based on the qualitative analysis. Many researchers develop different techniques to quantify the SWOT analysis, but these methods are not comprehensive. In this study, we develop a fuzzy method model for quantitative weighing of SWOT strategies. The decision maker's imprecise information is regarded by fuzzy numbers in this model. To consider dependency among factors and sub-factors, we use ANP technique in our research. We demonstrate our model with a case study example and compare results of our research with prior research. (C) 2011 Elsevier Ltd. All rights reserved.

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

analytic network process (anp)
strategic planning


Effect of zone pressure on wafer bending and fluid lubrication behavior during multi-zone CMP process Wafer bending and fluid pressure are measured during 12-inch multi-zone CMP. Multi-zone carrier has zone-loading effect on wafer bending. Zone pressure configuration affects wafer bending and fluid pressure. Convexly-bended wafer generates the largest fluid pressure due to a suitable wedged gap. Higher edge zone pressure contributes to concave bending and lower fluid pressure.

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

fluid pressure
wafer bending
zone pressure

chemical mechanical polishing
edge pressure


Mantaining dynamic matrices for fully dynamic transitive closure In this paper we introduce a general framework for casting fully dynamic transitive closure into the problem of reevaluating polynomials over matrices. With this technique, we improve the best known bounds for fully dynamic transitive closure. In particular, we devise a deterministic algorithm for general directed graphs that achieves O(n(2)) amortized time for updates, while preserving unit worst-case cost for queries. In case of deletions only, our algorithm performs updates faster in O(n) amortized time. We observe that fully dynamic transitive closure algorithms with O(1) query time maintain explicitly the transitive closure of the input graph, in order to answer each query with exactly one lookup (on its adjacency matrix). Since an update may change as many as Omega(n(2)) entries of this matrix, no better bounds are possible for this class of algorithms.

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


A single-vendor and multiple-buyers productioninventory policy for a deteriorating item This study develops a single-vendor, multi-buyers productioninventory policy for a deteriorating item with a constant production and demand rate. A mathematical model incorporating the costs of both the vendor and the buyers is developed. It can be shown that the integrated policy results in an impressive cost reduction when it is compared with the independent decisions made by the vendor and the buyers.

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


A new approach to quantifying spatial contiguity using graph theory and spatial interaction Spatial contiguity is an important and fundamental landscape property in land allocation, habitat design, and forest management. The agreed upon notion of contiguity in the literature suggests shapelessness. However, existing approaches for measuring/promoting contiguity use proxies that either favour a particular shape or ignore inter-patch relationships in fragmented landscapes. We propose an unbiased relative measure of contiguity ranging from zero to one based on graph theory and spatial interaction. The new measure reflects intra-patch and inter-patch relationships by quantifying contiguity within patches and potential contiguity among patches. Empirical analysis suggests that this measure of contiguity is reliable, consistent, and insensitive to sub-region shape.

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

fragmentation
landscape pattern assessment
reserve design
land-use planning


Floating point arithmetic teaching for computational science Computational science is based upon numerical computing and, consequently, requires excellent knowledge of floating point computer arithmetic. In general, the average computational science student has a relatively limited understanding of the implications of floating point computation. This paper presents an initiative to teach floating point number representation and arithmetic in undergraduate courses in computational science. The approach is based on carefully designed practical exercises which highlight the main properties and computational issues of finite length number representation and arithmetic. In conjunction to the exercises, an auxiliary educational tool constitutes a valuable support for students to learn and understand the concepts involved. Simpler formats are used as an introduction to the IEEE 754 standard, with the aim of presenting the fundamentals of the floating point computation and emphasizing its limitations. This approach could be included in courses related to computer organization, programming, discrete mathematics, numerical methods or scientific computing in computational science curricula.

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

computer arithmetic
floating point computation


Internet market strategies: Antecedents and implications The Web is a new market channel that has become a serious alternative to traditional channels. At present, there is little strategy analysis available to guide a company's decision about its involvement in the internet market. In this paper, we differentiate between the internet and traditional market channels and define two fundamental strategies for operating on the internet as: pure and mixed. Based on models of competition in microeconomic theory and resource-based perspectives, we develop a conceptual model for channel selection. We discuss the results and their implications for companies operating on the internet.

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

creative pricing policies
mixed strategy
pure strategy
resource-based theory
internet competition
traditional markets
ims model


TCPST allocation using optimal power flow and Genetic Algorithms This work presents an optimization model to allocate TCPST at congested transmission systems. The problem was resolved by the Genetic Algorithms (GA) together with an optimal power flow (OPF). The proposed strategy used the GA to make the allocation of the TCPST and the OPF to obtain the load flow solution and optimal adjustments of the phase shifters taps. The mathematical formulation of the methodology is based on installations costs of the equipment and total system overload minimization. In order to diminish the search field a methodology to elect the most favorable substations to the devices allocation was considered. This methodology was tested at a 291 bus system that is equivalent, in heavy load, to the electric network of the State of Paran in Brazil.

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

tcpst allocation
genetic algorithms
optimal power flow


Assessment and stenting of tracheal stenosis using deformable shape models This work presents a decision support system for the assessment of tracheal stenosis. In the proposed method, a statistical shape model of healthy tracheas is registered to a 3D CT image of a patient with tracheal stenosis. The registration yields an estimation of the shape of the patients trachea as if stenosis was not present. From this point, the extent and the severity of the stenosis is assessed and stent parameters are obtained automatically. The method was extensively evaluated on simulation as well on real data and the results showed that it is accurate and fast enough to be used in the clinical setting.

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

statistical shape model
tracheal stenosis


Symmetry breaking constraints for value symmetries in constraint satisfaction Constraint satisfaction problems (CSPs) sometimes contain both variable symmetries and value symmetries, causing adverse effects on CSP solvers based on tree search. As a remedy, symmetry breaking constraints are commonly used. While variable symmetry breaking constraints can be expressed easily and propagated efficiently using lexicographic ordering, value symmetry breaking constraints are often difficult to formulate. In this paper, we propose two methods of using symmetry breaking constraints to tackle value symmetries. First, we show theoretically when value symmetries in one CSP correspond to variable symmetries in another CSP of the same problem. We also show when variable symmetry breaking constraints in the two CSPs, combined using channeling constraints, are consistent. Such results allow us to tackle value symmetries efficiently using additional CSP variables and channeling constraints. Second, we introduce value precedence, a notion which can be used to break a common class of value symmetries, namely symmetries of indistinguishable values. While value precedence can be expressed using inefficient if-then constraints in existing CSP solvers, we propose efficient propagation algorithms for implementing global value precedence constraints. We also characterize several theoretical properties of the value precedence constraints. Extensive experiments are conducted to verify the feasibility and efficiency of the two proposals.

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

symmetry breaking
value symmetries
constraint satisfaction


Noise cancellation in Doppler ultrasound signals with adaptive neuro-fuzzy inference system Adaptive noise cancellation using adaptive neuro-fuzzy inference system (ANFIS) is proposed for denoising Doppler ultrasound signals. Doppler ultrasound technology has been widely used in the clinic to diagnose vascular diseases for its noninvasive advantage. Therefore, the improvement in the flow velocity estimation performed by Doppler ultrasound blood measurement systems is important in vascular diseases diagnosis. The Doppler ultrasound signals were modeled as the summation of the true velocity signal, a wall motion signal, a clutter signal, and a random noise component. The ophthalmic arterial (OA) Doppler signals recorded from the healthy subjects and subjects suffering from the OA stenosis were used as the test sources. The signal-to-noise ratio (SNR) improvements were studied for the OA Doppler signals. Based on the results (SNR improvements and root mean square RMS error) of the experiments, it was concluded that the performance of the proposed method is higher than that of the existing methods in the literature for denoising the Doppler ultrasound signals.

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

adaptive noise cancellation
doppler ultrasound signals

adaptive neuro-fuzzy inference system (anfis)


Ligand specificity of odorant receptors Odorant receptors belong to class A of the G protein-coupled receptors (GPCRs) and detect a large number of structurally diverse odorant molecules. A recent structural bioinformatic analysis suggests that structural features are conserved across class A of GPCRs in spite of their low sequence identity. Based on this work, we have aligned the sequences of 29 ORs for which ligand binding data are available. Recent site-directed mutagenesis experiments on one such receptor (MOR174-9) provide information that helped to identify nine amino-acid residues involved in ligand binding. Our modeling provides a rationale for amino acids in equivalent positions in most of the odorant receptors considered and helps to identify other amino acids that could be important for ligand binding. Our findings are consistent with most of the previous models and allow predictions for site-directed mutagenesis experiments, which could also validate our model.

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

olfactory receptors
sequence alignment
odorant binding
g protein-coupled receptor
homology modeling


Estimating the parameters of aerobic function during exercise using an exponentially increasing work rate protocol A new exercise protocol has been proposed, with respect to cardiopulmonary exercise testing, which starts at a low work rate (WR) and increases exponentially by a standard percentage of the previous work rate every minuter the test is termed STEEP (standardised exponential exercise protocol). The potential advantage of this protocol is that if can accommodate a wide range of subjects, since it allows a maximum to be attained with a relatively narrow variation of tolerance time, regardless of subjects exercise capacity To date, only the (V) over dotO(2max) has been compared with that from the current standard ramp protocol. The ramp, however, also allows other important parameters of aerobic function to be estimated: the anaerobic threshold (AT); the response time constant and Delta(V) over dotO(2)/Delta WR. The aim of this study was, therefore, to clarify whether these aerobic parameters can be readily discerned from the responses to the STEEP protocol both from a theoretical and practical viewpoint As a result of theoretical considerations, we demonstrated that the (V) over dotO(2) time constant and Delta(V) over dotO(2)/Delta WR may not both be estimated uniquely. As a practical expedient, a procedure was proposed for estimating the parameter analogues. The preliminary results for six subjects between the STEEP and ramp protocols showed consistent positive correlation for (V) over dotO(2max) (r = 0.997) and AT-(V) over dotO(2) (r = 0.980), whereas the correlation for the (V) over dotO(2) time constant and Delta(V) over dotO(2)/Delta WR were not significant. Further study is needed to clarify the reason(s) for the discrepancies both from a theoretical and practical viewpoint.

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

exponential work rate forcing
vo2-kinetics
first-order dynamics


search engine support for software applications Question-answering, computer-assisted language learning, text mining, and other software applications that use a full-search engine to find information in a large text corpus are becoming common. A software application may use metadata and text annotations to reduce the mismatch between the concept-based representations convenient for inference and the word-based representations typically used for text retrieval. Software applications may also be able to specify detailed requirements that retrieved passages must satisfy. This use of text search is very different than the ad-hoc, interactive search that information retrieval research typically studies. Search engine developers are beginning to respond by extending indexing and retrieval models developed for structured (e.g., XML) documents to support multiple representations of document content, text annotations, metadata, and relationships. These new requirements force developers to reconsider basic assumptions about index data structures and ranked retrieval models. How best to use these new capabilities is an open problem. Straightforward transformation of a detailed information need into a complex structured query can produce a query that is effective for exact-match retrieval, but a challenge for the retrieval model to use effectively for best-match retrieval. Bag-of-words retrieval is often disparaged, but its advantage is that it is robust: It works well even when desired documents do not exactly meet expectations. This talk discusses some of the problems encountered when extending a search engine to support queries posed by other software applications and structured documents with derived annotations

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

question answering
human language technologies
search engine architecture


Visual fatigue during VDT work: Effects of time-based and environment-based conditions This study attempts to demonstrate the respective effects of time-based and environment-based factors in visual fatigue and task performance for a dynamic VDT work. Two experiments were conducted in the current study. Experiment 1 involved 10 participants tracking a scanning line at two different scanning speeds, and responding to a designated target presented singly at two different temporal frequencies. Experiment 2 involved 10 participants tracking a target with changing screen type and viewing distance. The observation results indicated that scanning speed, target presentation rate, and work period (time-based factors) significantly affected visual acuity, critical fusion frequency (CFF) and accommodative power. Screen type and viewing distance (environment-based factors) also had a significant main effect on visual acuity, CFF, accommodative power, and reaction time. This study concluded that time-based and environment-based factors influence operator visual fatigue and task performance during dynamic VDT work.

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


A framework for building hypercubes using MapReduce The European Space Agencys Gaia mission will create the largest and most precise three dimensional chart of our galaxy (the Milky Way), by providing unprecedented position, parallax, proper motion, and radial velocity measurements for about one billion stars. The resulting catalog will be made available to the scientific community and will be analyzed in many different ways, including the production of a variety of statistics. The latter will often entail the generation of multidimensional histograms and hypercubes as part of the precomputed statistics for each data release, or for scientific analysis involving either the final data products or the raw data coming from the satellite instruments. In this paper we present and analyze a generic framework that allows the hypercube generation to be easily done within a MapReduce infrastructure, providing all the advantages of the new Big Data analysis paradigm but without dealing with any specific interface to the lower level distributed system implementation (Hadoop). Furthermore, we show how executing the framework for different data storage model configurations (i.e.row or column oriented) and compression techniques can considerably improve the response time of this type of workload for the currently available simulated data of the mission. In addition, we put forward the advantages and shortcomings of the deployment of the framework on a public cloud provider, benchmark against other popular solutions available (that are not always the best for such ad-hoc applications), and describe some user experiences with the framework, which was employed for a number of dedicated astronomical data analysis techniques workshops.

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

hypercube
mapreduce
hadoop
framework
gaia mission


Flexible case-based retrieval for comparative genomics Comparative genomics represents a key instrument to discover or validate phylogenetic relationships, to give insights on genome evolution, and to infer metabolic functions of a given organism. A tool for properly supporting comparative genomics is of paramount importance in several application domains.

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

case-based reasoning
flexible retrieval
index-based retrieval
interactivity


ARTIFICIAL METAPLASTICITY CAN IMPROVE ARTIFICIAL NEURAL NETWORKS LEARNING Metaplasticity property of biological synapses is interpreted in this paper as the concept of placing greater emphasis on training patterns that are less frequent. A novel implementation is proposed in which, during the network learning phase, a priority is given to weight updating of less frequent activations over the more frequent ones. Modeling this interpretation in the training phase, the hypothesis of an improved training is tested on the Multilayer Perceptron type network with Backpropagation training. The results obtained for the chosen application show a much more efficient training, while at least maintaining the Multilayer Perceptron performance.

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

neural networks
metaplasticity
multilayer perceptron

backpropagation training algorithm
binary detection


Image security system using recursive cellular automata substitution This paper presents a novel image security system based on the replacement of the pixel values using recursive cellular automata (CA) substitution. This proposed image encryption method exhibits the properties of confusion and diffusion because of the characteristics of CA substitution are flexible. The salient features of the proposed image encryption method are its losslessness, symmetric private key encryption, very large number of secret keys, and key-dependent pixel value replacement. Simulation results obtained using some color and gray-level images clearly demonstrate the strong performance of the proposed image security system.

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

cellular automata
image security
encryption


Extended Gaussian kernel version of fuzzy c-means in the problem of data analyzing Fuzzy c-means clustering with spatial constraints is considered as suitable algorithm for data clustering or data analyzing. But FCM has still lacks enough robustness to employ with noise data, because of its Euclidean distance measure objective function for finding the relationship between the objects. It can only be effective in clustering spherical clusters, and it may not give reasonable clustering results for non-compactly filled spherical data such as annular-shaped data. This paper realized the drawbacks of the general fuzzy c-mean algorithm and it tries to introduce an extended Gaussian version of fuzzy C-means by replacing the Euclidean distance in the original object function of FCM. Firstly, this paper proposes initial kernel version of fuzzy c-means to aim at simplifying its computation and then extended it to extended Gaussian kernel version of fuzzy c-means. It derives an effective method to construct the membership matrix for objects, and it derives a robust method for updating centers from extended Gaussian version of fuzzy C-means. Furthermore, this paper proposes a new prototypes learning method and it obtains initial cluster centers using new mathematical initialization centers for the new effective objective function of fuzzy c-means, so that this paper tries to minimize the iteration of algorithms to obtain more accurate result. Initial experiment will be done with an artificially generated data to show how effectively the new proposed Gaussian version of fuzzy C-means works in obtaining clusters, and then the proposed methods can be implemented to cluster the Wisconsin breast cancer database into two clusters for the classes benign and malignant. To show the effective performance of proposed fuzzy c-means with new initialization of centers of clusters, this work compares the results with results of recent fuzzy c-means algorithm; in addition, it uses Silhouette method to validate the obtained clusters from breast cancer datasets.

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


ModelSeek: an effective 3D model retrieval system Since object similarity is a subjective matter, the gap between low-level feature representations and high-level semantic concepts is a major problem in the field of content-based 3D model retrieval. This paper presents a novel composite model descriptor, which takes into account both visual and geometric characteristics of 3D models. It also proposes an original mapping mechanism from low-level model features to high-level semantic concepts based on the users retrieval history, and so this method belongs to long-term relevance feedback algorithms for 3D model retrieval. Finally, an effective 3D model retrieval system ModelSeek has been built, and implemented with the introduced model descriptor and mapping mechanism. The experimental results show that the approaches above not only have significantly improved the retrieval performance, but have also achieved better retrieval effectiveness than the state-of-the-art techniques on the publicly available 3D model criterion that Princeton Shape Benchmark (PSB) and several standard evaluation measures.

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

3d model retrieval
model descriptor
relevance feedback
mapping mechanism


semantic-based systems development Software systems are intrinsically complex from a number of perspectives. The level of complexity is increasing due to the growing need to integrate different and diverse systems in order to achieve organizational goals (evolving toward ecosystems as an ideal). Effective integration may be argued as important as, from a knowledge-based perspective of organizations, the effectiveness of services rendered by resources depends upon how they are combined and applied. Consequently, systems development and re-engineering must focus on ways of dealing with the complexity of modern software systems in an effective manner. Since software systems, in essence, model real world phenomena, it is necessary to adopt modeling and development techniques founded on semantics. Broadly speaking, semantics enable the precise map-ping between complex real world phenomena and their modeled counterparts and/or enable the (dynamic) mapping/integration between different representations (and understandings) of real world phenomena. In recent years, ontologies have emerged as the prime focus of semantic modeling, with the main focus on the development of representation languages and the resulting ontologies. Limited work has been carried out within the software engineering community in relation to the development of semantic-based systems -- though research into the modeling, alignment and evolution of ontologies has progressed significantly among the Semantic Web community. It would seem plausible that languages, tools and techniques developed to achieve the objectives of the Semantic Web could be integrated within the software development process as a means to produce more flexible and adaptive systems. Numerous challenges exist however, as the development of semantic-based systems will have to manage things that exist (ontology), specific organizational knowledge of what exists (epistemology) and the required organizational action (pragmatics). With that in mind, this workshop aims to bring together researchers and practitioners with diverse cultural and professional backgrounds in order to discuss and analyze the different perspectives, issues and challenges of Semantic-Based Systems Development. Researchers and practitioners are invited to provide contributions in the form of research, case study or position papers related to the workshop theme. Topics include, but are not limited to the following: Ontological modeling paradigms Development approaches for semantic-based systems (e.g., methods, process and tool support) Resolution of semantic mismatches Persisting semantic models Automated ontology generation and management Ontology languages (e.g., RDF, OWL and UML) Semantic Web services Mapping of semantic models with system models Extracting (business) semantics from legacy systems. . During the workshop the discussion will be particularly aimed at: Identifying key obstacles in relation to Semantic-Based Software Development; Contributing toward the improvement of the State-of-the-Art in Semantic-Based Software Development; Instigating collaborative research efforts among the participants. .

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


On the Multiple-Access Channel With Common Rate-Limited Feedback This paper studies the multiple-access channel (MAC) with rate-limited feedback. The channel output is encoded into one stream of bits, which is provided causally to the two users at the channel input. An achievable rate region for this setup is derived, based on superposition of information, block Markov coding, and coding with various degrees of side information for the feedback link. The suggested region coincides with the Cover-Leung inner bound for large feedback rates. The result is then extended for cases where there is only a feedback link to one of the transmitters, and for a more general case where there are two separate feedback links to both transmitters. We compute achievable regions for the Gaussian MAC and for the binary erasure MAC. The Gaussian region is computed for the case of common rate-limited feedback, whereas the region for the binary erasure MAC is computed for one-sided feedback. It is known that for the latter, the Cover-Leung region is tight, and we obtain results that coincide with the feedback capacity region for high feedback rates.

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

common feedback
multiple-access channel (mac)
one-sided feedback
partial feedback
rate-limited feedback


Bacterially inspired evolving system with an application to time series prediction This paper explores the synergies between evolutionary computation and synthetic biology, developing an in silico evolutionary system that is inspired by the behavior of bacterial populations living in continuously changing environments. This system creates a 3D environment seeded with a simulated population of bacteria that eat, reproduce, interact with each other and with the environment and eventually die. This provides a 3D framework implementing an evolutionary process. The subject of the evolution is each bacterium's internal process, defining its interactions with the environment. The evolutionary goal is the survival of the population under successive, continuously changing environmental conditions. The key advantage of this bacterial evolutionary system is its decentralized, asynchronous, parallel and self-adapting general-purpose evolutionary process. We describe this system and present the results of an application to the evolution of a bacterial population that learns how to predict the presence or absence of food in the environment by analyzing three input signals from the environment. The resulting populations successfully evolve by continuously improving their fitness under different environmental conditions, demonstrating their adaptability to a fluctuating medium.

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

natural computing
genetic programming
bio-inspired computation


Self-expanding stent modelling and radial force accuracy Computational simulations using finite element analysis are a tool commonly used to analyse stent designs, deployment geometries and interactions between stent struts and arterial tissue. Such studies require large computational models and efforts are often made to simplify models in order to reduce computational time while maintaining reasonable accuracy. The objective of the study is focused on computational modelling and specifically aims to investigate how different methods of modelling stent-artery interactions can affect the results, computational time taken and computational size of the model. Various different models, each with increasing levels of complexity, are used to simulate this analysis, representing the many assumptions and simplifications used in other similar studies in order to determine what level of simplification will still allow for an accurate representation of stent radial force and resulting stress concentrations on the inner lining of the vessel during self-expanding stent deployment. The main conclusions of the study are that methods used in stent crimping impact on the resulting predicted radial force of the stent; that accurate representation of stent-artery interactions can only be made when modelling the full length of the stent due to the incorporation of end effects; and that modelling self-contact of the stent struts greatly impacts on the resulting stress concentrations within the stent, but that the effect of this on the unloading behaviour and resulting radial force of the stent is negligible.

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

nitinol
self-expanding stent
artery interaction


typetrace TypeTrace is an interactive application that records all the keyboard strokes you make, similar to Spyware. The application plays back the writing along a timeline just like a movie.

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


Class point: An approach for the size estimation of object-oriented systems In this paper, we present an FP-like approach, named Class Point, which was conceived to estimate the size of object-oriented products. In particular, two measures are proposed, which are theoretically validated showing that they satisfy well-known properties necessary for size measures. An initial empirical validation is also performed, meant to assess the usefulness and effectiveness of the proposed measures to predict the development effort of object-oriented systems. Moreover, a comparative analysis is carried out, taking into account several other size measures.

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

object-oriented systems
function point analysis
theoretical validation
effort prediction model


Quantifying DNS namespace influence ? Name resolution using the Domain Name System (DNS) is integral to todays Internet. The resolution of a domain name is often dependent on namespace outside the control of the domains owner. In this article we review the DNS protocol and several DNS server implementations. Based on our examination, we propose a formal model for analyzing the name dependencies inherent in DNS. Using our name dependency model we derive metrics to quantify the extent to which domain names affect other domain names. It is found that under certain conditions, more than half of the queries for a domain name are influenced by namespaces not expressly configured by administrators. This result serves to quantify the degree of vulnerability of DNS due to dependencies that administrators are unaware of. When we apply metrics from our model to production DNS data, we show that the set of domains whose resolution affects a given domain name is much smaller than previously thought. However, behaviors such as using cached addresses for querying authoritative servers and chaining domain name aliases increase the number and diversity of influential domains, thereby making the DNS infrastructure more vulnerable.

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


A novel pitch control system for a wind turbine driven by a variable-speed pump-controlled hydraulic servo system The paper aims to develop a novel pitch control system for a large wind turbine driven by a variable-speed pump-controlled hydraulic servo system. To perform practical pitch control experiments, a full-scale test rig of the hydraulic pitch control system for a 2 MW wind turbine's blade, including a novel pitch control mechanism, a variable-speed pump-controlled hydraulic servo system, a disturbance system and a PC-based control system, is designed and set up. The variable-speed pump-controlled hydraulic servo system, containing an AC servo motor, a constant displacement hydraulic piston pump two differential hydraulic cylinders and hydraulic circuits, achieved high response and high energy efficiency, so it is suitable for wind turbine applications. Besides, to implement the pitch control in the proposed novel pitch control system, an adaptive fuzzy controller with self-tuning fuzzy sliding-mode compensation (AFC-STFSMC) is developed to design the pitch controller. Finally, the developed variable-speed pump-controlled hydraulic servo system was built and verified for the path tracking control and path-positioning control of the pitch control of the wind turbines by practical experiments in a full-scale test rig under different path profiles, load torques, and random wind speeds. (C) 2011 Elsevier Ltd All rights reserved.

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

path tracking control and adaptive fuzzy controller with self-tuning fuzzy sliding-mode compensation


Identification of yeast cell cycle regulated genes based on genomic features Time-course microarray experiments have been widely used to identify cell cycle regulated genes. However, the method is not effective for lowly expressed genes and is sensitive to experimental conditions. To complement microarray experiments, we propose a computational method to predict cell cycle regulated genes based on their genomic features transcription factor binding and motif profiles.

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

cell cycle regulated genes
genomic features


Environmental impact assessment based on D numbers A new method for environmental impact assessment is proposed. The proposed method is more effective by considering various types of uncertainty. A new representation of uncertain information, called D numbers, is presented. This paper provides a new framework for the environmental impact assessment.

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

environmental impact assessment
d numbers

dempstershafer theory
uncertainty modeling


A Large-Scale Hidden Semi-Markov Model for Anomaly Detection on User Browsing Behaviors Many methods designed to create defenses against distributed denial of service (DDoS) attacks are focused on the IP and TCP layers instead of the high layer. They are not suitable for handling the new type of attack which is based on the application layer. In this paper, we introduce a new scheme to achieve early attack detection and filtering for the application-layer-based DDoS attack. An extended hidden semi-Markov model is proposed to describe the browsing behaviors of web surfers. In order to reduce the computational amount introduced by the model's large state space, a novel forward algorithm is derived for the online implementation of the model based on the M-algorithm. Entropy of the user's HTTP request sequence fitting to the model is used as a criterion to measure the user's normality. Finally, experiments are conducted to validate our model and algorithm.

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

anomaly detection
browsing behaviors
ddos


Mobile Relay Configuration in Data-Intensive Wireless Sensor Networks Wireless Sensor Networks (WSNs) are increasingly used in data-intensive applications such as microclimate monitoring, precision agriculture, and audio/video surveillance. A key challenge faced by data-intensive WSNs is to transmit all the data generated within an application's lifetime to the base station despite the fact that sensor nodes have limited power supplies. We propose using low-cost disposable mobile relays to reduce the energy consumption of data-intensive WSNs. Our approach differs from previous work in two main aspects. First, it does not require complex motion planning of mobile nodes, so it can be implemented on a number of low-cost mobile sensor platforms. Second, we integrate the energy consumption due to both mobility and wireless transmissions into a holistic optimization framework. Our framework consists of three main algorithms. The first algorithm computes an optimal routing tree assuming no nodes can move. The second algorithm improves the topology of the routing tree by greedily adding new nodes exploiting mobility of the newly added nodes. The third algorithm improves the routing tree by relocating its nodes without changing its topology. This iterative algorithm converges on the optimal position for each node given the constraint that the routing tree topology does not change. We present efficient distributed implementations for each algorithm that require only limited, localized synchronization. Because we do not necessarily compute an optimal topology, our final routing tree is not necessarily optimal. However, our simulation results show that our algorithms significantly outperform the best existing solutions.

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


real-coded crossover as a role of kernel density estimation This paper presents a kernel density estimation method by means of real-coded crossovers. Estimation of density algorithms (EDAs) are evolutionary optimization techniques, which determine the sampling strategy by means of a parametric probabilistic density function estimated from the population. Real-coded Genetic Algorithm (RCGA) does not explicitly estimate any probabilistic distribution, however, the probabilistic model of the population is implicitly estimated by crossovers and the sampling strategy is determined by this implicit probabilistic model. Based on this understanding, we propose a novel density estimation algorithm by using crossovers as nonparametric kernels and apply this kernel density estimation to the Gaussian Mixture modeling. We show that the proposed method is superior in the robustness of the computation and in the accuracy of the estimation by the comparison of conventional EM estimation.

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

expectation maximization
gaussian mixture model
real-coded ga


A consideration on very low phase noise oscillator circuit The low phase noise frequency source to be used for measurements and so on realizes by oscillator having highly output signal power against output noise power. SAW devices can be used with high power than BAW devices. So we examine on configuration of SAW oscillator circuits with the power gain. In this paper we shall discuss a configuration of oscillator circuit to obtain an extremely low phase noise and an oscillator operating at a non-reactive frequency of SAW resonator.

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


Collective representational content for shared extended mind Some types of species exploit the external environment to support their cognitive processes, in the sense of patterns created in the environment that function as external mental states and serve as an extension to their mind. In the case of social species the creation and exploitation of such patterns can be shared, thus obtaining a form of shared mind or collective intelligence. This paper explores this shared extended mind principle for social species in more detail. The focus is on the notion of representational content in such cases. Proposals are put forward and formalised to define collective representational content for such shared external mental states. Two case studies in domains in which shared extended mind plays an important role are used as illustration. The first case study addresses the domain of social ant behaviour. The second case study addresses the domain of human communication via the environment. For both cases simulations are described, representation relations are specified and are verified against the simulated traces.

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

collective intelligence
extended mind
representational content


APE computers - past, present and future APE is a family of supercomputers architecturally optimized for the numerical simulation of quantum field theories. Current generation APE systems (APEmille) have been commissioned at several European sites. When all planned systems are installed, later this year, a total peak processing power of about 2 TFlops will be available. A new generation system, apeNEXT, is under development. It adds several new features to the established APE architecture. Performance will be boosted towards the 10 Tflops range. (C) 2002 Published by Elsevier Science B.V.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 computing
lattice gauge theories


Approximating shortest lattice vectors is not harder than approximating closest lattice vectors We show that given oracle access to a subroutine which returns approximate closest vectors in a lattice, one may fmd in polynomial time approximate shortest vectors in a lattice. The level of approximation is maintained; that is, for any function f, the following holds: Suppose that the subroutine, on input of a lattice L and a target vector w (not necessarily in the lattice), outputs v is an element of L such that //v - w// less than or equal to f(n).//u - w// for any u is an element of L. Then, our algorithm, on input of a lattice L, outputs a nonzero vector v is an element of L such that //v// less than or equal to f(n).//u// for any non-zero Vector u is an element of L. The result holds for any norm, and preserves the dimension of the lattice, i.e., the closest vector oracle is called on lattices of exactly the same dimension as the original shortest vector problem. This result establishes the widely believed conjecture by which the shortest vector problem is not harder than the closest vector problem. The proof can be easily adapted to establish an analogous result for the corresponding computational problems for Linear codes. (C) 1999 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 problems in integer lattices

reducibility among approximation problems


Hippocrates-mst: a prototype for computer-aided microcalcification analysis and risk assessment for breast cancer One of the most common cancer types among women is breast cancer. Regular mammographic examinations increase the possibility for early diagnosis and treatment and significantly improve the chance of survival for patients with breast cancer. Clustered microcalcifications have been considered as important indicators of the presence of breast cancer. We present Hippocrates-mst, a prototype system for computer-aided risk assessment of breast cancer. Our research has been focused in developing software to locate microcalcifications on X-ray mammography images, quantify their critical features and classify them according to their probability of being cancerous. A total of 260 cases (187 benign and 73 malignant) have been examined and the performance of the prototype is presented through receiver operating characteristic (ROC) analysis. The system is showing high levels of sensitivity identifying correctly 98.63% of malignant cases.

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

risk assessment
microcalcifications
breast cancer
early diagnosis