ppxscal/embedding_network huggingface dataset:
Design and Implementation of a 320 Gb/s Switch Fabric
Authors: Wenjie Li, Yiping Gong, Yang Xu, Kai Zheng, Bin Liu
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

With fast development of the optical fiber technology, core routers face many great challenges, especially in the technology of switch fabrics. This paper mainly discusses the design of switch fabric in a gigabit core router named Tsinghua Core Router (TCR), which is our recent research project. This core router has 320 GB/s switch capacity, supporting 16 ports, each opening at 10 Gb/s (OC192c line rate). To achieve a high-speed and large-capacity switch fabric, this paper focuses on key technologies of supporting variable-length packets with a cell-based switch fabric, segmentation and reassembly, and multi-priority guarantee for various kinds of traffic with different QoS requirements. Through implementation and performance simulation, we demonstrate that the switch fabric can meet challenges of gigabit core routers, and provide better QoS control for Internet.
A Conversation with Steve Hagan
Authors: Tony Wasserman
Venue: Queue (2003)

Oracle Corporation, which bills itself as the world’s largest enterprise software company, with $10 billion in revenues, some 40,000 employees, and operations in 60 countries, has ample opportunity to put distributed development to the test. Among those on the front lines of Oracle’s distributed effort is Steve Hagan, the engineering vice president of the Server Technologies division, based at Oracle’s New England Development Center in Nashua, New Hampshire, located clear across the country from Oracle’s Redwood Shores, California, headquarters.
Automatic Generation of Validation Stimuli for Application-Specific Processors
Authors: O. Goloubeva, M. Sonza Reorda, M. Violante
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

Microprocessor soft cores offer today an effective solution to the problem of rapidly developing new system-on-a-chips. However, all the features they offer are rarely used in embedded applications, and thus designers are often involved in the challenging task of soft-core customization to obtain application-specific processors. This paper proposes a novel approach to help designers in the simulation-based validation of application-specific processors. Suitable input stimuli are automatically generated while reasoning only on the software application the processor is intended to execute, while all the details concerning the processor hardware are neglected. Experimental results on a 8051 soft core show the effectiveness of the proposed approach.
An intelligent search agent system for semantic information retrieval on the internet
Authors: Carmine Cesarano, Antonio d'Acierno, Antonio Picariello
Venue: Proceedings of the 5th ACM international workshop on Web information and data management (2003)

In this paper we describe a prototype system for information retrieval on the Internet. Our idea is that the Web has to be searched both semantically and syntactically. In order to automatically categorize the web pages on the fly we propose a novel approach based on ontology and semantic networks and we describe a prototype system based on the Intelligent Agent Paradigm. Preliminary experiments are shown and discussed while describing open problems and on-going research.
Replicated Object Management with Periodic Maintenance in Mobile Wireless Systems
Authors: Ding-Chau Wang, Ing-Ray Chen, Chih-Ping Chu, I-Ling Yen
Venue: Wireless Personal Communications: An International Journal (2004)

In this paper we analyze periodic maintenance strategies for managing replicated objects in mobile wireless environments. Under periodical maintenance strategies, the system periodically checks local cells to determine if a replicated object should be allocated or deallocated in a cell to reduce the access cost. We develop a performance model based on Petri nets that considers the missing-read cost, write-propagation cost and the periodic maintenance cost with the objective to identify optimal periodic maintenance intervals to minimize the overall cost. The analysis results show that the overall cost is high when the user arrival-departure ratio and the read-write ratio work against each other and is low otherwise. In all cases, there exists an optimal periodic maintenance interval that would yield the minimum cost. Further, the optimal periodic maintenance interval increases as the arrival-departure ratio and the read-write ratio work in harmony.
Teleworking and Mental Health: Collaborative Work to Maintain and Manage the Mental Health for Women's Teleworkers
Authors: Mayumi Hori, Masakasu Ohashi
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 6 - Volume 6 (2004)

The IT revolution is powerfully expanding various choices for women's occupations and it is thus promoting the employment of women's workers such as telework. Although the popularization of teleworking comes about the possibility of obtaining some advantages, especially for in-home telework, the common issues for all in-home workers(women) must beresolved wages, working conditions, self-education,etc, furthermore, the problem related to the high levels of emotional stress or anxiety with which In-home female workers be often confronted.In general, women's heavier responsibility for family and household matters is likely to impair mental health. Female teleworkers have recognized mental stress at home work as a source of stress.I examined stressful events in women's teleworking, focusing on the relationship between the characteristics of teleworkers'working environments and emotional stress. And the aim of this study is to contribute to creating a working environment in which women (especially in-home teleworkers) can work with lower emotional stress and more satisfaction. I have tried in this paper to discuss current and forthcoming scheme for teleworke's mental health such as the collaborative teleworking.
Editorial
Authors: Tony Myatt
Venue: Organised Sound (2002)

This issue of Organised Sound focuses on mapping in computer music. Unlike many issues of the journal, all articles in this edition are related to the theme. The call for contributions resulted in a significant collection of work which covered a broad range of activity in the field. This number of articles would normally fill more than one issue of the journal but we decided to keep the collection together as a representative body of work.We were delighted to welcome Marcelo Wanderley as Guest Editor for this issue. I would like to thank him for his hard and diligent work throughout the preparation of this issue.
Extensions to Starburst: objects, types, functions and rules
Authors: Guy M. Lohman, Bruce Lindsay, Hamid Pirahesh, Bernhard Schiefer
Venue: Proceedings of the 1991 conference of the Centre for Advanced Studies on Collaborative research (1991)

Starburst is a research prototype of an extensible relational database management system that is under development at the IBM Almaden Research Center. Through extensions to Starburst, we are incorporating the advanced structuring and data behavior features offered by object-oriented database management systems, while retaining the significant gains in data independence and data integrity of the relational model and upward compatibility with its standard access language, SQL,. Some of the advanced features supported by Starburst extensions, described in this paper, include hicrarchies of user-defined types and functions, large unstructured and structured complex objects, and user-defined rules to respond to changes in the database.
A component-based implementation of multiple sequence alignment
Authors: Umit Catalyurek, Mike Gray, Tahsin Kurc, Joel Saltz, Eric Stahlberg, Renato Ferreira
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

This paper addresses the efficient execution of a Multiple Sequence Alignment (MSA) method, in particular the progressive alignment-based CLUSTAL W algorithm, on a cluster of workstations. We describe a scalable component-based implementation of CLUSTAL W program targeting distributed memory machines and multiple query workloads. We look at the effect of data caching on the performance of the data server. We present a distributed, persistent cache approach for caching intermediate results for reuse in subsequent or concurrent queries. Our initial results show that the cache-enabled CLUSTAL W program scales well on a cluster of workstations.
Nominal logic, a first order theory of names and binding
Authors: Andrew M. Pitts
Venue: Information and Computation (2003)

This paper formalises within first-order logic some common practices in computer science to do with representing and reasoning about syntactical structures involving lexically scoped binding constructs. It introduces Nominal Logic, a version of first-order many-sorted logic with equality containing primitives for renaming via name-swapping, for freshness of names, and for name-binding. Its axioms express properties of these constructs satisfied by the FM-sets model of syntax involving binding, which was recently introduced by the author and M.J. Gabbay and makes use of the Fraenkel-Mostowski permutation model of set theory. Nominal Logic serves as a vehicle for making two general points. First, name-swapping has much nicer logical properties than more general, non-bijective forms of renaming while at the same time providing a sufficient foundation for a theory of structural induction/recursion for syntax modulo α-equivalence. Secondly, it is useful for the practice of operational semantics to make explicit the equivariance property of assertions about syntax - namely that their validity is invariant under name-swapping.
A proposed change to the soap-based xml standard for the improved delivery of web services
Authors: Amiram Neiman
Venue:  (2003)

Scope of study. This dissertation addresses the question of how the SOAP-based XML standard can be revised to increase interoperability and improve quality of service in the delivery of Web services. It also provides the methodology by which object-oriented languages can support the new standard through the introduction of a set of universal data types. Findings and conclusions. Through using a binary data format and a corresponding collection of XML tags, the proposed SOAP-based XML architecture significantly reduces both parsing and network transmission time in the exchange of information, especially for large amounts of real and binary data. This new standard, if adopted, will significantly reduce parsing time and network traffic for those files containing large amounts of data. The proposed architecture given in this dissertation enables all data sources to be exchanged using a binary format. Concomitantly, the architecture supports the evolution of object-oriented languages, which have shown increasing support for database and multimedia information access.
Applications of computability theory to prime models and differential geometry
Authors: Robert I. Soare
Venue:  (2003)

We consider the Turing degrees of prime models of complete decidable theories. In particular we show that every complete decidable atomic theory has a prime model whose elementary diagram is low. If we have a complete decidable atomic theory with all types of the theory computable, we show that for every degree d with 0 < d &le; 0&prime;, there is a prime model with elementary diagram of degree d. We say that a set X is prime bounding if for every complete decidable atomic theory T there is a prime model U of T decidable in X. In joint work with Denis Hirschfeldt, Julia Knight, and Robert Soare, we give the characterization that the prime bounding sets X &le;T &empty; &prime; are exactly the sets which are not low2. Recent results of Alex Nabutovsky and Schmuel Weinberger in differential geometry have required the construction by Robert Soare of a certain sequence of computably enumerable sets. Weinberger later asked for a stronger sequence, which we construct. In addition, he introduced an ordering with geometric applications and asked for its computability theoretic properties, which we study.
Center-Based Indexing for Nearest Neighbors Search
Authors: Arkadiusz Wojna
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

The paper addresses the problem of indexing data forthe k nearest neighbors (k-nn) search. It presents a tree-basedtop-down indexing method that uses an iterative k-meansalgorithm for tree node splitting and combines threedifferent search pruning criteria from BST, GHT and GNATinto one. The experiments show that the presented indexingtree accelerates the k-nn searching up to several thousandstimes in case of large data sets.
Towards unifying analysis, design, and implementation in object-oriented environments
Authors: Wilf LaLonde, John Pugh, Paul White, Jean-Pierre Corriveau
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: software engineering - Volume 1 (1993)

Object-oriented technology is decreasing the gap between analysis, design, and implementation and is leading to ideas that will ultimately integrate or at least strongly couple the three phases. In order to unify analysis, design, and implementation in object-oriented systems, we believe it is necessary to build an integrated facility that is part of the development environment, that supports bidirectional lifecycle development, that integrates active documentation as part of the process, and that focuses on re-analysis, re-design, and re-implementation as the main development activities.In this paper, we describe our long-term objectives for coupling the analysis, design, and implementation phases; e.g., to permit design to drive implementation (top-down coupling) and also implementation to drive design (bottom-up coupling). We also describe our immediate research project which focuses primarily on bottom-up coupling; i.e., on tools that support "design capturing" and "design regeneration " enabling developers to extract their designs from existing software and to semi-automatically re-extract the designs when changes are made to the implementation.
Solving common business problems with Microsoft Office&#x00AE;
Authors: Kathryn Marold, Gwynne Larsen
Venue: Computing information technology: the human side (2003)

The authors traced the process of revising and updating a long-existing Micro-Based Software class at the undergraduate level at Metropolitan State College of Denver. The course was designed to allow students to become proficient in end user computing at the operational business level. The revisions were prompted by the increasing sophistication of horizontal microcomputer application programs, the increase in the level of computer literacy among undergraduate School of Business students, and the students' need for experience in problem solving and applying the theory they learned using the Microsoft Office software suite. A pilot class was taught utilizing the revised curriculum in the Fall of 2001. The revised curriculum involved using Web-based material and regular presentation sessions for solutions to assigned problems. An efficacy survey was administered at the end of the class to determine student satisfaction with the revised curriculum. The success of the pilot class resulted in implementing the revised content in all sections of the Micro-Based Software class as of Spring semester, 2002.
Self-Diagnosis of Digital Systems
Authors: V. A. Vedeshenkov
Venue: Automation and Remote Control (2003)

Organization of distributed self-diagnosis of the components (modules and communication lines) of digital systems on the basis of the Barsi&ndash;Grandoni&ndash;Maestrini diagnostic model was described. It includes the following components: execution by an operable module of the functions of checking modules, determination of a path from one operable module to another operable module, and processing and decoding of the test results. For self-diagnosis of the failed components in a four-dimensional hypercube, two examples illustrating the distinctive features of the procedures were presented.
Automated debugging in Eclipse: (at the touch of not even a button)
Authors: Philipp Bouillon, Martin Burger, Andreas Zeller
Venue: Proceedings of the 2003 OOPSLA workshop on eclipse technology eXchange (2003)

Recent advances in debugging allow for automatic isolation of failure causes such as failure-inducing input or code changes. So far, these advances required a significant infrastructure, notably program analysis, automated testing, or automated construction. The ECLIPSE environment provides such an infrastructure in an integrated, user-friendly fashion. We show how developers and users of automated debugging tools can greatly benefit from such an integrated infrastructure.
An efficient algorithm for Horn description
Authors: Jean-Jacques Hébrard, Bruno Zanuttini
Venue: Information Processing Letters (2003)

We give a new algorithm for computing a prepositional Horn CNF formula given the set of its models. Its running time is O(|R|n(|R| + n)), where |R| is the number of models and n that of variables, and the computed CNF contains at most |R|n clauses. This algorithm also uses the well-known closure property of Horn relations in a new manner.
Various hyperplane classifiers using kernel feature spaces
Authors: Kornél Kovács, András Kocsor
Venue: Acta Cybernetica (2003)

In this paper we introduce a new family of hyperplane classifiers. But, in contrast to Support Vector Machines (SVM) - where a constrained quadratic optimization is used - some of the proposed methods lead to the unconstrained minimization of convex functions while others merely require solving a linear System of equations. So that the efficiency of these methods could be checked, classification tests were conducted on standard databases. In our evaluation, classification results of SVM were of course used as a general point of reference, which we found were outperformed in many cases.
Where is "it"? Event Synchronization in Gaze-Speech Input Systems
Authors: Manpreet Kaur, Marilyn Tremaine, Ning Huang, Joseph Wilder, Zoran Gacovski, Frans Flippo, Chandra Sekhar Mantravadi
Venue: Proceedings of the 5th international conference on Multimodal interfaces (2003)

The relationship between gaze and speech is explored for the simple task of moving an object from one location to another on a computer screen. The subject moves a designated object from a group of objects to a new location on the screen by stating, "Move it there". Gaze and speech data are captured to determine if we can robustly predict the selected object and destination position. We have found that the source fixation closest to the desired object begins, with high probability, before the beginning of the word "Move". An analysis of all fixations before and after speech onset time shows that the fixation that best identifies the object to be moved occurs, on average, 630 milliseconds before speech onset with a range of 150 to 1200 milliseconds for individual subjects. The variance in these times for individuals is relatively small although the variance across subjects is large. Selecting a fixation closest to the onset of the word "Move" as the designator of the object to be moved gives a system accuracy close to 95% for all subjects. Thus, although significant differences exist between subjects, we believe that the speech and gaze integration patterns can be modeled reliably for individual users and therefore be used to improve the performance of multimodal systems.
Parallel multisource view maintenance
Authors: Xin Zhang, Lingli Ding, Elke A. Rundensteiner
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2004)

In a distributed environment, materialized views are used to integrate data from different information sources and then store them in some centralized location. In order to maintain such materialized views, maintenance queries need to be sent to information sources by the data warehouse management system. Due to the independence of the information sources and the data warehouse, concurrency issues are raised between the maintenance queries and the local update transactions at each information source. Recent solutions such as ECA and Strobe tackle such concurrent maintenance, however with the requirement of quiescence of the information sources. SWEEP and POSSE overcome this limitation by decomposing the global maintenance query into smaller subqueries to be sent to every information source and then performing conflict correction locally at the data warehouse. Note that all these previous approaches handle the data updates one at a time. Hence either some of the information sources or the data warehouse is likely to be idle during most of the maintenance process. In this paper, we propose that a set of updates should be maintained in parallel by several concurrent maintenance processes so that both the information sources as well as the warehouse would be utilized more fully throughout the maintenance process. This parallelism should then improve the overall maintenance performance. For this we have developed a parallel view maintenance algorithm, called PVM, that substantially improves upon the performance of previous maintenance approaches by handling a set of data updates at the same time. The parallel handling of a set of updates is orthogonal to the particular maintenance algorithm applied to the handling of each individual update. In order to perform parallel view maintenance, we have identified two critical issues that must be overcome: (1) detecting maintenance-concurrent data updates in a parallel mode and (2) correcting the problem that the data warehouse commit order may not correspond to the data warehouse update processing order due to parallel maintenance handling. In this work, we provide solutions to both issues. For the former, we insert a middle-layer timestamp assignment module for detecting maintenance-concurrent data updates without requiring any global clock synchronization. For the latter, we introduce the negative counter concept to solve the problem of variant orders of committing effects of data updates to the data warehouse. We provide a proof of the correctness of PVM that guarantees that our strategy indeed generates the correct final data warehouse state. We have implemented both SWEEP and PVM in our EVE data warehousing system. Our performance study demonstrates that a manyfold performance improvement is achieved by PVM over SWEEP.