ppxscal/embedding_network huggingface dataset:
Masters of Doom: How Two Guys Created an Empire and Transformed Pop Culture
Authors: David Kushner
Venue:  (2003)

:"Masters of Doom is the amazing true story of the Lennon and McCartney of video games: John Carmack and John Romero. Together, they ruled big business. They transformed popular culture. And they provoked a national controversy. More than anything, they lived a unique and rollicking American Dream, escaping the broken homes of their youth to co-create the most notoriously successful game franchises in history - Doom and Quake - until the games they made tore them apart." Americans spend more money on video games than on movie tickets. Masters of Doom is the first book to chronicle this industry's greatest story, written by one of the medium's leading observers. David Kushner takes readers inside the rags-to-riches adventure of two rebellious entrepreneurs who came of age to shape a generation. The vivid portrait reveals why their games are so violent and why their immersion in their brilliantly designed fantasy worlds offered them solace. And it shows how they channeled their fury and imagination into products that are a formative influence on our culture, from MTV to the Internet to Columbine. This is a story of friendships and betrayal, commerce and artistry - a powerful and compassionate account of what it's like to be young, driven, and wildly creative. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Compilation and memory management for ASF+SDF
Authors: Mark Brand, Paul Klint, Pieter A. Olivier
Venue:  (1999)

Can formal specification techniques be scaled-up to industrial problems such as the development of domain-specific languages and the renovation of large COBOL systems? We have developed a compiler for the specification formalism Asf+Sdf that has been used successfully to meet such industrial challenges. This result is achieved in two ways: the compiler performs a variety of optimizations and generates efficient C code, and the compiled code uses a run-time memory management system based on maximal subterm sharing and mark-and-sweep garbage collection. We present an overview of these techniques and evaluate their effectiveness in several benchmarks. It turns out that execution speed of compiled Asf+Sdf specifications is at least as good as that of comparable systems, while memory usage is in many cases an order of magnitude smaller.
SplitThreads Split-C Threads
Authors: Veena Avula, Induprakas Kodukula
Venue:  (1995)

SplitThreads are enhancements to Split-C by user level non pre-emptive threads. The primary motivation for SplitThreads comes from the fact that the SPMD paradigm of Split-C is a limitation for some important problems. At the same time, Split-C is very efficient and is tunable for good performance. Other related approaches such as Nexus have a large amount of overhead in providing threads capability. This paper presents the addition of a lightweight user-level threads package to Split-C. The performance numbers obtained show significant improvement over existing comparable approaches such as Nexus. The underlying thread library core is QuickThreads. QuickThreads provides minimal support for thread management. Additional functionality is provided by SplitThreads on top of this core. Finally, SplitThreads provides higher level user objects such as I-structures and M-structures
Advances in Real-Time Database Systems Research: Special Section on RTDBS of ACM SIGMOD Record 25(1), March 1996.
Authors: Azer Bestavros
Venue:  (1996)

Abstract A Real-Time DataBase System (RTDBS) can be viewed as an amalgamation of a conventional DataBase Management System (DBMS) and a real-time system. Like a DBMS, it has to process transactions and guarantee ACID database properties. Furthermore, it has to operate in real-time, satisfying time constraints imposed on transaction commitments. A RTDBS may exist as a stand-alone system or as an embedded component in a larger multidatabase system. The publication in 1988 of a special issue of ACM SIGMOD Record on Real-Time DataBases signaled the birth of the RTDBS research area---an area that brings together researchers from both the database and real-time systems communities. Today, almost eight years later, I am pleased to present in this special section of ACM SIGMOD Record a review of recent advances in RTDBS research. There were 18 submissions to this special section, of which eight papers were selected for inclusion to provide the readers of ACM SIGMOD Record with an overview of current and future research directions within the RTDBS community. In this paper, I will summarize these directions and provide the reader with pointers to other publications for further information.
Macromedia Flash MX Production Techniques
Authors: MD Dundon
Venue:  (2003)

:Tens of thousands of Web developers use Macromedia Flash on a daily basis, but even among pros, few realize that it's the ultimate Web-optimizing tool. Whether you create your illustrations directly in Macromedia Flash or import them from other programs, you can make them smaller and more efficient by the time you export them to a SWF movie. Macromedia Flash MX Production Techniques is the ideal workbook for fine-tuning your Web production skills. Author MD Dundon, a pioneering Macromedia Flash instructor and member of Macromedia's Flash Advisory Board, shares her secrets for efficient behind-the-scenes production -- the key to successful Web projects. Whether you're new to Macromedia Flash MX or already have experience building Flash interfaces, this book will teach you better work habits and tricks for greater efficiency. From setting up your workspace to optimizing and uploading your site, you'll learn practical interface-building techniques you can apply to your own projects. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Machine Learning and Software Engineering
Authors: Du Zhang, Jeffrey J. P. Tsai
Venue: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (2002)

Machine learning deals with the issue of how to build programs that improve their performance at some task through experience. Machine learning algorithms have proven to be of great practical value in a variety of application domains. Not surprisingly, the field of software engineering turns out to be a fertile ground where many software development and maintenance tasks could be formulated as learning problems and approached in terms of learning algorithms. This paper deals with the subject of applying machine learning methods to software engineering. In the paper, we first provide the characteristics and applicability of some frequently utilized machine learning algorithms. We then summarize and analyze the existing work and discuss some general issues in this niche area. Finally we offer some guidelines on applying machine learning methods to software engineering tasks.
A knowledge-based approach to object-oriented legacy code reuse
Authors: L. H. Etzkorn, C. G. Davis, L. L. Bowen, D. B. Etzkorn, L. W. Lewis, B. L. Vinz, J. C. Wolf
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

Software reuse has been demonstrated to increase productivity, reduce costs and improve software quality. Most research in the area of extraction of reusable code from legacy code has concentrated on code created in the functional decomposition paradigm. However, in recent years much object-oriented code has been written. This paper describes a knowledge-based approach to the identification of reusable components in object-oriented legacy code.
Routing and wavelength assignment methods in single-hop all-optical networks with blocking
Authors: A. Birman, A. Kershenbaum
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2 (1995)

We consider single-hop all-optical networks in which wavelength-routed connections (lightpaths) between source-destination pairs are dynamically established and torn down in response to a random pattern of arriving connection requests and connection holding times. A connection request may be blocked if no wavelength is available on a suitable path from source to destination. For these networks we consider several methods for routing and wavelength assignment which combine in various ways three main principles: wavelength reservation, protecting threshold and alternate routes. The methods are evaluated and compared in two case studies. In this type of network the traffic over lightpaths consisting of multiple links is susceptible to high blocking probabilities, which can interfere with the quality of service requirements. It is shown that some of the routing and wavelength assignment methods studied have the potential to overcome this difficulty.
The Complexity Of Clerkship Scheduling
Authors: Jon Feldman
Venue:  (1997)

Medical students must complete a clerkship program in their fourth year. Individual students have preferences for the clerkships to which they are assigned. However, individual hospitals also have capacities on how many students may be assigned to each clerkship. The problem of scheduling medical students to clerkships is formalized. The problem is then placed in a theoretical framework, and the most general case of Clerkship Scheduling is proven NP-hard. A detailed approximation algorithm is given, and an implementation of this algorithm is discussed and tested. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Firstand Second-Order Lambda Calculi with Recursive Types
Authors: N. P. Mendler
Venue:  (1986)

Recursive types are added to the firstand second-order lambda calculi and the resulting typed terms are shown to be strongly normalizable. A necessary and sufficient condition for strong normalizability is given for unrestricted definitions of recursive types.
Multidomain load balancing
Authors: S. T. Chanson, Wantao Deng, Chi-Chung Hui, Xueyan Tang, Ming Yan To
Venue: Proceedings of the 2000 International Conference on Network Protocols (2000)

This paper investigates dynamic load balancing issues in the multidomain environment where local area networks (LANs) are interconnected by the Internet. Because of the much slower Internet communication speed and limited bandwidth, existing load balancing algorithms for LANs are unsuitable for the multidomain environment. New issues such as lag time in updating load information and network cost of transferring jobs must be addressed. To tackle these problems, the conventional least load scheduler is extended to the multidomain environment by employing a hierarchical structure, and several quick update techniques are proposed. Also, a heuristic taking both the machine load and the network cost into consideration is developed to evaluate the benefits of sending jobs to computers in different domains. A set of experiments conducted on the BALANCE testbed showed that the proposed techniques provide significant performance improvement over existing algorithms.
Sorting with Fixed-Length Reversals
Authors: T. Chen, Steven S. Skiena
Venue:  (1995)

We investigate the problem of sorting circular permutations of length $n$ using reversals of length $k$. Of interest is the connectivity and diameter of the underlying group. For all values of $n$ and $k$, we characterize the number of connected components of the underlying group. To bound the diameter of the group, we give an algorithm to sort all sortable circular permutations in $0(n^{2}/k+nk)$ reversals, and show that $\Omega(n^{2}/k^{2}+n)$ reversals are necessary.
Word Semantics for Information Retrieval: Moving One Step Closer to the Semantic Web
Authors: Rada F. Mihalcea, Silvana I. Mihalcea
Venue: Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence (2001)

The goal of the Semantic Web is to create a new form of Web content meaningful to computers. The Semantic Web aims to provide greater functionality, via intelligent tools such as information extractors, brokers, reasoning services or question answering systems. Semantics can be addressed at several levels. In this paper, we focus on the lowest level - word semantics on which other higher levels such as concept, paragraph, or document levels can be based upon. This model, which we call Word Semantics (WS), does not include the rich set of tags proposed by the XML/RDF standards. Nevertheless, this simpler WS format comes with a big advantage: it is possible with existing technologies and resources. Practically, this new model relies on understanding word meanings, identifying important named en-tities such as person, organization and others, and linking all this information via an external general purpose ontology, namely WordNet. With these features, we regard the WS model as a short but strong step toward the long term goal of a Semantic Web.
Image Retrieval Based on Regions of Interest
Authors: Khanh Vu Kien A. Hua, Wallapak Tavanapong
Venue: IEEE Transactions on Knowledge and Data Engineering (2003)

Query-by-example is the most popular query model in recent content-based image retrieval (CBIR) systems. A typical query image includes relevant objects (e.g., Eiffel Tower), but also irrelevant image areas (including background). The irrelevant areas limit the effectiveness of existing CBIR systems. To overcome this limitation, the system must be able to determine similarity based on relevant regions alone. We call this class of queries region-of-interest (ROI) queries and propose a technique for processing them in a sampling-based matching framework. A new similarity model is presented and an indexing technique for this new environment is proposed. Our experimental results confirm that traditional approaches, such as Local Color Histogram and Correlogram, suffer from the involvement of irrelevant regions. Our method can handle ROI queries and provide significantly better performance. We also assessed the performance of the proposed indexing technique. The results clearly show that our retrieval procedure is effective for large image data sets.
Cooperating leaky bucket for average rate enforcement of VBR video traffic in ATM networks
Authors: J. S. M. Ho, H. Uzunalioglu, I. F. Akyildiz
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 3)-Volume - Volume 3 (1995)

Because of the burstiness of video traffic, a very large sampling interval is needed to obtain acceptable cell loss probability. Previous studies reported very high cell loss probabilities for well-behaved sources when using the leaky bucket mechanism (LB) to police VBR video sources. In this paper, a mean rate policing mechanism called cooperating leaky bucket (CLB) is introduced. This mechanism can attain better cell loss probability by sharing the leaky buckets among all sources. In addition, it guarantees that the cell loss probability will never be higher than that obtained by LB. Depending on the number of traffic sources available, the cell loss probability can be significantly reduced when compared to LB. At the same time, the combined traffic entering the network is enforced to below the total negotiated traffic rate. Moreover, the additional overhead due to the implementation of CLB is minimal.
Complexity Analysis of Two Permutations Used by Fast Cosine Transform Algorithms
Authors: Sean S. B. Moore, Leonard F. Wisniewski
Venue:  (1995)

Recently developed fast cosine transform (FCT) algorithms require fewer operations than any other known general algorithm. Similar to related fast transform algorithms (e.g., the FFT), these algorithms permute the data before, during, or after the computation of the transform. The choice of this permutation may be an important consideration in reducing the complexity of the permutation algorithm. In this paper, we derive the complexity to generate the permutation mappings used in these FCT algorithms for power-of-2 data sets by representing them as linear index transformations and translating them into combinational circuits. Moreover, we show that one of these permutations not only allows efficient implementation, but is also self-invertible, i.e., we can use the same circuit to generate the permutation mapping for both the fast cosine transform and its inverse, like the bit-reversal permutation used by FFT algorithms. These results may be useful to designers of low-level algorithms for implementing fast cosine transforms.
Wavepacket Dynamics of Vibrational Quenching in Collisions of Kr and O2+
Authors: Evelyn M. Goldfield
Venue:  (1992)

Collisional quenching of vibrationally excited O2+ by Kr atoms is studied using time-dependent quantum mechanics with an emphasis on exploring the underlying mechanisms. Three dimensional solutions to the time-dependent Schodinger equation with zero total angular momentum are obtained at two values of the average collision energy 0.5eV and 0.1eV. At 0.4eV, the 1-<0 quenching probability is computed to be 0.091. The rotational distributions of the vibrationally quenched O2+ are highly bimodal. An analysis of "nascent" v=0 probability density reveals the origin of this bimodality and yields insight into the mechanisms of vibrational deexcitation. Comparisons are made to a corresponding classical study. Scattering at 0.1eV is complicated by the existence of overlapping resonances in addition to the direct scattering. Due to these resonances, the quenching probability is an extremely sensitive function of energy. An averaged quenching probability of 0.078 at 0.1eV is computed. Average resonance lifetimes of 2.5 3.5 ps are also obtained from an analysis of the temporal behavior of the dissociating wavepacket. The influence of the potential anistropy on the quenching probabilities is discussed. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Toward A Quantifiable Definition of Software Faults
Authors: John C. Munson, Allen P. Nikora
Venue: Proceedings of the 13th International Symposium on Software Reliability Engineering (2002)

An important aspect of developing models relatingthe number and type of faults in a software system to a setof structural measurement is defining what constitutes afault. By definition, a fault is a structural imperfection ina software system that may lead to the system's eventuallyfailing. A measurable and precise definition of whatfaults are makes it possible to accurately identify andcount them, which in turn allows the formulation of mod-elsrelating fault counts and types to other measurableattributes of a software system. Unfortunately, the mostwidely-used definitions are not measurable - there is noguarantee that two different individuals looking at thesame set of failure reports and the same set of fault definitionswill count the same number of underlying faults.The incomplete and ambiguous nature of current faultdefinitions adds a noise component to the inputs used in
Ada/CS An Instructional Subset of the Programming Language Ada
Authors: James E. Archer,  Jr.
Venue:  (1979)

NO SUPPLIED
A new classification for shell problems
Authors: Adel Blouza, Franco Brezzi, Carlo Lovadina
Venue:  (1999)

In considering the shell problem, two distinct classifications have been already proposed. The first one leads to call a shell membrane dominated or bending dominated if the space of inextensional displacements is reduced to the null element or not. This classification is independent of both the thickness and the loads applied to the shell. The second one, used in engineering practice, is simply based on a comparison between the bending energy term and the membrane energy term. It depends on both the thickness and the loads applied; its main drawback is that it is not rigorous. The purpose of this Note is to give a new rigorous shell classification, which depends on the loads, but it is independent of the thickness. Although we develop our theory only for Koiter shells, the same procedure can be used for other models, such as Naghdi''s one, for example. EMAIL:: lovadina@ing.unitn.it KEYWORDS:: Shells
Position-Annotated Photographs: A Geotemporal Web
Authors: Diomidis D. Spinellis
Venue: IEEE Pervasive Computing (2003)

The GTWeb system demonstrates how to create and present trip diaries by exploiting the synergies of integrating different information appliances and publicly accessible databases. A GTWeb site consists of a trip overview, timelines, maps, and annotated photographs. The site is created by processing a user's GPS track log and digital camera photographs, linking them with a gazetteer database, topography, and coastline data. GTWeb's use of consumer-grade appliances demonstrates that many interesting pervasive computing applications can be constructed by combining ordinary equipment in innovative ways.
Evaluation of Static Variable Ordering Heuristics for MDD Construction
Authors: Rolf Drechsler
Venue: Proceedings of the 32nd International Symposium on Multiple-Valued Logic (2002)

After designing of Multi-Valued Logic Networks (MVLNs), the resultingcircuits have to be verified to guarantee functional correctness. The mostpromising technique to cope with increasing device sizes are formalmethods. Ordered Multi-Valued Decision Diagrams (OMDDs) have beenproposed for formal verification of MVLNs. But OMDDs are very sensitiveto the chosen variable ordering and several ordering heuristics have beenproposed in the past. The most promising with respect to OMDD sizeare dynamic variable ordering techniques, but these algorithms often cannotbe applied in formal verification approaches due to their long runtimes.Alternatively, static variable ordering heuristics have been developedthat determine an ordering from the circuit topology, but theseheuristics often cannot guarantee good quality.In this paper an evaluation technique is proposed that uses a pool ofstatic variable ordering heuristics. Each heuristic is applied andthe OMDD construction is started until a node or time limit is reached.Then the heuristic performed best so far is selected for the completeconstruction. The choice of the node and time limit allows to smoothlytrade off runtime vs. quality. Experimental results are given todemonstrate the efficiency of the approach. The technique allows to savetime and memory, since only promising orders are considered.
Communication scheduling in a distributed memory parallel interactive continuous media server system
Authors: Reinhard Lüling, Francisco Cortés Gómez
Venue: Proceedings of the 1998 International Conference on Parallel Processing Workshops (1998)

This paper describes the design of a scaleable interactivecontinuous media server that is realized using a distributedmemory parallel computer architectures. We presenta scheme for data layout, admission control and communicationscheduling that provides inherent Quality of Servicesupport for the delivery of continuous media streamsfrom the storage devices to the external communication interfaceswithin the internal communication network of themedia server.The methods presented here are used for the developmentof a parallel continuous media server that is integrated withdifferent applications and supports the RTP/RTCP protocolfor data delivery as well as the RTSP protocol to control thedelivery of media streams.