ppxscal/embedding_network huggingface dataset:
Critical Reading For Software Developers
Authors: Michael Jackson
Venue: IEEE Software (1995)

Michael Jackson¿s new book is full of important and refreshing insights into what we do and why we do it. This excerpt from his new book, Software Requirements & Specifications: A Lexicon of Practice, Principles, and Prejudices (Addison-Wesley, 1995) suggests that we reexamine our connections to the real world.¿Shari Lawrence Pfleeger 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
MCSE Windows NT Workstation 4 for Dummies Training Kit with CD-ROM
Authors: Dummies Technology Press
Venue:  (1999)

:MCSE For Dummies Training Kits are Jam-Packed with Test Prep Tools! Introducing the ultimate.For Dummies MCSE test prep tool. The centerpiece of each MCSE Training Kit is the original Certification For Dummies study guide - The Fun and Easy Way to prepare for each MCSE exam. Plus each training kit contains the original software - the versatile Dummies test engine and QuickLearn sci-fi game. Inside every MCSE Training Kit, you will get even more, including: A CD-ROM with an evaluation edition of the software covered in the test or other valuable software relevant to the topic A 64 -page scenario book with step-by-step exercises listed by objective An audio CD with up to 70 minutes of verbal questions and answers - perfect for practice in the car or at the gym Sento mentoring coupon for two free online Q&A's with Sento staff Each MCSE For Dummies Training Kit includes MCSE Certification For Dummies book, scenario book, and 3 CD-ROMs. Reader level: Intermediate-Advanced
The Need for Openness in Standards
Authors: Ken Krechmer
Venue: Computer (2001)

A standardization project's openness affects the resulting standard's value.
Optical Fingerprinting to Protect Data: A Proposal
Authors: Nachiketh R. Potlapally
Venue: Computer (2002)

The pervasive use of optical discs-the preferred media for storing and distributing digital information-is motivated by their low cost, versatility,and durability. Unfortunately, circuit technology advances have made it easyto create high-fidelity copies of these discs. The trend toward progressive easeof disc copying has spawned a burgeoning parallel economy based on illegal software copying and merchandizing.Thor is a proposed security scheme to prevent unauthorized disc duplication and illegal use of the data. Thor relies on a combination of software and hardware strategies using time-tested cryptographic algorithms to provide resistance to tampering and malicious operations.
Finite-element analysis of frictionless contact problem for a laminated medium
Authors: Zahir Seyidmamedov
Venue: Mathematics and Computers in Simulation (2002)

A finite-element method is developed to study interlaminar stress effects for the multilayered isotropic medium subjected to in-plane loads. Unilateral boundary value problem formulation is presented. Variational finite difference equations obtained from the finite-element discretization are derived for boundary as well as transmission conditions. This permits to analyze interlaminar normal and tangential stress distributions. An influence of geometrical and physical parameters of the multilaered media lo the interlaminar stresses is discussed.
Contributed Articles: Operators Considered Harmful
Authors: Martin Gfeller
Venue: ACM SIGAPL APL Quote Quad (1986)

The distinction between operators and functions is shown to be arbitrary and complicated. An unification of those two object classes is proposed. Consequences for syntax and representation of functions are considered. Arrays of functions are shown to be a natural consequence of the unification.The paper is based on the terminology used in "Rationalized APL" [Iverson 83a]. Knowledge of this work is assumed. F,G,H denote functions, A, alpha;, omega; arrays. Index origin is 1 in the refined language and throughout this paper.
3D Graphics Processor Chip Set
Authors: Makoto Awaga, Tatsushi Ohtsuka, Hideki Yoshizawa, Shigeru Sasaki
Venue: IEEE Micro (1995)

Our three-dimensional graphics processor chip set contains a geometric conversion processor (TGPx4) and a rendering processor (AGP). In the minimum configuration (one TGPx4 and one AGP), this chip set has achieved a sustained performance of 300K polygons per second (flat-shaded triangles), which is the same performance level achieved by state-of-the-art game machines. Depending upon system requirements, the 3D graphics processor chip set also offers an easy-to-use interface method for scaling performance by connecting multiple chips together.
Fast parallel heuristics for the job shop scheduling problem
Authors: K. Steinhöfel, A. Albrecht, C. K. Wong
Venue: Computers and Operations Research (2002)

The paper is dealing with parallelized versions of simulated annealing-based heuristics for the classical job shop scheduling problem. The scheduling problem is represented by the disjunctive graph model and the objective is to minimize the length of longest paths. The problem is formulated for l jobs where each job has to process exactly one task on each of the m machines. The calculation of longest paths is the critical computation step of our heuristics and we utilize a parallel algorithm for this particular problem where we take into account the specific properties of job shop scheduling. In our heuristics, we employ a neighborhood relation which was introduced by Van Laarhoven et al. (Operations Research 40(1) (1992) 113-25). To obtain a neighbor, a single arc from a longest path is reversed and these transition steps always guarantee the feasibility of schedules. We designed two cooling schedules for homogeneous Markov chains and additionally we investigated a logarithmic cooling schedule for inhomogeneous Markov chains. Given O(n3) processors and a known npper bound Λ = Λ(l, m) for the length of longest paths, the expected run-times of parallelized versions are O(n log n log Λ) for the first cooling schedule and O(n2(log3/2 n)m1/2 log Λ) for the second cooling schedule, where n = lm is the number of tasks. For the logarithmic cooling schedule, a speed-up of O(n/(log n log Λ)) can be achieved. When Markov chains of constant length are assumed, we obtain a polylogarithmic run-time of O(log n log Λ) for the first cooling schedule. The analysis of famous benchmark problems led us to the conjecture that Λ ≤ O(l + m) could be a uniform upper bound for the completion time of job shop scheduling problems with l jobs on m machines. Although the number of processors is very large, the particular processors are extremely simple and the parallel processing system is suitable for hardware implementations.
M32R/D-Integrating DRAM and Microprocessor
Authors: Yasuhiro Nunomura, Toru Shimizu, Osamu Tomisawa
Venue: IEEE Micro (1997)

Since the invention of the integrated circuit, many systems have been implemented by using IC, LSI and VLSI technologies. The design objective has been to realize systems which have high performance, high reliability, low power dissipation and low cost. Despite the rapid progress of semiconductor technology for microprocessors, logic, and DRAM, the integration of DRAM and processor has not been realized so far. This paper describes the implementation of a 32-bit RISC processor with embedded DRAM on one chip. This provides a high performance system component with low power dissipation, in other words, low processing energy components. In addition, this design provides the system designer with great flexibility. For example, JPEG decoding of full VGA can be realized in less than 0.5 sec by software using this chip, so that designers may eliminate the JPEG hardware module from a system.
Checkpointing for Optimistic Concurrency Control Methods
Authors: Alexander Thomasian
Venue: IEEE Transactions on Knowledge and Data Engineering (1995)

Restart-oriented concurrency control (CC) methods, such as optimistic CC, outperform blocking-oriented methods, such as standard two-phase locking in a high data contention environment, but this is at the cost of wasted processing due to restarts. Volatile savepoints are considered in this study as a method to reduce this wasted processing and to improve response time. There is the usual tradeoff between the checkpointing overhead and the wasted processing when a transaction is restarted. Our study shows that in a system where objects are accessed and updated uniformly during the lifetime of transactions, significant improvement in performance at high data conflict levels are attainable only when checkpointing cost is low. This implies few optimally placed checkpoints per transaction. It is observed that checkpointing may result in a significant improvement in performance when accesses to database hot-spots are deferred to the final steps of transaction execution. The parametric studies reported in this paper are facilitated by closed form analytic solutions expressing system performance, as well as an iterative solution which takes into account hardware resource contention in addition to data contention.
Wind tunnel data fusion and immersive visualization: a case study
Authors: Kurt Severance, Paul Brewster, Barry Lazos, Daniel Keefe
Venue: Proceedings of the conference on Visualization '01 (2001)

This case study describes the process of fusing the data from several wind tunnel experiments into a single coherent visualization. Each experiment was conducted independently and was designed to explore different flow features around airplane landing gear. In the past, it would have been very difficult to correlate results from the different experiments. However, with a single 3-D visualization representing the fusion of the three experiments, significant insight into the composite flowfield was observed that would have been extremely difficult to obtain by studying its component parts. The results are even more compelling when viewed in an immersive environment.
Performance comparison of index structures for multi-key retrieval
Authors: Hans-Peter Kriegel
Venue: Proceedings of the 1984 ACM SIGMOD international conference on Management of data (1984)

In this paper, we report on a performance comparison of four software implemented index structures for multi-key retrieval the inverted file, the grid file and two variants of multidimensional B-trees It turns out that the recently suggested structures multidimensional B-tree and grid file outperform the traditional inverted file
MovieLens unplugged: experiences with an occasionally connected recommender system
Authors: Bradley N. Miller, Istvan Albert, Shyong K. Lam, Joseph A. Konstan, John Riedl
Venue: Proceedings of the 8th international conference on Intelligent user interfaces (2003)

Recommender systems have changed the way people shop online. Recommender systems on wireless mobile devices may have the same impact on the way people shop in stores. We present our experience with implementing a recommender system on a PDA that is occasionally connected to the network. This interface helps users of the MovieLens movie recommendation service select movies to rent, buy, or see while away from their computer. The results of a nine month field study show that although there are several challenges to overcome, mobile recommender systems have the potential to provide value to their users today
Simulation based test generation for scan designs
Authors: Irith Pomeranz, Sudhakar M. Reddy
Venue: Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design (2000)

We describe a simulation-based test generation procedure for scan designs. A test sequence generated by this procedure consists of a sequence of one or more primary input vectors embedded between a scan-in operation and a scan-out operation. We consider the set of faults that can be detected by test sequences of this form, compared to the case where scan is applied with every test vector. The proposed procedure constructs test sequences that traverse as many pairs of fault-free/faulty states as possible, and thus avoids the use of branch-and-bound test generation techniques. Additional techniques are incorporated into this basic procedure to enhance its effectiveness.
Biologically Plausible Associative Memory: Continuous Unit Response + Stochastic Dynamics
Authors: Enrique C. Segura Meccia, Roberto P. J. Perazzo
Venue: Neural Processing Letters (2002)

A neural network model of associative memory is presented which unifies the two historically more relevant enhancements to the basic Little-Hopfield discrete model: the graded response units approach and the stochastic, Glauber-inspired model with a random field representing thermal fluctuations. This is done by casting the retrieval process of the model with graded response neurons, into the framework of a diffusive process governed by the Fokker-Plank equation, which leads to a Langevin system describing the process at a microscopic level, while the time evolution of the probability density function is governed by a multivariate Fokker Planck equation operating over the space of all possible activation patterns. The present unified approach has two notable features: (i) greater biological plausibility and (ii) ability to escape local minima of energy (associated with spurious memories), which makes it a potential tool for those complex optimization problems for which the previous models failed.
On the influence of numerical boundary conditions
Authors: Ercília Sousa, Ian Sobey
Venue: Applied Numerical Mathematics (2002)

Our understanding about the behaviour of numerical solutions for evolutionary convection-diffusion equations is mainly based on analysis of infinite domains situations with stability given by yon Neumann analysis. Almost all practical problems involve physical domains with boundaries. For evolution problems with Dirichlet boundary conditions, some algorithms can be used without alteration near a boundary. However, the application of higher order methods such as Quickest or second order upwinding introduces difficulty near an inflow boundary, since for interior points adjacent to the boundary there are insufficient upstream points for the high order scheme to be applied without alteration. For that reason such methods require a careful treatment on the inflow boundary, where additional numerical boundary conditions have to be introduced. The choice of numerical boundary conditions turns out to be crucial for stability. A test problem is described, showing the practical advantages of some numerical boundary conditions versus the others by comparison with an exact solution.
Characterizing the Performance of Algorithms for Lock-Free Objects
Authors: Theodore Johnson
Venue: IEEE Transactions on Computers (1995)

Concurrent access to shared data objects must be regulated by a concurrency control protocol to ensure correctness. Many concurrency control protocols require that a process set a lock on the data it accesses. Recently, there has been considerable interest in lock-free concurrency control algorithms. Lock-free algorithms offer the potential for better system performance because slow or failed processes do not block fast processes. Process ¿slowdowns¿ can occur due to cache line faults, memory and bus contention, page faults, context switching, NUMA architectures, heterogeneous architectures, or differences in operation execution time. Much work has been done to characterize the performance of locking algorithms, but little has been done to characterize the performance of lock-free algorithms. In this paper, we present a performance model for analyzing lock-free algorithms that studies the effects of slowdowns on performance. We find that lock-free algorithms are better than locking algorithms if the slowdowns are transient, but worse if the slowdowns are permanent. One implication of this result is that lock-free concurrent objects are appropriate for UMA architectures, but NUMA architectures require special protocols.
Automating the Construction of Large-Scale Virtual Worlds
Authors: Michael F. Polis, Stephen J. Gifford, David M. McKeown Jr.
Venue: Computer (1995)

Interest is increasing in virtual world databases that can maintain a high degree of fidelity with respect to the actual three-dimensional environment. Compiling these spatial databases requires integrating information from a variety of sources, including digital map data, remotely sensed imagery, detailed line drawings, and ground-based photography. One factor that currently limits development of such systems is the lack of terrain and environmental data at the level of detail required for ground-based simulations. The authors address two important issues in automating the construction of large scale virtual worlds: the process by which various sources of spatial data can be brought together into a common representation framework and how this data can be automatically transformed into an efficient representation of the underlying virtual world suitable for graphical presentation. Key areas in the system architecture for virtual world construction include automated cartographic feature extraction, triangulated irregular network (TIN) generation, and road correction. The authors describe various terrain models and TIN construction techniques, while discussing TIN generation in some existing digital elevation models. They also illustrate transportation network integration, explaining how road network polygons are combined with corresponding bare-earth TINs. They discuss how to avoid simulator overload and how to update source material with new information extracted from imagery. And they present virtual world construction results from simulation databases.
IBM's S/390 G5 Microprocessor Design
Authors: Timothy J. Slegel, Robert M. Averill III, Mark A. Check, Bruce C. Giamei, Barry W. Krumm, Christopher A. Krygowski, Wen H. Li, John S. Liptay, John D. MacDougall, Thomas J. McPherson, Jennifer A. Navarro, Eric M. Schwarz, Kevin Shum, Charles F. Webb
Venue: IEEE Micro (1999)

The S/390 G5, the latest generation IBM mainframe system, more than doubles the performance of its predecessor. The microprocessor used in the system is a sophisticated CISC processor that features a large cache and a very high clock frequency to achieve excellent performance. We discuss the microarchitecture of the processor followed by a description of how this processor is integrated into the system. Finally, we consider the state-of-the-art reliability and availability features that make this mainframe system unique.
The Impact of Optics on Data and Knowledge Base Systems
Authors: P. B. Berra, A. Ghafoor, P. A. Mitkas, S. J. Marcinkowski, M. Guizani
Venue: IEEE Transactions on Knowledge and Data Engineering (1989)

The authors assess the possible impact of optics on database and knowledge base systems, focusing on storage, interconnection, and processing. Various types of optical disks and page-oriented holographic memories are discussed. In the interconnection section, data communication is discussed at a variety of levels. Under processing, applications involving optical content addressable memories, optical data/knowledge base machines, and optics applied to full text processing will be optoelectronic, with easy technology providing its strength to the problem under consideration. It is noted that optical interconnection is superior to electronic interconnection in many cases and that the rapid advance of optical storage holds the potential of hundreds of megabytes per second data rates from a single storage unit. It is noted that optical processing holds considerable promise but lags behind primarily because digital optical device development is in its infancy.
Capturing the spatio-temporal behavior of real traffic data
Authors: Mengzhi Wang, Anastassia Ailamaki, Christos Faloutsos
Venue: Performance Evaluation (2002)

Traffic data, such as disk and memory accesses, typically exhibits burstiness, temporal locality, and spatial locality. However, except for qualitative speculations, it is not even known how to measure the spatio-temporal correlation, let alone how to re-produce it realistically. In this paper, we propose the "entropy plots" to quantify the correlation and develop a new statistical model, the "PQRS" model, to capture the burstiness and correlation of the real spatio-temporal traffic. Moreover, the model requires very few parameters and offers linear scalability. Experiments with multiple real data sets show that our model can mimic real traces very well.
ETM10 Incorporates Hardware Segment of IEEE P1500
Authors: Teresa McLaurin, Souvik Ghosh
Venue: IEEE Design Test (2002)

Engineers at ARM have used the ETM10 to incorporate the hardware segment of the IEEE P1500 standard. The experiment's first phase incorporated the wrapper boundary register, wrapper bypass register, wrapper instruction register, and some standard instructions.
Evasive random walks and the clairvoyant demon
Authors: Aaron Abrams, Henry Landau Zeph Landau, James Pommersheim, Eric Zaslow
Venue: Random Structures Algorithms (2002)

A pair of random walks (R, S) on the vertices of a graph G is successful if two tokens moving one at a time can be scheduled (moving only one token at a time) to travel along R and S without colliding. We consider questions related to P. Winkler's clairvoyant demon problem, which asks whether for random walks R and S on G, Pr[(R, S) is successful] > 0. We introduce the notion of an evasive walk on G: a walk S so that for a random walk R on G, Pr[(R, S) is successful] > 0. We characterize graphs G having evasive walks, giving explicit constructions on such G. Also, we show that on a cycle, the tokens must collide quickly with high probability.
Customizing Transaction Models and Mechanisms in a Programmable Environment Supporting Reliable Workflow Automation
Authors: Dimitrios Georgakopoulos, Mark F. Hornick, Frank Manola
Venue: IEEE Transactions on Knowledge and Data Engineering (1996)

A Transaction Specification and Management Environment (TSME) is a programmable system that supports implementation-independent specification of application-specific extended transaction models (ETMs) and configuration of transaction management mechanisms (TMMs) to enforce specified ETMs. The TSME can ensure correctness and reliability while allowing the functionality required by workflows and other advanced applications that require access to multiple heterogeneous, autonomous, and/or distributed (HAD) systems. To support ETM specification, the TSME provides a transaction specification language that describes dependencies between transactions. Unlike other ETM specification languages, TSME's dependency descriptors use a common set of primitives, and are enforceable, i.e., can be evaluated at any time during transaction execution to determine whether operations issued violate ETM specifications. To determine whether an ETM can be enforced in a specific HAD system environment, the TSME supports specification of the transactional capabilities of HAD systems, and comparison of these with ETM specifications to determine mismatches. To enforce ETMs that are more restrictive than those supported by the union of the transactional capabilities of HAD systems, the TSME provides a collection of transactional services. These services are programmable and configurable, i.e., they accept instructions that change their behavior as required by an ETM and can be combined in specific ways to create a run-time TMM capable of enforcing the ETM. We discuss the TSME in the context of a distributed object management system. We give ETM specification examples and describe corresponding TMM configurations for a telecommunications application.