ppxscal/embedding_network huggingface dataset:
Teaching client/server programming in the context of computing curricula 2001
Authors: Evelyn Stiller, Cathie LeBlanc
Venue: Proceedings of the sixth annual CCSC northeastern conference on The journal of computing in small colleges (2001)

This paper discusses a client/server programming course and its relationship to the knowledge units suggested by the draft proposal Computing Curricula 2001 [IEEE00]. First, the progression of concepts covered by this course is discussed. The course is then discussed in context of the overall motivation for curricular revision. Finally, the concepts of the course are related to the knowledge areas of Computing Curricula 2001. This client/server programming course also addresses societal needs. Since modern applications require computer professionals to conceptualize solutions built on multi-threaded and network-based programming constructs, educators have a duty to teach students material similar to that presented in this client/server programming course.
Beyond command knowledge: identifying and teaching strategic knowledge for using complex computer applications
Authors: Suresh K. Bhavnani, Frederick Reif, Bonnie E. John
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2001)

Despite experience, many users do not make efficient use of complex computer applications. We argue that this is caused by a lack of strategic knowledge that is difficult to acquire just by knowing how to use commands. To address this problem, we present efficient and general strategies for using computer applications, and identify the components of strategic knowledge required to use them. We propose a framework for teaching strategic knowledge, and show how we implemented it in a course for freshman students. In a controlled study, we compared our approach to the traditional approach of just teaching commands. The results show that efficient and general strategies can in fact be taught to students of diverse backgrounds in a limited time without harming command knowledge. The experiment also pinpointed those strategies that can be automatically learned just from learning commands, and those that require more practice than we provided. These results are important to universities and companies that wish to foster more efficient use of complex computer applications.
The evolution of the Sperry Univac 1100 series: a history, analysis, and projection
Authors: B. R. Borgerson, M. L. Hanson, P. A. Hartley
Venue: Communications of the ACM (1978)

The 1100 series systems are Sperry Univac's large-scale mainframe computer systems. Beginning with the 1107 in 1962, the 1100 series has progressed through a succession of eight compatible computer models to the latest system, the 1100/80, introduced in 1977. The 1100 series hardware architecture Is based on a 36-bit word, ones complement structure which obtains one operand from storage and one from a high-speed register, or two operands from high-speed registers. The 1100 Operating System is designed to support a symmetrical multiprocessor configuration simultaneously providing multiprogrammed batch, timesharing, and transaction environments.
Conventions for the use of symbols in the preparation of flowcharts for information processing systems
Authors: S. Gorn
Venue: Communications of the ACM (1965)

This paper is intended as an outline of the various conventions which are being considered for the use of flowchart symbols in the preparation of all types of flowcharts for information processing systems. The conventions are applied to the use of the symbols appearing in the proposed American Standard Flowchart Symbols for Information Processing Systems. This paper is concerned with the use of the proposed American Standard Flowchart Symbols and not with the symbols per se.
Lock-free reference counting
Authors: David L. Detlefs, Paul A. Martin, Mark Moir, Guy L. Steele,  Jr.
Venue: Proceedings of the twentieth annual ACM symposium on Principles of distributed computing (2001)

Assuming the existence of garbage collection makes it easier to design implementations of concurrent data structures. However, this assumption limits their applicability. We present a methodology that, for a significant class of data structures, allows designers to first tackle the easier problem of designing a garbage-collection-dependent implementation, and then apply our methodology to achieve a garbage-collection-independent one. Our methodology is based on the well-known reference counting technique, and employs the double compare-and-swap operation.
A Subsidy-Surplus Model and the Skorokhod Problem in an Orthant
Authors: S. Ramasubramanian
Venue: Mathematics of Operations Research (2000)

We consider the deterministic Skorokhod problem in an orthant of the formZw( t) =w( t) + ?b( u,Yw( u),Zw( u))du + ?R( u,Yw( u--);Zw( u--)) dYw( u) with ( Yw) i(Â·) nondecreasing, and ( Yw) i(Â·) not increasing while ( Zw) i(Â·)>0. This can be viewed as a subsidy-surplus model in an interdependent economy. Existence of a unique solution is established under fairly general conditions (viz. with R(Â·, Â·, Â·) satisfying a uniform spectral radius condition). Comparison result for (SP) vis-a-vis the usual partial order on the orthant is studied; we show that the more "inward looking" the reflection vectors and the drift, the larger the values ofYw will be but the values ofZw will be smaller. In addition to showing that the Leontief-type output is a feasible subsidy, connection between (SP) and "minimality" of feasible subsidies is discussed (consequently it is suggested that (SP) may be taken as a continuous time feedback-form analogue of open Leontief model).In the stochastic case, ( Y( t),Z( t)) turns out to be a strong Markov process ifw(Â·) arises from aLevy process. Relevance of the comparison result to recurrence/positive recurrence ofZ(Â·) process is pointed out.
On maintenance of the opportunity list for class-teacher timetable problems
Authors: Graham Smith
Venue: Communications of the ACM (1975)

One of the principal components of procedures for the solution of class-teacher timetable problems is that for maintenance of the opportunity list. Opportunity list maintenance methods are based on necessary conditions for the existence of a solution. A general framework for necessary conditions, together with four specific sets of necessary conditions, is given.
Hybrid global/local search strategies for dynamic voltage scaling in embedded multiprocessors
Authors: Neal K. Bambha, Shuvra S. Bhattacharyya, Jürgen Teich, Eckart Zitzler
Venue: Proceedings of the ninth international symposium on Hardware/software codesign (2001)

In this paper, we explore a hybrid global/local search optimization framework for dynamic voltage scaling in embedded multiprocessor systems. The problem is to find, for a multiprocessor system in which the processors are capable of dynamically varying their core voltages, the optimum voltage levels for all the tasks in order to minimize the average power consumption under a given performance constraint. An effective local search approach for static voltage scaling based on the concept of a period graph has been demonstrated in [1]. To make use of it in an optimization problem, the period graph must be integrated into a global search algorithm. Simulated heating, a general optimization framework developed in [19], is an efficient method for precisely this purpose of integrating local search into global search algorithms. However, little is known about the management of computational (compile-time) resources between global search and local search in hybrid algorithms, such as those coordinated by simulated heating. In this paper, we explore various hybrid search management strategies for power optimization under the framework of simulated heating. We demonstrate that careful search management leads to significant power consumption improvement over add-hoc global search / local search integration, and explore alternative approaches to performing hybrid search management for dynamic voltage scaling.
List processing in real time on a serial computer
Authors: Henry G. Baker,  Jr.
Venue: Communications of the ACM (1978)

A real-time list processing system is one in which the time required by the elementary list operations (e.g. CONS, CAR, CDR, RPLACA, RPLACD, EQ, and ATOM in LISP) is bounded by a (small) constant. Classical implementations of list processing systems lack this property because allocating a list cell from the heap may cause a garbage collection, which process requires time proportional to the heap size to finish. A real-time list processing system is presented which continuously reclaims garbage, including directed cycles, while linearizing and compacting the accessible cells into contiguous locations to avoid fragmenting the free storage pool. The program is small and requires no time-sharing interrupts, making it suitable for microcode. Finally, the system requires the same average time, and not more than twice the space, of a classical implementation, and those space requirements can be reduced to approximately classical proportions by compact list representation. Arrays of different sizes, a program stack, and hash linking are simple extensions to our system, and reference counting is found to be inferior for many applications.
Enumerations in statistical mechanics and combinatorics
Authors: Anthony Guttmann
Venue: Computing in Science and Engineering (2001)

Using polyomino enumeration and the self-avoiding walk problem as examples, the author shows how to produce enough terms of the generating function to enable soundly based conjectures about that function's analytic properties.
The effect of stem geometry on stresses within the distal cement mantle in total hip replacement
Authors: W. Schmölz, D. R. Gordon, A. J. Shields, D. Kirkwood, P. Grigoris
Venue: Technology and Health Care (2000)

Cement-stem debonding is one of the most common reasons for failure in Total Hip Replacement (THR). Four similar THR prostheses design configurations were investigated with reference to the influence of mechanical stress occurring in a cement mantle of differing thicknesses and potentially affecting clinical performance. Non-linear finite element analysis was performed on constant cement mantle thicknesses of 1, 2, and 4 millimetres. The results obtained indicate stress levels within the cement mantle decrease with increasing cement mantle thickness. The prosthesis distal tip is shown to have particular significance. Truncation of the distal tip hemisphere to a flat profile for the fixation of a centraliser increases the cement stresses.
Supporting presence in collaborative environments by haptic force feedback
Authors: Eva-Lotta Sallnäs, Kirsten Rassmus-Gröhn, Calle Sjöström
Venue: ACM Transactions on Computer-Human Interaction (TOCHI) (2000)

An experimental study of interaction in a collaborative desktop virtual environment is described. The aim of the experiment was to investigate if added haptic force feedback in such an environment affects perceived virtual presence, perceived social presence, perceived task performance, and task performance. A between-group design was employed, where seven pairs of subjects used an interface with graphic representation of the environment, audio connection, and haptic force feedback. Seven other pairs of subjects used an interface without haptic force feedback, but with identical features otherwise. The PHANToM, a one-point haptic device, was used for the haptic force feedback, and a program especially developed for the purpose provided the virtual environment. The program enables for two individuals placed in different locations to simultaneously feel and manipulate dynamic objects in a shared desktop virtual environment. Results show that haptic force feedback significantly improves task performance, perceived task performance, and pereceived virtual presence in the collaborative distributed environment. The results suggest that haptic force feedback increases perceived social presence, but the difference is not significant.
Processor frequency setting for energy minimization of streaming multimedia application
Authors: Andrea Acquaviva, Luca Benini, Bruno Riccò
Venue: Proceedings of the ninth international symposium on Hardware/software codesign (2001)

In this paper, we describe a software-controlled approach for adaptively minimizing energy in embedded systems for realtime multimedia processing. Energy is optimized by clock speed setting: the software controller dynamically adjusts processor clock speed to the frame rate requirements of the incoming multimedia stream. The speed-setting policy is based on a system model that correlates clock speed with best-case, average-case and worst-case sustainable frame rate, accounting for data-dependency in multimedia streams. Experiments on an MP3 decoding application show that computational energy can be drastically reduced with respect to fixed-frequency operation.
Undo any operation at any time in group editors
Authors: Chengzheng Sun
Venue: Proceedings of the 2000 ACM conference on Computer supported cooperative work (2000)

The ability to undo operations is an indispensable feature of real-time group editors, but supporting group undo is a difficult problem. None of the existing solutions for group undo is able to support undoing any operation at any time with guaranteed success. In this paper, we contribute a novel group undo solution with such a capability. The basic idea is to interpret an undo command as a concurrent inverse operation by means of operational transformation, so that an operation is always undoable regardless of its undo context. By separating undo policy from undo mechanism, multiple undo modes, such as single-step undo, chronological undo, and selective undo, can be supported in the same collaborative editing session. In addition, solutions to known undo puzzles are also provided. A web-based group text editor using the proposed undo solution has been implemented and is accessible at: http://reduce.qpsf.edu.au.
Breaking substitution ciphers using a relaxation algorithm
Authors: Shmuel Peleg, Azriel Rosenfeld
Venue: Communications of the ACM (1979)

Substitution ciphers are codes in which each letter of the alphabet has one fixed substitute, and the word divisions do not change. In this paper the problem of breaking substitution ciphers is represented as a probabilistic labeling problem. Every code letter is assigned probabilities of representing plaintext letters. These probabilities are updated in parallel for all code letters, using joint letter probabilities. Iterating the updating scheme results in improved estimates that finally lead to breaking the cipher. The method is applied successfully to two examples.
Management Strategies for Community Acquired Pneumonia
Authors: Memoona Hasnain, Edward J. Clark
Venue: Journal of Medical Systems (2000)

The past decade has witnessed dramatic changes in the etiology, diagnosis, and management of community acquired pneumonia (CAP). Due to the wide variation in practice patterns, physicians and professional societies have taken the lead in developing practice guidelines. To better understand the range of these multiple protocols, various stages of the disease and treatment are described and compared. Experts agree that CAP management should include: defining a correct diagnosis, identifying high risk populations in order to determine the severity of the disease, recommending appropriate treatment therapies, and obtaining positive and cost beneficial outcomes.
A presentation semantic model for asynchronous distance learning paradigm (poster session)
Authors: Sheng-Tun Li, Shu-Ching Cheng, Mei-Ling Shyu
Venue: Proceedings of the eighth ACM international conference on Multimedia (2000)

This paper presents a presentation semantic model that is based on the augmented transition network (ATN) for asynchronous distance learning system called Java-based Integrated Asynchronous Distance Learning (JIADL) system. The JIADL system can support diverse asynchronous distance learning services. Unlike most related work in the literature, we integrate RealPlayer and Java technology so that the superiority of both models can be complemented. A course sample is illustrated to validate the effectiveness of the paradigm proposed. How to use the proposed multimedia ATN model to model the diverse requirements of a distance learning multimedia presentation is also discussed. The multimedia ATN model is powerful in modeling the asynchronization for distance learning multimedia presentations. Furthermore, in addition to supporting asynchronous distance learning, our system can be applied to a wide range of potential value-added applications.
Univariate polynomials: nearly optimal algorithms for factorization and rootfinding
Authors: Victor Y. Pan
Venue: Proceedings of the 2001 international symposium on Symbolic and algebraic computation (2001)

To approximate all roots (zeros) of a univariate polynomial, we develop two effective algorithms and combine them in a single recursive process. One algorithm computes a basic well isolated zero-free annulus on the complex plane, whereas another algorithm numerically splits the input polynomial of the n-th degree into two factors balanced in the degrees and with the zero sets separated by the basic annulus. Recursive combination of the two algorithms leads to recursive computation of the complete numerical factorization of a polynomial into the product of linear factors and further to the approximation of the roots. The new rootfinder incorporates the earlier techniques of Sch&ouml;nhage and Kirrinnis and our old and new techniques and yields nearly optimal (up to polylogarithmic factors) arithmetic and Boolean cost estimates for the complexity of both complete factorization and rootfinding. The improvement over our previous record Boolean complexity estimates is by roughly the factor of n for complete factorization and also for the approximation of well-conditioned (well isolated) roots, whereas the same algorithm is also optimal (under both arithmetic and Boolean models of computing) for the worst case input polynomial, where the roots can be ill-conditioned, forming clusters. (The worst case bounds are supported by our previous algorithms as well.) Al our algorithms allow processor efficient acceleration to achieve solution in polygarithmic parallel time.
A parallel cosmological hydrodynamics code
Authors: Paul W. Bode, Guohong Xu, Renyue Cen
Venue: Proceedings of the 1996 ACM/IEEE conference on Supercomputing (CDROM) (1996)

Formation by gravitational collapse of galaxies and the large-scale structure of the universe is a nonlinear, multi-scale, multi-component problem. This complex process involves dynamics of the gaseous baryons as well as of the gravitationally dominant dark matter. We discuss an implementation of a parallel, distributed memory, cosmological hydrodynamics code using MPI message passing; it is based on the Total-Variation-Diminishing (Harten 1983) serial code of Ryu et al. (1993). This parallel code follows the motion 1983) serial code of Ryu et al. (1993). This parallel code follows the motion of gas and dark matter simultaneously, combining a mesh based Eulerian hydrodynamics code and a Particle-Mesh N-body code. A new, flexible matrix transpose algorithm is used to interchange distributed and local dimensions of the mesh. Timing results from runs on an IBM SP2 supercomputer are given.
FLOWTRACE, a computer program for flowcharting programs
Authors: Philip M. Sherman
Venue: Communications of the ACM (1966)

The FLOWTRACE system produces flowcharts of programs written in &ldquo;almost any&rdquo; programming language. One must describe the syntax of the control statements in his language; for this purpose a metalanguage is available. The resultant object deck is used to flowchart any programs in the language described. Several examples of FAP and SNOBOL flowcharts are given. However, it is not necessary to confine one's scope to existing languages. One may define his own language in any &ldquo;well-structured&rdquo; manner. This feature is particularly useful when it is desirable to chart only comments within a program. Such an approach permits the documentation of descriptive remarks and avoids the inclusion of coding details.
Fault-perserving simplifying transformations for security protocols
Authors: Mei Lin Hui, Gavin Lowe
Venue: Journal of Computer Security (2001)

Recent techniques for analyzing security protocols have tended to concentrate upon the small protocols that are typically found in the academic literature. However, there is a huge gulf between these and most large commercial protocols: the latter typically have many more fields, and much higher levels of nested encryption. As a result, existing techniques are difficult to apply directly to these large protocols. In this paper we develop the notion of fault-preserving simplifying transformations: transformations that have the property of preserving insecurities; the effect of such transformations is that if we can verify the transformed protocol, then we will have verified the original protocol. We identify a number of such fault-preserving simplifying transformations, and use them in the analysis of a commercial protocol.
Smart rebinning for compression of concentric mosaics
Authors: Yunnan Wu, Cha Zhang, Jin Li, Jizheng Xu
Venue: Proceedings of the eighth ACM international conference on Multimedia (2000)

Concentric mosaics offer a quick solution to construct a virtual copy of a real environment, and navigate in the virtual environment. However, the huge amount of data associated with concentric mosaics is a heavy burden for its application. A 3D wavelet transform-based compressor has been proposed in previous work to compress the concentric mosaics. In this paper, we greatly improve the performance of the 3D wavelet coder with a data rearrangement mechanism called &ldquo;smart rebinning&rdquo;. The proposed scheme first aligns the concentric mosaic image shots along the horizontal direction and then rebins the shots into multi-perspective panoramas. Smart rebinning greatly improves the cross shot correlation and enables the coder to better explore the redundancy among shots. Experimental results show that the performance of the 3D wavelet coder improves an average of 4.3dB with the use of smart rebinning. The proposed coder outperforms MPEG-2 coding of concentric mosaics by an average of 3.7dB.
An XML model for small business e-commerce
Authors: Jim Sims, Rahul Tikekar
Venue: Proceedings of the fourteenth annual consortium on Small Colleges Southeastern conference (2000)

This paper proposes a model based on the eXtensible Markup Language (XML) for small businesses e-commerce. The ideas behind this paper grew from the authors' and other Southern Oregon University students' experiences working with lesser-funded, technically unsophisticated small businesses wishing to jump onto the e-commerce bandwagon. The model stems from an observed fundamental disconnect between the needs of companies who come to small colleges for advice and talent in e-commerce ventures and the solutions small college students are typically trained to deploy. Small businesses (for our purposes, businesses with no Information Technology staff) typically seek an e-commerce solution that requires no investment in infrastructure (no dedicated RDBMS server, no T1 line) and no increase in staffing (no Oracle DBA or Unix system administrator.) Yet, these are precisely the e-commerce solutions most small college graduates feel confident deploying. Our XML model promises to act as a kind of poor man's web enabled database, enabling small businesses to automate web content revision, order processing and fulfillment, and credit card charge verification without disconnecting themselves from the Internet or letting go of the dream of new revenue generated by low cost, digital solutions.