Fitting distances by tree metrics with increment error The L-p-min increment fit and L-p-min increment ultrametric fit problems are two popular optimization problems arising from distance methods for reconstructing phylogenetic trees. This paper proves 1. An O(n(2)) algorithm for approximating L( -min increment fit within ratio 3. 2. A ratio-O(n(1/p)) polynomial time approximation to L-p-min increment ultrametric fit. 3. The neighbor-joining algorithm can correctly reconstruct a phylogenetic tree T when increment errors are small enough under L-infinity-norm.

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

phylogenes
neighbor-joining method
ultametric matrixes


A faster FPT algorithm for Bipartite Contraction ? We present an improved FPT algorithm for the Bipartite Contraction problem. The running time improves on an earlier double-exponential algorithm by Heggernes et al. (2011). The algorithm uses important separators and randomized coloring in a nontrivial way.

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

algorithms
graph algorithms
randomized algorithms
fixed-parameter tractability
graph modification problems


Neural Control of Rhythmic Sequences Abstract: We investigated whether the temporal structure of movement sequences can be represented and learned independently of their ordinal structure, and whether some brain regions are particularly important for temporal sequence performance. Using a learning transfer design, we found evidence for independent temporal representations: learning a spatiotemporal sequence facilitated learning its temporal and ordinal structure alone; learning a temporal and an ordinal structure facilitated learning of a sequence where the two were coupled. Second, learning of temporal structures was found during reproduction of sequential stimuli with random ordinal structure, suggesting independent mechanisms for temporal learning. We then used functional magnetic resonance imaging to investigate the neural control of sequences during well-learned performance. The temporal and ordinal structures of the sequences were varied in a 2 2 factorial design. A dissociation was found between brain regions involved in ordinal and temporal control, the latter mainly involving the presupplementary motor area, the inferior frontal gyrus and precentral sulcus, and the superior temporal gyri. Finally, in a second fMRI experiment, well-learned temporal sequences were performed with the left or right index fingers, or using rhythmic speech. The overlap in brain activity during performance with the different effectors included a similar set of brain regions as that found in the first fMRI experiment: the supplementary motor area (SMA), the superior temporal gyrus, and the inferior frontal cortex. We thus suggest that this set of regions is important for abstract, movement-independent, temporal sequence control. This organization may be important for increased flexibility in voluntarily timed motor tasks.

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

fmri
supplementary motor area
superior temporal gyrus


Stability of Quasi-Periodic Orbits in Recurrent Neural Networks A simple discrete recurrent neural network model is considered. The local stability is analyzed with the associated characteristic model. In order to study the dynamic behavior of the quasi-periodic orbit, it is necessary to determine the Neimark-Sacker bifurcation. In the case of two neurons, one necessary condition that yields the Neimark-Sacker bifurcation is found. In addition to this, the stability and direction of the Neimark-Sacker bifurcation are determined by applying normal form theory and the center manifold theorem. An example is given and a numerical simulation is performed to illustrate the results. The phase-locking phenomena are analyzed for certain experimental results with Arnold Tongues in a particular weight configuration.

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

nonlinear system
neimark sacker
arnold tongue
quasi-periodic orbit


Multiple kernel learning in proteinprotein interaction extraction from biomedical literature Knowledge about proteinprotein interactions (PPIs) unveils the molecular mechanisms of biological processes. The volume and content of published biomedical literature on protein interactions is expanding rapidly, making it increasingly difficult for interaction database administrators, responsible for content input and maintenance to detect and manually update protein interaction information. The objective of this work is to develop an effective approach to automatic extraction of PPI information from biomedical literature. We present a weighted multiple kernel learning-based approach for automatic PPI extraction from biomedical literature. The approach combines the following kernels: feature-based, tree, graph and part-of-speech (POS) path. In particular, we extend the shortest path-enclosed tree (SPT) and dependency path tree to capture richer contextual information. Our experimental results show that the combination of SPT and dependency path tree extensions contributes to the improvement of performance by almost 0.7 percentage units in F-score and 2 percentage units in area under the receiver operating characteristics curve (AUC). Combining two or more appropriately weighed individual will further improve the performance. Both on the individual corpus and cross-corpus evaluation our combined kernel can achieve state-of-the-art performance with respect to comparable evaluations, with 64.41% F-score and 88.46% AUC on the AImed corpus. As different kernels calculate the similarity between two sentences from different aspects. Our combined kernel can reduce the risk of missing important features. More specifically, we use a weighted linear combination of individual kernels instead of assigning the same weight to each individual kernel, thus allowing the introduction of each kernel to incrementally contribute to the performance improvement. In addition, SPT and dependency path tree extensions can improve the performance by including richer context information.

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

multiple kernel learning
proteinprotein interaction

support vector machines
text mining
information extraction


the design of gaze behavior for embodied social interfaces Non-verbal behavior, particularly gaze, is a crucial part of human communication. To interact with humans in a rich, natural way, social interfaces need to use this communicative channel effectively. While the role and mechanics of human gaze are extensively studied, how gaze might be used effectively by embodied interfaces is not well explored. The goal of my dissertation is to gain a deeper understanding of how gaze behavior affects people's interactions with embodied social interfaces and how we can design gaze for effective communication. This research focuses on four main social functions of gaze: Regulation, Expression, Establishing Joint Attention, and Initiating/Avoiding of Social Encounters and four sets of design variables: Temporal, Spatial, Physiological, and Contextual. A systematic study of how these functions and design variables affect each other is conducted through a series of empirical studies.

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

interaction design
social gaze
robots
modeling behavior
user studies


Archival image indexing with connectivity features using randomized masks Connectivity properties capture a natural spatial feature of a binary image. Albeit they are easy to compute, more often than not, they alone fail to provide a good characterization of the image because of the fact that several different images may have the same connectivity features. Typically, other types of parameters, e. g., moments, are used to augment the connectivity feature for efficient indexing and retrieval purposes. In this work, an alternative approach is proposed. Instead of considering other diverse features, which are computationally intensive, only the connectivity features of the image are used iteratively using a novel concept of spatial masking. For this purpose, a greedy algorithm for constructing a spatial feature vector of variable length for a binary image, is proposed. The algorithm is based on XOR-ing the image bit-plane with a few pseudo-random synthetic masks, and its novelty lies in computing the feature vector iteratively, depending on the size and diversity of the image database. The classical Euler number and the two primary connectivity features from which it is derived, namely, the number of connected components and the number of holes, are used to finally generate a unique feature vector for each binary image in the database using a fuzzy membership function customized for the given database. The method is particularly suitable for large-sized image archives of a digital library, where each image contains one or more objects. It is found to converge within only three iterations for a postal stamp database consisting of 2598 images, and also for a logo database of 1034 images. A data structure called discrimination tree has been introduced for supporting efficient storage and indexing of the images using the above feature vector. (c) 2008 Elsevier B.V. All rights reserved.

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

archival image
connected components
digital library
euler number
fuzzy membership function


on the distinct distances determined by a planar point set It is shown that every set of $n$ points in the plane has an element f rom which there are at least $cn^{6/7}$ other elements at distinct distances, where $c>0$ is a constant. This improves earlier results of Erd\H os, Moser, Beck, Chung, Szemer\'edi, Trotter, and Sz\'ekely.

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

szemer\ 'edi-trotter theorem
crossing number


Rapid entropy-based detection and properties measurement of concrete spalling with machine vision for post-earthquake safety assessments The current procedures in post-earthquake safety and structural assessment are performed manually by a skilled triage team of structural engineers/certified inspectors. These procedures, and particularly the physical measurement of the damage properties, are time-consuming and qualitative in nature. This paper proposes a novel method that automatically detects spalled regions on the surface of reinforced concrete columns and measures their properties in image data. Spalling has been accepted as an important indicator of significant damage to structural elements during an earthquake. According to this method, the region of spalling is first isolated by way of a local entropy-based thresholding algorithm. Following this, the exposure of longitudinal reinforcement (depth of spalling into the column) and length of spalling along the column are measured using a novel global adaptive thresholding algorithm in conjunction with image processing methods in template matching and morphological operations. The method was tested on a database of damaged RC column images collected after the 2010 Haiti earthquake, and comparison of the results with manual measurements indicate the validity of the method.

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

machine vision
image processing
reinforced concrete

spalling detection
property retrieval
post-earthquake reconnaissance


A formal model of services Service-oriented software systems rapidly gain importance across application domains: They emphasize functionality (services), rather structural entities (components), as the basic building block for system composition. More specifically, services coordinate the interplay of components to accomplish specific tasks. In this article, we establish a foundation of service orientation: Based on the FOCUS theory of distributed systems (see Broy and Stolen [2001]), we introduce a theory and formal model of services. In FOCUS, systems are composed of interacting components. A component is a total behavior. We introduce a formal model of services where, in contrast, a service is a partial behavior. For services and components, we work out foundational specification techniques and outline methodological development steps. We show how services can be structured and how software architectures can be composed of services and components. Although our emphasis is on a theoretical foundation of the notion of services, we demonstrate utility of the concepts we introduce by means of a running example from the automotive domain.

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

design
languages
reliability
service engineering
assumption/commitment specifications
software architecture


A solution for the N-bit parity problem using a single translated multiplicative neuron A solution to the N-bit parity problem employing a single multiplicative neuron model, called translated multiplicative neuron (pi(t)-neuron), is proposed. The pi(t)-neuron presents the following advantages: (a) For AllNgreater than or equal to1, only 1 pi(t)-neuron is necessary, with a threshold activation function and parameters defined within a specific interval; (b) no learning procedures are required; and (c) the computational cost is the same as the one associated with a simple McCulloch-Pitts neuron. Therefore, the pi(t)-neuron solution to the N-bit parity problem has the lowest computational cost among the neural solutions presented to date.

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

multiplicative neurons
n-bit parity problem
neural networks


An Optimal Virtual Network Mapping Model Based on Dynamic Threshold To support maximum number of users/applications the concept of virtualization is employed. Network virtualization deals with supporting the concurrent wired/wireless network activities and utilizing the available physical (substrate) network efficiently by implementing an ideal virtual network embedding algorithm. Mapping virtual network requests to substrate network is an important problem and is done to optimize certain characteristic parameters of the network system. Most of the virtual network mapping models consider, mapping of the network requests on a single physical network. This work proposes a model for the virtual network mapping onto multiple substrate networks with the objective to optimize the revenue for the network service providers. In the process, some other parameters such as acceptance ratio of the VN requests etc. also improve. Experimental study reinforces the efficacy of the proposed 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

virtual network (vn)
substrate network (sn)
vn embedding
graph theoretic approach
network revenue


Human-inspired force compliant grasping primitives We address the problem of grasping everyday objects that are small relative to an anthropomorphic hand, such as pens, screwdrivers, cellphones, and hammers from their natural poses on a support surface, e.g., a table top. In such conditions, state of the art grasp generation techniques fail to provide robust, achievable solutions due to either ignoring or trying to avoid contact with the support surface. In contrast, when people grasp small objects, they often make use of substantial contact with the support surface. In this paper we give results of human subjects grasping studies which show the extent and characteristics of environment contact under different task conditions. We develop a simple closed-loop hybrid grasping controller that mimics this interactive, contact-rich strategy by a position-force, pre-grasp and landing strategy for finger placement. The approach uses a compliant control of the hand during the grasp and release of objects in order to preserve safety. We conducted extensive robotic grasping experiments on a variety of small objects with similar shape and size. The results demonstrate that our approach is robust to localization uncertainties and applies to many everyday objects.

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

manipulation
dexterous grasping
human-inspired robotics


improving abstract interpretations by combining domains In this paper we consider static analyses based on abstract interpretation of logic programs over combined domains. It is known that analyses over combined domains potentially provide more information than obtainable by performing the independent abstract interpretations. However, the construction of a combined analysis often requires redefining the basic operations for the combined domain. We demonstrate for logic programs that in practice it is possible to obtain precision in a combined analysis without redefining the basic operations. We also propose a way of performing the combination which can be more precise than the straightforward application of the classical reduced product approach, while keeping the original components of the basic operations. The advantage of the approach is that proofs of correctness for the new domains are not required and implementations can be reused. We illustrate our results by showing that a combined sharing analysisconstructed from old proposalscompares well with other new proposals suggested in recent literature both from the point of view of efficiency and accuracy.

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

sharing precise point accuracy efficiency interpretation analysis correctness domain

abstraction
maintainability
implementation
operability
static analysis
program analysis
logic programming
practical
informal
combinational
abstract interpretation


Grc nu nu gamma: Event generator for the single- and double-photon emission associated with neutrino pair-production A new event generator is proposed for two processes e(+)e(-) --> nu )over bar>gamma and e(+)e(-) --> nu )over bar>gamma gamma where nu )over bar> includes all the neutrino species. The exact matrix elements of single- and double-photon emission, generated by the GRACE system, are convoluted with the QED parton shower (QEDPS) to deal with the initial state radiations (ISR). It is pointed out that a careful treatment is required to avoid the double counting of the radiative photons between the matrix elements and the ISR part, A detailed comparison of grc nu nu gamma with the O(alpha) calculations and other similar Monte Carlo generators is discussed on the total cross section and on various distributions. It is also examined how the possible effects of the anomalous triple-gauge-boson couplings can be observed. (C) 2001 Elsevier Science B.V. All rights reserved.

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

photon radiation
missing energy
anomalous gauge-boson coupling


balancing video on demand flows over links with heterogeneous delays The popularity of Video on Demand (VoD) services has recently grown to unprecedented levels. Even if UDP is often considered the standard transport protocol for video streaming, TCP is often used for VoD since its reliability, congestion control, and resilience to the presence of firewalls/NATs on the link. Unfortunately, poor video quality, frequent playback pauses, and delays due to slow frame buffering are still annoying users engaged in long RTT connections, both wired and wireless, with the server. This is due to the ack-based mechanism that increases the TCP's congestion window, which leads to RTT-unfairness. As a practical consequence, if a VoD user is experiencing long RTTs while sharing the channel with another VoD user whose connection has small RTTs, the former will see a very slow progression of its video until the latter is done. In this paper, we propose the use of TCP Libra on VoD servers to resolve this RTT-unfairness issue, thus providing an efficient VoD service to any user, regardless of her/his RTTs.

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


REGION COVARIANCE MATRICES AS FEATURE DESCRIPTORS FOR PALMPRINT RECOGNITION USING GABOR FEATURES Region covariance matrices (RCMs) as feature descriptors have been developed due to the advantages of low dimensionality, being scale and illumination independent. How to define a feature mapping vector for the RCMs construction of strong discriminating ability is still an open issue. In this paper, there is a focus on finding a more efficient feature mapping vector for RCMs as palmprint descriptors based on Gabor magnitude and phase (GMP) information. Specially, Gabor magnitude (GM) features of each palmprint image approximate a lognormal distribution. For palmprint recognition, the logarithmic transformation of GM proves to be important for the discriminating ability of corresponding RCMs. All experiments are performed on the public Hong Kong Polytechnic University (PolyU) Palmprint Database of 7752 images. The results demonstrate the efficiency of our proposed method, and also show that adding pixel locations and intensity component to the feature mapping vector has a negative er effect on palmprint recognition performance for our proposed Log GMP based RCM method.

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

biometrics
region covariance matrice (rcm)


Computing median and antimedian sets in median graphs The median (antimedian) set of a profile p = (u(1), ... , u(k)) of vertices of a graph G is the set of vertices x that minimize (maximize) the remoteness Sigma(i) d(x, u(i)). Two algorithms for median graphs G of complexity O(n idim(G)) are designed, where n is the order and idim(G) the isometric dimension of G. The first algorithm computes median sets of profiles and will be in practice often faster than the other algorithm which in addition computes antimedian sets and remoteness functions and works in all partial cubes.

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

hypercube
isometric subgraph
median graph
weak contraction


Valid inequalities for MIPs and group polyhedra from approximate liftings In this paper, we present an approximate lifting scheme to derive valid inequalities for general mixed integer programs and for the group problem. This scheme uses superadditive functions as the building block of integer and continuous lifting procedures. It yields a simple derivation of new and known families of cuts that correspond to extreme inequalities for group problems. This new approximate lifting approach is constructive and potentially efficient in computation.

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


Diffusion of interacting Brownian particles on non-regularly spaced stepped structures In this paper, we investigate the diffusion process of interacting Brownian particles on stepped surfaces through a Langevin dynamic simulation method. Our primary interest is the investigation of the dynamics properties by calculating the collective diffusion coefficient for non-regularly spaced stepped structures using the FrenkelKontorova repulsive interactions. In particular, we have studied the effects of the EhrlichSchwoebel barrier \(E_{S}\) and the additional binding energy \(E_{B}\) on the diffusion process. Overall, our simulation results show that the value of the diffusion coefficient \(D\) is reduced with increasing \(E_{S}\) and \(E_{B}\). This reduction is also observed when decreasing the size of terraces. This diminution is well interpreted by calculating the effective potential which includes the effect of both potentials of FrenkelKontorova and the substrate.

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

commensurability effects
langevin simulation
stepped structure


TDMA frame design for a prototype underwater RF communication network Very low frequency electromagnetic communication system is used in a small scale underwater wireless sensor network for coastal monitoring purposes, as recent research has demonstrated distinct advantages of radio waves compared to acoustic and optical waves in shallow water conditions. This paper describes the detailed TDMA and packet design process for the prototype sensor system. The lightweight protocol is time division based in order to fit the unique characteristics and specifications of the network. Evaluations are based on initial beach trial as well as modeling and simulations.

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


Localized sensor management for multi-target tracking in wireless sensor networks For a multi-hop wireless sensor network, the limited sensing and communication resources give rise to distinct challenges to the task of tracking mobile targets, which is traditionally treated primarily from the data fusion perspective. This paper investigates the impact of sensor management on data fusion in a resource-limited network. A localized multi-sensor multi-target tracking framework is presented, consisting of four intertwined modules: data acquisition, data fusion, information propagation, and sensor management. The sensor management module, which boils down to a constrained binary optimization problem, is emphasized for efficient sensing resource allocation. Given limited bandwidth and power in the network, a localized greedy-selection sensor management (GSSM) algorithm is proposed to dynamically select a subset of sensors that contributes most effectively to the tracking accuracy. Using only localized information propagation among one-hop neighbors, the proposed framework obviates the need for a fusion center or multi-hop relays, and thus improves network robustness and scalability. (C) 2011 Elsevier B.V. All rights reserved.

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

wireless sensor network
sensor management

multi-target tracking
multi-sensor data fusion


Severe: Segmenting vessels in retina images ? All computations are done by using exclusively the direction map. No pre-processing is done. High performance in terms of quantitative parameters.

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

retina scan images
segmentation
biometrics


G1 surface modelling using fourth order geometric flows We use three fourth order geometric partial differential equations to efficiently solve several surface modelling problems, including surface blending, N-sided hole filling and free-form surface fitting with the G1 boundary continuity. The non-linear equations we use include the surface diffusion flow, the quasi surface diffusion flow and the Willmore flow. These non-linear equations are discretized using a mixed finite element method based on a combination of the Loop's basis and the linear basis. The proposed approach is simple, efficient and gives very desirable results.

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

surface blending
mixed finite element method

geometric pdes
n-sided hole filling
free-form surface fitting


An interactive Morse code emulation management system Assistive technology (AT) is becoming increasingly important in improving mobility, language, and learning capabilities of persons who have disabilities enabling them to function independently and to improve their social opportunities. Morse code has been shown to be a valuable tool in assistive technology, augmentative and alternative communication, rehabilitation, and education, as well as adapted computer access methods via special software programs, hardware devices, and switches. In this study, we designed and implemented an interactive multimedia Morse code typing emulation system for persons with disabilities, which include three types of switches, a single switch, a double switch, and six switches, with three adaptive recognition methods. After practicing on the proposed system repeatedly, three people with disabilities were able to familiarize themselves with Morse code operation. Experimental results showed that participants improved in both the speed variation coefficient and ratio variation coefficient for entry of keystroke input to the computer. (C) 2003 Elsevier Science Ltd. All rights reserved.

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

augmentative and alternative communication (aac)


Correspondence between mutation and selection pressure and the genetic code degeneracy in the gene evolution There are three main elements deciding about the effect of mutations on the protein coding sequencesthe type of the substitution of nucleotide, the selection for the function of the gene product and the nature of the genetic code itself. Selection used to be considered as the only directional process among the evolutionary mechanisms. In fact the mutational pressure is also directional which means that the rates of particular nucleotide substitutions tend to produce a DNA molecule with a specific nucleotide composition. Using Monte Carlo simulations we have shown that the genetic code plays the central role in buffering the effect of mutations and that all three elements are optimised in the generation of the genetic diversity in such a way that deleterious effects of mutations are substantially reduced.

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

mutation
selection
evolution
genetic code


Modelling dependable collaborative time-constrained business processes The effectiveness of the information system that a particular organisation uses for running its business depends largely on the success in modelling such business. This is due to the fact that the business model defines the requirements of the information system that will support the running of the business. Nowadays, there exist many business process development methods that are supported by modelling notations and tools. Unfortunately, these methods are not capable of modelling jointly complex collaborations, time constraints and to offer means to support resilient business process engineering. This article presents a business process language called DT4BP, which has been designed to drive the modelling of dependable, collaborative and time-constrained business processes. The presentation of DT4BP is made to target end users, which are business processes modellers.

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

business process modelling language
resilience
dependability
collaboration
fault tolerance
transaction processing
exception handling


A code-motion pruning technique for global scheduling In the high-level synthesis of ASICs or in the code generation for ASIPs, the presence of conditionals in the behavioral description represents an obstacle to exploit parallelism. Most existing methods use greedy choices in such a way that the search space is limited by the applied heuristics. For example, they might miss opportunities to optimize across basic block boundaries when treating conditional execution. We propose a constructive method which allows generalized code motions. Scheduling and code motion are encoded in the form of a unified resource-constrained optimization problem. In our approach many alternative solutions are constructed and explored by a search algorithm, while optimal solutions are kept in the search space. Our method can cope with issues like speculative execution and code duplication. Moreover, it can tackle constraints imposed by the advance choice of a controller, such as pipelined-control delay and limited branch capabilities. The underlying timing models support chaining and multicycling. As taking code motion into account may lead to a larger search space, a code-motion pruning technique is presented. This pruning is proven to keep optimal solutions in the search space for cost functions in terms of schedule lengths.

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

code generation
code motion
global scheduling
speculative execution


Debiasing investors with decision support systems: An experimental investigation This research presents evidence that decision support systems can play an important role in debiasing behaviorally-challenged investors. An empirical study involving 119 participants provides strong evidence for the existence of cognitive biases in investment decision making and demonstrates the effectiveness of decision aids in lowering the negative impact of such biases on the ability of investors to make sound investment decisions. Additionally, such decision aids are shown to be more valuable in decision environments where the bias level is likely to be higher.

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

investment decision making
cognitive biases
decision support systems


Evaluation of the 3-D finite difference implementation of the acoustic diffusion equation model on massively parallel architectures ? The diffusion equation model is a popular tool in room acoustics modeling. The 3-D Finite Difference (3D-FD) implementation predicts the energy decay function and the sound pressure level in closed environments. This simulation is computationally expensive, as it depends on the resolution used to model the room. With such high computational requirements, a high-level programming language (e.g., Matlab) cannot deal with real life scenario simulations. Thus, it becomes mandatory to use our computational resources more efficiently. Manycore architectures, such as NVIDIA GPUs or Intel Xeon Phi offer new opportunities to enhance scientific computations, increasing the performance per watt, but shifting to a different programming model. This paper shows the roadmap to use massively parallel architectures in a 3D-FD simulation. We evaluate the latest generation of NVIDIA and Intel architectures. Our experimental results reveal that NVIDIA architectures outperform by a wide margin the Intel Xeon Phi co-processor while dissipating approximately 50W less (25%) for large-scale input problems.

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

nvidia gpus
intel xeon phi
acoustic diffusion equation model


Quality of Service Control for WLAN-based Converged Personal Network Service This paper proposes a framework for quality of service (QoS) control in WLAN-based converged personal network service (CPNS). First, we show that the CPNS devices in WLANs occupy the shared wireless channel in an unfair manner; and thus, QoS is degraded. The reasons of such problem are analyzed from two viewpoints of (i) channel access mechanism according to carrier sensing multiple access protocol of WLAN and (ii) TCP congestion control mechanism in response to packet loss. To improve QoS and assure fair channel sharing, we propose an integrated QoS control framework consisting of admission control and rate control. Based on the available capacity, the admission control determines whether or not a specific QoS service can be admitted. The rate control is implemented using congestion window control or token bucket algorithm. The proposed mechanism differentiates QoS service from best-effort (BE) service such that the QoS service is preferentially served to satisfy its QoS requirements and the BE service is served to share the remaining resource in a fair manner. The extensive simulation results confirm that the proposed scheme assures QoS and fair channel sharing for WLAN-based CPNS.

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


aggressive inlining Existing research understates the benefits that can be obtained from inlining and cloning, especially when guided by profile information. Our implementation of inlining and cloning yields excellent results on average and very rarely lowers performance. We believe our good results can be explained by a number of factors: inlining at the intermediate-code level removes most technical restrictions on what can be inlined; the ability to inline across files and incorporate profile information enables us to choose better inline candidates; a high-quality back end can exploit the scheduling and register allocation opportunities presented by larger subroutines; an aggressive processor architecture benefits from more predictable branch behavior; and a large instruction cache mitigates the impact of code expansion. We describe the often dramatic impact of our inlining and cloning on performance: for example, the implementations of our inlining and cloning algorithms in the HP-UX 10.20 compilers boost SPECint95 performance on a PA8000-based workstation by a factor of 1.32.

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

processor
scheduling
research
register allocation
factor
exploit
architecture
code
performance
implementation

quality
examples
boosting
compilation
algorithm
profiles
instruction caches
informal
predict


Modelling the dispersion of aerial pollutants from agricultural buildings - an evaluation of computational fluid dynamics (CFD) Agricultural buildings, especially those used for intensive livestock production, are significant sources of aerial pollutants. This paper explores some of the computational modelling methods available to predict near field concentrations of a pollutant emitted from a building opening. The modelling approaches used here are restricted in application to effectively weightless particles, such as a low concentration pollutant gas. The how patterns were predicted using computational fluid dynamics (CFD) and linked to this computed flow field were two dispersion models, a Eulerian diffusion model and a Lagrangian particle tracking technique, both used to predict ensemble mean gas concentration. Explicit account has been taken here of variations in mean wind direction, using a new technique based on the weighted summation of individual wind direction results according to the probability density function of the wind direction. The atmospheric boundary layer is characterised by variations in wind direction that do not occur in simulated wind tunnel flows and are not generally reproduced in current computational methods. For comparison, the results of the modelling approach are compared with mean concentrations of ammonia gas released as a tracer from an isolated low rise building. The results of this comparison indicate that at a distance of more than three building heights downstream the predictions from both models are satisfactory but that in the near wake the diffusion model is less successful. The weighted solutions, taking account of wind direction, give significantly improved predictions over unweighted results. Lack of plume spread is identified as the main cause of inaccuracies in predictions and this is linked to inadequate resolution of flow features and mixing in the CFD model. The use of modelling based on CFD and existing dispersion models is clearly limited and further work on non-steady state simulations of wake Rows for dispersion studies is required. (C) 2001 Elsevier Science B.V. All rights reserved.

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

dispersion modelling
pollution
environment
atmosphere


A hierarchical and scalable model for contemporary document image segmentation In this paper, we introduce a novel color segmentation approach robust against digitization noise and adapted to contemporary document images. This system is scalable, hierarchical, versatile and completely automated, i.e. user independent. It proposes an adaptive binarization/quantization without any penalizing information loss. This model may be used for many purposes. For instance, we rely on it to carry out the first steps leading to advertisement recognition in document images. Furthermore, the color segmentation output is used to localize text areas and enhance optical character recognition (OCR) performances. We held tests on a variety of magazine images to point up our contribution to the well-known OCR product Abby FinerReader. We also get promising results with our ad detection system on a large set of complex layout testing images.

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

noisy image
text detection
advertisement classification


Efficient and ripple-mitigating dcdc converter for residential fuel cell system Proton exchange membrane fuel cell (PEMFC) systems for residential application require efficient and ripple-mitigating power conditioning system (PCS). The key point to reach it, is the design and control of the dcdc converter. Based on the theoretical and experimental analysis of the traditional converter, this paper proposes a novel parallel-series full bridge (P-SFB) dcdc converter, and improves its phase shifting scheme. This paper also proposes a novel controller for low frequency ripple current suppressing applied on the converter. The experimental results verify that, the dcdc converter achieves a peak efficiency of 95.5%. Therefore PCSs maximum efficiency reaches 92.9%. And the input current ripple is reduced significantly with the new controller.

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


i:move I:move is a performance / installation series that explores how we perceive movement. It embeds daily activities into formal choreography and is being developed for public spaces that are bottlenecks of human motion. It has been shown at MIT's IM Pei archway and the DTW gallery space.Pedestrian traffic is tracked and transformed into 2-dimensional shadow play. Continuous motion trails occur like reliable yet unpredictable weather patterns. I:move captures and processes these daytime patterns, imbedding them into video projection. Pedestrians become performers. Live motion folds into the piece, revealing layers of text or motion streams that echo earlier daytime movements in the space. Through i:move, your motion reveals varying speeds, rhythms and dynamic patterns occurring at the site, over a 24-hour cycle. I:move encourages dancers and novices to explore their own movements, in relation to the routine, theater, and ritual of cycles in a public space.I:move considers human movements over multiple time scales, perspectives, and magnifications. Video processing is used to enhance contrast, reveal coincidences, and layer time-coded realities. Interactive video is used to engage viewers in playful experimentation. Audiences create and perform inside the motion projections. In this way, i:move celebrates the personal and collective movements of each day.The i:move series is rendered entirely by a stream processing lisp dialect called Gooze. Gooze is a concise, powerful, and efficient expression of time-oriented computing allowing highly profitable domain specific optimizations. It is a unique design, combining movementcentric parameters to extract the perceptual features of motion from video.

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

stream processing
video processing
interactive


Multi-objective optimization of analog integrated circuit placement hierarchy in absolute coordinates Innovative multi-objective optimization of analog integrated circuit placement. Optimal constraint handling due to the use of absolute coordinates. Pareto fronts are combined hierarchically to reduce the problem complexity. An enhanced version of the well-known AMOSA algorithm is proposed. Compete with most recent topological representations on the MCNC benchmarks.

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

analog integrated circuit layout
archive
design hierarchy
multi-objective optimization
pareto front
simulated annealing


Predicting the onset of bifurcation and stability study of a hybrid current controller for a boost converter The proposed method develops a continuous-time averaging model of a nonlinear current controller for a continuous conduction mode (CCM) boost converter in the lack of a closed outer voltage loop. The controller associates peak-current and sliding mode controls. The advantages of the proposed approach are the capability to show the onset of fast-scale bifurcation, and the reduction of numerical calculation effort. To confirm the validity of the proposed method, simulation and experimental results are detailed. (c) 2013 IMACS. Published by Elsevier B.V. All rights reserved.

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

poincare map
jacobian
dc-dc converter modeling


Reasoning about preferences in argumentation frameworks The abstract nature of Dung's seminal theory of argumentation accounts for its widespread application as a general framework for various species of non-monotonic reasoning, and, more generally, reasoning in the presence of conflict. A Dung argumentation framework is instantiated by arguments and a binary conflict based attack relation, defined by some underlying logical theory. The justified arguments under different extensional semantics are then evaluated, and the claims of these arguments define the inferences of the underlying theory. To determine a unique set of justified arguments often requires a preference relation on arguments to determine the success of attacks between arguments. However, preference information is often itself defeasible, conflicting and so subject to argumentation. Hence, in this paper we extend Dung's theory to accommodate arguments that claim preferences between other arguments, thus incorporating meta-level argumentation based reasoning about preferences in the object level. We then define and study application of the full range of Dung's extensional semantics to the extended framework, and study special classes of the extended framework. The extended theory preserves the abstract nature of Dung's approach, thus aiming at a general framework for non-monotonic formalisms that accommodate defeasible reasoning about as well as with preference information. We illustrate by formalising argument based logic programming with defeasible priorities in the extended theory. (C) 2009 Elsevier B.V. All rights reserved.

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

argumentation
dung
preferences
logic programming


Closing the loop between clinical practice, research, and education: The potential of electronic patient records Objective: To discuss the possible contribution of electronic patient records in closing the loop among clinical practice, research and education. Results and conclusions: Applying Information and Communication Technology (ICT) to a given medical domain is not merely adding a new technique. When introduced into an environment, ICT will initially often emulate or resemble the already existing processes. When workers and researchers in that domain begin to appreciate the potential of ICT, this initial stage is followed by more fundamental changes in that domain that take advantage of the potential of ICT. To understand the scope of the potential changes enabled by electronic records, three principle changes need to be understood. First, data recorded in computer memories can be readily retrieved and re-used for a variety of purposes. Second, once data are available in computer memories, the data can be transported easily. Third, as physicians (and patients) are using computers to record medical data, the some electronic record can be used to introduce other computer programs that interact with the user. New usage of data, however, generates additional requirements. Thus the experience in developing decision support systems and analyzing observational databases feeds back into the requirements for electronic medical records. Each patient-physician encounter, each investigation each laboratory test, and each treatment in medical practice constitutes, in principle, an experiment. Ideally, we learn from each experiment. Electronic medical records will facilitate research that relies on data recorded in routine medical practice. The potential and challenge, however, of Medical Informatics lies in its ability to close the loop among clinical practice, research, and education.

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

computer assisted decision making databases


Separation of data on the training and test set for modelling: a case study for modelling of five colour properties of a white pigment In order to evaluate the influence of the choice of the data for the training set on the prediction ability of linear and nonlinear models, various methods for sample selection were tested. The study is carried on for modelling of five colour properties: whiteness (W-10), lightness (L* and L-p(*)), and hue (b* and b(p)(*)) of a titanium dioxide white pigment. In all variations of data selections and modelling, the same set of 132 samples of white pigment produced in a 6-month period was employed. As the modelling techniques standard multiple linear regression (MLR), radial basis functions (RBF) model and two artificial neural networks (ANNs) learning strategies, error-backpropagation (EBP ANN) and counterpropagation (CP ANN), were used. For each of the four modelling techniques, four different sample selections were picked out using the following methods: time-equidistant sampling of pigments produced during 6-month period (time dependent for short), random selection (RS), sampling from Kohonen self-organised top-maps (KOH), and Kennard-Stone maximal distance approach. Each time, exactly 66 samples for the training and 66 samples for the testing were chosen. The 66 testing objects were further divided into the test and control set. Only 13 objects were present in all four testing sets. These 13 objects were kept aside for the final control set, while the remaining 53 obtained from each division were used for testing the generated models at the very end of the entire modelling generation part of the work. Each sample (white pigment) in the study is characterised by 17 independent and five dependent variables. The best 80 models (for five pigment properties, each modelled by four different modelling methods, each of which generated by the training set of objects obtained by four different division methods) were tested and results were reported. It was found out that the differences in the quality of prediction abilities of models obtained by different modelling techniques are statistically significant (within alpha=0.05), while the division method is not. As the best modelling method, the error backpropagation was established. However, several exceptions from the general observations are present and discussed. (C) 2002 Elsevier Science B.V. All rights reserved.

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


counting birds with wireless sensor networks This paper proposes several methods to estimate the number of endangered birds in their habitat. Our solutions use passive unknown networks sensors to get birds positions and gather data to a central base which runs our algorithms to estimate the number of singing birds. A first scheme derives the motes networks and the data in an altered unit disk graph to give its estimation on the number of birds. The second scheme, a linear algorithm, uses aggregated information from the motes to count the birds. Finally, we confirm our schemes efficiency through experimentation.

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

habitat monitoring
distributed network
wireless sensors


on the use of random neural networks for traffic matrix estimation in large-scale ip networks Despite a large body of literature and methods devoted to the Traffic Matrix (TM) estimation problem, the inference of traffic flows volume from aggregated data still represents a major issue for network operators. Directly and frequently measuring a complete TM in a large-scale network is costly and difficult to perform due to routers limited capacities. In this paper we introduce and evaluate a new method to estimate a TM from easily available link load measurements. The method uses a novel statistical learning technique to unveil the relation between links traffic volume and origin-destination flows volume. By training a system based on Random Neural Networks, we provide a fast and accurate TM estimation tool that attains proper results without assuming any traffic model or particular behavior. Using real data from an operational backbone network, we compare this new method to the most well known and accepted TM estimation techniques, including in the evaluation some more accurate and up-to-date methods developed in recent works. Results show that current TM estimation techniques can still be improved.

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

traffic matrix estimation
random neural networks
statistical learning


Visualization of AMR Data With Multi-Level Dual-Mesh Interpolation We present a new technique for providing interpolation within cell-centered Adaptive Mesh Refinement (AMR) data that achieves C-0 continuity throughout the 3D domain. Our technique improves on earlier work in that it does not require that adjacent patches differ by at most one refinement level. Our approach takes the dual of each mesh patch and generates "stitching cells" on the fly to fill the gaps between dual meshes. We demonstrate applications of our technique with data from Enzo, an AMR cosmological structure formation simulation code. We show ray-cast visualizations that include contributions from particle data (dark matter and stars, also output by Enzo) and gridded hydrodynamic data. We also show results from isosurface studies, including surfaces in regions where adjacent patches differ by more than one refinement level.

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

adaptive mesh refinement
amr
enzo
interpolation
dual meshes
stitching cells


Building Cartesian trees from free trees with k leaves One can build a Cartesian tree from an n-element sequence in O(n) time, and from an n-node free tree in O(n log n) time (with a matching worst-case lower bound in the comparison model of computation). We connect these results together by describing a Cartesian tree construction algorithm based on a "bitonicity transform" running in O(n log k) time on a free tree with k leaves, noting that a path is the special case of a tree with just 2 leaves. We also provide a matching worst-case lower bound in the comparison model. (c) 2013 Elsevier B.V. All rights reserved.

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

adaptive algorithms
range queries
data structures


Characterization of titanium silicide by Raman spectroscopy for submicron IC processing The formation of the low resistivity C54 phase of titanium silicide (TiSi2) used in submicron IC technology was studied using Raman spectroscopy. TiSi2 on both pad areas (100100 ?m2) as well as polycrystalline and amorphous silicon narrow lines (line widths: 0.35 to 1.0 ?m) were formed under various rapid thermal annealing temperatures. The results showed that Raman spectroscopy could accurately identify the temperature ranges of the formation, transformation and agglomeration of TiSi2. Qualitative analysis confirmed the difficulty of forming C54 phase TiSi2 on narrow polycrystalline lines. TiSi2 was also found to form at a lower annealing temperature on amorphous Si than on polycrystalline Si, which is attributed to the random nature of amorphous Si, although its degradation also occurs earlier. These results demonstrate the applicability of Raman spectroscopy for characterizing TiSi2 used in sub-half-micron IC processing.

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


Comparison of performance between AND and majority logic type nonlinear feedforward logic pseudonoise sequence generators Two classes of nonlinear Feedforward logic (NLFFL) pseudonoise (PN) code generators based on the use of AND and majority logic (MIL) gates are compared. Crosscorrelation and code-division multiple-access (CDMA) properties of properly designed NLFFL sequences are found to be comparable with the properties of well-known linear PN codes. It is determined that code design employing ML gates with an odd number of inputs is easier compared with designing with AND gates. This is especially true when the degree of nonlinearity is large, since the nonbalance problem. e.g., at the output of an AND gate: can be avoided. ML type sequences are less vulnerable to correlation attack and jamming by the m-sequence of an NLFFL generator.

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

information security
spreading code
stream cipher
linear complexity
spread-spectrum system
code-division multiple-access


Copyright protection against print-and-scan operations by watermarking for color images using coding and synchronization of peak locations in frequency domain A watermarking method for copyright protection of color images against print-and-scan operations is proposed. A watermark is embedded in an input image as coefficient-value peaks that are circularly and symmetrically distributed ill a middle band of the discrete Fourier transform (DFT) domain of the input image. By detecting the robust peaks in the DFT domain of a reproduced image obtained by scanning a printed version of a watermarked image, we can extract the embedded watermark to verify the copyright of the reproduced image. Experimental results are given to prove the feasibility of the proposed method.

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

copyright protection
discrete fourier transform
reproduced image

digital watermarking
color image
print-and-scan operations


On interactive fuzzy numbers In this paper we will introduce a measure of interactivity between marginal distributions of a joint possibility distribution C as the expected value of the interactivity relation between the gamma-level sets of its marginal distributions. (C) 2003 Elsevier B.V. All rights reserved.

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

joint possibility distribution
interactivity

marginal possibility distribution
covariance
variance


The bulk-synchronous parallel random access machine The model of bulk-synchronous parallel (BSP) computation is an emerging paradigm of general-purpose parallel computing. Originally, BSP was defined as a distributed memory model. Shared-memory style BSP programming had to be provided by PRAM simulation. However, this approach destroys data locality and therefore may prove inefficient for many practical problems. In this paper we present a new BSP-type model, called BSPRAM, which reconciles shared-memory style programming with efficient exploitation of data locality. BSPRAM can be optimally simulated by BSP for a broad range of algorithms. We identify some characteristic properties of such algorithms: obliviousness, slackness, granularity. Finally, we illustrate these concepts by presenting BSPRAM algorithms for butterfly dag computation, cube dag computation, dense matrix multiplication and sorting. (C) 1998-Elsevier Science B.V. All rights reserved.

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

bsp computing
automatic memory management
shared memory simulation
bsp algorithms


Improvement of the securing RFID systems conforming to EPC Class 1 Generation 2 standard Radio frequency identification (RFID) technology is taking the place of barcodes to become electronic tags of the new generation. EPC Class 1 Generation 2 has served as the most popular standard for passive RFID tags. In 2010, Yeh et al. proposed a new RFID authentication protocol conforming to EPC Class 1 Generation 2 standard. However, this paper demonstrates that Yell et al.'s protocol has two serious security problems such as DATA integrity problem and forward secrecy problem unlike their claims. An improved protocol is also proposed which can prevent the security problems and be applied in low-cost RFID environments requiring a high level of security. (C) 2011 Elsevier Ltd. All rights reserved.

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

rfid
epc
authentication
integrity
forward secrecy


Use of a Monoclonal Antibody against Babesia bovis Merozoite Surface Antigen-2c for the Development of a Competitive ELISA Test Bovine babesiosis caused by Babesia bovis is a disease that hampers the production of beef and dairy cattle in tropical and subtropical regions of the world. New diagnostic methods based on recombinant antigens constitute valuable biotechnological tools for the strategic control of this disease. We have developed a competitive enzyme-linked immunosorbent assay that includes a recombinant form of the merozoite surface antigen-2c and a novel monoclonal antibody against it. Preliminary results showed that this test is able to identify specific antibodies against B. bovis from experimentally and naturally infected cattle.

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

competitive enzyme-linked immunosorbent assay (competitive elisa)


Database query languages and functional logic programming Functional logic programming is a paradigm which integrates functional and logic programming. It is based on the use of rewriting rules for defining programs, and rewriting for goal solving. In this context, goals, usually, consist of equality (and, sometimes, inequality) constraints, which are solved in order to obtain answers, represented by means of substitutions. On the other hand, database programming languages involve a data model, a, data definition language and, finally, a query language against the data defined according to the data model. To use functional logic programming as a database programming language, (1) we will propose a data model involving the main features adopted from functional logic programming (for instance, handling of partial and infinite data), (2) we will use conditional rewriting rules as data definition language, and finally, (3) we will deal with equality and inequality constraints as query language. Moreover, as most database systems, (4) we will propose an extended relational calculus and algebra, which can be used as alternative query languages in this framework. Finally, (5) we will prove that three alternative query languages are equivalent.

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

functional-logic programming
deductive databases


Matching and Weighted P2 P 2 -Packing: Algorithms and Kernels ? Parameterized algorithms and kernelization algorithms are presented for the weighted P2 P 2 -Packing problem, which is a generalization of the famous Graph Matching problem. The parameterized algorithms are based on the following new techniques and observations: (1) new study on structure relationship between graph matchings in general graphs and P2 P 2 -packings in bipartite graphs; (2) an effective graph bi-partitioning algorithm; and (3) a polynomial-time algorithm for a constrained weighted P2 P 2 -Packing problem in bipartite graphs. The kernelization algorithms are based on the following new techniques: (1) the application of graph matching in kernelization; (2) a crown reduction structure for weighted problems. These techniques lead to randomized and deterministic parameterized algorithms that significantly improve the previous best upper bounds for the problem for both weighted and unweighted versions. For the kernelization algorithm, by using a weighted version of crown reduction, a kernel of size O(k2) O ( k 2 ) is presented, where k is the given parameter of the problem.

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

weighted p2 p 2 -packing p2 p 2 p2 p 2 p 2


The implications of Western electronic commerce for Chinese business networks Examines the application of electronic commerce (EC) in a cross-cultural context. The problems likely to be encountered by a Chinese organization are analysed and interpreted in terms of conflicting cultural values. The costs associated with EC are also analyzed and two new costs' technology and competition, are introduced. The costs are classified according to the traditional market and the EC market and also by the coordination mechanism. While Chinese firms are showing considerable enthusiasm for EC. it is felt that they may not yet be ready to undertake the major organizational developments and re-engineering efforts required to successfully implement EC. EC will also present Chinese managers with faceless transactions which may conflict with current cultural values.

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


Small weight codewords in the dual code of points and hyperplanes in PG(n, q), q even The main theorem of this article gives a classification of the codewords in C-n-1(perpendicular to)(n, q), the dual code of points and hyperplanes in PG(n, q), q even, with weight smaller than q + (3)root q(2) + 1. In the proof, we rely on the classification of the small blocking sets in PG(2, q), q even.

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


An improvement of the construction of the DV and G.V. Chudnovsky algorithm for multiplication in finite fields From an interpolation method on algebraic curves, due to D.V. Chudnovsky and G.V. Chudnovsky, we give a new method for the construction of bilinear algorithms for multiplication in the extensions of finite fields. We obtain algorithms better than known ones. (c) 2006 Elsevier B.V. All rights reserved.

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

algorithm
finite fields
algebraic curves

bilinear complexity
algebraic function fields


supporting multiple subscription languages by a single event notification overlay in sparse manets The subscription language is an important design decision for distributed event notification services (DENS). In order to minimize resource consumption and enable applications to use rich and complex subscription languages only when they are really needed, we have developed a DENS that separates the concerns of delivering subscriptions and notifications from the subscription specification and event filtering, i.e., the subscription language. To resolve the conflict between subscription language independence in DENS and a strict decoupling of publishers and subscribers through the DENS, we request that for each new subscription language three language specific plug-ins are provided. In this paper, we present the technical details of this solution and describe our proof-of-concept implementation that supports a simple attribute-value based subscription language and a fuzzy concept-based language.

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


Synthesis of water-using network with central reusable storage in batch processes The starting and finishing times of water-using operations in batch plants are dependent on the production planning and scheduling. For maximizing the possibility of water reuse/recycle, or for minimizing the freshwater consumption, central storage facilities in a batch water-using system can collect the reusable water from the earlier operations and then supply the remaining water to the later operations. For a predefined production schedule, this paper presents a mathematical formulation for the synthesis of batch water-Using networks with central storage tank(s). Superstructures that incorporate all possible flow connections are built to facilitate the problem modeling. The design problem is formulated as a nonlinear program (NLP) if there is no limitation to water reuse/recycle, or a mixed-integer nonlinear program (MINLP) when forbidding water reuse between assigned water-using units and water recycle of certain water-using Units is considered. A Published literature example and some adaptation examples are provided to demonstrate the good expectation of the proposed, superstructure-based NLP and MINLP formulations. As Supported by the results, superstructures with the design scheme can effectively accomplish the objective of solving the design problem for minimum freshwater consumption and offering the optimal network configuration. (C) 2008 Elsevier Ltd. All rights reserved.

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

batch process
water-using network
superstructure nonlinear program (nlp)
mixed-integer nonlinear program (minlp)


An integrated product and process development methodology: Concept formulation Life cycle engineering, or integrated product and process development (IPPD), is a new trend of research and application in industry and academia. In our previous work, a generic framework was proposed to provide a means for an integrated consideration of the performance optimization issues in a product's lifetime. Based on this generic framework, this paper proposes and presents an integrated product and process development methodology. Important concepts of the methodology are introduced, and an application procedure is provided to illustrate the systematic application of the methodology to real product and process development. Finally, we provide a brief report of our application of the methodology to personal computer development. (C) 1999 Elsevier Science Ltd. All rights reserved.

O B I I I I O O O B I I O B I I I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 novel algorithm for non-bonded-list updating in molecular simulations Simulations of molecular systems typically handle interactions within non-bonded pairs. Generating and updating a list of these pairs can be the most time-consuming part of energy calculations for large systems. Thus, efficient non-bonded list processing can speed up the energy calculations significantly. While the asymptotic complexity of current algorithms (namely O(N), where N is the number of particles) is probably the lowest possible, a wide space for optimization is still left. This article offers a heuristic extension to the previously suggested grid based algorithms. We show that, when the average particle movements are slow, simulation time can be reduced considerably. The proposed algorithm has been implemented in the DistanceMatrix class of the molecular modeling package MESHI. MESHI is freely available at .

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

energy minimization
molecular dynamics
neighbor list
non-bonded list
verlet table


TOWARDS A THEORY OF BELIEF RECONSTRUCTION - APPLICATION TO COMMUNICATION We present a theory of belief reconstruction to be embedded in an agent's communication model, which accounts for both belief persistence and revision. We analyse Cohen and Levesque (1990a)'s and Perrault (1990)'s theories, highlight problems which arise, and show that our theory does not have these problems. The starting point of our theory is called the observation principle. It accounts for a distinction between what an agent observes from another agent, and the action the latter has really performed. The theory is couched in an autoepistemic logic used objectively, along the same lines as in (Levesque, 1990). When applied to a communication context, it is shown that it correctly predicts the changes in an observer's beliefs in test cases such as sincere assertion and (detected or non-detected) lie. Such test cases highlight the ability of the theory to handle not only normal dialogue situations but also those where problems arise due to erroneous perception, such as misrecognition in spoken communication.

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

reasoning about action
interagent communication


Artificial neural network and liquefaction susceptibility assessment: a case study using the 2001 Bhuj earthquake data, Gujarat, India This study pertains to prediction of liquefaction susceptibility of unconsolidated sediments using artificial neural network (ANN) as a prediction model. The backpropagation neural network was trained, tested, and validated with 23 datasets comprising parameters such as cyclic resistance ratio (CRR), cyclic stress ratio (CSR), liquefaction severity index (LSI), and liquefaction sensitivity index (LSeI). The network was also trained to predict the CRR values from LSI, LSeI, and CSR values. The predicted results were comparable with the field data on CRR and liquefaction severity. Thus, this study indicates the potentiality of the ANN technique in mapping the liquefaction susceptibility of the area.

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

liquefaction susceptibility
neural network
bhuj


architectural requirements of parallel scientific applications with explicit communication This paper studies the behavior of scientific applications running on distributed memory parallel computers. Our goal is to quantify the floating point, memory, I/O and communication requirements of highly parallel scientific applications that perform explicit communication. In addition to quantifying these requirements for fixed problem sizes and numbers of processors, we develop analytical models for the effects of changing the problem size and the degree of parallelism for several of the applications. We use the results to evaluate the trade-offs in the design of multicomputer architectures.

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

requirements
communication
applications
use
parallel
size
behavior
design
floating point
paper
distributed

processor
architecture
memorialized
parallel computation
model
effect
evaluation


Cardiovascular research in Spain. A comparative scientometric study A bibliometric analysis of Spanish cardiovascular research is presented. The study focuses on the productivity, visibility and citation impact in an international, notably European context. Special attention is given to international collaboration. The underlying bibliographic data are collected from Thomson Reuterss Web of Science on the basis of a hybrid search strategy combining core journals, lexical terms and citation links especially developed for the field of cardiology.

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

cardiovascular research
international collaboration
spain


Second-Order Bilinear Discriminant Analysis Traditional analysis methods for single-trial classification of electro-encephalography (EEG) focus on two types of paradigms: phase-locked methods, in which the amplitude of the signal is used as the feature for classification, that is, event related potentials; and second-order methods, in which the feature of interest is the power of the signal, that is, event related (de)synchronization. The process of deciding which paradigm to use is ad hoc and is driven by assumptions regarding the underlying neural generators. Here we propose a method that provides an unified framework for the analysis of EEG, combining first and second-order spatial and temporal features based on a bilinear model. Evaluation of the proposed method on simulated data shows that the technique outperforms state-of-the art techniques for single-trial classification for a broad range of signal-to-noise ratios. Evaluations on human EEG-including one benchmark data set from the Brain Computer Interface (BCI) competition-show statistically significant gains in classification accuracy, with a reduction in overall classification error from 26%-28% to 19%.

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

regularization
bilinear decomposition
neural signals


Computers and creativity support: knowledge, visualisation and collaboration This paper is concerned with research into creativity and how it might inform our understanding of knowledge-based computer support. Aspects of creativity research are explored and two case studies by the author are described. The implications of knowledge-intensive work including visualisation and collaboration for computer support are discussed. Finally, future research directions that combine the aims, objectives and techniques of both the artificial intelligence and human-computer interaction communities are outlined. (C) 1997 Elsevier Science B.V.

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


DECODE: Exploiting Shadow Fading to DEtect COMoving Wireless DEvices We present the DECODE technique to determine whether a set of transmitters are comoving, i.e., moving together in close proximity. Comovement information can find use in applications ranging from inventory tracking to social network sensing and to optimizing mobile device localization. The positioning errors from indoor RSS-based localization systems tend to be too large, making it difficult to detect whether two devices are moving together based on the interdevice distances. DECODE achieves accurate comovement detection by exploiting the correlations in positioning errors over time. DECODE can not only be implemented in the position space but also in the signal space where a correlation in shadow fading due to objects blocking the path between the transmitter and receiver exists. This technique requires no change in or cooperation from the tracked devices other than sporadic transmission of packets. Using experiments from an office environment, we show that DECODE can achieve near-perfect comovement detection at walking speed mobility using correlation coefficients computed over approximately 60-second time intervals. We further show that DECODE is generic and could accomplish detection for mixed mobile transmitters of different technologies (IEEE 802.11b/g and IEEE 802.15.4), and our results are not very sensitive to the frequency at which transmitters communicate.

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

received signal strength indicator (rssi)


Lattice-valued fuzzy Turing machines: Computing power, universality and efficiency In this paper we study fuzzy Turing machines with membership degrees in distributive lattices, which we called them lattice-valued fuzzy Turing machines First we give several formulations of lattice-valued fuzzy Turing machines. including in particular deterministic and non-deterministic lattice-valued fuzzy Turing machines (l-DTMcs and l-NTMs). We then show that l-DTMcs and l-NTMs are not equivalent as the acceptors of fuzzy languages. This contrasts sharply with classical Turing machines Second, we show that lattice-valued fuzzy Turing machines can recognize n-re sets in the sense of Bedregal and Figueira, the super-computing power of fuzzy Turing machines is established in the lattice-setting Third, we show that the truth-valued lattice being finite is a necessary and sufficient condition for the existence of a universal lattice-valued fuzzy Turing machine. For an infinite distributed lattice with a compact metric, we also show that it universal fuzzy Turing Machine exists in an approximate sense. This means. for any prescribed accuracy, there is a universal machine that can simulate any lattice-valued fuzzy Turing machine on it with the given accuracy Finally. we introduce the notions of lattice-valued fuzzy polynomial time-bounded computation (IP) and lattice-valued non-deterministic fuzzy polynomial time-bounded computation (INP), and investigate their connections with P and NP We claim that lattice-valued fuzzy Turing machines are more efficient than classical Turing machines. (C) 2009 Elsevier B.V All rights reserved

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

fuzzy systems model
recursively enumerable language
recursive language
computational complexity


XTREM: A power simulator for the intel XScale (R) core Managing power concerns in microprocessors has become a pressing research problem across the domains of computer architecture, CAD, and compilers. As a result, several parameterized cycle-level power simulators have been introduced. While these simulators can be quite useful for microarchitectural studies, their generality limits how accurate they can be for any one chip family. Furthermore, their hardware focus means that they do not explicitly enable studying the interaction of different software layers, such as Java applications and their underlying Runtime system software. This paper describes and evaluates XTREM, a power simulation tool tailored for the Intel XScale microarchitecture. In building XTREM, our goals were to develop a microarchitecture simulator that, while still offering size parameterizations for cache, TLB, etc., more accurately reflected a realistic processor pipeline. We present a detailed set of validations based on multimeter power measurements and hardware performance counter sampling. Based on these validations across a wide range of stressmarks, Java benchmarks, and non-Java benchmarks, XTREM has an average performance error of only 6.5% and an even smaller average power error: 4%. The paper goes on to present a selection of application studies enabled by the simulator. For example, presenting power behavior vs. time for selected embedded C and Java CLDC benchmarks, we can make power distinctions between the two programming domains as well as distinguishing Java application (JITted code) power from Java Runtime system power. We also study how the Intel XScale core's power consumption varies for different data activity factors, creating power swings as large as 50mW for a 200Mhz core. We are planning to release XTREM for wider use, and feel that it offers a useful step forward for compiler and embedded software designers.

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

experimentation
languages
xorp
power measurements
power modeling
hardware performance counters


Battery-Aware Task Mapping for Coarse-Grained Reconfigurable Architecture Coarse-grained Reconfigurable Architecture (CGRA) is a parallel computing platform that provides both high performance of hardware and high flexibility of software. It is becoming a promising platform for embedded and mobile applications. Since the embedded and mobile devices are usually battery-powered, improving battery lifetime becomes one of the primary design issues in using CGRAs. In this paper, we propose a battery-aware task-mapping method to optimize energy consumption and improve battery lifetime. The proposed method mainly addresses two problems: task partitioning and task scheduling when mapping applications onto CGRA. The task partitioning and scheduling are formulated as a joint optimization problem of minimizing the energy consumption. The nonlinear effects of real battery are taken into account in problem formulation. Using the insights from the problem formulation, we design the task-mapping algorithm. We have used several real-world benchmarks to test the effectiveness of the proposed method. Experiment results show that our method can dramatically lower the energy consumption and prolong the battery-life.

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

reconfigurable computing
battery nonlinear effect