ppxscal/embedding_network huggingface dataset:
Mapping UML designs to Java
Authors: William Harrison, Charles Barton, Mukund Raghavachari
Venue: Proceedings of the 15th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications (2000)

Tools for the generation of code from model descriptions are valuable in helping developers maintain consistency between a model and its implementation. In this paper, we describe a new method for generating Java implementation code from UML diagrams. Our method accepts UML diagrams specified at a higher-level than current tools, and places fewer constraints on the supported UML constructs, like multiple generalizations and association classes. Unlike current tools, it generates implementation code that shields system implementers from the low-level details of how associations and other UML constructs are mapped to Java. Furthermore, it supports the modular design of systems according to concerns[2, 10] by being able to generate code from a set of related UML diagrams. While our discussion is focused on the special problem of generating Java implementation code, the issues discussed in this paper are applicable more generally to object-oriented implementation languages.
Interference between communicating parallel processes
Authors: Philip Gilbert, W. J. Chandler
Venue: Communications of the ACM (1972)

Various kinds of interference between communicating parallel processes have been examined by Dijkstra, Knuth, and others. Solutions have been given for the mutual exclusion problem and associated subproblems, in the form of parallel programs, and informal proofs of correctness have been given for these solutions. In this paper a system of parallel processes is regarded as a machine which proceeds from one state S (i.e. a collection of pertinent data values and process configurations) to a next state S&prime; in accordance with a transition rule S &rArr; S&prime;. A set of such rules yields sequences of states, which dictate the system's behavior. The mutual exclusion problem and the associated subproblems are formulated as questions of inclusion between sets of states, or of the existence of certain sequences. A mechanical proof procedure is shown, which will either verify (prove the correctness of) or discredit (prove the incorrectness of) an attempted solution, with respect to any of the interference properties. It is shown how to calculate transition rules from the &ldquo;partial rules&rdquo; by which the individual processes operate. The formation of partial rules and the calculation of transition rules are both applicable to hardware processes as well as to software processes, and symmetry between processes is not required.
Glossaries for computing and data processing
Authors: Mandalay Grems
Venue: Communications of the ACM (1961)

At the present time, there is considerable interest and activity in the preparation of a comprehensive glossary of computing and data processing terms. This interest is generated by members of the various national and international professional associations, the computer manufacturers, and the American Standards Association.
Analyzing blood cell image to distinguish its abnormalities (poster session)
Authors: K. S. Kim, P. K. Kim J. J. Song, Y. C. Park
Venue: Proceedings of the eighth ACM international conference on Multimedia (2000)

In this paper, we show the blood-cell image classification system to be able to analyze and distinguish blood cells in the peripheral blood image. To distinguish their abnormalities, we segment red and white-blood cell in an image acquired from microscope with CCD camera and then, apply the various feature extraction algorithms to classify them. In addition to, we use neural network model to reduce multi-variate feature number based on PCA(Principal Component Analysis) to make classifier more efficient. Finally we show that our system has a good experimental result and can be applied to build an aiding system for pathologist.
Comments on program specification and testing
Authors: Roger House
Venue: Communications of the ACM (1980)

The data processing discipline is in a deplorable state, says Roger House. The author reviews an earlier study, in which programmers were largely unsuccessful in finding known errors in a test program. House shows that the fault lies not with the subjects but with the generally poor procedures underlying the writing of much contemporary software, including the test program in question. He analyzes the example, offers several specific critiques, and enumerates good software-writing practices.
Partitioning Rectangular and Structurally Unsymmetric Sparse Matrices for Parallel Processing
Authors: Bruce Hendrickson, Tamara G. Kolda
Venue: SIAM Journal on Scientific Computing (1999)

A common operation in scientific computing is the multiplication of a sparse, rectangular, or structurally unsymmetric matrix and a vector. In many applications the matrix-transpose-vector product is also required. This paper addresses the efficient parallelization of these operations. We show that the problem can be expressed in terms of partitioning bipartite graphs. We then introduce several algorithms for this partitioning problem and compare their performance on a set of test matrices.
Creative pedagogy for computer learning: eight effective tactics
Authors: M. Khalid Hamza, Bassem Alhalabi, David M. Marcovitz
Venue: ACM SIGCSE Bulletin (2000)

Do your students seem uninterested in learning about computing? Do they complain that the subject matter has no relevant application to the "real world"? Do they appear baffled, bored, and inattentive? Your mission as a creative facilitator is not to assign a grade; your mission is to educate students to think, learn, and make new connections they never thought possible. A teacher's guidance, constructive feedback, and facilitated instruction should pave the way for students to meaningfully bridge prior knowledge with new knowledge. In this article, the authors suggest eight essential tactics on how teachers might teach creatively, particularly with respect to computing curricula, while they enjoy the teaching and learning processes and reap the pleasures of getting students to think creatively and productively in a complex information world.
Hybrid computation
Authors: Jean Della Dora, Aude Maignan, Mihaela Mirica-Ruse, Sergio Yovine
Venue: Proceedings of the 2001 international symposium on Symbolic and algebraic computation (2001)

The goal of this paper is twofold: first a rapid introduction to the concept of hybrid system and second the presentation of a new direction in computer algebra that we have called hybrid computation. Hybrid computation can be seen as the application of the philosophy of hybrid system to the field of computation. We have focused our presentation on four directions that are actually developped in the MASH (Mod&eacute;lisation Alg&eacute;brique et Syst&egrave;mes Hybrides) project:Integration of ODE, Dynamic hybrid systems, Generalized splines and Optimal control [5].
Slicing floorplan with clustering constraints
Authors: Wing Seung Yuen, Fung Yu Young
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

In floorplan design it is useful to allow users to specify placement constraints in the final packing. Clustering constraint is one kind of placement constraint in which a given set of modules are restricted to be geometrically adjacent to one another. The wiring cost can be reduced by putting modules with a lot of connections closely together. Designers may also need this type of placement constraint to pack the modules according to their functionality. In this paper, a method addressing clustering constraint in slicing floorplan is presented. A linear time algorithm is deviced to locate neighboring modules in a normalized Polish expression and re-arrange the modules in order to satisfy the constraints. Experiments were performed on some benchmarks and the results are promising.
A note on the confinement problem
Authors: Butler W. Lampson
Venue: Communications of the ACM (1973)

onfining a program during its execution so that it cannot transmit information to any other program except its caller. A set of examples attempts to stake out the boundaries of the problem. Necessary conditions for a solution are stated and informally justified.
Probabilistic data flow system with two-edge profiling
Authors: Eduard Mehofer, Bernhard Scholz
Venue: ACM SIGPLAN Notices (2000)

Traditionally optimization is done statistically independent of actual execution environments. For generating highly optimized code, however, runtime information can be used to adapt a program to different environments. In probabilistic data flow systems runtime information on representative input data is exploited to compute the probability with what data flow facts may hold. Probabilistic data flow analysis can guide sophisticated optimizing transformations resulting in better performance. In comparison classical data flow analysis does not take runtime information into account. All paths are equally weighted irrespectively whether they are never, heavily, or rarely executed. In this paper we present the best solution what we can theoretically obtain for probabilistic data flow problems and compare it with the state-of-the-art one-edge approach. We show that the differences can be considerable and improvements are crucial. However, the theoretically best solution is too expensive in general and feasible approaches are required. In the sequel we develop an efficient approach which employs two-edge profiling and classical data flow analysis. We show that the results of the two-edge approach are significantly better than the state-of-the-art one-edge approach.
A cell organized raster display for line drawings
Authors: B. W. Jordan, R. C. Barrett
Venue: Communications of the ACM (1974)

Raster scan computer graphics displays with &ldquo;real time&rdquo; character generators have previously been limited to alphanumeric characters. A display is described which extends the capabilities of this organization to include general graphics. The feasibility of such a display is shown by deriving the minimum number of patterns required in the read only memory of the character generator to synthesize an arbitrary line. The synthesis process does not compromise picture quality, since the resulting dot patterns are identical with those of a conventional raster display. Furthermore, the time constraints of a raster display are shown to be satisfied for a typical design for very complex line drawings.
Application of linearly transformed BDDs in sequential verification
Authors: Wolfgang Günther, Andreas Hett, Bernd Becker
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

The computation of the set of reachable states is the key problem of many applications in sequential verification. Binary Decision Diagrams (BDDs) are extensively used in this domain, but tend to blow up for larger instances. To increase the computational power of BDDs, linearly transformed BDDS (LTBDDs) have been proposed. In this paper we show how this concept can be incorporated into the sequential verification domain by restricting dynamic reordering in a way that the relational product can still be carried out efficiently. Experimental results are given to show the efficiency of our approach.
Response to the Federal Trade Commission's proposed ruling on standards and certification
Authors: John A. N. Lee
Venue: Communications of the ACM (1981)

In December 1978, the Federal Trade Commission issued a notice of intention of rulemaking in regard to the matter of Standards and Certification. In cooperation with the American National Standards Institute, of which ACM is a member, the ACM Standards Committee prepared a response to that notice and submitted it to the Commission in April 1979. The response gives a summary of the ACM Standards Committee position on a standards regulation and affords insights into the process by which procedures evolve in this area. For this reason, the response is reproduced here as a report.
Provision of market services for eCo compliant electronic marketplaces
Authors: Sena Arpinar, Asuman Dogac
Venue: ACM SIGMOD Record (2000)

The progress and wider dissemination of electronic commerce will be facilitated through interoperability infrastructures. Commerce Net's eCo framework is a promising effort in this direction. In the eCo framework, businesses participate in a marketplace through standard interfaces for their services and by exchanging standardized documents. This framework does not specify any further interfaces for the services a marketplace itself may offer.In this paper, we demonstrate that a rich set of marketplace-specific services such as automated discovery of the needed services, comparison shopping, and negotiation can be offered to market participants by introducing a marketplace as an eCo business. For this purpose, a previously developed marketplace, namely MOPPET, is made eCo-compliant. We demonstrate that introducing MOPPET as an eCo business increases the functionality of the eCo market in the sense that several market specific services become available to the market participants.
Extracting structural information using time-frequency analysis of protein NMR data
Authors: Christopher James Langmead, Bruce Randall Donald
Venue: Proceedings of the fifth annual international conference on Computational biology (2001)

High-throughput, data-directed computational protocols for Structural Genomics (or Proteomics) are required in order to evaluate the protein products of genes for structure and function at rates comparable to current gene-sequencing technology. To develop such methods, new algorithms are required that can quickly extract significantly more structural information from sparse experimental data. This paper presents a new class of signal processing algorithms for nuclear magnetic resonance (NMR) structural biology, based on time-frequency analysis of chemical shift dynamics. A novel approach to multidimensional NMR analysis is proposed in which the data are interpreted in the time-frequency domain, as opposed to the traditional frequency domain. Time-frequency analysis (TFA) exposes behavior orthogonal to the magnetic coherence transfer pathways, thus affording new avenues of NMR discovery. An implementation yielding new biophysical results is discussed. In particular, we demonstrate the heretofore unknown presence of through-space inter-atomic distance information within 15N-edited heteronuclear single-quantum coherence(15N HSQC) data. A biophysical model explains these results, and is supported by further experiments on simulated spectra.
Dynamic adaptive pre-tenuring
Authors: Timothy L. Harris
Venue: Proceedings of the 2nd international symposium on Memory management (2000)

In a generational garbage collector, a pre-tenured object is one that is allocated directly in the old generation. Pre-tenuring long-lived objects reduces the number of times that they are scanned or copied during garbage collection. Previous work has investigated pre-tenuring based on off-line analysis of execution traces. This paper builds on that work by presenting a dynamic technique in which the decision to pre-tenure a particular kind of object is taken at run-time. This allows decisions to depend on the inputs of a particular application run and also allows decisions to be changed as the application enters different phases. An implementation is presented for the Research VM Java Virtual Machine.
Separation of Transparent Layers using Focus
Authors: Yoav Y. Schechner, Nahum Kiryati, Ronen Basri
Venue: International Journal of Computer Vision (2000)

Consider situations where the depth at each point in the scene is multi-valued, due to the presence of a virtual image semi-reflected by a transparent surface. The semi-reflected image is linearly superimposed on the image of an object that is behind the transparent surface. A novel approach is proposed for the separation of the superimposed layers. Focusing on either of the layers yields initial separation, but crosstalk remains. The separation is enhanced by mutual blurring of the perturbing components in the images. However, this blurring requires the estimation of the defocus blur kernels. We thus propose a method for self calibration of the blur kernels, given the raw images. The kernels are sought to minimize the mutual information of the recovered layers. Autofocusing and depth estimation in the presence of semi-reflections are also considered. Experimental results are presented.
Comment on Brent's scatter storage algorithm
Authors: Jerome A. Feldman, James R. Low
Venue: Communications of the ACM (1973)

R.P. Brent in his presentation of a modification to the linear quotient algorithm [1] shares the common misconception that dynamic chaining requires larger table entries because of the space required for link fields.
MINI-EXEC: a portable executive for 8-bit microcomputers
Authors: Thomas L. Wicklund
Venue: Communications of the ACM (1982)

As microprocessor systems and single-chip microcomputers become more complex, so do the software systems developed for them. In many cases, software is being designed that incorporates multiple control functions running asynchronously on a single microprocessor. Here, discussion focuses on the motivation for running such multiple functions under the control of a real-time multitasking executive. A successfully implemented executive whose design is portable and suitable for use on most 8-bit microprocessors is presented.
Debian Package Management, Part 1: A User's Guide
Authors: David Blackman
Venue: Linux Journal (2000)

A how-to for Debian package management.
Approximately covering by cycles in planar graphs
Authors: Dieter Rautenbach, Bruce Reed
Venue: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms (2001)

Let G = (V(G), E(G)) be a graph and let C be the collection of its cycles. Let p: E(G) &rarrtl; Z+&Ogr;? be a non-negative, integer-valued function on its edge set. The CYCLE COVER PROBLEM is the optimization problem of finding a multiset a of cycles of G such that each edge e &isin; E is in at least p(e) of the cycles in a and such that the sum of the lengths of all cycles in a is minimum. We will show how to approximate within a factor of 8 the optimum value of the cycle cover problem for planar graphs in polynomial time.
Location based services in a wireless WAN using cellular digital packet data (CDPD)
Authors: Rittwik Jana, Theodore Johnson, S. Muthukrishnan, Andrea Vitaletti
Venue: Proceedings of the 2nd ACM international workshop on Data engineering for wireless and mobile access (2001)

This paper shows how a standard mobile data technology, Cellular Digital Packet Data (CDPD), can be used to localize mobile data users, and provide location based services. We present a location determination system that is handset-based. Using CDPD and modem protocols, this system extracts the location of the users up to the cell site coverage in the network; it also exposes this location information to the application layer. We have implemented a prototype of the entire system; it works nationwide with mobile laptop and Pocket PC users. The system is adequate for providing personalized location based service such as finding close businesses of interest, or business services such as tracking and fleet management, or traffic and re-routing applications, among others.
Automated testing of databases and spreadsheets - the long and the short of it
Authors: C. Simon, Peter Summons
Venue: Proceedings of the Australasian conference on Computing education (2000)

Our introductory Information System subjects include the teaching and assessment of skills in word processing, spreadsheets, and databases. Having made pleasing progress with the automated generation and marking of the spreadsheet tests, we found that our move to automate the database testing highlighted some important distinctions between the two. In essence, spreadsheet testing is comparable to short-answer test and database to long-answer test, which require a markedly different approach.
Nonsymmetric Values of Nonatomic and Mixed Games
Authors: Ori Haimanko
Venue: Mathematics of Operations Research (2000)

This paper presents a new unifying approach to the study of nonsymmetric (or quasi-) values of nonatomic and mixed games. A family ofpath values is defined, using an appropriate generalization of Mertens diagonal formula. A path value possesses the following intuitive description: consider a function (path)? attaching to each player a distribution function on [0, 1]. We think of players as arriving randomly and independently to a meeting when the arrival time of a player is distributed according to?. Each player's payoff is defined as his marginal contribution to the coalition of players that have arrived earlier.Under certain conditions on a path, different subspaces of mixed games ( pNA, pM, bv'FL) are shown to be in the domain of the path value. The family of path values turns out to be very wide--we show that onpNA, pM and their subspaces the path values are essentially the basic construction blocks (extreme points) of quasi-values.
Total System Energy Minimization for Wireless Image Transmission
Authors: Swaroop Appadwedula, Manish Goel, Naresh R. Shanbhag, Douglas L. Jones, Kannan Ramchandran
Venue: Journal of VLSI Signal Processing Systems (2001)

In this paper, we focus on the total-system-energy minimization of a wireless image transmission system including both digital and analog components. Traditionally, digital power consumption has been ignored in system design, since transmit power has been the most significant component. However, as we move to an era of pico-cell environments and as more complex signal processing algorithms are being used at higher data rates, the digital power consumption of these systems becomes an issue. We present an energy-optimized image transmission system for indoor wireless applications which exploits the variabilities in the image data and the wireless multipath channel by employing dynamic algorithm transformations and joint source-channel coding. The variability in the image data is characterized by the rate-distortion curve, and the variability in the channel characteristics is characterized by the path-loss and impulse response of the channel. The system hardware configuration space is characterized by the error-correction capability of the channel encoder/decoder, number of powered-up fingers in the RAKE receiver, and transmit power of the power amplifier. An optimization algorithm is utilized to obtain energy-optimal configurations subject to end-to-end performance constraints. The proposed design is tested over QCIF images, IMT-2000 channels and 0.18&mu;m, 2.5 V CMOS technology parameters. Simulation results over various images, various distances, two different channels, and two different rates show that the average energy savings in utilizing a total-system-energy minimization over a fixed system (designed for the worst image, the worst channel and the maximum distance) are 53.6% and 67.3%, respectively, for short-range (under 20 m) and long-range (over 20 m) systems.
Alternatives for Dynamic Web Development Projects
Authors: Dennis Gesker
Venue: Linux Journal (2001)

Dennis provides a starting point for developers seeking solutions for their web application development requirements.
Monte Carlo arithmetic: how to gamble with floating point and win
Authors: D. Stott Parker, Brad Pierce, Paul R. Eggert
Venue: Computing in Science and Engineering (2000)

How sensitive to rounding errors are the results generated from a particular code running on a particular machine applied to a particular input? Monte Carlo arithmetic illustrates the potential for tools to support new kinds of a posteriori round-off error analysis.