ppxscal/embedding_network huggingface dataset:
Proceedings of the sixth annual international conference on Computational biology
Authors: Gene Myers, Sridhar Hannenhalli, David Sankoff, Sorin Istrail, Pavel Pevzner, Michael Waterman
Venue: Annual Conference on Research in Computational Molecular Biology (2002)

The papers in this volume were presented at the Sixth Annual International Conference on Computational Biology RECOMB 2002, held in Washington, D.C. on April 18-21, 2002. The RECOMB series was started in 1997 by Sorin Istrail, Pavel Pevzner and Michael Waterman. RECOMB '99 took place in Lyon, France, RECOMB 2000 was held in Tokyo, Japan, and RECOMB 2001 was held in Montreal, Quebec, Canada.This year's call for papers gave rise to 118 submissions, out of which the program committee selected 35 papers to be presented at the conference and included in the proceedings. Each submission was refereed by at least three members of the program committee. After the completion of the referees' reports, an extensive web-based discussion took place.RECOMB 2002 had 8 invited speakers: Ruben Abagyan (The Scripps Research Institute), Ali H. Brivanlou (Rockefeller University), Evan Eichler (Case Western Reserve University), Harold "Skip" Garner (University of Texas Southwestern Medical Center at Dallas), David Ho (Rockefeller University), Gerry Rubin (Howard Hughes Medical Institute), J. Craig Venter (Celera) and Marc Vidal (Dana-Farber Cancer Institute). The Stanislaw Ulam Memorial Lecture was given by J. Craig Venter. The Distinguished Biology Lecture was given by David Ho. The Distinguished New Technologies Lecture was given by Harold Garner.Complete final versions of many of the papers presented in the conference will appear in a special issue of the Journal of Computational Biology, which is closely affiliated with the conference.
Pokemon Stadium Official Battle Guide
Authors: Jeffery Nelson, Tim Bogenn
Venue:  (2000)

:This BradyGAMES strategy guide has a detailed listing of statistics for all 150 Pokemon, along with tips on the best Pokemon combinations to defeat the trainers and gym leaders. The book includes complete coverage of all mini-games and the best strategies to defeat all opponents. Game tips and secrets are revealed.
Applying a mediator architecture employing XML to retailing inventory control
Authors: Stephen Chan, Tharam Dilon, Andrew Siu
Venue: Journal of Systems and Software (2002)

The concept of mediation has been successfully applied to the development of distributed information systems, where mediators form the middle tier between client applications and data resources, providing valuable abstraction and integration functions. Extensible MarkUp Language (XML) has been used to develop self-describing data models and common interfaces for mediators to be deployed in Web-based information systems. This makes such systems easier to develop, to maintain, and to evolve. This paper discusses the design of such an architecture and its application in retail inventory control in electronic commerce (e-commerce). The prototype system is implemented with Java Servlets and CORBA.
Real-time UML-based performance engineering to aid manager's decisions in multi-project planning
Authors: A. Bertolino, E. Marchetti, R. Mirandola
Venue: Proceedings of the 3rd international workshop on Software and performance (2002)

We investigate the usage of software performance engineering to aid the project manager in making sound, reliable predictions in software development, and in optimizing the utilization of resources (typically the people). We assimilate the project teams to the processing elements of a performance model, and their activities to the tasks to be accomplished within established time intervals. The proposed methodology uses as the manager's interface a subset of Real-Time UML, the recently adopted OMG standard specialized profile for addressing schedulability, performance and timeliness. To illustrate the approach, we model the case of a manager that must decide a release date for a product undergoing the testing phase. We show how, by means of basic performance analyses, different workflow assumptions can be explored and their consequent outcomes automatically derived: by looking at the analysis results, the manager can thus take an informed, more responsible decision.
Modulo schedule buffers
Authors: Matthew C. Merten, Wen-mei W. Hwu
Venue: Proceedings of the 34th annual ACM/IEEE international symposium on Microarchitecture (2001)

As VLIW/EPIC processors are increasingly used in real-time, signal-processing, and embedded applications, the importance of minimizing code size and reducing power is growing. This paper describes a new architectural mechanism, called the Modulo Schedule Buffers, that provides an elegant interface for the execution of modulo scheduled loops. While the performance is similar to that of kernel-only modulo scheduling, this mechanism has a number of advantages, including minimal code expansion. Rather than generating fully-scheduled kernels, the compiler generates a sequential form of the modulo scheduled loop body. Using the sequential form, the hardware internally synthesizes the prologue, kernel, and epilogue. In addition, while loops can be scheduled with fewer constraints and fewer explicit prologues/epilogues than with existing mechanisms. Because the hardware controls loop execution, the burden of modulo schedule loop control is lifted from the predicate register file, allowing for a less rigorous predication implementation. Finally; hardware control limits the interrupt latency when using the EQ explicit latency model to the execution latency of one iteration, rather than the whole loop invocation.
A Factored Approximate Inverse Preconditioner with Pivoting
Authors: Matthias Bollhöfer, Yousef Saad
Venue: SIAM Journal on Matrix Analysis and Applications (2001)

In this paper we develop new techniques for stabilizing factored approximate inverse preconditioners (AINV) using pivoting. This method yields stable preconditioners in many cases and can provide successful preconditioners in many situations when the underlying system is highly indefinite. Numerical examples illustrate the effectiveness of this approach.
Hierarchical subspace sampling: a unified framework for high dimensional data reduction, selectivity estimation and nearest neighbor search
Authors: Charu C. Aggarwal
Venue: Proceedings of the 2002 ACM SIGMOD international conference on Management of data (2002)

With the increased abilities for automated data collection made possible by modern technology, the typical sizes of data collections have continued to grow in recent years. In such cases, it may be desirable to store the data in a reduced format in order to improve the storage, transfer time, and processing requirements on the data. One of the challenges of designing effective data compression techniques is to be able to preserve the ability to use the reduced format directly for a wide range of database and data mining applications. In this paper, we propose the novel idea of hierarchical subspace sampling in order to create a reduced representation of the data. The method is naturally able to estimate the local implicit dimensionalities of each point very effectively, and thereby create a variable dimensionality reduced representation of the data. Such a technique has the advantage that it is very adaptive about adjusting its representation depending upon the behavior of the immediate locality of a data point. An interesting property of the subspace sampling technique is that unlike all other data reduction techniques, the overall efficiency of compression improves with increasing database size. This is a highly desirable property for any data reduction system since the problem itself is motivated by the large size of data sets. Because of its sampling approach, the procedure is extremely fast and scales linearly both with data set size and dimensionality. Furthermore, the subspace sampling technique is able to reveal important local subspace characteristics of high dimensional data which can be harnessed for effective solutions to problems such as selectivity estimation and approximate nearest neighbor search.
Xml: Content and Data
Authors: Kelly Carey, Stanko Blatnik
Venue:  (2002)

:XML: Content and Data is a classroom-tested, pedagogically-based textbook designed to support students and faculty learning XML and XML technologies. This textbook has been developed to help students make the transition from understanding basic concepts to building client-based applications. It offers simple, clear explanations, real-world examples and exercises, and website support materials. XML: Content and Data will help readers to learn XML and to plan, build, and test quality XML web-based applications. XHTML, CSS, XML, DOM, XSLT, SAX, XSL, Server Side XML, Schemas and DTDs, and WML are defined, explored, and thoroughly developed within the text. The Companion Website offers solution sets, a tools resource center, and debugging tips along with updates, commercial projects, and additional resources. The authors, Kelly Carey and Stanko Blatnik, teach XML technologies at West Valley College in California, the University of Sarajevo, and internationally for commercial and non-profit audiences. After years of experience teaching a wide range of technologies to diverse student populations, Kelly and Stanko wrote XML: Content and Data with an understanding of readers' expectations: to understand XML and to be able to apply that understanding toward commercial XML project development.
Using Sans and NAS, 1st edition
Authors: W. Curtis Preston
Venue:  (2002)

:Data is the lifeblood of modern business, and modern data centers have extremely demanding requirements for size, speed, and reliability. Multi-terabyte data stores are common; petabyte data stores are not unheard of. But given this much data, how do you ensure it's always available, that access times and throughput are reasonable, and that the data can be backed up and restored in a timely manner. Using SANs and NAS shows you how to use the latest technologies for building large data centers. It helps you understand which complementing technologies are appropriate for your network. How do SANs and NAS differ, and how are they alike? How is NAS different from simple NFS and SMB/CIFS? What future technologies, such as iSCSI and DAFS, might affect the picture? What are the building blocks of a SAN, and how can they be assembled for effective storage solutions? Most important, Using SANs and NAS pays special attention to the problems of backing up huge data stores. How do you design a cost-effective backup system that can perform a backup or recovery of your multi-terabyte storage system in a reasonable time? What virtualization technologies can be used to make backup and recovery almost instantaneous? Using SANs and NAS is a practical book that gives storage administrators the tools they need to solve the toughest problems. It is an essential part of a storage administrator's library.
Java 1.2unleashed, 4th edition
Authors: Jamie Jaworski
Venue:  (1998)

:Extensive coverage of the latest Java add-ons and third-party development tools. Ideal for the intermediate- to expert-level user, this guide explores the new Java extensions and APIs, JavaBeans, JavaOS, and other new Java-based technologies; guides the reader in using JDBC to gain database connectivity; teaches effective programming strategies and application development; and investigates Java security. Using expert tips, advice and real-world examples, this comprehensive guide and reference is ideal for readers wanting to master professional-level programming with Java.Totally rewritten to aim at the high-end audienceCovers JFC, Java Media Framework, JavaBeans, JDBC, security, e-commerce, network programming, distributed computing, CORBA, RMI, and moreValuable CD-ROM includes 20 complete, original Java applications written exclusively for this book
Communications Systems; Engineers' Choices, 3rd edition
Authors: Geoff Lewis
Venue:  (1998)

:This is a complete revision of the second edition of Communications Services via Satellites. It brings the material covered right up to date, including much more information on coding and modulation systems such as MOBIC, digital SNG systems, mobile phones, MPEG, MPEG4 capabilities and Hypermedia, the Grand Alliance TV systems, MUSE and how it is used in Japan, the European and North American Digital Video Broadcasting Systems, MMDS and Digital Audio Broadcasting. Basic Communication ConceptsNoise and Interference Electromagnetic Waves, Propagation and Antennas Microwave Circuit Elements Digital Signal Processing Digital and Digital/Analogue Communications Systems Satellite Weather, Environmental, Mobile and Navigation Services Global Business Systems, Ancillary Services and Hybrid Systems Analog Television Systems Digital Television Systems Television Receivers and Distribution Systems Television Sound and Radio Channels Information Security and Conditional Access Installation and Maintenance of Small Satellite Systems
Formal data base specification: an eclectic perspective
Authors: Marco A. Casanova, Paulo A. S. Veloso, Antonio L. Furtado
Venue: Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems (1984)

Logical, algebraic, programming language, grammatical and denotational formalisms are investigated with res pect to their applicability to formal data base speci fication. On applying each formalism for the purpose that originally motivated its proposal, it is shown that they all have a fundamental and well integrated role to play in different parts of the specification process. An example is included to illustrate the methodological aspects.
FAD method to compute second order derivatives
Authors: Yuri G. Evtushenko, E. S. Zasuhina, V. I. Zubov
Venue: Automatic differentiation of algorithms: from simulation to optimization (2000)

We develop a unified methodology for computing second order derivatives of functions obtained in complex multistep processes and derive formulas for Hessians arising in discretization of optimal control problems. Where a process is described by continuous equations, we start with a discretization scheme for the state equations and derive exact gradient and Hessian expressions. We introduce adjoint systems for auxiliary vectors and matrices used for computing the derivatives. A unique discretization scheme is automatically generated for vector and matrix adjoint equations. The structure of the adjoint systems for some approximation schemes is found. The formulas for second derivatives are applied to examples.
Computer Accounting with Peachtree for Microsoft Windows Release 5.0 Package, 3rd edition
Authors: Carol Yacht
Venue:  (1998)

:Computer Accounting with Peachtree for Microsoft Windows teaches students how to use Peachtree Accounting for Windows software. The text first builds students' familiarity with all of the features of Release 5.0. Then, beginning with Chapter 8, computer accounting skills are reviewed in more depth. Step-by-step instructions show students how to apply accounting concepts to real-world situations.
Smartsuit Millenniun Edition Bible, 1st edition
Authors: Lisa A. Bucki, David N. Plotkin, Brian Underdahl, Elaine J. Marmel
Venue:  (1998)

:If SmartSuite can do it, you can do it too Turn your desktop into a fully staffed office with just a click of the mouse. With its productivity tools and built-in Internet innovations, SmartSuite enables you to quickly meet every one of your business challenges  from managing information to creating dynamite presentations to building Web sites. A smart business tool, SmartSuite® Millennium Edition Bible reveals all the tips, tricks, and techniques you'll need to get your work done quickly and easily. Inside, you'll find complete coverage of SmartSuite Millennium Edition*Boost productivity with SmartCenter and Team Computing*Create striking presentations in Freelance Graphics*Generate precise reports with 1-2-3's powerful data management and analysis tools*Master ViaVoice  SmartSuite's voice-recognition technology in Word Pro*Build your own Web site with FastSite*Construct and manage a flexible, powerful database in Approach*Transform your computer into an electronic Filofax with OrganizerDictate all your memos, letters, and reports straight to your computer  with Via Voice!
An Efficient Partitioning Algorithm for Distributed Virtual Environment Systems
Authors: John C. S. Lui, M. F. Chan
Venue: IEEE Transactions on Parallel and Distributed Systems (2002)

Distributed virtual environment (DVE) systems model and simulate the activities of thousands of entities interacting in a virtual world over a wide area network. Possible applications for DVE systems are multiplayer video games, military and industrial trainings, and collaborative engineering. In general, a DVE system is composed of many servers and each server is responsible to manage multiple clients who want to participate in the virtual world. Each server receives updates from different clients (such as the current position and orientation of each client) and then delivers this information to other clients in the virtual world. The server also needs to perform other tasks, such as object collision detection and synchronization control. A large scale DVE system needs to support many clients and this imposes a heavy requirement on networking resources and computational resources. Therefore, how to meet the growing requirement of bandwidth and computational resources is one of the major challenges in designing a scalable and cost-effective DVE system. In this paper, we propose an efficient partitioning algorithm that addresses the scalability issue of designing a large scale DVE system. The main idea is to dynamically divide the virtual world into different partitions and then efficiently assign these partitions to different servers. This way, each server will process approximately the same amount of workload. Another objective of the partitioning algorithm is to reduce the server-to-server communication overhead. The theoretical foundation of our dynamic partitioning algorithm is based on the linear optimization principle. We also illustrate how one can parallelize the proposed partitioning algorithm so that it can efficiently partition a very large scale DVE system. Lastly, experiments are carried out to illustrate the effectiveness of the proposed partitioning algorithm under various settings of the virtual world.
Gameshark: Pocket Power Guide
Authors: Nick Roberts
Venue:  (1997)

:Take a bite out of your favorite games with this authorized power guide that supplies you with cheats and codes for hundreds of your favorite PlayStation and Sega Saturn games, including Final Doom, MLB 98, and Tomb Raider.
VHDL Modeling for Digital Design Synthesis
Authors: Yu-Chin Hsu, Eric S. Lin, Kevin F. Tsai, Jessie T. Liu
Venue:  (1995)

:The purpose of VHDL Modeling for Digital Design Synthesis is to introduce VHSIC Hardware Description Language (VHDL) and its use for synthesis. VHDL is a hardware description language which provides a means of specifying a digital system over different levels of abstraction. It supports behavior specification during the early stages of a design process and structural specification during the later implementation stages. VHDL was originally introduced as a hardware description language that permitted the simulation of digital designs. It is now increasingly used for design specifications that are given as the input to synthesis tools which translate the specifications into netlists from which the physical systems can be built. One problem with this use of VHDL is that not all of its constructs are useful in synthesis. The specification of delay in signal assignments does not have a clear meaning in synthesis, where delays have already been determined by the implementation technology. VHDL has data-structures such as files and pointers, useful for simulation purposes but not for actual synthesis. As a result, synthesis tools accept only subsets of VHDL. This book covers the synthesis aspect of VHDL, while keeping the simulation-specifics to a minimum. VHDL Modeling for Digital Design Synthesis is designed for working professionals as well as for graduate or undergraduate students. Readers can use this book to get acquainted with VHDL and to learn how it can be used in modeling of digital designs.
Mous PowerPoint 2000 Exam Prep: The Most Comprehensive, Interactive, and Visual Microsoft Certification Study Guide on Microsoft PowerPoint 2000 With
Authors: David W. Beskeen, Certification Insider Press
Venue:  (2000)

:Certification Insider Press' MOUS PowerPoint 2000 Exam Prep is written to help office professionals prepare quickly for the Microsoft PowerPoint 2000 exam. Includes performance-based projects to help readers quickly test their skills. Fully illustrated in two colors to help visualize tricky concepts. Explains all of the PowerPoint 2000 techniques that readers will need to know to be proficient with Microsoft PowerPoint 2000 in a clear step-by-step format. Serves as an excellent reference guide for future use. Written by an experienced certification trainer.
Designing Secure Web-Based Applications for Microsoft Windows 2000 with CDROM
Authors: Michael Howard, Marc Levy, Richard Waymire
Venue:  (2000)

:Today, businesses use networks consisting of intranets, Internet sites, and extranets, all of which extend the network, requiring increased system security. In addition, confidential information may be stored on mobile computing devices, which are subject to theft and loss. Windows 2000 provides end-to-end security that lets organizations integrate systems both inside and outside the corporate network boundaries, while providing complete access control and data protection. Security features include advanced techniques for identifying who is accessing the system, including the use of digital "keys" to access selected data, and a single ID that permits users to access not only their own computer, but also other shared resources (such as printers or files) on the corporate network, the Internet, or even a business partner's network
Computing Densities for Markov Chains via Simulation
Authors: Shane G. Henderson, Peter W. Glynn
Venue: Mathematics of Operations Research (2001)

We introduce a new class of density estimators, termed look-ahead density estimators, for performance measures associated with a Markov chain. Look-ahead density estimators are given for both transient and steady-state quantities. Look-ahead density estimators converge faster (especially in multidimensional problems) and empirically give visually superior results relative to more standard estimators, such as kernel density estimators. Several numerical examples that demonstrate the potential applicability of look-ahead density estimation are given.
Relational data mining applications: an overview
Authors: Saso Dzroski
Venue: Relational Data Mining (2001)

This chapter gives an overview of applications of relational learning and inductive logic programming to data mining problems in a variety of areas. These include bioinformatics, where successful applications come from drug design, predicting mutagenicity, and carcinogenicity, and predicting protein structure and function, including genome scale prediction of protein functional class. Other application areas include medicine, environmental sciences and monitoring, mechanical and traffic engineering. Applications of relational learning are also emerging in business data analysis, text and Web mining, and miscellaneous other fields, such as the analysis of musical performances.
UNIX System V Release 4 Administration, 2nd edition
Authors: David Fiedler, Ben Smith, Bruce H. Hunter
Venue:  (1991)

:An easy-to-use reference for UNIX productivity! Essential for everyone who runs a UNIX operating system.Covers the most recent releases of UNIXFeatures a great reference for TCP/IP and NFS utilitiesExplains the requirements and installation of X Windows clients and servers