ppxscal/embedding_network huggingface dataset:
The Clarkson-Shor technique revisited and extended
Authors: Micha Sharir
Venue: Proceedings of the seventeenth annual symposium on Computational geometry (2001)

We provide an alternative simpler and more general deriva- tion of the Clarkson-Shor probabilistic technique [4] and use it to obtain in addition several extensions and new combi- natorial bounds.
The quadratic hash method when the table size is not a prime number
Authors: Vladimir Batagelj
Venue: Communications of the ACM (1975)

Previous work on quadratic hash methods is limited mainly to the case where the table size is a prime number. Here, certain results are derived for composite numbers. It is shown that all composite numbers containing at least the square of one of the component primes have full-period integer-coefficient quadratic hash functions.
Nonlinear population dynamics in the chemostat
Authors: Jean-Philippe Grivet
Venue: Computing in Science and Engineering (2001)

The author describes the chemostat, a device used to study bacterial populations under nutrient-limited conditions. This article shows that a simple criterion can help predict which species survive in the long run, an example of the principle of mutual exclusion.
On Supporting Temporal Quality of Service in WDMA-Based Star-Coupled Optical Networks
Authors: Hung-Ying Tyan, Jennifer C. Hou, Bin Wang, Ching-Chih Han
Venue: IEEE Transactions on Computers (2001)

In this paper, we devise a preallocation-based single-hop wavelength division multiple access (WDMA) scheme to support temporal quality of service (QoS) in star-coupled optical networks. We consider a star-coupled broadcast-and-select network architecture in which $N$ stations are connected to a star coupler with $W$ different wavelength channels. Each of the $W$ wavelength channels is slotted and shared by the $N$ stations by means of time division multiplexing. Depending on the tunability characteristics (tunable or fixed tuned) of the transmitters/receivers, we classify the network architecture as tunable transmitter/fixed tuned receiver (TT-FR), fixed tuned transmitter/tunable receiver (FT-TR), and tunable transmitter/tunable receiver (TT-TR). We first characterize each real-time message stream $M_i$ with two parameters, the relative message deadline $D_i$ and the maximum (total) message size $C_i$ that can arrive within any time interval of length $D_i$. We then discuss a restricted case in a TT-FR (or FT-TR) system in which the message streams from a source station are assumed to be all destined for the same destination station. Under this assumption, no source/destination conflicts may occur. We propose a preallocation-based slot assignment scheme to preallocate slots to a set of isochronous message streams, $\{M_i=(C_i,D_i) \mid 1 \leq i \leq n\}$ in such a way that, in any time window of size $D_i$ slots, at least $C_i$ slots on a wavelength channel are allocated to $M_i$ for all $i$. With the solution derived in the restricted case as a basis, we then consider slot assignment in a (general) TT-TR system and propose a binary splitting scheme to assign each message stream sufficient and well-spaced slots to fulfill its temporal requirement, subject to the source/destination conflict constraints. We rigorously prove the invariance properties, and the correctness, of the binary splitting scheme.
Statistical programs at the University of North Carolina
Authors: Norman Bush
Venue: Communications of the ACM (1961)

The Research Computation Center at the University of North Carolina has access to a UNIVAC 1105 general purpose digital computer for use in connection with data processing problems, theoretical studies, and computer research. With respect to data processing problems, three major statistical programs have been written: General Contingency Table Analysis for Questionnaire Data Analysis of Variance (ANOVA) Multiple Regression and Correlation Some of the concepts and ideas in these programs are new and may be of interest to other computation centers. Hence they are described below. The programs were written in the Remington Rand UNICODE language. Thus it would not be difficult to translate them into any other algebraic language, such as ALGOL, FORTRAN, or IT.
ELFS: English language from SQL
Authors: W. S. Luk, Steve Kloster
Venue: ACM Transactions on Database Systems (TODS) (1986)

In this paper we describe a system which, given a query in SQL-like relational database language, will display its meaning in clear, unambiguous natural language. The syntax-driven translation mechanism is independent of the application domain. It has direct applications in designing computer-based SQL tutorial systems and program debugging systems. The research results obtained in the paper will also be useful in query optimization and design of a more user-friendly language front-end for casual users.
Application frameworks before system frameworks
Authors: Jon Hancock
Venue: Addendum to the 2000 proceedings of the conference on Object-oriented programming, systems, languages, and applications (Addendum) (2000)

Application development with an end-to-end declarative Application Framework has shown the following significant benefits: 80% error reduction, 40-80% code reduction, and predictable development cycles by first time object/Java developers. These Application Frameworks may at any point in the development/deployment process sit on top of System Frameworks such as CORBA or EJB.
Overcoming wireload model uncertainty during physical design
Authors: Padmini Gopalakrishnan, Altan Odabasioglu, Lawrence Pileggi, Salil Raje
Venue: Proceedings of the 2001 international symposium on Physical design (2001)

The advent of deep sub-micron technologies has created a number of problems for existing design methodologies. Most prominent among them is the problem of timing closure, whereby design time is dramatically increased due to iterations between gate-level synthesis and physical design. It is well known that the heart of this problem lies in the use of wireload models based on wirelength statistics from legacy designs. Some technology projections in have suggested that wireload models will remain effective to block sizes on the order of 50k gates. This suggests that synthesis will not have to be changed much since this is approximately the maximum size for which logic synthesis is effective. However, our analyses on production designs show that the problem is not quite so straightforward, and the efficacy of synthesis using wireload models depends upon technology data as well as specific characteristics of the design. We analyze these effects and dependencies in detail in this paper, and draw some conclusions about the amount of physical information that is required for synthesis to be effective. Finally, we discuss the implications on hierarchical design flows, and propose a solution via physical prototyping.
Optimal reliable crosstalk driven interconnect optimization
Authors: I. H.-R. Jiang, S.-R. Pan, J.-Y. Jou, Y.-W. Chang
Venue: Proceedings of the 2000 international conference on Computer-aided design (2001)

As technology advances apace, crosstalk becomes a design metric of comparable importance to area and timing. This paper focuses mainly on the crosstalk issue, specifically on the impacts of physical design and process variation on crosstalk. While the feature size shrinks below 0.35 um, the impact of process variation on crosstalk increases rapidly. Hence, a crosstalk insensitive design is desirable in the ultra-deep submicron regime. In this paper, crosstalk sensitivity is referred to as the influence of process variation on crosstalk in a circuit. We show that the lower bound of crosstalk sensitivity grows quadratically, while that of crosstalk increases linearly. Therefore, designers should also consider crosstalk sensitivity, when optimizing other design objectives, such as crosstalk, area, and delay. According to our modeling, these objectives are all in posynomial forms, and thus the multi-objective optimization problem can optimally be solved by Lagrangian relaxation. Experimental results show that our method is effective and efficient. For instance, a circuit of 2856 gates and 5272 wires is optimized using only 46 minute runtime and 2.8 MB memory on a SUN UltraSPARC II 300 workstation. In particular, by relaxing Lagrange multipliers to the critical paths, it takes only two iterations for all solutions to converge to the global optimal, which is much more efficient than related previous work. This relaxation scheme provides a key insight into the rapid convergence in Lagrangian relaxation.
Designing surfaces in 3-D
Authors: James H. Clark
Venue: Communications of the ACM (1976)

An experimental system for computer-aided design of free-form surfaces in three dimensions is described. The surfaces are represented in the system as parametric basis splines. The principal features of the system are: (1) the surfaces are rendered as isoparametric line drawings on a head-mounted display, and they are designed with the aid of a three-dimensional &ldquo;wand,&rdquo; which allows 3-D movements of the points controlling the shapes of the surfaces, (2) all of the interactions with the surfaces are in real-time, and (3) the mathematical formulations used assume no knowledge of them by the user of the system. Also examined are some of the features that should be part of a practical 3-D system for designing space-forms.
Virtual Garden: a vision-based multimedia installation
Authors: Andrew Senior
Venue: Proceedings of the 2000 ACM workshops on Multimedia (2000)

This paper describes a project proposal for a vision-based multimedia installation, bringing together computer vision, computer graphics and other modalities to generate a virtual Japanese garden. The installation provides a platform for exploring human-computer interaction through physical objects.
Towards a graphical notation to express the C++ template instantiation process (poster session)
Authors: Arturo J. Sánchez, Jia Dei-Wei
Venue: Addendum to the 2000 proceedings of the conference on Object-oriented programming, systems, languages, and applications (Addendum) (2000)

C++ programmers who make intensive use of templates for developing applications get poor support from the compilers they use. Typical error reporting associated with template analysis ranges from long, nested, and therefore complex expressions, to short but cryptic messages. This poster introduces a graphical notation that can be used as an intermediate abstract medium on which the result of template analysis can be expressed. The motivation of our approach is to make template analysis and error reporting two orthogonal activities. If compiler implementors adopt a standard notation to express the result of template analysis, tools to help programmers visualize/understand errors can be independently developed, and used as compiler &ldquo;plug-ins&rdquo;, which will hopefully have a positive impact on issues such as programmer's productivity and product quality. We have used this notation to manually parse examples taken from the STL, and less known powerful uses of templates, such as expression templates, and template meta-programming. The preliminary stage we are reporting on has helped us to (a) identify elements that are needed in the notation, (b) identify limitations that are due to the instantiation model inherently associated with the language, and (d) have a sense of how useful the notation can be to pinpoint errors associated with the analysis of non-trivial cases such as expression templates.
Programming semantics for multiprogrammed computations
Authors: Jack B. Dennis, Earl C. Van Horn
Venue: Communications of the ACM (1983)

The semantics are defined for a number of meta-instructions which perform operations essential to the writing of programs in multiprogrammed computer systems. These meta-instructions relate to parallel processing, protection of separate computations, program debugging, and the sharing among users of memory segments and other computing objects, the names of which are hierarchically structured. The language sophistication contemplated is midway between an assembly language and an advanced algebraic language.
On the minimization of SOPs for bi-decomposition functions
Authors: Tsutomu Sasao, Jon T. Butler
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

A function f is AND bi-decomposable if it can be written as f (X1,X2) = h1(X1)h2(X2). In this case, a sum-of-products expression (SOP) for f is obtained from minimum SOPs (MSOP) for h1 and h2 by applying the law of distributivity. If the result is an MSOP, then the complexity of minimization is reduced. However, the application of the law of distributivity to MSOPs for h1 and h2 does not always produce an MSOP for f. We show an incompletely specified function of n(n-1) variables that requires at most n products in an MSOP, while 2(n-1) products are required by minimizing the component functions separately. We introduce a new class of logic functions, called orthodox functions, where the application of the law of distributivity to MSOPs for component functions of f always produces an MSOP for f . We show that orthodox functions include all functions with three or fewer variables, all symmetric functions, all unate functions, many benchmark functions, and few random functions with many variables.
Fast sequential circuit test generation using high-level and gate-level techniques
Authors: E. M. Rudnick, R. Vietti, A. Ellis, F. Corno, P. Prinetto, M. Sonza Reorda
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

A new approach for sequential circuit test generation is proposed that combines software testing based techniques at the high level with test enhancement techniques at the gate level. Several sequences are derived to ensure 100% coverage of all statements in a high-level VHDL description, or to maximize coverage of paths. The sequences are then enhanced at the gate level to maximize coverage of single stuck-at faults. High fault coverages have been achieved very quickly on several benchmark circuits using this approach.
Methods for analyzing data from computer simulation experiments
Authors: Thomas H. Naylor, Kenneth Wertz, Thomas H. Wonnacott
Venue: Communications of the ACM (1967)

This paper addresses itself to the problem of analyzing data generated by computer simulations of economic systems. We first turn to a hypothetical firm, whose operation is represented by a single-channel, multistation queueing model. The firm seeks to maximize total expected profit for the coming period by selecting one of five operating plans, where each plan incorporates a certain marketing strategy, an allocation of productive inputs, and a total cost. The results of the simulated activity under each plan are subjected to an F-test, two multiple comparison methods, and a multiple ranking method. We illustrate, compare, and evaluate these techniques. The paper adopts the position that the particular technique of analysis (possibly not any one of the above) chosen by the experimenter should be an expression of his experimental objective: The F-test tests the homogeneity of the plans; multiple comparison methods quantify their differences; and multiple ranking methods directly identify the one best plan or best plans.
Using algorithm animations to assist teaching state space search: an empirical evaluation
Authors: Peter Gordon McDonald
Venue: Proceedings of the Australasian conference on Computing education (2000)

Traditional laboratory activities for students trying to develop a deep understanding of state space search methods involves them working at programming implementations of search methods. This study aimed to determine if interactive algorithm animations of search methods would make a suitable alternative laboratory activity. The specific hypotheses investigated were: (i) the animation group would develop at least as good an overall understanding of state space search methods; (ii) the animation group would develop a deeper understanding of state space search concepts pertaining to qualitative characteristics of search methods and the relationship between search methods. The basic experimental method adopted was a classical emperical quantitative evaluation involving 30 participants divided into one control group and one experimental group. All participants attended the same lecture presentations on state space search methods, but were split into distinct groups for undertaking the laboratory activities. Results provided good evidence that the animation laboratory activity was at least as effective as traditional programming activities in aiding understanding of state space search methods, and that the animation group students developed a deeper understanding of one aspect of state space search methods.
Digital data processor for tracking the partially illuminated moon
Authors: H. James Wilcox
Venue: Communications of the ACM (1964)

A study of lunar tracking techniques and fabrication of a breadboard to assess the feasibility of the best technique selected was conducted to define a tracking system for observation of the sightline to the center of a partially illuminated moon. The data processing portion of the system is presented in detail and then described in general are the operation of the tracker head assembly for data readout, the operation of the entire system and the effect data processing considerations have on the design of the tracker system. The system basically consists of an optical sensor, digital computer and tracker drive mechanism. The three system units, connected in cascade, comprise the control loop. For this application, an optical telescope with a radial mechanical scanning mechanism was used that read out lunar sightline measurement information. This information is sequentially read into a special purpose digital computer that extracts the measurements and computes the error signals that drive the tracker to the appropriate attitude.
Using macromedia director for multimedia design on the WWW
Authors: Dominick Pinto, Sandra Honda Adams
Venue: Journal of Computing Sciences in Colleges (2001)

The workshop will introduce the attendee to the basic components of Director 7.0 software including the use of stage, cast members, score, paint window, and scripting. The presenters will demonstrate a few completed &ldquo;movies&rdquo; and then lead the attendees though the complete development of a &ldquo;movie.&rdquo; The workshop will feature a hands-on component to allow participation by the audience. The final movie will be &ldquo;shocked&rdquo; in order to facilitate the movie to be viewed on the WWW.
A Multigrid Algorithm for the p-Laplacian
Authors: Rodolfo Bermejo, Juan-Antonio Infante
Venue: SIAM Journal on Scientific Computing (1999)

We introduce a full approximation storage (FAS) multigrid algorithm to find the finite element solution for a class of nonlinear monotone elliptic problems. Since the solution of the problem is equivalent to minimize a strictly convex functional, we use a Polak--Ribiere conjugate gradient method as the nonlinear smoother in our algorithm. The advantage in so doing is that we do not have to calculate derivatives of operators. We prove local convergence of our algorithm and illustrate its performance by solving benchmark problems.
Time and message-efficient S-based consensus (brief announcement)
Authors: Fabíola Greve, Michel Hurfin, Raimundo Macêdo, Michel Raynal
Venue: Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing (2000)

The class of strong failure detectors (denoted S) includes all failure detectors that suspect all crashed processes and that do not suspect some (a priori unknown) process that never crashes. So, a failure detector that belongs to S is intrinsically unreliable as it can arbitrarily suspect correct processes.Several S-based consensus protocols have been designed. They proceed in consecutive asynchronous rounds. Some of them systematically require n rounds (n being the number of processes), each round involving n2 or n messages. Others allow early decision (i.e., when there are no erroneous suspicions, the number of rounds depends only on the maximal number of crashes) but require each round to involve n2 messages.This brief annoucement introduces an early deciding (S-based consensus protocol each round of which involves 3(n - 1) messages. So, the proposed protocol is particularly time and message-efficient. It is based on the rotating coordinator paradigm. Due to space limitation the reader is referred to [2] for an in-depth presentation of the protocol (underlying principles, proof, cost analysis and generalization). Here, the limited space allows us to only compare it with the other S-based consensus protocols we are aware of.This comparison is provided in Table 1. &ldquo;nb&rdquo;, &ldquo;msg&rdquo; and &ldquo;c_s&rdquo; are shortcuts for &ldquo;number&rdquo;, &ldquo;messages&rdquo; and &ldquo;communication steps&rdquo; respectively; GHMR denotes the proposed protocol; &fnof; denotes the maximum number of processes that are allowed to crash; |v| is the maximal size (in bits) of a value a process can initially propose to the consensus. All the protocols work provided that &fnof; < n. Hence, they are optimal with respect to the number of process crashes that can be tolerated. The protocols of the first two lines systematically require n rounds ([4] and [5] each proposes a particular generalization of S; we consider here their protocols used with S). The behavior of the protocols of the last two lines depends on failure occurrences and false failure suspicions (that is why they allow early decision in &ldquo;good&rdquo; scenarios, i.e., when the failure detector does not make mistake). For those lines, the table considers that (1) the failure detector does not make mistake, (2) there are &fnof; failures, and (3) there is a failure per round (the &ldquo;simultaneity&rdquo; of failure occurrences can actually reduce the number of rounds). For the generic protocol described in [3], the table considers its instantiation with S. Hence, it appears that the proposed protocol owns several noteworthy features. The most important of them are its ability to allow early decision and its linear cost for the number of messages per round.
View Management Support in Advanced Knowledge Base Servers
Authors: Martin Staudt, Matthias Jarke
Venue: Journal of Intelligent Information Systems (2000)

&ldquo;Intelligent&rdquo; behavior of database and knowledge base management systems is often seen restricted to comfortable support for query answering (including limited forms of reasoning) and navigating within the stored data. However, active notification for clients about changes in the database is an important requirement for advanced interaction between the database and its client applications. These usually hold (derived) subsets of the database contents under their control. The incremental maintenance of such externally materialized views is an important open problem. In addition to some necessary changes in the known view maintenance procedures the issue of translating updates through an API and a way for clients to accept such updates have to be defined. We describe the main features of a solution to this problem implemented in the knowledge base server ConceptBase.