ppxscal/embedding_network huggingface dataset:
Performance Measures for Training Spatial Knowledge in Virtual Environments Using Division, Inc., and VEGA Marine Geometric Models
Authors: Elizabeth Henderson
Venue: Proceedings of the International Conference on Information Visualisation (2000)

Spatial knowledge, often used in military operations, is a significant component of military skills. It includes knowledge of the relationships of one object to others, the movement of objects relative to others the relationship of the human to each of the objects, and this involves perception and awareness of the humans' position within the situation. Key ingredients include both time and distance perceptions by the human'Recently, the military have been exploring the use of virtual environment technology; the focus for training systems has been on simulation of the environment and behavior of the objects from a mathematical modeling perspective.This paper will examine two of the major factors involved in Performance Metrics for use within Virtual Environments the focus of this research will be performance measurement of the training environment using US Naval case studies, implementing geometric modeling. 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
Storage Class Extensibility in the Brown Object Storage System
Authors: David E. Langworthy, Stanley B. Zdonik
Venue:  (1994)

New applications such as CAD, hypermedia, and programming environments stress existing database technology to the limit. Object-oriented databases (OODBs) were developed to meet the demands of these new domains. All OODBs use some distinct service that provides stable storage for objects or pages, referred to as object servers and page servers respectively. OODBs support new application domains with extensible type systems that allow new abstractions to be added easily. This causes problems whenever an OODB attempts to model a domain for which specialized secondary storage structures exist. Incorporating a new storage structure into an existing database implementation is a formidable task. Concurrency control, recovery and other modules would need to be changed in order to accommodate the new storage structure. It would be desirable to have an extensible object store that could accommodate new interfaces without causing major disruption to the existing system. The Brown Object Storage System BOSS achieves extensibility by providing well defined interfaces to the designers of specialized storage structures. Through these interfaces the designer augments the structure with correct concurrent operation, fault tolerance and client-server distribution. BOSS aims to minimally constrain storage structure designers. To this end, BOSS is constructed from loosely coupled entities that cooperate asynchronously through well defined interfaces that communicate by message passing.
The Design and Implementation of a Framework for Configurable Software
Authors: Stuart M. Wheater, Mark C. Little
Venue: Proceedings of the 3rd International Conference on Configurable Distributed Systems (1996)

Software systems are typically composed of numerous components, each of which is responsible for a different function, e.g., one component may be responsible for remote communication, while another may provide a graphical user interface. Different implementations of a component may be possible, with each implementation tailored for a specific set of applications or environments. Being able to reconfigure software systems to make use of these different implementations with the minimum of effect on existing users and applications is desirable. Configurable software systems are also important for a number of other reasons: additional components or modifications to those currently available, may be required. For example, new versions of software components may be necessary due to the discovery of design flaws in a component; a RPC which provides unreliable message delivery maybe suitable for an application in a local area network, but if the application is to be used in a wide area network, a different RPC implementation, which guarantees message delivery, may be necessary. Therefore, software is often required to be configurable, enabling modifications to occur with minimal effect on existing users. To allow this configurability, components should only be available through interfaces that are clearly separated from their implementations, allowing users to be isolated from any implementation changes. Object-oriented programming techniques offer a good basis upon which this separation can be provided. This paper describes a model for constructing configurable software based upon this separation, and illustrates this with a software development system we have implemented which supports these ideas in C++.
The Complete FreeBSD, 4 edition
Authors: Greg Lehey, Marshall Kirk McKusick
Venue:  (2003)

:BSD is one of the foundations of modern UNIX and UNIX-like systems, and has earned a reputation for unparalleled performance and stability. It is also the source of much Internet technology. FreeBSD, an open source operating system, is by far the most popular version of BSD. The Complete FreeBSD is a classic text published for many years by FreeBSD distributer Walnut Creek. The book is an eminently practical guide that explains not only how to get a computer up and running with the FreeBSD operating system, but how to turn it into a highly functional and secure workstation or server that can host large numbers of users and disks, support remote access, and provide web services, mail service, and other key parts of the internet infrastructure. This edition is based on the Version 5.0 of FreeBSD, which includes a number of new features, notably improved support for multiprocessor systems. New topics include wireless LAN support, DHCP, proxy servers, the KDE desktop, and how to write CD-ROMs. The book is written for novices as well as moderately knowledgeable readers who have picked up some experience using UNIX. The book covers a wide range of topics central to the system administration of hubs. Among the many topics are installation and updates, backups, printers, RAID, several Internet services, firewalls, and the graphical X Window System. Many readers over the years have praised this book for anticipating their problems and providing signposts pointing toward the solutions.
Document marking and identification using both line and word shifting
Authors: S. H. Low, N. F. Maxemchuk, J. T. Brassil, L. O'Gorman
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2 (1995)

Continues a study of document marking to deter illicit dissemination. An experiment performed reveals that the distortion on the photocopy of a document is very different in the vertical and horizontal directions. This leads to the strategy that marks a text line both vertically using line shifting and horizontally using word shifting. A line that is marked is always accompanied by two unmarked control lines one above and one below. They are used to measure distortions in the vertical and horizontal directions in order to decide whether line or word shift should be detected. Line shifts are detected using a centroid method that bases its decision on the relative distance of line centroids. Word shifts are detected using a correlation method that treats a profile as a waveform and decides whether it originated from a waveform whose middle block has been shifted left or right. The maximum likelihood detectors for both methods are given.
Coupled Electromagnetic-Circuit Simulation of Arbitrarily-Shaped Conducting Structures using Triangular Meshes
Authors: Dipanjan Gope
Venue: Proceedings of the 3rd International Symposium on Quality Electronic Design (2002)

The Partial-Element-Equivalent-Circuit (PEEC) approach is an effective method to convert three-dimensional on-chip multi-conductor structures to circuit-level descriptions. In this paper, a triangular-mesh-based PEEC approach is described, wherein the surfaces of arbitrarily-shaped conducting structures are represented by triangular mesh tesselations. A coupled EM-circuit formulation is obtained through the separation of the scalar, vector, and ohmic potential interactions between pairs of triangular edges-based basis functions. The overall approach can be interpreted as a SPICE-free, surface-only version of PEEC method and is especially useful for on-chip signal integrity analysis of systems-on-chip layout where components with irregular shapes are common.
Convergence of a splitting inertial proximal method for monotone operators
Authors: A. Moudafi, M. Oliny
Venue: Journal of Computational and Applied Mathematics (2003)

A forward-backward inertial procedure for solving the problem of finding a zero of the sum of two maximal monotone operators is proposed and its convergence is established under a cocoercivity condition with respect to the solution set.
Mutual exclusion within both software- and hardware-driven kernel primitives
Authors: M. E. Harper
Venue: ACM SIGOPS Operating Systems Review (1982)

Mutual exclusion between process and interrupt-driven execution is normally confined by the designer to passages within the kernel of an operating system and has been implemented traditionally by the judicious use of the interrupt inhibit instruction. This paper illustrates an alternative approach to the problem through the implementation of the conflicting software and hardware-driven kernel primitives as a limited set of concurrent subprocesses sharing a singular kernel domain. Manipulations of kernel data are rendered mutually exclusive through the use of P and V operations on simple semaphores associated with the data objects themselves. The kernel programmer is thereby relieved of real-time considerations in guarding his critical sections and the implementation of the kernel acquires a formalism which can greatly aid its verification, testability and maintainability.
Conjoint Simulation - A Technique for the Combined Performance and Dependability Analysis of Large-Scale Computer Systems
Authors: Axel Hein, Kumar K. Goswami
Venue: Proceedings of the 2nd International Computer Performance and Dependability Symposium (IPDS '96) (1996)

In this paper we propose an approach which seamlessly integrates two modeling techniques to facilitate the simulation and analysis of performance and dependability of large-scale parallel computer systems. The approach, called Conjoint Simulation, combines object-oriented, process-based simulation with Petri net modeling. The approach splits a system into a performance model and a dependability model. The models are developed independently but interact at run time to provide both performance and dependability metrics. This separation facilitates model representation, development, and maintenance.
A user-controlled synchronization method
Authors: John M. Chambers
Venue: ACM SIGOPS Operating Systems Review (1973)

In any system that allows the sharing of facilities between independently-running processes, it is occasionally necessary to 'synchronize' references to shared facilities. A method is presented here that enables any set of processes to achieve such synchronization without any aid from the executive system or special hardware. Only normal load and store operations on two arrays of shared data are required. No overhead is required for unsynchronized operations. And dead-locks are avoided, since it is never necessary to 'block' a process.This method can be viewed as a generalization of Dijkstra's example [D3], though the connection may not be obvious at first glance.
An evaluation of MIA conformance tests
Authors: S. Minami, T. Suganuma, T. Miyazaki
Venue: Proceedings of the 2nd IEEE Software Engineering Standards Symposium (1995)

NTT has developed a set of specifications called Multivendor Integration Architecture (MIA) for open systems codeveloped with vendors, etc. NTT then implemented conformance testing for MIA products, and is now using it's results for procurement. We evaluate the results of this implemented MIA conformance testing. The proportion of nonconformances detected by test programs when tests were run as an integral part of the debugging process, was eight times as great as the proportion detected when testing was done after debugging had been completed. On the basis of these results, it is important to make it easy for the vendors to use the test programs as one of the debugging tools in order to promote their efficient use, and therefore we mention some further requirements that would be desirable to help make this happen.
Two Level Finite Element Method and its Application to the Helmholtz Equation
Authors: L. P. Franca, A. P. Macedo
Venue:  (1997)

A two-level finite element method is introduced and its application to the Helmholtz equation is considered. The method retains the desirable features of the Galerkin method enriched with residual-free-bubbles, while it is not limited to discretizations using elements with simple geometry. The method can be applied to other equations and to irregular shaped domains.
An on-line algorithm for checkpoint placement
Authors: A. Ziv, J. Bruck
Venue: Proceedings of the The Seventh International Symposium on Software Reliability Engineering (1996)

Checkpointing is a common technique for reducing the time to recover from faults in computer systems. By saving intermediate states of programs in a reliable storage device, checkpointing enables one to reduce the processing time loss caused by faults. The length of the intervals between the checkpoints affects the execution time of the programs. Long intervals lead to a long re-processing time, while too-frequent checkpointing leads to a high checkpointing overhead. In this paper, we present an online algorithm for the placement of checkpoints. The algorithm uses online knowledge of the current cost of a checkpoint when it decides whether or not to place a checkpoint. We show how the execution time of a program using this algorithm can be analyzed. The total overhead of the execution time when the proposed algorithm is used is smaller than the overhead when fixed intervals are used. Although the proposed algorithm uses only online knowledge about the cost of checkpointing, its behavior is close to that of the off-line optimal algorithm that uses the complete knowledge of the checkpointing cost.
Quotation and Reflection in Nuprl and Scheme
Authors: Eli Barzilay
Venue:  (2001)

Relationships between the concepts of proof systems and programming languages are known. Some are well demonstrated in systems like Coq and Nuprl, but other aspects have not been fully implemented, such as reflection. I believe that the true context in which such ideas are becoming useful is when they are implemented, this ``implementation as understanding'''' principle is the reason some parts of the following text contain code pieces. This should take the form of a logical environment with reflection mechanisms, Nuprl is a good choice since it is used for connecting logic and programming languages. Therefore, the first step towards creating such an implementation should be taken: pinpointing what should be done, and how. This paper is an attempt to do this.
PhotoShop 7 Photographer's Guide
Authors: David D. Busch
Venue:  (2002)

:Written for photographers who want to use photography creatively to produce compelling images, this guide emphasizes both traditional and cutting-edge photographic techniques and explains how to apply those techniques in Adobe Photoshop. Effects covered include removing an unwanted portion of a photo, morphing images to blend or distort them. Written from a photographer's perspective, this guide is a jumping-off point that will spark creativity into action.Author Biography: David D. Busch is the author of Digital Photography for Dummies Quick Reference, Photoshop 6: I Didn't Know You Could Do That, and Digital Photography and Imaging.
Hardw are Implementation of Data Compression Algorithms for Memory Energy Optimization
Authors: Luca Benini, Davide Bruni, Alberto Macii, Enrico Macii
Venue: Proceedings of the IEEE Computer Society Annual Symposium on VLSI (ISVLSI'03) (2003)

This paper describes implementation details of a hardwarecompression and decompression unit (CDU) for optimizingenergy consumption in processor-based systems.Many algorithms for data compression (i.e., profile-driven,adaptive, differential) have been introduced in [1, 2]. Inall cases, data compression and decompression are performed on-the-fly on the cache-to-memory path: Uncompressed cache lines are compressed before they are written back to main memory, and decompressed when cacherefills occur. This paper completes and extends the contributions of [1, 2] by providing evidence on the feasibility of the proposed compression architectures by specifically addressing hardware implementation issues. CDU design is targeted towards energy minimization in the cache-bus-memory subsystem with a strict constraint on performance. As a result, average memory energy reductionsevaluated on several benchmark programs are around 24%,at no performance penalty.
SAR by MS for Functional Genomics (Structure-Activity Relation by Mass Spectrometry)
Authors: Bruce R Donald, Chris Bailey-Kellogg, John J. Kelley, Clifford Stein
Venue:  (1999)

Large-scale functional genomics will require fast, high-throughput experimental techniques, coupled with sophisticated computer algorithms for data analysis and experiment planning. In this paper, we introduce a combined experimental-computational protocol called Structure-Activity Relation by Mass Spectrometry (SAR by MS), which can be used to elucidate the function of protein-DNA or protein-protein complexes. We present algorithms for SAR by MS and analyze their complexity. Carefully-designed Matrix-Assisted Laser Desorption/Ionization Time-Of-Flight (MALDI TOF) and Electrospray Ionization (ESI) assays require only femtomolar samples, take only microseconds per spectrum to record, enjoy a resolution of up to one dalton in $10^6$, and (in the case of MALDI) can operate on protein complexes up to a megadalton in mass. Hence, the technique is attractive for high-throughput functional genomics. In SAR by MS, selected residues or nucleosides are 2H-, 13C-, and/or 15N-labeled. Second, the complex is crosslinked. Third, the complex is cleaved with proteases and/or endonucleases. Depending on the binding mode, some cleavage sites will be shielded by the crosslinking. Finally, a mass spectrum of the resulting fragments is obtained and analyzed. The last step is the Data Analysis phase, in which the mass signatures are interpreted to obtain constraints on the functional binding mode. Experiment Planning entails deciding what labeling strategy and cleaving agents to employ, so as to minimize mass degeneracy and spectral overlap, in order that the constraints derived in data analysis yield a small number of binding hypotheses. A number of combinatorial and algorithmic questions arise in deriving algorithms for both Experiment Planning and Data Analysis. We explore the complexity of these problems, obtaining upper and lower bounds. Experimental results are reported from an implementation of our algorithms.
Planar domination graphs
Authors: Elaine M. Eschen, William F. Klostermeyer, R. Sritharan
Venue: Discrete Mathematics (2003)

A graph G is a domination graph if each induced subgraph of G has a pair of vertices such that the open neighborhood of one is contained in the closed neighborhood of the other in the subgraph. No polynomial time algorithm or hardness result is known for the problem of deciding whether a graph is a domination graph. In this paper, it is shown that the class of planar domination graphs is equivalent to the class of planar weakly chordal graphs, and thus, can be recognized in polynomial time.
Combined Permutation Codes Using M-ary Modulation for AWGN and Fading Channels
Authors: Jamal Rahhal, Guillermo E. Atkin
Venue: Proceedings of the IEEE Symposium on Computers and Communications (ISCC'95) (1995)

Modern wireless communication systems requires an effecient use of the spectrum. Here we introduce the use of Permutation Codes (PC) as a combined source coding and channel modulation system using M-ary phase shift keying as the modulation formats. We combine the features of a Permutation Code vector quantizer and a Permutation Code as channel modulator. For source coding the Permutation Code is a class of constant weight vector quantizer, and its rate-distortion performance is near optimal considering practical vector lengths. We obtained the rate-total distortion performance for the combined system when an M-ary PSK modulation formats is used as channel symbols. The performance is obtained using numerical methods for AWGN channel and for Frequency nonselective slowly fading channel. We found that the combined system has the advantage over non combined systems of lower encoding delay, and hence simpler transmitter and receiver. Also, we would be able to optimize the overall distortion as a function of the design parameters.
Computer Literacy for Undergraduates: A Document-Engineering Framework
Authors: Peter Wegner
Venue:  (1994)

Brown''s computer literacy course for undergraduates with no previous experience of computing aims to elevate the collection of practical techniques associated with word processing, spreadsheets, and hypertext into a systematic discipline of document engineering. It starts with a Macpaint competition whose prizewinners in 1994 were publicly exhibited. It includes Hypercard assignments on "how computers execute programs" and on "can machines think?", and a network treasure hunt that requires students to correspond by e-mail, retrieve an ftp file, and report on their favorite newsgroups. The one-month final project requires design and implementation of a substantial document in Hypercard, Mosaic, or Excel, with a high-level design at the end of the first week and a detailed design at the end of the second week that is worth 20 grade. The 1994 projects included a Startrek adventure game, the archeoology of Mesopotamia, multimedia guides to Ghana, Prague, and New York, the Bible with illustrations (Leonardo''s last supper), and music lessons with audio examples and composition facilities (we used it to compose three blind mice). We examine the structure of the course and suggest that such courses are not only more practical than but as conceptually challenging as first courses on programming. 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
Interactive Design of Object-Oriented Schema
Authors: M. F. Van Bommel
Venue: Proceedings of the 1999 International Symposium on Database Engineering & Applications (1999)

Interactive design of object-oriented schema requires a tool that permits fine-grained, incremental capture of semantic intent in the form of atomic assertions and provides user feedback reflecting the consequences of the design. This paper describes a design tool that includes a graphical interface for schema entry and feedback, a conceptual reasoner to perform the deductions, and a schema generator that outputs the data definition language of choice. The graphical interface is concerned with issues of object placement, line crossing, and object focus. The conceptual reasoner constructs a representation of the schema as a constraint network graph, based on the concept of congruence closure. The schema generator produces data definitions based on the deductions of the conceptual reasoner and the assertions given to the graphical interface.