ppxscal/embedding_network huggingface dataset:
Reducing cache engery through dual voltage supply
Authors: Vasily G. Moshnyaga
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

Due to a large capacitance and enormous access rate, caches dissipate about a third of the total energy consumed by today's processors. In this paper we present a new architectural technique to reduce energy consumption in caches. Unlike previous approaches, which have focused on lowering cache capacitance and the number of accesses, our method exploits a new freedom in cache design, namely the voltage per access. Since in modern caches, the loading capacitance operated on cache-hit is much less than the capacitance operated on cache-miss, the given clock cycle time is inefficiently exploited during the hit. We propose to trade-off this unused time with the supply voltage, lowering the voltage level on the hit and increasing it during the miss. Experiments shows that the approach can save up to 60% of cache energy without large performance and area overhead.
The FirstSearch user interface architecture: universal access for any user, in many languages, on any platform
Authors: Gary Perlman
Venue: Proceedings on the 2000 conference on Universal Usability (2000)

The OCLC FirstSearch&reg; service allows users to search for bibliographic and full text records in over 80 online databases. Web-based, FirstSearch was designed to adapt to unexpected user needs, platform considerations, languages, and changing requirements. The many unknowns during development necessitated an architecture that would allow many types of contributors to modify the interface easily and frequently. For example, marketing, documentation, and user interface designers edited the strings used in the interface, including translation; and user interface and graphic designers edited the screen layout. Structured initialization files with a simple convention for adapting to specific users, platforms, languages, etc., allowed continual broadening of the accessibility of the system without complicating the overall architecture. The paper begins with a discussion of the general requirements for FirstSearch (multi-platform, multi-lingual, levels of users, low-end hardware, accessible) and the need for better coordination of contributions from the FirstSearch team. The architecture is then described, which partitions the specification of the interface into platform - specific, language-specific, and language/platform independent functional components. The user interface, in the form of Web pages, is then generated dynamically (although it would also be possible to generate static pages). The paper ends with a discussion of experiences with the changes to the interface and a cost-benefit analysis of the architecture, with the overall conclusion that addressing many accessibility issues in the architecture facilitated individual accessibility issues.
Research in progress: the effects of ethical climate on attitudes and behaviors toward software piracy
Authors: Diane Lending, Sandra A. Slaughter
Venue: Proceedings of the 2001 ACM SIGCPR conference on Computer personnel research (2001)

Software piracy, the unauthorized copying of computer software, is widespread in many organizations today. From the perspective of managers in organizations, software piracy means the threat of costly litigation on the one hand, balanced against the reduced expense for additional software if unauthorized copies are used. It should be possible to exercise more effective control over software piracy with a more complete understanding of the factors that lead to the decision to copy software. The goal of this study is to assess the direct and moderating effects of the organization's ethical climate on a variety of attitudes and behaviors regarding software piracy. Prior research on software piracy has tended to focus on individual factors that influence piracy. This study is part of a multi-year, multi-university study of software piracy. Results from our prior studies suggest that while individual factors such as age and gender influence piracy attitudes and behaviors, these effects appear to be overshadowed by organization effects. In this study, we measure organization ethical climate as perceived by students in three universities and their attitudes and behaviors towards software piracy. The measures of ethical climate used in the literature have been modified to fit the university setting. Our study promises to make several important contributions. From the perspective of theory, our work should demonstrate the importance of including organizational ethical climate in theoretical models of the antecedents of software piracy attitudes and behaviors. Prior research on software piracy has tended to focus on the effects of individual differences; however, individuals are embedded in organizational contexts that can influence their attitudes and behaviors. From the perspective of practice, demonstrating that different ethical climates directly impact and moderate software piracy attitudes and behaviors has a number or implications for the management of information systems professionals. It is important to know whether certain ethical climates encourage or discourage software piracy attitudes and behaviors. Managers may work to change an ethical climate that fosters software piracy; alternatively, they may need to implement strong measures in the existing ethical climate to discourage software piracy. Finally, it is important to study software piracy in a university setting, as this is where future information systems professionals are trained. It is imperative for educators to understand students' ethical attitudes and behaviors concerning software piracy, and how these attitudes and behaviors may be influenced.
Sorting
Authors: W. A. Martin
Venue: ACM Computing Surveys (CSUR) (1971)

The bibliography appearing at the end of this article lists 37 sorting algorithms and 100 books and papers on sorting published in the last 20 years. The basic ideas presented here have been abstracted from this body of work, and the best algorithms known are given as examples. As the algorithms are explained, references to related algorithms and mathematical or experimental analyses are given. Suggestions are then made for choosing the algorithm best suited to a given situation.
A data structure for manipulating priority queues
Authors: Jean Vuillemin
Venue: Communications of the ACM (1978)

A data structure is described which can be used for representing a collection of priority queues. The primitive operations are insertion, deletion, union, update, and search for an item of earliest priority.
A note on when to chain overflow items within a direct-access table
Authors: Carter Bays
Venue: Communications of the ACM (1973)

This note supplements the paper by V.Y. Lum [2] and elaborates on Table II in McIlroy [3].
Heery International's Spreadsheet Optimization Model for Assigning Managers to Construction Projects
Authors: Larry J. LeBlanc, Dale Randels, T. K. Swann
Venue: Interfaces (2000)

When assigning managers to construction projects, Heery International tries to minimize the total cost of the assignments while maintaining a balanced workload for different managers. We developed and implemented an Excel spreadsheet optimization model for problems with up to 114 projects. As time passes, new projects arise, old projects terminate, and occasionally new managers join the team, and existing ones resign or transfer out. Because the model is in a spreadsheet environment, Heery can easily add or remove projects and managers from the model. As a result of our model, Heery has managed its projects without replacing a manager who resigned and has reduced travel costs, because the model assigns managers to projects that are closer to their homes than previously.
RNA biology and the genome (abstract only)
Authors: Philip Sharp
Venue: Proceedings of the fifth annual international conference on Computational biology (2001)

The sequence of vertebrate genome is expressed by RNA splicing producing mRNA. Interpreting the genome requires understanding the sequences recognized by the nuclear factors and spliceosomia executing removal of introns. The status of this area of science will be reviewed. Conversely, genome sequences can be searched for sequences which specify RNA splicing and are common of many genes. The availability of genome sequences from a variety of species will make the latter approach much more powerful. The recently discovered RNA interference (RNAi) process is evolutionarily old and related processes are important for control of expression of repetitive genes in some organisms. RNAi can be initiated by conversion of double strand RNA into 21-23 nucleotide RNAs which can base pair with mRNAs and direct their cleavage. These short RNAs may also direct silencing of genes by other mechanisms. Over half of the genome of many organisms is composed of repetitive sequences and it is possible that RNAi may silence these sequences.
A generalized user interface for applications programs
Authors: Leonard J. Bass, Ralph E. Bunker
Venue: Communications of the ACM (1981)

A general method for using disk files (instead of a more conventional parameter-passing mechanism) to transfer control information from a user interface to a set of related applications programs is described. This technique effectively moves much of the user interface, including command decoding and limited parameter checking, from the applications programs to a table-driven executive.
An Aristotelian understanding of object-oriented programming
Authors: Derek Rayside, Gerard T. Campbell
Venue: Proceedings of the 15th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications (2000)

The folklore of the object-oriented programming community at times maintains that object-oriented programming has drawn inspiration from philosophy, specifically that of Aristotle. We investigate this relation, first of all, in the hope of attaining a better understanding of object-oriented programming and, secondly, to explain aspects of Aristotelian logic to the computer science research community (since it differs from first order predicate calculus in a number of important ways). In both respects we endeavour to contribute to the theory of objects, albeit in a more philosophical than mathematical fashion.
Complexity of the computer hardware and software (abstract only)
Authors: Mykola Cherkassky
Venue: Proceedings of the symposium on Contemporary computing in Ukraine (2000)

The complexity characteristics of informal algorithm models, formal algorithm systems and of an algorithm device have been examined. Methods of efficient informal algorithm constructions have been systematized. The parameters of time and instrumental complexities of hardware/software environment have been precised. Introduce information characteristics as programm and structure complexities. Describe optimization methods of the four complexity charadteristics for each hierarchical level of computer environment presentation. Optimization first of all assumes using of not contradictional methods of time and programm minimization considering about relative value of each characteristic. Taking into account relative price value of each parameter, optimization first of all assumes using of not contradictional methods of minimization of time and program complexities by means of some increasing of instrumental and structural complexities, but keeping computer's functional abilities. Expedience of using complexity parameters has been demonstrated by microprocessors evolution analysis.
DOMOSIMCOL: a simulation collaborative environment for the learning of domotic design
Authors: C. Bravo
Venue: ACM SIGCSE Bulletin (2000)

The learning systems based on the solution of real projects have proved to be efficient in the different educational levels. With the use of simulation environments these systems achieve a combination between the student monitoring and discovery learning. In this work we present tools that enable the creation of a plan in a collaborative way and the use of simulation in learning communities to the solution of design problems applied to the domotics domain
Spread-sprectrum CDMA packet radio MAC protocol using channel overload detection and blocking
Authors: Garth Judge, Fambirai Takawira
Venue: Wireless Networks (2000)

An analytical and simulation performance evaluation is presented for a multi&dash;access protocol for a data packet radio network with a limited user capacity. The network employs direct&dash;sequence code division multiple access &lpar;DS&dash;CDMA&rpar; in a centralised channel load&dash;sensing scheme with channel overload &lpar;collision&rpar; detection and blocking via a separate ancillary channel state information broadcast system. Traffic models that incorporate both a finite population and an infinite population and variable length data messages are considered. Results show that an improved throughput&sol;delay performance can be obtained by implementing a channel overload detection &lpar;message dropping&rpar; scheme as well as a channel overload avoidance &lpar;message blocking&rpar; scheme. The channel overload threshold &beta; is fixed at the system&apos;s maximum user capacity whereas it is shown that the overload avoidance blocking threshold &alpha; should be variable and dependent on the mean message arrival rate.
Single chip 3D rendering engine integrating embedded DRAM frame buffer and Hierarchical Octet Tree (HOT) array processor with bandwidth amplification
Authors: Yong-Ha Park, Seon-Ho Han, Hoi-Jun Yoo
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

A single chip rendering engine that consist of a DRAM frame buffer, a SRAM serial access memory, pixel/edge processor array and 32b RISC core is proposed for the low power 3D-graphics in portable system. The 56mm2 prototype integrating edge processor, 8 pixel processors, 8 frame buffers and RISC core is fabricated using 0.35um CMOS Embedded Memory Logic (EML) technology.
Panel: Dimensions of mobility in the I.T. profession examining &ldquo;Turnover Culture&rdquo; and &ldquo;Staying Behavior&rdquo; (panel session)
Authors: Michael J. Gallivan, Ephraim McLean, Jo Ellen Moore, Malu Roldan
Venue: Proceedings of the 2001 ACM SIGCPR conference on Computer personnel research (2001)

This panel is designed to examine various dimensions of mobility among IT professionals. Turnover rates for IT professionals have risen from the traditional 6-10% to approximately 20% industry-wide (Maddern, 2000) and 25-35% in Fortune 500 companies (Agarwal Ferratt, 1999). Fortune magazine recently noted that quitting in the technology profession has become literally an annual event, as the average job tenure in IT has shrunk to about 13 months (Daniels Vinzant, 2000). Quite simply, this has to hurt. Corporate efforts to utilize technology to strategic advantage are often hampered in firms experiencing such high turnover. When IT professionals leave their employers, specialized skills, tacit knowledge, and understanding of specific business operations and systems often depart too. This can be a punch to the gut of an organization &mdash; sometimes a single powerful punch when a key &ldquo;franchise player&rdquo; is lost, or a constant pummeling inflicted by a steady exodus of IT professionals.
Student participation in computer science tutorials: why are their shoes so interesting?
Authors: Voon-Li Chung
Venue: Proceedings of the Australasian conference on Computing education (2000)

Getting student participation in tutorial and group discussion situations is always a challenge that can be difficult, time consuming and demoralising. As part of a Postgraduate Teaching Internship, a project is being initiated to try and determine the underlying causes for this refusal to participate by the undergraduates, and make attempts to resolve any problems or issues that may be causing the undergraduate students lack of participation. The preliminary results of a student survey into their lack of participation in group discussions are discussed, along with potential solutions that can be implemented to avoid future problems, which are in the process of being evaluated.
Configuration agents, control and privacy
Authors: Shari Trewin
Venue: Proceedings on the 2000 conference on Universal Usability (2000)

When a truly diverse community of users is considered, it is clear that a single interface, no matter how well designed, cannot accommodate everyone. Configuring an interface to match a particular user's requirements can be a demanding task. This paper focuses on the potential utility of configuration agents to support users with low initial levels of control, or low levels of knowledge about configuration. The relationship between configuration of systems by agents, user control, and user privacy is discussed. It is argued that privacy issues are of primary importance, and suggestions are made for ways to apply agent technologies to the configuration problem without compromising user control and privacy. Work in progress to inform and further develop these issues is described.
Closed-laboratory courses as an introduction to the uniformation science curriculum
Authors: Nicholas Karlson
Venue: Proceedings of the seventh annual consortium for computing in small colleges central plains conference on The journal of computing in small colleges (2001)

The Information Science department at the University of Arkansas at Little Rock (UALR) is just two years old. The challenges and choices of implementing a new curriculum are many. The department has chosen closed-lab courses to introduce its curriculum. Early indications are that this approach will be a successful one for both students and the university.
A lite bioinformatics specialization: a strategy for initiating computer science/bioinformatics collaboration
Authors: Warren T. Jones, Elliot J. Lefkowitz
Venue: ACM SIGBIO Newsletter (2000)

The emerging bioinformatics research community can benefit from an increase in computer science collaborators. One of the barriers to computer science collaboration is the lack of bioinformatics domain knowledge in the computer science community. This paper presents a strategy for facilitating this domain knowledge acquisition with the goal of accelerating the collaboration development process, particularly on campuses in which the computer science and bioformatics/medical communities are co-resident.
Dynamic Maintenance of Maxima of 2-d Point Sets
Authors: Sanjiv Kapoor
Venue: SIAM Journal on Computing (2000)

This paper describes an efficient scheme for the dynamic maintenance of the set of maxima of a 2-d set of points. Using the fact that the maxima can be stored in a staircase structure, we use a technique in which we maintain approximations to the staircase structure. We first describe how to maintain the maxima in O(log n) time per insertion and deletion when there are n insertions and deletions. O(log n) is charged per change for reporting changes to the staircase structure which stores the maxima. O(n) space is used. We also show another scheme which requires a total of O(n log n + r) time when r maximal points are listed. We finally consider extensions to higher dimensions.
A comparison of two network-based file servers
Authors: James G. Mitchell, Jeremy Dion
Venue: Communications of the ACM (1982)

This paper compares two working network-based file servers, the Xerox Distributed File System (XDFS) implemented at the Xerox Palo Alto Research Center, and the Cambridge File Server (CFS) implemented at the Cambridge University Computer Laboratory. Both servers support concurrent random access to files using atomic transactions, both are connected to local area networks, and both have been in service long enough to enable us to draw lessons from them for future file servers. We compare the servers in terms of design goals, implementation issues, performance, and their relative successes and failures, and discuss what we would do differently next time.
A New Monolithic Variable Capacitor
Authors: Eric Despain, John Choma,  Jr.
Venue: Analog Integrated Circuits and Signal Processing (2001)

A method of realizing monolithic variable linear circuit elements is presented. The method exploits monolithic variable gain amplifiers to modify the values of passive integrated devices. The technique described herein realizes floating true two-terminal variable elements. A theoretical analysis of a variable capacitance cell is performed as a prelude to a practical design producing capacitances in the range of 4 pF to 30 pF. The results of theoretical analyses are compared to SPICE [1] simulations of the subject cell, prototype circuit results are presented, and performance limitations are discussed.
Scalable multicasting: the core-assisted mesh protocol
Authors: Ewerton L. Madruga, J. J. Garcia-Luna-Aceves
Venue: Mobile Networks and Applications (2001)

Most of the multicast routing protocols for ad hoc networks today are based on shared or source-based trees; however, keeping a routing tree connected for the purpose of data forwarding may lead to a substantial network overhead. A different approach to multicast routing consists of building a shared mesh for each multicast group. In multicast meshes, data packets can be accepted from any router, as opposed to trees where data packets are only accepted from routers with whom a &ldquo;tree branch&rdquo; has been established. The difference among multicast routing protocols based on meshes is in the method used to build these structures. Some mesh-based protocols require the flooding of sender or recieved announcements over the whole network. This paper presents the Core-Assisted Mesh Protocol, which uses mesh for data forwarding, and avoids flooding by generalizing the notion of core-based trees introduced for internet multicasting. Group members form the mesh of a group by sending join requests to a set of cores. SImulation experiments show that meshes can be used effectively as multicast routing structures without the need for flooding control packets.
Quadratic programming for nonlinear regression
Authors: Richard I. Shrager
Venue: Communications of the ACM (1972)

A quadratic programming algorithm is described for use with the magnified diagonal method of nonlinear regression with linear constraints. The regression method is published in JACM, July 1970.
The role of programming in a Ph.D. computer science program
Authors: Bruce W. Arden
Venue: Communications of the ACM (1969)

In this general paper the role of programming in advanced graduate training is discussed. Subject matter related to programming as well as programming per se is considered. The importance and application of formalism are considered and also the need for good empirical experimentation. A brief outline for a sequence of courses is included, and subject headings that have been obtained from an extensive bibliography are given. A bibliography of programming references is included.
Implementation of a structured English query language
Authors: M. M. Astrahan, D. D. Chamberlin
Venue: Communications of the ACM (1975)

The relational model of data, the XRM Relational Memory System, and the SEQUEL language have been covered in previous papers and are reviewed. SEQUEL is a relational data sublanguage intended for ad hoc interactive problem solving by non-computer specialists. A version of SEQUEL that has been implemented in a prototype interpreter is described. The interpreter is designed to minimize the data accessing operations required to respond to an arbitrary query. The optimization algorithms designed for this purpose are described.
The use and implementation of interval data types in Fortran
Authors: G. William Walster
Venue: ACM SIGPLAN Fortran Forum (2000)

The use and implementation of interval data types in Fortran are examined. In particular, the innovations introduced in the intrinsic support for intervals in ForteTM Developer 6 Fortran 95 from Sun Microsystems Inc. are described and justified. Implications for future extensions to the Fortran language are also described.