ppxscal/embedding_network huggingface dataset:
Non-Markovian analysis
Authors: Reinhard German
Venue: Lectures on formal methods and performance analysis: first EEF/Euro summer school on trends in computer science (2002)

If in stochastic modeling the idealized assumption of exponential distributions is removed, the resulting stochastic process is non-Markovian. In this tutorial paper we give an overview of possible analytic approaches for such non-Markovian models. The modeling framework of stochastic Petri nets is used, but the ideas are applicable to other frameworks as well, if a state space can be constructed. We give a detailed presentation of one analysis approach which is based on the method of supplementary variables and give a brief review of another analysis approach which is based on embedding. A model of a timer for holding a connection is used as a tutorial example and a model for a medium access mechanism in wireless networks is used as a more complex example.
An $O(N + M)$-Time Algorithm for Finding a Minimum-WeightDominating Set in a Permutation Graph
Authors: C. Rhee, Y. D. Liang, S. K. Dhall, S. Lakshmivarahan
Venue: SIAM Journal on Computing (1996)

Farber and Keil [ Algorithmica, 4 (1989), pp. 221--236] presented an $O(n^3)$-time algorithm for finding a minimum-weight dominating set in permutation graphs. This result was improved to $O(n^2 \log^2n)$ by Tsai and Hsu [SIGAL '90 Algorithms, Lecture Notes in Computer Science, Springer-Verlag, New York, 1990, pp. 109--117] and to $O(n(n + m))$ by the authors of this paper [ Inform. Process. Lett., 37 (1991), pp. 219--224], respectively. In this paper, we introduce a new faster algorithm that takes only $O(n + m)$ time to solve the same problem, where $m$ is the number of edges in a graph of $n$ vertices.
Professional Ejb
Authors: P G Sarang, Kyle Gabhart, Dave Young, Andre Tost, Tim McAllister, Rahim Adatia, Keyur Shah, John Griffin
Venue:  (2001)

:Enterprise JavaBeans (EJB) are a container-based component architecture that allow you to easily create secure, scalable and transactional enterprise applications. Developed as session beans, entity beans, or message-driven beans, EJBs are the critical business objects in any J2EE application. Professional EJB shows how to develop and deploy EJB applications using both the 1.1 and the new 2.0 specification. The addition of container-provided services, such as container-managed persistence, and security and transaction management, are covered in detail. As well as implementation details, the book also provides a number of strategies and patterns that can be applied when designing your EJB applications. Subsequently, it also suggests steps for taking existing EJBs and improving their performance. Finally, the book recognizes that one of the most difficult areas of EJB development is the deployment process. Thus it demonstrates how to deploy your EJB applications to some of the leading EJB containers including BEA WebLogic, IBM WebSphere and Sybase EAServer.
Geometric matching of circular features by least squares fitting
Authors: J. Borkowski, B. J. Matuszewski, J. Mroczka, L.-K. Shark
Venue: Pattern Recognition Letters (2002)

Based on the hypothesis that a set of circular arcs is related to a set of circles by translation, rotation and scaling, the paper presents the design of a misalignment cost function, the derivation of an optimal geometric transformation based on least squares fitting to align circular arcs to circles, and computer simulation results to demonstrate the effectiveness of the proposed method.
Stochastic Approximation for Nonexpansive Maps: Application to Q-Learning Algorithms
Authors: Jinane Abounadi, Dimitri P. Bertsekas, Vivek Borkar
Venue: SIAM Journal on Control and Optimization (2002)

We discuss synchronous and asynchronous iterations of the form xk+1 = x^k + \gamma(k) (h(x^k)+w^k), where h is a suitable map and {wk} is a deterministic or stochastic sequence satisfying suitable conditions. In particular, in the stochastic case, these are stochastic approximation iterations that can be analyzed using the ODE approach based either on Kushner and Clark's lemma for the synchronous case or on Borkar's theorem for the asynchronous case. However, the analysis requires that the iterates {xk} be bounded, a fact which is usually hard to prove. We develop a novel framework for proving boundedness in the deterministic framework, which is also applicable to the stochastic case when the deterministic hypotheses can be verified in the almost sure sense. This is based on scaling ideas and on the properties of Lyapunov functions. We then combine the boundedness property with Borkar's stability analysis of ODEs involving nonexpansive mappings to prove convergence (with probability 1 in the stochastic case). We also apply our convergence analysis to Q-learning algorithms for stochastic shortest path problems and are able to relax some of the assumptions of the currently available results.
A compact, machine-independent peephole optimizer
Authors: Christopher W. Fraser
Venue: Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages (1979)

Object code optimizers pay dividends but are usually ad hoc and machine-dependent. They would be easier to understand if, instead of performing many ad hoc optimizations, they performed a few general optimizations that give the same effect. They would be easier to implement if they were machine-independent and parametrized by symbolic machine descriptions. This paper describes such a compact, machine-independent peephole optimizer.
Electronic Governance
Authors: Thomas B. Riley
Venue:  (2001)

:This book discusses: tools of electronic delivery of government services; modernizing government; E-citizen, E-business, E-government; applying knowledge management principles; becoming a wired nation; community access; lifelong learning; smart communities; cyberlaws and regulations; interagency coordination; electronic benefit transfer; web interactive network of government services; electronic democracy and the changing face of democracy; access, empowerment, governance in a wired world; advocacy on-line; tools; the lessons of experience. Includes case studies from Great Britain, Canada, USA, Singapore, Malaysia and Hong Kong.
A method for the manual extraction of business rules from legacy source code
Authors: A. B. Earls, S. M. Embury, N. H. Turner
Venue: BT Technology Journal (2002)

One of the main barriers to the successful migration of legacy systems is lack of information about the system to be migrated. With the complexity of modern information systems, it is rarely the case that an organisation has a complete end-to-end understanding of its systems, business processes and information. This is particularly true of the business rules enforced by such systems, which are often poorly documented (if at all) and incompletely understood by those who own, use and maintain such systems. These business rules must be migrated, along with the other system functionality, but this is difficult when they are buried deep within the source code of the system. In this paper, we propose a method for the discovery of business rules through inspection of the source code of legacy systems. We also describe the results of a comprehensive evaluation exercise undertaken within BT, in which the method was applied to a legacy system about to undergo migration. The results of this study indicated considerable success for the method in extracting valid business rules, but also highlighted some weaknesses. Most significantly, the cost of applying the method is a factor of the size and complexity of the system being analysed, and not of the number of business rules elicited. In order to address this, we propose a cut-down version of the method that can be used to produce a quick estimate of the likely yield of business rules from a program. Together, these two forms of the method aid personnel engaged in system migration projects in making maximum use of the scarce resources are available for business rule discovery.
Stylization and abstraction of photographs
Authors: Doug DeCarlo, Anthony Santella
Venue: Proceedings of the 29th annual conference on Computer graphics and interactive techniques (2002)

Good information design depends on clarifying the meaningful structure in an image. We describe a computational approach to stylizing and abstracting photographs that explicitly responds to this design goal. Our system transforms images into a line-drawing style using bold edges and large regions of constant color. To do this, it represents images as a hierarchical structure of parts and boundaries computed using state-of-the-art computer vision. Our system identifies the meaningful elements of this structure using a model of human perception and a record of a user's eye movements in looking at the photo; the system renders a new image using transformations that preserve and highlight these visual elements. Our method thus represents a new alternative for non-photorealistic rendering both in its visual style, in its approach to visual form, and in its techniques for interaction.
How Computer Programming Works
Authors: Daniel Appleman, Sarah Ishida
Venue:  (1994)

:Computer programming is and will continue to be one of the most important skills to master in the 21st century. Yet many people are intimidated by the jargon of programming and many beginning programmers find themselves overwhelmed by the complexity of the languages they are trying to learn. Just as children learn the alphabet before they can read, future programmers must understand certain concepts before they can write their first program. Once those concepts are understood, programming becomes both easy and fun. This unique book uses full color illustrations to help the reader to truly understand the underlying principles on which all computer programming is based.
Online Learning and Teaching with Technology
Authors: David Murphy
Venue:  (2001)

:"Online learning and teaching with technology is important in all sectors of education. This book charts real experiences of using IT, in all of its many guises, and will be valuable for those seeking to successfully use technology in their teaching." "Offering a series of case studies, the book looks at using technology in a wide range of situations, from fully online courses to more traditional face-to-face settings. Grounded in the realities of the teaching experience rather than the intricacies of the technology itself, this book focuses on what happens in practice in online and other technologically enhanced learning environments." "The book is accessible to a wide range of readers, regardless of experience. It includes cases from the UK, the United States, Australia, Hong Kong, the Pacific and Canada. They raise a range of issues that affect anyone aiming to improve their teaching, and concentrate on four key areas: student interaction; teaching and assessment issues; planning and development; policy, planning and management." Online Learning and Teaching with Technology will be welcomed by a wide range of teachers, lecturers, tutors, support staff and course leaders and developers - whatever their subject area or level of experience.
PC Principles, 1st edition
Authors: Gunnar Forst
Venue:  (1990)

:PC Principles provides advanced computer science students and experienced PC users with an up-to-date, comprehensive, and technically detailed explanation of the entire IBM PC family, including the advanced features of the new processors. Forst's in-depth investigation covers both the microcomputer and the more intricate details of operating system and support hardware and their relationship within the PC family. Unique in several respects, PC Principles treats the current PS/2 line as an evolution of the older PC, describes the OS/2, 286 and 386 machines. It provides detailed coverage of hardware and software and of the instruction sets of the 8086, 80286, and 80386 architectures and their working modes, and includes descriptions of the video subsystems that will be particularly useful to software systems designers. Gunnar Forst is Professor of Mathematics at the Mathematics Institute at Copenhagen University.
A dynamic communication algorithm for digital halftoning
Authors: Philip F. Hingston, R. Lyndon While
Venue: Proceedings of the twenty-fifth Australasian conference on Computer science - Volume 4 (2002)

We present a novel algorithm for digital halftoning. The algorithm combines a technique based on error diffusion with the use of a cost function to determine termination. Its chief advantages include the use of randomness to avoid visual artifacts in the binary image and its amenability to parallel execution. The algorithm is a member of the class of "dynamic communication algorithms" which make novel use of dynamically-routed messages to structure the execution of a program.
Aviation Computing Systems
Authors: Mal Gormley
Venue:  (1996)

:A behind-the-scenes look at the high-tech brain centers of modern aviation,this essential reference probes the use of computers in everything from new aircraft design and manufacture to flight planning,weather forecasting,and air traffic monitoring. Full of case studies,synopses of successful applications,and interviews with industry leaders,it provides a comprehensive overview of airline,military,government,air traffic control,simulation,and communications systems,and today's cutting-edge avcomps software. Essential reading for anyone who wants to succeed in today's computerized aviation industry To be on top as an aviation professional,you cannot underestimate the importance of computers to the industry. Advanced aviation computing systems are critical to safe,seamless operations. In this comprehensive reference,you'll go behind the scenes at high-tech centers of modern aviation and find essential information to help you plan forand succeed ina wide variety of careers in aviation and aviation computing. Using highly readable case studies and helpful illustrations,this handbook presents synopses of successful applications and interviews with industry leaders. Read about how cutting-edge,sophisticated software and hardware are being used in an every-growing variety of aviation applicationseverything from new aircraft design and manufacture to flight planning,weather forecasting,pilot training,and air traffic management. Comprehensive,balanced overviews are presented on the use of aviation computing systems in the spectrum of applications,including: Airline; Military; Flight deck; Air traffic control; Simulation; Communication networks. You'll alsoget a glimpse of aviation's future,a comprehensive glossary,a directory of aviation information technology providers and related resources,and much more. 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
Using the kernel security module interface
Authors: Greg Kroah-Hartman
Venue: Linux Journal (2002)

Some of today's hottestsecurity projects are using the 2.5 kernel's LSM technology. Kernel hacker Greg Kroah-Hartman explains the new security framework that will give you an extra layer of protection in the future.
Complete C++ Training Course: Student Edition, 1st edition
Authors: Paul J. Deitel
Venue:  (2000)

:The world's best C++ training - now packaged and priced to be the world's best value! Includes C & C++ Multimedia Cyber classroom, 2/e, the world's best-selling C++ training CD-ROM - selected by PC Magazine as one of the top 100 CD-ROMs! It contains over 8 hours of audio describing every key C++ concept, over 300 complete working C++ programs with over 10,000 lines of fully-tested live code, hundreds of exercises with answers, full-text searching, hyperlinking, and more! Includes C++ How to Program, 2/e, the world's #1 introductory C++ tutorial and reference - over 1100 pages. Book and CD-ROM integrate perfectly to deliver one complete, end-to-end training course! The Complete C++ Training Course brings together the world's #1 interactive, multimedia C++ tutorial on CD-ROM and the world's #1 introductory C++ book, in one end-to-end, fully-integrated training system! Together, the C & C++ Multimedia Cyber Classroom, 2/e, and C++ How to Program, 2/e, represent a breakthrough system for learning C++. They present thorough, well-organized, clear coverage of every important C++ concept, including classes and objects, container classes, control structures, data abstraction, dynamic memory allocation, exceptions, file processing, functions, inheritance, keywords, operator overloading, templates, and much more. This package contains hundreds of tips that show you how to build code that's truly reusable, portable, and optimized for performance. The amazing CD-ROM includes over 8 hours of audio, more than 300 complete C++ programs you can run with a click of the mouse, over 4000 hyperlinked index entries, and much more. Whether you are an experienced programmer or a beginner, there's no faster way to learn C++.
Ideal Binary Clutters, Connectivity, and a Conjecture of Seymour
Authors: Gérard Cornuéjols, Bertrand Guenin
Venue: SIAM Journal on Discrete Mathematics (2002)

A binary clutter is the family of odd circuits of a binary matroid, that is, the family of circuits that intersect with odd cardinality a fixed given subset of elements. Let A denote the 0,1 matrix whose rows are the characteristic vectors of the odd circuits. A binary clutter is ideal if the polyhedron $\{ x \geq {\bf 0}: \; Ax \geq {\bf 1} \}$ is integral. Examples of ideal binary clutters are st-paths, st-cuts, T-joins or T-cuts in graphs, and odd circuits in weakly bipartite graphs. In 1977, Seymour [J. Combin. Theory Ser. B, 22 (1977), pp. 289--295] conjectured that a binary clutter is ideal if and only if it does not contain ${\cal{L}}_{F_7}$, ${\cal{O}}_{K_5}$, or $b({\cal{O}}_{K_5})$ as a minor. In this paper, we show that a binary clutter is ideal if it does not contain five specified minors, namely the three above minors plus two others. This generalizes Guenin's characterization of weakly bipartite graphs [J. Combin. Theory Ser., 83 (2001), pp. 112--168], as well as the theorem of Edmonds and Johnson [ Math. Programming, 5 (1973), pp. 88--124] on T-joins and T-cuts.
Director 7 and Lingo Bible with Cdrom, 1st edition
Authors: Jonathan P. Bacon, John Nyquist, Robert Martin
Venue:  (1999)

:Unlike other books on Director, this book serves as a practical guide for all aspects of using the program from start to finish. This book is the ideal start for beginners, while intermediate to advanced users can benefit by learning shortcuts, advanced tips, and Lingo basics. Includes a new eight-page color insert showing real projects developed with Director. The CD-ROM contains real-life working examples and exercises from the book, along with utilities and other shareware extras.
Assembly Language: For Real Programmers Only!
Authors: Marcus Johnson
Venue:  (1993)

:Take advantage of the power of assembly language programming with Assembly Language: For Real Programmers ONLY! This combination tutorial and reference includes all the information you need for assembly language programming. Reference sections provide complete technical information not only on assembly language instruction, but also on the unique features of Microsoft Macro Assembler Version 6.1. Protected-mode programming and assembly language programming in OS/2 and Windows environments are covered. Detailed information is provided for programming TSRs and device drivers. To help you reach the maximum performance level, this book has numerous working examples of code and covers all the features of Microsoft Macro Assembler to reflect the current state-of-the-art in programming. Also, this book provides complete coverage of the major utilities that come with the Assembler, including: CodeView, the Programmer's WorkBench, the NMAKE facility, the source browser, and link. 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
Practical byzantine fault tolerance and proactive recovery
Authors: Miguel Castro, Barbara Liskov
Venue: ACM Transactions on Computer Systems (TOCS) (2002)

Our growing reliance on online services accessible on the Internet demands highly available systems that provide correct service without interruptions. Software bugs, operator mistakes, and malicious attacks are a major cause of service interruptions and they can cause arbitrary behavior, that is, Byzantine faults. This article describes a new replication algorithm, BFT, that can be used to build highly available systems that tolerate Byzantine faults. BFT can be used in practice to implement real services: it performs well, it is safe in asynchronous environments such as the Internet, it incorporates mechanisms to defend against Byzantine-faulty clients, and it recovers replicas proactively. The recovery mechanism allows the algorithm to tolerate any number of faults over the lifetime of the system provided fewer than 1/3 of the replicas become faulty within a small window of vulnerability. BFT has been implemented as a generic program library with a simple interface. We used the library to implement the first Byzantine-fault-tolerant NFS file system, BFS. The BFT library and BFS perform well because the library incorporates several important optimizations, the most important of which is the use of symmetric cryptography to authenticate messages. The performance results show that BFS performs 2&percnt; faster to 24&percnt; slower than production implementations of the NFS protocol that are not replicated. This supports our claim that the BFT library can be used to build practical systems that tolerate Byzantine faults.
Microsoft Word 97 at a Glance, 1st edition
Authors: Jerry Joyce, Marianne Moon
Venue:  (1997)

:For fast answers, a picture is worth a thousand words. Here's the remarkable, visual way to quickly find answers about the powerful features of Microsoft Word 97. Microsoft Word 97 at a Glance lets you focus on a particular task and shows you, with clear numbered steps, the easiest way to get it done right now.