ppxscal/embedding_network huggingface dataset:
On the Connection Between Macdonald Polynomials and Demazure Characters
Authors: Yasmine B. Sanderson
Venue: Journal of Algebraic Combinatorics: An International Journal (2000)

We show that the specialization of nonsymmetric Macdonald polynomials at t &equals; 0 are, up to multiplication by a simple factor, characters of Demazure modules for \widehat{sl(n)}. This connection furnishes Lie-theoretic proofs of the nonnegativity and monotonicity of Kostka polynomials.
Arithmetic on the European Logarithmic Microprocessor
Authors: J. N. Coleman, E. I. Chester, C. I. Softley, J. Kadlec
Venue: IEEE Transactions on Computers (2000)

A new European research project aims to develop a microprocessor based on the logarithmic number system, in which a real number is represented as a fixed-point logarithm. Multiplication and division therefore proceed in minimal time with no rounding error. However, the system can only offer an overall advantage over floating-point if addition and subtraction can be performed with speed and accuracy at least equal to that of floating-point, but these operations require the interpolation of a nonlinear function which has hitherto been either time-consuming or inaccurate. We present a procedure by which additions and subtractions can be performed rapidly and accurately and show that these operations are thereby competitive with their floating-point equivalents. We then present some large-scale case studies which show that the average performance of the LNS exceeds floating-point, in terms of both speed and accuracy.
Teaching the human aspect of software engineering - a case study
Authors: Orit Hazzan
Venue: Proceedings of the thirty-second SIGCSE technical symposium on Computer Science Education (2001)

This paper describes a course I taught at the Technion --- The Israel Institute of Technology --- which addressed human aspects of Software Engineering. More specifically, three human aspects involved in developing software systems were the focus of the course: problem solving methodologies in general and their application in developing software systems in particular; mental processes; and social processes of software-system developers.
Analysis of design alternatives for virtual memory indexes
Authors: K. Maruyama, S. E. Smith
Venue: Communications of the ACM (1977)

A class of index structures for use in a virtual memory environment is described. Design alternatives within this class of index structures are analyzed. These alternatives include a choice of search strategy, whether or not pages in the index are stuctured, and whether or not keys are compressed. The average cost of retrieving entries from these indexes is expressed as a weighted sum of the cost of a basis key comparison and the cost of crossing a page boundary in the index structure. Formulas for the retrieval costs possible combinations of design alternatives are given. These are used in numerical case studies which compare the retrieval costs of the alternatives. Qualitative comparisons of the maintenance costs (insertion, deletion, reorganization) of the design alternatives are also included.
Multimedia data storage and representation issues on tertiary storage subsystems: an overview
Authors: Athena Vakali, Evimaria Terzi
Venue: ACM SIGOPS Operating Systems Review (2001)

Storage of multimedia data is a critical issue for the overall system's performance and functionality. Multimedia applications must be able to support a variety of data defined as multimedia objects. Multimedia data consist of various objects such as text, image, video and graphics, which need to be synchronized and meet certain timing requirements. The development and evolution of these new applications characterized by high storage needs resulted in strengthening the role and importance of Tertiary Storage Systems. Recent technological advances have resulted in wide availability of commercial products offering near-line, robot-based, tertiary storage libraries. Therefore, such libraries have become an important component of modern large-scale storage servers. The issue of optimal data placement strategies in tertiary storage is considered below. Different configurations of tape libraries and magnetic tape technologies as well as the special attributes of stored data have an impact on the optimal placement.
An Experiment Measuring the Effects of Personal Software Process (PSP) Training
Authors: Lutz Prechelt, Barbara Unger
Venue: IEEE Transactions on Software Engineering (2001)

The Personal Software Process is a process improvement methodology aimed at individual software engineers. It claims to improve software quality (in particular defect content), effort estimation capability, and process adaptation and improvement capabilities. We have tested some of these claims in an experiment comparing the performance of participants who had just previously received a PSP course to a different group of participants who had received other technical training instead. Each participant of both groups performed the same task. We found the following positive effects: The PSP group estimated their productivity (though not their effort) more accurately, made fewer trivial mistakes, and their programs performed more careful error-checking; further, the performance variability was smaller in the PSP group in various respects. However, the improvements are smaller than the PSP proponents usually assume, possibly due to the low actual usage of PSP techniques in the PSP group. We conjecture that PSP training alone does not automatically realize the PSP's potential benefits (as seen in some industrial PSP success stories) when programmers are left alone with motivating themselves to actually use the PSP techniques.
Mxec: parallel processing with an advanced macro facility
Authors: William L. Ash
Venue: Communications of the ACM (1981)

Mxec is a sophisticated computing environment (executive system) which extends and magnifies users' interactions with a computer. Principally, Mxec provides for parallel processing and also assumes many of the mundane, clerical tasks with which users of most systems find themselves burdened. Some of the characteristics of the Mxec system are given, and its motivation and implementation are discussed.
Unhelpfulness as a security policy: or it's about time
Authors: Ruth Nelson
Venue: Proceedings of the 1995 workshop on New security paradigms (1995)

This paper suggests the possibility of controlling the rate of release of information as well as whether the information can be released at all. If the user must have access to information, but does not require fast access to large amounts of data, the system can release the information to that user in a slow and unhelpful manner. The addition of the parameter of time acts as a deterrent to information collectors and intruders; less information is available, and the user must access the system repeatedly and for a longer time to get it.Investigation of rate of release has led to further understanding of the principle of least privilege. The principle of least privilege has generally been espoused by the computer security as highly desirable. It has been applied to computer security, but only in limited ways. Considered of time allows a refinement of the concept and offers the possibility of more flexible and fine-grained control.
LRoute: a delay minimal router for hierarchical CPLDs
Authors: K. K. Lee, Martin D. F. Wong
Venue: Proceedings of the 2001 ACM/SIGDA ninth international symposium on Field programmable gate arrays (2001)

This paper describes LRoute, a novel router for the popular and scalable hierarchical Complex Programmable Logic Devices (CPLDs). CPLD routing has constraints on routing topologies due to architectural limitations and performance considerations. These constraints make the problem quite different from FPGA routing and render the routing problem more complicated. Extensions of popular FPGA routers like the maze router performs poorly on such CPLDs. There is also little published work on CPLD routing. LRoute uses a different paradigm based on the Lagrangian Relaxation framework in the theory of mathematical programming. It respects the topology constraints imposed and routes a circuit with minimum delay. We tested this router on a set of industry problems that commercial software failed to route. Our router was able to route all of them very quickly.
A practical query-by-humming system for a large music database
Authors: Naoko Kosugi, Yuichi Nishihara, Tetsuo Sakata, Masashi Yamamuro, Kazuhiko Kushima
Venue: Proceedings of the eighth ACM international conference on Multimedia (2000)

A music retrieval system that accepts hummed tunes as queries is described in this paper. This system uses similarity retrieval because a hummed tune may contain errors. The retrieval result is a list of song names ranked according to the closeness of the match. Our ultimate goal is that the correct song should be first on the list. This means that eventually our system's similarity retrieval should allow for only one correct answer. The most significant improvement our system has over general query-by-humming systems is that all processing of musical information is done based on beats instead of notes. This type of query processing is robust against queries generated from erroneous input. In addition, acoustic information is transcribed and converted into relative intervals and is used for making feature vectors. This increases the resolution of the retrieval system compared with other general systems, which use only pitch direction information. The database currently holds over 10,000 songs, and the retrieval time is at most one second. This level of performance is mainly achieved through the use of indices for retrieval. In this paper, we also report on the results of music analyses of the songs in the database. Based on these results, new technologies for improving retrieval accuracy, such as partial feature vectors and or'ed retrieval among multiple search keys, are proposed. The effectiveness of these technologies is evaluated quantitatively, and it is found that the retrieval accuracy increases by more than 20% compared with the previous system [9]. Practical user interfaces for the system are also described.
Comments on &ldquo;An approach to the formal verification of the two-party crytographic protocols&rdquo; by Zhang, Li and Xiao
Authors: Dongyao Ji, Yuming Wang
Venue: ACM SIGOPS Operating Systems Review (2001)

We show that the method proposed by Zhang, Li and Xiao in [2] is not a general method for verifying the two-party cryptographic protocols.
PASTEL: a parameterized memory characterization system
Authors: K. Ogawa, M. Kohno, F. Kitamura
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

PASTEL is a parameterized memory characterization system which extracts the characteristics of ASIC on-chip-memories such as delay, timing and power consumption which are important in LSI logic design. PASTEL is a fully-automated process from exact wire-RC extraction through circuit reduction, input vector generation, waveform measurement, data-sheet and library creation. The circuit reduction scheme can reduce the circuit simulation time by 2 order of magnitude while maintaining delay error within 100pSec of exact simulation.
A relational model of data for large shared data banks
Authors: E. F. Codd
Venue: Communications of the ACM (1983)

Future users of large data banks must be protected from having to know how the data is organized in the machine (the internal representation). A prompting service which supplies such information is not a satisfactory solution. Activities of users at terminals and most application programs should remain unaffected when the internal representation of data is changed and even when some aspects of the external representation are changed. Changes in data representation will often be needed as a result of changes in query, update, and report traffic and natural growth in the types of stored information. Existing noninferential, formatted data systems provide users with tree-structured files or slightly more general network models of the data. In Section 1, inadequacies of these models are discussed. A model based on n-ary relations, a normal form for data base relations, and the concept of a universal data sublanguage are introduced. In Section 2, certain operations on relations (other than logical inference) are discussed and applied to the problems of redundancy and consistency in the user's model.
A fast string searching algorithm
Authors: Robert S. Boyer, J. Strother Moore
Venue: Communications of the ACM (1977)

An algorithm is presented that searches for the location, &ldquo;il&rdquo; of the first occurrence of a character string, &ldquo;pat,&rdquo; in another string, &ldquo;string.&rdquo; During the search operation, the characters of pat are matched starting with the last character of pat. The information gained by starting the match at the end of the pattern often allows the algorithm to proceed in large jumps through the text being searched. Thus the algorithm has the unusual property that, in most cases, not all of the first i characters of string are inspected. The number of characters actually inspected (on the average) decreases as a function of the length of pat. For a random English pattern of length 5, the algorithm will typically inspect i/4 characters of string before finding a match at i. Furthermore, the algorithm has been implemented so that (on the average) fewer than i + patlen machine instructions are executed. These conclusions are supported with empirical evidence and a theoretical analysis of the average behavior of the algorithm. The worst case behavior of the algorithm is linear in i + patlen, assuming the availability of array space for tables linear in patlen plus the size of the alphabet. 3~
A note on the calculation of probabilities in an F-distribution
Authors: K. W. Smillie, T. H. Anstey
Venue: Communications of the ACM (1964)

Tests of significance based on analysis of variance calculations often require the determination of the probabilities of obtaining values of F greater than those arising from the analysis. These probabilities are customarily obtained from tables of the F-distribution. However, when the calculations are done on a computer, it would be convenient if estimates of these probabilities could be calculated by the analysis of variance program and presented in the output of the results. This note gives a simple method of doing so.
The human device abstraction
Authors: Daniel P. Mapes
Venue: Proceedings of DARE 2000 on Designing augmented reality environments (2000)

A human device abstraction is proposed as a way to promote development of commercial applications which apply advanced sensing and viewing technologies found in human computer interaction (HCI) research disciplines such as virtual and enhanced reality. A few simple enhanced reality examples are presented which show how human device compliant applications can be developed which are compatible with future sensor technology advancements and remain stable as these device configurations evolve and change over time.
Comment on 'On-Line Scheduling Policies for a Class of IRIS Real-Time Tasks'
Authors: Kyunghee Choi, Gihyun Jung
Venue: IEEE Transactions on Computers (2001)

Scheduling policies for real-time tasks which receive rewards that depend on the amount of service received were presented by Dey et al. The policies utilized heuristic approaches to maximize the total accrued reward. In this comment, we propose an extension of their work that may reduce the average computational complexity.
When worlds collide!: an interdisciplinary course in virtual-reality art
Authors: Guy W. Zimmerman, Dena E. Eber
Venue: ACM SIGCSE Bulletin (2001)

The use of virtual reality technologies as a medium for artistic expression requires the combined talents of artists and computer scientists working in concert. We created a course to bring together students and faculty from these two diverse worlds, both to create artistic virtual environments and to foster skills needed to work on interdisciplinary teams. This paper describes this course, the art works created and discuses some of the issues that arise when such worlds collide.
On-the-Fly Algorithms and Sequential Machines
Authors: Christiane Frougny
Venue: IEEE Transactions on Computers (2000)

It is shown that a function is computable by an on-the-fly algorithm processing data in the most significant digit first fashion with a finite number of registers if and only if it is computable by a right subsequential finite state machine processing deterministically data in the least significant digit first fashion. Some applications to complex radix number systems are given.
Continuous control of avatar gesture
Authors: Francesca Barrientos
Venue: Proceedings of the 2000 ACM workshops on Multimedia (2000)

We are developing an application to give humans the ability to transmit nonverbal communication behaviors through an avatar: specifically gesture, the movements of the arms and hands that accompany speech when people speak face-to-face. In this application the user will have continuous control over the avatar animation. The avatar will be like a virtual puppet and the user will manipulate the avatar using not strings or rods but the controlled and skilled motions of their hand. The system tracks hand motions and then maps that motion to the joint motions of a three-dimensional articulated avatar. As part of this research we will try out different ways of tracking the user's hand. Eventually we plan to test the efficacy of this system by incorporating it into a networked virtual environment in which two or more people can interact through the virtual medium. Working with artists will enable us to design a system that is expressive and to better understand the expressive power of this system.
ARTE&mdash;an adpative rendering and transmission environment for 3D graphics
Authors: Ioana M. Martin
Venue: Proceedings of the eighth ACM international conference on Multimedia (2000)

Thus far, a significant body of work has been devoted to the challenges of universal access related to the delivery of traditional multimedia content such as text, images, audio, and video. Less attention has been focused on three-dimensional (3D) digital content, as true market opportunities for 3D graphics over networks have just begun to emerge. In this paper, we present ARTE, an Adaptive Rendering and Transmission Environment that facilitates the delivery 3D models in heterogeneous environments by monitoring the resources available and by selecting appropriate transmission modalities.
Spelling correction in systems programs
Authors: Howard L. Morgan
Venue: Communications of the ACM (1970)

Several specialized techniques are shown for efficiently incorporating spelling correction algorithms into compilers and operating systems. These include the use of syntax and semantics information, the organization of restricted keyword and symbol tables, and the consideration of a limited class of spelling errors. Sample 360 coding for performing spelling correction is presented. By using systems which perform spelling correction, the number of debugging runs per program has been decreased, saving both programmer and machine time.
The network is the database: data management for highly distributed systems
Authors: Julio C. Navas, Michael Wynblatt
Venue: ACM SIGMOD Record (2001)

This paper describes the methodology and implementation of a data management system for highly distributed systems, which was built to solve the scalability and reliability problems faced in a wide area postal logistics application developed at Siemens. The core of the approach is to borrow from Internet routing protocols, and their proven scalability and robustness, to build a network-embedded dynamic database index, and to augment schema definition to optimize the use of this index. The system was developed with an eye toward future applications in the area of sensor networks.
A system for program visualization and problem-solving path assessment of novice programmers
Authors: Maria Satratzemi, Vassilios Dagdilelis, Georgios Evagelidis
Venue: ACM SIGCSE Bulletin (2001)

This paper describes an educational programming environment, called AnimPascal. AnimPascal is a program animator that incorporates the ability to record problem-solving paths followed by students. The aim of AnimPascal is to help students understand the phases of developing, verifying, debugging, and executing a program. Also, by recording the different versions of student programs, it can help teachers discover student conceptions about programming. In this paper we describe how our system works and present some empirical results concerning student conceptions when trying to solve a problem of algorithmic or programming nature. Finally, we present our plans for further extensions to our software.
The motion dynamics of snakes and worms
Authors: Gavin S. P. Miller
Venue: Proceedings of the 15th annual conference on Computer graphics and interactive techniques (1988)

Legless figures such as snakes and worms are modelled as mass-spring systems. Muscle contractions are simulated by animating the spring tensions. Directional friction due to the surface structure is included in the dynamic model and legless figure locomotion results. Various modes of locomotion are described.
Shape sensitive geometric permutations
Authors: Yunhong Zhou, Subhash Suri
Venue: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms (2001)

We prove that a set of n unit balls in Rd admits at most four distinct geometric permutations, or line transversals, thus settling a long-standing conjecture in combinatorial geometry. The constant bound significantly improves upon the &THgr;(nd-1) bound for the balls of arbitrary radii. Intrigued by this large gap between the two bounds, we also investigate how the number of geometric permutations varies as a function of shape, size, and spacing of objects. Our results include a tight bound of 2d-1 on the geometric permutations of n disjoint rectangular boxes in Rd, and a constant bound on the geometric permutations for disks in the plane when the ratio between the largest to smallest disks is bounded. An important consequence of the former theorem is that if the smallest bounding boxes containing a set of geometric objects in Rd are pairwise disjoint, then those objects admit only 2d-1 permutations, which is a significant improvement on the &Ogr;(n2d-2) bound known for general convex objects.
Education: A general-purpose display processing and tutorial system
Authors: K. J. Engvold, J. L. Hughes
Venue: Communications of the ACM (1968)

ADEPT (A Display-Expedited Processing and Tutorial) system is described. This system was designed to improve man-computer communications by employing a display unit to interleave tutoring with other computer operations such as simulation, programming, and information retrieval. It is written in FORTRAN IV (G) for the IBM System/360, Model 40, and the IBM 2250 Display Unit under Operating System/360. ADEPT is a cataloged program that controls the standard operating system by terminating and rescheduling itself automatically, relinquishing computer resources allocated to it, and surrendering control to the operating system to perform other jobs. It expands the power and flexibility of computer-assisted instruction by making immediately available to students, teachers, and other users, the full resources (system-cataloged programs) of the operating system. Language processors and compilers, simulation models, mathematical solution techniques, stored data, and all other library and user programs can be incorporated into instructional material without reprogramming. Illustrations of the various applications are presented and their implications are discussed. 0