ppxscal/embedding_network huggingface dataset:
Recognition of Simple Enlarged Horn Formulas and Simple Extended Horn Formulas
Authors: Emmanuel Benoist, Jean-Jacques Hébrard
Venue: Annals of Mathematics and Artificial Intelligence (2003)

The enlarged Horn formulas generalize the extended Horn formulas introduced by Chandru and Hooker (1991). Their satisfying truth assignments can be generated with polynomial delay. Unfortunately no polynomial algorithm is known for recognizing enlarged Horn formulas or extended Horn formulas. In this paper we define the class of simple enlarged Horn formulas, a subclass of the enlarged Horn formulas, that contains the simple extended Horn formulas introduced by Swaminathan and Wagner (1995). We present recognition algorithms for the simple enlarged Horn formulas and the simple extended Horn formulas whose complexity is bounded by the complexity of the arborescence-realization problem.
Asymptotic Properties of Receding Horizon Optimal Control Problems
Authors: Kazufumi Ito, Karl Kunisch
Venue: SIAM Journal on Control and Optimization (2001)

The asymptotic behavior of receding horizon optimal control problems with terminal cost chosen as a control Liapunov function is analyzed for regulator as well as disturbance attenuation problems. Both the continuous as well as the discrete time cases are treated. Further, the approximation of the continuous time optimal control problem by the discrete time receding horizon problems is studied.
Sair Linux and GNU Certification Level II,Samba and Resource Sharing
Authors: Tobin B. Maginnis, Sair Development Team
Venue:  (2002)

:In these newest additions to the popular Linux certification series, the Sair Linux and GNU Certification team draws upon their years of experience to provide administrators with expert advice and guidance  this time for Linux Samba and resource sharing features and configuring, implementing, customizing, and managing Linux Sendmail and mail systems, respectively. LCE Series of Sair Linux and GNU Certification Study Guides SAIR Development Team (Oxford, MS), Sair, Inc. With the skyrocketing popularity of Linux, the business community needs to ensure a high level of Linux expertise among its IT staffs. With an advisory board comprised of the industry's most respected leaders, the Sair Linux and GNU Certification program answers the needs of the community.
Logically Clustered Architectures for Networked Databases
Authors: Je-Ho Park, Vinay Kanitkar, Alex Delis
Venue: Distributed and Parallel Databases (2001)

By effectively harnessing networked computing resources, the two-tier client-server model has been used to support shared data access. In systems based on this approach, the database servers often become performance bottlenecks when the number of concurrent users is large. Client data caching techniques have been proposed in order to ease resource contention at the servers. The key theme of these techniques is the exploitation of user data access locality. In this paper, we propose a three-tiered model that takes advantage of such data access locality to furnish a much more scalable system. Groups of clients that demonstrate similarities in their data access behavior are logically clustered together. Each such group of clients is handled by an Intermediate Cluster Manager (ICM) that acts as a cluster-wide directory service and cache manager. Clients within the same cluster are now capable of sharing data among themselves without interacting with the server(s). This results in reduced server load and allows the support of a much larger number of clients. Through prototyping and experimentation, we show that the logical clustering of clients, and the introduction of the ICM layer, significantly improve system scalability as well as transaction response times. Logical clusters, consisting of clients with similar data access patterns, are identified with the help of both a greedy algorithm and a genetic algorithm. For the latter, we have developed an encoding scheme and its corresponding operators.
Information exploration using The Pond
Authors: Olov Ståhl, Anders Wallberg, Jonas Söderberg, Jan Humble, Lennart E. Fahlén, Adrian Bullock, Jenny Lundberg
Venue: Proceedings of the 4th international conference on Collaborative virtual environments (2002)

In this paper we describe The Pond, a system used to search for and visualise data elements on an engaging tabletop display. The Pond uses methods of unencumbered interaction and audio feedback to allow users to investigate data elements, and supports shoulder-to-shoulder collaboration with the physical Pond artefact mediating the collaboration between those people gathered around it. The user interface is based on an ecosystem metaphor, presenting data elements in the form of shoals of aquatic creatures inside a virtual 3D pond. The Pond is an interactive system offering an appealing and novel way to search for and interchange information. We describe the motivation and design choices behind The Pond, the system as it stands today, details of its implementation, and observations from a study of The Pond in use.
How to Use Macromedia Flash 5, 1st edition
Authors: Denise Tyler, Gary Rebholz
Venue:  (2000)

:How to Use Macromedia Flash 5 visually steps the reader through everything he or she needs to know in order to create and manipulate Web images and animations. Over 100 two-page spreads illustrate and clearly explain each Flash task, from entry-level, beginning concepts to advanced techniques for experienced designers. Illustrations and figures lead the reader through each task with easy-to-follow directions and visual cues. Flash can be a somewhat intimidating program for the beginning user, but How to Use Macromedia Flash 5, with its visual, step-by-step approach, makes it simple to learn the basic techniques involved in using Flash.
A Constant-Factor Approximation Algorithm for Packet Routing and Balancing Local vs. Global Criteria
Authors: Aravind Srinivasan, Chung-Piaw Teo
Venue: SIAM Journal on Computing (2001)

We present the first constant-factor approximation algorithm for a fundamental problem: the store-and-forward packet routing problem on arbitrary networks. Furthermore, the queue sizes required at the edges are bounded by an absolute constant. Thus, this algorithm balances a global criterion (routing time) with a local criterion (maximum queue size) and shows how to get simultaneous good bounds for both. For this particular problem, approximating the routing time well, even without considering the queue sizes, was open. We then consider a class of such local vs. global problems in the context of covering integer programs and show how to improve the local criterion by a logarithmic factor by losing a constant factor in the global criterion.
CCNA Routing and Switching Practice Tests Exam Cram with CD-ROM
Authors: Bob Gradante, Robert Gradante
Venue:  (2000)

:Certification Insider Press is the first to provide extra CCNA practice tests in a stand-alone guide. Contains four practice tests and one on the CDa total of five unique practice tests in all. Quizzes readers on every exam objective covered on the actual CCNA Exam (640-507). A perfect complement to all certification guides, including the CCNA Routing and Switching Exam Cram, Second Edition and the CCNA Routing and Switching Exam Prep, and a perfect supplement to all self-study materials.
Limiting Discounted-Cost Control of Partially Observable Stochastic Systems
Authors: Onésimo Hernández-Lerma, Rosario Romera
Venue: SIAM Journal on Control and Optimization (2001)

This paper presents two main results on partially observable (PO) stochastic systems. In the first one, we consider a general PO system $$ x_{t+1}= F (x_t, a_t, \xi_t), \ \ \, y_t= G(x_t, \eta_t) \ \ \ (t=0,1,\ldots) \hspace{1in} \ \ \ \ (*) $$ on Borel spaces, with possibly unbounded cost-per-stage functions, and we give conditions for the existence of $\alpha$-discount optimal control policies $(0 < \alpha < 1).$ In the second result we specialize (*) to additive-noise systems $$ x_{t+1}= F_n(x_t,a_t) + \xi_t, \ \ \, y_t= G_n(x_t) + \eta_t \ \ \ (t=0,1,\ldots) $$ in Euclidean spaces with Fn(x,a) and Gn(x) converging pointwise to ${\mbox{functions}}$ $F_{\infty}(x,a)$ and $G_{\infty}(x),$ respectively, and we give conditions for the limiting PO model $$ x_{t+1}= F_{\infty}(x_t, a_t) + \xi_t, \ \ \,\, y_t=G_{\infty}(x_t) + \eta_t $$ to have an $\alpha$-discount optimal policy.
An Automated Verification Method for Distributed Systems Software Based on Model Extraction
Authors: G. J. Holzmann, M. H. Smith
Venue: IEEE Transactions on Software Engineering (2002)

Software verification methods are used only sparingly in industrial software development today. The most successful methods are based on the use of model checking. There are, however, many hurdles to overcome before the use of model checking tools can truly become mainstream. To use a model checker, the user must first define a formal model of the application, and to do so requires specialized knowledge of both the application and of model checking techniques. For larger applications, the effort to manually construct a formal model can take a considerable investment of time and expertise, which can rarely be afforded. Worse, it is hard to secure that a manually constructed model can keep pace with the typical software application, as it evolves from the concept stage to the product stage. In this paper, we describe a verification method that requires far less specialized knowledge in model construction. It allows us to extract models mechanically from source code. The model construction process now becomes easily repeatable, as the application itself continues to evolve. Once the model is constructed, existing model checking techniques allow us to perform all checks in a mechanical fashion, achieving nearly complete automation. The level of thoroughness that can be achieved with this new type of software testing is significantly greater than for conventional techniques. We report on the application of this method in the verification of the call processing software for a new telephone switch that was recently developed at Lucent Technologies.
The undecidability of the first-order theories of one step rewriting in linear canonical systems
Authors: Sergei Vorobyov
Venue: Information and Computation (2002)

By reduction form the halting problem for Minsky's two-register machines we prove that there is no algorithm capable of deciding the XXXXX-theory of one step rewriting of an arbitrary finite linear confluent finitely terminating term rewriting system (weak undecidability). We also present a fixed system with undecidable XXX_theory of one step rewriting (strong undecidability). This improves over all previously known results of the same kind.
Place to Space: Migrating to Ebusiness Models
Authors: Peter Weill, Michael R. Vitale
Venue:  (2001)

:"An e-business guidebook for established firms in all industries, Place to Space provides a framework for analyzing, choosing, and implementing successful e-business enterprises. Based on several years of research and a detailed study of fifty online initiatives in a variety of traditional firms, authors Peter Weill and Michael R. Vitale describe eight atomic business models that they argue represent the core building blocks of all e-business ventures." "Using case studies of international companies including Lonely Planet, GE Supply Company, Cisco, Reuters, and others, the authors illustrate each atomic business model - direct-to-customer, full-service provider, whole-of-enterprise/government, intermediary, shared infrastructure, virtual community, value net integrator, and content provider - in practice, and reveal the strategic objectives, sources of revenue, core competencies, critical success factors, and necessary IT infrastructures required for implementation."--BOOK JACKET.
Empirical development of a heuristic evaluation methodology for shared workspace groupware
Authors: Kevin Baker, Saul Greenberg, Carl Gutwin
Venue: Proceedings of the 2002 ACM conference on Computer supported cooperative work (2002)

Good real time groupware products are hard to develop, in part because evaluating their support for basic teamwork activities is difficult and costly. To address this problem, we are developing discount evaluation methods that look for groupware-specific usability problems. In a previous paper, we detailed a new set of usability heuristics that evaluators can use to inspect shared workspace groupware to see how they support teamwork. We wanted to determine whether the new heuristics could be integrated into a low-cost methodology that parallels Nielsen's traditional heuristic evaluation (HE). To this end, we examined 27 evaluations of two shared workspace groupware systems and analysed the inspectors' relative performance and variability. Similar to Nielsen's findings for traditional HE, individual inspectors discovered about a fifth of the total known teamwork problems, and that there was only modest overlap in the problems they found. Groups of three to five inspectors would report about 40-60% of the total known teamwork problems. These results suggest that heuristic evaluation using our groupware heuristics can be an effective and efficient method for identifying teamwork problems in shared workspace groupware systems.
Neural Networks
Authors: Phil Picton
Venue:  (2000)

:This book is suitable for undergraduates from Computer Science and Electrical Engineering courses who are taking a one module course on neural networks, and for researchers and computer science professionals who need a quick introduction to the subject.
Inheritance of workflows: an approach to tackling problems related to change
Authors: W. M. P. van der Aalst, T. Basten
Venue: Theoretical Computer Science (2002)

Inheritance is one of the key issues of object-orientation. The inheritance mechanism allows for the definition of a subclass which inherits the features of a specific superclass. When adapting a workflow process definition to specific needs (ad-hoc change) or changing the structure of the workflow process as a result of reengineering efforts (evolutionary change), inheritance concepts are useful to check whether the new workflow process inherits some desirable properties of the old workflow process. Today's workflow management systems have problems dealing with both ad-hoc changes and evolutionary changes. As a result, a workflow management system is not used to support dynamically changing workflow processes or the workflow processes are supported in a rigid manner, i.e., changes are not allowed or handled outside of the workflow management system. In this paper, we propose inheritance-preserving transformation rules for workflow processes and show that these rules can be used to avoid problems such as the "dynamic-change bug." The dynamic-change bug refers to errors introduced by migrating a case (i.e., a process instance) from an old process definition to a new one. A transfer from an old process to a new process can lead to duplication of work, skipping of tasks, deadlocks, and livelocks. Restricting change to the inheritance-preserving transformation rules guarantees transfers without any of these problems. Moreover, the transformation rules can also be used to extract aggregate management information in case more than one version of a workflow process cannot be avoided.
Enhanced graphics performance with user controlled segment files
Authors: W. D. Little, R. Williams
Venue: Proceedings of the 3rd annual conference on Computer graphics and interactive techniques (1976)

This paper describes a simple idea for extending the use of display segment files in computer display systems. The extension is to provide manual control of segment files in a display terminal as well as program control from a host computer. The use of display segments local to the display makes it possible to speed up the rate at which pictures are displayed when the communications line to the host computer is slow or when the host machine is time-shared and heavily loaded. The manual control of segments are terminal functions that work for any program including old programs that knew nothing about display segments.
Automated display techniques for linear graphs
Authors: R. Brien Maguire
Venue: Proceedings of the 4th annual conference on Computer graphics and interactive techniques (1977)

The development of display procedures for drawing pictures of linear graphs is described. The facility to model relationships pictorially has led to the use of graph theoretic techniques in many different applications. While computers normally work with a numeric representation of a graph such as its incidence matrix, manual transformation of such representations into pictures is a tedious process. An interactive graphics system has been developed which, through a combination of heuristic techniques and semi-automatic procedures, creates visual representations of graphs with a minimum of user intervention. The resultant pictures display mirror-image and rotational symmetries that occur within the graph. This very general approach of displaying symmetry in graphs has proven useful in studies of several classes of graphs. However, the system is primarily a research tool designed for use by mathematicians and graph theorists. Difficulties entailed in adapting the display procedures to more specific application areas are discussed.
Cybershops
Authors: Claudia Gerdes, Jutta Nachtwey
Venue:  (2000)

:Millions of people already use the Internet to search for the best bargains or to track down hard-to-find specialist shops. Full of vital information for entrepreneurs and web-designers, here is a case-by-case analysis of some of the most persuasive virtual shop windows currently online - from multinationals and discount stores to specialist dealers, from games and DJ equipment to Barbie dolls, from high fashion to classic furniture. Every featured site has been chosen to show eye-catching, well organized and above all effective design. In addition, there are informative interviews with five leading exponents of e-commerce ventures" "Cybershops is for anyone thinking of selling over the Net - and for everyone who wants to stay-informed.
Stealing Back Our Spectrum: The Politics of Bandwidth, 12th edition
Authors: Mike Eisenmenger
Venue:  (1999)

:Broadcast spectrum is almost entirely controlled by profit- driven businesses. The book points to strategies used by communities to take back portions of the communications spectrum for more public uses. 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
The theory of interactive generalized semi-Markov processes
Authors: Mario Bravetti, Roberto Gorrieri
Venue: Theoretical Computer Science (2002)

In this paper we introduce the calculus of interactive generalized semi-Markov processes (IGSMPs), a stochastic process algebra which can express probabilistic timed delays with general distributions and synchronizable actions with zero duration, and where choices may be probabilistic, non-deterministic and prioritized. IGSMP is equipped with a structural operational semantics which generates semantic models in the form of generalized semi-Markov processes (GSMPs), i.e. probabilistic systems with generally distributed time, extended with action transitions representing interaction among system components. This is obtained by expressing the concurrent execution of delays through a variant of ST semantics which is based on dynamic names. The fact that names for delays are generated dynamically by the semantics makes it possible to define a notion of observational congruence for IGSMP (that abstracts from internal actions with zero duration) simply as a combination of standard observational congruence and probabilistic bisimulation. We also present a complete axiomatization for observational congruence over IGSMP. Finally, we show how to derive a GSMP from a given IGSMP specification in order to evaluate the system performance and we present a case study.
Peter Norton's Complete Guide to Linux
Authors: Peter Norton, Arthur Griffith
Venue:  (1999)

:Peter Norton's Complete Guide to Linux is yet another comprehensive, user-friendly guide in the highly acclaimed Norton style. Its unique, hands-on, step-by-step approach teaches the features of the most popular distributions of Linux. Norton and Griffith pave the way to a better understanding of Linux. Learn about all the newest technologies available for increasing your operating system capabilities--such as the Gnome and KDE user interfaces, networking with Samba and NFS, and installing the many built-in servers. You will find Peter's Principles, communications, networking, printing, performance, troubleshooting, and compatibility tips throughout the book.
Polynomial Instances of the Positive Semidefinite and Euclidean Distance Matrix Completion Problems
Authors: Monique Laurent
Venue: SIAM Journal on Matrix Analysis and Applications (2000)

Given an undirected graph G=(V,E) with node set V=[1,n], a subset $S\subseteq V$, and a rational vector $a\in {\rm\bf Q}^{S\cup E}$, the positive semidefinite matrix completion problem consists of determining whether there exists a real symmetric n &times; n positive semidefinite matrix X=(xij) satisfying xii=ai ($i\in S$) and xij=aij ($ij\in E$). Similarly, the Euclidean distance matrix completion problem asks for the existence of a Euclidean distance matrix completing a partially defined given matrix. It is not known whether these problems belong to NP. We show here that they can be solved in polynomial time when restricted to the graphs having a fixed minimum fill-in, the minimum fill-in of graph G being the minimum number of edges needed to be added to G in order to obtain a chordal graph. A simple combinatorial algorithm permits us to construct a completion in polynomial time in the chordal case. We also show that the completion problem is polynomially solvable for a class of graphs including wheels of fixed length (assuming all diagonal entries are specified). The running time of our algorithms is polynomially bounded in terms of n and the bitlength of the input a. We also observe that the matrix completion problem can be solved in polynomial time in the real number model for the class of graphs containing no homeomorph K4.
Runtime mechanisms for leakage current reduction in CMOS VLSI circuits1,2
Authors: Afshin Abdollahi, Massoud Pedram, Farzan Fallah
Venue: Proceedings of the 2002 international symposium on Low power electronics and design (2002)

Abstract. This paper describes two runtime mechanisms for reducing the leakage current of a CMOS circuit. In both cases, it is assumed that the system or environment produces a "sleep" signal that can be used to indicate that the circuit is in a standby mode. In the first method, the "sleep" signal is used to shift in a new set of external inputs and pre-selected internal signals into the circuit with the goal of setting the logic values of all of the internal signals so as to minimize the total leakage current in the circuit. This minimization is possible because the leakage current of a CMOS gate is a strong function of the input combination applied to its inputs. In the second method, NMOS and PMOS transistors are added to some of the gates in the circuit to increase the controllability of the internal signals of the circuit and decrease the leakage current of the gates using the "stack effect". This is, however, done carefully so that the minimum leakage is achieved subject to a delay constraint for all input-output paths in the circuit. In both cases, Boolean satisfiability is used to formulate the problems, which are subsequently solved by employing a highly efficient SAT solver. Experimental results on the circuits in the MCNC91 benchmark suite demonstrate that it is possible to reduce the leakage current by up to 70% in VLSI circuits at the expense of a very small overhead.