ppxscal/embedding_network huggingface dataset:
Provenance in Sensornet Republishing
Authors: Unkyu Park, John Heidemann
Venue: Provenance and Annotation of Data and Processes: Second International Provenance and Annotation Workshop, IPAW 2008, Salt Lake City, UT, USA, June 17-18, 2008. Revised Selected Papers (2008)

Sensornets are being deployed and increasingly brought on-line to share data as it is collected. Sensornet republishing is the process of transforming on-line sensor data and sharing the filtered, aggregated, or improved data with others. We explore the need for data provenance in this system to allow users to understand how processed results are derived and detect and correct anomalies. We describe our sensornet provenance system, exploring design alternatives and quantifying storage trade-offs in the context of a city-sized temperature monitoring application. In that application, our link approach outperforms other alternatives on saving storage requirement and our incremental compression scheme save the storage further up to 83%.
Integration of regional to outcrop digital data: 3D visualisation of multi-scale geological models
Authors: R. R. Jones, K. J. W. McCaffrey, P. Clegg, R. W. Wilson, N. S. Holliman, R. E. Holdsworth, J. Imber, S. Waggott
Venue: Computers Geosciences (2009)

Multi-scale geological models contain three-dimensional, spatially referenced data, typically spanning at least six orders of magnitude from outcrop to regional scale. A large number of different geological and geophysical data sources can be combined into a single model. Established 3D visualisation methods that are widely used in hydrocarbon exploration and production for sub-surface data have been adapted for onshore surface geology through a combination of methods for digital data acquisition, 3D visualisation, and geospatial analysis. The integration of georeferenced data across a wider than normal range in scale helps to address several of the existing limitations that are inherent in traditional methods of map production and publishing. The primary advantage of a multi-scale approach is that spatial precision and dimensionality (which are generally degraded when data are displayed in 2D at a single scale) can be preserved at all scales. Real-time, immersive, interactive software, based on a ''3D geospatial'' graphical user interface (GUI), allows complex geological architectures to be depicted, and is more inherently intuitive than software based on a standard ''desktop'' GUI metaphor. The continuing convergence of different kinds of geo-modelling, GIS, and visualisation software, as well as industry acceptance of standardised middleware, has helped to make multi-scale geological models a practical reality. This is illustrated with two case studies from NE England and NW Scotland.
The Automatic Monitoring System of Rubber Conveyer Paste Mixing
Authors: Xinchun Li
Venue: Proceedings of the 2008 International Conference on Intelligent Computation Technology and Automation - Volume 01 (2008)

In the course of rubber conveyer production, in order to solve such effect on speed and accuracy, which is made by all kinds of materials' different properties, such as: power's humidity, liquid materials' clinical and the stability of the weighting system. This paper introduces distributed control system, which is composed of industrial control computer and programmable controller, and "The four steps weighting method" and "parameter adaptive fuzzy PID frequency conversion control technique", which are used to realize rapidly and accrately weighing. Practice proves that this hardware system and software algorithm are effetive and have a good potential of popularization and application. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Three-stage stochastic Runge-Kutta methods for stochastic differential equations
Authors: Peng Wang
Venue: Journal of Computational and Applied Mathematics (2008)

In this paper we discuss three-stage stochastic Runge-Kutta (SRK) methods with strong order 1.0 for a strong solution of Stratonovich stochastic differential equations (SDEs). Higher deterministic order is considered. Two methods, a three-stage explicit (E3) method and a three-stage semi-implicit (SI3) method, are constructed in this paper. The stability properties and numerical results show the effectiveness of these methods in the pathwise approximation of several standard test problems.
A knowledge-based approach to predict intragenic deletions or duplications
Authors: Krishna R. Kalari, Thomas L. Casavant, Todd E. Scheetz
Venue: Bioinformatics (2008)

Motivation: Despite recent improvements in high-throughput or classic molecular biology approaches it is still challenging to identify intermediate resolution genomic variations (50 bp to 50 kb). Although array-based technologies can be used to detect copy number variations in the human genome they are biased to detect only the largest such deletions or duplications. Several studies have identified deletions or duplications occurring within a gene that directly cause or predispose to disease. We have developed a novel computational system, SPeeDD (system to prioritize deletions or duplications) that utilizes machine learning techniques to predict likely candidate regions that delete or duplicate exon(s) within a gene. Results: Data mining and machine learning methods were applied to identify sequence features that were predictive of homologous recombination events. The logistic model tree (LMT) method yielded the best results. Sensitivity varied from 20% to 71.6% depending on the specific machine learning model used, but specificity exceeded 90% for all methods evaluated. In addition, the SPeeDD system successfully predicted and prioritized a recently published novel BRCA1 mutation. Conclusions: Results suggest that the SPeeDD system is effective at prioritizing candidate deletions and duplications within a gene. Use of SPeeDD enables more focused screening, which reduces the labor and associated costs of the molecular assays and may also lead to targeted design of new array-based screens to focus on candidate areas to accelerate the process of mutation discovery. Contact: tscheetz@eng.uiowa.edu Supplementary information: Supplementary data are available at Bioinformatics online.
Validation analyses of an operational fire monitoring product: The Hazard Mapping System
Authors: W. Schroeder, M. Ruminski, I. Csiszar, L. Giglio, E. Prins, C. Schmidt, J. Morisette
Venue: International Journal of Remote Sensing (2008)

Vegetation fires are becoming increasingly important especially in regions where the proximity to urban areas can result in large populations being directly impacted by such events. During emergency situations, accurate fire location data becomes crucial to assess the affected areas as well as to track smoke plumes and delineate evacuation plans. In this study, the performance of the NOAA/NESDIS Hazard Mapping System (HMS) is evaluated. The system combines automated and analyst-made fire detections to monitor fires across the conterminous United States. Using 30-m-spatial-resolution ASTER imagery as the main instantaneous validation data, commission and omission error estimates are reported for a subset of HMS automated and analyst-based fire pixels derived from the Terra MODIS and GOES data.
Optimal communication complexity of generic multicast key distribution
Authors: Daniele Micciancio, Saurabh Panjwani
Venue: IEEE/ACM Transactions on Networking (TON) (2008)

We prove a tight lower bound on the communication complexity of secure multicast key distribution protocols in which rekey messages are built using symmetric-key encryption, pseudo-random generators, and secret sharing schemes. Our lower bound shows that the amortized cost of updating the group key for each group membership change (as a function of the current group size) is at least log2(n) - o(1) basic rekey messages. This lower bound matches, up to a subconstant additive term, the upper bound due to Canetti et al. [Proc. INFOCOM 1999], who showed that log2(n) basic rekey messages (each time a user joins and/or leaves the group) are sufficient. Our lower bound is, thus, optimal up to a small subconstant additive term. The result of this paper considerably strengthens previous lower bounds by Canetti et al. [Proc. Eurocrypt 1999] and Snoeyink et al. [Computer Networks, 47(3):2005], which allowed for neither the use of pseudorandom generators and secret sharing schemes nor the iterated (nested) application of the encryption function. Our model (which allows for arbitrarily nested combinations of encryption, pseudorandom generators and secret sharing schemes) is much more general and, in particular, encompasses essentially all known multicast key distribution protocols of practical interest.
Real-time neuro-fuzzy digital filtering: basic concepts
Authors: J. J. Medel Juárez, J. C. García Infante, J. C. Sánchez García
Venue: WSEAS Transactions on Systems and Control (2008)

In this paper we describe the neural fuzzy filtering properties in real-time sense; giving an approach about the real-time neuro-fuzzy digital filters, defined in acronym form as RTNFDF. This kind of filters require the adaptive inference mechanism into the fuzzy logic structure to deduce the filter answers in order to select the best parameter values into the knowledge base (KB), actualizing the filter weights to give a good enough answers in natural linguistic sense; this require that all of the states bound into RTNFDF time limit as a real-time system, considering the Nyquist criteria. In this paper we characterize the membership functions into the knowledge base in a probabilistic way respect to the rules set decisions without lost its real-time description, performing the RTFNDF. Moreover, the paper describes in schematic sense the neurons set architecture into the filter description. The results expressed in formal sense use the concepts exposed in the papers included into the references. Finally, we present in illustrative manner the RTNFDF operations using as a tool the Matlab© software. Explicitly, the paper has eight sections conformed as follows: 1. Introduction, 2. Neural Architecture, 3. Rule Base Dynamics, 4. Neural Rules, 5. Real-time Descriptions, 6. Restrictions for RTNFDF, 7. Simulation, Conclusions and References.
The V*-Diagram: a query-dependent approach to moving KNN queries
Authors: Sarana Nutanong, Rui Zhang, Egemen Tanin, Lars Kulik
Venue: Proceedings of the VLDB Endowment (2008)

The moving k nearest neighbor (MkNN) query finds the k nearest neighbors of a moving query point continuously. The high potential of reducing the query processing cost as well as the large spectrum of associated applications have attracted considerable attention to this query type from the database community. This paper presents an incremental safe-region-based technique for answering MkNN queries, called the V*-Diagram. In general, a safe region is a set of points where the query point can move without changing the query answer. Traditional safe-region approaches compute a safe region based on the data objects but independent of the query location. Our approach exploits the current knowledge of the query point and the search space in addition to the data objects. As a result, the V*-Diagram has much smaller IO and computation costs than existing methods. The experimental results show that the V*-Diagram outperforms the best existing technique by two orders of magnitude.
An Asymptotic Approach for Testing P0-Matrices
Authors: Lei Li, Koya Hattori
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

A direct approach to the P-matrix or P"0-matrix problem is to evaluate all the principal minors of matrix A using standard numerical linear algebra techniques with O(2^nn^3) computational time complexity. The computational time complexity of the P-matrix problem has been reduced from O(2^nn^3) to O(2^n) by applying recursively a criterion for P-matrices based on Schur complementation. But this algorithm can be not directly applied to test the P"0-matrices because the Schur complementation can be not computed when some zero diagonal elements appear. This paper proposes an asymptotic approach for testing P"0-matrices with O(2^n) computational time complexity. Some numerical examples show that the proposed algorithm is effective for testing P"0-matrices.
A Vector Space Model on Hierarchical Structures with Dynamic Mapping Operator Creation
Authors: Takafumi Nakanishi, Koji Zettsu, Yutaka Kidawara, Yasushi Kiyoki
Venue: Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 03 (2008)

We develop a new vector space model of a hierarchical structure depending on a user’s viewpoint by performing dynamic mapping operator creation. In order to determine appropriate relationships among information resources, it is important to develop a correlation computation method that depends on the hierarchical structure. Our method determines the correlation in vector space corresponding to the hierarchical structure by dynamic mapping operator creation; this mapping operator represents the hierarchical structure depending on the user's viewpoint by simple matrix computing. Furthermore, our method determines the correlations according to user's viewpoints by dynamic mapping operator creation on the basis of the hierarchical structure. It helps to obtain various information resources related to a query depending on the hierarchical structure and user's viewpoints.
Automatic Generation of Secure Multidimensional Code for Data Warehouses: An MDA Approach
Authors: Carlos Blanco, Ignacio García-Rodríguez De Guzmán, Eduardo Fernández-Medina, Juan Trujillo, Mario Piattini
Venue: Proceedings of the OTM 2008 Confederated International Conferences, CoopIS, DOA, GADA, IS, and ODBASE 2008. Part II on On the Move to Meaningful Internet Systems (2008)

Data Warehouses (DW) manage enterprise information for the decision making process, and the establishment of security measures at all stages of the DW development process is also highly important as unauthorized users may discover vital business information. Model Driven Architecture (MDA) based approaches allow us to define models at different abstraction levels, along with the automatic transformations between them. This has thus led to the definition of an MDA architecture for the development of secure DWs. This paper uses an example of a hospital to show the benefits of applying the MDA approach to the development of secure DWs. The paper is focused on transforming secure multidimensional Platform Independent Models (PIM) at the conceptual level into Platform Specific Models (PSM) at the logical level by defining the necessary set of Query/Views/Transformations (QVT) rules. This PSM model is therefore used to obtain the corresponding secure multidimensional code for a specific On-Line Analytical Processing (OLAP) platform such as SQL Server Analysis Services (SSAS).
Using cross-system diversity in heterogeneous networks: Throughput optimization
Authors: Samson Lasaulce, Alberto Suárez, Raul de Lacerda, Mérouane Debbah
Venue: Performance Evaluation (2008)

This paper investigates the situation where a group of terminals can be simultaneously connected to several base stations, using distinct technologies on non-overlapping frequency bands. We introduce and solve the problem of optimal power allocation (in the sense of the ergodic sum-rate), for terminals in the uplink, using three types of receiver: the optimum receiver, minimum mean square error and matched filters. Key results from random matrix theory allow us to solve the corresponding optimization problems. Simulations validate our approach, and illustrate the performance gain obtained by using several technologies simultaneously, instead of one at a time.
AcceleSpell, a gestural interactive game to learn and practice finger spelling
Authors: José Luis Hernandez-Rebollar, Ethar Ibrahim Elsakay, José D. Alanís-Urquieta
Venue: Proceedings of the 10th international conference on Multimodal interfaces (2008)

In this paper, an interactive computer game for learning and practicing continuous fingerspelling is described. The game is controlled by an instrumented glove known as AcceleGlove and a recognition algorithm based on decision trees. The Graphical User Interface is designed to allow beginners to remember the correct hand shapes and start finger spelling words sooner than traditional methods of learning.
Color in image and video processing: most recent trends and future research directions
Authors: Alain Trémeau, Shoji Tominaga, Konstantinos N. Plataniotis
Venue: Journal on Image and Video Processing (2008)

The motivation of this paper is to provide an overview of the most recent trends and of the future research directions in color image and video processing. Rather than covering all aspects of the domain this survey covers issues related to the most active research areas in the last two years. It presents the most recent trends as well as the state-of-the-art, with a broad survey of the relevant literature, in the main active research areas in color imaging. It also focuses on the most promising research areas in color imaging science. This survey gives an overview about the issues, controversies, and problems of color image science. It focuses on human color vision, perception, and interpretation. It focuses also on acquisition systems, consumer imaging applications, and medical imaging applications. Next it gives a brief overview about the solutions, recommendations, most recent trends, and future trends of color image science. It focuses on color space, appearance models, color difference metrics, and color saliency. It focuses also on color features, color-based object tracking, scene illuminant estimation and color constancy, quality assessment and fidelity assessment, color characterization and calibration of a display device. It focuses on quantization, filtering and enhancement, segmentation, coding and compression, watermarking, and lastly on multispectral color image processing. Lastly, it addresses the research areas which still need addressing and which are the next and future perspectives of color in image and video processing.
Continuous monitoring of wide-area wireless networks: data collection and visualization
Authors: Justin Ormont, Jordan Walker, Suman Banerjee
Venue: ACM SIGMETRICS Performance Evaluation Review (2008)

In this work, we present an infrastructure for monitoring and visualizing performance of a wide-area wireless network, We present a unique, vehicle-mounted platform and a testbed for wide-area wireless experimentation. The testbed nodes are mounted on metro transit city buses in Madison, WI, and are currently equipped with both cellular EV-DO* and WiFi interfaces. Our initial goal for this infrastructure is to continuously monitor characteristics and performance of large-scale wireless networks, e.g., city-wide mesh networks or cellular networks. In such networks, customers experience a very large range of geographic and mobility-related radio environments. A vehicle-mounted platform, with fairly deterministic mobility patterns, can provide an efficient, low-cost, and robust method to gather much needed performance data on parameters like RF coverage, available bandwidth, and impact of mobility. Our demonstration outlines the framework of such a distributed measurement system. We also showcase the potential benefits by presenting our initial measurements from this testbed through the use of intuitive visualization interface.
Ten years in the evolution of the internet ecosystem
Authors: Amogh Dhamdhere, Constantine Dovrolis
Venue: Proceedings of the 8th ACM SIGCOMM conference on Internet measurement (2008)

Our goal is to understand the evolution of the Autonomous System (AS) ecosystem over the last decade. Instead of focusing on abstract topological properties, we classify ASes into a number of "species" depending on their function and business type. Further, we consider the semantics of inter-AS links, in terms of customer-provider versus peering relations. We find that the available historic datasets from RouteViews and RIPE are not sufficient to infer the evolution of peering links, and so we restrict our focus to customer-provider links. Our findings highlight some important trends in the evolution of the Internet over the last decade, and hint at what the Internet is heading towards. After an exponential increase phase until 2001, the Internet now grows linearly in terms of both ASes and inter-AS links. The growth is mostly due to enterprise networks and content/access providers at the periphery of the Internet. The average path length remains almost constant mostly due to the increasing multihoming degree of transit and content/access providers. In recent years, enterprise networks prefer to connect to small transit providers, while content/access providers connect equally to both large and small transit providers. The AS species differ significantly from each other with respect to their rewiring activity; content/access providers are the most active. A few large transit providers act as "attractors" or "repellers" of customers. For many providers, strong attractiveness precedes strong repulsiveness by 3-9 months. Finally, in terms of regional growth, we find that the AS ecosystem is now larger and more dynamic in Europe than in North America.
Chain-Type Wireless Sensor Network for Monitoring Long Range Infrastructures: Architecture and Protocols
Authors: Chang Wen Chen, Yu Wang
Venue: International Journal of Distributed Sensor Networks (2008)

We present in this paper an investigation of a special class of wireless sensor networks for monitoring critical infrastructures that may extend for hundreds of miles in distances. Such networks are fundamentally different from traditional sensor networks in that the sensor nodes in this class of networks are deployed along narrowly elongated geographical areas and form a chain-type topology. Based on careful analysis of existing sensor network architectures, we first demonstrate the need to develop new architecture and networking protocols to match the unique topology of chain-type sensor networks. We then propose hierarchical network architecture that consists of clusters of sensor nodes to enable the chain-type sensor networks to be scalable to cover typically long range infrastructures with tolerable delay in network-wide data collection. To maintain energy efficient operations and maximize the lifetime for such a chain-type sensor network, we devise a smart strategy for the deployment of cluster heads. Protocols for network initialization and seamless operations of the chain-type sensor networks are also developed to match the proposed hierarchical architecture and cluster head deployment strategy. Simulations have been carried out to verify the performance of the hierarchical architecture, the smart node deployment strategy, and the corresponding network initialization and operation protocols.
Making digital tv easier for less-technically-inclined people
Authors: Michael J. Darnell
Venue: Proceeding of the 1st international conference on Designing interactive user experiences for TV and video (2008)

Digital TV systems are becoming increasingly complex. Less-technically-inclined people may find these systems difficult to use. This qualitative usability study observed less-technically-inclined people using a typical multi-device, multi-remote-control digital TV system after having been instructed by a more-technically-inclined member of their household, who had also just discovered how to use the system. The results showed that, overall, the problems experienced by the less-technically-inclined people were similar in nature to those experienced by the more-technically-inclined household member. The most serious problems involved determining which remote control to use for a given function, making remote control mode errors, and having difficulty going back to TV from recordings and locked channels.