ppxscal/embedding_network huggingface dataset:
The impact of residential broadband traffic on Japanese ISP backbones
Authors: Kensuke Fukuda, Kenjiro Cho, Hiroshi Esaki
Venue: ACM SIGCOMM Computer Communication Review (2005)

This paper investigates the effects of the rapidly-growing residential broadband traffic on commercial ISP backbone networks. We collected month-long aggregated traffic logs for different traffic groups from seven major ISPs in Japan in order to analyze the macro-level impact of residential broad-band traffic. These traffic groups are carefully selected to be summable, and not to count the same traffic multiple times.Our results show that (1) the aggregated residential broad-band customer traffic in our data exceeds 100Gbps on average. Our data is considered to cover 41% of the total customer traffic in Japan, thus we can estimate that the total residential broadband traffic in Japan is currently about 250Gbps in total. (2) About 70% of the residential broadband traffic is constant all the time. The rest of the traffic has a daily fluctuation pattern with the peak in the evening hours. The behavior of residential broadband traffic deviates considerably from academic or office traffic. (3) The total traffic volume of the residential users is much higher than that of office users, so backbone traffic is dominated by the behavior of the residential user traffic. (4) The traffic volume exchanged through domestic private peering is comparable with the volume exchanged through the major IXes. (5) Within external traffic of ISPs, international traffic is about 23% for inbound and about 17% for outbound. (6) The distribution of the regional broadband traffic is roughly proportional to the regional population.We expect other countries will experience similar traffic patterns as residential broadband access becomes widespread.
(Awarded Best Paper!) Work-Augmented Laziness with the Los Task Request System
Venue: Proceedings of the 16th USENIX conference on System administration (2002)

Quotidian system administration is often characterized by the fulfillment of common user requests, especially on sites that serve a variety of needs. User creation, group management, and mail alias maintenance are just three examples of the many repetitive tasks that can crowd the sysadmin's day. Matters worsen when users neglect to provide necessary information for the job. They can grow bleakest, however, at volunteer-run or otherwise loosely-coordinated sites, where sysadmins often collectively hope for someone else to attend to the task.The Los Task Request System addresses all three problems. It mitigates user vagueness with web forms generated from XML parameter specification files. It skirts sysadmin sloth by requiring one simple review and approval step to set changes into motion. It then saves time by automatically executing commands tailored from user input. Amidst this convenience, cryptographic signatures on Los directives ensure that only administrators can alter the system. Overall, Los aims to make life easier for users and sysadmins by standardizing and streamlining the submission, review, and execution of requests for common system tasks.
A new language model using (n &ge; 4)-gram for broadcast news speech transcription
Authors: Naoto Katoh, Noriyoshi Uratani, Terumasa Ehara, Akio Ando
Venue: Systems and Computers in Japan (2005)

This paper describes the language model for news speech transcription, utilizing the properties of the announce manuscript. In the news program, it often happens that the announcer reads the manuscript (announce manuscript) in the studio. The announce manuscript is composed, being improved by handwriting the manuscript, which is written by the reporter using a word processor (reporter's manuscript). Consequently, the announce manuscript has the property that the same word sequence as the immediate past word sequence in the reporter's manuscript is often contained. In the proposed language model, such a property is modeled as the (n &ge; 4)-gram. Then, the adaptation to the immediate past reporter's manuscript is realized, while the general language constraint is handled through modeling by the 2,3-gram. If all of the (n &ge; 4)-grams are simply memorized, the amount of data is enlarged with the number of words. In the proposed language model, the concept of the word position dictionary is introduced, and the amount of data is suppressed by memorizing the reporter's manuscript itself as the procedural knowledge. In modeling by the 2,3-gram, on the other hand, the reporter's manuscripts for several years are adapted to the immediate past reporter's manuscript, in order to reflect the current property of the news. Overadaptation is avoided by reducing the linear mixing ratio. The proposed language model is applied to the broadcast news, and an evaluation experiment is conducted in terms of the perplexity and the speech recognition. A satisfactory result is obtained. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 36(1): 58&ndash;67, 2005; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10385
MAGIC Database and interfaces: an integrated package for gene discovery and expression: Conference Reviews
Authors: Marie-Michèle Cordonnier-Pratt, Chun Liang, Haiming Wang, Dmitri S. Kolychev, Feng Sun, Robert Freeman, Robert Sullivan, Lee H. Pratt
Venue: Comparative and Functional Genomics (2004)

The rapidly increasing rate at which biological data is being produced requires a corresponding growth in relational databases and associated tools that can help laboratories contend with that data. With this need in mind, we describe here a Modular Approach to a Genomic, Integrated and Comprehensive (MAGIC) Database. This Oracle 9i database derives from an initial focus in our laboratory on gene discovery via production and analysis of expressed sequence tags (ESTs), and subsequently on gene expression as assessed by both EST clustering and microarrays. The MAGIC Gene Discovery portion of the database focuses on information derived from DNA sequences and on its biological relevance. In addition to MAGIC SEQ-LIMS, which is designed to support activities in the laboratory, it contains several additional subschemas. The latter include MAGIC Admin for database administration, MAGIC Sequence for sequence processing as well as sequence and clone attributes, MAGIC Cluster for the results of EST clustering, MAGIC Polymorphism in support of microsatellite and single-nucleotide-polymorphism discovery, and MAGIC Annotation for electronic annotation by BLAST and BLAT. The MAGIC Microarray portion is a MIAME-compliant database with two components at present. These are MAGIC Array-LIMS, which makes possible remote entry of all information into the database, and MAGIC Array Analysis, which provides data mining and visualization. Because all aspects of interaction with the MAGIC Database are via a web browser, it is ideally suited not only for individual research laboratories but also for core facilities that serve clients at any distance. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Formally citing the web
Authors: Paul Wouters, Repke de Vries
Venue: Journal of the American Society for Information Science and Technology (2004)

How do authors refer to Web-based information sources in their formal scientific publications? It is not yet well known how scientists and scholars actually include new types of information sources, available through the new media, in their published work. This article reports on a comparative study of the lists of references in 38 scientific journals in five different scientific and social scientific fields. The fields are sociology, library and information science, biochemistry and biotechnology, neuroscience, and the mathematics of computing. As is well known, references, citations, and hyperlinks play different roles in academic publishing and communication. Our study focuses on hyperlinks as attributes of references in formal scholarly publications. The study developed and applied a method to analyze the differential roles of publishing media in the analysis of scientific and scholarly literature references. The present secondary databases that include reference and citation data (the Web of Science) cannot be used for this type of research. By the automated processing and analysis of the full text of scientific and scholarly articles, we were able to extract the references and hyperlinks contained in these references in relation to other features of the scientific and scholarly literature. Our findings show that hyperlinking references are indeed, as expected, abundantly present in the formal literature. They also tend to cite more recent literature than the average reference. The large majority of the references are to Web instances of traditional scientific journals. Other types of Web-based information sources are less well represented in the lists of references, except in the case of pure e-journals. We conclude that this can be explained by taking the role of the publisher into account. Indeed, it seems that the shift from print-based to electronic publishing has created new roles for the publisher. By shaping the way scientific references are hyperlinking to other information sources, the publisher may have a large impact on the availability of scientific and scholarly information.
Proceedings of the 6th conference on Message understanding
Venue: Message Understanding Conference (1995)

This volume documents the proceedings of the Sixth Message Understanding Conference (MUC-6), which was held on 6-8 November, 1995, in Columbia, Maryland. The conference was sponsored by the Defense Advanced Research Projects Agency, Information Technology Office (D. Gunning, Program Manager) under the auspices of the Tipster Text Program and was organized by the MUC-6 program committee, co-chaired by Beth Sundheim (NCCOSC/NRaD) and Ralph Grishman (NYU). Other members of the committee were Chinatsu Aone (SRA Corp.), Lois Childs (Lockheed Martin Corp.), Nancy Chinchor (SAIC), Jerry Hobbs (SRI International), Boyan Onyshkevych (U.S. Dept. of Defense), Marc Vilain (The MITRE Corp.), Takahiro Wakao (Univ. of Sheffield), and Ralph Weischedel (BBN Systems and Technologies).The topic of the conference was performance assessment of text analysis software systems that analyze free text in accordance with prespecified task definitions. To represent the output of analysis, the systems either insert certain types of annotations into the text or extract certain types of information from the text. Prior to the conference, systems were developed and tested on up to four different tasks: insertion of Named Entity annotations, insertion of Coreference annotations, extraction of Organization and Person information, and extraction of event information concerning corporate management changes.The conference was attended by representatives of organizations that participated in the evaluation, US Government representatives, and other invited guests. Sessions included task overviews presented by T. Wakao, C. Aone, L. Childs, and B. Sundheim; a presentation concerning MUC-6 scoring methodology by N. Chinchor; an overview of evaluation results by B. Sundheim; system demonstrations and papers on systems and test results given by the participating organizations in the evaluation; and presentations on the Coreference task and other topics by some of the evaluation participants, accompanied by discussions led by R. Grishman to critique the evaluation and make recommendations for future evaluations.Papers in this volume reflect the information presented at the conference. The introductory paper by Grishman and Sundheim provides additional background, and the paper by Vilain et al. elaborates on the Coreference scoring method, which was new for this evaluation. 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
Logarithmic expected packet delivery delay in mobile ad hoc wireless networks: Research Articles
Authors: Heberto del Rio, Dilip Sarkar
Venue: Wireless Communications Mobile Computing (2004)

It has been shown that in a mobile ad hoc wireless network per node throughput remains constant as the number of nodes approaches infinity, when the nodes lie in a disk of unit area. However, this requires that some packets are delivered indirectly by a relay node. In this paper, we prove, in the same setup, that D(k)&thinsp;&isin;&thinsp;&Theta;(log k), where D(k) is the expected delay time of a mobile ad hoc wireless network with k nodes. As consequence, we have concluded that mobile ad hoc wireless networks are not scalable for real-time applications. Copyright &copy; 2004 John Wiley & Sons, Ltd.
On the Complexity of Deduction Modulo Leaf Permutative Equations
Authors: Thierry Boy De La Tour, Mnacho Echenim
Venue: Journal of Automated Reasoning (2004)

In the context of equational reasoning, J. Avenhaus and D. Plaisted proposed to deal with leaf permutative equations in a uniform, specialized way. The simplicity of these equations and the useless variations that they produce are good incentives to lift theorem proving to so-called stratified terms, in order to perform deduction modulo such equations. This requires specialized algorithms for standard problems involved in automated deduction. To analyze the computational complexity of these problems, we focus on the group theoretic properties of stratified terms. NP-completeness results are given and (slightly) relieved by restrictions on leaf permutative theories, which allow the use of techniques from computational group theory.
Exploring bidding strategies for market-based scheduling
Authors: Daniel M. Reeves, Michael P. Wellman, Jeffrey K. MacKie-Mason, Anna Osepayshvili
Venue: Decision Support Systems (2005)

A market-based scheduling mechanism allocates resources indexed by time to alternative uses based on the bids of participating agents. Agents are typically interested in multiple time slots of the schedulable resource, with value determined by the earliest deadline by which they can complete their corresponding tasks. Despite the strong complementarities among slots induced by such preferences, it is often infeasible to deploy a mechanism that coordinates allocation across all time slots. We explore the case of separate, simultaneous markets for individual time slots, and the strategic problem it poses for bidding agents. Investigation of the straightforward bidding policy and its variants indicates that the efficacy of particular strategies depends critically on preferences and strategies of other agents, and that the strategy space is far too complex to yield to general game-theoretic analysis. For particular environments, however, it is often possible to derive constrained equilibria through evolutionary search methods.
Designing sticky knowledge networks
Authors: Ashley A. Bush, Amrit Tiwana
Venue: Communications of the ACM (2005)

Much of any organization's experience and expertise remains underused and underexploited simply because it resides not in databases, repositories, or manuals but in the minds of its employees. Attempting to harness such distributed expertise, organizations have begun implementing collaborative knowledge networks---peer-to-peer digital networks connecting individuals with relevant expertise to their peers who need it [10, 11]. Unfortunately, however, successful knowledge networks represent the occasional island dotting a sea of failures. While many organizations are eager adopters of knowledge network systems, individual users frequently abandon them, leaving a trail of million- dollar paperweights. To be self-sustaining, knowledge networks must be sticky, though stickiness is an elusive design objective.
Linear-time modular decomposition of directed graphs
Authors: Ross M. McConnell, Fabien de Montgolfier
Venue: Discrete Applied Mathematics (2005)

Modular decomposition of graphs is a powerful tool with many applications in graph theory and optimization. There are efficient linear-time algorithms that compute the decomposition for undirected graphs. The best previously published time bound for directed graphs is O(n + m log n), where n is the number of vertices and m is the number of edges. We give an O(n + m)-time algorithm.
Computational realization of a generalized phrase structure grammar: University of Sussex, England
Authors: Gerald Gazdar, Ewan Klein, Geoffrey Pullum, Ivan Sag, Henry Thompson
Venue: Issue 79 (January 1982) (1982)

The aim of this project, due to begin in January 1982 under the auspices of Grant HR 7829/1 from the SSRC (UK), is to design, evaluate, and debug a computer realization of a generalized phrase structure grammar for a very large fragment of English. The realization will be in a form which is neutral with respect to parsing or generating sentences, and which is capable of being used with a variety of programs. Programs written in POP2 and PROLOG will be used to test the grammar.
Designing creative artificial systems
Authors: Pieter H. G. Van Langen, Niek J. E. Wijngaards, Frances M. T. Brazier
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2004)

Can artificial systems be creative? Can they be designed to be creative on their own? What are the requirements of such creative artificial systems? To be able to support humans who are expected to deliver creative solutions, or to automate part of their tasks, this paper presents a proposal for creativity requirements that provide a basis for designing creative artificial systems.
Lower Bounds For Concurrent Zero Knowledge
Authors: Joe Kilian, Charles Rackoff, Erez Petrank
Venue: Combinatorica (2005)

We consider zero knowledge interactive proofs in a richer, more realistic communication environment. In this setting, one may simultaneously engage in many interactive proofs, and these proofs may take place in an asynchronous fashion. It is known that zero-knowledge is not necessarily preserved in such an environment; we show that for a large class of protocols, it cannot be preserved. Any 4 round (computational) zero-knowledge interactive proof (or argument) for a non-trivial language L is not black-box simulatable in the asynchronous setting.
Robust Parameter Settings for Variation Operators by Measuring the Resampling Ratio: A Study on Binary Constraint Satisfaction Problems
Authors: Jano I. Van Hemert, Thomas Bäck
Venue: Journal of Heuristics (2004)

In this article, we try to provide insight into the consequence of mutation and crossover rates when solving binary constraint satisfaction problems. This insight is based on a measurement of the space searched by an evolutionary algorithm. From data empirically acquired we describe the relation between the success ratio and the searched space. This is achieved using the resampling ratio, which is a measure for the amount of points revisited by a search algorithm. This relation is based on combinations of parameter settings for the variation operators. We then show that the resampling ratio is useful for identifying the quality of parameter settings, and provide a range that corresponds to robust parameter settings.
Editing noise: Research Articles
Authors: Jong-Chul Yoon, In-Kwon Lee, Jung-Ju Choi
Venue: Computer Animation and Virtual Worlds (2004)

Noise is used to create realistic animations that look like natural phenomena as well as procedural textures and shapes by adding randomness to graphical applications. In this paper, we suggest a method to edit noise values to satisfy the constraints that reflect the user's demands while maintaining the inherent statistical features of the noise function. Noise editing uses optimization to minimize the difference between the statistical characteristics of the ideal and edited versions of a noise source. Using our editing method, detailed control of animation and shape data that include noise is possible. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Mobile device security
Authors: Benjamin Halpert
Venue: Proceedings of the 1st annual conference on Information security curriculum development (2004)

Because of their small size, memory capability, and the case with which information can be downloaded and removed from a facility, mobile devices pose a risk to organizations when used and transported outside physical boundaries. Mobile devices, including Personal Digital Assistants (PDAs), mobile phones, laptops, and smart phones can expose organizational data if not properly protected. This paper will cover areas of concern, different device types, and proposed solutions to mitigate the risks when using a mobile device.
Compiling XSLT 2.0 into XQuery 1.0
Authors: Achille Fokoue, Kristoffer Rose, Jérôme Siméon, Lionel Villard
Venue: Proceedings of the 14th international conference on World Wide Web (2005)

As XQuery is gathering momentum as the standard query language for XML, there is a growing interest in using it as an integral part of the XML application development infrastructure. In that context, one question which is often raised is how well XQuery interoperates with other XML languages, and notably with XSLT. XQuery 1.0 [16] and XSLT 2.0 [7] share a lot in common: they share XPath 2.0 as a common sub-language and have the same expressiveness. However, they are based on fairly different programming paradigms. While XSLT has adopted a highly declarative template based approach, XQuery relies on a simpler, and more operational, functional approach.In this paper, we present an approach to compile XSLT 2.0 into XQuery 1.0, and a working implementation of that approach. The compilation rules explain how XSLT's template-based approach can be implemented using the functional approach of XQuery and underpins the tight connection between the two languages. The resulting compiler can be used to migrate a XSLT code base to XQuery, or to enable the use of XQuery runtimes (e.g., as will soon be provided by most relational database management systems) for XSLT users. We also identify a number of areas where compatibility between the two languages could be improved. Finally, we show experiments on actual XSLT stylesheets, demonstrating the applicability of the approach in practice.
Behind Fitts' law: kinematic patterns in goal-directed movements
Authors: R. J. Bootsma, L. Fernandez, D. Mottet
Venue: International Journal of Human-Computer Studies (2004)

Half a century ago, Paul Fitts first discovered that the time necessary to complete a pointing movement (MT) linearly increases with the amount of information (ID) necessary to specify the target width (W) relative to the distance (D). The so-called Fitts' law states that MT = a + b ID, with ID being a logarithmic function of the D/W ratio. With the rising importance of pointing in human-computer interaction, Fitts' law is nowadays an important tool for the quantitative evaluation of user interface design. We show that changes in ID give rise to systematic changes in the kinematics patterns that determine MT, and provide evidence that the observed patterns result from the interplay between basic oscillatory motion and visual control processes. We also emphasize the generality and abstract nature of Fitts' robust model of human psychomotor behavior, and suggest that some adaptations in the design of the (computer-mediated) coupling of perception and production of movement might improve the efficiency of the interaction.