ppxscal/embedding_network huggingface dataset:
Building a community of practice at the help desk
Authors: Debbie Mojta
Venue: Proceedings of the 30th annual ACM SIGUCCS conference on User services (2002)

Communities of practice are becoming recognized in the business world as a way to share knowledge across organizational boundaries [4]. Communities of practice derive from the learning theory proposed by Jean Lave and Etienne Wenger called legitimate peripheral participation, a process where newcomers become part of a community of practice [3]. Rutgers University Computing Services on the Camden campus endeavored to create a community of practice with the student help desk staff, user services staff, and the systems staff. This paper will explore what a community of practice is, the benefits and problems with including students in a community of practice, and the online resources that have been beneficial in connecting the community.
Boosting I/O performance of internet servers with user-level custom file systems
Authors: Jun Wang, Rui Min, Zhuying Wu, Yiming Hu
Venue: ACM SIGMETRICS Performance Evaluation Review (2001)

Previous studies have shown that disk I/O times are one of the major performance bottlenecks of Internet servers such as proxy cache servers. Most conventional file systems do not work well for such systems because of their very high overheads. Although Special-purpose operating systems may achieve high performance, it is very difficult and expensive to design and maintain. They also have very poor portability. In this paper we propose to built user-space, customized file systems for Internet servers so as to achieve high-performance, low-implementation-cost and good portability at the same time. To provide an example of such systems, we presented a novel scheme called WPSFS that can drastically improve I/O performance of proxy servers and other applications. WPSFS is an application-level software component of a proxy server which manages data on a raw disk or disk partition. Since the entire system runs in the user space, it is easy and inexpensive to implement. It also has good portability and maintainability. With efficient in-memory meta-data data structures and a novel file system called Page-structured file system(PFS), WPSFS achieves 9-20 times better I/O performance than the state-of-the-art SQUID server running on a Unix Fast File System, and 4-10 times better than the improved SQUIDML.
Algorithms for Vertex Partitioning Problems on Partial k-Trees
Authors: Jan Arne Telle, Andrzej Proskurowski
Venue: SIAM Journal on Discrete Mathematics (1997)

In this paper, we consider a large class of vertex partitioning problems and apply to them the theory of algorithm design for problems restricted to partial k-trees. We carefully describe the details of algorithms and analyze their complexity in an attempt to make the algorithms feasible as solutions for practical applications.We give a precise characterization of vertex partitioning problems, which include domination, coloring and packing problems, and their variants. Several new graph parameters are introduced as generalizations of classical parameters. This characterization provides a basis for a taxonomy of a large class of problems, facilitating their common algorithmic treatment and allowing their uniform complexity classification.We present a design methodology of practical solution algorithms for generally $\NP$-hard problems when restricted to partial k-trees (graphs with treewidth bounded by k). This "practicality" accounts for dependency on the parameter k of the computational complexity of the resulting algorithms.By adapting the algorithm design methodology on partial k-trees to vertex partitioning problems, we obtain the first algorithms for these problems with reasonable time complexity as a function of treewidth. As an application of the methodology, we give the first polynomial-time algorithm on partial k-trees for computation of the Grundy number.
Client-Server Caching with Expiration Timestamps
Authors: Tamra Carpenter, Robert Carter, Munir Cochinwala, Martin Eiger
Venue: Distributed and Parallel Databases (2001)

We study client-server caching of data with expiration timestamps. Although motivated by the potential for caching in telecommunication applications, our work extends to the general case of caching data that has known expiration times. Toward this end, we tailor caching algorithms to consider expiration timestamps. Next, we consider several different client-server paradigms that differ in whether and how the server updates client caches. Finally, we perform simulation studies to evaluate the empirical performance of a variety of strategies for managing a single cache independent of the server and for managing caches in a client-server setting.
The Politics of Usability: A Practical Guide to Designing Usable Systems in Industry, 1st edition
Authors: Lesley Trenner, Joanna Bawa
Venue:  (1998)

:Usability engineering makes computer systems easier to use and more relevant to business needs. Although much research has been done into methods and techniques for usability engineering, there is little available on how to put this into practice in a commercial environment. This book, written by usability professionals from a variety of non-IT organizations, take readers through the process of starting and running a Usability Group, alerting readers to potential political problems, implementation difficulties and possible solutions.
Dynamic HTML Web Magic with Cdrom
Authors: Jeff Rouyer
Venue:  (1998)

:Using a visually rich yet code-intensive step-by-step approach, our Dynamic HTML guru, Jeff Rouyer, guides you through text, image, layer, and interface techniques that will make your site stand out from the crowd. The companion CD-ROM includes: four bonus DHTML techniques - dragdrop scroller, info boxes, exposing layers, and external loading; Netscape Navigator 4.04 for Windows and Macintosh. 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
Secure XML: The New Syntax for Signatures and Encryption
Authors: Donald E. Eastlake, Kitty Niles
Venue:  (2002)

From the Book:Secure XML explains the guts of XML Digital Signatures and XML Encryption and how you, as a designer, implementer, or evaluator of an XML application, can make use of these technologies.The Extensible Markup Language (XML) is rapidly becoming the new standard in application level computer communications. As its use widens, mechanisms to assure that XML documents and messages are authentic and can be communicated confidentially, become essential.Material provided in this book minimizes needed pre-requisite knowledge, although it requires general familiarity with computer concepts. For the reader not familiar with digital security or cryptology concepts, Part I includes a chapter covering these topics in the depth needed to understand the remainder of the book. For the reader not familiar with XML, Part II provides in depth coverage of XML and related standards. This XML material provides not just the background needed for the rest of this book, but sufficiently general coverage that it should be helpful in understanding most XML applications and systems. Readers with sufficient knowledge in the areas covered can skip or skim these background parts.After the introductory and background material in Parts I and II, the topics of XML Digital Signatures, XML Encryption, and XML Canonicalization are covered in depth. This includes specific formats and examples and covers keying material, combined use of signature and encryption, algorithms, and profiling of signature use for particular applications. If your interest is only in XML Digital Signatures or XML Encryption can skip the Chapters associated with the other topic. But any non-trivial use of XML Security willrequire some familiarity with XML Canonicalization, keying information, and the relevant algorithms.Using this book, a skilled reader can design and implement interoperable XML based authentication and/or confidentiality mechanisms for their particular applications.This book is firmly based on the official adopted standards of the World Wide Web Consortium, Internet Engineering Task Force, and other relevant standards bodies when available. Material going beyond that is based on the most recent drafts or informational documents available at the time of writing and the personal knowledge and experiences of the authors.In general, areas of XML Security are presented by giving an informal syntax with a skeletal example, followed by the formal syntax and then a number of more complete examples. The material is organized so that the formal syntax and complete examples can be read in either order.Throughout the book, notes are included that might be of interest to the reader, where the authors either have some particular knowledge of the history involved or have some heretical opinion.
Wireless Communications: Principles and Practice
Authors: Theodore S. Rappaport
Venue:  (1995)

:Offering a wealth of practical information on the implementation realities of wireless communications, this book also contains up-to-date information on the major wireless communication standards from around the world. Covers every fundamental aspect of wireless communications, from cellular system design to networking, plus the world-wide standards, including ETACS, GSM, and PDC. For cellular radio engineers and technicians.
Linear Quadratic Optimization for Systems in the Behavioral Approach
Authors: Augusto Ferrante, Sandro Zampieri
Venue: SIAM Journal on Control and Optimization (2000)

In this paper the following formulation of the linear quadratic optimal control problem for dynamical systems in the behavioral setting is proposed: given a linear, time-invariant, and complete system, find the set of trajectories of the system that optimize a quadratic-type cost function and that satisfy some linear static constraints. This formulation provides a unifying framework, where several generalized versions of the classical LQ optimal control can be stated and solved.The existence of solutions is first discussed. It is shown that a necessary and sufficient condition for the existence of solutions may be obtained as a by-product of a reduction procedure translating the problem into an equivalent one of minimum complexity. Such a procedure is based on the theory of $\ell^2$-systems in the behavioral setting. Once the complexity is reduced, a parametrization of the set of optimal solutions is obtained by employing a behavioral realization technique and a two-step optimization procedure.
From Natural to Artificial Swarm Intelligence
Authors: Eric Bonabeau, Marco Dorigo, Guy Theraulaz
Venue:  (1999)

:This book provides a detailed look at models of social insect behavior and how to apply these models in the design of complex systems. The book shows how these models replace an emphasis on control, preprogramming, and centralization with designs featuring autonomy, emergence, and distributed functioning. These designs are proving immensely flexible and robust, able to adapt quickly to changing environments and to continue functioning even when individual elements fail. In particular, these designs are an exciting approach to the tremendous growth of complexity in software and information. Swarm Intelligence draws on up-to-date research from biology, neuroscience, artificial intelligence, robotics, operations research, and computer graphics, and each chapter is organized around a particular biological example, which is then used to develop an algorithm, a multiagent system, or a group of robots. The book will be an invaluable resource for a broad range of disciplines.
Sams Teach Yourself the Internet in 24 Hours, 6th edition
Authors: Ned Snell
Venue:  (2002)

:Teach Yourself the Internet in 24 Hours, Second Edition is a guidebook and quick step-by-step tutorial broken up into 24 short, one-hour chapters that are easy for the busy beginner to read and digest. Topics include: Getting Started Choosing the right service provider: AOL or ISP? Connecting to the Internet Making the Web and Internet Work for You Using a Web browser Searching the Internet for people, places, and things Plug-ins, helper applications, and other confusing things Communicating with E-Mail and Newsgroups Sending and receiving e-mail Reading and posting to Newsgroups Getting the Most out of the Internet Protecting yourself and your family: security and privacy Using the Internet in the real world: leisure, buying/selling Creating your own home page Companion Web Site Software products discussed in the book for easy download, and links to other products and resourcesUpdated with the latest technological and software developments such as Internet Explorer 4.0, Netscape Communicator, channels and Netcasting, HTML mail, and Web integration.Internet technology focus will appeal to users of all versions of Windows, Mac and UNIX.Covers all aspects of the Internet such as establishing a connection, using the World Wide Web, searching for information, sending and receiving E-mail, using Newsgroups, security issues and more.
Visual Basic 5 Database Developer's Guide, 1st edition
Authors: Mark Swank, Mark Spenik, Drew Kittel
Venue:  (1996)

:Written by developers for developers, this advanced guide shows users how to design, develop, and deploy secure client/server databases on the Internet and Intranet Web sites using the latest version of Microsoft Visual Basic.Includes real-world examples and applications throughout the book for users to implement on their sitesCD-ROM is loaded with author's source code and a collection of Web and database tools
On the A-Stability of Runge--Kutta Collocation Methods Based on Orthogonal Polynomials
Authors: Roberto Barrio
Venue: SIAM Journal on Numerical Analysis (1999)

Some results about the A-stability of Runge--Kutta collocation methods based on the zeros and extrema of the ultraspherical or Gegenbauer polynomials are presented. These methods are implicit and the A-stability is an important property usually demanded. The Routh--Hurwitz algorithm is used to establish the main results about the A-stability of the methods, depending on the parameter $\lambda$ of the polynomials. For low degree methods some analytical results are presented, while for higher degree an open problem based on numerical tests is proposed.
A Decomposition Theorem for Maximum Weight Bipartite Matchings
Authors: Ming-Yang Kao, Tak-Wah Lam, Wing-Kin Sung, Hing-Fung Ting
Venue: SIAM Journal on Computing (2002)

Let G be a bipartite graph with positive integer weights on the edges and without isolated nodes. Let n, N, and W be the node count, the largest edge weight, and the total weight of G. Let k(x, y) be log x / log (x2/y). We present a new decomposition theorem for maximum weight bipartite matchings and use it to design an $O(\sqrt{n}W / k(n, W/N))$-time algorithm for computing a maximum weight matching of G. This algorithm bridges a long-standing gap between the best known time complexity of computing a maximum weight matching and that of computing a maximum cardinality matching. Given G and a maximum weight matching of G, we can further compute the weight of a maximum weight matching of G - {u} for all nodes u in O(W) time.
From statistics to emergence: exercises in systems modularity
Authors: Jozef Kelemen
Venue: Mutli-agents systems and applications (2001)

The contribution sketches several ways of considering systems from the position of their modularity through viewing systems without any attention focused to their modularization, then as composed from functionally specified modules, up to the post-modular systems consisting of relatively independent autonomous modules sharing a common environment and acting in it. A relatively simple, uniform and productive theoretical framework for study of the mentioned aspects of systems behavior and modularity - the framework of the theory of grammar systems - will be presented, illustrated and discussed in certain details.
Example-based phrase translation in Chinese-English CLIR
Authors: Bin Wang, Xueqi Cheng, Shuo Bai
Venue: Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval (2002)

This paper proposes an example-based phrase translation method in a Chinese to English cross-language information retrieval (CLIR) system. The method can generate much more accurate query translations than dictionary-based and common MT-based methods, and then improves the retrieval performance of our CLIR system.
Existence of Lipschitz and Semiconcave Control-Lyapunov Functions
Authors: Ludovic Rifford
Venue: SIAM Journal on Control and Optimization (2000)

Given a locally Lipschitz control system which is globally asymptotically controllable at the origin, we construct a control-Lyapunov function for the system which is Lipschitz on bounded sets, and we deduce the existence of another one which is semiconcave (and so locally Lipschitz) outside the origin. The proof relies on value functions and nonsmooth calculus.
Internet for Active Learners: Curriculum-Based Strategies for K.12
Authors: Pam Berger
Venue:  (1998)

:Internet for Active Learners: Curriculum-Based Strategies for K.12 connects information to learning with technology advice for newbies, advance strategies for Internet pros, and teaching tools, such as: more than 500 Web sites especially selected for curriculum integration and active learning, five strategies for integrating the Web into the curriculum, web site evaluation checklists for you and for students, suggested content checklist for your library home page, and advice on Internet workshops for teachers and parents.
Synthesizing Transformations for Locality Enhancement of Imperfectly-Nested Loop Nests
Authors: Nawaaz Ahmed, Nikolay Mateev, Keshav Pingali
Venue: International Journal of Parallel Programming (2001)

Linear loop transformations and tiling are known to be very effective for enhancing locality of reference in perfectly-nested loops. However, they cannot be applied directly to imperfectly-nested loops. Some compilers attempt to convert imperfectly-nested loops into perfectly-nested loops by using statement sinking, loop fusion, etc., and then apply locality enhancing transformations to the resulting perfectly-nested loops, but the approaches used are fairly ad hoc and may fail even for simple programs. In this paper, we present a systematic approach for synthesizing transformations to enhance locality in imperfectly-nested loops. The key idea is to embed the iteration space of each statement into a special iteration space called the product space. The product space can be viewed as a perfectly-nested loop nest, so embedding generalizes techniques like statement sinking and loop fusion which are used in ad hoc ways in current compilers to produce perfectly-nested loops from imperfectly-nested ones. In contrast to these ad hoc techniques however, our embeddings are chosen carefully to enhance locality. The product space can itself be transformed to increase locality further, after which fully permutable loops can be tiled. The final code generation step may produce imperfectly-nested loops as output if that is desirable. We present experimental evidence for the effectiveness of this approach, using dense numerical linear algebra benchmarks, relaxation codes, and the tomcatv code from the SPEC benchmarks.
The Knowledge Engine: How to Create Fast Cycles of Knowledge-to-Performance and Performance-to-Knowledge
Authors: Lloyd Baird, John C. Henderson
Venue:  (2001)

:"The Knowledge Engine includes a wealth of practical tools that organizations can use to put each step of the knowledge-performance cycle into actual practice. An "After Action Review," for instance, helps explore lessons learned from performance and a "Peer Review" gets what others know into the performance process quickly." "The Knowledge Engine not only explains the principles of creating and leveraging knowledge as an asset that will provide a competitive advantage - it gives concrete examples of how to do it right now. The authors provide extensive illustrations of how leading organizations are getting improved performance and bottom line results by creating their own "knowledge engines," and offer a framework to help any organization implement systems and procedures for leveraging its knowledge assets."--BOOK JACKET.
ICA and SOM in text document analysis
Authors: Ella Bingham, Jukka Kuusisto, Krista Lagus
Venue: Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval (2002)

In this study we show experimental results on using Independent Component Analysis (ICA) and the Self-Organizing Map (SOM) in document analysis. Our documents are segments of spoken dialogues carried out over the telephone in a customer service, transcribed into text. The task is to analyze the topics of the discussions, and to group the discussions into meaningful subsets. The quality of the grouping is studied by comparing to a manual topical classification of the documents.
Pro Tools 5 for Macintosh and Windows: Visual QuickStart Guide
Authors: Steven Roback
Venue:  (2002)

:Pro Tools is the industry standard for recording and editing digital audio. Its elegant interface and powerful editing features make it the most widely used digital audio software by professional recording producers, musicians, home studio professionals, and quality-minded hobbyists worldwide.Using the easy-to-follow visual format of the Visual QuickStart Guide, Pro Tools 5 for Macintosh and Windows will show readers how to make multitrack audio recordings using Digidesign's Pro Tools LE and Pro Tools Free software. The body of the book will offer concise, step-by-step instructions on how to use Pro Tools' main functions, including recording, editing, mixing, and effects processing. It will also introduce and explain the basics of automation, MIDI sequencing, and file management in Pro Tools. It will also show readers how to setup and use several Digidesign hardware systems, including the Digi 001, Mbox, and Audiomedia III. 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
Image content modeling for neuroscience databases
Authors: Yunmook Nah, Phillip C.-Y. Sheu
Venue: Proceedings of the 14th international conference on Software engineering and knowledge engineering (2002)

Most of the content-based image retrieval systems focuses on similarity-based retrieval of natural picture images by utilizing color, shape, and texture features. For the neuroscience image databases, we found that retrieving similar images based on global average features is meaningless to pathological researchers. To realize the practical content-based retrieval on images in neuroscience databases, it is essential to represent internal contents or semantics of images in detail. In this paper, we present how to represent image contents and their related concepts to support more useful retrieval on such images. We also describe the operational semantics to support these advanced retrievals by using object-oriented message path expressions. Our schemes are flexible and extensible, enabling users to incrementally add more semantics on image contents for more enhanced content searching.