ppxscal/embedding_network huggingface dataset:
The Maximum Degree of a Random Graph
Authors: Oliver Riordan, Alex Selby
Venue: Combinatorics, Probability and Computing (2000)

Let 0 < p < 1, q = 1 &minus; p and b be fixed and let G &isin; &Gscr;(n, p) be a graph on n vertices where each pair of vertices is joined independently with probability p. We show that the probability that every vertex of G has degree at most pn + b &radic;npq is equal to (c + o(1))n, for c = c(b) the root of a certain equation. Surprisingly, c(0) = 0.6102 &hellip; is greater than &frac12; and c(b) is independent of p. To obtain these results we consider the complete graph on n vertices with weights on the edges. Taking these weights as independent normal N(p, pq) random variables gives a &lsquo;continuous&rsquo; approximation to &Gscr;(n, p) whose degrees are much easier to analyse.
An Auto-Calibrated Laser-Pointing Interface for Large Screen Displays
Authors: Dominic Laberge, Jean-François Lapointe, Emil M. Petriu
Venue: Proceedings of the Seventh IEEE International Symposium on Distributed Simulation and Real-Time Applications (2003)

Most of the current laser pointing interfaces use a vision based approach, which requires camera calibration. This paper presents the use of a planar homography-based auto-calibratedtechnique to eliminate the camera calibration step, thus simplifying the setup process. The system performance of a user interface implemented with this technique is then analyzed in details.
Simulating Computable Overlapping Generations Models with TROLL
Authors: Frédéric Docquier, Philippe Liégeois
Venue: Computational Economics (2004)

In this paper, we examine the performance of the TROLL stacked-time algorithm in the simulation of large scale overlapping generations (OLG) models. At each period of time, the number of equations is proportional to the individual length of lifetime. The model size and the data requirements may thus be very large. Given the repetitive structure of the equations, we show how TROLL specific macrocommands can be used to explode a generic version (in which the lifetime is parameterized) into a complete model. A similar technique applies to explode the initial dataset on the whole simulation horizon. The stability properties of the model are derived and the stacked-time algorithm performances are checked for a large scale model with endogenous labour supply and uncertain lifetime. It turns out that TROLL performances are very attractive even for a system of 300000 simultaneous equations.
Modeling technology impact on cluster microprocessor performance
Authors: Lucian Codrescu, Steve Nugent, James Meindl, D. Scott Wills
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2003)

The growing speed gap between transistors and wire interconnects is forcing the development of distributed, or clustered, architectures. These designs partition the chip into small regions with fast intracluster communication. Longer latency is required to communicate between clusters. The hardware and/or software are responsible for scheduling instructions to clusters such that critical path communication occurs within a cluster. This paper presents GENEric SYstems Simulator (GENESYS), a technology modeling tool that captures a broad range of materials, device, circuit, and interconnect parameters across current and future semiconductor technology. This tool is used to explore the relationship between key technology parameters (intercluster wire delay and transistor switching delay) and key architecture parameters (super scalar versus multithreaded instruction dispatch, and value prediction support). GENESYS is used to predict intercluster latencies as VLSI technology advances. The study provides quantitative data showing how conventional superscalar performance is degraded with increasing wire latency. Threaded designs are more tolerant to wire delay. Optimal thread size changes with advancing VLSI technology, suggesting a highly adaptive architecture. Value prediction is shown to be useful in all cases, but provides more benefit to the multithreaded design.
Differential approaches for computing Euclidean diagonal norm balanced realizations in control theory
Authors: N. Del Buono, L. Lopez
Venue: Future Generation Computer Systems (2003)

In this paper we propose dynamical systems for computing diagonal balanced realizations arising in control theory, particularly, we deal with Euclidean diagonal norm balanced realizations. The limiting solution of a differential flow appears to be a possible way of finding such realizations since no direct algebraic algorithm is known.
Revisiting ERP Systems: Benefit Realisation
Authors: Paul Hawking, Andrew Stein, Susan Foster
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 8 - Volume 8 (2004)

Many companies initially implemented their ERP systems to solve Y2K and disparate systems issues. These same companies are now looking at a how to strategically leverage their investment in these systems through the implementation "second wave" functionality. This paper identifies the expected and actual benefits of "second wave" implementations. In addition it identifies barriers, which limit the benefit realisation. The findings reinforce that ERPimplementations are people focussed projects which rely heavily on change management for success.
AMRST: adaptive multicast routing protocol for satellite-terrestrial networks
Authors: Chao-hsu Chang, Eric Hsiao-kuang Wu
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2003)

Multicasting facilitates the distributing of multimedia information to an entire set of destinations simultaneously. However, the subsequent mass of Internet traffic usually increases the network congestion and degrades network utilization. The unexpected congestion together with limited network capacity might challenge the provision of multimedia services especially since multicast subscribers are widely scattered. The desired QoS of the ongoing services cannot be guaranteed. To address this challenge, in addition to installing new terrestrial broadband networks, another feasible solution would be to integrate now available broadcasting-oriented broadband satellite networks into the Internet backbone. This paper presents a novel adaptive multicast routing (AMRST) protocol to deliver reliable and adaptive multicast services to global subscribers, based on an integrated infrastructure, called a satellite-terrestrial network (ST network), which provides dynamic bandwidth allocation, flexible resource management and ubiquitous transmission. In the AMRST, a proposed virtual hierarchical routing tree was applied in constructing an efficient multicast tree. A routing decision model was proposed to determine routing path for the member requests. A "hierarchical membership maintenance" approach was designed to maintain the multicast membership. The scalability of the AMRST was further addressed. The AMRST not only kept the benefits of the traditional terrestrial multicast but also promoted the multicasting performance by employing the satellite broadcasting capability. The simulation results demonstrate that the AMRST performed excellently for the ST network.
The Economics of Spam
Authors: Eric Allman
Venue: Queue (2003)

You know what I hate about spam filtering? Most of what we do today hurts the people who are already being hurt the most. Think about it: Who pays in the spam game? The recipients. That’s what’s wrong in the first place—the wrong folks pay for this scourge.
Measuring and analyzing the characteristics of Napster and Gnutella hosts
Authors: Stefan Saroiu, Krishna P. Gummadi, Steven D. Gribble
Venue: Multimedia Systems (2003)

The popularity of peer-to-peer multimedia file sharing applications such as Gnutella and Napster has created a flurry of recent research activity into peer-to-peer architectures. We believe that the proper evaluation of a peer-to-peer system must take into account the characteristics of the peers that choose to participate in it. Surprisingly, however, few of the peer-to-peer architectures currently being developed are evaluated with respect to such considerations. In this paper, we remedy this situation by performing a detailed measurement study of the two popular peer-to-peer file sharing systems, namely Napster and Gnutella. In particular, our measurement study seeks to characterize the population of end-user hosts that participate in these two systems. This characterization includes the bottleneck bandwidths between these, hosts and the Internet at large, IP-level latencies to send packets to these hosts, how often hosts connect and disconnect from the system, how many files hosts share and download, the degree of cooperation between the hosts, and several correlations between these characteristics. Our measurements show that there is significant heterogeneity and lack of cooperation across peers participating in these systems.
Motifs in Ziv-Lempel-Welch Clef
Authors: Alberto Apostolico, Matteo Comin, Laxmi Parida
Venue: Proceedings of the Conference on Data Compression (2004)

We present variants of classical data compression paradigms by Ziv, Lempel, and Welchin which the phrases used in compression are selected among suitably chosen motifs, definedhere as strings of intermittently solid and wild characters that recur more or less frequently inthe source textstring.This notion emerged primarily in the analysis of biological sequencesand molecules.Whereas the number of motifs in a sequence or family may be exponentialin the size of the input, a linear-sized basis of irredundant motifs may be defined such thatany other motif can be obtained by the union of a suitable subset from the basis.Previousstudy has exposed the advantages of using irredundant motifs in lossy as well as lossless off-line compression.In the present paper, we examine adaptations and extensions of classical incremental ZL and ZLW paradigms.First, hybrid schemata are proposed along these lines, in which motifs may be discovered and selected off-line, while the parse and encoding is still conducted on-line.The performances thus obtained improve on the one hand over previous off-line implementations of motif-based compression, and on the other, over the traditionally best implementations of ZLW.On the basis of this, both lossy and losslessmotif-based schemata are introduced and tested that follow more closely the ZL and ZLWparadigms.
Workshop on network-I/O convergence: experience, lessons, implications (NICELI)
Authors: Vinay Aggarwal, Olaf Maennel, Jeffrey Mogul, Allyn Romanow
Venue: ACM SIGCOMM Computer Communication Review (2003)

This is a summary of the NICELI workshop, based on scribe reports written by Olaf Maennel and Vinay Aggarwal, and edited by Jeffrey Mogul and Allyn Romanow with help from the NICELI attendees. The workshop was held in conjunction with SIGCOMM 2003 on 27 August 2003 in Karlsruhe, Germany.Papers and presentations from the workshop are available on the Web at http://www.acm.org/sigs/sigcomm/sigcomm2003/workshop/niceli/Note-taking during an active discussion is a fallible process, so these notes may contain errors. We have encouraged participants to help us find these errors. Corrections made after this article goes to press may be found at the NICELI Web site.
Model Order Reduction Techniques for Linear Systems with Large Numbers of Terminals
Authors: Peter Feldmann
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 2 (2004)

This paper addresses the well known difficulty of applying model order reduction (MOR) to linear circuits with a large number of input-output terminals. Traditional MOR techniques substitute the original large but sparse matrices used in the mathematical modeling of linear circuits by models that approximate the behavior of the circuit at its terminals, and use significantly smaller matrices. Unfortunately these small MOR matrices become dense as the number of terminals increases, thus canceling the benefits of size reduction. The paper introduces a model reduction technique suitable for circuits with numerous terminals. Thetechnique exploits the correlation that almost always exists between circuit responses at different terminals. The correlation is rendered explicit through an SVD-based algorithm and the result is a substantial sparsi.cation of the MOR matrices. The proposed sparsification technique is applicable to a large class of problems encountered in the analysis and design of interconnect in VLSI circuits. Relevant examples are used to analyze and validate the method.
Enhanced Cluster k-Ary n-Cube, A Fault-Tolerant Multiprocessor
Authors: Baback A. Izadi, Füsun Özgüner
Venue: IEEE Transactions on Computers (2003)

In this paper, we present a strongly fault-tolerant design for the k-ary n-cube multiprocessor and examine its reconfigurability. Our design augments the k-ary n-cube with {({\frac{k}{j}})}^n spare nodes. Each set of j^n regular nodes is connected to a spare node and the spare nodes are interconnected as either a ({\frac{k}{j}}){\hbox{-}}{\rm ary}n-cube if j \ne {\frac{k}{2}} or a hypercube of dimension n if j = {\frac{k}{2}}. Our approach utilizes the capabilities of the wave-switching communication modules of the spare nodes to tolerate a large number of faulty nodes. Both theoretical and experimental results are examined. Compared with other proposed schemes, our approach can tolerate significantly more faulty nodes with a low overhead and no performance degradation.
Network-on-Chip Modeling for System-Level Multiprocessor Simulation
Authors: Jan Madsen, Shankar Mahadevan, Kashif Virk, Mercury Gonzalez
Venue: Proceedings of the 24th IEEE International Real-Time Systems Symposium (2003)

With the increasing number of transistors available ona single chip, the System-on-Chip (SoC) paradigm hasevolved to exploit its full potential. As many processorscan be accommodated on a single chip, this paradigmhas forced a communication-centric, as opposed to acomputation-centric, design view. Thus, the choice, managementand modeling of the SoC interconnect is essentialfor an accurate evaluation and optimization of the globalperformance of a system. Recently, the notion of Network-on-Chip (NoC) has been introduced as a way to extend theclassical bus-based interconnection, which is still the dominantinterconnect structure for SoC's, into a dedicated, segmentedand, possibly, packet-switched network fabric [2].In this paper, we present a NoC model which, together witha multiprocessor real-time operating system (RTOS) model,allows us to model and analyze the behavior of a complexsystem that has a real-time application running on amultiprocessor platform. We demonstrate the potential ofour model by simulating and analyzing a small multiprocessorsystem connected through different NoC topologies,and discus how the simulation model may be used duringthe design-space exploration phase.
Access-controlled resource discovery for pervasive networks
Authors: Sanjay Raman, Dwaine Clarke, Matt Burnside, Srinivas Devadas, Ronald Rivest
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Networks of the future will be characterized by a variety of computational devices that display a level of dynamism not seen in traditional wired networks. Because of the dynamic nature of these networks, resource discovery is one of the fundamental problems that must be faced. While resource discovery systems are not a novel concept, securing these systems in an efficient and scalable way is challenging. This paper describes the design and implementation of an architecture for access-controlled resource discovery. This system achieves this goal by integrating access control with the Intentional Naming System (INS), a resource discovery and service location system. The integration is scalable, efficient, and fits well within a proxy-based security framework designed for dynamic networks. We provide performance experiments that show how our solution outperforms existing schemes. The result is a system that provides secure, access-controlled resource discovery that can scale to large numbers of resources and users.
A note on the selection of the step size in the variable step-size St&#x00F6;rmer method
Authors: H. Ramos, J. Vigo-Aguiar
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

Störmer method is a multistep code with fixed step suitable for the numerical integration of second-order differential equations of the special form y''(x) = f(x,y(x)), y(x0) = y0, y'(x0) = y'0, (1) where the right hand side does not include the derivative of y [4, p.462].
Guest Editor's Introduction: A Pathway to Decisions on Earth's Environment and Natural Resources
Authors: Ghassem R. Asrar
Venue: Computing in Science and Engineering (2004)

Earth is the only planet in our solar system that has maintained relatively stable climate conditions over geological time scales, a feat that has allowed highly diversified life to evolve. Why is this, and what makes the Earth system so unique?
The Impact of False Sharing on Shared Congestion Management
Authors: Aditya Akella, Srinivasan Seshan, Hari Balakrishnan
Venue: Proceedings of the 11th IEEE International Conference on Network Protocols (2003)

Several recent proposals for sharing congestion information across concurrent flows between end-systems overlook an important problem: two or more flows sharing congestion state may infact not share the same bottleneck. In this paper, we categorize the origins of this false sharing into two distinct cases: (i) networks with QoS enhancements such as differentiated services, where a flow classifier segregates flows into different queues, and (ii) networks with path diversity where different flows to the same destination address are routed differently. We evaluate the impact of false sharing on flow performance and investigate how false sharing can be detected by a sender. We discuss how a sender must respond upon detecting false sharing. Our results show that persistent overload can be avoided with window-based congestion control even for extreme false sharing, but higher bandwidth flows run at a slower rate. We find that delay and reordering statistics can be used to develop robust detectors of false sharing and are superior to those based on loss patterns. We also find that it is markedlyeasier to detect and react to false sharing than it is to start by isolating flows and merge their congestion state afterward.
4-Cycle Group-Divisible Designs with Two Associate Classes
Authors: H. L. Fu, C. A. Rodger
Venue: Combinatorics, Probability and Computing (2001)

In this paper we investigate a partitioning problem, setting the existence problem for all group-divisible designs with first and second associates in which the blocks are 4-cycles.
Dynamic Power Management Using Data Buffers
Authors: Le Cai, Yung-Hsiang Lu
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

This paper presents a method to reduce energy consumption by inserting data buffers. The method determines whether power can be reduced by inserting a buffer between two components and periodically turning off one of them. This method calculates the length of the period and the required buffer size to achieve the optimal energy savings. Our approach can be applied to any applications whose data arrival and departure rates are different and known in advance.
Development of a broadband real-time fully-digital simulator for the study and control of large power systems
Authors: L. A. Snider, H. T. Su, K. W. Chan, Do Van Que
Venue: Mathematics and Computers in Simulation (2003)

While transient stability (TST) programs can represent very large systems, they are unable to model power electronic devices in detail since they use relatively large time steps and balanced representation of the network. Electromagnetic transients (EMT) simulators, on the other hand, can model relatively small systems in detail using small time steps. By interfacing both simulation tools, it will be possible to develop a broadband simulator capable of modeling large systems, but including detailed representation where required. The simulator would provide for studies ranging from fast transient to transient, dynamic, and voltage stability, with applications including closed-loop protection and control studies, as well as on-line dynamic security assessment (DSA). In this paper, we present the latest development work related to the realization of a broadband fully-digital simulator, which would be capable of meeting the challenge obtaining real-time solutions of very large networks using sufficiently small integration time steps such that power electronic devices (FACTS or HVDC) could be modeled at the device level with sufficient time resolution.
State Automata Extraction from Recurrent Neural Nets using k-Means and Fuzzy Clustering
Authors: Adelmo Luis Cechin, Denise Regina Pechmann Simon, Klaus Stertz
Venue: Proceedings of the XXIII International Conference of the Chilean Computer Science Society (2003)

This paper presents the use of a recurrent neuralnetwork to learn the dynamical behavior of the invertedpendulum and from this network to extract a finite stateautomata. Two clustering methods are compared for theautomata extraction: the K-means method, and theconstruction of fuzzy membership functions. It is shownthat the number of states for the fuzzy clustering methodinduces much less states than the K-means method.
Techniques for automatic memoization with applications to context-free parsing
Authors: Peter Norvig
Venue: Computational Linguistics (1991)

It is shown that a process similar to Earley's algorithm can be generated by a simple top-down backtracking parser, when augmented by automatic memoization. The memoized parser has the same complexity as Earley's algorithm, but parses constituents in a different order. Techniques for deriving memo functions are described, with a complete implementation in Common Lisp, and an outline of a macro-based approach for other languages.
Citizen Adoption of Electronic Government Initiatives
Authors: Lemuria Carter, France Belanger
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 5 - Volume 5 (2004)

Electronic government, or e-government, increases the convenience and accessibility of government services and information to citizens. Despite the benefits of e-government -- increased government accountability to citizens, greater public access to information, and a more efficient, cost-effective government -- the success and acceptance of e-government initiatives, such as online voting and license renewal, are contingent upon citizens' willingness to adopt this innovation. In order to develop "citizen-centered" e-government services that provide citizens with accessible, relevant information and quality services that are more expedient than traditional "brick and mortar" transactions, government agencies must first understand the factors that influence citizen adoption of this innovation. This study integrates constructs from the technology acceptance model (TAM), diffusions of innovation theory (DOI) and Web trust model to form a parsimonious, yet comprehensive model of factors that influence citizen adoption of electronic government initiatives. The findings and implications of this study are discussed in the paper.