ppxscal/embedding_network huggingface dataset:
LFSR-Based Deterministic TPG for Two-Pattern Testing
Authors: Xiaowei Li, Paul Y. S. Cheung, Hideo Fujiwara
Venue: Journal of Electronic Testing: Theory and Applications (2000)

This paper proposes an approach to designing a cost-effective deterministic test pattern generator (TPG) for two-pattern testing. Given a set of pre-generated test-pair set (obtained by an ATPG tool) with a pre-determined (path delay) fault coverage, a simple TPG is synthesized to apply the given test-pair set in a minimal test time. To achieve this objective, a configurable linear feedback shift register (CLFSR) structure is used. Techniques are developed to synthesize such a TPG, which is used to generate an unordered deterministic test-pair set. The resulting TPG is efficient in terms of hardware size and speed performance. Experiments on benchmark circuits indicate that TPG designed using the proposed procedure obtain high path delay fault coverage in short test length.
Relaxation methods for image reconstruction
Authors: Gabor T. Herman, Arnold Lent, Peter H. Lutz
Venue: Communications of the ACM (1978)

The problem of recovering an image (a function of two variables) from experimentally available integrals of its grayness over thin strips is of great importance in a large number of scientific areas. An important version of the problem in medicine is that of obtaining the exact density distribution within the human body from X-ray projections. One approach that has been taken to solve this problem consists of translating the available information into a system of linear inequalities. The size and the sparsity of the resulting system (typically, 25,000 inequalities with fewer than 1 percent of the coefficients nonzero) makes methods using successive relaxations computationally attractive, as compared to other ways of solving systems of inequalities. In this paper, it is shown that, for a consistent system of linear inequalities, any sequence of relaxation parameters lying strictly between 0 and 2 generates a sequence of vectors which converges to a solution. Under the same assumptions, for a system of linear equations, the relaxation method converges to the minimum norm solution. Previously proposed techniques are shown to be special cases of our procedure with different choices of relaxation parameters. The practical consequences for image reconstruction of the choice of the relaxation parameters are discussed.
Minimax logarithmic error
Authors: Charles B. Dunham
Venue: Communications of the ACM (1969)

In this note we point out how rational approximations which are best with respect to maximum logarithmic error can be computed by existing algorithms. Let y be a quantity that we wish to approximate and y be an approximation, then the logarithmic error is defined to be log (y/y). In a recent paper [3] it is shown that minimax logarithmic approximations are optimal for square root calculations, making the minimax logarithmic problem of practical interest. Suppose we wish to approximate a positive continuous function &fnof; by a positive rational function R, then the logarithmic error at a point x is log (&fnof;(x)) - log (R(x)). Our approximation problem is thus equivalent to ordinary approximation of a continuous function g = log (&fnof;) by log (R). This is contained in the more general theory of approximation by &phiv;(R), &phiv; monotonic which appears in [1]. Computational procedures (based on the Remez algorithm) for the general problem are given in [2, 5]. These are easily adapted to the special case of logarithmic approximation and can readily be coded by modification of a standard rational Remez algorithm.
Mobile agent security with the IPEditor development tool and the mobile UNITY language
Authors: Yasuyuki Tahara, Akihiko Ohsuga, Shinichi Honiden
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

Many people consider that security is one of the biggest problems for practical use of mobile agents that move around the network and do their tasks. In this paper, we assert that this issue can be effectively managed by using IPEditor, the development support tool of mobile multi-agent applications that we have been released, and Mobile UNITY, a formal specification language of mobile agent applications. IPEditor helps developers to design applications with visual supports of agent behaviors. In our method, we translate an IPEditor model to a Mobile UNITY program that is the formal specification of the agent behaviors. In addition, we describe the security requirements by the Mobile UNITY logic notation. Thus we can verify the security requirements by proving that the mobile UNITY program, therefore the IPEditor model, satisfies the mobile UNITY logic notation. We present an example of an electronic catalog (e-catalog) application and illustrate the effectiveness of our proposal.
An automatic grading scheme for simple programming exercises
Authors: J. B. Hext, J. W. Winings
Venue: Communications of the ACM (1969)

A discussion is given of alterations that were made to a typical university operating system to record the results of programming exercises in three different languages, includeing assembly language. In this computer-controlled grading scheme provision is made for testing with programmer-supplied data and for final runs with system-supplied data. Exercises run under the scheme may be mixed with other programs, and no special recognition of exercises by the operators is necessary.
HYDRA: the kernel of a multiprocessor operating system
Authors: W. Wulf, E. Cohen, W. Corwin, A. Jones, R. Levin, C. Pierson, F. Pollack
Venue: Communications of the ACM (1974)

This paper describes the design philosophy of HYDRA&mdash;the kernel of an operating system for C.mmp, the Carnegie-Mellon Multi-Mini-Processor. This philosophy is realized through the introduction of a generalized notion of &ldquo;resource,&rdquo; both physical and virtual, called an &ldquo;object.&rdquo; Mechanisms are presented for dealing with objects, including the creation of new types, specification of new operations applicable to a given type, sharing, and protection of any reference to a given object against improper application of any of the operations defined with respect to that type of object. The mechanisms provide a coherent basis for extension of the system in two directions: the introduction of new facilities, and the creation of highly secure systems.
Fortran 77
Authors: Walt Brainerd
Venue: Communications of the ACM (1978)

There is a new standard Fortran. The official title is &ldquo;American National Standard Programming Language Fortran, X3.9-1978,&rdquo; but it is more commonly referred to as &ldquo;Fortran 77,&rdquo; since its development was completed in 1977. It replaces the Fortran standard designated X3.9-1966. This paper describes many of the features of Fortran 77 and also provides some information about how and why the standard was developed.
Policies for using replica groups and their effectiveness over the Internet
Authors: G. Morgan, P. D. Ezilchelvan
Venue: Proceedings of NGC 2000 on Networked group communication (2000)

Replication is known to offer high availability in the presence of failures. This paper considers the case of a client making invocations on a group of replicated servers. It identifies attributes that typically characterise group invocation and replica management, and the options generally available for each attribute. A combination of options on these attributes constitutes a policy. The paper proposes an implementation framework which, by its group-oriented nature, simplifies the task of supporting these policies. It then considers a client (in UCL, London) making invocations on a replica group (in Newcastle, UK) over the Internet. It evaluates the response latencies for four policies that seem appropriate for this set-up. The evaluation takes into account the timing of server crashes with respect to client invocations; both real and virtual failures are considered, the latter being not uncommon in the Internet environment. The experiments are carried out using a CORBA compliant system called NewTop.
Minimax nonlinear approximation by approximation on subsets
Authors: C. B. Dunham
Venue: Communications of the ACM (1972)

A possible algorithm for minimax approximation on an infinite set X consists in choosing a sequence of finite point sets {Xk} which fill out X and taking a limit of minimax approximations on Xk as k &rarr; &infin;. Such a procedure is considered by Rice [4, pp. 12-15]. In the case of linear approximation such a procedure has been shown to converge [1, pp. 84-88]. It has been claimed by Watson [5] that the procedure works for approxition by nonlinear families.
Simple LR(k) grammars
Authors: Franklin L. DeRemer
Venue: Communications of the ACM (1971)

A class of context-free grammars, called the &ldquo;Simple LR(k)&rdquo; or SLR(k) grammars is defined. This class has been shown to include weak precedence and simple precedence grammars as proper subsets. How to construct parsers for the SLR(k) grammars is also shown. These parser-construction techniques are extendible to cover all of the LR(k) grammars of Knuth; they have been implemented and by direct comparison proved to be superior to precedence techniques, not only in the range of grammars covered, but also in the speed of parser construction and in the size and speed of the resulting parsers.
Cognitive radio for flexible mobile multimedia communications
Authors: Joseph Mitola,  III
Venue: Mobile Networks and Applications (2001)

Wireless multimedia applications require significant bandwidth, some of which will be provided by third-generation (3G) services. even with substantial investment in 3G infrastructure, the radio spectrum allocated to 3G will be limited. Cognitive radio offers a mechanism for the flexible pooling of radio spectrum using a new class of protocols called formal radio etiquettes. This approach could expand the bandwidth available for conventional uses (e.g., police, fire and rescue) and extend the spatial coverage of 3G in a novel way. Cognitive radio is a particular extension of software radio that employs model-based reasoning about users, multimedia content, and communications context. This paper characterizes the potential contributions of cognitive radio to spectrum pooling and outlines an initial framework for formal radio-etiquette protocols.
Loss-bounded analysis for differentiated services
Authors: Alexander Kesselman, Yishay Mansour
Venue: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms (2001)

We consider a network providing Differentiated Services (Diffserv) which allow network service providers to offer different levels of Quality of Service (QoS) to different traffic streams. We focus on loss and first show that only trivial bounds could be obtained by means of traditional competitive analysis. Then we introduce a new approach for estimating loss of an online policy called loss-bounded analysis. In loss-bounded analysis the loss of an online policy are bounded by the loss of an optimal offline policy plus a constant fraction of the benefit of an optimal offline policy. We derive tight upper and lower bounds for various settings of Diffserv parameters using the new loss-bounded model. We believe that loss-bounded analysis is an important technique that may complement traditional competitive analysis and provide new insight and interesting results.
Animations to Assist Learning Some Key Computer Science Topics
Authors: Osman Balci, William S. Gilley, Robin J. Adams, Emre Tunar, N. Dwight Barnette
Venue: Journal on Educational Resources in Computing (JERIC) (2001)

The purpose of the work presented herein is to provide multimedia course material with animations to assist learning some key Computer Science topics on the World Wide Web. The work is presented in eight learning modules: Algorithms, Artificial Intelligence, Data Structures, Machine Architecture, Number Systems, Operating Systems, Programming Languages, and Software Engineering. Each module consists of a set of lessons with animations and interactive components including review questions. The work consists of 44 animations, 2,008 files, and 255 folders, totaling 15.5MB. The learning modules enable educators to provide a learning environment beyond the bounds of the classroom either to supplement their in-class teaching or as part of a distance learning course. The animations and interactive components are expected to improve the effectiveness of learning the covered topics.
Integration of elementary patterns into the first-year CS curriculum
Authors: Autumn C. Spaulding
Venue: Journal of Computing Sciences in Colleges (2001)

This poster will present ongoing research into documenting elementary patterns and using them as a structuring mechanism for lectures, in-class laboratory assignments, and programming projects in CS1 and CS2. The poster will focus on a subset of labs and projects that best exemplify the methodology that we employ.
Accessing Endoscopic Images for Remote Conference and Diagnosis Using WWW Server with a Secure Socket Layer
Authors: Masao Hashiba, Takayuki Matsuto, Futoshi Arai, Tomoko Yamakawa, Kouhei Akazawa
Venue: Journal of Medical Systems (2000)

Out of 137 hospitals in Niigata prefecture, 13 are connected to the Internet. The number of private clinics using the Internet has also increased. It is thought that an endoscopic information exchange over the Internet connection is useful for the cooperation between hospitals, clinics and organizations in related fields. A conventional World Wide Web (WWW) server of endoscopic images has been built around a compressed JPEG (Joint Panel Expert Group) format, for remote conferences and diagnoses. It has been made secure using a proxy server, a firewall server and a Secure Socket Layer (SSL). It is easy to access the server and view these endoscopic images using the usual homepage browsing method. Ordinarily, gastroenterologists would diagnose lesions with endoscopy in most cases. It is suggested that this conventional WWW server will be effective for remote conferences in some cases, even consultation will be possible.
Hybrid simulation models of computer systems
Authors: H. D. Schwetman
Venue: Communications of the ACM (1978)

This paper describes the structure and operation of a hybrid simulation model in which both discrete-event simulation and analytic techniques are combined to produce efficient yet accurate system models. In an example based on a simple hypothetical computer system, discrete-event simulation is used to model the arrival and activation of jobs, and a central-server queueing network models the use of system processors. The accuracy and efficiency of the hybrid technique are demonstrated by comparing the result and computational costs of the hybrid model of the example with those of an equivalent simulation-only model.
Medical Markup Language (MML) for XML-based Hospital Information Interchange
Authors: Kenji Araki, Katsuhiro Ohashi, Shunji Yamazaki, Yasuyuki Hirose, Yoshinori Yamashita, Ryuichi Yamamoto, Kazushi Minagawa, Norihiro Sakamoto, Hiroyuki Yoshihara
Venue: Journal of Medical Systems (2000)

Medical Markup Language (MML) has been developed over the last 6 years in order to create a set of standards by which medical data, within Japan and hopefully worldwide, can be stored, accessed and exchanged in any number of physical locates. The MML version 2.21 is characterized by XML as meta-language, module structure for each document and enhancement of linking function among documents. Data exchange specification has been also added for query and reply. MML instances are composed of MML header and MML body. The MML header includes information for data transmission, while MML body includes several module items. One module item contains two elements: document information and module content. Nine MML module contents are defined at the present time: patient information, health insurance information, diagnosis information, lifestyle information, basic clinic information, particular information at the time of first visit, progress course information, surgery record information and clinical summary information.
Maximum current estimation considering power gating
Authors: Fei Li, Lei He
Venue: Proceedings of the 2001 international symposium on Physical design (2001)

As semiconductor technology scales down, the leakage power will soon become comparable to the dynamic power. To reduce both dynamic and leakage power, power gating in addition to clock gating should be used because clock gating saves only dynamic power. The knowledge of maximum current is needed to design high-performance and reliable circuits using power gating. However, all existing techniques for maximum current estimation are not applicable to power gating. In this paper, we study the maximum current estimation problem considering power gating. We develop two algorithms based on automatic test pattern generation (ATPG), and apply them to ISCAS'85 benchmarks. Experiments show that our new estimation algorithms can finish the largest benchmark circuit within ten seconds, and achieve up to 87% larger current when compared to an existing ATPG-based estimation algorithm that is able to obtain maximum current estimation 6% less than the theoretical maximum current without considering power gating. This implies that power gating may lead to a larger maximum current when compared to the normal maximum switching current, and open a new avenue for maximum current estimation as well as circuit reliability research.
A compiler-building system developed by Brooker and Morris: including a comprehensive discussion of the major features of the system
Authors: Saul Rosen
Venue: Communications of the ACM (1964)

In a number of articles published during the past two years, R. A. Brooker and D. Morris (joined by J. S. Rohl in their most recent paper) have presented a very interesting programming system that they have developed for the Ferranti Atlas computer. The present paper describes some of the major features of their system. It expands on some points that the original authors cover briefly, and treats only very lightly some topics to which they devote considerable space. The purpose of this paper is purely expository. Except in some very small details, and in some comments, it does not intentionally depart from or add to the material published in the listed references. In the opinion of the writer, systems of this kind are well worth implementing and will provide useful research tools in the development of languages and techniques. This opinion is true even when such systems turn out to be of limited usefulness in producing &ldquo;production&rdquo; compilers, where compiling speed and object code optimization may be considered more important than language flexibility and elegance or generality of system organization.
Using TAME to prove invariants of automata models: Two case studies
Authors: Myla Archer, Constance Heitmeyer, Elvinia Riccobene
Venue: Proceedings of the third workshop on Formal methods in software practice (2000)

TAME is a special-purpose interface to PVS designed to support developers of software systems in proving properties of automata models. One of TAME's major goals is to allow a software developer who has basic knowledge of standard logic, and can do hand proofs, to use PVS to represent and to prove properties about an automaton model without first becoming a PVS expert. A second goal is for a human to be able to read and understand the content of saved TAME proofs without running them through the PVS proof checker. A third goal is to make proving properties of automata with TAME less costly in human time than proving such properties using PVS directly. Recent work by Romijn and Devillers et al., based on the I/O automata model, has provided the basis for two case studies on how well TAME achieves these goals. Romijn specified the RPC-Memory Problem and its solution, while Devillers et al. specified a tree identify protocol. Hand proofs of specification properties were provided by the authors. In addition, Devillers et al. used PVS directly to mechanize the specifications and proofs of the tree identify protocol. In one case study, the third author, a new TAME user with no previous PVS experience, used TAME to create PVS specifications of the I/O automata presented by Romijn and Devillers et al. and to check the hand proofs of invariant properties. The PVS specifications and proofs of Devillers et al. \hspace*{-.03in} provide the basis for the other case study, which compares the TAME approach to an alternate approach which uses PVS directly.
Linux in a nutshell (3rd ed.): a desktop quick reference
Authors: Ellen Siever, Stephen Spainhour, Stephen Figgins, Jessica P. Hekman
Venue:  (2000)

Linux in a Nutshell covers the core commands available on common Linux distributions. This isn't a scaled-down quick reference of common commands, but a complete reference to all user, programming, administration, and networking commands with complete lists of options. Contents also include: LILO and Loadlin (boot) optionsShell syntax and variables for the bash, csh, and tcsh shellsPattern matchingEmacs and vi editing commandssed and gawk commandsCommon configuration tasks for the GNOME and KDE desktops and the fvwm2 window manager New material in the third edition includes common configuration tasks for the GNOME and KDE desktops and the fvwm2 window manager, the dpkg Debian package manager, an expanded investigation of the rpm Red Hat package manager and CVS, and many new commands. Linux in a Nutshell is a must for any Linux user; it weighs less than a stack of manual pages, but delivers everything needed for common, day-to-day use. It also covers a wide range of GNU tools for Unix users who have GNU versions of standard Unix tools.
Transparent checkpointing and rollback recovery mechanism for Windows NT applications
Authors: Youhui Zhang, Dongsheng Wang, Weimin Zheng
Venue: ACM SIGOPS Operating Systems Review (2001)

Clusters of industry-standard computers running Windows NT are emerging as a competitive alternative for large-scale parallel computing. However, clusters have increased susceptibility to failure especially when they contain many nodes. Therefore it is necessary to implement high availability on Windows NT. This paper introduces the Checkpoint and Rollback Recovery (CRR) mechanism on Windows NT and presents WinNTCkpt, a Checkpointing and recovery tool implemented by us. WinNTCkpt can be used to transparently checkpoint and recover applications running on Windows NT. To use this tool, user is only required to provide the application's executable code instead of source code. WinNTCkpt also provides a set of CRR APIs for users to construct applications with high availability. Owing to API interception and thread injection mechanisms, WinNTCkpt endows some existing applications with CRR functions. WinNTCkpt has been proved valid for Windows NT 4.0 and Windows 2000 applications.
An integrated interface for proactive, experience-based design support
Authors: David B. Leake, Larry Birnbaum, Kristian Hammond, Cameron Marlow, Hao Yang
Venue: Proceedings of the 6th international conference on Intelligent user interfaces (2001)

Many case-based reasoning systems have been developed to aid designers by providing them with libraries of prior design experiences. Traditionally, these systems are implemented as stand-alone ``external memories'' for the designer to query manually. This paper presents a contrasting approach that integrates proactive case retrieval into the designer's normal task processes, automatically tailoring information selection and presentation emphasis to fit changing designer needs and attention flow. The paper presents a set of principles for this integrated intelligent design support and describes their application in the Stamping Advisor, a system to support design feasibility analysis for sheet metal automotive parts. The Stamping Advisor interface proactively provides designers with relevant information to support feasibility analysis, automatically prepares their information products, and unobtrusively gathers the information needed to generate new cases to improve the quality of future support.