ppxscal/embedding_network huggingface dataset:
Visualization challenges for a new cyberpharmaceutical computing paradigm
Authors: Russell J. Turner, Kabir Chaturvedi, Nathan J. Edwards, Daniel Fasulo, Aaron L. Halpern, Daniel H. Huson, Oliver Kohlbacher, Jason R. Miller, Knut Reinert, Karin A. Remington, Russell Schwartz, Brian Walenz, Shibu Yooseph, Sorin Istrail
Venue: Proceedings of the IEEE 2001 symposium on parallel and large-data visualization and graphics (2001)

In recent years, an explosion in data has been profoundly changing the field of biology and creating the need for new areas of expertise, particularly in the handling of data. One vital area that has so far received insufficient attention is how to communicate the large quantities of diverse and complex information that is being generated. Celera has encountered a number of visualization problems in the course of developing tools for bioinformatics research, applying them to our data generation efforts, and making that data available to our customers. This paper presents several examples from Celera's experience. In the area of genomics, challenging visualization problems have come up in assembling genomes, studying variations between individuals, and comparing different genomes to one another. The emerging area of proteomics has created new visualization challenges in interpreting protein expression data, studying protein regulatory networks, and examining protein structure. These examples illustrate how the field of bioinformatics is posing new challenges concerning the communication of data that are often very different from those that have heretofore dominated scientific computing. Addressing the level of detail, the degree of complexity, and the interdisciplinary barriers that characterize bioinformatic problems can be expected to be a sizable but rewarding task for the field of scientific visualization.
Towards usage control models: beyond traditional access control
Authors: Jaehong Park, Ravi Sandhu
Venue: Proceedings of the seventh ACM symposium on Access control models and technologies (2002)

In this paper we develop the concept of Usage Control (UCON) that encompasses traditional access control, trust management, and digital rights management and goes beyond them in its definition and scope. While usage control concepts have been mentioned off and on in the security literature for some time, there has been no systematic treatment so far. By unifying these three areas UCON offers a promising approach for the next generation of access control. Traditional access control has focused on a closed system where all users are known and primarily utilizes a server-side reference monitor within the system. Trust management has been introduced to cover authorization for strangers in an open environment such as the Internet. Digital rights management has dealt with client-side control of digital information usage. Each of these areas is motivated by its own target problems. Innovations in information technology and business models are creating new security and privacy issues which require elements of all three areas. To deal with these in a systematic unified manner we propose the new UCON model. UCON enables finer-grained control over usage of digital objects than that of traditional access control policies and models. For example, print once as opposed to unlimited prints. Unlike traditional access control or trust management, it covers both centrally controllable environment and an environment where central control authority is not available. UCON also deals with privacy issues in both commercial and non-commercial environments. In this paper we first discuss access control, trust management, and digital rights management and describe general concepts of UCON in the information security discipline. Then we define components of the UCON model and discuss how authorizations and access controls can be applied in the UCON model. Next we demonstrate some applications of the UCON model and develop further details. We use several examples during these discussions to show the relevance and validity of our approach. Finally we identify some open research issues.
America Online for Teachers, 1st edition
Authors: Bard Williams
Venue:  (1996)

:Break through the hype and find out all about Asynchronous Transfer Mode (ATM), the hottest telecommunications technology! ATM For Dummies gets you up to speed on the technology and its practical uses. If you're a network manager or other "decision-maker" trying to determine whether ATM fits your company's networking plan, this book tells you where to start, what to worry about, and how to succeed. Inside, find helpful advice on how to See where and how ATM is used in different kinds of networks, ranging from LANs to WANs Evaluate ATM as a potential technology for your network requirements Find out how ATM stacks up against competing technologies Dig through ATM's standards and find out what's really important to you and your business Benefit from the experiences of ATM pioneers in real-life case studies Understand the many aspects of ATM networking: the enterprise, the carrier, the ISP, and even the residence Decipher all those acronyms floating around telecommunications technology Hear from the pros in a series of Inside ATM editorials by leading ATM experts
Thinking Pro/Engineer: Mastering Design Methodology, 1st edition
Authors: David Bigelow
Venue:  (1995)

:Thinking Pro/ENGINEER empowers beginning and intermediate users to analyze and improve their execution of the design process in Pro/ENGINEER, from concept to manufactured product. Mastering Pro/ENGINEER and its many modules takes more than learning the menus and how parent/child relationships work; learn how to think in Pro/ENGINEER with the many examples and hundreds of illustrations in this book. Good design practice and execution are distilled to their essence. Written to be independent of Pro/ENGINEER versions.
SIGACT news complexity theory column 35
Authors: Lane A. Hemaspaandra
Venue: ACM SIGACT News (2002)

I was surprised and delighted at a recent conference when the complexity class &Theta;2p suddenly popped up in a talk (by Markus Holzer on work by him and Pierre McKenzie) where it is was not exactly something one would have before-hand expected to come into play. After hearing the rest of Markus's remarkable talk (which he illustrated using toys from his daughter), I was much hoping that the authors would be so kind as to write a guest column; they very generously agreed to, and that column appears below.So, what is &Theta;2p? &Theta;2p is the class of languages acceptable via parallel access to NP, and has many equivalent alternate definitions and characterizations (see [KSW87, Hem89, Wag90]), such as the one used in the paper below. This class was first studied by Papadimitriou and and Zachos in 1983 [PZ83] (though in a form that at that time was not known to be equivalent to the definition just mentioned), and has played an important role in complexity theory, e.g., Kadin [Kad89] proved that the polynomial-time hierarchy collapses to &Theta;2p if NP has sparse Turing-complete sets. Recently, the class has turned out to play other surprising roles, such as in analyzing the complexity of electoral systems (see the survey [HH00]) and in understanding the performance of greedy algorithms [HR98, HRS01]. In fact, a survey column a few years ago was devoted to overviewing such raised-to-&Theta;2p lower bounds [HHR97].Bill Gasarch and SIGACT News need YOU! That is, the next issue will contain a guest column edited by Bill Gasarch, which will collection opinions on the future of the P-versus-NP question. Bill very much wants a broad range of opinions, and will be setting up a web page (http://www.cs.umd.edu/~gasarch/pnp/) describing how you can get your opinions to him. He may even put up a series of polling questions there, so please go there, vote early, and vote often!And in the issues following that will be articles by M. Schaeffer and C. Umans on complete sets at and beyond the polynomial hierarchy's second level, by A. Nickelsen and T. Tantau on partial information classes, and by R. Paturi on the complexity of k-SAT.
On the quantification of e-business capacity
Authors: Moises Goldszmidt, Derek Palma, Bikash Sabata
Venue: Proceedings of the 3rd ACM conference on Electronic Commerce (2001)

In order for current e-Businesses to mature from hastily assembled systems and applications, formal processes must be put in place for planning and budgeting, pricing and costing, and for establishing quality of service and service--level assurances. There are many challenges that e-Businesses face in formalizing these processes. The most important problem is to bridge the semantic disconnect between business objectives and the information system performance objectives. Next, the characterization of the e-Business infrastructure is extremely complex, given the variety of applications and system configurations at a web site and the traffic it receives. Finally, e-Businesses need to associate and apply traditional economic factors, such as depreciation and usage to applications, operating systems, and databases. In this paper, we propose an approach for defining and quantifying effective e-Business capacity that allows us to translate quality of service objectives into the number of users that a web site can support. This approach is based on inducing online models using machine learning and statistical pattern recognition techniques. As a consequence, the approach is flexible: it adapts to any site configuration and environment. The concept of e-Business capacity allows us to naturally answer planning and operational questions about the information system infrastructure needed to support the e-Business. The questions range from indicating which performance measures in the system are "important" to simulating "if-then" scenarios
Symbolic Analysis in Analog Integrated Circuit Design
Authors: Heinrich Floberg
Venue:  (1997)

:Symbolic Analysis in Analog Integrated Circuit Design provides an introduction to computer-aided circuit analysis and presents systematic methods for solving linear (i.e. small-signal) and nonlinear circuit problems, which are illustrated by concrete examples. Computer-aided symbolic circuit analysis is useful in analog integrated circuit design. Analytic expressions for the network transfer functions contain information that is not provided by a numerical simulation result. However, these expressions are generally extremely long and difficult to interpret; therefore, it is necessary to be able to approximate them guided by the magnitude of the individual circuit parameters. Symbolic Analysis in Analog Integrated Circuit Design serves as an excellent resource for students and researchers as well as for industry designers who want to familiarize themselves with circuit analysis. This book may also be used for advanced courses on the subjects.
Routability driven white space allocation for fixed-die standard-cell placement
Authors: Xiaojian Yang, Bo-Kyung Choi, Majid Sarrafzadeh
Venue: Proceedings of the 2002 international symposium on Physical design (2002)

The use of white space in fixed-die standard-cell placement is an effective way to improve routability. In this paper, we present a white space allocation approach that dynamically assigns white space according to the congestion distribution of the placement. In the top-down placement flow, white space is assigned to congested regions using a smooth allocating function. A post allocation optimization step is taken to further improve placement quality. Experimental results show that the proposed allocation approach, combined with a multilevel placement flow, significantly improves placement routability and layout quality.In our experiments, we compared our placement tool with two other fixed-die placers using an industrial place and route flow. Placements created by all three tools have been routed with an industrial router (Warp Route of Cadence). Compared with a leading-edge industrial tool, our placer produces placements with similar or better routability and on average 8.8% shorter routed wirelength. Furthermore, our tool produces placement that runs faster through the Warp Route compared with the industrial tool. Compared with a state-of-the-art academic placement tool (Capo/MetaPlacer), our placer shows ability to produce more routable placements: for 15 out of all 16 benchmarks our placer's outputs are routable while Capo/MetaPlacer only creates 4 routable placements.
Randomness conductors and constant-degree lossless expanders
Authors: Michael Capalbo, Omer Reingold, Salil Vadhan, Avi Wigderson
Venue: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (2002)

The main concrete result of this paper is the first explicit construction of constant degree lossless expanders. In these graphs, the expansion factor is almost as large as possible: (1&mdash;&egr;)D, where D is the degree and &egr; is an arbitrarily small constant. The best previous explicit constructions gave expansion factor D/2, which is too weak for many applications. The D/2 bound was obtained via the eigenvalue method, and is known that that method cannot give better bounds.The main abstract contribution of this paper is the introduction and initial study of randomness conductors, a notion which generalizes extractors, expanders, condensers and other similar objects. In all these functions, certain guarantee on the input "entropy" is converted to a guarantee on the output "entropy". For historical reasons, specific objects used specific guarantees of different flavors. We show that the flexibility afforded by the conductor definition leads to interesting combinations of these objects, and to better constructions such as those above.The main technical tool in these constructions is a natural generalization to conductors of the zig-zag graph product, previously defined for expanders and extractors.
Parasite Eve II
Authors: Dan Birlew
Venue:  (2000)

:BradyGAMES Parasite Eve II Official Strategy Guide features Every Item and Key Item, Armor & Weapon Lists, Bonus Items Revealed, Bestiary Stats, Comprehensive Walkthrough and Area Maps.
Access 97 Fast and Easy
Authors: Patrice-Anne Rutledge
Venue:  (1997)

:This exciting new book provides everything needed to create and use databases, including tables and customized forms. In just a few hours, this book's consistent step-by-step approach gives the reader a solid foundation in Access 97 basics. Following along is a breeze with the series' one-of-a-kind "look and learn" tutorials.
An empirical study of operating systems errors
Authors: Andy Chou, Junfeng Yang, Benjamin Chelf, Seth Hallem, Dawson Engler
Venue: Proceedings of the eighteenth ACM symposium on Operating systems principles (2001)

We present a study of operating system errors found by automatic, static, compiler analysis applied to the Linux and OpenBSD kernels. Our approach differs from previous studies that consider errors found by manual inspection of logs, testing, and surveys because static analysis is applied uniformly to the entire kernel source, though our approach necessarily considers a less comprehensive variety of errors than previous studies. In addition, automation allows us to track errors over multiple versions of the kernel source to estimate how long errors remain in the system before they are fixed.We found that device drivers have error rates up to three to seven times higher than the rest of the kernel. We found that the largest quartile of functions have error rates two to six times higher than the smallest quartile. We found that the newest quartile of files have error rates up to twice that of the oldest quartile, which provides evidence that code "hardens" over time. Finally, we found that bugs remain in the Linux kernel an average of 1.8 years before being fixed.
Clifford algebras and approximating the permanent
Authors: Steve Chien, Lars Rasmussen, Alistair Sinclair
Venue: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (2002)

(MATH) We study approximation algorithms for the permanent of an n x n (0,1) matrix A based on the following simple idea: obtain a random matrix B by replacing each 1-entry of A independently by &plusmn; e, where e is a random basis element of a suitable algebra; then output |det(B)|2. This estimator is always unbiased, but it may have exponentially large variance. In our first main result we show that, if we take the algebra to be a Clifford algebra of dimension polynomial in n, then we get an estimator with small variance. Hence only a constant number of trials suffices to estimate the permanent to good accuracy. The idea of using Clifford algebras is a natural extension of earlier work by Godsil and Gutman, Karmarkar et al., and Barvinok, who used the real numbers, complex numbers and quaternions respectively.(MATH) The above result implies that, in principle, this approach gives a fully-polynomial randomized approximation scheme for the permanent, provided |det(B)|2 can be efficiently computed in the Clifford algebras. Since these algebras are non-commutative it is not clear how to do this. However, our second main result shows how to compute in polynomial time an estimator with the same mean and variance over the 4-dimensional algebra (which is the quaternions, and is non-commutative); in addition to providing some hope that the computations can be performed in higher dimensions, this quaternion algorithm provides an exponential improvement in the variance over that of the 2-dimensional complex version studied by Karmarkar et al.
Inside Linux
Authors: Michael J. Tobler
Venue:  (2000)

:With in-depth, complete coverage on the Linux operating system, Inside Linux is the only book Linux users and system administrators will need. This text is just the right reference for any experienced computer user wanting an understanding of Linux. Tobler leaves the monotonous steps to a minimum and instead fits readers' sophisticated needs in a thought-provoking manner.
The design of a parser generator
Authors: David A. Workman, John B. Higdon
Venue: Proceedings of the 16th annual Southeast regional conference (1978)

In this paper we present an algorithm for generating bounded-context parsers using a modified version of Knuth's algorithm for generating LR(k) parsers. We also describe the internal design of a parser generating system capable of constructing the parsing tables for (s,l) bounded-context and LR(1) parsers. The parser generating system is written in PL/1 and is operational on an IBM-370/165. The data we have collected to date on the performance of the system is encouraging; to build the states of an LR(1) parser for a 488 production grammar for the proposed ANS FORTRAN (SIGPLAN 1976) required 480K bytes of core and 3.5 minutes of CPU time.Our algorithm for generating bounded-context parsers produces a canonical set of parsing tables similar to the "action" and "goto" tables required for canonical LR(k) parsers. A parameter, s, input to the algorithm specifies how many symbols may be used to make a decision in any given state of the parser. If storage is more of a premium than time, the goto-table can be organized in such a way that its size is a function only of the number of states. The algorithm has several advantages over traditional algorithms for bounded-context and precedence parsing. First, the theory is parallel to that for LR(k) parsing and thus makes possible a unified approach to the study of bottom-up parsing. Second, the differences between precedence and bounded-context algorithms are emphasized by the theory and born out in the efficiency of their respective implementations. Finally, the algorithm is "restartable;" that is, if a deterministic parser is not obtained for a given value of "s," much of the information generated for case "s" can be preserved and need not be regenerated for the case "s+1."
Principles of Information Systems: A Managerial Approach, 2nd edition
Authors: Ralph M. Stair
Venue:  (1995)

:Principles of Information Systems, Fourth Edition brings to readers the cutting edge of technology, in a introductory framework that stresses the most current and common business applications of that technology.
Special Edition Using Java Server Pages and Servlets
Authors: Mark Wutka
Venue:  (2000)

:Special Edition Using JSP and Servlets starts by detailing the evolution of web servers that led to the creation of ASP and JSP. It explains both the limitations of previous technologies and the benefits that JSP provides including platform independence. Includes coverage of: organizing applications with multiple files and client-side objects, generating well-formed XML using JSP, storing data in cookies and sessions, interacting with Enterprise Java Beans, displaying dynamic graphics with Java 2D, and using RMI and Corba to enhance JSP applications. The final chapters demonstrate advanced JSP & Servlet techniques, including using JSP to create wireless & XML-based applications. Appendices provide an overview of popular JSP & Servlet runtime environments, including Jrun, Tomcat and ServletExec.
Wait-free consensus with infinite arrivals
Authors: James Aspnes, Gauri Shah, Jatin Shah
Venue: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (2002)

A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin algorithm that uses weighted voting to achieve a majority outcome with at least constant probability that cannot be disguised even if a strong adversary is allowed to destroy infinitely many votes. The number of operations performed by process i is a polynomial function of i. Additional algorithms are given for solving consensus more efficiently in models with an unknown upper bound b on concurrency or an unknown upper bound n on the number of active processes; under either of these restrictions, it is also shown that the problem can be solved even with infinitely many anonymous processes by prefixing each instance of the shared coin with a naming algorithm that breaks symmetry with high probability. For many of these algorithms, matching lower bounds are proved that show that their per-process work is nearly optimal as a function of i, b, or n. The case of n active processes gives an algorithm for anonymous, adaptive consensus that requires only O(n log2 n) per-process work, which is within a constant factor of the best previously known non-adaptive algorithm for a strong adversary. Finally, it is shown that standard universal constructions based on consensus continue to work with infinitely many processes with only slight modifications. This shows that in infinite distributed systems, as in finite ones, with randomness all things are possible.
Designware: software development by refinement
Authors: Douglas R. Smith
Venue: High integrity software (2001)

This paper presents a mechanizable framework for software development by refinement. The framework is bawed on a category of higher-order specifications. The key idea is representing knowledge about programming concepts, such as algorithm design, datatype refinement, and expression simplification, by means of taxonomies of specifications and morphisms. The framework is partially implemented in the research systems Specware, Designware, and Planware. Specware provides basic support for composing specifications and refinements via colimit, and for generating code via logic morphisms. Specware is intended to be general-purpose and has found use in industrial settings. Designware extends specware with taxonomies of software design theories and support for constructing refinements from them. Planware builds on designware to provide highly automated support for requirements acquisition and synthesis of high-performance scheduling algorithms.