ppxscal/embedding_network huggingface dataset:
Conformance and mirroring for timed asychronous circuits
Authors: Bin Zhou, Tomohiro Yoneda, Bernd-Holger Schlingloff
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

Conformance has been used as a correctness criterion for asynchronous circuits. In the case of untimed systems, conformance of an implementation to a specification is equivalent to the failure-freeness between the implementation and the mirror of the specification. For bounded-delay systems, in general this property does not hold. In this paper, we define various notions of failures and examine whether the above property holds or not. We then discuss an alternative and effective algorithm for conformance checking of bounded-delay asynchronous circuits.
Optimizing the polyphase sort
Authors: Donald L. Shell
Venue: Communications of the ACM (1971)

Various dispersion algorithms for the polyphase sorting procedure are examined. The optimum algorithm based on minimizing the total number of unit strings read is displayed. The logic of this algorithm is rather complicated; hence, several other new dispersion algorithms with more straightforward logic are presented. Of the simple dispersion algorithms discussed, the Horizontal is best. It does approximately one-fourth to one and one-half percent less reading and writing than most algorithms in use today. An additional two and one-fourth to three percent improvement can be achieved by utilizing the Modified Optimum Algorithm. This algorithm is relatively straightforward, but it requires a fairly close estimate of the total number of unit strings before the dispersion begins.
Heroes, villians, magicians, &hellip;: dramatis personae in a virtual story creation environment
Authors: Ana Paiva, Isabel Machado, Rui Prada
Venue: Proceedings of the 6th international conference on Intelligent user interfaces (2001)

One difficulty in creating synthetic characters for interactive stories is that these characters must convey their role in the story in a believable way. However, the relation between believability, on one side, and the role a character plays in a drama, on the other, has not yet been fully addressed. In this paper we will present a view on how to develop believable synthetic characters whose behaviour is based on a set of predefined functions (Propp's functions) associated with the role they play in the story. To illustrate the approach, we will present a collaborative virtual environment, Teatrix, designed for children to build their own stories-fairy tales. In Teatrix, virtual actors play roles (such as villain, hero, magician, etc), which are functional for the development of the story. Such roles have pre-defined goals and plans, allowing the story to flow and climax situations to arise. Teatrixis already in use by children ages between 7 and 9, in the context of a Computer-Integrated Classroom scenario.
Mathematical modeling of age differences in hierarchical navigation systems
Authors: Panayiotis Zaphiris, Darin Ellis
Venue: Proceedings on the 2000 conference on Universal Usability (2000)

This poster presents a modification to an existing mathematical model for depth-breath tradeoff of menu-selection to account for age related differences.
The effect of programming team structures on programming tasks
Authors: Marilyn Mantei
Venue: Communications of the ACM (1981)

The literature recognizes two group structures for managing programming projects: Baker's chief programmer team and Weinberg's egoless team. Although each structure's success in project management can be demonstrated, this success is clearly dependent on the type of programming task undertaken. Here, for the purposes of comparison, a third project organization which lies between the other two in its communication patterns and dissemination of decision-making authority is presented. Recommendations are given for selecting one of the three team organizations depending on the task to be performed.
Modelling IP Mobility
Authors: Roberto M. Amadio, Sanjiva Prasad
Venue: Formal Methods in System Design (2000)

We study a highly simplified version of the proposed mobility support in version 6 of Internet Protocols (IP). We concentrate on the issue of ensuring that messages to and from mobile agents are delivered without loss of connectivity. We provide three models, of increasingly complex nature, of a network of routers and computing agents that are interconnected via the routers: the first is without mobile agents and is treated as a specification for the next two&semi; the second supports mobile agents, and the third additionally allows correspondent agents to cache the current location of a mobile agent. Following a detailed analysis of the three models to extract invariant properties, we show that the three models are related by a suitable notion of equivalence based on barbed bisimulation. Finally, we report on some experiments in simulating and verifying finite state versions of our model.
Talk&mdash;a high-level source language debugging technique with real-time data extraction: 26
Authors: R. L. ver Steeg
Venue: Communications of the ACM (1964)

TALK, meaning Take A LooK, is a debugging technique which aids substantially in debugging complex real-time programming systems by interrupting the users program at desired points to extract previously specified data. The extracted data is later edited, listing the associated data with its high-level source language identification.
Shallow binding in Lisp 1.5
Authors: Henry G. Baker,  Jr.
Venue: Communications of the ACM (1978)

Shallow binding is a scheme which allows the value of a variable to be accessed in a bounded amount of computation. An elegant model for shallow binding in Lisp 1.5 is presented in which context-switching is an environment tree transformation called rerooting. Rerooting is completely general and reversible, and is optional in the sense that a Lisp 1.5 interpreter will operate correctly whether or not rerooting is invoked on every context change. Since rerooting leaves assoc [v, a] invariant, for all variables v and all environments a, the programmer can have access to a rerooting primitive, shallow[], which gives him dynamic control over whether accesses are shallow or deep, and which affects only the speed of execution of a program, not its semantics. In addition, multiple processes can be active in the same environment structure, so long as rerooting is an indivisible operation. Finally, the concept of rerooting is shown to combine the concept of shallow binding in Lisp with Dijkstra's display for Algol and hence is a general model for shallow binding.
Abstract Optimal Linear Filtering
Authors: Vladimir N. Fomin, Michael V. Ruzhansky
Venue: SIAM Journal on Control and Optimization (2000)

The linear optimal filtering problems in infinite dimensional Hilbert spaces and their extensions are investigated. The quality functional is allowed to be a general quadratic functional defined by a possibly degenerate operator. We describe the solution of the stable and the causal filtering problems. In the case of causal filtering, we establish the relation with a relaxed causal filtering problem in the extended space. We solve the last problem in continuous and discrete cases and give the necessary and sufficient conditions for the solvability of the original causal problem as well as the conditions for the analogue of the Bode--Shannon formula to define an optimal filter.
Synthesis of single-output space compactors with application to scan-based IP cores
Authors: Bhargab B. Bhattacharya, Alexej Dmitriev, Michael Gössel, Krishendu Chakrabarty
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

This paper addresses the problem of space compaction of test responses of combinational and scan-based sequential circuits. It is shown that given a precomputed test set T, the test responses at the functional outputs of the given circuit-under-test (CUT) can be compacted to a single periodic output, with guaranteed zero-aliasing. The method is independent of the fault model and the structure of the CUT, and uses only the knowledge of the test set T and the corresponding fault-free responses|it is particularly suitable for intellectual property (IP) cores. A new concept of distinguishing outputs and characteristic response function is utilized for synthesizing the compactor. Relevant experimental results on hardware overhead for several ISCAS circuits are presented.
An algorithm for finding a fundamental set of cycles of a graph
Authors: Keith Paton
Venue: Communications of the ACM (1969)

A fast method is presented for finding a fundamental set of cycles for an undirected finite graph. A spanning tree is grown and the vertices examined in turn, unexamined vertices being stored in a pushdown list to await examination. One stage in the process is to take the top element v of the pushdown list and examine it, i.e. inspect all those edges (v, z) of the graph for which z has not yet been examined. If z is already in the tree, a fundamental cycle is added; if not, the edge (v, z) is placed in the tree. There is exactly one such stage for each of the n vertices of the graph. For large n, the store required increases as n2 and the time as n&ggr; where &ggr; depends on the type of graph involved. &ggr; is bounded below by 2 and above by 3, and it is shown that both bounds are attained. In terms of storage our algorithm is similar to that of Gotlieb and Corneil and superior to that of Welch; in terms of speed it is similar to that of Welch and superior to that of Gotlieb and Corneil. Tests show our algorithm to be remarkably efficient (&ggr; = 2) on random graphs.
Accommodating uncertainty in software design
Authors: Richard V. Giddings
Venue: Communications of the ACM (1984)

Recognition that most software is domain dependent (DD) is extremely important because the most commonly used software life-cycle models are not adequate for DD software. The nature of DD software, and the need to manage its life cycle effectively, calls for a new approach to software design and the implementation of software development environments.
One lost bit
Authors: C. A. Oster
Venue: Communications of the ACM (1962)

The final result of prolonged computations will in general contain some errors. These errors are composed in part of computational round-off errors. This note points out one source of round-off error encountered in the IBM 709-7090 machines. An example is included which demonstrates the potential seriousness of this error and finally a means of coping with it is given. The notation used here is that used in [1].
Performance analysis of cellular mobile communication networks supporting multimedia services
Authors: M. Ajmone Marsanr, S. Marano, C. Mastroianni, M. Meo
Venue: Mobile Networks and Applications (2000)

This paper illustrates the development of an analytical model for a communication network providing integrated services to a population of mobile users, and presents performance results to both validate the analytical approach, and assess the quality of the services offered to the end users. The analytical model is based on continuous&mdash;time multidimensional birth&ndash;death processes, and is focused on just one of the cells in the network. The cellular system is assumed to provide three classes of service: the basic voice service, a data service with bit rate higher than the voice service, and a multimedia service with one voice and one data component. In order to improve the overall network performance, some channels can be reserved to handovers, and multimedia calls that cannot complete a handover are decoupled, by transferring to the target cell only the voice component and suspending the data connection until a sufficient number of channels become free. Numerical results demonstrate the accuracy of the approximate model, as well as the effectiveness of the newly proposed multimedia call decoupling approach.
Content-based retrieval of breast cancer biopsy slides
Authors: F. Schnorrenberg, C. S. Pattichis, C. N. Schizas, K. Kyriacou
Venue: Technology and Health Care (2000)

The Biopsy Analysis Support System (BASS), previously used for image analysis of immunohistochemically stained sections of breast carcinoma, has been extended to include indexing and content-based retrieval of biopsy slide images from a database of 57 captured cases. Images from histopathological biopsy slides are described and these are accessed in terms of the properties of either individual nuclei or groups of cell nuclei present in the slide. Visual similarity of cases is specified in terms of a diagnostic index, commonly known as the H-score, which incorporates the heterogeneity of nuclear staining intensity, as well as the percentage of nuclei staining at specific intensities. The system provides a platform that can be exploited in telepathology and teleconsultation, but further research is needed to explore its full potential and accuracy in a diagnostic clinical environment.
Reduction of Number of Paths to be Tested in Delay Testing
Authors: Huawei Li, Zhongcheng Li, Yinghua Min
Venue: Journal of Electronic Testing: Theory and Applications (2000)

Delay testing is important for high speed ICs. The main difficulty in delay testing comes from the huge number of paths and the large percentage of delay untestable paths. Therefore, it is critical to reduce the number of paths to be tested in delay testing. This paper presents two approaches to delay testing with significant reduction of number of paths to be tested, which provide high path delay fault coverage by testing a small number of paths. In the first approach, it is necessary to sample the primary output twice, one before and another after the transition for each test pair. The second approach is by means of accurate measurement of delays of very limited number of paths. In order to make this approach feasible, the paper also introduces a new concept of path sensitization, termed single-transition sensitization, to allow direct measurement of propagation delay of those paths. The paper presents how to select the very limited number of paths, termed sample paths, and how to generate test pairs and observation times for the sample paths for the first approach. On the other hand, it is noted for the second approach that under the analytical delay model (Proc. 9th International Conf. on VLSI Design, Bangalore, India, Jan. 1996, pp. 162&ndash;165), most of the paths are delay testable, which makes the accurate measurement approach feasible. In fact, it would be very difficult to select sample paths based on single path sensitization as it was done in (IEEE Trans. on Computers, Vol. c-29, No. 3, pp. 235&ndash;248, March 1980). The paper shows that the number of sample paths is linear to the number of gates in the circuit under test, despite exponential growth in the number of single paths.
Globally Convergent Modification of the Quickprop Method
Authors: Michael N. Vrahatis, George D. Magoulas, Vassilis P. Plagianakos
Venue: Neural Processing Letters (2000)

A mathematical framework for the convergence analysis of the well-known Quickprop method is described. Furthermore, we propose a modification of this method that exhibits improved convergence speed and stability, and, at the same time, alleviates the use of heuristic learning parameters. Simulations are conducted to compare and evaluate the performance of the new modified Quickprop algorithm with various popular training algorithms. The results of the experiments indicate that the increased convergence rates achieved by the proposed algorithm, affect by no means its generalization capability and stability.
Imposing specificity by regulated localization (abstract only)
Authors: Mark Ptashne
Venue: Proceedings of the fifth annual international conference on Computational biology (2001)

Many biologically important enzymes &mdash; RNA polymerases, RNA splicing enzymes, ubiquinating enzymes, certain kinases and proteases &mdash; are &ldquo;`regulated&rdquo;' by being brought to one or another of many potential substrates by auxiliary docking proteins (e.g. transcriptional activators). These regulatory interactions require interactions between simple adhesive (but specific) surfaces. This kind of regulation is highly `evolvable' : new and expanded meanings to signals are readily generated by simple changes in protein surfaces.
Storage and retrieval of aspects of meaning in directed graph structures
Authors: R. F. Simmons
Venue: Communications of the ACM (1966)

An experimental system that uses LISP to make a conceptual dictionary is described. The dictionary associates with each English word the syntactic information, definitional material, and references to the contexts in which it has been used to define other words. Such relations as class inclusion, possession, and active or passive actions are used as definitional material. The resulting structure serves as a powerful vehicle for research on the logic of question answering. Examples of methods of inputting information and answering simple English questions are given. An important conclusion is that, although LISP and other list processing languages are ideally suited for producing complex associative structures, they are inadequate vehicles for language processing on any large scale&mdash;at least until they can use auxiliary memory as a continuous extension of core memory.
MUX, a simple approach to on-line computing
Authors: Ronald D. Christman
Venue: Communications of the ACM (1972)

An on-line system operating as part of a normal batch system for the CDC 6600 computer is described. The system, which required one man-year for initial software implementation, although basically simple, provides the necessary elements to input and modify files, submit them for batch execution, and provide results at the user's terminal. A multiplexer designed and developed as part of the project cost one man-year for design and checkout, and $16,000 for parts and fabrication. All aspects of the system are described, including design criteria, implementation, cost, overhead, and user reactions.
Accelerating the convergence of random search methods for discrete stochastic optimization
Authors: Sigrún Andradóttir
Venue: ACM Transactions on Modeling and Computer Simulation (TOMACS) (1999)

We discuss the choice of the estimation of the optimal solution when random search methods are applied to solve discrete stochastic optimization problems. At the present time, such optimization methods usually estimate the optimal solution using either the feasible solution the method is currently exploring or the feasible solution visited most often so far by the method. We propose using all the observed objective function values generated as the random search method moves around the feasible region seeking an optimal solution to obtain increasingly more precise estimates of the objective function values at the different points in the feasible region. At any given time, the feasible solution that has the best estimated objective function value (largest one for maximization problems; the smallest one for minimization problems) is used as the estimate of the optimal solution. We discuss the advantages of using this approach for estimating the optimal solution and present numerical results showing that modifying an existing random search method to use tnhis approach for estimating the optimal soluation appears to yield improved performance. We also present sereval rate of convergence results for random search methods using our approach for estimating the optimal solution. One these random search methods is a new variant of the stochastic comparison method; in addition to specifying the rate of convergence of this method, we prove that it is guaranteed to converge almost surely to the set of global optimal solutions and present a result that demonstrates that this method is likely to perform well in practice.
Low-power high-level synthesis using latches
Authors: Wooseung Yang, In-Cheol Park, Chong-Min Kyung
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

High-level synthesis using latches has many merits in power, area and even in speed. But latches cannot be read and written at the same time and usually requires two-phase non-overlapping clock that is unpleasant choice for short-term design. In this paper we propose a storage allocation method that makes it possible to use latches as storage elements in single clocking scheme. The proposed method modifies the lifetime of variables slightly so that it can be applied to any high-level synthesis systems with small modification. The experimental results show 39 ~ 65% reduction in power consumption within almost same area compared to the conventional power management scheme using clock gating.
MT-based Japanese-Enlish cross-language IR experiments using the TREC test collections
Authors: Tetsuya Sakai
Venue: Proceedings of the fifth international workshop on on Information retrieval with Asian languages (2000)

This paper evaluates the effectiveness of MT-based Japanese-English CLIR using a subcollection of the TREC test collections and two bilingual researchers to separately translate the TREC requests into Japanese. Our main findings are as follows: (1)With the aid of pseudo-relevance feedback, MT-based J-E CLIR can be as effective as &ldquo;best-case&rdquo; monolingual IR. In particular, although poor MT quality often leads to poor initial CLIR performance, pseudo-relevance feedback is useful for alleviating the harm; (2)The manual request translation process that is inherent in conventional CLIR performance evaluation can be a more dominant factor than query length and overall MT quality.
The synthesis of loop predicates
Authors: Ben Wegbreit
Venue: Communications of the ACM (1974)

Current methods for mechanical program verification require a complete predicate specification on each loop. Because this is tedious and error prone, producing a program with complete, correct predicates is reasonably difficult and would be facilitated by machine assistance. This paper discusses techniques for mechanically synthesizing loop predicates. Two classes of techniques are considered: (1) heuristic methods which derive loop predicates from boundary conditions and/or partially specified inductive assertions: (2) extraction methods which use input predicates and appropriate weak interpretations to obtain certain classes of loop predicates by an evaluation on the weak interpretation.
General education in the computer science curriculum: software engineering
Authors: Paul M. Mullins
Venue: Journal of Computing Sciences in Colleges (2001)

This tutorial gives an overview of the C++ standard template library (STL), including its overall structure, functionality, and capabilities. Particular emphasis is placed on the ways in which STL may be used in the curriculum.
A formal approach to verification of linear analog circuits wth parameter tolerances
Authors: L. Hedrich, E. Barke
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

This contribution presents an approach to formal verification of linear analog circuits with parameter tolerances. The method proves that an actual circuit fulfills a specification in a given frequency interval for all parameter variations. It is based on a curvature driven bound computation for value sets using interval arithmetic. Some examples demonstrate the feasibility of our approach.