ppxscal/embedding_network huggingface dataset:
Overlapping Quadratic Optimal Control of Linear Time-Varying Commutative Systems
Authors: Lubomír Bakule, José Rodellar, Josep M. Rossell
Venue: SIAM Journal on Control and Optimization (2001)

Overlapping quadratic optimal control of linear time-invariant continuous-time systems by using generalized selection of complementary matrices has been recently developed as a powerful and effective means of decentralized control design of linear time-invariant systems. In this paper, it is shown that similar generalizations exist for linear time-varying systems. The results presented here concern implicit conditions for a general form of the transition matrices and explicit conditions for a commutative class of linear time-varying systems. Several important large classes of complementary matrices are selected to offer computationally attractive results. The effectiveness of this generalized selection scheme is illustrated by a numerical example of overlapping decentralized control design.
Oracle8i for Dummies, 2nd edition
Authors: Carol McCullough-Dieter, Ned Dana
Venue:  (2000)

:Get up to speed fast on Release 2 and 3 and Oracle Enterprise Manager 2.2! Your plain-English guide to Internet-ready Oracle databases Get tips on the new Java, XML, and Object-handling features The fun and easy wayTM to put Oracle8i to work  beginning today! The new Releases 2 and 3 of Oracle8i are loaded with exciting new database utilities and Internet tools. But how do you get a handle on the zillions of cool features? Relax! With this friendly guide to your site, you'll soon be working with DBA Studio, capitalizing on XML and Oracle Portal, creating turbocharged queries, and much more. Discover how to: *Create customized object types *Drop or modify columns in tables *Write queries to retrieve data from nested tables *Build reports and forms for the Web *Generate a Java applet using SQLJ THE DUMMIES WAYTM *Explanations in plain English *"Get in, get out" information *Icons and other navigational aids *Tear-out cheat sheet *Top ten lists *A dash of humor and fun Get smart! *Register to win cool prizes *Browse exclusive articles and excerpts *Get a free Dummies Daily e-mail newsletter *Chat with authors and preview other books *Talk to us, ask questions, get answers
Knowledge discovery using Web bags in a Web warehouse
Authors: Sourav B. Bhowmick, Sanjay M. Kumar, Wee Keong Ng, Ee Peng Lim
Venue: Information organization and databases: foundations of data organization (2000)

Sets and bags are closely related structures. A bag is different from a set in that it is sensitive to the number of times an element occurs while a set is not. In this paper, we introduce the concept of Web bag in a Web warehouse as a part of our the WHOWEDA project. Informally, a Web bag is a Web table which allows multiple occurrences of identical Web tuples. Web bag helps to discover useful knowledge from a Web table such as visible documents (or Web sites), luminous documents and luminous paths. We formally discuss the semantics and properties Web bags, and illustrate with examples applications of Web bag in knowledge discovery in a Web warehouse.
Design and implementation of DB-MAN&alpha;: does database migration work well in a real environment?
Authors: Toyokazu Akiyama, Shinobu Sakai, Akimichi Umigai, Takahiro Hara, Masahiko Tsukamoto, Shojiro Nishio
Venue: Proceedings of the 13th Australasian database conference - Volume 5 (2002)

Due to the recent expansion of network bandwidth, the data propagation delay has become a significant factor which influences the system performance in place of the data transmission delay. Based on this fact, we have proposed a new technology to reduce the bad influence of propagation delay on the performance of distributed database system by relocating dynamically the database through networks, which we call database migration. Furthermore, we have proposed a database relocation method to choose the transaction processing method between the conventional database fixed method and the proposed database migration method by giving consideration to the transaction complexity. In this paper, we explain our distributed database system with database migration mechanism based on these proposals, and the implementation of the DB-MAN&alpha; system as a prototype system. The DB-MAN&alpha; system reduces the database migration time by using a main memory database technique, which induces us to add a backup management mechanism for migratory databases. Moreover, we show some measurement results for the performance evaluation of the DB-MAN&alpha; system. The results show that the implemented system works well in a practical environment.
Tracking with reference images: a real-time and markerless tracking solution for out-door augmented reality applications
Authors: Didier Stricker
Venue: Proceedings of the 2001 conference on Virtual reality, archeology, and cultural heritage (2001)

This paper presents the optical tracking solution developed in the ArcheoGuide project (The Augmented Reality based Cultural Heritage On-site GUIDE, IST-1999-11306). The system enables to recover precisely the user head position and orientation at predetermined viewing location without the support of markers.The tracking approach is novel and bases on the real-time registration of the live video-image with so called "reference images" of the site. Once the matching between a live- and a reference-images could have been established, the virtual information can be presented correctly to the user, either using a 2D image warping transformation or after deduction of the current 3D position/orientation of the camera.The image matching algorithm represents the core of the tracking system. It must have real-time performance and be particulary robust to intensity and local changes. We opted for an analysis in frequency space and exploit the invariance properties of the Mellin-Fourier transform.The tracking system has been tested outdoor in the context of the Archeoguide project. It runs on a laptop at around 10 to 15 Hz and provides views of virtual monuments in a Head Mounted Display superposed to the ruins of the archaeological site.
Linux System Administration
Authors: M. Carling, James T. Dennison, Stephen Degler
Venue:  (1999)

:Far too often system administrators expend all of their time and energy in endless fire fighting. Often the networks and systems they manage become a fragile quilt of temporary patches and workarounds. Sys admins need a firm background in requirement analysis, prioritization and capacity planning in order to proactively meet the ever-growing needs of their users. Today's overworked sysadmins are looking for any way to keep their networks running smoothly and then try to achieve enhanced performance. Linux System Administration guides the reader in the many intricacies of maintaining a secure, stable system. In this definitive work, the authors address all the issues related to system administration from adding users and managing files permission to internet services and Web hosting to recovery planning and security. Linux System Administration fulfills the need for expert advice that will ensure a trouble-free Linux environment.
Testing Membership in Languages that Have Small Width Branching Programs
Authors: Ilan Newman
Venue: SIAM Journal on Computing (2002)

Combinatorial property testing, initiated formally by Goldreich, Goldwasser, and Ron in [J. ACM, 45 (1998), pp. 653--750] and inspired by Rubinfeld and Sudan [SIAM J. Comput., 25 (1996), pp. 252--271], deals with the following relaxation of decision problems: Given a fixed property and an input x, one wants to decide whether x has the property or is "far" from having the property.The main result here is that, if ${\cal G}= \{ g_n:\{0,1\}^n \rightarrow \{0,1\} \}$ is a family of Boolean functions which have oblivious read-once branching programs of width w, then, for every n and $\epsilon > 0$, there is a randomized algorithm that always accepts every $x \in \{0,1\}^n$ if $g_n(x)=1$ and rejects it with high probability if at least $\epsilon n$ bits of $x$ should be modified in order for it to be in gn-1(1). The algorithm makes $(\frac{2^{w}}{\epsilon})^{O(w)}$ queries. In particular, for constant $\epsilon$ and w, the query complexity is O(1). This generalizes the results of Alon et al.\ [Proceedings of the40th IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, 1999, pp. 645--655] asserting that regular languages are $\epsilon$-testable for every $\epsilon > 0$.
High-Performance Computing in Structural Engineering, 1st edition
Authors: Hojjat Adeli, Roesdiman Soegiarso
Venue:  (1998)

:This book is about high-performance computing in structural engineering on supercomputers with vectorization and parallel processing capabilities. High-Performance Computing in Structural Engineering presents robust parallel-vector algorithms for analysis and optimization of large three-dimensional structures. The authors outline many step-by-step algorithms for the analysis and optimization of structures on shared-memory multiprocessor computers. By extension, the material in High-Performance Computing in Structural Engineering will also find applications in distributed computing on a cluster of workstations.
Convergence of the Nelder--Mead Simplex Method to a Nonstationary Point
Authors: K. I. M. McKinnon
Venue: SIAM Journal on Optimization (1998)

This paper analyzes the behavior of the Nelder--Mead simplex method for a family of examples which cause the method to converge to a nonstationary point. All the examples use continuous functions of two variables. The family of functions contains strictly convex functions with up to three continuous derivatives. In all the examples the method repeatedly applies the inside contraction step with the best vertex remaining fixed. The simplices tend to a straight line which is orthogonal to the steepest descent direction. It is shown that this behavior cannot occur for functions with more than three continuous derivatives. The stability of the examples is analyzed.
Absorbing Games with a Signalling Structure
Authors: Jean-Michel Coulomb
Venue: Mathematics of Operations Research (2001)

We consider a subclass of two-person zero-sum undiscounted stochastic games called absorbing games. The perfect monitoring assumption is removed. Instead of being informed of his opponent's previous action, each player is informed of a signal that randomly depends on both player's previous actions. The existence of the max min and similarly of the min max is established.
Upward Planar Drawing of Single-Source AcyclicDigraphs
Authors: Michael D. Hutton, Anna Lubiw
Venue: SIAM Journal on Computing (1996)

An upward plane drawing of a directed acyclic graph is a plane drawing of the digraph in which each directed edge is represented as a curve monotone increasing in the vertical direction. Thomassen has given a nonalgorithmic, graph-theoretic characterization of those directed graphs with a single source that admit an upward plane drawing. This paper presents an efficient algorithm to test whether a given single-source acyclic digraph has an upward plane drawing and, if so, to find a representation of one such drawing. This result is made more significant in light of the recent proof by Garg and Tamassia that the problem is NP-complete for general digraphs. The algorithm decomposes the digraph into biconnected and triconnected components and defines conditions for merging the components into an upward plane drawing of the original digraph. To handle the triconnected components, we provide a linear algorithm to test whether a given plane drawing of a single-source digraph admits an upward plane drawing with the same faces and outer face, which also gives a simpler, algorithmic proof of Thomassen's result. The entire testing algorithm (for general single-source directed acyclic graphs) operates in $O(n^2)$ time and $O(n)$ space ($n$ being the number of vertices in the input digraph) and represents the first polynomial-time solution to the problem.
Determining investment yields
Authors: Edward M. Kline
Venue: ACM SIGAPL APL Quote Quad (1980)

One of the basic financial-analysis problems is to determine the yield rate on an investment. The yield can then be compared with yields on alternate investments to aid the investor in making a choice. The traditional approach to finding a yield is to use a trial-and-error method which requires setting up a loop for tests of successive trial solutions. This paper will present a different way of solving for yields, which does not require looping when implemented in APL. This method will also be shown to require less storage for data, less computing time, and less storage during calculations.
An interleaved parallel volume renderer with PC-clusters
Authors: Antonio Garcia, Han-Wei Shen
Venue: Proceedings of the Fourth Eurographics Workshop on Parallel Graphics and Visualization (2002)

Parallel Volume Rendering has been realized using various load distribution methods that subdivide either the screen, called image-space partitioning, or the volume dataset, called object-space partitioning. The major advantages of image-space partitioing are load balancing and low communication overhead, but processors require access to the full volume in order to render the volume with arbitrary views without frequent data redistributions. Subdividing the volume, on the other hand, provides storage scalability as more processors are added, but requires image compositing and thus higher communication bandwidth for producing the final image. In this paper, we present a parallel volume rendering algorithm that combines the benefits of both image-space and object-space partition schemes based on the idea of pixel and volume interleaving. We first subdivide the processors into groups. Each group is responsible for rendering a portion of the volume. Inside of a group, every member interleaves the data samples of the volume and the pixels of the screen. Interleaving the data provides storage scalability and interleaving the pixels reduces communication overhead. Our hybrid object- and image-space partitioning scheme was able to reduce the image compositing cost, incur in low communication overhead and balance rendering workload at the expense of image quality. Experiments on a PC-cluster demonstrate encouraging results.
Special Edition Using Microsoft Active Directory
Authors: Sean Fullerton, James Hudson
Venue:  (2001)

From the Book:I joined the Windows NT Server team in early 1995 to work on directory services. My interest in directory services grew out of experiences in developing distributed systems. A distributed system needs a naming service that the elements can use to locate each other. I wanted a naming service that was flexible, secure, and scalable-more than that I wanted a naming service that supported rich query. I saw working on the project that produced Windows 2000 and Active Directory as an opportunity to produce just such a naming service. Directory services and naming services are often viewed as different animals, but they are in fact the same thing. Many people view a directory service as a store of name and address information about people, like an X.500 directory. In contrast, they view a naming service as a way of getting addresses for computers, given their names, like DNS. In reality, X.500 and DNS provide similar capabilities-given a name, either service can return information associated with that name. Active Directory differs from other directories in that it was designed from the beginning to be a general-purpose repository of information about interesting objects with no particular bias about the kind of objects it will contain. Active Directory combines the rich object model of X.500 with the scalability and simplicity of DNS. Many contemporary discussions of directory service focus on the Lightweight Directory Access Protocol (LDAP). Ultimately, LDAP is a footnote in the directory service story, not the story itself. A directory service is not useful because it implements a particular protocol; it is useful because it serves the needs of users, administrators, and developers. Active Directory was designed from the beginning to meet the needs of all three communities-this is a key point to remember as you read this book. Users want streamlined access to the resources they need to do their jobs; administrators want a straightforward way to organize and secure those resources; and developers want a programming model that is simple enough to use in small applications and rich enough to use in the largest and most complex jobs. Active Directory was designed as the hub around which the distributed system is built. It is an integral part of Windows 2000, and understanding Active Directory is the key to a successful Windows 2000 deployment. Future releases of Windows will provide even greater integration with Active Directory. The wide deployment, rich programming model, and ease of integration will encourage developers to integrate their own products with Active Directory. I hope that readers will strive to learn not just how to deploy and manage Windows 2000 using Active Directory, but to understand why Active Directory works the way it does and what new capabilities it brings to users, administrators, and developers.
Advances in the Evolutionary Synthesis of Intelligent Agents
Authors: Mukesh Patel, Karthik Balakrishnan, Vasant G. Honavar
Venue:  (2001)

:"This book explores a central issue in artificial intelligence, cognitive science, and artificial life: how to design information structures and processes that create and adapt intelligent agents through evolution and learning." "The book is organized around four topics: the power of evolution to determine effective solutions to complex tasks, mechanisms to make evolutionary design scalable, the use of evolutionary search in conjunction with local learning algorithms, and the extension of evolutionary search in novel directions."--BOOK JACKET.
The Generalized Newton Iteration for the Matrix Sign Function
Authors: Xiaobai Sun, Enrique S. Quintana-Ortí
Venue: SIAM Journal on Scientific Computing (2002)

In this paper we present modified algorithms for computing deflating subspaces of matrix pairs using the matrix sign function. Our new algorithms achieve a considerable reduction of the computational cost of the generalized Newton iteration for the matrix sign function and improve the accuracy of the computed deflating subspaces. The matrix sign function is thus revealed as an effective technique for applications in which bases for the deflating subspaces are required. When partial or complete information about the eigenspectrum is desired, the matrix sign function can be used as an initial divide-and-conquer technique. The basic kernels involved in this iteration are especially appropriate for current high-performance architectures.
Essentials of Subfile Programming and Advanced Topics in RPG/400
Authors: Phil Levinson
Venue:  (1998)

:AS/400 programmers are in demand more than ever before, and students need to be ready to handle the challenges of "real-world" programming. This text book arms tomorrow's programmers with the skills necessary to meet ever-changing demands of the business world. 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
CHARMS: a simple framework for adaptive simulation
Authors: Eitan Grinspun, Petr Krysl, Peter Schröder
Venue: Proceedings of the 29th annual conference on Computer graphics and interactive techniques (2002)

Finite element solvers are a basic component of simulation applications; they are common in computer graphics, engineering, and medical simulations. Although adaptive solvers can be of great value in reducing the often high computational cost of simulations they are not employed broadly. Indeed, building adaptive solvers can be a daunting task especially for 3D finite elements. In this paper we are introducing a new approach to produce conforming, hierarchical, adaptive refinement methods (CHARMS). The basic principle of our approach is to refine basis functions, not elements. This removes a number of implementation headaches associated with other approaches and is a general technique independent of domain dimension (here 2D and 3D), element type (e.g., triangle, quad, tetrahedron, hexahedron), and basis function order (piece-wise linear, higher order B-splines, Loop subdivision, etc.). The (un-)refinement algorithms are simple and require little in terms of data structure support. We demonstrate the versatility of our new approach through 2D and 3D examples, including medical applications and thin-shell animations.
Augmenting reality with geo-referenced information for environmental management
Authors: Teresa Romão, Eduardo Dias, José Danado, Nuno Correia, Adelaide Trabuco, Carlos Santos, Rossana Santos, Edmundo Nobre, António Câmara, Luís Romero
Venue: Proceedings of the 10th ACM international symposium on Advances in geographic information systems (2002)

When interacting with natural or urban environments there are many situations where the ability to access data in real time becomes relevant. Augmented Reality (AR) technologies allow real time superimposition of synthetic objects on real images, providing an augmented knowledge about the surrounding world. Using a Head Mounted Display, the user of an AR system can visualize the exterior world with additional virtual information that is generated in real time and in a contextual way.This paper presents ANTS (Augmented Environments), an AR project for providing geo-referenced environmental information. The project uses a flexible client-server approach that allows to move more or less components to the client, depending on processing power and application requirements. The geo-referenced database and 3D model for user positioning are located in the server and the presentation component, for image composition and display, is the most fundamental part of the client. The applications for environmental management, include monitoring water quality using models of the pollutant transport, the visualization of the temporal evolution of physical structures and the evolution of subsoil structures, such as phone and power supply networks.
A Very Public Offering: A Rebel's Story of Business Excess, Success, and Reckoning
Authors: Stephan Paternot, Andrew Essex
Venue:  (2001)

:In the volatile, fast-paced Internet industry, you can go from being a hero to losing it all in a nanosecond. Stephan Paternot knows this all too well. The poster child for Internet excess, his name became synonymous with the market mania of the late 1990s. This fascinating book is the inspirational story of how one man's wildest dreams came true as well as the dramatic chronicling of the inception and evolution of an entire industry. Packed with behind-the-scenes details and little known facts, the book reveals the personal and professional motivations that inspired Paternot to found theglobe.com with partner Todd Krizelman at the age of twenty. Theglobe.com marked the beginning of enthusiastic funding, the high-flying stock prices, and incredible IPOs. A Very Public Offering is a positive, inspirational account of a dream that survived the birth and maturation of an industry. It is a riveting narrative that is part adventure story, part romance, and part documentary of an era that business will never experience again.
NetScape Navigator 5: Introductory Concepts and Techniques, 1st edition
Authors: Gary B. Shelly, Kathleen Shelly, Thomas J. Cashman
Venue:  (1999)

:Part of the highly successful Shelly Cashman Series, this text offers a clear screen-by-screen, step-by-step approach to learning the fundamentals of Netscape Navigator 6.