ppxscal/embedding_network huggingface dataset:
Developing Business Objects
Authors: Robert Prins
Venue:  (1996)

:Increasingly more information systems are becoming a mass of business objects, driven by different events and operating in a host of different environments. The complexity of the business object development process can require an unrealistic combination of talents in its developers. This text describes a development approach which systematically reduces complexity by applying layers, patterns and frameworks to provide sound business ojectives suitable for amalgamation for individual use and large teams alike. The book integrates object orientation, client server architecture, workflow modelling and pattern based design into one logical whole.
Image indexing & retrieval using intermediate features
Authors: Mohamad Obeid, Bruno Jedynak, Mohamed Daoudi
Venue: Proceedings of the ninth ACM international conference on Multimedia (2001)

Visual information retrieval systems use low-level features such as color, texture and shape for image queries. Users usually have a more abstract notion of what will satisfy them. Using low-level features to correspond to high-level abstractions is one aspect of the semantic gap.In this paper, we introduce intermediate features. These are low-level "semantic features" and "high level image" features. That is, in one hand, they can be arranged to produce high level concept and in another hand, they can be learned from a small annotated database. These features can then be used in an image retrieval system.We report experiments where intermediate features are textures. These are learned from a small annotated database. The resulting indexing procedure is then demonstrated to be superior to a standard color histrogram indexing.
Rightsizing Information Systems, 2nd edition
Authors: Steven L. Guengerich
Venue:  (1994)

:Proven methods for streamlining information systems! This book is an important addition to the library of every corporate information systems strategist.Provides an understanding of how downsized information systems will affect a businessIncludes problem-solving answers and adviceFeatures business opportunity and organization suggestions
Interprocedural register allocation for RISC machines
Authors: John Wood, Harold C. Grossman
Venue: Proceedings of the 30th annual Southeast regional conference (1992)

Efficient register allocation can significantly impact the performance of a program. Most register allocation investigations deal with intraprocedural register allocation. This paper presents two interprocedural register allocation approaches along with empirical data to judge the value of each approach on a variety of benchmark programs. The GNU C compiler is used on a Data General Aviion computer as the investigation environment.
Techniques for speculative run-time parallelization of loops
Authors: Manish Gupta, Rahul Nim
Venue: Proceedings of the 1998 ACM/IEEE conference on Supercomputing (CDROM) (1998)

This paper presents a set of new run-time tests for speculative parallelization of loops that defy parallelization based on static analysis alone. It presents a novel method for speculative array privatization that is not only more efficient than previous methods when the speculation is correct, but also does not require rolling back the computation in case the variable is found not to be privatizable. We present another method for speculative parallelization which can overcome all loop-carried anti and output dependences, with even lower overhead than previous techniques which could not break such dependences. Again, in order to ameliorate the problem of paying a heavy penalty for speculatively parallelizing loops that turn out to be serial, we present a technique that enables early detection of loop-carried dependences. Our experimental results from a preliminary implementation of these tests on an IBM G30 SMP machine show a significant reduction in the penalty paid for mis-speculation, from roughly 50% to between 2% and 18% of the serial execution time. For parallel loops, we obtain about the same, and often, even better performance relative to the previous methods, making our techniques extremely attractive.
C Programming in the OS 2 2.1 Environment
Authors: V. Mitra Gopaul
Venue:  (1994)

:This important OS/2 programmer's reference combines OS/2 development tools that are scattered through many different IBM manuals into one easy-to-use source. It covers all levels of C and C++ application development in the OS/2 environment using the IBM C Set++ Compiler. Numerous illustrations and examples simplify complex aspects of software development and maintenance. Detailed chapters explain how to work with the latest tools of Presentation Manager (PM), IBM's WorkFrame/2, the debugger, and development tools such as the OS/2 Toolkit. Designed to meet the programmer's daily needs, this guide shows how to define input files and use dynamic-link libraries; increase programming productivity with menus and dialog boxes; use new PM tools such as the resource compiler, dialog editor, font editor, and icon editor; and add information help to programs with IPF. This complete user's guide to C and C++ language covers data types, operators, and statements. A reference to the entire ANSI C standard function library provides the syntax and operation of the full range of functions. It clarifies all aspects of the cycle of compiling, linking, and running programs; the Information Processing Utility and its required files, environment variables, and tags; and object-oriented programming and the System Object Model (SOM). Developing C/C++ Software in the OS/2 Environment is a reference and self-teaching handbook for OS/2 programmers and developers and a text for programming students at all levels.
Sams Teach Yourself Network Troubleshooting in 24 Hours, 1st edition
Authors: Jonathan Feldman
Venue:  (1998)

:A practical, hands-on quide to network troubleshooting that emphasizes diagnostic techniques that both professionals and part-time network adminstrators can understand and use in their day-to-day activities. In today's pervasive network environment, many of these people are often responsible for fixing a network if it goes down. This book emphasizes fixing practical networking applications like shared printers, using the Internet, and sharing files. It does not get into the specifics of protocols or specific applications, but provides short, concise overviews of topics like wireless networking, Unix, Windows 2000, Novell Netware, routers, and firewalls. 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
Windows 2000 Administration in a Nutshell: A Desktop Quick Reference
Authors: Mitch Tulloch
Venue:  (2000)

:Anyone who installs Windows 2000, creates a user, or adds a printer is a 2000 system administrator. This book covers all the important day-to-day administrative tasks, and the tools for performing each task are included in a handy easy-to-look-up alphabetical reference. What's the same and what's different between the Windows 2000 and Windows NT platform? Has the GUI or the networking architecture changed, and if so, how? Windows 2000 Administration in a Nutshell addresses the problems associated with bridging the gap between the Windows NT and Windows 2000 platforms. This book covers: Commonalities and differences between Windows NT and Windows 2000 All the administrative tasks, including Installation, Group Policies, Terminal Services, User Accounts, and Virtual Private Networks Microsoft Management Console tool (MMC) What's new and significant in the Control Panel utilities Command-line Tools, Utilities and Wizards TCP/IP networking with Windows 2000 Windows 2000 Advanced Server and its clustering capability Whether the concern is new security issues or how Active Directory works, Windows 2000 Administration in a Nutshell is as useful to the single-system home user as it is to the administrator of a 1,000-node corporate network.
Combining high performance and fault tolerance in a distributed file server
Authors: Sape J. Mullender
Venue: Proceedings of the 4th workshop on ACM SIGOPS European workshop (1990)

Among the most reliable and fault tolerant components in a distributed system are storage systems. Obviously, reliability of storage systems belongs to the most researched issues in distributed computing.Every distributed file system project is based on different assumptions about size, load, amount of sharing, and desirable semantics, making it hard to compare research results fairly.The current Amoeba file server is the Bullet File Server [van Renesse, Tanenbaum, and Wilschut, 1989] which provides immutable files, is optimized for whole-file transfer and does caching at the file server. It has excellent performance for reading cached files (1.5 + 1.5 n ms for n kilobytes) and for sustained file I/O (680 kilobytes per second, both on read and write).Although performance is excellent, there is room for improvement, especially in the area of fault tolerance, sharing semantics and caching. I am currently doing the back-of-the-envelope design for a new file server that will form the basis of both our normal file system and of a complex-object server which is being designed by the database group at CWI. In addition to those desirable properties of fault tolerance, persistency, consistency, and availability, I am anxious to achieve even better performance than the Bullet server by extensive use of client and server caching.This position paper presents some of our design ideas. Note that this is work in progress; that the design is only just starting and that an implementation of a design will not start for another six months or so.
Energy-delay efficiency of VLSI computations
Authors: Paul I Pénzes, Alain J. Martin
Venue: Proceedings of the 12th ACM Great Lakes symposium on VLSI (2002)

In this paper we introduce an energy-delay efficiency metric that captures any trade-off between the energy and the delay of the computation.We apply this new concept to the parallel and sequential composition of circuits in general and in particular to circuits optimized through transistor sizing. We bound the delay and energy of the optimized circuit and we give necessary and sufficient conditions under which these bounds are reached. We also give necessary and sufficient conditions under which subcomponents of a design can be optimized independently so as to yield global optimum when recomposed.We demonstrate the utility of a minimum-energy function to capture high level compositional properties of circuits. The use of this minimum-energy function yields practical insight into ways of improving the overall energy-delay efficiency of circuits.
Computing graphical queries over XML data
Authors: Sara Comai, Ernesto Damiani, Piero Fraternali
Venue: ACM Transactions on Information Systems (TOIS) (2001)

The rapid evolution of XML from a mere data exchange format to a universal syntax for encoding domain-specific information raises the need for new query languages specifically conceived to address the characteristics of XML. Such languages should be able not only to extract information from XML documents, but also to apply powerful transformation and restructuring operators, based on a well-defined semantics. Moreover, XML queries should be natural to write and understand, as nontechnical persons also are expected to access the large XML information bases supporting their businesses. This article describes XML-GL, a graphical query language for XML data. XML-GL's uniqueness is in the definition of a graph-based syntax to express a wide variety of XML queries, ranging from simple selections to expressive data transformations involving grouping, aggregation, and arithmetic calculations. XML-GL has an operational semantics based on the notion of graph matching, which serves as a guideline both for the implementation of native processors, and for the adoption of XML-GL as a front-end to any of the XML query languages that are presently under discussion as the standard paradigm for querying XML data.
DNS performance and the effectiveness of caching
Authors: Jaeyeon Jung, Emil Sit, Hari Balakrishnan, Robert Morris
Venue: Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement (2001)

This paper presents a detailed analysis of traces of DNS and associated TCP traffic collected on the Internet links of the MIT Laboratory for Computer Science and the Korea Advanced Institute of Science and Technology (KAIST). The first part of the analysis details how clients at these institutions interact with the wide-area DNS system, focusing on performance and prevalence of failures. The second part evaluates the effectiveness of DNS caching.In the most recent MIT trace, 23% of lookups receive no answer; these lookups account for more than half of all traced DNS packets since they are retransmitted multiple times. About 13% of all lookups result in an answer that indicates a failure. Many of these failures appear to be caused by missing inverse (IP-to-name) mappings or NS records that point to non-existent or inappropriate hosts. 27% of the queries sent to the root name servers result in such failures.The paper presents trace-driven simulations that explore the effect of varying TTLs and varying degrees of cache sharing on DNS cache hit rates. The results show that reducing the TTLs of address (A) records to as low as a few hundred seconds has little adverse effect on hit rates, and that little benefit is obtained from sharing a forwarding DNS cache among more than 10 or 20 clients. These results suggest that the performance of DNS is not as dependent on aggressive caching as is commonly believed, and that the widespread use of dynamic, low-TTL A-record bindings should not degrade DNS performance.
Power play
Authors: Patrick P. Gelsinger
Venue: Communications of the ACM (2002)

There will always be a need for power &hellip; but at what cost?
The Internet for MACs for Dummies
Authors: Charles Seiter
Venue:  (1994)

:Whether you want to set up a business, shop the coolest new 3-D Web sites, or have fun on the Net, The Internet For Macs For Dummies, 3rd Edition, shows you how to maximize your Mac's Web capabilities. With sensible advice on OS 8, 8.1, and 8.5, plus helpful tips on the latest browser releases, this down-to-earth guide helps you get the most out of the Internet.
Indirect addressing techniques in the design and implementation of an on-line file access program
Authors: Nilo A. Niccolai
Venue: Proceedings of the 17th annual Southeast regional conference (1979)

This paper considers design criteria for generalized file access program and describes implementation of such a program using indirect addressing techniques in a higher level language. The implementation discussed is an on-line program to create and maintain herbarium records written in PL/I. The author shows that the indirect addressing techniques yield a concise, easily modifiable program which can be used on an arbitrary file by simply modifying initialization parameters.
An Introduction to Neural Networks
Authors: Kevin Gurney
Venue:  (1997)

:An Introduction to Nueral Networks will be warmly welcomed by a wide readership seeking an authoritative treatment of this key subject without an intimidating level of mathematics in the presentation.
A new approach to infinite precision integer arithmetic
Authors: Dorothea A. Klip
Venue: Proceedings of the 14th annual Southeast regional conference (1976)

A new algorithm for integer Greatest Common Divisor calculations has recently been proposed. Although the algorithm can be applied to integers in any base b > 2, it is conjectured to be optimal for b=30, when embedded in a system for symbol manipulation. Representation of the digits in factored form further facilitates the GCD procedure. When choosing the set of residues mod 30 symmetrically with respect to 0, in only 8 out of 29 elements a factor occurs which is different from 2, 3 and 5, the prime divisors of 30. A multiplication and addition table built on the distinction of these two classes of digits will be the intermediary in finding the product in a small number of steps, each involving comparison of 1 or 2 bit quantities. Multiplication in this fashion requires 1/3 of the number of bit manipulations as compared with standard procedures on IBM System/360 and 370, if the latter would be applied to equivalent (i.e. 5-bit) entities. Future implementation of long-integer multiplication is suggested in analogy with an algorithm for multivariate polynomial multiplication. An outline for division on this new basis is included.
An effective document clustering method using user-adaptable distance metrics
Authors: Han-joon Kim, Sang-goo Lee
Venue: Proceedings of the 2002 ACM symposium on Applied computing (2002)

Document clustering is inherently an unsupervised learning process that organizes document (or text) data into distinct groups without depending on pre-specified knowledge. However, real-world applications, such as building a topical hierarchy for a large document collection, need to perform clustering under various kinds of constraints. This paper presents a new type of supervised clustering to organize information in a way that reflects knowledge provided by a user. As a means by which external human knowledge can be incorporated into the clustering process, a quadratic form distance metric is employed that contains a weight matrix. Also, we propose a way of representing knowledge to guide the clustering process and a variant of the gradient descent search technique to find a user-specific weight matrix under the hierarchical clustering strategy.
Fast paint texture
Authors: Aaron Hertzmann
Venue: Proceedings of the 2nd international symposium on Non-photorealistic animation and rendering (2002)

We present a technique for simulating the physical appearance of paint strokes under lighting. This technique is easy-to-implement and very fast, yet produces realistic results. The system processes a painting composed of a list of brush strokes. A height map is assigned to each stroke, and a height field for the painting is produced by rendering the brush strokes textured with the height maps. The final painting is rendered by bump-mapping the painting's colors with the height map. The entire process takes only a few seconds on current hardware.
Windows 98 Cheat Sheet
Authors: Shelley O'Hara
Venue:  (1999)

:"Windows 98 Cheat Sheet" is a unique two-in-one book that gives busy people answers on the run and the opportunity for a deeper study later. The most important information is highlighted so the hard work is done already. When readers have the time, they can move beyond the basics with clear explanations of the most powerful features of Windows 98.
On convergence of switching windows computation in presence of crosstalk noise
Authors: Pinhong Chen, Yuji Kukimoto, Chin-Chi Teng, Kurt Keutzer
Venue: Proceedings of the 2002 international symposium on Physical design (2002)

Detecting overlapping of switching windows between coupling nets is a major static technique to accurately locate crosstalk noise. However, due to the mutual dependency between switching windows, the computation requires iterations to converge. In this paper, we discuss the issues and provide answers to the important questions involved in convergence and numerical properties, including the effect of coupling models, multiple convergence points, convergence rate, computational complexity, non-monotonicity, continuity and the effectiveness of bounds. Numerical fixed point computation results are used to explain these properties. Our contribution here builds a theoretical foundation for static crosstalk noise analysis.
Microsoft Exchange 5.5 Administrator's Pocket Consultant
Authors: Kathy Ivens
Venue:  (1999)

:The "fast answers" guide to Microsoft Exchange Server 5.5 gives IT implementers a hands-on, immediate reference that will get them through situations and challenges that arise, taking the most concise, direct approach possible. The book focuses on specific case scenarios in support and management of Microsoft Exchange Server.
A half-century of automata theory: celebration and inspiration
Venue:  (2001)

This volume gathers lectures by 8 distinguished pioneers of automata theory, including two Turing Award winners. In each contribution, the early developments of automata theory are reminisced about and future directions are suggested. Although some of the contributions go into rather intriguing technical details, most of the book is accessible to a wide audience interested in the progress of the age of computers. The book is a must for professionals in theoretical computer science and related areas of mathematics. For students in these areas it provides an exceptionally deep view at the beginning of the new millennium.
Navigating the Mortgage Maze: An Interactive High-Tech Guide to Financing Your Home
Authors: Andrew E. Turnauer
Venue:  (1996)

:Savvy, streetwise advice, with free software to help with your calculations! Securing a mortgage to purchase a home can be one of life's most nerve-racking experiences. Navigating the Mortgage Maze is your ultimate road map through the twists and turns of the mortgage process. Bolstered by a wealth of entertaining and instructive stories and tips, veteran mortgage professional Andrew Turnauer guides you every step of the way in acquiring a mortgage, bringing his years of experience to bear on such issues as assessing your financial situation and buying power; selecting the proper loan configuration; prequalifying for loans; selecting a lender or mortgage broker; improving your credit rating; maximizing your collateral, capacity, and character; and minimizing the paperwork. Navigating the Mortgage Maze is truly interactive, and includes a free computer disk containing the intuitively easy-to-use QualifyR software, which enables you to perform a range of "what-if" calculations. The software compares interest rates, loan types, and many other factors to automatically calculate potential payments and income requirements. What's more, the book directs you to numerous online sites that offer even more help and information, including the author's own interactive site. 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 Art of Strategic Planning for Information Technology, Second Edition, 2nd edition
Authors: Bernard H. Boar
Venue:  (2000)

:A revision of the bestselling book that shows IT departments how to take on new challengesAs technology becomes more mainstream and accessible, companies must develop new ways to use their IT resources in order to compete. In this extensive revision, IT expert Bernard Boar provides a methodology that shows readers how to use IT as a competitive business asset. He tackles the latest challenges facing IT departments over the next several years, including how to devise a complete strategy to make the department more effective and how to choose the best strategy framework for a company. Boar also shows how technologies like e-commerce, data warehousing, architectures, and Java can be used to make a business more competitive. 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