ppxscal/embedding_network huggingface dataset:
Interprocedural control dependence
Authors: Saurabh Sinha, Mary Jean Harrold, Gregg Rothermel
Venue: ACM Transactions on Software Engineering and Methodology (TOSEM) (2001)

Program-dependence information is useful for a variety of applications, such as software testing and maintenance tasks, and code optimization. Properly defined, control and data dependences can be used to identify semantic dependences. To function effectively on whole programs, tools that utilize dependence information require information about interprocedural dependences: dependences that are identified by analyzing the interactions among procedures. Many techniques for computing interprocedural data dependences exist; however, virtually no attention has been paid to interprocedural control dependence. Analysis techniques that fail to account for interprocedural control dependences can suffer unnecessary imprecision and loss of safety. This article presents a definition of interprocedural control dependence that supports the relationship of control and data dependence to semantic dependence. The article presents two approaches for computing interprocedural control dependences, and empirical results pertaining to teh use of those approaches.
Higher-Order UnCurrying
Authors: John Hannan, Patrick Hicks
Venue: Higher-Order and Symbolic Computation (2000)

We present a formal specification of unCurrying for a higher-order, functional language with ML-style let-polymorphism. This specification supports the general unCurrying of functions, even for functions that are passed as arguments or returned as values. The specification also supports partial unCurrying of any consecutive parameters of a function, rather than only unCurrying all of a function's parameters. We present the specification as a deductive system that axiomatizes a judgment relating a source term with an unCurried form of the term. We prove that this system relates only typable terms and that it is correct with respect to an operational semantics. We define a practical algorithm, based on algorithm {\cal W}, that implements unCurrying and prove this algorithm sound and complete with respect to the deductive system. This algorithm generates maximally unCurried forms of source terms. These results provide a declarative framework for reasoning about unCurrying and support a richer form of unCurrying than is currently found in compilers for functional languages.
Optimal spacing and capacitance padding for general clock structures
Authors: Yu-Min Lee, Hing Yin Lai, Charlie Chung-Ping Chen
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

Clock-tuning has been classified as important but tough tasks due to the non-convex nature caused by the skew requirements. As a result, all existing mathematical programming approaches are often trapped at local minimum and have no guarantee of obtaining global optimal solution. In this paper, we present optimal clock tuning algorithms which effectively apply capacitance-padding to reduce clock skew, power, and delay for general clock topologies. Capacitance-padding can be achieved by wire-spacing, wire-splitting, wire-padding and transistor-padding. We show that under the El-more delay model, capacitance-padding can be formulated as a linear programming problem and solved with great efficiency. Capacitance-padding can also be used as a post processing step for any non-zero-skew clock tree or mesh structure to achieve timing closure. Experiment results on several practical industry examples show that our algorithms are extremely efficient. Problems with over 6000 variables can be optimally tuned within 1 minute on a PC with 500 -MHZ Intel Pentium III processor.
Envision: a user-centered database of computer science literature
Authors: Lenwood S. Heath, Deborah Hix, Lucy T. Nowell, William C. Wake, Guillermo A. Averboch, Eric Labow, Scott A. Guyer, Dennis J. Brueni, Robert K. France, Kaushai Dalal, Edward A. Fox
Venue: Communications of the ACM (1995)

Project Envision is an early NSF-funded digital library effort to develop a multimedia collection of computer science literature with full-text searching and full-content retrieval capabilities. Envision was launched in 1991 in accordance with the ACM Publications Board's plans for encouraging research studies to develop an electronic archive for computer science.
Lossless Trace Compression
Authors: Eric E. Johnson, Jiheng Ha, M. Baqar Zaidi
Venue: IEEE Transactions on Computers (2001)

The tremendous storage space required for a useful data base of program traces has prompted a search for trace reduction techniques. In this paper, we discuss a range of information-lossless address and instruction trace compression schemes that can reduce both storage space and access time by an order of magnitude or more, without discarding either references or interreference timing information from the original trace. The PDATS family of trace compression techniques achieves trace coding densities of about six references per byte. This family of techniques is now in use as the standard in the NMSU TraceBase, an extensive trace archive that has been established for use by the international research and teaching community.
Exploiting interactivity, influence, space and time to explore non-linear drama in virtual worlds
Authors: Mike Craven, Ian Taylor, Adam Drozd, Jim Purbrick, Chris Greenhalgh, Steve Benford, Mike Fraser, John Bowers, Kai-Mikael Jää-Aro, Bernd Lintermann, Michael Hoch
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2001)

We present four contrasting interfaces to allow multiple viewers to explore 3D recordings of dramas in on-line virtual worlds. The first is an on-line promenade performance to an audience of avatars. The second is a form of immersive cinema, with multiple simultaneous viewpoints. The third is a tabletop projection surface that allows viewers to select detailed views from a bird's-eye overview. The fourth is a linear television broadcast created by a director or editor. A comparison of these examples shows how a viewing audience can exploit four general resources - interactivity, influence, space, and time - to make sense of complex, non-linear virtual drama. These resources provide interaction designers with a general framework for defining the relationship between the audience and the 3D content.
On rent's rule for rectangular regions
Authors: J. Dambre, P. Verplaetse, D. Stroobandt, J. Van Campenhout
Venue: Proceedings of the 2001 international workshop on System-level interconnect prediction (2001)

A priori wirelength estimates are based on a terminal-gate relationship known as Rent's rule. Conventional models apply Rent's rule in 2D on square or diamond-shaped regions. However, more advanced applications of wirelength estimation require the use of Rent's rule on layout regions with different shapes. In this paper, we systematically study the layout Rent parameters of rectangular regions in a 2D layout medium. For this purpose, we derive a theoretical model for the pin versus gate relationship for layout regions of any given shape. Using this model to find an estimation of the layout Rent parameters of rectangular regions with a given aspect ratio, we show that there is a significant dependency of the Rent coefficient on that aspect ratio. We experimentally verify these results with synthetic, as well as industrial benchmark circuits.Furthermore, our model relates the layout Rent parameters of a circuit to its intrinsic partitioning properties. This leads to a fundamental limit on the value of the layout Rent exponent for circuits, embedded in a 2D layout medium.
Hardware/software partitioning with integrated hardware design space exploration
Authors: V. Srinivasan, S. Radhakrishnan, R. Vemuri
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

This paper presents an integrated approach to hardware software partitioning and hardware design space exploration. We propose a genetic algorithm which performs hardware software partitioning on a task graph while simultaneously contemplating various design alternatives for tasks mapped to hardware. We primarily deal with data dominated designs typically found in digital signal processing and image processing applications. A detailed description of various genetic operators is presented. We provide results to illustrate the effectiveness of our integrated methodology.
Numerical mathematics and computer science
Authors: J. F. Traub
Venue: Communications of the ACM (1972)

Numerical mathematics is viewed as the analysis of continuous algorithms. Four of the components of numerical mathematics are discussed. These are: foundations (finite precision number systems, computational compexity), synthesis and analysis of algorithms, analysis of error, programs and program libraries.
Teaching advanced problem solving: implications for the CS curriculum
Authors: John Paxton, Brendan Mumey
Venue: Proceedings of the second annual CCSC on Computing in Small Colleges Northwestern conference (2000)

In this paper, we discuss our experiences with an advanced problem solving seminar and ACM programming contests. These are both activities that require teams of students to solve problems that are more challenging than those typically encountered in computer science courses. After presenting some effective and not-so-effective strategies in these environments, we conclude the paper by taking our observations and applying them to the computer science curriculum as a whole. By casting a spotlight on the curriculum from this more advanced setting, we are able to identify some weaknesses that must be addressed. Because our curriculum is a fairly typical one, we hope that his analysis might help other universities and colleges reflect upon their curricula as well.
Efficient computation of temporal aggregates with range predicates
Authors: Donhui Zhang, Alexander Markowetz, Vassilis Tsotras, Dimitrios Gunopulos, Bernhard Seeger
Venue: Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2001)

A temporal aggregation query is an important but costly operation for applications that maintain time-evolving data (data warehouses, temporal databases, etc.). Due to the large volume of such data, performance improvements for temporal aggregation queries are critical. In this paper we examine techniques to compute temporal aggregates that include key-range predicates (range temporal aggregates). In particular we concentrate on SUM, COUNT and AVG aggregates. This problem is novel; to handle arbitrary key ranges, previous methods would need to keep a separate index for every possible key range. We propose an approach based on a new index structure called the Multiversion SB-Tree, which incorporates features from both the SB-Tree and the Multiversion B-Tree, to handle arbitrary key-range temporal SUM, COUNT and AVG queries. We analyze the performance of our approach and present experimental results that show its efficiency.
Derived semantics for some programming language constructs
Authors: Peter Henderson
Venue: Communications of the ACM (1972)

The constructs of a simple programming language are introduced and described informally in terms of values and side-effects. A translator is defined which translates the language into flowcharts for a simple machine. The action of the machine in executing a flowchart is defined. A proof is constructed that the effect of translating and executing any program can be expressed solely in terms of the value and side-effect of the program. During the course of constructing the proof, formal definitions of the concepts of value and side-effect are derived in order to make the proof rigorous. Correctness of the implementation involves checking that the definitions derived in the step above are an acceptable formalization of the informal description given in the first step.
Residual-Minimizing Krylov Subspace Methods for Stabilized Discretizations of Convection-Diffusion Equations
Authors: Oliver G. Ernst
Venue: SIAM Journal on Matrix Analysis and Applications (2000)

We discuss the behavior of the minimal residual method applied to stabilized discretizations of one- and two-dimensional model problems for the stationary convection-diffusion equation. In the one-dimensional case, it is shown that eigenvalue information for estimating the convergence rate of the minimal residual method is highly misleading due to the strong nonnormality of these operators for large grid P&eacute;clet numbers. It is also shown that the field of values is a more reliable tool for assessing the convergence rate. In the two-dimensional model problems considered, we observe two distinct phases in the convergence of the iterative method: the first determined by the field of values and the second by the spectrum. We conjecture that the first phase lasts as long as the longest streamline takes to traverse the grid with the flow.
FRONTIER: fully enabling geometric constraints for feature-based modeling and assembly
Authors: Jianjun Oung, Meera Sitharam, Brandon Moro, Adam Arbree
Venue: Proceedings of the sixth ACM symposium on Solid modeling and applications (2001)

In the full paper [1], we discuss the functionality and implementation challenges of the Frontier geometric constraint engine, designed to address the main reasons for the underutilization of geometric constraints in today's 3D design and assembly systems. Here, we motivate the full paper by outlining the advantages of Frontier. Frontier fully enables both (a) the use of complex, cyclic, spatial constraint structures as well as (b) feature-based design. To deal with Issue (a), Frontier relies on the efficient generation of a close-to-optimal decomposition and recombination (DR) plan for completely general variational constraint systems (see Figure 1). A serious bouleneck in constraint solving is the exponential time dependence on the size of the largest system that is simultaneously solved by the algebraic-numeric solver. In most naturally occurring cases, Frontier's DR-plan is guaranteed in minimize this size (to within a small constant factor). To deal with Issue (b), Frontier's DR-plan admits the independent and local manipulation of features and sub-assemblies in one or more underlying feature hierarchies that are input (Figures 1 and 2). A DR-plan satisfying the above requirements is generated by the new Frontsier vertex Algorithm (FA): the DR problem and its significance as well as FA and its performance with respect to several relevant and newly formalized abstract measures are described in [2, 3]. Frontier employs a crucial representation of the DR-plan's subsystems or clusters, their hierarchy and their interaction This representation merges network flow information, as well as other geometric and combinatorial information in a natural manner. Some of this information is obtained from an efficient flow-based algorithm for detecting small rigid sub-systems presented in [4]. The clarity of this representation is crucial in the concrete realization of FA's formal performance. More significantly, this representation allows Frontier to take advantage of its DR-plan in surprising and unsuspected ways listed below.
Adaptive task resources allocation in multi-agent systems
Authors: S. Shaheen Fatima, Michael Wooldridge
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

In this paper, we present an adaptive organizational policy for multi-agent systems called \acro{trace}. \acro{trace} allows a collection of multi-agent organizations to dynamically allocate tasks and resources between themselves in order to efficiently process an incoming stream of task requests. \acro{trace} is intended to cope with environments in which tasks have time constraints, and environments that are subject to load variations. \acro{trace} is made up of two key elements: the task allocation protocol (\acro{tap}) and the resource allocation protocol (\acro{rap}). The \acro{tap} allows agents to cooperatively allocate their tasks to other agents with the capability and opportunity to successfully carry them out. As requests arrive arbitrarily, at any instant, some organizations could have surplus resources while others could become overloaded. In order to minimize the number of lost requests caused by an overload, the allocation of resources to organizations is changed dynamically by the resource allocation protocol (\acro{rap}), which uses ideas from computational market systems to allocate resources (in the form of problem solving agents) to organizations. We begin by formally defining the task allocation problem, and show that it is \acro{NP}-complete, and hence that centralized solutions to the problem are unlikely to be feasible. We then introduce the task and resource allocation protocols, focussing on the way in which resources are allocated by the \acro{rap}. We then present some experimental results, which show that \acro{trace} exhibits high performance despite unanticipated changes in the environment.
A chat room assignment for teaching network security
Authors: W. Garrett Mitchener, Amin Vahdat
Venue: ACM SIGCSE Bulletin (2001)

This paper describes a chat room application suitable for teaching basic network programming and security protocols. A client/server design illustrates the structure of current scalable network services while a multicast version demonstrates the need for efficient simultaneous distribution of network content to multiple receivers (e.g., as required by video broadcasts). The system also includes implementations of two security protocols, one similar to Kerberos and another based on public key encryption.
The pedagogical patterns project (poster session)
Authors: Helen Sharp, Mary Lynn Manns, Jutta Eckstein
Venue: Addendum to the 2000 proceedings of the conference on Object-oriented programming, systems, languages, and applications (Addendum) (2000)

The project, which started in 1996, aims to encourage the capture and dissemination of successful experience of learning and teaching OT from industry and academia. Today, a significant body of material exists. We welcome contributions from people with experiences to share, or whose own practice is reflected in existing material.
Complexity of Minimum Length Scheduling for Precedence Constrained Messages in Distributed Systems
Authors: Piera Barcaccia, Maurizio A. Bonuccelli, Miriam Di Ianni
Venue: IEEE Transactions on Parallel and Distributed Systems (2000)

Switching networks are the core of many communication and multiprocessor systems. In these systems, a set of entities (communication equipment or processors) communicate through the switching network by exchanging messages. Simultaneous transmission or reception of two or more different messages through an input or output port results in the corruption of the messages (also called collision), which are useless and must be retransmitted later. This causes a performance degradation. Collisions can be avoided only by a proper scheduling of the messages. The same problem also arises in single-hop purely optical WDM systems, where simultaneous reception or transmission over the same wavelength channel results in a collision. In this paper, we study the problem of minimum length scheduling of a set of messages subject to precedence constraints. We show that the decision version of the problem is NP-complete even in very restricted cases. This means that the optimization problem cannot be solved in polynomial time, unless P=NP. Since the problem cannot be optimally solved by fast algorithms, we then investigate the existence of polynomial time approximation algorithms, by first proving that approximation algorithms cannot exist with performance ratio bounded by $4/3$ or smaller and successively presenting an $\epsilon$-approximation algorithm with $\epsilon
Identifying potential to acquire programming skill
Authors: Lawrence J. Mazlack
Venue: Communications of the ACM (1980)

Over several years, a large number of students took the same introductory programming course. The students were drawn from all academic disciplines and academic experience levels. Low correlations were found between success in the course or its evaluation components when posed against academic program, gender, or semester in school. Additionally, when the IBM Programmer's Aptitude Test was administered, the predictive value of the test was found to be low.
1.34 Tflops molecular dynamics simulation for NaCl with a special-purpose computer: MDM
Authors: Tetsu Narumi, Ryutaro Susukita, Takahiro Koishi, Kenji Yasuoka, Hideaki Furusawa, Atsushi Kawai, Toshikazu Ebisuzaki
Venue: Proceedings of the 2000 ACM/IEEE conference on Supercomputing (CDROM) (2000)

We performed molecular dynamics (MD) simulation of 9 million pairs of NaCl ions with the Ewald summation and obtained a calculation speed of 1.34 Tflops. In this calculation we used a special-purpose computer, MDM, which we are developing for the calculations of the Coulomb and van der Waals forces. The MDM enabled us to perform large-scale MD simulations without truncating the Coulomb force. It is composed of WINE-2, MDGRAPE-2 and a host computer. WINE-2 accelerates the calculation for wavenumber-space part of the Coulomb force, while MDGRAPE-2 accelerates the calculation for real-space part of the Coulomb and van der Waals forces. The host computer performs other calculations. We performed MD simulation with the early version of the MDM system: 45 Tflops of WINE-2 and 1 Tflops of MDGRAPE-2. The peak performance of the final MDM system will reach 75 Tflops in total by the end of the year 2000.
A Fast Algorithm for Multiplicative Inversion in GF(2m) Using Normal Basis
Authors: Naofumi Takagi, Jun-ichi Yoshiki, Kazuyoshi Takagi
Venue: IEEE Transactions on Computers (2001)

A fast algorithm for multiplicative inversion in $GF(2^m)$ using normal basis is proposed. It is an improvement on those proposed by Itoh and Tsujii and by Chang et al., which are based on Fermat's Theorem and require $O(\log m)$ multiplications. The number of multiplications is reduced by decomposing $m-1$ into several factors and a small remainder.
Participating from the sidelines, online: facilitating telementoring projects
Authors: Judith B. Harris, Candace Figg
Venue: ACM Journal of Computer Documentation (JCD) (2000)

Asynchronous,text-based communication is different from most other forms of interchange in important ways.It lacks the full spectrum of visual and audible information that people depend upon,often unconsciously, in face-to-face exchanges.It also requires different interaction strategies ifit is to be used to create maximal educational benefit by and for students and teachers.These techniques can be modeled and made explicit by someone closely following online conversations in the role of facilitator, helping participants to construct online teaching/learning experiences in mutually beneficial ways.The Electronic Emissary s years of research have shown that the people best prepared to assist in these ways have experience in both online communication and pedagogy.The Emissary s facilitators provide individualized,just in time assistance to teachers,students,and subject matter experts during their telementoring exchanges.