ppxscal/embedding_network huggingface dataset:
MySQL: Your Visual Blueprint to Open Source Database Management, 1 edition
Authors: Michael G. Moncur
Venue:  (2002)

:* Discusses the basic fundamentals including database terminology and concepts. * Offers an introduction to MySQL and the SQL language, then includes essential tasks to begin using it. * Explores the essentials of MySQL server management, providing a guide for troubleshooting problems. * Presents numerous annotated screenshots, tips and tricks. * Includes a CD-ROM with additional code examples as well as advanced examples using MySQL for UNIX and Windows, PHP for Windows and UNIX, and PHPMyAdmin for UNIX.
On Modeling the Performance and Reliability of Multi-Mode Computer Systems
Authors: G V Kulkarni, Victor Nicola, S K Trivedi
Venue:  (1984)

We present an effective technique for the combined performance and reliability analysis of multi-mode computer systems. A reward rate (or a performance level) is associated with each mode of operation. The switching between different modes is characterized by a continuous time Markov chain. Different types of service-interruption interactions (as a result of mode switching) are considered. We consider the execution time of a given job on such a system and derive the distribution of its completion time. A useful dual relationship, between the completion time of a given job and the accumulated reward up to a given time, is noted. We demonstrate the use of our technique by means of a simple example.
A System for Multiparadigm Development of Software Systems
Authors: Scott Meyers, Steven P. Reiss
Venue:  (1991)

It is our goal to create a software development environment that will offer multiple editable views of software systems, will allow users to define new views, and will support communication between views as the systems are changed. Our research to date has focused on the development of a single canonical representation for software systems, Semantic Program Graphs (SPGs). In this paper, we briefly describe SPGs, show how they can form the basis of a development environment, give examples of their utility, and compare them with other ways of representing software systems. We concentrate on describing the various characteristics of software systems that SPGs must support and explaining how SPGs can serve as the basis for the development environment we envision.
Integrating Soft Systems and Object-Oriented Analysis
Authors: D. W. Bustard, T. J. Dobbin, B. N. Carey
Venue: Proceedings of the 2nd International Conference on Requirements Engineering (ICRE '96) (1996)

This paper assumes that the establishment of requirements for software intensive systems is a two stage process: (i) a business analysis, to identify opportunities for business improvement; followed by (ii) a computing- oriented analysis to identify and define where computing facilities might support that business improvement. With that assumption, the remainder of the paper is concerned with investigating the resulting problem of integrating business analysis and computing analysis to provide an effective overall analysis procedure. In particular, the paper considers the integration of Soft Systems Methodology (SSM), a behaviour based business analysis technique, and Object-Oriented Analysis, specifically, Shlaer-Mellor Object-Oriented Systems Analysis (OOSA). The experimental use of the resulting technique on a generic billing system project in British Telecom is also discussed briefly.
Planning and Executing Robot Assembly Strategies in the Presence of Uncertainty
Authors: Bruce R Donald
Venue:  (1989)

Robot control systems are subject to significant uncertainty and error. Typical robots are also equipped with sensors-force sensors, kinesthetic positions sensors, tactile sensors, vision, and so forth. However, these sensors are also subject to significant uncertainty. Finally, the geometrical models of the robot and the environment (part, obstacles, etc.) cannot be exact-they are accurate only to manufacturing tolerances, or to the accuracy of the sensors used to acquire the models. Uncertainty is an absolutely fundamental problem in robotics, and plans produced under the assumption of no uncertainty are meaningless. What is needed is a principled theory of planning in the presence of uncertainty. Such a theory must not only be computational, but must also take uncertainty into account a priori. In motion planning with uncertainty, we exploit compliant motion-sliding on surfaces-in order to effect a ``structural'''' reduction in uncertainty. Such compliant motion plans can be synthesized from a computational analysis of the geometry of the holonomic constraints. We will present a precise framework for motion planning with uncertainty. In particular, given geometric bounds on the uncertainty in sensing and control, we develop algorithms for generating and verifying compliant motion strategies that are guaranteed to succeed as long as the sensing and control uncertainties lie within the specified bounds. The first results in this theory begin with Lozano-Perez, Mason, and Taylor [LMT], with subsequent contributions by Mason [MA2], Erdmann [E], Donald [D], and others. This research has led to a theoretical computational framework for motion planning with uncertainty, which we explore in this focused survey paper.
SLuHrG: a scenario language to partially constrain autonomous agents activity
Authors: Frédéric Devillers, Stéphane Donikian
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Behavioural animation techniques provide autonomous characters with the ability to react credibly in interactive simulations. The direction of these autonomous agents is inherently complex. Typically, simulations evolve according to reactive and cognitive behaviours of autonomous agents. The free flow of actions makes it difficult to precisely control the happening of desired events. In this paper, we propose a scenario language designed to support direction of semi-autonomous characters. This language offers temporal management and character communication tools. It also allows parallelism between scenarios, and a form of competition for the reservation of characters.
Consistent estimation of the intensity function of a cyclic Poisson process
Authors: Roelof Helmers, I. W. Mangku, Ricardas Zitikis
Venue:  (1999)

We construct and investigate a consistent kernel-type nonparametric estimator of the intensity function of a cyclic Poisson process when the period is unknown. We assume that only a single realization of the Poisson process is observed in a bounded window. In particular, we prove that the proposed estimator is weakly and strongly consistent when the size of the window expands.
Mobile and Wireless Design Essentials
Authors: Martyn Mallick
Venue:  (2003)

:Describes mobile and wireless design techniques from the developers perspective, offering in-depth analysis of the complete range of network technologiesDetails development options for building Smart Client, Thin Client, and messaging applications as well as PIM (personal information management) and location-based servicesThe author is an experienced trainer who leads seminars and workshops worldwide for iAnywhere Solutions, a subsidiary of Sybase
Towards a Theory of Information Invariants for Cooperating Autonomous Mobile Robots
Authors: Bruce R Donald, James Jennings, Daniela Rus
Venue:  (1993)

In [Don4], we described a manipulation task for cooperating mobile robots that can push large, heavy objects. There, we asked whether explicit local and global communication between the agents can be removed from a family of pushing protocols. In this paper, we answer in the affirmative. We do so by using the general methods of [Don4] analyzing information invariants. We discuss several measures for the information complexity of the task: (a) How much internal state should the robot retain? (b) How many cooperating agents are required, and how much communication between them is necessary? (c) How can the robot change (side-effect) the environment in order to record state or sensory information to perform a task? (d) How much information is provided by sensors? and (e) How much computation is required by the robot? To answer these questions, we develop a notion of information invariants. We develop a technique whereby one sensor can be constructed from others by adding, deleting, and reallocating (a) (e) among collaborating autonomous agents. We add a resource to (a) (e) and ask: (f) How much information is provided by the task mechanics? By answering this question, we hope to develop information invariants that explicitly trade-off resource (f) with resources (a) (e). The protocols we describe here have been implemented in several different forms, and we will show a video reporting on experiments to measure and analyze information invariants using a pair of cooperating mobile robots for manipulation experiments in our laboratory.
Asymptotics of the total chromatic number for simple graphs
Authors: P. M Kayll
Venue:  (1996)

For simple graphs, the ratio of the total chromatic number to its linear analogue, the fractional total chromatic number, tends to one as the latter parameter grows large. Two short proofs of this fact, first observed here, are presented. One is based on a theorem of Kahn ({\em J.\ Combin.\ Theory Ser.\ A} {\bf 73} (1996), 1--59) concerning the asymptotics of the list-chromatic index, the other on recent progress of Molloy and Reed in the direction of the ``Behzad-Vizing Conjecture''''. The main result has the flavour of several recent others establishing asymptotic agreement of certain integral (hyper)graph parameters with their fractional analogues.
An algebraic programming style for numerical software and its optimization
Authors: T. B. Dinesh, M. Haveraaen, Jan Heering
Venue:  (1998)

The abstract mathematical theory of partial differential equations (PDEs) is formulated in terms of manifolds, scalar fields, tensors, and the like, but these algebraic structures are hardly recognizable in actual PDE solvers. The general aim of the Sophus programming style is to bridge the gap between theory and practice in the domain of PDE solvers. Its main ingredients are a library of abstract datatypes corresponding to the algebraic structures used in the mathematical theory and an algebraic expression style similar to the expression style used in the mathematical theory. Because of its emphasis on abstract datatypes, Sophus is most naturally combined with object-oriented languages or other languages supporting abstract datatypes. The resulting source code patterns are beyond the scope of current compiler optimizations, but are sufficiently specific for a dedicated source-to-source optimizer. The limited, domain-specific, character of Sophus is the key to success here. This kind of optimization has been tested on computationally intensive Sophus style code with promising results. The general approach may be useful for other styles and in other application domains as well.
A Procedure to Detect Inside Large Size Marble Blocks by Ultrasound
Authors: Mauro Bramanti, Edoardo Bozzi
Venue:  (1999)

In stone and marble industry there is considerable interest in the possibility of using ultrasound diagnostic techniques for non-destructive testing of large size blocks in order to detect internal flaws such as faults, cracks and fissures. In this paper some preliminary measurements are reported in order to acquire basic knowledge of the fundamental properties of ultrasound, such as propagation velocity and attenuation, in the media here considered. We then outline a particular diagnostic procedure for obtaining a non-invasive, non-destructive quality control of blocks. Finally, the structure of a measuring set up specifically designed for in-field use is described and the experimental results are reported and discussed. EMAIL:: Bramanti@iei.pi.cnr.it
Propositional Skew Boolean Logic
Authors: R. J. Bignall, M. Spinks
Venue: Proceedings of the 26th International Symposium on Multiple-Valued Logic (1996)

A non-commutative propositional logic is described. A Hilbert-style axiomatisation is given for the logic, and a multiple-valued interpretation is constructed. The logic is shown to be sound and complete with respect to this interpretation. We also show that the logic has no finite complete models. An application includes the specification and design of multiple-valued switching circuits.
A formal model for temporal schema versioning in object-oriented databases
Authors: Fabio Grandi, Federica Mandreoli
Venue: Data Knowledge Engineering (2003)

In this paper we present a formal model for the support of temporal schema versions in object-oriented databases. Its definition is partially based on a generic (ODMG compatible) object model and partially introduces new concepts. The proposed model supports all the schema changes which are usually considered in the OODB literature, for which an operational semantics and a formal analysis of their correct behaviour is provided. Semantic issues arising from the introduction of temporal schema versioning in a conventional or temporal database (concerning the interaction between the intensional and extensional levels of versioning and the management of data in the presence of multiple schema versions) are also considered.
Using XML to Build Consistency Rules for Distributed Specifications
Authors: Andrea Zisman, Wolfgang Emmerich, Anthony Finkelstein
Venue: Proceedings of the 10th International Workshop on Software Specification and Design (2000)

The work presented in this paper is part of a large programme of research aimed at supporting consistency management of distributed documents on the World Wide Web. We describe an approach for specifying consistency rules for distributed partial specifications with overlapping contents. The approach is based on expressing consistency rules using XML and XPointer. We present a classification for different types of consistency rules, related to various types of inconsistencies and show how to express these consistency rules using our approach. We also briefly describe a rule editor to support the specification of the consistency rules.
ASP.NET Website Programming: Problem - Design - Solution VB.NET Edition, 1 edition
Authors: Marco Bellinaso, Kevin Hoffman, Demian Martinez
Venue:  (2002)

:ASP.NET Website Programming shows you how to build an interactive website from design to deployment.Packed with solutions to website programming problems, this book will have you building well-engineered, extendable ASP.NET websites quickly and easily.What you need to knowThis book is for developers who: Use ASP.NET and Visual Basic .NETUse Visual Studio&reg; .NET Professional or above, or Visual Basic&reg; .NET StandardWhat you will learn from this bookWith ASP.NET Website Programming you will learn to:Establish a solid, scalable website foundationProvide flexible user accounts by integrating with ASP.NET's built-in securityCreate fully featured discussion forums Generate revenue from advertisingBuild a web interface for managing the files on your siteAdd opinion polls, e-mail newsletters, and news managementDeploy the finished site on a live serverBuild websites using good, n-tier coding techniques
A Fault Model for Subtype Inheritance and Polymorphism
Authors: Jeff Offutt, Roger Alexander, Ye Wu, Quansheng Xiao, Chuck Hutchinson
Venue: Proceedings of the 12th International Symposium on Software Reliability Engineering (2001)

Although program fault are widely studied, there are many aspect of faults that we still do not understand, particularly about OO software.In addition to the simple fact that one important goal during testing is to cause failure and thereby detect fault, a full under tanding of the characteristic of faults is crucial to everal research area. The power that inheritance and polymorphism brings to the expressiveness of programming language also brings a number of new anomalies and fault type. This paper present a model for the appearance and realization of OO fault and defines and discusses specifc categories of inheritance and polymorphic fault. The model and categorie can be used to support empirical investigations of object-orientedtesting technique, to inspire further research into object-oriented testing and analysis, and to help improve design and development of object-oriented software.
Robust Hash Functions for Digital Watermarking
Authors: Jiri Fridrich
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

Digital watermarks have recently been proposed for authentication of both video data and still images and for integrity verification of visual multimedia. In such applications, the watermark has to depend on a secret key and on the original image. It is important that the dependence on the key be sensitive, while the dependence on the image be continuous (robust). Both requirements can be satisfied using special image digest functions that return the same bit-string for a whole class of images derived from an original image using common processing operations. It is further required that two completely different images produce completely different bit-strings. In this paper, we discuss methods how such robust hash functions can be built. We describe an algorithm and evaluate its performance. We also show how the hash bits As another application, the robust image digest can be used as a search index for an efficient image database search
A Separator Theorem for Chordal Graphs
Authors: John R. Gilbert, Donald J. Rose
Venue:  (1982)

Chordal graphs are undirected graphs in which every cycle of length at least four has a chord. They are sometimes called rigid circuit graphs or perfect elimination graphs; the last name reflects their utility in modelling Gaussian elimination on sparse matrices. The main result of this paper is that a chordal graph with $n$ vertices and $m$ edges can be cut in half by removing $O(\sqrt{m})$ vertices. A similar result holds if the vertices have non-negative weights and we want to bisect the graph by weight, or even if we want to bisect the graph simultaneously by several unrelated sets of weights.
Analyzing and Improving Quasi-Newton Methods for Unconstrained Optimization
Authors: Robert B. Schnabel
Venue:  (1977)

This thesis is concerned with analyzing and improving the performance of quasi-Newton methods for finding the minimum of a real valuedd function of a finite number of real variables. Quasi-Newton methods are a successful way of iteratively solving this problem when the Hessian matrix of second partial derivatives of the function cannot be cheaply computed. Instead they keep an approximation to the Hessian matrix at the current point, and update it at each iteration. A recent algorithm of Davidon''s has contributed two important new ideas to the formulation of such updates, while improving upon the computational performance of existing algorithms. In this thesis we analyze the work of Davidon, propose some changes to his algorithm and test some of these, and extend much of the existing analysis of quasi-Newton updates for optimization problems to a broader class of updates which includes Davidon''s. The two innovations in Davidon''s algorithm are the use of a new update class intended to preserve past derivative information in the Hessian approximation, and the selection of the actual update from this class by a method called optimal conditioning. We explain and analyze both of these aspects thoroughly. The use of the new update class seems to be very beneficial, although our analysis suggests several alternative implementations which are equivalent to Davidon''s algorithm on quadratic problems. We extend existing convergence techniques to show that two of these methods enjoy local Q-superlinear convergence under normal assumptions. On the other hand, our theoretical and computational analysis of optimal conditioning indicates that it may not be helpful in most cases, and that further computational testing definitely is required. However, we introduce and test an update which uses optimal conditioning only on some selected iterations, and which seems to show promise. To aid our analysis of Davidon''s ideas we introduce the concept of a restricted update class, of which his is an example. We then extend much of the existing analysis of rank-two quasi-Newton updates, including questions of hereditary positive definiteness, mimimum change updates, and performance using perfect line search, to include this broadened update class. This work helps suggest some of our proposed changes to Davidon''s algorithm, and is useful in deriving and analyzing quasi-Newton updates for other problems. A basic equivalence shows that our analysis extends to a very general class of rank-two updates. Quasi-Newton methods are currently being applied in a variety of problem areas. We hope that our analysis improves upon their use in unconstrained optimization, and helps make the leading new ideas in the field accessible to other application areas.
Duke Release CAzM - Circuit Analyzer with Macromodeling: User?s Guide
Authors: Donald Erdman
Venue:  (1987)

CAzM is a circuit analyzer designed to calculate the DC operating point and perform transient and transfer analysis on a general class of circuits. Specifically CAzM models enhancement and depletion $n$ and $p$ type transistors, resistors, capacitors, current sources, voltage sources and a general class of $n$-terminal devices (including non-linear capacitors, resistors, diodes, and other devices). 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
Scheduling Solutions for Supporting Dependable Real-Time Applications
Authors: F. Sandrini, F. Di Giandomenico, A. Bondavalli, E. Nett
Venue: Proceedings of the Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2000)

This paper deals with tolerance to timing faults in time-constrained systems. TAFT (Time Aware Fault-Tolerant) is a recently devised approach, which applies tolerance to timing violations. According to TAFT, a task is structured in a pair, to guarantee that deadlines are met (although possibly offering a degraded service) without requiring the knowledge of tasks attributes difficult to estimate in practice. Wide margin of actions is left by the TAFT approach in scheduling the task pairs, leading to disparate performances; up to now poor attention has been devoted to analyze this aspect.The goal of this work is to investigate on the most appropriate scheduling policies to adopt in a system structured in the TAFT fashion, in accordance with system conditions and application requirements. To this end, an experimental evaluation will be conducted, based on a variety of scheduling policies, to derive useful indications for the system designer about the most rewarding policies to apply.
An Architecture for Inter-Domain Troubleshooting
Authors: David G. Thaler, Chinya V. Ravishankar
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

In this paper, we explore the constraints of a new problem: that of coordinating network troubleshooting among peer administrative domains and untrusted observers. Allowing untrusted observers permits any entity to report problems, whether it is a Network Operations Center (NOC), end-user, or application. Our goals are to define the inter-domain coordination problem clearly, and to develop an architecture which allows observers to report problems and receive timely feedback, regardless of their own locations and identities. By automating this process, we also relieve human bottlenecks at help desks and NOCs whenever possible. We present a troubleshooting methodology for coordinating problem diagnosis, and describe GDT, a distributed protocol which realizes this methodology.