ppxscal/embedding_network huggingface dataset:
The Lattice Structure of Behaviors
Authors: Shiva Shankar
Venue: SIAM Journal on Control and Optimization (2000)

If a linear, continuous, shift invariant distributed system is considered as a (dynamical) system converting input signals to output signals, then this information is encapsulated in the impulse response or the transfer function of the system. The set of all transfer functions has the structure of a ring, corresponding to the operations of parallel and cascade connections of two systems. However, in the behavioral theory of Willems, a system is not described in terms of its input-output transformation property. Indeed, the concept of a behavior does not even need the notions of inputs and outputs and is therefore more fundamental than the classical concept of a system given by its transfer function. The question then arises as to what is the structure of the set of all behaviors. This paper argues that the relevant structure here is that of a modular lattice.
DOA 2: Hardcore
Authors: Christine Cain, Joe Cain
Venue:  (2000)

:The hottest buff and buxom characters are back for even more action in one of the most highly anticipated PlayStation 2 games, DOA2: HARDCORE! With all new play modes, fighting stages, and moves, youll need DOA2: HARDCORE--PRIMAS OFFICIAL STRATEGY GUIDE to guide the way. Let Prima help you with moves lists, complete combos for every fighter, tactics for blocking every foes deadly attacks, Tag Team tips, damage totals for each punch, kick, and combo, and exciting new secrets.
On the equivalence of logical databases
Authors: Gabriel M. Kuper, Jeffrey D. Ullman, Moshe Y. Vardi
Venue: Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems (1984)

We suggest a new approach to database updates, in which a database is treated as a collection of theories. We investigate two issues: a) equivalence of databases under update operations, b) simultaneous multiple update operations.
A Predicted Sequential Regularization Method for Index-2 Hessenberg DAEs
Authors: Ping Lin, Raymond J. Spiteri
Venue: SIAM Journal on Numerical Analysis (2001)

The sequential regularization method (SRM) is a dynamic iterative method for the numerical solution of higher-index differential-algebraic equations (DAEs). The SRM has the advantage of being based on a regularized problem that is less stiff than those produced by standard regularization methods. Consequently, nonstiff integrators may be used, making the SRM a competitive alternative to popular integrators. In past work, the number of SRM iterations was taken to be roughly equal to the order of the numerical method used in each dynamic iteration. In this paper, we propose a predicted SRM (PSRM) that reduces the number of iterations in each dynamic iteration to one. We give a new error analysis for explicit Runge--Kutta methods applied to linear index-2 Hessenberg DAEs with or without singularities. We also give numerical examples to confirm the predicted convergence rates. For the PSRM, extrapolation formulas and methods based on the differential part of the DAEs serve as a predictor, and the SRM iteration serves as a corrector. Implementation of higher-order schemes for the PSRM makes use of continuous extensions of Runge--Kutta methods. In particular, we give a prediction scheme for the algebraic variable at intermediate stage points that suppresses order reduction in the differential variable near a singularity. Moreover, the SRM/PSRM provides new insight into operator splitting and fast convergence rates for waveform relaxation.
Computer Fun Writing
Authors: Lisa Trumbauer
Venue:  (2000)

:Explains how to use a personal computer to complete activities that explore various aspects of Halloween.
3d Computer Graphics with Cdrom, 3rd edition
Authors: Alan H. Watt
Venue:  (1999)

:Features NEW! Chapter on Advanced Radiosity NEW! Chapter on Animation NEW! Chapter on Precalculation Techniques NEW! Material about real-time applications for high complexity, such as progressive mesh optimization, BSP tree, precalculation techniques, and photo-modeling techniques Enhanced coverage of advances in rendering Complete revision of material on animation Includes a CD-ROM with a 400 image study and several computer graphics programs
Static and dynamic low-congested interval routing schemes
Authors: Serafino Cicerone, Gabriele Di Stefano, Michele Flammini
Venue: Theoretical Computer Science (2002)

Interval routing schemes (IRS) have been extensively investigated in the past years with special emphasis on shortest paths. Besides their theoretical interest, IRS have practical applications, as they have been implemented with wormhole routing in the last generation of INMOS transputer router chips. In this paper we consider IRS that are optimal with respect to the congestion of the induced path system. In fact, wormhole routing is strongly influenced by the maximum number of paths that share a physical link and from low to moderate congestion it outperforms the packet switching technique. We provide a general framework able to deal with the various congestion issues in IRS. In fact, we will distinguish between static cases, in which the source-destination configurations are fixed, and dynamic cases, where they vary over time. All these situations can be handled in a unified setting, thanks to the notion of competitiveness introduced in this paper. We first give some general results not related to specific traffic demands. Then, in the one-to-all communication pattern, we show that constructing competitive IRS for a given network is an intractable problem, both for the static and the dynamic case, that is when the root vertex is fixed and when it can change along the time, respectively. Finally, both for one-to-all and all-to-all communication patterns, we provide nicely competitive k-IRS for relevant topologies. Networks considered are chains, trees, rings, chordal rings and multi-dimensional grids and tori. We consider both the directed congestion case, in which there are pairwise opposite unidirectional links connecting two neighbor processors, and the undirected congestion case, in which two neighbors are connected by a single bi-directional link.
Official MAX 2 Strategy Guide
Authors: Mark H. Walker, Brady Games
Venue:  (1998)

:The BradyGames strategy guide will include maps for every mission plus detailed walkthroughs for each level. Multi-player strategies for intense head-to-head action. Tips for creating your own levels.Sequel to critically acclaimed M.A.X. (Mechanized Assault & Exploration) perfected with gamer suggestions and revolutionary technology.
Biangle surface patches
Authors: Kȩstutis Karčciauskas
Venue: Mathematical Methods for Curves and Surfaces: Oslo 2000 (2001)

General construction of a two-sided surface patch of degree 2n is introduced and its main properties (degree evaluation, subdivision, etc.) are described. As an important special case the biangle patches suitable for inclusion into spline surfaces are presented. They are generalization of Sabin's two-sided patch. Applications are illustrated by freedom spline surfaces representing a sphere exactly.
Mobility modeling in wireless networks: categorization, smooth movement, and border effects
Authors: Christian Bettstetter
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2001)

The movement pattern of mobile users plays an important role in performance analysis of wireless computer and communication networks. In this paper, we first give an overview and classification of mobility models used for simulation-based studies. Then, we present an enhanced random mobility model, which makes the movement trace of mobile stations more realistic than common approaches for random mobility. Our movement concept is based on random processes for speed and direction control in which the new values are correlated to previous ones. Upon a speed change event, a new target speed is chosen, and an acceleration is set to achieve this target speed. The principles for direction changes are similar. Finally, we discuss strategies for the stations' border behavior (i.e., what happens when nodes move out of the simulation area) and show the effects of certain border behaviors and mobility models on the spatial user distribution.
Windows Me Secrets
Authors: Brian Livingston, Davis Straub
Venue:  (2000)

:Microsoft® Windows Me Millennium Edition Secrets® For nearly a decade, Brian Livingston and Davis Straub have been tracking down the shortcuts, tune-ups, fixes, and workarounds that let you get more done  and have more fun  with Microsoft Windows. From streamlining Internet access to tweaking the Registry, their latest guide delivers hundreds of Windows Me secrets that will take your productivity to a new level. Take control of Windows® Me*Replace the Windows logo screens when you boot up (see Chapter 3)*Launch an application from your scanner or digital camera (see Chapter 4)*Set up a small network quickly and cheaply (see Chapter 18)*Beef up encryption for Internet Explorer 5.5 (see Chapter 26)*Create a command line shortcut for Outlook Express (see Chapter 27)*Troubleshoot NetMeeting sound card problems (see Chapter 33)*Fine-tune your caching and swapping to boost performance (see Chapter 39)*Save time with Win key keyboard shortcuts (see Chapter 42)*Enable surround sound (see Chapter 47)
Aggregation query model for OODBMS
Authors: J. Wenny Rahayu, David Taniar, Xiaoyan Lu
Venue: Proceedings of the Fortieth International Conference on Tools Pacific: Objects for internet, mobile and embedded applications (2002)

Query language and querying facilities are critical factors for wide acceptance of Object-Oriented Database Management Systems (OODBMS) in the market. In this paper, we focus on query model on an aggregation hierarchy. We call this query "Aggregation Query". Query on an aggregation hierarchy is unique and differs from general query on association relationships. The latter is often known as path expression query. The difference is analogous to the distinction between association and aggregation in object modelling. In our proposal, we present three important elements of aggregation query, particularly (i) aggregation query hierarchy, (ii) shorthand path expression for aggregation query utility, and (iii) retrieving aggregation tree. Whilst the first element above is adopted from path expression queries, the second element is an extension to general path expression query, and the third element is unique to aggregation, as aggregation resembles a Part-Of relationship, which is more specialized than association relationships.
Developing an enterprise information security policy
Authors: Jinx P. Walton
Venue: Proceedings of the 30th annual ACM SIGUCCS conference on User services (2002)

The University of Pittsburgh is at the midpoint of a three-year strategic plan focused on information technology. Our strategic direction is based on a tiered model consisting of these layers: network infrastructure, middleware, Web infrastructure, and the set of applications and services that can be provided to our user community. As applications and services become increasingly more complex, there is a greater potential for security breaches that must be adequately addressed.The ability for students and faculty to share data and collaborate on projects is of utmost importance to any higher education institution. A large, multidisciplinary institution such as the University of Pittsburgh must be able to find an effective balance between the need to provide people in the local, national, and international communities with access to information and the need to protect sensitive information from unauthorized access and misuse.The subject of information security has received a great deal of attention within academia before and after the events of September 11, 2001. Federal regulations such as the HIPAA legislation protecting patient data, the USA PATRIOT Act, and the Digital Millennium Copyright Act all have significant impact. The complexities involved in developing adequate security plans have resulted in the development of the ISO 17799 standard, used widely in security plan development.A University-wide security plan is under development that, when completed, will address security at all levels. This comprehensive security plan will cover policies, business practice changes, and user awareness concerns. This presentation focuses on the process that is underway to identify security issues and to design and implement a comprehensive security plan that maintains an open academic environment and fully addresses relevant legislation and best practice models.
CCIE Resource Kit
Authors: Caslow, Black, Huitema
Venue:  (1998)

:This three-volume set delivers all the resources you need to pass Cisco's brutal CCIE exam - and excel as a Cisco internetworking professional. It even includes a complete book on ATM internetworking - a topic that's just been added to the CCIE exam! Cisco Certification: Bridges, Routers and Switches for CCIEs is designed to dramatically improve your odds of passing the CCIE exam through proven test-prep techniques such as internetwork "issue spotting," troubleshooting and analysis. This systematic study guide covers step-by-step configuration issues, expert use of Cisco IOS Show commands, and a detailed analysis of IOS debugging tools. Routing in the Internet is the most authoritative guide to advanced Internet routing - a crucial part of the CCIE exam. Written by a recognized leader in Internet standards development, it covers everything you'll need to know, including basic principles, RIP, OSPF, EGP, BGP, CIDR, policy routing, IP multicasting, resource reservation, IPv6, and more. ATM, Volume III: Internetworking is the definitive guide to ATM internetworking, by widely-respected consultant and author Uyless Black - known for straight talk about complex technologies. He covers it all - including advanced topics like MPOA, LANE, Classical IP Over ATM, Frame-based ATM, and more. Put it together and you can't find a more authoritative, more helpful resource for passing the CCIE - and for succeeding in the internetworking field! Every professional pursuing CCIE certification, and millions of networking professionals worldwide who use Cisco equipment. Cisco Certification: Bridges, Routers and Switches for CCIEs - end-to-endCCIE exam preparation, with outstanding configuration and troubleshooting coverage! Routing in the Internet - all the latest advanced in Internet routing, taught by the former Chair of the Internet Architecture Board, Christian Huitema. ATM, Volume III: Internetworking - Critical ATM fundamentals that have just been added to the CCIE curriculum!
Artificial Intelligence in the Capital Markets: State-of-the-Art Applications for Institutional Investors, Bankers and Traders
Authors: Roy A. Freedman, Robert A. Klein
Venue:  (1994)

:Unlike other books on artificial intelligence which emphasize theory,Artificial Intelligence in the Capital markets is eminently practical. Not only does it describe actual applications,it provides a wealth of information about systems design,software products,and leading consulting firms in the industry. Comprehensive and authoritative,the book covers the entire AI field from the perspective of an existing or prospective user of AI technologies. Some of the applications highlighted in the breakthrough book include: fidelity investments applying neural networks to stock selection; hedge fund manager James O'Sullivan using neural networks to filter information and identify investment opportunities; Lehman Brothers designing an "intelligent infrastructure" for its front office.
STATEMATE: a working environment for the development of complex reactive systems
Authors: David Harel, Hagi Lachover, Amnon Naamad, Amir Pnueli, Michal Politi, Rivi Sherman, Aharon Shtull-Trauring, Mark Trakhtenbrot
Venue: Readings in hardware/software co-design (2001)

This paper provides an overview of the STATEMATE system, constructed over the past several years by the authors and their colleagues at Ad Cad Ltd., the R & D subsidiary of i-Logix, Inc. STATEMATE is a set of tools, with a heavy graphical orientation, intended for the specification, analysis, design, and documentation of large and complex reactive systems, such as real-time embedded systems, control and communication systems, and interactive software or hardware. It enables a user to prepare, analyze, and debug diagrammatic, yet precise, descriptions of the system under development from three interrelated points of view, capturing structure, functionality, and behavior. These views are represented by three graphical languages, the most intricate of which is the language of statecharts [4], used to depict reactive behavior over time. In addition to the used of statecharts, the main novelty of STATEMATE is in the fact that it "understands" the entire descriptions perfectly, to the point of being able to analyze them for crucial dynamic properties, to carry out rigorous executions and simulations of the described system, and to create running code automatically. These features are invaluable when it comes to the quality and reliability of the final outcome.
Using Microsoft Office 97 (Platinum Edition)
Authors: Que Corporation, Kathy Ivens
Venue:  (1997)

:This solutions-oriented reference goes beyond the standard Special Edition books and leads users to an unparalleled level of Office productivity. With the insightful guide, productivity software, and extended reference library, this is the ideal resource for users who want to take Microsoft Office to the next level.Provides special emphasis on Office integration for power users and workgroup leadersTwo CD-ROMs contain Que s Extended Microsoft Office 97 Electronic Quick Reference Set, which includes electronic versions of the Word, Excel, PowerPoint, Access, and Outlook Quick References; Web-related software; Office and Windows productivity and utility software; and the latest Microsoft updates
Solaris for Managers and Administrators, 3rd edition
Authors: Curt Freeland, Dwight McKay, Kent Parkinson
Venue:  (2000)

:Written for systems administrators by systems administrators, Solaris for Managers and Administrators, 3rd Edition is for readers seeking to maximize the power of Solaris, the UNIX operating environment for "dot-com" companies running the latest Internet appliances and powering the largest Web sites and Web portals." "Ideal for entry-level systems managers with general UNIX knowledge, but little Sun systems administration experience, this book offers practical guidance on the planning, installation, and maintenance of Solaris 2.0 through Solaris 8.0 systems. Numerous examples - plus strategically located Notes, Tips, and Warnings - ensure that even the most difficult concepts are addressed. This book is a tool for every systems administrator tasked with managing a corporate-sized computer installation.
Asymptotic Optimality of Approximate Filters in Stochastic Systems with Colored Noises
Authors: Alain Le Breton, Marie-Christine Roubaud
Venue: SIAM Journal on Control and Optimization (2000)

Approximate filters are proposed for semilinear and nonlinear stochastic systems with colored noises. Basically these filters are defined as those which are optimal when the noises are white. Their long time behavior is investigated and their asymptotic optimality is shown in two cases under some reasonable assumptions.
SDI supply chain builder: SDI supply chain builder: simulation from atoms to the enterprise
Authors: Richard A. Phelps, David J. Parsons, Andrew J. Siprelle
Venue: Proceedings of the 33nd conference on Winter simulation (2001)

The SDI Supply Chain Builder Product Suite is a high-level simulation toolset that provides solutions to enterprise problems. The product suite contains four specific elements for enterprise modeling: SDI Supply Chain Builder for supply/distribution chains, SDI Plant Builder for multi-stage plants driven by schedules, Extend+Industry for high-speed, high-volume production line modeling, and the SDI Data-Framework for high-speed data import and export. These elements can be expanded for use in modeling of smaller projects such as a single packaging line to large-scale projects such as a worldwide supply chain.
Software Agents for Future Communication Systems, 1st edition
Authors: Alex L. Hayzelden, John Bigham
Venue:  (1999)

:This monograph-like anthology is the first systematic introduction to software agents and their application to future communications systems. Fifteen coherently written chapters by leading software agent researchers provide complementary coverage of the relevant issues. Multi-agent systems and mobile agent approaches are presented, in a well-balanced way and applied to the most important topics in future communications systems. In addition, the volume editors have provided detailed introductory survey chapters.
A Monte Carlo algorithm for fast projective clustering
Authors: Cecilia M. Procopiuc, Michael Jones, Pankaj K. Agarwal, T. M. Murali
Venue: Proceedings of the 2002 ACM SIGMOD international conference on Management of data (2002)

We propose a mathematical formulation for the notion of optimal projective cluster, starting from natural requirements on the density of points in subspaces. This allows us to develop a Monte Carlo algorithm for iteratively computing projective clusters. We prove that the computed clusters are good with high probability. We implemented a modified version of the algorithm, using heuristics to speed up computation. Our extensive experiments show that our method is significantly more accurate than previous approaches. In particular, we use our techniques to build a classifier for detecting rotated human faces in cluttered images.
On Open- and Closed-Loop Bang-Bang Control in Nonzero-Sum Differential Games
Authors: Geert Jan Olsder
Venue: SIAM Journal on Control and Optimization (2001)

The Nash equilibria of two two-person nonzero-sum differential games with hard constraints on the controls are studied. For both games the open-loop as well as the closed-loop solutions, and their relationships, are discussed. As is well-known for "smooth" nonzero-sum games, these solutions are generally different. Because of the constraints, the optimal controls are of the bang-bang type, and the solutions of the two problems under consideration are nonsmooth. One deals with non-Lipschitzian differential equations (considering the problem as an optimal control problem for one player while the bang-bang feedback control of the other player is assumed to be fixed), and the corresponding value functions possess singular surfaces. General conditions for the existence and uniqueness of the feedback solutions in this framework are not yet known. It is shown that in the two examples the open-loop and closed-loop solutions differ. As a by-product, the paper aims at a modest exploration of singular surfaces in nonzero-sum games.
Simulation Model Design and Execution: Building Digital Worlds, 1st edition
Authors: Paul A. Fishwick
Venue:  (1995)

:Simulation can be broken down into 3 areas. 1)Model Design 2)Model Execution and 3)Execution Analysis. Most Simulation books spend considerable time on #3 but very little on #1 and #2.