ppxscal/embedding_network huggingface dataset:
On the treeness of internet latency and bandwidth
Authors: Venugopalan Ramasubramanian, Dahlia Malkhi, Fabian Kuhn, Mahesh Balakrishnan, Archit Gupta, Aditya Akella
Venue: Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems (2009)

Existing empirical studies of Internet structure and path properties indicate that the Internet is tree-like. This work quantifies the degree to which at least two important Internet measures--latency and bandwidth--approximate tree metrics. We evaluate our ability to model end-to-end measures using tree embeddings by actually building tree representations. In addition to being simple and intuitive models, these trees provide a range of commonly-required functionality beyond serving as an analytical tool. The contributions of our study are twofold. First, we investigate the ability to portray the inherent hierarchical structure of the Internet using the most pure and compact topology, trees. Second, we evaluate the ability of our compact representation to facilitate many natural tasks, such as the selection of servers with short latency or high bandwidth from a client. Experiments show that these tasks can be done with high degree of success and modest overhead.
Design in digital government research
Authors: Jane Fedorowicz, Martin Dias, Steve Sawyer
Venue: Proceedings of the 10th Annual International Conference on Digital Government Research: Social Networks: Making Connections between Citizens, Data and Government (2009)

Digital government research often centers on information technology artifacts designed for the purpose of improving access to or processes within government. Because of the centricity of the technology artifact, much of this research builds upon theories and prescriptions adapted from the information systems discipline. In information systems, the study of artifact design has benefitted from the adoption of the rigor and generalizeability enabled by design science research. The purpose of this paper is to provide an overview of design science principles guiding the construction of technological artifacts, which we use to examine recent digital government research articles that fall into the design science camp. We assess these articles using Hevner et al.'s (2004) guidelines for conducting and presenting design science research, identify common strengths, and recommend how digital government researchers may benefit from applying a grounded view of design to expand the generalizeability of their work. Finally, we conclude the paper with a discussion of ways to open up the narrow focus of design science to a broader understanding of the impact of external factors, such as the environment and organizational milieu, on the complex setting most digital government innovation inhabits.
Mashups for the web-active user
Authors: Nan Zang
Venue: Proceedings of the 2008 IEEE Symposium on Visual Languages and Human-Centric Computing (2008)

With the abundance of information online, mashups are a powerful way to process and make sense of all the data that we are exposed to on a daily basis. However mashup creation is a complex task that requires expertise in advanced programming languages. Moreover, the currently available tools do not adequately support the technical knowhow of end users. In order to identify the skill mismatches between the tools and the users, we profile the web-active end user and propose directions for future research.
DB2 9 for z/OS Database Administration: Certification Study Guide
Authors: Susan Lawson, Daniel Luksetich
Venue:  (2008)

In order to become an IBM Certified Database Administrator - DB2 9 DBA for z/OS, you must pass two exams: DB2 9 Fundamentals Exam (Exam 730), and DB2 9 Database Administrator for z/OS (Exam 732)the primary focus focus of this book.Written by two members of the team who participated in the actual writing of the exam, this specialized study guide covers every topic that you will need to know to pass Exam 732, including database design and implementation, operation and recovery, security and auditing, performance, as well as installation and migration/upgrade. But that is only the beginning. It also covers the new features of DB2 9 for both database and application development.This comprehensive guide includes an extensive set of practice questions in each chapter that closely model the actual exam, along with an answer key with a description of why the answer is the correct one. No other source gives you this much help in passing the exam.Whether you plan to take Exam 732 or just want to master the skills needed to be an effective database administrator on z/OS systems, this is the only book youll need.With the DB2 9 for z/OS Database Administration Certification Study Guide, you will:Discover the changes to DB2 9 that youll need to know in order to besuccessful when taking the exam Learn how to effectively administer aDB2 database Receive an explanation of every objective included on thetestby someone involved in the creation of the actual exam Find 85practice questions based on the actual exams format and approach,along with comprehensive answers to help you gain understandingPublishers Note: While this book covers much of the information needed to prepare for Exam 730, a far more in-depth review of topics specifically related to Exam 730 can be found in the MC Press companion book: DB2 9 Fundamentals Certification Study Guide by Roger E. Sanders.
Bagging and boosting algorithms for support vector machine classifiers
Authors: Noritaka Shigei, Hiromi Miyajima
Venue: Proceedings of the 8th WSEAS international conference on Artificial intelligence, knowledge engineering and data bases (2009)

The performance of support vector machines (SVMs) greatly depends on the used values for hyperparameters. The tuning of hyper-parameters is a time-consuming task especially when the amount of data is large. In this paper, in order to overcome this difficulty, ensemble learning methods based on bagging and boosting are proposed. The proposed bagging methods reduce the computation time while keeping a reasonable accuracy. The proposed boosting method improves the accuracy of a conventional SVM classifier. The effectiveness of the proposed methods are demonstrated by numerical simulations.
Information Technology in Theory, 1st edition
Authors: Pelin Aksoy, Laura DeNardis
Venue:  (2007)

Explore the expansive world of information technology (IT) with this innovative book that will engage as it educates. The purpose of Information Technology in Theory is threefold: to provide a comprehensive and engaging overview of cutting-edge information technologies, to identify and discuss the fundamental principles underlying these technologies, and to investigate the reciprocal relationship between these technologies and society. Unlike other books on the market that focus exclusively on either the non-technical, business aspects of IT or the technical, computer-focused aspects, this book presents technical information along with discussions of how this information plays a role in everyday business, economic, and social life. Using state-of-the-art technologies and real-world examples, coverage includes the fundamental principles of how computers work, the mathematical and physical properties underlying digital multimedia creation, networking technologies, and key social issues in network security. With this breadth of knowledge, readers will acquire a valuable framework for formulating their own opinions about the important issues that today's IT environment raises.
GAMPS: compressing multi sensor data by grouping and amplitude scaling
Authors: Sorabh Gandhi, Suman Nath, Subhash Suri, Jie Liu
Venue: Proceedings of the 35th SIGMOD international conference on Management of data (2009)

We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within a given maximum (L∞) error ε. The problem arises naturally in applications that need to collect large amounts of data from multiple concurrent sources, such as sensors, servers and network routers, and archive them over a long period of time for offline data mining. We present GAMPS, a general framework that addresses this problem by combining several novel techniques. First, it dynamically groups multiple signals together so that signals within each group are correlated and can be maximally compressed jointly. Second, it appropriately scales the amplitudes of different signals within a group and compresses them within the maximum allowed reconstruction error bound. Our schemes are polynomial time O(α, β approximation schemes, meaning that the maximum (L∞) error is at most α ε and it uses at most β times the optimal memory. Finally, GAMPS maintains an index so that various queries can be issued directly on compressed data. Our experiments on several real-world sensor datasets show that GAMPS significantly reduces space without compromising the quality of search and query.
Planar Multibody Dynamics: Formulation, Programming and Applications, 1st edition
Authors: Parviz E. Nikravesh
Venue:  (2007)

Planar Multibody Dynamics: Formulation, Programming, and Applications presents analytical concepts, computational issues, and programming techniques for analyzing mechanical systems. Using clear and accessible language, this book demonstrates how simple methodologies can be applied to complex systems. It provides complete computer programs for analysis as well as Web access for updates. Detailed discussions address numerical and computational issues. The author uses MATLAB throughout the text, from the fundamental aspects to more advanced features. The combination of analytical principles and application examples makes this book a unique resource for students and practicing engineers. 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
Novel probabilistic combinational equivalence checking
Authors: Shih-Chieh Wu, Chun-Yao Wang, Yung-Chih Chen
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2008)

Exact approaches to combinational equivalence checking, such as automatic test pattern generation-based, binary decision diagrams (BDD)-based, satisfiability-based, and hybrid approaches, have been proposed over the last two decades. Recently, we proposed another exact approach using signal probability. This probability-based approach assigns probability values to the primary inputs and compares the corresponding output probability of two networks via a probability calculation process to assert if they are equivalent. The shortcoming of all these exact approaches is that if two networks are too complex to be handled, their equivalence cannot be determined, even with tolerance. An approximate approach, named the probabilistic approach, is a suitable way to give such an answer for those large circuits. However, despite generally being more efficient than exact approaches, the probabilistic approach faces a major concern of a non zero aliasing rate, which is the possibility that two different networks have the same output probability/signatures. Thus, minimizing aliasing rate is substantial in this area. In this paper, we propose a novel probabilistic approach based on the exact probability-based approach. Our approach exploits proposed probabilistic equivalence checking architecture to efficiently calculate the signature of network with virtually zero aliasing rate. We conduct experiments on a set of benchmark circuits, including large and complex circuits, with our probabilistic approach. Experimental results show that the aliasing rate is virtually-zero, e.g., 10-6013. Also, to demonstrate the effectiveness of our approach on error detection, we randomly inject errors into networks for comparison. As a resuit, our approach more efficiently detects the error than a commercial tool, Cadence LEC, does. Although our approach is not exact, it is practically useful. Thus, it can effectively complement exact methods to improve the efficiency and effectiveness of combination equivalence checking algorithms.
Two-dimensional non-symmetric half-plane recursive doubly complementary digital filters
Authors: Ju-Hong Lee, Yuan-Hau Yang
Venue: Signal Processing (2009)

This paper deals with the problem of two-dimensional (2-D) recursive doubly complementary (DC) digital filter design. We present a structure of 2-D recursive DC filters by using 2-D non-symmetric half-plane (NSHP) digital all-pass filters (DAFs). The novelty of using 2-D NSHP recursive DAFs to construct a 2-D recursive DC filter is that the resulting 2-D NSHP recursive DC filter shows better performance than conventional 2-D recursive DC filter based on 2-D quarter-plane (QP) DAFs. Moreover, the proposed structure possesses a favorable 2-D doubly complementary half-band (DC-HB) property that allows about half of the 2-D NSHP recursive DAF's coefficients to be zero. This leads to considerable savings in computational burden. To deal with the stability of the 2-D NSHP recursive DC filter during the design process, we can either impose some necessary constraints on the phases of the 2-D NSHP recursive DAFs or utilize a penalty function involving a stability error computed by using a spectral factorization-based algorithm to ensure the stability of a designed 2-D NSHP recursive DC filter pair. Design of a diamond-shape decimation/interpolation filter is presented for illustration and comparison.
Heuristic Search for Cluster Centroids: An Ant-Based Approach for FCM Initialization
Authors: Zhiding Yu, Ruobing Zou, Simin Yu
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part II (2009)

An ant-based approach to heuristic centroid searching is introduced. The proposed algorithm consists of three major stages: path construction, evaluation and pheromone updating. In the first stage, data pieces are deemed ants which probabilistically choose cluster centroids according to the heuristic and pheromone information of clusters. In the second stage, cluster centers are updated and cluster validity is evaluated using Bezdek's partition coefficient. In the third stage, pheromone concentration on clusters is updated. When an ant goes to a cluster, it leaves on this centroid pheromone information, the amount of which is determined by evaluation result obtained in the second stage. Initial cluster number is intentionally chosen to be large and cluster merging is performed once the following two conditions are satisfied: 1. Size of the smallest cluster is smaller than a threshold size proportional to the average cluster size; 2. Distance between the smallest cluster and its nearest one is less than a threshold distance. This merging mechanism is shown to enable auto determination of cluster number. The above stages are iteratively performed for a certain number of iterations. The found centroids are used to initialize FCM clustering algorithm. Results on test data sets show that the partitions found using the ant initialization are better optimized than those obtained from random initializations.
Wishbone: profile-based partitioning for sensornet applications
Authors: Ryan Newton, Sivan Toledo, Lewis Girod, Hari Balakrishnan, Samuel Madden
Venue: Proceedings of the 6th USENIX symposium on Networked systems design and implementation (2009)

The ability to partition sensor network application code across sensor nodes and backend servers is important for running complex, data-intensive applications on sensor platforms that have CPU, energy, and bandwidth limitations. This paper presents Wishbone, a system that takes a dataflow graph of operators and produces an optimal partitioning. With Wishbone, users can run the same program on a range of sensor platforms, including TinyOS motes, smartphones running JavaME, and the iPhone. The resulting program partitioning will in general be different in each case, reflecting the different node capabilities. Wishbone uses profiling to determine how each operator in the dataflow graph will actually perform on sample data, without requiring cumbersome user annotations. Its partitioning algorithm models the problem as an integer linear program that minimizes a linear combination of network bandwidth and CPU load and uses program structure to solve the problem efficiently in practice. Our results on a speech detection application show that the system can quickly identify good trade-offs given limitations in CPU and network capacity.
Accelerated Publication: Environmentally sustainable composite resistors with low temperature coefficient of resistance
Authors: Shweta Jagtap, Sunit Rane, Dinesh Amalnerkar
Venue: Microelectronic Engineering (2009)

Temperature coefficient of resistance (TCR) of thick film resistors are based on fired conducting grains and glass composites. Many analog sensor and control circuits require low (
GPU Accelerated RNA Folding Algorithm
Authors: Guillaume Rizk, Dominique Lavenier
Venue: Proceedings of the 9th International Conference on Computational Science: Part I (2009)

Many bioinformatics studies require the analysis of RNA or DNA structures. More specifically, extensive work is done to elaborate efficient algorithms able to predict the 2-D folding structures of RNA or DNA sequences. However, the high computational complexity of the algorithms, combined with the rapid increase of genomic data, triggers the need of faster methods. Current approaches focus on parallelizing these algorithms on multiprocessor systems or on clusters, yielding to good performance but at a relatively high cost. Here, we explore the use of computer graphics hardware to speed up these algorithms which, theoretically, provide both high performance and low cost. We use the CUDA programming language to harness the power of NVIDIA graphic cards for general computation with a C-like environment. Performances on recent graphic cards achieve a ×17 speed-up.
Rethinking cost and performance of database systems
Authors: Daniela Florescu, Donald Kossmann
Venue: ACM SIGMOD Record (2009)

Traditionally, database systems were optimized in the following way: "Given a set of machines, try to minimize the response time of each request." This paper argues that today, users would like a database system to optimize the opposite question: "Given a response time goal for each request, try to minimize the number of machines (i.e., cost in $)." Furthermore, this paper gives an example that demonstrates that the new optimization problem may result in a totally different system architecture.
Enthusing & inspiring with reusable kinaesthetic activities
Authors: Paul Curzon, Peter W. McOwan, Quintin I. Cutts, Tim Bell
Venue: Proceedings of the 14th annual ACM SIGCSE conference on Innovation and technology in computer science education (2009)

We describe the experiences of three University projects that use a style of physical, non-computer based activity to enthuse and teach school students computer science concepts. We show that this kind of activity is effective as an outreach and teaching resource even when reused across different age/ability ranges, in lecture and workshop formats and for delivery by different people. We introduce the concept of a Reusable Outreach Object (ROO) that extends Reusable Learning Objects. and argue for a community effort in developing a repository of such objects.
From pervasive to social computing: algorithms and deployments
Authors: Sonia Ben Mokhtar, Licia Capra
Venue: Proceedings of the 2009 international conference on Pervasive services (2009)

Pervasive Social Computing is becoming the incontrovertible evolution of pervasive computing, thanks to the pervasiveness of handheld devices and the enormous popularity of social networking websites. Moving away from the traditional human-device interaction paradigm, Pervasive Social Computing aims to take advantage of human social relationships, expressed as social networks, to enable the fulfilment of users' tasks on the move, ultimately promoting social interactivity. In order to realise this new vision, we present in this paper a model for the semantic specification of users' tasks, along with a set of algorithms for matching these specifications based on users' social preferences. Our model is based on the FOAF (Friend Of A Friend) ontology in order to support the semantic specification and reasoning on user social preferences and tasks. Using a variety of real social networking datasets, we analyse strengths and limitations of the various algorithms in terms of users' satisfaction, computational complexity and run-time overhead. We wrap up these algorithms into a Pervasive Social Computing middleware, and investigate the impact of alternative architectural deployments using different campus-based mobility traces, both in terms of users' satisfaction and communication overhead. Our thorough evaluation provides guidelines for the development of future Pervasive Social Computing applications, both in terms of matching and deployment strategies.
Methods and Tools to Support the Cooperative Design of One-of-a-Kind Products
Authors: Dieter H. Mueller, Heiko Gsell, Nils Homburg
Venue: Proceeding of the 2006 conference on Leading the Web in Concurrent Engineering: Next Generation Concurrent Engineering (2006)

To cope with the strong world-wide economic competition one-of-a-kind products are being designed cooperatively by former competitors to optimize the utilization of individual capacities. This trend is combined with a close integration of system suppliers into the early design process. Establishing a continuous workflow between these partners demands a highly flexible network for conception, design and production. In order to set up this network cooperation between the partners a flexible product data structure through which work packages containing design tasks can be exchanged and executed in different CAx systems has to be available. Supporting the exchange this is to be combined with a suitable communication structure hosted by a communication platform. The paper at hand describes an approach for the exchange of product data, which integrates a structural view to the design process as well as a work package structure represented through XML documents forming a practical product data model. The work packages are formed by predefined data objects representing particular product views which are relevant for the individual design task. This new type of cooperation is show at the example of the German shipbuilding industry and their main system suppliers.