ppxscal/embedding_network huggingface dataset:
Instructions for Using Logic
Authors: John W. Scott
Venue:  (1986)

This document provides instructions on the use of "Logic", a digital logic simulator for the Macintosh written for Dartmouth students in the Machine Architecture and Digital Electronics courses. 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
Computer networking industry technologies: trends and challenges in the Mexican market
Authors: G. Chavez
Venue: Proceedings of the IEEE Symposium on Computers and Communications (ISCC'95) (1995)

This paper covers the main aspects of the current technological status of the Mexican market in the computer networking arena, based on several studies conducted by local and international firms; these criteria were weighed and their technological importance ranked, so that they could to be properly analysed to obtain a global prospective of this information for funding decisions about technological trends and windows of opportunity for Mexico. This is important for long-range planning in education, R&D, network infrastructure development and the provision of value-added services in this sector.
Towards Interactive Finite Element Analysis of Shell Structures in Virtual Reality
Authors: A. Liverani, F. Kuester
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

A first step towards a semi-immersive Virtual Reality (VR) interface for Finite Element Analysis (FEA) is presented in this paper. During recent years, user interfaces of FEA solvers have matured from character- based command-line driven implementations into easy-to-use graphical user interfaces (GUIs). This new generation of GUIs provides access to intuitive and productive tools for the management and analysis of structural problems. Many pre- and post-processors have been implemented targeting the simplification of the man-machine interface in order to increase the ease of use and provide better visual analysis of FEA solver results. Nevertheless, none of these packages provides a real 3D-enabled interface. The main objective of this project is to join state-of-the-art visualization technology, VR devices, and FEA solvers into the integrated development environment VRFEA.
Closed Sets and Generators in Ternary Hamming Spaces
Authors: Endre Boros, Peter L. Hammer, Frederica Ricca, Bruno Simeone
Venue:  (1998)

The $n$-dimensional ternary Hamming space is $\TT^n$, where $\TT=\{ 0,1,2\}$. Three points in $\TT^n$ form a line if they have in common exactly $n-1$ components. A subset of $\TT^n$ is closed if, whenever it contains two points of a line, it contains also the third one. A generator is a set, whose closure is $\TT^n$. In this paper, we investigate several properties of closed sets and generators. Two alternative proofs of our main result, stating that the minimum cardinality of a generator is $2^n$, are provided. The present study was motivated by some combinatorial questions concerning origin-destination matrices in transportation systems.
Searching XML documents via XML fragments
Authors: David Carmel, Yoelle S. Maarek, Matan Mandelbrod, Yosi Mass, Aya Soffer
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

Most of the work on XML query and search has stemmed from the publishing and database communities, mostly for the needs of business applications. Recently, the Information Retrieval community began investigating the XML search issue to answer information discovery needs. Following this trend, we present here an approach where information needs can be expressed in an approximate manner as pieces of XML documents or "XML fragments" of the same nature as the documents that are being searched. We present an extension of the vector space model for searching XML collections via XML fragments and ranking results by relevance. We describe how we have extended a full-text search engine to comply with this model. The value of the proposed method is demonstrated by the relative high precision of our system, which was among the top performers in the recent INEX workshop. Our results indicate that certain queries are more appropriate than others for the extended vector space model. Specifically, queries with relatively specific contexts but vague information needs are best situated to reap the benefit of this model. Finally our results show that one method may not fit all types of queries and that it could be worthwhile to use different solutions for different applications.
Agile and Iterative Development: A Manager's Guide
Authors: Craig Larman
Venue:  (2003)

Agile/iterative methods: From business case to successful implementationThis is the definitive guide for managers and students to agile and iterative development methods: what they are, how they work, how to implement them-and why you should.Using statistically significant research and large-scale case studies, noted methods expert Craig Larman presents the most convincing case ever made for iterative development. Larman offers a concise, information-packed summary of the key ideas that drive all agile and iterative processes, with the details of four noteworthy iterative methods: Scrum, XP, RUP, and Evo. Coverage includes: Compelling evidence that iterative methods reduce project risk Frequently asked questions Agile and iterative values and practices Dozens of useful iterative and agile practice tips New management skills for agile/iterative project leaders Key practices of Scrum, XP, RUP, and EvoWhether you're an IT executive, project manager, student of software engineering, or developer, Craig Larman will help you understand the promise of agile/iterative development, sell it throughout your organizationaeand transform the promise into reality.
Piezoelectric ceramics characterization
Authors: Ounaies T.L. Jordan and Z.
Venue:  (2001)

This review explores piezoelectric ceramics analysis and characterization. The focus is on polycrystalline ceramics; therefore, single crystals, polymeric materials and organic/inorganic composites are outside the scope of this review. To thoroughly grasp the behavior of a piezoelectric polycrystalline ceramic, a basic understanding of the ceramic itself should not be overlooked. To this end, we have presented a brief introduction of the history of piezoelectricity and a discussion on processing of the ceramic and development of the constitutive relations that define the behavior of a piezoelectric material. We have attempted to cover the most common measurement methods as well as introduce parameters of interest. Excellent sources for more in-depth coverage of specific topics can be found in the bibliography. In most cases, we refer to lead zirconate titanate (PZT) to illustrate some of the concepts since it is the most widely used and studied piezoelectric ceramic to date.
Massive WDM and Tdm Soliton Transmission Systems
Authors: Akira Hasegawa
Venue:  (2002)

:This book summarizes proceedings of the invited papers presented at the International Symposium on Massive WDM and TDM Soliton Transmission Systems held in Kyoto, Japan in the fall of 1999. The symposium is the third of the series and is considered to be the most representative symposium on the subject of use of optical solitons for ultrafast communications. In particular, this symposium focuses on the newly developed technologies of dispersion managed soliton transmission capabilities. Studies of properties of new solutions that appear in fibers with periodic variation of dispersion are also presented.
Combining Shape and Color Information For 3D Object Recognition
Authors: Kazunori Higuchi, Martial Hebert, Katsushi Ikeuchi
Venue:  (1993)

Both photometric and geometric information are important for 3D object recognition. Traditionally, however, few systems utilized both types of information. This is because no single representation is suitable for both types of information. This paper proposes a method for representing both color and geometric information using a common framework, the Spherical Attribute Image (SAI). The SAI maps the values of curvature and color computed at every node of a mesh approximating the object surface onto a spherical image. A model object and an observed surface are computed by finding the rotation that brings their spherical images into correspondence. We show how this matching algorithm can be used for object recognition using both geometric and photometric information. In addition, we describe how the two types of information can be combined in a way that takes into account their actual distribution on the surface.
Automated Synthesis of SEU Tolerant Architectures from OO Descriptions
Authors: S. Chiusano, S. DiI Carlo, P. Prinetto
Venue: Proceedings of the Proceedings of The Eighth IEEE International On-Line Testing Workshop (IOLTW'02) (2002)

SEU faults are a well-known problem in aerospace environment but recently their relevance grew up also at ground level in commodity applications coupled, in this frame, with strong economic constraints in terms of costs reduction. On the other hand, latest hardware description languages and synthesis tools allow reducing the boundary between software and hardware domains making the high-level descriptions of hardware components very similar to software programs. Moving from these considerations, the present paper analyses the possibility of reusing Software Implemented Hardware Fault Tolerance (SIHFT) techniques, typically exploited in micro-processor based systems, to design SEU tolerant architectures. The main characteristics of SIHFT techniques have been examined as well as how they haveto be modified to be compatible with the synthesis flow. A complete environment is provided to automate the design instrumentation using the proposed techniques, and to perform fault injection experiments both at behavioural and gate level. Preliminary results presented in this paper show the effectiveness of the approach in terms of reliability improvement and reduced design effort.
A Distributed Reinforcement Learning Scheme for Network Routing
Authors: Michael Littman, Justin Boyan
Venue:  (1993)

In this paper we describe a self-adjusting algorithm for packet routing, in which a reinforcement learning module is embedded into each node of a switching network. Only local communication is used to keep accurate statistics at each node on which routing policies lead to minimal delivery times. In simple experiments involving a 36-node, irregularly connected network, this learning approach proves superior to a nonadaptive algorithm based on precomputed shortest paths.
Queueing Analysis of Fault-Tolerant Computer Systems
Authors: F V Nicola, G V Kulkarni, S K Trivedi
Venue:  (1985)

In this paper we analyze a fault-tolerant computer system. The failure/repair behavior of the system is modelled by an irreducible continuous-time Markov chain. Jobs arrive in a Poisson fashion to the system and are serviced according to an $FCFS$ discipline. A failure may cause the loss of the work already done on the job in service, if any; in this case the interrupted job is repeated as soon as the system is ready to deliver service. In addition to the delays due to failures and repairs, jobs suffer delays due to queueing. We present a general queueing analysis of fault-tolerant systems and study the steady-state behavior of the number of jobs in the system. As a numerical example, we consider a system with two processors subject to failures and repairs.
Unix CD Bookshelf 3.0, 3 edition
Authors: Linda Walsh
Venue:  (2003)

:Version 3.0 of O'Reilly's Unix CD Bookshelf gives you convenient online access to your favorite books from your CD-ROM drive. We've updated this bestselling product with the electronic versions of seven popular Unix books, as well as the paperback version of Unix in a Nutshell, 3rd Edition. In addition to reference material and tutorials, many of the most popular and useful applications for Unix are covered in these seven books. This CD-ROM delivers over 3,000 pages of easily accessible and searchable information, giving you a complete Unix library that you can easily carry anywhere.
Note on the Erdos-Szekeres theorem
Authors: Geza Toth, Pavel Valtr
Venue:  (1997)

Let $g(n)$ denote the least integer such that among any $g(n)$ points in general position in the plane there are always $n$ in convex position. In 1935 P. Erd\H os and G. Szekeres showed that $g(n)$ exists and $2^{n-2}+1\le g(n)\le {2n-4\choose n-2}+1$. Recently, the upper bound has been slightly improved by Chung and Graham and by Kleitman and Pachter. In this note we further improve the upper bound to $$g(n)\le {2n-5\choose n-2}+2.$$
Digital Logic Simulator
Authors: John W. Scott
Venue:  (1986)

Logic is a Macintosh program that simulates discrete, digital logic circuits. The two disks contain an executable version of the program, MacApp sources and brief documentation (which is also available separately in hardcopy). 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
Data Placement Scheme on Continuous Media Servers with ZBR Disks
Authors: Shunnian Zhai, Tony K. Y. Chan
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

Recent advances in computer technologies have made it feasible to provide multimedia services. As a result, the research and development of continuous media servers has received more attention in recent years. In general, these servers consist of multiple zone-bit recording (ZBR) disks or multiple storage nodes connected through the high-speed network to construct a distributed server. One key issue in developing continuous media servers is the allocation of data into ZBR disks. In this paper, we propose a novel data placement scheme, called VARBT (variable block-size and data-transfer-time), to fully utilize the characteristic of ZBR disks. The proposed scheme determines data block size in each zone completely according to the capacity of that zone thus the storage utilization is 100%. During the process of data retrieval, the data transfer rate for each block is equal to the bandwidth of each physical zone thus the bandwidth utilization is also maximal. This scheme can be applied not only to a single-disk platform, but also to a multiple-disk server and even a distributed server with multiple storage nodes. Through simulations and performance evaluation, we found that VARBT scheme has the smaller average block size, required memory space and system response time to support more simultaneous streams, and meanwhile it achieves 100% storage utilization and bandwidth utilization.
The Program Composition Project
Authors: K. M Chandy, Stephen Taylor, Carl Kesselman, Ian Foster
Venue:  (1990)

No abstract available.
Cryptographic Support for Fault-Tolerant Distributed Computing
Authors: Yaron Minsky, Dag Johansen, Robbert van Renesse, Fred B. Schneider
Venue:  (1996)

In an open distributed system, agents comprising an application must not only survive (possibly malicious) failures of the hosts they visit, but they must also be resilient to the potentially hostile actions of other hosts. In particular, faulty hosts that are not visited by agents can confound a naive replica-management scheme by spoofing. Cryptographic protocols to solve this problem are summarized, as well as some experiments that show how replication can actually speed up some applications.
Multiprocessor Scheduling Problem with Probabilistic Execution Costs
Authors: S. Fujita, H. Zhou
Venue: Proceedings of the 2000 International Symposium on Parallel Architectures, Algorithms and Networks (2000)

In this paper, we propose a method for tolerating an inaccuracy of the estimated execution cost of tasks that is usually assumed to be accurate in static multiprocessor scheduling algorithms. In the proposed method, tasks are assigned onto processors in such a way tominimize the maximum expected execution cost rather than the worst case or best case execution costs. A detailed analysis of the proposed method is given, and it is shown that (1) there is an instance for which the algorithm is not optimal, and (2) for a class of instances,the algorithm generates an optimal solution.
A synchronization mechanism for continuous media in multimedia communications
Authors: Y. Ishibashi, S. Tasaka
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 3)-Volume - Volume 3 (1995)

This paper proposes a media synchronization mechanism which adjusts the output timing among stored continuous media streams in multimedia communications. The proposed method consists of intra-stream and inter-stream synchronization mechanisms. The inter-stream synchronization control is performed after the intra-stream synchronization control. Then, whether the intra-stream synchronization is still maintained or not is checked. The mechanism con be used in networks which have unknown delay bounds, and it does not suppose periodical generation of media units such as video frames. It also deals with two types of media streams depending on how strictly to synchronize media streams: tightly-coupled media streams and loosely-coupled media streams. Furthermore, we enhance the mechanism to support real-time-inputted media streams as in TV conferencing.
Randomized Broadcast Channel Access Algorithms for Ad Hoc Networks
Authors: Zhijun Cai, Mi Lu, Xiaodong Wang
Venue: Proceedings of the 2002 International Conference on Parallel Processing (2002)

The problem of broadcast channel access in single-hop and multihop ad hoc networks is considered. Two novel randomized and distributed channel access algorithms are developed and analyzed for single-hop and multihop networks, respectively. These algorithms are designed based on maximizing the worst-case channel efficiency, by optimizing some key parameters, including the backoff probability distribution and the slot length. The proposed algorithm for single-hop networks offers significantly higher throughput than the CSMA methods when the traffic load is heavy, while still achieving good performance when the load is light or medium. The proposed algorithm for multihop networks can flexibly adapt to the traffic load, and offers much better throughput performance than the existing broadcastscheduling algorithms in light or medium load.
Computing Permutation Encodings
Authors: K. R Leino
Venue:  (1994)

We consider some encodings of permutations of the first N natural numbers, discuss some relations among them and how one can be computed from others. We show a short proof of an existing efficient algorithm for one encoding, and present two new efficient algorithms for encoding permutations. One of these algorithms is constructed as the inverse of an existing algorithm for decoding, making it the first efficient permutation encoding algorithm obtained that way.
Automatic failure detection with Conditional-Belief supervisors
Authors: J. J. Li, R. E. Seviora
Venue: Proceedings of the The Seventh International Symposium on Software Reliability Engineering (1996)

Failures of a software system are detected by a supervisor, a separate unit which observes the inputs and outputs of the system and reports its failures in real-time. The supervisor determines whether a failure has occurred by comparing the observed and the specified behavior. The specification of behavior is assumed to be expressed in a formalism based on communicating extended finite state machines (specifically, ITU-T SDL). The supervisor must tolerate legal behavioral alternatives resulting from nondeterminisms in the specification. The computational costs of considering such alternatives can be fairly high. The paper presents the Conditional-Belief (CB) theory that reduces the cost of consideration of alternatives by using conditional-beliefs to represent sets of legal behavioral alternatives. The paper reviews belief-based supervision, introduces the CB theory, and outlines an algorithm for conversion of a class of SDL specification to a CB supervisor model. It describes a demonstration system developed to evaluate CB supervision, and summarizes failure detection and computational cost results for the supervisor of the control program of a small telephone exchange.
The Effect on the Inter-Fairness of TCP and TFRC by the phase of TCP Traffics
Authors: Tian Jin, Xiangzhi Sheng, Wenjun Wu
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

TFRC (TCP-friendly rate control) is a protocol designed for multimedia communication with rate control, which can make multimedia streams smoothly share network bandwidth with TCP flows. But in DropTail router network, the fairness between TCP flows and TFRC flowsis very poor due to the periodic phase of TCP flows. This paper discusses quantitatively the effect of TCP phase on the inter-fairness between TCP and TFRC, and presents the possible solutions to the problem.
Multicasting in interconnected networks
Authors: O. ZeinEldine, H. Abdel-Wahab
Venue: Proceedings of the IEEE Symposium on Computers and Communications (ISCC'95) (1995)

The state of the art in reliable multicasting protocols renders itself inadequate for group multicasting in environments where both intra-group and inter-group messages bridge several LANs. A particularly difficult situation arises if some LANs are managed by autonomous authorities. If autonomy is upheld, as a defacto condition, then LANs under different authorities can adopt different ordering criteria for group multicasting. The accommodation of heterogeneous ordering criteria is a problem that has been largely ignored. The authors propose the multi-LAN multi-order (MLMO) protocol, which supports a reliable ordered delivery service for both local and global messages. The MLMO protocol assumes an environment in which multicasting groups can have members belonging to different LANs, and each group can adopt either total or causal order for message delivery to its members. Characteristic to the protocol is a communication structure that can be aligned with the actual routing topology; thus, the number of necessary protocol messages is maintained. Furthermore, groups that adopt causal order are not forced to experience message latency solely because of coexisting groups that adopt total order.
Quantitative evaluation of passage retrieval algorithms for question answering
Authors: Stefanie Tellex, Boris Katz, Jimmy Lin, Aaron Fernandes, Gregory Marton
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

Passage retrieval is an important component common to many question answering systems. Because most evaluations of question answering systems focus on end-to-end performance, comparison of common components becomes difficult. To address this shortcoming, we present a quantitative evaluation of various passage retrieval algorithms for question answering, implemented in a framework called Pauchok. We present three important findings: Boolean querying schemes perform well in the question answering task. The performance differences between various passage retrieval algorithms vary with the choice of document retriever, which suggests significant interactions between document retrieval and passage retrieval. The best algorithms in our evaluation employ density-based measures for scoring query terms. Our results reveal future directions for passage retrieval and question answering.