ppxscal/embedding_network huggingface dataset:
Hierarchical Decomposition of Multiscale Skeletons
Authors: Gunilla Borgefors, Giuliana Ramella, Gabriella Sanniti di Baja
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2001)

This paper presents a new procedure to hierarchically decompose a multiscale discrete skeleton. The skeleton is a linear pattern representation that is generally recognized as a good shape descriptor. For discrete images, the discrete skeleton is often preferable. Multiresolution representations are convenient for many image analysis tasks. Our resulting skeleton decomposition shows two different types of hierarchy. The first type of hierarchy is one of different scales, as the original pattern is converted into an AND-pyramid and the skeleton is computed for each resolution level. The second type of hierarchy is established at each level of the pyramid by identifying and ranking skeleton subsets according to their permanence, where permanence is a property intrinsically related to local pattern thickness. To achieve the decomposition, both bottom-up and top-down analysis in the sense of moving from higher to lower resolution and vice versa are used. The bottom-up analysis is used to ensure that a part of the skeleton that is connected at a higher resolution level is also connected (if at all present) in the next, lower resolution level. The top-down analysis is used to build the permanence hierarchy ranking the skeleton components. Our procedure is based on the use of (3 × 3) local operations in digital images, so it is fast and easy to implement. This skeleton decomposition procedure is most effective on patterns having different thickness in different regions. A number of examples of decompositions of multiscale skeletons (with and without loops) will be shown. The skeletons are, in most cases, nicely decomposed into meaningful parts. The procedure is general and not limited to any specific application.
Multi-processor performance on the Tera MTA
Authors: Allan Snavely, Larry Carter, Jay Boisseau, Amit Majumdar, Kang Su Gatlin, Nick Mitchell, John Feo, Brian Koblenz
Venue: Proceedings of the 1998 ACM/IEEE conference on Supercomputing (CDROM) (1998)

The Tera MTA is a revolutionary commercial computer based on a multithreaded processor architecture. In contrast to many other parallel architectures, the Tera MTA can effectively use high amounts of parallelism on a single processor. By running multiple threads on a single processor, it can tolerate memory latency and to keep the processor saturated. If the computation is sufficiently large, it can benefit from running on multiple processors. A primary architectural goal of the MTA is that it provide scalable performance over multiple processors. This paper is a preliminary investigation of the first multi-processor Tera MTA.In a previous paper [1] we reported that on the kernel NAS 2 benchmarks [2], a single-processor MTA system running at the architected clock speed would be similar in performance to a single processor of the Cray T90. We found that the compilers of both machines were able to find the necessary threads or vector operations, after making standard changes to the random number generator. In this paper we update the single-processor results in two ways: we use only actual clock speeds, and we report improvements given by further tuning of the MTA codes.We then investigate the performance of the best single-processor codes when run on a two-processor MTA, making no further tuning effort. The parallel efficiency of the codes range from 77% to 99%. An analysis shows that the "serial bottlenecks" -- unparallelized code sections and the cost of allocating and freeing the parallel hardware resources -- account for less than a percent of the runtimes. Thus, Amdahl's Law needn't take effect on the NAS benchmarks until there are hundreds of processors running thousands of threads.Instead, the major source of inefficiency appears to be an imperfect network connecting the processors to the memory. Ideally, the network can support one memory reference per instruction. The current hardware has defects that reduce the throughput to about 85% of this rate. Except for the EP benchmark, the tuned codes issue memory references at nearly the peak rate of one per instruction. Consequently, the network can support the memory references issued by one, but not two, processors. As a result, the parallel efficiency of EP is near-perfect, but the others are reduced accordingly.Another reason for imperfect speedup pertains to the compiler. While the definition of a thread in a single processor or multi-processor mode is essentially the same, there is a different implementation and an associated overhead with running on multiple processors. We characterize the overhead of running "frays" (a collection of threads running on a single processor) and "crews" (a collection of frays, one per processor.)
"...but can you prove it?"
Authors: Raymond E. Floyd
Venue: Proceedings of IEEE professional communication society international professional communication conference and Proceedings of the 18th annual ACM international conference on Computer documentation: technology & teamwork (2000)

Technical writers are called upon for many different types of documentation for any given product. Those documents can be User's Manuals, Technical Manuals, or Marketing brochures, pamphlets, and other publications. Most of the background required to write such documents can be, and is, taught in typical college classes.Errors in User's Manuals and Technical Manuals most often are no more serious than being a cause of frustration on the part of the users. Errors can, however, be the basis of lawsuits on the behalf of the users. In Marketing publications there must be serious consideration on a topic known as "proof of claims ". If the publication states that a particular device will work at such and such speeds, then this statement must be substantiated - somewhere. Systems must be tested and claims validated. Test plans and test procedures are poorly understood by many technical writers, and the need for good plans and procedures is critical in industry.This paper develops the definition of good test plans, test procedures, data collection, and the legal aspects of what is said about a new product versus what can be proven through product testing. 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
Towards scott domains-based topological ontology models
Authors: J. T. Fernández-Breis, D. Castellanos-Nieves, R. Valencia-Garcia, P. J. Vivancos-Vicente, R. Martínez Béjar, M. De las Heras-Gónzalez
Venue: Proceedings of the international conference on Formal Ontology in Information Systems - Volume 2001 (2001)

An ontology can be seen as an approximation to what exists in the real world. An ontological model is the kernel used for specifying ontologies so that how close an ontology can be from the real world depends on the possibilities offered by the ontological model. In this paper, an ontological model that permits the specification of concepts, attributes, mereological and taxonomic relationships, and structural axioms, and that has already been applied to different application domains is extended to contain topological relationships as well. It is demonstrated in this paper that topological relations can be established on ontologies built with that ontological model, and the topological relations are not established by the user but inferred from the knowledge contained in the particular ontology. The domain chosen for this work is the relation between drugs consumption and cancer diagnoses.
The synergy of functional programming and very large scale integration
Authors: Karen Strain, Harold C. Grossman
Venue: Proceedings of the 20th annual Southeast regional conference (1982)

In 1977 functional programming received a fresh and timely examination from Turing Award recipient John Backus. This work raised awareness of inherent deficiencies in traditional von Neumann architecture and languages. In his subsequent writings Backus uses results from combinatory logic to further develop a high-level functional programming form (FP) in which variable-free programs are built from a set of primitive programs using a few combining forms and recursive definitions. The symmetric properties of the underlying program forming operations (PFO's) in FP provide a strong mathematical structure with which to study the "algebra of programs." These PFO's generate programs which are semantically simple, are clearly hierarchical, and facilitate program correctness proofs. Unfortunately, FP style code does not execute as quickly on traditional von Neumann machines as do traditional languages. Very large scale integration (VLSI) chip design technology may address this problem. Development of VLSI offers low cost architectural possibilities for concurrent processing to which FP is well suited. In return, FP offers the clarity, structure, and mathematically sound software which VLSI applications require to justify their design, development, and implementation.
Microsoft Word 97 for Engineers, Toolkit: A First Course in Engineering, 2nd edition
Authors: Sheryl A. Sorby
Venue:  (1997)

:Presents the basics of using Microsoft Word 97 for written documentation required in the design process. Includes shortcuts for preparing documentation quickly and efficiently, formatting for letters and memos, experimental data reports, proposals, and technical papers, and creating design specifications in Word. 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
Control, Optimization, and Smart Structures: High-Performance Bridges and Buildings of the Future
Authors: Hojjat Adeli
Venue:  (1999)

:By using active controllers, a structure can modify its behavior during dynamic loading. Such structures with self-modification capability are called adaptive or smart structures. In this book, computational models and algorithms are presented for active control of a new generation of large adaptive structures subjected to various types of dynamic loading, such as impact, wind, earthquake, and blast loading. This is achieved through the ingenious integration of five different disciplines and technologies: control, optimization, sensor/actuator technology, structural engineering, and high-performance computing.
WebDAV and DeltaV: collaborative authoring, versioning, and configuration management for the Web
Authors: E. James Whitehead,  Jr.
Venue: Proceedings of the 12th ACM conference on Hypertext and Hypermedia (2001)

WebDAV and DeltaV are application-layer network protocols that provide capabilities for remote collaborative authoring, metadata management, version control, and configuration management. Both protocols extend the core protocol of the Web, the Hypertext Transfer Protocol (HTTP 1.1). WebDAV adds operations for overwrite prevention, properties, and namespace management, while DeltaV builds upon WebDAV to offer versioning (checkout and checkin), autoversioning, workspaces, activities, and configuration management.
Microsoft Exchange 5.0 Step by Step with 3.5 Disk
Authors: CORPORATE Catapult,  Inc. Staff
Venue:  (1997)

:Microsoft Exchange 5.0 Step By Step provides quick, easy, book-and-disk self-training on Microsoft Exchange 5.0--to help you easily learn this powerful messaging, task management, and scheduling program. Experience Level: Beginner/ Intermediate 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
Pokemon Gold Version and Silver Version: Official Trainer's Guide
Authors: Phillip Marcus
Venue:  (2000)

:Make Your Pokemon Party Unstoppable with BradyGAMES Pokemon Gold and Silver Official Pocket Guide! New Pokemon  Catch 'Em, Breed 'Em, Raise 'Em! Super-Useful, Quick Reference Tables! Covers Johto and Kanto Areas!
Wireless: The Revolution in Personal Telecommunications, 1st edition
Authors: Ira Brodsky
Venue:  (1995)

:Exploring the technologies, applications, business opportunities, and political controversies associated with the personal communications industry, this book describes how spread-spectrum radio has evolved into one of the hottest commercial technologies and presents the big picture both of today's state-of-the-art and future advances.
Digital Mosaics: The Aesthetics of Cyberspace
Authors: Steven R. Holtzman
Venue:  (1997)

:Through the work of artists and designers on the cutting edge of technology, Digital Mosaics explores the possibilities of digital expression: gravity-defying sculptures that can exist only in cyberspace, a newspaper that communicates at a glance the relationships among various news stories, an interactive opera in which members of the audience become part of the performance. Holtzman also shows us how computer pioneers are now able to produce works of astonishing complexity and intelligence, dynamic worlds full of creatures that grow and evolve, music that perpetuates itself, and beautiful fractal images that rival nature's masterpieces. Holtzman examines the unique qualities of these on-line experiences. Digital art is infinitely reproducible (there is no "original"), and yet is ephemeral. The digital experience is interactive, not passive, and this will change the way we look at and experience digital worlds. The traditional boundary between the audience and the artist will become only more blurred. And while the digital world links individuals to a global community, it is also a place in which individual expression will flourish as never before. The computer, says Holtzman, does not replace books, painting, photography, film, or theater. It is a new medium that will give rise to entirely new forms of creative expression.
Microsoft Word 97 (Quick Reference)
Authors: Que Corporation
Venue:  (1997)

:Following the tradition of the highly successful Quick Reference series, this must-have guide provides easy-to-understand information on all of the features and elements of Word 97. Written by a team of experts, this is the perfect book for users who need fast access to detailed, task information.Extensive coverage of formatting, page layout, editing features, importing graphics, working with Internet documents, sharing data with other users, and moreExplores Internet features, Office 97, and Outlook integration in detailFilled with expert tips and techniques to make learning easy
Using Turbo Pascal W/Disk 3e, 3rd edition
Authors: Julien O. Hennefeld
Venue:  (1995)

:Used at more than 100 institutions in its second edition, Using Turbo Pascal 6.0-7.0, Third Edition applies a highly successful formula of "learning by example" to your introductory Turbo Pascal programming course. The text uses small program segments as examples, breaking down the process of programming into a series of manageable steps. The author has added a new DOS tutorial and lab activities for using the Turbo 7.0 system, and given increased focus to the issue of how to write a program. The concept of procedures is introduced early in chapter 4 (in connection with top down programming design), and then is covered in detail in chapters 10 and 11, making it easy to cover or omit as needed.
Optimal Schedules for Cycle-Stealing in a Network of Workstations with a Bag-of-Tasks Workload
Authors: Arnold L. Rosenberg
Venue: IEEE Transactions on Parallel and Distributed Systems (2002)

We refine the model underlying our prior work on scheduling bag-of-tasks (¿embarrassingly parallel¿) workloads via cycle-stealing in networks of workstations obtaining a model wherein the scheduling guidelines ofproduce optimal schedules for every such cycle-stealing opportunity. We thereby render prescriptive the descriptive model of those sources. Although computing optimal schedules usually requires the use of general function-optimizing methods, we show how to compute optimal schedules efficiently for the broad class of opportunities whose durations come from a concave probability distribution. Even when no such efficient computation of an optimal schedule is available, our refined model often suggests a natural notion of approximately optimal schedule, which may be efficiently computable. We illustrate such efficient approximability via the important class of cycle-stealing opportunities whose durations come from a heavy-tailed distribution. Such opportunities do not admit any optimal schedule¿nor even a natural notion of approximately optimal schedule¿within the model.Within our refined model, though, we derive computationally simple schedules for heavy-tailed opportunities, which can be ¿tuned¿ to accomplish an expected amount of work that is arbitrarily close to optimal.
On Optimal Pairwise Linear Classifiers for Normal Distributions: The Two-Dimensional Case
Authors: Luis Rueda, B. John Oommen
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

Optimal Bayesian linear classifiers have been studied in the literature for many decades. In this paper, we demonstrate that all the known results consider only the scenario when the quadratic polynomial has coincident roots. Indeed, we present a complete analysis of the case when the optimal classifier between two normally distributed classes is pairwise and linear. To the best of our knowledge, this is a pioneering work for the use of such classifiers in any area of statistical Pattern Recognition (PR). We shall focus on some special cases of the normal distribution with nonequal covariance matrices. We determine the conditions that the mean vectors and covariance matrices have to satisfy in order to obtain the optimal pairwise linear classifier. As opposed to the state of the art, in all the cases discussed here, the linear classifier is given by a pair of straight lines, which is a particular case of the general equation of second degree. One of these cases is when we have two overlapping classes with equal means, which resolves the general case of the Minsky's paradox for the perceptron. We have also provided some empirical results, using synthetic data for the Minsky's paradox case, and demonstrated that the linear classifier achieves very good performance. Finally, we have tested our approach on real life data obtained from the UCI machine learning repository. The empirical results that we obtained show the superiority of our scheme over the traditional Fisher's discriminant classifier.
NetScape Server Survival Guide
Authors: David Gulbransen
Venue:  (1996)

:With the recent reduction in the price of its server technology, Netscape's marketability is increasing. Both current and migrating Netscape administrators alike will need the comprehensive coverage found in this book.Teaches the reader how to install, configure, and maintain a Netscape serverDiscusses third-party products, commonly used Netscape utilities, and an extensive troubleshooting guideCD-ROM contains software demonstrations, sample configuration files, and exotic logon scripts
Information flow analysis of an RBAC system
Authors: Sylvia L. Osborn
Venue: Proceedings of the seventh ACM symposium on Access control models and technologies (2002)

Role-based access control provides a very flexible set of mechanisms for managing the access control of a complex system with many users, objects and applications. In our previous research, we have shown how, given a role graph and security labels for objects, one can test whether or not the system satisfies properties for lattice-based access control. In this paper we give a general mapping, which takes an arbitrary role graph and produces another graph which shows the information flow that can result from the roles defined in the role graph. An extension builds the information flow graph taking user assignments and sessions into account.
On maximizing service-level-agreement profits
Authors: Zhen Liu, Mark S. Squillante, Joel L. Wolf
Venue: ACM SIGMETRICS Performance Evaluation Review (2001)

We present an initial study of a methodology for maximizing profits in a general class of e-commerce environments under a cost model in which revenues are generated when QoS guarantees are satisfied and penalties are incurred otherwise. The QoS guarantees are based on multiclass SLAs between service providers and their clients, which include the tail distributions of the per-class response times. Our approach consists of formulating the resulting optimization problem as a network flow model with a separable set of concave objective function summands based on derived queueing-theoretic formulas. This problem is then solved in a very efficient manner via a fixed-point iteration.
High Places in Cyberspace: A Guide to Biblical and Religious Studies, Classics and Archaeological Resources on the Internet, 2nd edition
Authors: Patrick Durusau
Venue:  (1998)

:In this second edition of High Places in Cyberspace, Patrick Durusau provides an updated and expanded how-to guide and map of the Internet focusing on meeting the needs of scholars in biblical studies, religion, classics and archaeology. Durusau offers a practical introduction and reference to accessing Internet resources, covering methods such as electronic mailing lists, ftp, on-line libraries, search engines, and the World Wide Web. This book includes an annotated topical listing of over 1,000 scholarly resources available on the Internet, such as Web sites displaying original scanned papyri, web sites with original texts, mailing lists between scholars and on-line library addresses. In a new final section, Durusau provides an introduction to the creation of web resources along with pointers to a number of helpful tools available on the Internet. 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
Models and thresholds for random constraint satisfaction problems
Authors: Michael Molloy
Venue: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (2002)

We introduce a class of models for random Constraint Satisfaction Problems. This class includes and generalizes many previously studied models. We characterize those models from our class which exhibit thresholds for satisfiability in the sense that the limiting probability of satisfiability changes significantly as the number of constraints increases. We also discuss models which exhibit sharp thresholds in the sense that the limiting probability jumps from 0 to 1 suddenly.
A fast algorithm for context-aware buffer insertion
Authors: Ashok Jagannathan, Sung-Woo Hur, John Lillis
Venue: ACM Transactions on Design Automation of Electronic Systems (TODAES) (2002)

We study the problem of performing buffer insertion in the context of a given layout. In a practical situation, there are restrictions on where buffers may be inserted; for instance, it may be possible to route wires over a preplaced macro cell, but may not be possible to insert buffers in that region. As a result, it is desirable to perform route planning and buffer insertion simultaneously. Furthermore it is necessary that such an algorithm be aware of the trade-off between cost (e.g., total capacitance) and delay. In this context we propose the delay reduction to cost ratio (DRCR) problem and present a fast algorithm for the same. Solutions identified by the algorithm are characterized with respect to the overall cost versus performance trade-off curve. Computational experiments demonstrate the viability of the approach.