ppxscal/embedding_network huggingface dataset:
An Inexact Hybrid Generalized Proximal Point Algorithm and Some New Results on the Theory of Bregman Functions
Authors: M. V. Solodov, B. F. Svaiter
Venue: Mathematics of Operations Research (2000)

We present a new Bregman-function-based algorithm which is a modification of the generalized proximal point method for solving the variational inequality problem with a maximal monotone operator. The principal advantage of the presented algorithm is that it allows a more constructive error tolerance criterion in solving the proximal point subproblems. Furthermore, we eliminate the assumption of pseudomonotonicity which was, until now, standard in proving convergence for paramonotone operators. Thus we obtain a convergence result which is new even for exact generalized proximal point methods. Finally, we present some new results on the theory of Bregman functions. For example, we show that the standard assumption of convergence consistency is a consequence of the other properties of Bregman functions, and is therefore superfluous.
Watermarking at point of origin
Authors: Andrew Z. Tirkel, Tom E. Hall
Venue: Proceedings of the 2000 ACM workshops on Multimedia (2000)

We describe a proposed scheme for watermarking images or video at the camera. This addresses the issue of image security between the point of origin and the point of distribution. The scheme is expected to find application in the security industry, where proof of tampering is important and in commercial photography, where breach of copyright is important.
Management science: a view from nonlinear programming
Authors: David F. Shanno, Roman L. Weil
Venue: Communications of the ACM (1972)

A brief history of integer and continuous nonlinear programming is presented as well as the current obstacles to practical use of these mathematical programming techniques. It is forecast that the useful contributions to nonlinear programming actually made in the next few years are more likely to be consolidations than theoretical breakthroughs. These contributions are likely to be the documentation of standard test problems, construction of user oriented software, and comparisons of currently known algorithms to demonstrate which techniques are best for specific problems.
A comparative evaluation of versions of BASIC
Authors: Bennet P. Lientz
Venue: Communications of the ACM (1976)

From its inception, The BASIC language has grown in terms of its usage, scope of usage, and its features. This article compares ten of the current versions of BASIC with each other, with two earlier versions, and with the proposed standard for minimal BASIC. The comparison is arranged by the features of the versions and by computational comparison of computation and times and processing costs.
A distributed mechanism for power saving in IEEE 802.11 wireless LANs
Authors: Luciano Bononi, Marco Conti, Lorenzo Donatiello
Venue: Mobile Networks and Applications (2001)

The finite battery power of mobile computers represents one of the greatest limitations to the utility of portable computers. Furthermore, portable computers often need to perform power consuming activities, such as transmitting and receiving data by means of a random-access, wireless channel. The amount of power consumed to transfer the data on the wireless channel os negatively affected by the channel congestion level, and significantly depends on the MAC protocol adopted. This paper illustrates the design and the performance evaluation of a new mechanism that, by controlling the accesses to the shared transmission channel of a wireless LAN, leads each station to an optimal Power Consumption level. Specifically, we considered the Standard IEEE 802.11 Distributed Coordination Function (DCF) access scheme for WLANS. For this protocol we analytically derived the optimal average Power Consumption levels required for a frame transmission. By exploiting these analytical results, we define a Power Save, Distributed Contention Control (PS-DCC) mechanism that can be adopted to enhance the performance of the Standard IEEE 802.11 DCF protocol from a power saving standpoint. The performance of an IEEE 802.11 network enhanced with the PS-DCC mechanism has been investigated by simulation. Results show that the enhanced protocol closely approximates the optimal power consumption level, and provides a channel utilization close to the theoretical upper bound for the IEEE 802.11 protocol capacity. In addition, even in low load situations, the enhanced protocol does not introduce additional overheads with respect to the standard protocol.
X.400 MHS: first steps towards an EDI communication standard
Authors: Guy Genilloud
Venue: ACM SIGCOMM Computer Communication Review (1990)

Electronic Data Interchange (EDI) is an increasingly important application of computer communications. Until recently, EDI has developed independently of the communications technology and related standards. EDI users coped with this situation by setting up bilateral communications agreements or by using the services of Value Added Data Services centres, which provided protocol conversion. The introduction of X.400 MHS based systems and services is slowly modifying the general attitude towards EDI communications. For the first time, a CCITT rapporteur group is drafting a recommendation for EDI communications within the context of X.400 MHS. More importantly, there already exist official guidelines, both in the U.S.A. and in Europe, which explain how to take advantage of X.400 MHS systems today.The purpose of this paper is to comment upon these first approaches to an EDI communication standard. For this reason, and because we expect only a few readers to be familiar with both EDI and X.400 MHS, we begin with introductions to both subjects.
Exclusion for composite objects
Authors: James Noble, David Holmes, John Potter
Venue: Proceedings of the 15th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications (2000)

Designing concurrent object-oriented programs is hard. Correct programs must coordinate multiple threads accessing composite objects, using low-level mechanisms such as locks and read-write sets. Efficient programs must balance the complexity and overhead of the coordination mechanisms against the increased performance possible through concurrency. A method-level algebra of exclusion provides a succinct description of the conditions under which a thread must be excluded from a component of a composite object. Using the algebra, programmers can check whether their programs meet their exclusion requirements, can eliminate redundant exclusion controls, and can remove synchronisation overhead by reducing concurrency.
Limited bit manipulation using FORTRAN II
Authors: C. A. Oster
Venue: Communications of the ACM (1964)

Techniques are developed for manipulating bits using only FORTRAN II. These techniques allow individual bits to be tested, certain fields to be shifted, and numbers coded in BCD to be converted to Binary.
Recommendations for master's level programs in computer science: a report of the ACM curriculum committee on computer science
Authors: Kenneth I. Magel, Richard H. Austing, Alfs Berztiss, Gerald L. Engel, John W. Hamblen, A. A.J. Hoffmann, Robert Mathis
Venue: Communications of the ACM (1981)

The ACM Committee on Curriculum in Computer Science has spent two years investigating master's degree programs in Computer Science. This report contains the conclusions of that effort. Recommendations are made concerning the form, entrance requirements, possible courses, staffing levels, intent, library resources, and computing resources required for an academic, professional, or specialized master's degree. These recommendations specify minimum requirements which should be met by any master's programs. The Committee believes that the details of a particular master's program should be determined and continually updated by the faculty involved. A single or a small number of model programs are not as appropriate at the graduate level as at the bachelor's level.
Management of Performance Requirements for Information Systems
Authors: Brian A. Nixon
Venue: IEEE Transactions on Software Engineering (2000)

Management of performance requirements is a major challenge for information systems as well as other software systems. This is because performance requirements (e.g., ¿a student records system should have good response time for registering students¿) can have a global impact on the target system. In addition, there are interactions and trade-offs among performance requirements, other nonfunctional requirements (NFRs, or software quality attributes, e.g., accuracy), and the numerous alternatives for the target system. To provide a systematic approach to managing performance requirements, this paper presents a ¿Performance Requirements Framework¿ (PeRF). It integrates and catalogues a variety of kinds of knowledge of information systems and performance. These include performance concepts, Software Performance Engineering (SPE) principles for ¿building performance into¿ systems, and information systems development knowledge (including requirements, design, implementation, and performance). In addition, layered structures organize performance knowledge and the development process. All this knowledge is represented using an existing goal-oriented approach, the ¿NFR Framework,¿ which offers a developer-directed graphical treatment for stating NFRs, analyzing and interrelating them, and determining the impact of decisions upon NFRs. This approach allows customized solutions to be built, taking into account the characteristics of the particular domain. The use of PeRF in managing performance requirements is illustrated in a study of performance requirements and other NFRs for a university's student records system. This paper concludes with a summary of other studies of information systems, tool support, and directions for future work.
Compiling fixed-point multiplications
Authors: Herbert J. Bernstein
Venue: Communications of the ACM (1972)

With reference to the article by H. T. Gladwin [1], (Comm.) it should be noted that the technique described is a limited subset of techniques known for many years, particularly to programmers for machines lacking an integer multiply instruction, CDC 6000 PPU's for example. It is easier to present and implement more generally applicable techniques, such as full decomposition into &ldquo;runs&rdquo; of 0's and 1's to yield representation as: &sum;Li=0(2m(i) - 2n(i)) which may be further compressed by replacing such terms as -2m+1 + 2m by -2m. In decomposing numbers from the right on a CDC 6000 in particular, special techniques are possible [2]. Finally, Gladwin failed to credit the CDC RUN compilers, in use for over six years on the very machines he discussed, for doing a large number of constant multiplies by shifts and adds (subroutine SHM in overlay RUN1).
Internet packet filter management and rectangle geometry
Authors: David Eppstein, S. Muthukrishnan
Venue: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms (2001)

We consider rule sets for internet packet routing and filtering, where each rule consists of a range of source addresses, a range of destination addresses, a priority, and an action. A given packet should be handled by the action from the maximum priority rule that matches its source and destination. We describe new data structures for quickly finding the rule matching an incoming packet, in near-linear space, and a new algorithm for determining whether a rule set contains any conflicts, in time &Ogr;(n3/2).
Assessing the ripple effect of CS1 language choice
Authors: Adair Dingle, Carol Zander
Venue: Proceedings of the second annual CCSC on Computing in Small Colleges Northwestern conference (2000)

Java has reinvigorated the debate on the `best' language to use for CS1. Much of the controversy centers on the goals of CS1, specific language constructs that either hinder or support the first formal introduction to programming, and, even, `real-world' relevance. Missing from typical discussions is the effect of the language choice in CS1 on CS2 and subsequent courses in the CS curriculum. In all such dialogues, it is important to note the characteristics of the department at hand. While many programs can afford to choose a language (such as Scheme) purely for pedagogical reasons, others (if not most), due to pressure from students, industry, advisory boards, select a language with some market appeal. Small departments that serve students who expect an immediate transition to a professional job typically choose a traditional procedural language like C, Pascal, Modula-2, or a popular OO language like C++, Java, Ada95, or Visual Basic. Hence, we focus here on the choice of one of these languages, and the resulting effects on students' progression in the CS curriculum.
FieldWise: a mobile knowledge management architecture
Authors: Henrik Fagrell, Kerstin Forsberg, Johan Sanneblad
Venue: Proceedings of the 2000 ACM conference on Computer supported cooperative work (2000)

The paper presents results of a research project that has aimed at developing a knowledge management architecture for mobile work domains. The architecture developed, called FieldWise, was based on fieldwork in two organisations and feedback from users of prototype systems. This paper describes the empirically grounded requirements of FieldWise, how these have been realised in the architecture, and how the architecture has been implemented in the news journalism domain. FieldWise adds to the field of CSCW by offering an empirically grounded architecture with a set of novel features that have not been previously reported in the literature.
D-CAT: A distributed channel allocation strategy based on a threshold scheme for cellular mobile networks
Authors: Yongbing Zhang, Xiaohua Jia, Sajal K. Das
Venue: Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures (2001)

We propose a distributed channel allocation algorithm based on a threshold scheme, called D-CAT, for cellular mobile networks. The D-CAT algorithm employs two thresholds: (i) a heavy threshold used for determining whether a cell is heavy, i.e., overloaded, and for triggering the channel allocation algorithm; and (ii) a target threshold used for indicating the target number of free channels that a heavy cell intends to acquire. The D-CAT algorithm determines the optimal number of free channels as well as the cell(s) from where a heavy cell should import to satisfy its channel demand.
Designing to support adversarial collaboration
Authors: Andrew L. Cohen, Debra Cash, Michael J. Muller
Venue: Proceedings of the 2000 ACM conference on Computer supported cooperative work (2000)

We investigate the phenomenon of adversarial collaboration, through field studies of a legal firm. Adversarial collaboration requires that people with opposing goals (adversaries) come to agreement, usually producing a shared product that reflects the interests of the adversarial parties. Adversarial collaboration is characterized by secrecy, advocacy and discovery. To support this activity, software should provide flexible, selective sharing of awareness and access. These requirements contrast with conventional shared resource and awareness systems, which tend to assume cooperative collaboration, characterized by open processes and static membership lists. We illustrate these ideas in a redesign of our PeopleFlow research prototype.
Increasing the opportunities for aging in place
Authors: Elizabeth D. Mynatt, Irfan Essa, Wendy Rogers
Venue: Proceedings on the 2000 conference on Universal Usability (2000)

A growing social problem in the U.S. and elsewhere is supporting older adults who want to continue living independently as opposed to moving to an institutional care setting. The &ldquo;Aging in Place&rdquo; project strives to delay taking that first step away from the family home. Through the careful placement of technological support we believe older adults can continue living in their own homes longer. The goal of our research is to take a three-pronged approach to understanding the potential of such environmental supports. The research team combines expertise in human-computer-interaction, computational perception, and cognitive aging. Together the team is assessing the feasibility of designing environments that aid older individuals in maintaining their independence. Based on our initial research, we are dividing this work into three parts: recognizing and adverting crisis, assisting daily routines, and supporting peace of mind for adult children.
Reengineering the biomedical-equipment procurement process through an integrated Management Information System
Authors: Yannis G. Larios, George K. Matsopoulos, Dimitris Th. Askounis, Konstantina S. Nikita
Venue: Technology and Health Care (2000)

The design of each new hospital site is typically preceded by decisions on the most appropriate level of biomedical equipment which significantly influences the layout of the hospital departments which are under construction. The most appropriate biomedical equipment should ideally be decided upon considering a series of demographic and social parameters of the hospital and international regulations and standards. This information should ultimately be distilled to proper technical specifications. This paper proposes a streamlined management process related to the procurement of biomedical equipment for new hospital sites or for those under expansion. The new management process aims to increase the efficiency of the experts involved in the definition of the most appropriate level of equipment and its technical specifications. It also addresses all aspects of the biomedical equipment-selection cycle, including the evaluation of the bids submitted by the equipment suppliers. The proposed process is assisted by a management information system, which integrates all related data-handling operations. It provides extensive decision-support facilities to the expert and a platform for the support of knowledge re-use in the field of biomedical-equipment selection.
Towards a general theory of special functions
Authors: Joel Moses
Venue: Communications of the ACM (1972)

A list of a number of natural developments for the field of algebraic manipulation is given. Then the prospects for a general theory of functions defined by ordinary differential equations are discussed. The claim is made that recent developments in mathematics indicate that it should be possible to algorithmically generate many properties of solutions to differential equations. Such a theory is preferable to a less general effort to make algebraic manipulation systems knowledgeable about the usual special functions (e.g. exponential, hypergeometric).
Efficient minarea retiming of large level-clocked circuits
Authors: N. Maheshwari, S. S. Sapatnekar
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

Delay-constrained area optimization is an important step in synthesis of VLSI circuits. Minimum area (minarea) retiming is a powerful technique to solve this problem. The minarea retiming problem has been formulated as a linear program; in this work we present techniques for reducing the size of this linear program and efficient techniques for generating it. This results in an efficient minarea retiming method for large level-clocked circuits (with tens of thousands of gates).
Number-Theoretic Test Generation for Directed Rounding
Authors: Michael Parks
Venue: IEEE Transactions on Computers (2000)

We present methods to systematically generate the hardest test cases for multiplication, division, and square root subject to directed rounding, essentially extending previous work on number-theoretic floating-point testing to rounding modes other than to-nearest. The algorithms focus upon the rounding boundaries of the modes truncate, to-minus-infinity, and to-infinity, and programs based on them require little beyond exact arithmetic in the working precision to create billions of edge cases. We will show that the amount of work required to calculate trial multiplicands pays off in the form of free extra tests due to an interconnection among the operations considered herein. Although these tests do not replace proofs of correctness, they can be used to gain a high degree of confidence that the accuracy requirements mandated by IEEE Standard 754 have been satisfied.
Video transcoding for universal multimedia access
Authors: Niklas Björk, Charilaos Christopoulos
Venue: Proceedings of the 2000 ACM workshops on Multimedia (2000)

This paper discusses the issue of adapting video streams to different type of terminals with different terminal capabilities such as screen size, amount of available memory, processing power and type of network access. This functionality will be very useful for the Universal Multimedia Access application related to MPEG-7 standardization activities. Two different models for transcoding are examined, rate reduction and resolution reduction. Results will show that the computational complexity of the basic transcoding model can be reduced for each model by, on average, 39% and 23% without significant loss in quality. Comparisons with the scaleable coding model are also shown.
Minimal-total-processing time drum and disk scheduling disciplines
Authors: Samuel H. Fuller
Venue: Communications of the ACM (1974)

This article investigates the application of minimal-total-processing-time (MTPT) scheduling disciplines to rotating storage units when random arrival of requests is allowed. Fixed-head drum and moving-head disk storage units are considered, and emphasis is placed on the relative merits of the MTPT scheduling discipline with respect to the shortest-latency-time-first (SLTF) scheduling discipline. The results of the simulation studies presented show that neither scheduling discipline is unconditionally superior to the other. For most fixed-head drum applications, the SLTF discipline is preferable to MTPT, but for intra-cylinder disk scheduling the MTPT discipline offers a distinct advantage over the SLTF discipline. The computational requirements of an algorithm that implements the MTPT scheduling discipline are shown to be comparable to SLTF algorithms. In both cases, the sorting procedure is the most time-consuming phase of the algorithm.
Best practices in corporate training and the role of aesthetics: interviews with eight experts
Authors: Morgan Jennings
Venue: Proceedings of the 2001 ACM SIGCPR conference on Computer personnel research (2001)

`Stop playing around and get to work' is a common refrain. While the two do not seem to mix, research indicates that play has much to offer corporate training when it comes to learning. This paper presents in narrative form, a summary of the interviews with eight master designers of engaging and immersive learning products and the subsequent aesthetic framework for development of such environments.