ppxscal/embedding_network huggingface dataset:
The use of unlabeled data to improve supervised learning for text summarization
Authors: Massih-Reza Amini, Patrick Gallinari
Venue: Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval (2002)

With the huge amount of information available electronically, there is an increasing demand for automatic text summarization systems. The use of machine learning techniques for this task allows one to adapt summaries to the user needs and to the corpus characteristics. These desirable properties have motivated an increasing amount of work in this field over the last few years. Most approaches attempt to generate summaries by extracting sentence segments and adopt the supervised learning paradigm which requires to label documents at the text span level. This is a costly process, which puts strong limitations on the applicability of these methods. We investigate here the use of semi-supervised algorithms for summarization. These techniques make use of few labeled data together with a larger amount of unlabeled data. We propose new semi-supervised algorithms for training classification models for text summarization. We analyze their performances on two data sets - the Reuters news-wire corpus and the Computation and Language (cmp_lg) collection of TIPSTER SUMMAC. We perform comparisons with a baseline - non learning - system, and a reference trainable summarizer system.
Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes
Authors: Shu Lin, Tadao Kasami, Marc Fossorier
Venue:  (1998)

:Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes combines trellises and trellis-based decoding algorithms for linear codes together in a simple and unified form. The approach is to explain the material in an easily understood manner with minimal mathematical rigor. Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes is intended for practicing communication engineers who want to have a fast grasp and understanding of the subject. This book can also be used as a text for advanced courses on the subject.
Introduction to Computer Programming with Visual Basic 6: A Problem-Solving Approach with Cdrom, 1st edition
Authors: Alka R. Harriger, Susan K. Lisack, John K. Gotwals
Venue:  (1999)

:This comprehensive book equips readers with the skills necessary to develop computer applications in any language by helping them develop a framework for creating programs. The program development cycle and fundamental programming concepts are emphasized. Comes with free software: Microsoft Visual Basic 6.0, Working Model. To highlight emphasis on programming concepts instead of GUI elements, a limited number of program controls are used in the examples. For anyone interested in learning to program in Visual Basic.
Weighted mean of a pair of graphs
Authors: Horst Bunke, Simon Günter
Venue: Computing (2001)

Graph matching and graph edit distance are fundamental concepts in structural pattern recognition. In this paper, the weighted mean of a pair of graphs is introduced. Given two graphs, G and G', with d(G, G') being the edit distance of G and G', the weighted mean of G and G' is a graph G'' that has edit distances d(,i>G, G) and (G'', G') to G and G', respectively, such that d(G, G'') + d(G'', G') = d(G, G'). We'll show formal properties of the weighted mean, describe a procedure for its computation, and give examples.
Guide to Enterprise IT Architecture
Authors: Col Perks, Tony Beveridge
Venue:  (2001)

:IT architecture is a critical tool that defines the components or building blocks that comprise an organization's overall information system. This guide provides a comprehensive and practical introduction and reference for the IT architecture design of an enterprise organization's information system. Covering the full spectrum of IT technical architectural concerns-from technical issues and flexible method development to business strategy and models-the reader is guided through the cycle of design and development with proven methods and practices. The presentation is primarily based on the method of The Open Group Architectural Framework (TOGAF) standards. Features and topics: *comprehensive and unified overview of all aspects of IT architecture design, implementation and strategic adaptability *detailed examples and case studies to systematically illustrate development methods and the process cycle *extensive summary charts, tables, and step-by-step procedures for quick use and reference *uses the TOGAF development framework and process, the accepted international standard for an enterprise *presents comprehensive explanation of the IT technical architecture concepts and methods *integrates strategic issues with the context and content of IT architecture design to ensure strategic goals are incorporated This highly readable reference provides a rich resource of tools and strategic insights for all practitioners, professionals and developers in information technology, database systems, and enterprise systems administration. With its accessible style and intuitive topic development, the book is an authoritative guide to the power, versatility and strategic utility of IT architecture.
Coordination specification in multi-agent systems: from requirements to architecture with the Tropos methodology
Authors: Anna Perini, Angelo Susi, Fausto Giunchiglia
Venue: Proceedings of the 14th international conference on Software engineering and knowledge engineering (2002)

The goal of this paper is to propose a new methodology for designing coordination between human agents and software agents and, ultimately, among software agents. The methodology is based on two key ideas. The first is that coordination should be designed in steps, according to a precise software engineering methodology, and starting from the specification of early requirements. The second is that coordination should be modeled as dependency between actors. Two actors may depend on one another because they want to achieve goals, acquire resources or execute a plan. The methodology used is based on Tropos, an agent oriented software engineering methodology presented in earlier papers. The methodology is presented with the help of a case study.
Visual Basic 6 Unleashed, Professional Reference Edition
Authors: Rob Thayer
Venue:  (1999)

:Visual Basic X Unleashed provides comprehensive coverage of the most sought after topics in Visual Basic programmingVisual Basic X Unleashed provides a means for a casual level Visual Basic programmer to quickly become productive with the new release of Visual Basic. This book provides the reader with a comprehensive reference to virtually all the topics that are used in today s leading-edge Visual Basic applications. This book looks to take advantage of the past success of the Unleashed series along with the extremely large size of the Visual Basic market.The integration of the text and CD-ROM makes this an invaluable tool for accomplished Visual Basic programmers everything they need to know as well as the tools and utilities to make it work.Includes topics important to developers including creating and using ActiveX controls, creating Wizards, adding and controlling RDO, tuning and optimization, and much moreTargeted towards the beginning to intermediate level programmer who needs additional step-by-step guidance in learning the more detailed features of Visual Basic. The reader can use this book as a building block to step to the next level from Sams' Teach Yourself Visual Basic X in 21 Days. 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
Biorthogonal wavelets for subdivision volumes
Authors: Martin Bertram
Venue: Proceedings of the seventh ACM symposium on Solid modeling and applications (2002)

We present a biorthogonal wavelet construction based on Catmull-Clark-style subdivision volumes. Our wavelet transform is the three-dimensional extension of a previously developed construction of subdivision-surface wavelets that was used for multiresolution modeling of large-scale isosurfaces. Subdivision surfaces provide a flexible modeling tool for surfaces of arbitrary topology and for functions defined thereon. Wavelet representations add the ability to compactly represent large-scale geometries at multiple levels of detail. Our wavelet construction based on subdivision volumes extends these concepts to trivariate geometries, such as time-varying surfaces, free-form deformations, and solid models with non-uniform material properties. The domains of the repre-sented trivariate functions are defined by lattices composed of arbitrary polyhedral cells. These are recursively subdivided based on stationary rules converging to piecewise smooth limit-geometries. Sharp features and boundaries, defined by specific polygons, edges, and vertices of a lattice are explicitly represented using modified subdivision rules. Our wavelet transform provides the ability to reverse the subdivision process after a lattice has been re-shaped at a very fine level of detail, for example using an automatic fitting method. During this coarsening process all geometric detail is compactly stored in form of wavelet coefficients from which it can be reconstructed without loss.
Cyberlaw: Text and Cases, 1st edition
Authors: Gerald R. Ferrera, August, William, Stephen Lichtenstein, Margo Reder
Venue:  (2000)

:"Cyberlaw: Your Rights in Cyberspace gives you everything you need to know about the laws that govern your online business activities. Whether you own a small business or work in a department within a larger firm, it's imperative that you understand what you can and can't, should and shouldn't, do online." "Written by an expert team of legal, business, and Internet educators from around the country, this book is your complete guide to the legal issues surrounding the Internet. It's filled with practical information you can use right away."--BOOK JACKET.
Advanced NetWare 5 Administration
Authors: Ed Tittel, Hoag
Venue:  (1999)

:Covers advanced internetworking topics, including TCP/IP configuration and routing, Internet access, and multivendor networks. Includes complex user administration requirements, customized user logins, application launcher setups, and more. Explains integration of wide and local-area networking links and technologies, and use of specialized routing protocols and configurations. Features sections on proven test-taking strategies, time-saving study tips, shortcuts, and more. NetWare 5 Advanced Administration exam (50-640), a core requirement for CNE certification, serves as a cross-certification exam for those who currently hold Classic, NetWare 3, and Group Wise CNE credentials. Includes information necessary to upgrade previous versions of NetWare to NetWare 5. Guarantees a long shelf life as the book is based on the newest Novell exam for CNE certification. Written by cross-certified networking professionals who provide the reader with a balance of accurate technical facts and real-world skills.
On the Difficulty of Designing Good Classifiers
Authors: Michelangelo Grigni, Vincent Mirelli, Christos H. Papadimitriou
Venue: SIAM Journal on Computing (2000)

We consider the problem of designing a near-optimal linear decision tree to classify two given point sets B and W in $\Re^n$. A linear decision tree defines a polyhedral subdivision of space; it is a classifier if no leaf region contains points from both sets. We show hardness results for computing such a classifier with approximately optimal depth or size in polynomial time. In particular, we show that unless NP = ZPP, the depth of a classifier cannot be approximated within any constant factor, and that the total number of nodes cannot be approximated within any fixed polynomial. Our proof uses a simple connection between this problem and graph coloring and uses the result of Feige and Kilian on the inapproximability of the chromatic number. We also study the problem of designing a classifier with a single inequality that involves as few variables as possible and point out certain aspects of the difficulty of this problem.
Easy Office, Small Business Edition, 1st edition
Authors: Kathy Ivens, Jon Brimacomb
Venue:  (1998)

:A four-color visual approach to learning that is easy to follow and fun for the reader to use when learning about Office SBE. The reader will quickly and easily learn now to use all the Office SBE applications including Small Business Financial Manager 97, Outlook, Internet Explorer and Automap Streets Plus Easy Office Small Business Edition provides all of the information a novice reader needs to know quickly and successfully without overwhelming the reader with too much text or too much coverage. New series features include quick reference "where am I" tabs, more complete index with terms familiar to the reader and not just the author, and a new updated look and feel.Four-color visual approach guaranteed to get the reader up to speed quickly on how to use Office SBE.Best value-priced title on the market in a four-color visual approach covering Office SBE.New, updated layout and design to appeal to today's fast-paced, "need to know it quickly" audience that wants to learn visually.
Fast methods for testing quantified relational calculus assertions
Authors: Philip A. Bernstein, Barbara T. Blaustein
Venue: Proceedings of the 1982 ACM SIGMOD international conference on Management of data (1982)

Semantic integrity assertions are predicates that define consistent states. A database system enforces assertions by ensuring that consistency is maintained as the database is updated.Most research on the efficient enforcement of assertions has concentrated on assertion simplification algorithms --- algorithms that produce simplified assertions that can be evaluated before the update is executed. This paper describes a strategy for further improving the efficiency of assertion enforcement.We develop an efficient algorithm for evaluating an assertion produced by an assertion simplification algorithm. We characterize a class of assertions that can be evaluated using a simple two-step procedure. The first step defines and evaluates simple selection queries on each relation. The second step applies set emptiness tests to the results of these selections. We also show how these techniques may be used to improve the efficiency of evaluating assertions outside our class.
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
Authors: Eyal Kushilevitz, Rafail Ostrovsky, Yuval Rabani
Venue: SIAM Journal on Computing (2000)

We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vectors in some high dimensional Euclidean space, we want to construct a space-efficient data structure that would allow us to search, given a query vector, for the closest or nearly closest vector in the database. We also address this problem when distances are measured by the L1 norm and in the Hamming cube. Significantly improving and extending recent results of Kleinberg, we construct data structures whose size is polynomial in the size of the database and search algorithms that run in time nearly linear or nearly quadratic in the dimension. (Depending on the case, the extra factors are polylogarithmic in the size of the database.)
Numerical Approximations for Stochastic Differential Games
Authors: Harold J. Kushner
Venue: SIAM Journal on Control and Optimization (2002)

The Markov chain approximation method is a widely used, robust, relatively easy to use, and efficient family of methods for the bulk of stochastic control problems in continuous time for reflected-jump-diffusion-type models. It has been shown to converge under broad conditions, and there are good algorithms for solving the numerical problems if the dimension is not too high. Versions of these methods have been used in applications to various two-player differential and stochastic dynamic games for a long time, and proofs of convergence are available for some cases, mainly using PDE-type techniques. In this paper, purely probabilistic proofs of convergence are given for a broad class of such problems, where the controls for the two players are separated in the dynamics and cost function, and which cover a substantial class not dealt with in previous works. Discounted and stopping time cost functions are considered. Finite horizon problems and problems where the process is stopped on first hitting an a priori given boundary can be dealt with by adapting the methods of [H. J. Kushner and P. Dupuis, Numerical Methods for Stochastic Control Problems, in Continuous Time, 2nd ed., Springer-Verlag, Berlin, New York, 2001] as done in this paper for the treated problems. The essential conditions are the weak-sense existence and uniqueness of solutions, an "almost everywhere" continuity condition, and that a weak local consistency condition holds "almost everywhere" for the numerical approximations, just as for the control problem. There are extensions to problems with controlled variance and jumps.
Marginal replacement in multivariate densities, with application to skewing spherically symmetric distributions
Authors: M. C. Jones
Venue: Journal of Multivariate Analysis (2002)

We consider a simple general construct, that of marginal replacement in a multivariate distribution, that provides, in particular, an interesting way of producing distributions that have a skew marginal from spherically symmetric starting points. Particular examples include a new multivariate beta distribution and a new multivariate t / skew t distribution, along with Azzalini and colleagues' multivariate skew normal distribution.
Managing change with patterns
Authors: Michael Duell
Venue: Design patterns in communications software (2001)

COST ASSOCIATED WITH MODIFYING SOFTWARE are a large part of an organization's software development budget. Since change is to be expected, the costs associated with change can be reduced by preparing it. Software design patterns associate a problem and context with a solution to document good design practices. Patterns allow software designers to evaluate solutions in terms of the aspects of the system most likely to vary. This chapter uses the INgage Intelligent Peripheral Prototype to demonstrate how the use of two patterns, Layers and Mediator, facilitated a major change to the protocol stacks, and isolated object interactions to make them more maintainable.
Chaos Theory in the Financial Markets
Authors: Robert Trippi, Dimitris N. Chorafas
Venue:  (1994)

:Chaos theory is a revolutionary approach to understanding and forecasting the behavior of complex systems. The theory,which utilizes nonlinear mathematics to identify the underlying rules of evolving systems,provides extraordinary insights into the dynamics of the financial markets. In so doing,Dr. Chorafas explores a variety of new approaches that provide an entirely new perspective on financial market analysis and forecasting. Topics include: the concepts and mathematics of chaos theory; using nonlinear equations and fractals to forecast the currency market; genetic algorithms and neural networks.
Complete Guide to Windows 2000 Professional
Authors: Peter Norton, John Mueller, Richard Mansfield
Venue:  (2000)

:Peter Norton's Complete Guide to Windows 2000 Professional is the one source reference that gives you everything you need once you pass the initial Windows learning curve. Windows 2000 introduces many new technologies designed to improve system performance and capabilities, and this book explains the underlying technologies as well as their practical implications of each. Topics include customizing the new interface, installation and configuration wizards and options, next generation web integration, new security features, support for next generation hardware and peripherals, and taking advantage of the new mobile user and synchronization support.
Manipulating structured information in a visual workspace
Authors: Haowei Hsieh, Frank M. Shipman
Venue: Proceedings of the 15th annual ACM symposium on User interface software and technology (2002)

This paper describes the VITE system, a visual workspace that supports two-way mapping for projecting structured information to a two-dimensional workspace and updating the structured information based on user interactions in the workspace. This is related to information visualization, but reflecting visual edits in the structured data requires a two-way mapping from data to visualization and from visualization to data. VITE provides users with an interface for designing two-way mappings. Mappings are reusable on different datasets and may be switched within a task. An evaluation of VITE was conducted to study how people use two-way mapping and how two-way mapping can help in problem solving tasks. The results show that users could quickly design visual mappings to help their problem-solving tasks. Users developed more sophisticated strategies for visual problem-solving over time.
Effects of Environmental Threats on the Quality of Care in Acute Care Hospitals
Authors: Kyung I. Youn, Thomas T. H. Wan
Venue: Journal of Medical Systems (2001)

This study investigates how environmental threats may adversely affect internal resources (slacks) and how hospitals' slack level may mediate the adverse effect of environmental threats on quality. Two testable hypotheses are (1) The environmental threat and level of organizational slack in hospitals are inversely related&semi; and (2) Hospitals' slack level and quality of care are positively related. Both hypotheses are supported by the data in analysis of the structural relationships among the environmental threat, organizational slack, and quality of care indicators.
Compilation of data-driven programs for synchronous execution
Authors: Janice E. Cuny, Lawrence Snyder
Venue: Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages (1983)

We present algorithms that convert a class of parallel programs, called loop programs, from data-driven mode to synchronous mode. Such algorithms enable programmers to use a high-level, data-driven programming language without forfeiting the efficiency of a synchronous machine. We characterize loop programs for which conversion is possible in terms of sets of balancing equations and we present two conversion algorithms.
hp-adaptive two-level methods for boundary integral equations on curves
Authors: N. Heurer, M. E. Mellado, E. P. Stephan
Venue: Computing (2001)

We consider the p- hp-versions of the Galerkin boundary element method for hypersingular and weakly singular integral equations of the first kind on curves. We derive a-posteriori error estimates that are based on stable two-level decompositions of enriched ansatz spaces. The Galerkin errors are estimated by inverting local projection operators that are defined on small subspaces of the second level. A p-adaptive and two hp-adaptive algorithms are defined and numerical experiments confirm their efficiency.