ppxscal/embedding_network huggingface dataset:
Orthogonal Rendezvous Routing Protocol for Wireless Mesh Networks
Authors: Bow-nan Cheng, Murat Yuksel, Shivkumar Kalyanaraman
Venue: Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols (2006)

Routing in multi-hop wireless networks involves the indirection from a persistent name (or ID) to a locator. Concepts suchas coordinate space embedding help reduce the number and dynamism complexity of bindings and state needed for this indirection.Routing protocols which do not use such concepts often tend to flood packets during route discovery or dissemination, andhence have limited scalability. In this paper, we introduce Orthogonal Rendezvous Routing Protocol (ORRP) for meshed wirelessnetworks. ORRP is a lightweight, but scalable routing protocol utilizing directional communications (such as directional antennasor free-space-optical transceivers) to relax information requirements such as coordinate space embedding and node localization.The ORRP source and ORRP destination send route discovery and route dissemination packets respectively in locally-chosen orthogonaldirections. Connectivity happens when these paths intersect (i.e. rendezvous). We show that ORRP achieves connectivity withhigh probability even in sparse networks with voids. ORRP scales well without imposing DHT-like graph structures (eg: trees,rings, torus etc). The total state information required is O(N3/2) for N-node networks, and the state is uniformly distributed.ORRP does not resort to flooding either in route discovery or dissemination. The price paid by ORRP is suboptimality in termsof path stretch compared to the shortest path; however we characterize the average penalty and find that it is not severe.
Parametrically controlled terrain generation
Authors: K. Raiyan Kamal, Yusuf Sarwar Uddin
Venue: Proceedings of the 5th international conference on Computer graphics and interactive techniques in Australia and Southeast Asia (2007)

In this paper, we propose a novel approach towards parametrically controlled artificial terrain generation. Our proposed method focuses on generation of terrains having mountains of prespecified height and spread of base region and peak nearly at a prespecified location. Means of performing advanced tuning on the terrain to produce unusual artifacts on the terrain is also demonstrated and how our algorithm performs better in comparison with the well known terrain generation algorithms when used to solve the same problem is observed.
XPath Selectivity Estimation for a Mobile Auction Application
Authors: Sebastian Obermeier, Stefan Bottcher, Thomas Wycisk
Venue: Proceedings of the 11th International Database Engineering and Applications Symposium (2007)

Whenever nodes in a mobile network try to access an XML database server, the offered data must be somehow queried and transported by a mobile network to the querying node. For this purpose, two mechanisms are possible: query shipping and data shipping. Which one is better depends among other aspects on the query result size, more precisely on the overhead that data shipping incorporates compared to query shipping. In this paper, we present a query result size estimator that allows each mobile user to estimate the resulting size and cardinality of an XPath query by means of special distributed meta data in order to decide between query shipping or data shipping by comparing the estimated size of the result with the data that must be requested for data shipping. We show how the meta data is generated for certain query classes, how the meta data can be used to predict the result size and cardinality, and we give experimental results on the deviation of the predicted results.
Analysis of large clock meshes via harmonic-weighted model order reduction and port sliding
Authors: Xiaoji Ye, Peng Li, Min Zhao, Rajendran Panda, Jiang Hu
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

Clock meshes posses inherent low clock skews and excellent immunity to PVT variations, and have increasingly found their way to high-performance IC designs. However, analysis of such massively coupled networks is significantly hindered by the sheer size of the network and tight coupling between non-tree interconnects and large numbers of clock drivers. The presented Harmonic-weighted model order reduction algorithm is motivated by the key observation of the steady-state operation of the clock networks, and its efficiency is facilitated by the locality analysis via port sliding. The scalability of the analysis is significantly improved by eliminating the need of computing infeasible multi-port passive reduced order interconnect models with large port count. And the overall task is decomposed into tractable and naturally parallelizable model generation and FFT/Inverse-FFT operations, all on a per driver or per sink basis.
On the Design of Virtual Machine Sandboxes for Distributed Computing in Wide-area Overlays of Virtual Workstations
Authors: David Isaac Wolinsky, Abhishek Agrawal, P. Oscar Boykin, Justin R. Davis, Arijit Ganguly, Vladimir Paramygin, Y. Peter Sheng, Renato J. Figueiredo
Venue: Proceedings of the 2nd International Workshop on Virtualization Technology in Distributed Computing (2006)

With recent advances in virtual computing and the revelation that compute-intensive tasks run well on system virtual machines (VMs), the ability to develop, deploy, and manage distributed systems has been ameliorated. This paper explores the design space of VM-based sandboxes where the following techniques that facilitate the deployment of secure nodes in Wide-area Overlays of virtual Workstations (WOWs) are employed: DHCP-based virtual IP address allocation, self-configuring virtual networks supporting peer-to-peer NAT traversal, stacked file systems, and IPsec-based host authentication and end-to-end encryption of communication channels. Experiments with implementations of single-image VM sandboxes, which incorporate the above features and are easily deployable on hosted I/O VMMs, show execution time overheads of 10.6% or less for a batch-oriented CPU-intensive benchmark.
Technology and Digital Art: Towards the interactive filmic narrative-"Transparency": An experimental approach
Authors: Carlos Duarte de Sena Caires
Venue: Computers and Graphics (2007)

Nowadays, the cinematographic language claims for a specific type of interpretation and understanding. The emergence of the digital image and the innovative immersive reception devices provide new and diverse possibilities of reading and interacting within the filmic narrative. That is to say, cinema is constantly reinvented and explores potential renewals within the new interactive medias. This article reflects not only on the mutations of the filmic narrative, but also on its adaptation to interactivity. It proposes, also, new models of implementation, from traditional filmic narrative towards an interactive one. The experimental project Transparency illustrates it-it is a cinematographic project, which has the main goal of studying the interactive filmic narrative. An original plot has been created and adapted to an interactive narrative structure. The project is presented under the form of an installation allowing the spectators to choose the narrative sequences of the story.
SA-Chord: A Novel P2P System Based on Self-Adaptive Joining
Authors: XIAO-JIN REN, ZHI-MIN GU
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

In DHT system the uniform design decreases the routing performance and the highly dynamic characteristic increases the maintenance overhead. To solve those problems, in this paper we introduce SAChord, a novel P2P system based on self-adaptive joining. SA-Chord gets rid of the assuming of uniform. Nodes are divided into routing nodes and non-routing nodes in terms of their capacity. Routing nodes have strong capacity and form a routing ring to perform fast routing. To reduce the effect of highly dynamic characteristic, we design a new joining algorithm to decrease the cost of building finger table.
Attribute Storage Design for Object-based Storage Devices
Authors: Ananth Devulapalli, Dennis Dalessandro, Pete Wyckoff, Nawab Ali
Venue: Proceedings of the 24th IEEE Conference on Mass Storage Systems and Technologies (2007)

As storage systems grow larger and more complex, the traditional block-based design of current disks can no longer satisfy workloads that are increasingly metadata intensive. A new approach is offered by object-based storage devices (OSDs). By moving more of the responsibility of storage management onto each OSD, improvements in performance, scalability and manageability are possible. Since this technology is new, no physical object-based storage device is currently available. In this work we describe a software emulator for an object-based disk. We focus on the design of the attribute storage, which is used to hold metadata associated with particular data objects. Alternative designs are discussed, and performance results for an SQL implementation are presented.
Pulse Reflection in Transmission Lines
Authors: O. A. Horna
Venue: IEEE Transactions on Computers (1971)

A simple theory based on linear approximation of the transient waveform and on the superposition theorem permits the prediction of waveforms and amplitude of the ripple voltage at the receiving end of a line which transmits pulses with finite rise time and which is mismatched at both ends. The influence of every connection in a digital system can be determined in this way.
Software Structure for Display Management Systems
Authors: E. D. Carlson
Venue: IEEE Transactions on Software Engineering (1983)

Display management software usually provides support for: creating displays on a CRT (cathode ray tube) or other output device; handling user inputs from keyboards, light-pens, and other input devices; and communicating with an application program in terms of these outputs and inputs. We propose a design for a family of display management systems which provide device-independent, high-level support for applications programming. The design involves structuring the display management software as a set of modules, with three levels of interfaces. The key features of this design include: 1) separation of display specifications from the actual data to be displayed; 2) structured output and input specifications; 3) asynchronous, message passing inter-faces; and 4) a software structure based on hiding details of data structures, algorithms and device orders.
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Venue: Conference on Information and Knowledge Management (2007)

It is my great pleasure to welcome you to CIKM 2007 -- the 16th ACM Conference on Information and Knowledge Management. The Organizing Committee assumed the role of affirming CIKM as the premier conference at the confluence of information retrieval, databases and knowledge management. This is the second time the conference is taking place outside the USA. Lisbon, Portugal, is hosting the 2007 event under joint organization between ACM and the University of Lisbon. This is happening at a time when Portugal is holding the presidency of the European Union and many other events are taking place around the city. Lisbon, also known as the city of the explorers, was the departing point for many of the voyages of discovery, and the first true world city, the capital of an empire spreading over all continents. This makes it an ideal place for convening scientists from around the world to exchange new ideas concerning searching, managing and exploring information. The Program Co-chairs Alberto Laender, Deborah McGuinness and Ricardo Baeza-Yates rightfully deserve to be commended for assembling a superb Program Committee, which worked very hard to provide excellent peer feedback to the authors in a very short time. Thanks also to Bjørn Olstad and Øystein Haug Olsen, who chaired the Industrial Track. We had a record number of submissions (above 700 abstracts!) and accepted 86 of the reviewed papers (512) for presentation as full papers (17%). Because we had so many good papers, we decided to accept 49 as short papers for joint presentation in a poster session, and extended the usual limit from two to four pages.
Drawing cubic graphs with at most five slopes
Authors: Balázs Keszegh, János Pach, Dömötör Pálvölgyi, Géza Tóth
Venue: Computational Geometry: Theory and Applications (2008)

We show that every graph G with maximum degree three has a straight-line drawing in the plane using edges of at most five different slopes. Moreover, if every connected component of G has at least one vertex of degree less than three, then four directions suffice.
A Retargetable Software Timing Analyzer Using Architecture Description Language
Authors: Xianfeng Li
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

Worst case execution time (WCET) is an essential input for performance and schedulability analysis of real-time systems. Static WCET analysis requires program path analysis and microarchitecture modeling. Despite almost two decades of research, WCET analysis has not enjoyed wide acceptance in industry. This is in part due to the difficulty in microarchitecture modeling of modern processors. Given the large number of embedded processors available in the market, retargetability of the WCET analysis framework is a serious issue. In this paper, we address it using architecture description language (ADL). Starting with the ADL of a target processor, the proposed framework automatically generates graph-based execution models to capture timing effects of instructions in the pipeline. This pipeline model coupled with parameterized models of cache and branch prediction lead to a WCET framework that is safe, accurate and retargetable.
Seeing inside: Using social network analysis to understand patterns of collaboration and coordination in global software teams
Authors: Kate Ehrlich, Giuseppe Valetto, Mary Helander
Venue: Proceedings of the International Conference on Global Software Engineering (2007)

One of the pervasive challenges facing any software development team is getting the right level and timing of communication to ensure that people are able to coordinate their work effectively. Communication issues are difficult to address because important aspects of communication are largely invisible to both management and the individuals on the team. Communication challenges are further exaggerated in global software teams, because of the different timezones, cultures, and working environments. Social Network Analysis (SNA) is an established method for revealing patterns of human communication and decision-making. This tutorial introduces students to basic concepts in SNA, illustrates how SNA can be used to understand the dynamics of and address common communication problems in global software teams, and provides structured exercises in data capture, analysis and interpretation.
Pixel Clustering by Using Complex Network Community Detection Technique
Authors: Thiago C. Silva, Liang Zhao
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

Traditional data clustering techniques present difficulty in determination of clusters of arbitrary forms. On the other hand, graph theoretic methods seek topological or- ders among input data and, consequently, can solve the above mentioned problem. In this paper, we present an improved graph theoretic model for data clustering. The clustering process of this model is composed of two steps: network formation by using input data and hierarchical net- work partition to obtain clusters in different scales. Our network formation method always produces a connected graph with densely linked nodes within a community and sparsely linked nodes among different communities. The community detection technique used here has the advantage that it is completely free from physical distances among in- put data. Consequently, it is able to discover clusters of various forms correctly. Computer simulations show the promising performance of the model.
On polyhedra induced by point sets in space
Authors: Pankaj K. Agarwal, Ferran Hurtado, Godfried T. Toussaint, Joan Trias
Venue: Discrete Applied Mathematics (2008)

Given a set S of n>=3 points in the plane (not all on a line) it is well known that it is always possible to polygonize S, i.e., construct a simple polygon P such that the vertices of P are precisely the given points in S. For example, the shortest circuit through S is a simple polygon. In 1994, Grunbaum showed that an analogous theorem holds in R^3. More precisely, if S is a set of n>=4 points in R^3 (not all of which are coplanar) then it is always possible to polyhedronize S, i.e., construct a simple (sphere-like) polyhedron P such that the vertices of P are precisely the given points in S. Grunbaum's constructive proof may yield Schonhardt polyhedra that cannot be triangulated. In this paper several alternative algorithms are proposed for constructing such polyhedra induced by a set of points, which may always be triangulated, and which enjoy several other useful properties as well. Such properties include polyhedra that are star-shaped, have Hamiltonian skeletons, and admit efficient point-location queries. We show that polyhedronizations with a variety of such useful properties can be computed efficiently in O(nlogn) time. Furthermore, we show that a tetrahedralized, xy-monotonic, polyhedronization of S may be computed in time O(n^1^+^@e), for any @e>0.
Home Network Service Programs described in a Rule-based Language
Authors: Muneyuki Shimokura, Shuichi Nakanishi, Tadashi Ohta
Venue: Proceedings of the International Conference on Software Engineering Advances (2007)

Rule-based languages allow programs to be easily described at a high and abstract level, however, they suffer from long execution times. A state transition model, one of a standard model for developing telecommunication services programs, can be used to simply described home network services. To reduce the complexity of development, this paper proposes a method for describing service programs using a rule-based language. In this paper the easy-of-use of this method for novice users is tested using a home network to control a robot toy.
Software Science and Cognitive Psychology
Authors: N. S. Coulter
Venue: IEEE Transactions on Software Engineering (1983)

Halstead proposed a methodology for studying the process of programming known as software science. This methodology merges theories from cognitive psychology with theories from computer science. There is evidence that some of the assumptions of software science incorrectly apply the results of cognitive psychology studies. HAlstead proposed theories relative to human memory models that appear to be without support from psychologists. Other software scientists, however, report empirical evidence that may support some of those theories. This anomaly places aspects of software science in a precarious position. The three conflicting issues discussed in this paper are 1) limitations of short-term memory and number of sub-routine parameters, 2) searches in human memory and programming effort, and 3) psychological time and programming time.
Ontology Evaluation and Ranking using OntoQA
Authors: Samir Tartir, I. Budak Arpinar
Venue: Proceedings of the International Conference on Semantic Computing (2007)

Ontologies form the cornerstone of the Semantic Web and are intended to help researchers to analyze and share knowledge, and as more ontologies are being introduced, it is difficult for users to find good ontologies related to their work. Therefore, tools for evaluating and ranking the ontologies are needed. In this paper, we present OntoQA, a tool that evaluates ontologies related to a certain set of terms and then ranks them according a set of metrics that captures different aspects of ontologies. Since there are no global criteria defining how a good ontology should be, OntoQA allows users to tune the ranking towards certain features of ontologies to suit the need of their applications. We also show the effectiveness of OntoQA in ranking ontologies by comparing its results to the ranking of other comparable approaches as well as expert users.
Band-aid patching
Authors: Stelios Sidiroglou, Sotiris Ioannidis, Angelos D. Keromytis
Venue: Proceedings of the 3rd workshop on on Hot Topics in System Dependability (2007)

Testing vendor-issued patches remains one of the major hurdles to their speedy deployment. Studies have shown that administrators remain reluctant to quickly patch their systems, even when they have the capability to do so, partly because security patches in particular are often incomplete or altogether non-functional. We propose Band-aid Patching, a new approach for concurrently testing application patches. Using binary runtime injection techniques, we patch binaries such that when program execution reaches a program segment that has been affected by an issued patch, two (or more) program execution threads are created. These threads speculatively execute both parts of the code (patched and unpatched). Our system then retroactively selects one of the execution threads based on a variety of criteria, including obvious faultiness, prior history, and user input. We believe this approach to offer significant advantages to accelerating deployment of hot fixes while providing some assurance to system administrators. In this paper, we describe our initial thoughts on the system architecture, and provide some preliminary indications on the feasibility and performance impact of our scheme.
Implementation of the Database Machine Direct
Authors: H. Boral
Venue: IEEE Transactions on Software Engineering (1982)

DIRECT is a multiprocessor database machine designed and implemented at the University of Wisconsin. This paper describes our experiences with the implementation of DIRECT. We start with a brief overview of the original machine proposal and how it differs from what was actually implemented. We then describe the structure of the DIRECT software. This includes software on host computers that interfaces with the database machine; software on the back-end controller of DIRECT; and software executed by the query processors. In addition to describing the structure of the software we will attempt to motivate and justify its design and implementation. We also discuss a number of implementation issues (e.g., debugging of the code across several machines). We conclude the paper with a list of the "lessons" we have learned from this experience.
Column and batch reactive transport experiment parameter estimation using a genetic algorithm
Authors: Arash Massoudieh, Ann Mathew, Timothy R. Ginn
Venue: Computers Geosciences (2008)

This paper focuses on the application of a genetic algorithm (GA) in estimating the fate and transport parameters of a reacting solute from the column and batch experiments involving a saturated porous medium. A program is developed using C++ to model the column and batch data using kinetically controlled one- or two-site sorption models including linear and/or nonlinear forms. The objective of the algorithm is to minimize the sum of squared differences between the measured and modeled solute concentration data associated with column effluent (i.e., ''breakthrough curves''). The GA is capable of estimating transport and reactions parameters such as forward and reverse reaction rates and parameters of the nonlinear reaction models, from a given set of measured data. Further simulations have been performed to estimate the appropriate configurations of the GA, which assist the method in estimating the fate and transport parameters more efficiently. It is shown that a wide range of the GA parameters can lead to convergence to appropriate estimations. The results obtained from this study show that the capability of GAs to fit the column and batch experiment data is promising.