ppxscal/embedding_network huggingface dataset:
A GIS method for reconstruction of late quaternary landscapes from isobase data and modern topography
Authors: David W. Leverington, James T. Teller, Jason D. Mann
Venue: Computers Geosciences (2002)

Digital reconstructions of late Quaternary landscapes can be produced using a geographic information system (GIS) method that subtracts interpolated isobase values from modern elevations and bathymetry. The principal utility of the GIS method for reconstructing late Quaternary landscapes is in the relative ease and rapidity with which high-resolution, quantitative, and georeferenced databases of paleo-topography can be generated. These databases can be used for many purposes, including the generation of paleo-topographic maps, the estimation of the areas and volumes of individual water bodies and landforms, and the approximation of paleo-shoreline positions. GIS-based estimates of the dimensions of water bodies and landforms can be used to help constrain hydrological and climatic models of the late Quaternary.
SAP Blue Book, A Concise Business Guide to the World of SAP
Authors: Michael Doane
Venue:  (1998)

:This is the first and only book about SAP for executives, managers, consultants, and the vast arena of business people whose stake in SAP is neither technical nor limited to end-user concerns. "The writing is excellent. The history of SAP is so easy to read and informative. Experienced folks will appreciate the review, and 'novices' will find it clear and entertaining. This is a seriously good book!" Jon Reed of Allen Davis & Associates "A sourcebook that both informs and de-mystifies the phenomenon of SAP. Filled with charts, tables, case studies, and more than a touch of humor." Nancy Bancroft, author of Implementing SAP R/3 (Prentice Hall, 1997) 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
Efficient Placement of Parity and Data to Tolerate Two Disk Failures in Disk Array Systems
Authors: Chan-Ik Park
Venue: IEEE Transactions on Parallel and Distributed Systems (1995)

In this paper, we deal with the data/parity placement problem which is described as follows: how to place data and parity evenly across disks in order to tolerate two disk failures, given the number of disks N and the redundancy rate p which represents the amount of disk spaces to store parity information. To begin with, we transform the data/parity placement problem into the problem of constructing an N×N matrix such that the matrix will correspond to a solution to the problem. The method to construct a matrix has been proposed and we have shown how our method works through several illustrative examples. It is also shown that any matrix constructed by our proposed method can be mapped into a solution to the placement problem if a certain condition holds between N and p where N is the number of disks and p is a redundancy rate.
Visual importance-biased image synthesis animation
Authors: Ross Brown, Binh Pham, Anthony Maeder
Venue: Proceedings of the 1st international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2003)

Present ray tracing algorithms are computationally intensive, requiring hours of computing time for complex scenes. Our previous work has dealt with the development of an overall approach to the application of visual attention to progressive and adaptive ray-tracing techniques. The approach facilitates large computational savings by modulating the supersampling rates in an image by the visual importance of the region being rendered.This paper extends the approach by incorporating temporal changes into the models and techniques developed, as it is expected that further efficiency savings can be reaped for animated scenes. Applications for this approach include entertainment, visualisation and simulation.
Truly distribution-independent algorithms for the N-body problem
Authors: Srinivas Aluru, G. M. Prabhu, John Gustafson
Venue: Proceedings of the 1994 ACM/IEEE conference on Supercomputing (1994)

The N-body problem is to simulate the motion of N particles under the influence of mutual force fields based on an inverse square law. Greengard's algorithm claims to compute the cumulative force on each particle in O(N) time for a fixed precision irrespective of the distribution of the particles. In this paper, we show that Greengard's algorithm is distribution dependent and has a lower bound of &Omega;(N log2 N) in two dimensions and &Omega;(N log4 N) in three dimensions. We analyze the Greengard and Barnes-Hut algorithms and show that they are unbounded for arbitrary distributions. We also present a truly distribution independent algorithm for solving the N-body problem in O(N log N) time in two dimensions and in O(N log2 N) time in three dimensions.
Reduced Length Checking Sequences
Authors: Robert M. Hierons, Hasan Ural
Venue: IEEE Transactions on Computers (2002)

Here, the method proposed in [13] for constructing minimal-length checking sequences based on distinguishing sequences is improved. The improvement is based on optimizations of the state recognition sequences and their use in constructing test segments. It is shown that the proposed improvement further reduces the length of checking sequences produced from minimal, completely specified, and deterministic finite state machines.
QUADRO: a program to estimate principal curvatures of folds
Authors: Sait Ismail Ozkaya
Venue: Computers Geosciences (2002)

Determination of curvature of structural surfaces is a method for estimating apertures and the fluid-flow potential of opening mode fractures that are associated with folding. Curvature is usually calculated within a sliding window over a structural surface and presented as a function of map location. The exceptions are where a pair of minimum and maximum curvatures is needed for an entire fold structure. QUADRO program calculates this by fitting a quadratic trend surface to the fold. The magnitude and direction of the principal curvatures are given by eigenvalues and eigenvectors of the second derivative for the quadratic surface. Once the minimum and maximum curvatures are calculated some additional structural indicators such as Gaussian curvature can be determined and the direction of fold-related fracture sets are identified.
Smarter Memory: Improving Bandwidth for Streamed References
Authors: Sally A. McKee, Robert H. Klenke, Kenneth L. Wright, William A. Wulf, Maximo H. Salinas, James H. Aylor, Alan P. Batson
Venue: Computer (1998)

Memory speeds have not kept up with processor speeds. More precisely, DRAM latency has not kept pace: Processor speeds have been increasing by at least 70 percent per year, while DRAM latency has improved only 7 percent annually. As a result, a contemporary superscalar 300-MHz DEC Alpha system with a 40-ns DRAM can perform at least 24 instructions in the time it takes to access its memory just once. In a few years, if current trends continue, the number of instructions per access could increase to a thousand. Fortunately, memory bandwidth is another matter. Wider buses, multiple banks, more pins, the integrated circuit properties of DRAMs (such as static-column mode and on-chip cache), and the newer Rambus and synchronous DRAM have all contributed to band-widths that have scaled better than latency. A central problem for memory system designers is how to exploit this bandwidth to achieve lower latencies. In this article, we describe a technique that can convert more than 90 percent of a memory system's bandwidth into low-latency accesses, at least for a particular class of computations.The scheme nicely complements traditional caching in two ways: It handles frequently occurring memory reference patterns for which caches do not perform well and-by removing this problematic data from the cache-it reduces pollution, making the cache more effective for the remaining references.
A Note on the Griewank Test Function
Authors: M. Locatelli
Venue: Journal of Global Optimization (2003)

In this paper we analyze a widely employed test function for global optimization, the Griewank function. While this function has an exponentially increasing number of local minima as its dimension increases, it turns out that a simple Multistart algorithm is able to detect its global minimum more and more easily as the dimension increases. A justification of this counterintuitive behavior is given. Some modifications of the Griewank function are also proposed in order to make it challenging also for large dimensions.
Expert Focus: Rapid Prototyping Languages and Expert Systems
Authors: Luqi
Venue: IEEE Expert: Intelligent Systems and Their Applications (1989)

Discusses the principles of language support for rapid prototyping, based on the experience in designing a prototyping language and conducting feasibility studies for its implementation over the past five years. Examines some basic issues involved in the design of a rapid prototyping language, paying special attention to issues involving expert system prototyping. Considers how expert system techniques can influence prototyping languages and how a common prototyping language can interface with Ada.
Libre Software for Computer Science Classes
Authors: Jesús M. González-Barahona, Pedro de-las-Heras-Quirós, José Centeno-González, Vicente Matellán-Olivera, Francisco J. Ballesteros
Venue: IEEE Software (2000)

The authors describe their early experiences using 386BSD to teach computer science classes at Spain's Carlos III University and discuss the lessons they've learned. They also review their reasons for using libre software for practical computer science teaching.
Hardware Requirements for Neural Network Pattern Classifiers: A Case Study and Implementation
Authors: Bernard E. Boser, Eduard Sackinger, Jane Bromley, Yann leCun, Lawrence D. Jackel
Venue: IEEE Micro (1992)

A special-purpose chip, optimized for computational needs of neural networks and performing over 2000 multiplications and additions simultaneously, is described. Its data path is particularly suitable for the convolutional architectures typical in pattern classification networks but can also be configured for fully connected or feedback topologies. A development system permits rapid prototyping of new applications and analysis of the impact of the specialized hardware on system performance. The power and flexibility of the processor are demonstrated with a neural network for handwritten character recognition containing over 133000 connections.
A Survey of Configurable, Component-Based Operating Systems for Embedded Applications
Authors: L. Fernando Friedrich, John Stankovic, Marty Humphrey, Michael Marley, John Haskins
Venue: IEEE Micro (2001)

Component-based software is becoming an increasingly popular technology as a means for creating complex software systems by assembling off-the-shelf building blocks. However, many of the component-based methodologies that use large components fail to address issues of size, real-time performance, power, and cost, as well as problems associated with the configuration process itself. These issues are critical for using components in embedded systems.
MURJE: a multiple user remote job entry system
Authors: James M. Hobbs, Jon Todd Rickman
Venue: Proceedings of the 7th annual ACM SIGUCCS conference on User services (1979)

MURJE is a DEC 2780 RJE package modified at Northwest Missouri State University allowing anyone who has a timesharing account on the University's PDP 11/70 timesharing computer to submit and receive batch jobs processed on a AMDAHL 470/V7 processor running under JES2 (OS,VS2). Jobs can be sent and received at any of the 58 terminals within 10 academic labs on campus. Even portable dial up terminals can use the system.The AMDAHL in Columbia, Missouri, is the host computer, while the PDP 11/70 interactive network in Maryville, Missouri, is considered the remote station. The advantages the remote users receive in such an environment includes both the large capacity and multitude of batch languages provided by the host. This is especially important where the remote has a limited but real demand for these services. The amount of use of the services would not however, financially justify their local support (see figure 1).Using a text editor, files containing the job control language, program, and possibly the data are created and stored on the remote's disk. These files are then queued by the user to the host. Remote host communication is via a 4800 baud private telephone line. Basically the AMDAHL is operational 24 hours a day, 6 1/2 days a week and MURJE makes it possible for anyone at these times to send a job to the host computer and receive the output in their private account.By having the software direct the RJE input and output from multiple user accounts, it frees up operators from running, printing, and handling output for RJE jobs. At the same time it frees the sender from extended waits for an operator to submit jobs and distribute output listings at some type of user dispatch window. The user does not go to the computing center to pick up the listing of his or her program, and is not limited to a single copy of the output.Another savings is the amount of paper that is required for output, since the output is stored on disk, available only to the sender, the sender has the capability of displaying the output on any video terminal as in figure 2, and checking its correctness before listing it on a hardcopy terminal or printer as in figure 3.
The Generation of a Class of Multipliers: Synthesizing Highly Parallel Algorithms in VLSI
Authors: M. C. Chen
Venue: IEEE Transactions on Computers (1988)

A synthesis method for designing highly parallel algorithms in VLSI is presented. To illustrate the method, the familiar long multiplication algorithm for binary numbers is used. This algorithm is specified in the language Crystal, a very-high-level language for parallel processing. A total of 18 designs are derived from this specification. Each is optimal within its own class, which is characterized by a space-time map. The relative merits and tradeoffs of different designs are systematically compared and evaluated.
A Methodology for Integration of Heterogeneous Databases
Authors: M. P. Reddy, B. E. Prasad, P. G. Reddy
Venue: IEEE Transactions on Knowledge and Data Engineering (1994)

The transformation of existing local databases to meet diverse application needs at the global level is performed through a four-layered procedure that stresses total schema integration and virtual integration of local databases. The proposed methodology covers both schema integration and database integration, and uses a four-layered schema architecture (local schemata, local object schemata, global schema, and global view schemata) with each layer presenting an integrated view of the concepts that characterize the layer below. Mechanisms for accomplishing this objective are presented in theoretical terms, along with a running example. Object equivalence classes, property equivalence classes, and other related concepts are discussed in the context of logical integration of heterogeneous schemata, while object instance equivalence classes and property instance equivalence classes, and other related concepts are discussed for data integration purposes. The proposed methodology resolves naming conflicts, scaling conflicts, type conflicts, and level of abstraction, and other types of conflicts during schema integration, and data inconsistencies during data integration.
Singular Trajectories in Multi-Input Time-Optimal Problems: Application to Controlled Mechanical Systems
Authors: M. Chyba, N. E. Leonard, E. D. Sontag
Venue: Journal of Dynamical and Control Systems (2003)

This paper deals with the time-optimal control problem for a class of control systems which includes controlled mechanical systems with possible dissipation terms. The Lie algebras associated with such mechanical systems have certain special properties. These properties are explored and used in conjunction with the Pontryagin maximum principle to determine the structure of singular extremals and, in particular, time-optimal trajectories. The theory is illustrated by an application to a time-optimal problem for a class of underwater vehicles.
Adaptive multi-channel least mean square and Newton algorithms for blind channel identification
Authors: Yiteng Arden Huang, Jacob Benesty
Venue: Signal Processing (2002)

The problem of identifying a single-input multiple-output FIR system without a training signal, the so-called blind system identification, is addressed and two multi-channel adaptive approaches, least mean square and Newton algorithms, are proposed. In contrast to the existing batch blind channel identification schemes, the proposed algorithms construct an error signal based on the cross relations between different channels in a novel, systematic way. The corresponding cost (error) function is easy to manipulate and facilitates the use of adaptive filtering methods for an efficient blind channel identification scheme. It is theoretically shown and empirically demonstrated by numerical studies that the proposed algorithms converge in the mean to the desired channel impulse responses for an identifiable system.
Application-specific protocols for user-level shared memory
Authors: Babak Falsafi, Alvin R. Lebeck, Steven K. Reinhardt, Ioannis Schoinas, Mark D. Hill, James R. Larus, Anne Rogers, David A. Wood
Venue: Proceedings of the 1994 ACM/IEEE conference on Supercomputing (1994)

Recent distributed shared memory (DSM) systems and proposed shared-memory machines have implemented some or all of their cache coherence protocols in software. One way to exploit the flexibility of this software is to tailor a coherence protocol to match an application's communication patterns and memory semantics. This paper presents evidence that this approach can lead to large performance improvements. It shows that application-specific protocols substantially improved the performance of three application programs--appbt, em3d, and barnes--over carefully tuned transparent shared memory implementations. The speed-ups were obtained on Blizzard, a fine-grained DSM system running on a 32-node Thinking Machines CM-5.
Existence of frame SOLS of type anb1
Authors: Y. Xu, H. Zhang, L. Zhu
Venue: Discrete Mathematics (2002)

An SOLS (self-orthogonal latin square) of order υ with ni missing sub-SOLS (holes) of order hi (1 ≤ i ≤ k), which are disjoint and spanning (i.e. Σj=1k nihi = υ), is called a frame SOLS and denoted by FSOLS (h1n1 h2n2... hknk). It has been proved that for b ≥ 2 and n odd, an FSOLS(anb1) exists if and only if n ≥ 4 and n ≥ 1 + 2b/a. In this paper, we show the existence of FSOLS(anb1) for n even and FSOLS(an11) for n odd.
Tree-Structured Multiple Description Coding
Authors: Jean Cardinal
Venue: Journal of VLSI Signal Processing Systems (2003)

Multiple description coding aims at transmitting two mutually refinable descriptions of a signal on two different communication channels. It is successfully applied to transmission of sound and images on diversity systems or packet-switched networks. We present novel algorithms for the design of multiply descriptive tree-structured vector quantizers with linear encoding complexity that improve on our previously published methods. These algorithms allow for both the rates and distortions constraints in a natural way and are shown to yield quantizers that are competitive with full-search codes in terms of rate-distortion performance. We also present a generalization of the scheme to more than two channels.
The internet: a virtually untapped tool for research
Authors: Danielle M. Murray, Jeffrey D. Fisher
Venue: Journal of Technology in Human Services (2002)

Internet methodologies are often overlooked in research. This review presents evidence that using the Internet to recruit participants and collect data is not only feasible, but may also be less expensive and time-consuming than traditional data collection methods. Additionally, Internet data collection can yield a more representative participant sample than more traditional data collection methods, while retaining equivalent, if not better, psychometric properties. Different areas of research that could benefit from the use of the Internet-based methods are explored. Overall benefits of Internet-based data collection, and practical limitations and how to overcome them, are discussed.
Effectiveness of Microarchitecture Test Program Generation
Authors: Noppanunt Utamaphethai, R. D. Shawn Blanton, John Paul Shen
Venue: IEEE Design Test (2000)

The effectiveness of microarchitecture test program generation (MTPG) within the buffer-oriented microarchitecture validation (BMV) methodology is presented. A list of design errors typically encountered in industry is investigated to determine if our microarchitecture test programs can detect them. Two metrics are used to determine design error coverage: Functional deviation ( f ) is the discrepancy in coverage of our microarchitecture model when simulating the incorrect and error-free designs. Timing deviation ( t) is the discrepancy in the number of cycles needed to simulate a test program between the incorrect and error-free designs. Simulation results show that our test programs detect over 98% of the design errors based on the two detection metrics used.
INCREDYBLE: A New Search Strategy for Design Automation Problems with Applications to Testing
Venue: IEEE Transactions on Computers (1995)

A new search strategy for design automation problems is proposed, that is directly applicable to circuits having a size parameter (e.g., operand size), and indirectly, to random-logic circuits as well. Under the proposed approach, exhaustive search for an optimal solution is performed for small versions of the target circuit, obtained by scaling-down all the size parameters of the circuit (e.g., by reducing the operand size). The optimal solutions obtained for the small circuits are studied, and analytic rules are derived to capture their common features. Using these rules, the solutions are scaled-up into a high-quality solution for the large target circuit. The method, its feasibility and limitations are described in this work. The method is applied to two problems related to testing of digital circuits, namely, test generation for stuck-at faults and test generation for path delay faults. Index Terms¿Combinational circuits, off-line testing, path delay faults, search strategy, stuck-at faults.
Low resistivity &#x03B1;-Tantalum in Cu/CVD Low-k (OrionTM) integration
Authors: H. Donohue, J. C. Yeoh, K. Giles, K. Buchanan
Venue: Microelectronic Engineering (2002)

Over the past years, most research on Ta-based diffusion barriers in Cu metallisation has been focused on high resistivity β-Ta (ρ = 160-200 µΩ cm) as well as on binary and ternary tantalum-alloys with relatively little work published on the properties of low-resistivity α-Ta (ρ = 15-30 µΩ cm) in Cu/low-k integration. The present paper describes the deposition of α-Ta directly onto a CVD low-k dielectric with k > 2.2 (Orion™) by non-reactive sputtering at deposition temperatures below 1000 °C. In addition to pure α-Ta films, the PVD system employed in the present study allows the controlled formation of mixed phases and hence 'tuning' of barrier properties such as resistivity or barrier strength. Film characterisation includes resistivity, in-plane stress, texture and the ability to promote a {111} texture in the subsequently PVD Cu seed layer.