ppxscal/embedding_network huggingface dataset:
A Probabilistic XML Approach to Data Integration
Authors: Maurice van Keulen, Ander de Keijzer, Wouter Alink
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

In mobile and ambient environments, devices need to become autonomous, managing and resolving problems without interference from a user. The database of a (mobile) device can be seen as its knowledge about objects in the ýreal worldý. Data exchange between small and/or large computing devices can be used to supplement and update this knowledge whenever a connection gets established. In many situations, however, data from different data sources referring to the same real world objects, may conflict. It is the task of the data management system of the device to resolve such conflicts without interference from a user. In this paper, we take a first step in the development of a probabilistic XML DBMS. The main idea is to drop the assumption that data in the database should be certain: subtrees in XML documents may denote possible views on the real world. We formally define the notion of probabilistic XML tree and several operations thereon. We also present an approach for determining a logical semantics for queries on probabilistic XML data. Finally, we introduce an approach for XML data integration where conflicts are resolved by the introduction of possibilities in the database.
Using mappings to prove timing properties
Authors: Nancy A. Lynch, Hagit Attiya
Venue: Distributed Computing (1992)

A new technique for proving timing properties for timing-based algorithms is described; it is an extension of the mapping techniques previously used in proofs of safety properties for asynchronous concurrent systems. The key to the method is a way of representing a system with timing constraints as an automaton whose state includes predictive timing information. Timing assumptions and timing requirements for the system are both represented in this way. A multi-valued mapping from the "assumptions automaton" to the "requirements automaton" is then used to show that the given system satisfies the requirements. One type of mapping is based on a collection of "progress functions" providing measures of progress toward timing goals. The technique is illustrated with two examples, a simple resource manager and a two-process race system.
Wormhole Attacks Detection in Wireless Ad Hoc Networks: A Statistical Analysis Approach
Authors: Ning Song, Lijun Qian, Xiangfang Li
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 17 - Volume 18 (2005)

Various routing attacks for single-path routing have been identified for wireless ad hoc networks and the corresponding counter measures have been proposed in the literature. However, the effects of routing attacks on multi-path routing have not been addressed. In this paper, the performance of multi-path routing under wormhole attack is studied in detail. The results show that multi-path routing is vulnerable to wormhole attacks. A simple scheme based on statistical analysis (called SAM) is proposed to detect such attacks and to identify malicious nodes. Comparing to the previous approaches (for example, using packet leash), no special requirements (such as time synchronization or GPS) are needed in the proposed scheme. Simulation results demonstrate that SAM successfully detects wormhole attacks and locates the malicious nodes in networks with different topologies and with different node transmission range. Moreover, SAM may act as a module in local detection agents in an intrusion detection system (IDS) for wireless ad hoc networks.
Flexible Consistency for Wide Area Peer Replication
Authors: Sai Susarla, John Carter
Venue: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (2005)

The lack of a flexible consistency management solution hinders P2P implementation of applications involving updates, such as read-write file sharing, directory services, online auctions and wide area collaboration. Managing mutable shared data in a P2P setting requires a consistency solution that can operate efficiently over variable-quality failure-prone networks, support pervasive replication for scaling, and give peers autonomy to tune consistency to their sharing needs and resource constraints. Existing solutions lack one or more of these features. In this paper, we describe a new consistency model for P2P sharing of mutable data called composable consistency, and outline its implementation in a wide area middleware file service called Swarm¹. Composable consistency lets applications compose consistency semantics appropriate for their sharing needs by combining a small set of primitive options. Swarm implements these options efficiently to support scalable, pervasive, failure-resilient, wide-area replication behind a simple yet flexible interface. We present two applications to demonstrate the expressive power and effectiveness of composable consistency: a wide area file system that outperforms Coda in providing close-to-open consistency overWANs, and a replicated BerkeleyDB database that reaps order-of-magnitude performance gains by relaxing consistency for queries and updates.
Using Ontology for Description of Grid Resources
Authors: A. M. Pernas, M. A. R. Dantas
Venue: Proceedings of the 19th International Symposium on High Performance Computing Systems and Applications (2005)

Grid computing environments can share resources and services in a large-scale. These environments are being considered as an effective solution for many organizations to execute distributed applications to obtain high level of performance and availability. However, the use of a grid environment can be a complex task for an ordinary user, demanding a previous knowledge of the access requirements from a virtual organization. In order to improve the search of resources and its selection, in this paper we propose the use of ontology as alternative approach to help the use of grid services. This paradigm can provide a description of available resources in a grid configuration, leading users to desire operations and describing resources syntax and semantics that can form a common domain vocabulary. Our experimental result indicates that our proposal allows a better comprehension about available resources main text.
Managers' email: beyond tasks and to-dos
Authors: Catalina Danis, Wendy A. Kellogg, Tessa Lau, Mark Dredze, Jeffrey Stylos, Nicholas Kushmerick
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

In this paper, we describe preliminary findings that indicate that managers and non-mangers think about their email differently. We asked three research managers and three research non-managers to sort about 250 of their own email messages into categories that "would help them to manage their work." Our analyses indicate that managers create more categories and a more differentiated category structure than non-managers. Our data also suggest that managers create "relationship-oriented" categories more often than non-managers. These results are relevant to research on "email overload" that has highlighted the use of email for activities beyond communication. In particular, our findings suggest that too strong a focus on task management may be incomplete, and that a user's organizational role has an impact on their conceptualization and likely use of email.
Parallel out-of-core computation and updating of the QR factorization
Authors: Brian C. Gunter, Robert A. Van De Geijn
Venue: ACM Transactions on Mathematical Software (TOMS) (2005)

This article discusses the high-performance parallel implementation of the computation and updating of QR factorizations of dense matrices, including problems large enough to require out-of-core computation, where the matrix is stored on disk. The algorithms presented here are scalable both in problem size and as the number of processors increases. Implementation using the Parallel Linear Algebra Package (PLAPACK) and the Parallel Out-of-Core Linear Algebra Package (POOCLAPACK) is discussed. The methods are shown to attain excellent performance, in some cases attaining roughly 80&percent; of the &ldquo;realizable&rdquo; peak of the architectures on which the experiments were performed.
China great wall digital cultural heritage
Authors: Eldon C. Hylton
Venue: Computers in Entertainment (CIE) (2005)

Early in 2004 the Chinese government established a foundation whose mission is to protect and preserve the Great Wall of China and to articulate the Bo Da Jing Sheng or "profound esteem" that emanates from the 3,000 years of history encompassing the Great Wall. The Great Wall is the cultural icon of China, and is directly linked to China's long history. The China Great Wall Society (CGWS) and IMC have recently executed a letter of intent that together we will utilize state-of-the-art digital technologies and apply them to the preservation and protection of the Great Wall and to the creation of content to disseminate the history and knowledge embodied in this unique cultural heritage. The Great Wall represents a time-line of Chinese history.On September 1, 2004, Xu Jia Lu of the National People's Congress and chairman of the China Great Wall Society emphasized the need to formulate a five-year plan to retrieve, protect, restore, and develop a Great Wall database that can be utilized for future research, educational purposes, and the dissemination internationally of China's cultural heritage. The Great Wall project is multi-dimensional in scope, with two complementary missions: (1) physical and virtual restoration of the Great Wall, and (2) the development of a Great Wall database. The goal of the plan is to bring knowledge of the Great Wall to the world and to leave the children of China a Great Wall that is physically preserved and its underlying cultural heritage appreciated internationally.
Bayesian selective combination of multiple neural networks for improving long-range predictions in nonlinear process modelling
Authors: Zainal Ahmad, Jie Zhang
Venue: Neural Computing and Applications (2005)

A Bayesian selective combination method is proposed for combining multiple neural networks in nonlinear dynamic process modelling. Instead of using fixed combination weights, the probability of a particular network being the true model is used as the combination weight for combining that network. The prior probability is calculated using the sum of squared errors of individual networks on a sliding window covering the most recent sampling times. A nearest neighbour method is used for estimating the network error for a given input data point, which is then used in calculating the combination weights for individual networks. Forward selection and backward elimination are used to select the individual networks to be combined. In forward selection, individual networks are gradually added into the aggregated network until the aggregated network error on the original training and testing data sets cannot be further reduced. In backward elimination, all the individual networks are initially aggregated and some of the individual networks are then gradually eliminated until the aggregated network error on the original training and testing data sets cannot be further reduced. Application results demonstrate that the proposed techniques can significantly improve model generalisation and perform better than aggregating all the individual networks.
Content and laboratories of a computing science course for non-majors in the 21st Century
Authors: Barbara Zimmerman
Venue: Journal of Computing Sciences in Colleges (2004)

The field of computer science evolves very quickly, and courses in computer science must evolve to keep up. Our Villanova University computer science courses for non-computer majors teach the theory of computer science and illustrate this theory through a set of laboratories. One of these courses, Fundamentals of Computing Systems, has been re-examined. While the labs for this course have kept up with changes in operating systems and textbooks, necessary revisions to the set of lectures and laboratories must continue to be made to ensure that the course is meeting the students' needs.
Iterative refinement of generalized matrix inverses now practicable
Authors: Gerhard Zielke
Venue: ACM SIGNUM Newsletter (1978)

As you know the iterative refinement of generalized matrix inverses is an unsolved problem [3], [5] so far because the usual iterative methods for inverting nonsingular matrices lose their valuable property to be self-correcting if applied to nonregular matrices. The following example of a second-order iterative method
Towards virtualization of user interfaces based on UsiXML
Authors: José Pascual Molina Massó, Jean Vanderdonckt, Francisco Montero Simarro, Pascual González López
Venue: Proceedings of the tenth international conference on 3D Web technology (2005)

A model-based approach is presented for structuring a development process of virtual user interfaces based on UsiXML, a XML-compliant User Interface Description Language. UsiXML provides a Concrete User Interface description that remains independent from any toolkit, whether graphical or virtual. To support the rendering of this description in a virtual world, two toolkits have been developed: for VRML97 and X3D. The user interface description can be edited within an appropriate graphical editor, in 2D for instance, and leads to 2D or 3D rendering or an automated generation of a 2D graphical user interface in Java or a 3D virtual user interface in VRML97 or X3D, for both presentation and behavior parts. When any element involved in the Concrete User Interface changes, the corresponding virtual user interface changes accordingly, thus reducing development time and complexity. In this way, a virtual user interface can be produced with the advantage of raising the level of abstraction with respect to any language. This paper focuses on the 3D user interfaces.
Document Engineering: analyzing and designing the semantics of Business Service Networks
Authors: Robert J. Glushko, Tim McGrath
Venue: Proceedings of the IEEE EEE05 international workshop on Business services networks (2005)

Behind the idea of Business Services Networks lies the very simple and natural idea of document exchange. But when they are implemented without disciplined semantics, the input and output documents of business processes often partition their information in incompatible ways, severely constraining the loosely coupled, "plug and play" interoperability that is the defining vision of business service networks.This paper introduces the new discipline of Document Engineering, a set of analysis and design techniques that yield meaningful and reusable models of the information exchanges within and between enterprises.Document Engineering relies on the skills and tools of business process, document, data, and task analysis. One of the innovations of Document Engineering is to exploit these different techniques for reaching the same goalAs a result, with business services developed using Document Engineering techniques the semantics are precise, based on patterns to make them reusable, and support a complete and unambiguous relationship between the model and the schemas and software that implements it.
Cisco CallManager Fundamentals: A Cisco AVVID Solution (2nd Edition)
Authors: John Alexander, Chris Pearce, Anne Smith, Delon Whetten
Venue:  (2005)

Exposes the inner workings of Cisco CallManager to help you maximize your Cisco IP Communications solution Read new content on QSIG, SIP trunks, video support, hunt lists and line groups, time-of-day routing, and new features added in CallManager releases 3.2, 3.3, 3.4, 4.0, and 4.1 Review content from the first edition that has been fully revised and updated to CallManager release 4.1 Learn how to deploy and manage a CallManager solution Understand the components that make up CallManager call routing through the use of basic to advanced examples that solve enterprise call routing problems Gain a full understanding of how CallManager manages media resources and processes information for conferencing, transcoding, annunciation, and more Learn detailed information about North American and international dial plans, trunk and station devices, media resources, and much moreï¾ Cisco CallManager Fundamentals, Second Edition, provides examples and reference information about Cisco® CallManager, the call-processing component of the Cisco IP Communications solution. Cisco CallManager Fundamentals uses examples and architectural descriptions to explain how CallManager processes calls. This book details the inner workings of CallManager so that those responsible for designing and maintaining a Voice over IP (VoIP) solution from Cisco Systems® can understand the role each component plays and how they interrelate.This book is the perfect resource to supplement your understanding of CallManager. You'll learn detailed information about dial plan management and call routing, hardware and software components, media processing, call detail records, system management and monitoring, and the history of CallManager. The authors, all members of the original team that developed and implemented the CallManager software and documentation from its early stages, also provide a list of features and Cisco solutions that integrate with CallManager.This second edition of Cisco CallManager Fundamentals covers software releases through release 4.1. With this book, you will gain a deeper understanding of the system and find answers to questions not available in any other source.This book is part of the Cisco Press® Fundamentals Series. Books in this series introduce networking professionals to new networking technologies, covering network topologies, example deployment concepts, protocols, and management techniques.
IPSec VPN Design
Authors: Vijay Bollapragada, Mohamed Khalid, Scott Wainner
Venue:  (2005)

The definitive design and deployment guide for secure virtual private networks Learn about IPSec protocols and Cisco IOS IPSec packet processing Understand the differences between IPSec tunnel mode and transport mode Evaluate the IPSec features that improve VPN scalability and fault tolerance, such as dead peer detection and control plane keepalives Overcome the challenges of working with NAT and PMTUD Explore IPSec remote-access features, including extended authentication, mode-configuration, and digital certificates Examine the pros and cons of various IPSec connection models such as native IPSec, GRE, and remote access Apply fault tolerance methods to IPSec VPN designs Employ mechanisms to alleviate the configuration complexity of a large- scale IPSec VPN, including Tunnel End-Point Discovery (TED) and Dynamic Multipoint VPNs (DMVPN) Add services to IPSec VPNs, including voice and multicast Understand how network-based VPNs operate and how to integrate IPSec VPNs with MPLS VPNsAmong the many functions that networking technologies permit is the ability for organizations to easily and securely communicate with branch offices, mobile users, telecommuters, and business partners. Such connectivity is now vital to maintaining a competitive level of business productivity. Although several technologies exist that can enable interconnectivity among business sites, Internet-based virtual private networks (VPNs) have evolved as the most effective means to link corporate network resources to remote employees, offices, and mobile workers. VPNs provide productivity enhancements, efficient and convenient remote access to network resources, site-to-site connectivity, a high level of security, and tremendous cost savings.IPSec VPN Design is the first book to present a detailed examination of the design aspects of IPSec protocols that enable secure VPN communication. Divided into three parts, the book provides a solid understanding of design and architectural issues of large-scale, secure VPN solutions. Part I includes a comprehensive introduction to the general architecture of IPSec, including its protocols and Cisco IOS® IPSec implementation details. Part II examines IPSec VPN design principles covering hub-and-spoke, full-mesh, and fault-tolerant designs. This part of the book also covers dynamic configuration models used to simplify IPSec VPN designs. Part III addresses design issues in adding services to an IPSec VPN such as voice and multicast. This part of the book also shows you how to effectively integrate IPSec VPNs with MPLS VPNs.IPSec VPN Design provides you with the field-tested design and configuration advice to help you deploy an effective and secure VPN solution in any environment.This security book is part of the Cisco Press® Networking Technology Series. Security titles from Cisco Press help networking professionals secure critical data and resources, prevent and mitigate network attacks, and build end-to-end self-defending networks.
A Grid-Enabled Web Map Server
Authors: Giovanni Aloisio, Massimo Cafaro, Dario Conte, Sandro Fiore, Italo Epicoco, Gian Paolo Marra, Gianvito Quarta
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

Today Geographic Information Systems (GIS) provide several tools for studying and analyzing varied human and natural phenomena, therefore GIS and geospatial data has grown so much in both public and private organizations. A Challenge is the integration of these data to get innovative and exhaustive knowledge about topics of interest. In this paper we describe the design of a Web Map Service (WMS) OGC-compliant, through the use of grid computing technology and demonstrate how this approach can improve, w.r.t. security, performance, efficiency and scalability, the integration of geospatial multi-source data. End users, with a single sign-on, securely and transparently, gets maps whose data are distributed on heterogeneous data sources belonging to one o more Virtual Organizations via distributed queries in a grid computing environment.
Optimal covering designs: complexity results and new bounds
Authors: Pilu Crescenzi, Federico Montecalvo, Gianluca Rossi
Venue: Discrete Applied Mathematics (2004)

In this paper we investigate the problem of computing optimal lottery schemes. From a computational complexity point of view, we prove that the variation of this problem in which the sets to be covered are specified in the input is log |I|-approximable (where I denotes the collection of sets to be covered) and it cannot be approximated within a factor smaller than log |I|, unless P = NP. From a combinatorial point of view, we propose new constructions based on the combination of the partitioning technique and of known results regarding the construction of sets of coverings. By means of this combination we will be able to improve several upper bounds on the cardinality of optimal lottery schemes.
Modified noise for evaluation on graphics hardware
Authors: Marc Olano
Venue: Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware (2005)

Perlin noise is one of the primary tools responsible for the success of procedural shading in production rendering. It breaks the crisp computer generated look by adding apparent randomness that is controllable and repeatable. Both Perlin's original noise algorithm and his later improved noise were designed to run efficiently on a CPU. These algorithms do not map as well to the design and resource limits of the typical GPU. We propose two modifications to Perlin's improved noise that make it much more suitable for GPU implementation, allowing faster direct computation. The modified noise can be totally evaluated on the GPU without resorting to texture accesses or "baked" into a texture with consistent appearance between textured and computed noise. However, it is most useful for 3D and 4D noise, which cannot easily be stored in reasonably-sized textures. We present one implementation of our modified noise using computation or direct texturing for 1D and 2D noise, and a procedural combination of 2D textures for the 3D noise.