ppxscal/embedding_network huggingface dataset:
Proceedings of the second Nordic conference on Human-computer interaction
Venue: Nordic Conference on Human-Computer Interaction; Vol. 31 (2002)

NordiCHI is an international conference and the main Nordic forum for human-computer interaction research. It is the meeting place for researchers from academia as well as industry, designers, practitioners, educators and others from a broad range of traditions and communities.The biennial conference is a joint effort supported by the Nordic HCI organisations as well as international partners. The first conference, NordiCHI 2000, took place in Stockholm, Sweden, October 2000, and was organized by STIMDI.NordiCHI promotes HCI as a boundless field of research and practice, dealing with the design and use of interactive technology. Traditionally, Nordic perspectives on HCI emphasise topics such as technology in use, integration of design and use, exploratory design activities, and inter-disciplinary approaches to HCI. This tradition originates in the Nordic openness to new approaches and divergent ideas in the development of new concepts and practices for the future. Architecture, pedagogy, political action, fine arts, industrial design, Dada; the list of contributors to HCI is already long and will continue to grow as information technology diversifies and pervades still wider parts of our lives. NordiCHI is the meeting place for tradition and new directions. Therefore, the theme of NordiCHI 2002 is "tradition and transcendence".Throughout the preparation of NordiCHI 2002 we had the combined goal of maintaining the enthusiasm of the first NordiCHI conference and asserting a high quality technical programme. We think that the papers in this volume demonstrate that NordiCHI have succeeded in manifesting itself as a high quality conference. Among 86 submitted full papers, the programme committee selected 21 to be presented in the plenary papers session. In the short paper category 26 papers were accepted among 55 submissions. The proceedings also include three extended abstracts for demonstrations. And as a new category NordiCHI 2002 introduces "aesthetic artefacts" combining the exhibition of an interactive art piece with a short paper discussing its contribution to HCI discourse.
Computational Finance
Authors: Yaser S. Abu-Mosafa, Blake LeBaron, Andreas S. Weigend, Andrew W. Lo
Venue:  (1999)

:Computational finance, an exciting new cross-disciplinary research area, draws extensively on the tools and techniques of computer science, statistics, information systems, and financial economics. This book covers the techniques of data mining, knowledge discovery, genetic algorithms, neural networks, bootstrapping, machine learning, and Monte Carlo simulation. These methods are applied to a wide range of problems in finance, including risk management, asset allocation, style analysis, dynamic trading and hedging, forecasting, and option pricing. The book is based on the sixth annual international conference Computational Finance 1999, held at New York University's Stern School of Business.
QuickBooks Pro 2000 for Accounting
Authors: Glenn Owen
Venue:  (2001)

:This is the first book of its kind to provide a self-paced environment where students use a commercially available software product to analyze, interpret, and investigate accounting information to make business decisions. This textbook will help students learn fundamental accounting concepts and principles through the use of QuickBooks and the analysis of business events.
Convergent Infeasible Interior-Point Trust-Region Methods for Constrained Minimization
Authors: Paul Tseng
Venue: SIAM Journal on Optimization (2002)

We study an infeasible primal-dual interior-point trust-region method for constrained minimization. This method uses a log-barrier function for the slack variables and updates the slack variables using second-order correction. We show that if a certain set containing the initial iterate is bounded and the origin is not in the convex hull of the nearly active constraint gradients everywhere on this set, then the iterates remain in this set, and any cluster point of the iterates is a first-order stationary point. Moreover, any subsequence of iterates converging to the cluster point has an asymptotic second-order stationarity property, which, when the constraint functions are affine or when the active constraint gradients are linearly independent, implies that the cluster point is a second-order stationary point. Preliminary numerical experience with the method is reported. A primal method and its extension to semidefinite nonlinear programming is also discussed.
TCP/IP performance over 3G wireless links with rate and delay variation
Authors: Mun Choon Chan, Ramachandran Ramjee
Venue: Proceedings of the 8th annual international conference on Mobile computing and networking (2002)

Wireless link losses result in poor TCP throughput since losses are perceived as congestion by TCP, resulting in source throttling. In order to mitigate this effect, 3G wireless link designers have augmented their system with extensive local retransmission mechanisms. In addition, in order to increase throughput, intelligent channel state based scheduling have also been introduced. While these mechanisms have reduced the impact of losses on TCP throughput and improved the channel utilization, these gains have come at the expense of increased delay and rate variability. In this paper, we comprehensively evaluate the impact of variable rate and variable delay on long-lived TCP performance. We propose a model to explain and predict TCP's throughput over a link with variable rate and/or delay. We also propose a network-based solution called Ack Regulator that mitigates the effect of variable rate and/or delay without significantly increasing the round trip time, while improving TCP performance by up to 40%.
Fixed-parameter complexity in AI and nonmonotonic reasoning
Authors: Georg Gottlob, Francesco Scarcello, Martha Sideri
Venue: Artificial Intelligence (2002)

Many relevant intractable problems become tractable if some problem parameter is fixed. However, various problems exhibit very different computational properties, depending on how the runtime required for solving them is related to the fixed parameter chosen. The theory of parameterized complexity deals with such issues, and provides general techniques for identifying fixed-parameter tractable and fixed-parameter intractable problems. We study the parameterized complexity of various problems in AI and nonmonotonic reasoning. We show that a number of relevant parameterized problems in these areas are fixed-parameter tractable. Among these problems are constraint satisfaction problems with bounded treewidth and fixed domain, restricted forms of conjunctive database queries, restricted satisfiability problems, propositional logic programming under the stable model semantics where the parameter is the dimension of a feedback vertex set of the program's dependency graph, and circumscriptive inference from a positive k-CNF restricted to models of bounded size. We also show that circumscriptive inference from a general propositional theory, when the attention is restricted to models of bounded size, is fixed-parameter intractable and is actually complete for a novel fixed-parameter complexity class.
How to Get Your E-Book Published: An Insider's Guide to the World of Electronic Publishing
Authors: Richard Curtis, William Thomas, William Thomas Quick
Venue:  (2002)

:Electronic book publishing offers opportunities that fascinate -- and bewilder -- many writers. How to Get Your E-Book Published is an insider's authoritative, comprehensive guide to this brand-new opportunity for you as a writer. Richard Curtis, agent, author, e-rights guru and e-publisher, and author William Thomas Quick detail how the industry works, where it's headed and how you can be a part of it. As an additional benefit, an invaluable directory of e-resources, referencing e-publishers, online bookstores, e-book software, HTML text editors, and writing Web sites is included. It's all the information you need to conquer the world of e-publishing!
Teach Yourself PhotoShop 6 Visually
Authors: Mike J. Wooldridge
Venue:  (2000)

:The book will introduce the beginning user to the next version of Photoshop, the world's most popular image editing application. It will use the beginner-friendly format developed for the previous Teach YourselfVISUALLY booksconcise text combined with lots of conceptual illustrations and generously captioned screen shots. The chapters will lead the reader through the steps involved in a typical image-editing project, from opening scanned photos and clip art, to manipulating selections and applying filters, to saving finished work for use in print or on the Web. This book will focus on the tools and features most relevant to what the average Photoshop beginner/intermediate wants to do, whether it's building graphics for a simple Web page, formatting clip art for a newsletter, or retouching photos from a digital camera.
Disaster Survival Guide for Business Communications Networks: Strategies for Planning, Response and Recovery in Data and Telecom Systems
Authors: Richard Grigonis
Venue:  (2002)

:This book explores strategies and solutions for disaster planning, mitigation, response, and recovery for data and telecom systems and networks. It covers technologies that help keep connections up with the outside world, as well as how to use communications to keep employees out of harm's way, such as using audio and videoconferencing to reduce the need for travel. Other topics include telecommuting, wireless voice and data technology, uninterruptible power systems, maintaining security during disaster recovery, using the Internet to back up voice communication systems, distributed software, and more. Equipped with illustrations, this offers a complete guide to telecom and data communications survival in case of a natural or man-made disaster.
GSM network signaling
Authors: Yi-Bing Lin
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (1997)

GSM is a wireless digital signaling network standard designed by standardization committees from the major European telecommunications operators and manufacturers. This article introduces the software platform for GSM network signaling protocol called Mobile Application Part (MAP). We describe the MAP services, the MAP protocol machine, the MAP dialog model, and then illustrate the MAP specific service primitives by an example.
MCSE: TCP/IP for NT Server 4 Study Guide
Authors: Todd Lammle, James Chellis, Monica Lammle
Venue:  (1998)

:Here's the book you need to prepare for Exam 70-059, Internetworking with Microsoft TCP/IP on Microsoft Windows NT 4.0. This Microsoft Certified Professional Approved Study Guide provides full coverage of every exam objectiveall the information you need to know, hundreds of challenging review questions, in the book and on the CD, and practical information on TCP/IP internetworking in an NT environment
BuddyCache: high-performance object storage for collaborative strong-consistency applications in a WAN
Authors: Magnus E. Bjornsson, Liuba Shrira
Venue: Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications (2002)

Collaborative applications provide a shared work environment for groups of networked clients collaborating on a common task. They require strong consistency for shared persistent data and efficient access to fine-grained objects. These properties are difficult to provide in wide area networks because of high network latency.BuddyCache is a new transactional caching approach that improves the latency of access to shared persistent objects for collaborative strong-consistency applications in high-latency network environments. The challenge is to improve performance while providing the correctness and availability properties of a transactional caching protocol in the presence of node failures and slow peers.We have implemented a BuddyCache prototype and evaluated its performance. Analytical results, confirmed by measurements of the BuddyCache prototype using the multi-user 007 benchmark indicate that for typical Internet latencies, e.g. ranging from 40 to 80 milliseconds round trip time to the storage server, peers using BuddyCache can reduce by up to 50% the latency of access to shared objects compared to accessing the remote servers directly.
Enterprise Application Integration: A Wiley Tech Brief, 1st edition
Authors: William A. Ruh, William J. Brown, Francis X. Maginnis
Venue:  (2000)

:A much-needed guide to dealing with one of today's most important enterprise computing issuesEnterprise Application Integration (EAI) refers to one of today's most crucial IT challenges--getting the vast array of disparate business applications found in most large companies to work together. Written by the experts at the leading international EAI consulting firm of Concept5, this is a concise introduction to EAI concepts and strategies for IT managers, systems architects, software developers, and all those charged with heading up their companies' EAI initiatives. The authors explore the various advantages and disadvantages of EAI and acquaint readers with the key terms and technologies involved, including distributed objects, object transaction monitors, CORBA and COM/DCOM, and the Web.
The Internet for Windows 98 for Dummies
Authors: John Levine, Carol Baroudi, Margaret Levine Young, Jordan Young
Venue:  (1998)

:Did you know that all the programs you need to connect directly to the Internet from your desktop, send e-mail easily, conduct videoconferences, and create great Web pages are built right into Windows 98? With inimitable wit and straightforward style, The Internet For Windows 98 For Dummies tells you everything you need to know to take full advantage of the extensive Internet capabilities of Windows 98. Inside, find helpful advice on how to Configure Dial-Up Networking to connect to your Internet account Send and receive e-mail with Outlook Express Browse the World Wide Web by using Internet Explorer or Netscape Navigator Update Windows programs from the Microsoft Web site Use FrontPage Express to create great Web pages Set up voice or videoconferences with Microsoft NetMeeting Participate in Usenet newsgroup discussions on any of 20,000 topics Find out all about push technology channels and the new Channel Definition Format
The PERL 5 Programmmer's Reference: Windows 95/NT, MacIntosh, OS/2 & UNIX, 1st edition
Authors: R. Allen Wyke, Luke Duncan
Venue:  (1997)

:The most complete, concise reference available for Perl 5, this documented guide thoroughly covers everything you need to write and debug programs - all in an encyclopedic format. It provides documentation for all Perl 5 commands and included modules; enables easy access to information - lists all commands alphabetically; provides extensive cross references, including jump tables and the complete, hyperlinked text on CD-ROM. Entries feature syntax, usage, examples, values, parameters, a list of related functions, and identification of support for both Perl 4 and Perl 5; plus, implementation tips, and appendices with error codes, special variables, pattern matching, and debugger commands.
Microsoft Internet and Networking Dictionary
Authors: Microsoft Press
Venue:  (2002)

:With today's fast pace of innovation in networking and on the Internet, new technical terms appear constantly. This handy pocket-sized dictionary-a subset of the terms found in the popular, recently updated Microsoft Computer Dictionary, Fifth Edition-promises to keep people up-to-date on the latest terms they need to know. It includes more than 3,000 of the most important terms about the Internet and networking, and it also provides appendixes of Internet country codes and domains, common file extensions, and Instant Messaging emoticons and acronyms. It's the ideal Internet and networking reference for home, office, school, or wherever the latest technology takes you!
Tensor Methods for Large, Sparse Unconstrained Optimization
Authors: Ali Bouaricha
Venue: SIAM Journal on Optimization (1997)

Tensor methods for unconstrained optimization were first introduced by Schnabel and Chow [SIAM J. Optim., 1 (1991), pp. 293--315], who described these methods for small- to moderate-sized problems. The major contribution of this paper is the extension of these methods to large, sparse unconstrained optimization problems. This extension requires an entirely new way of solving the tensor model that makes the methods suitable for solving large, sparse optimization problems efficiently. We present test results for sets of problems where the Hessian at the minimizer is nonsingular and where it is singular. These results show that tensor methods are significantly more efficient and more reliable than standard methods based on Newton's method.
Memory Design and Exploration for Low Power, Embedded Systems
Authors: Wen-Tsong Shiue, Chaitali Chakrabarti
Venue: Journal of VLSI Signal Processing Systems (2001)

In this paper, we describe a procedure for memory design and exploration for low power embedded systems. Our system consists of an instruction cache and a data cache on-chip, and a large memory off-chip. In the first step, we try to reduce the power consumption due to memory traffic by applying memory-optimizing transformations such as loop transformations. Next we use a memory exploration procedure to choose a cache configuration (cache size and line size) that satisfies the system requirements of area, number of cycles and energy consumption. We include energy in the performance metrics, since for different cache configurations, the variation in energy consumption is quite different from the variation in the number of cycles. The memory exploration procedure is very efficient since it exploits the trends in the cycles and energy characteristics to reduce the search space significantly.
Interest made simple with arrays
Authors: Richard L. W. Brown
Venue: ACM SIGAPL APL Quote Quad (2000)

A better financial calculatorStudents of the mathematics of finance seem to be comfortable using calculators to evaluate formulas or numerical expressions. They are typically much less comfortable writing programs in BASIC (or C or Java etc.) even in situations where the calculator solution is tedious and a short program would do the job efficiently. Spreadsheet models, with an emphasis on formulas as opposed to programs, are quite a reasonable and intuitive tool. But spreadsheet formulas seem to be about cells rather than money, time, and interest rates.The ideal tool would be a better calculator. APL and J can be used in calculator mode and therefore should be marketable to students as advanced calculators ideally suited to financial mathematics. This is especially true now that APL and J can be run on a variety of palm-sized computers.This paper presents a few ideas on how students might use J in the mathematics of finance. The emphasis is on using J as a calculator that has lots of memory and can store and compute with arrays. Therefore data will be entered and expressions evaluated but no programs will be presented in the classroom. (However, two utility programs and a few names for J primitives will be used as noted in the next subsection.)J Definitions used in what followsThe J examples below are presented in the plain Courier font. Certain definitions are assumed and these are displayed in Courier italics. The definitions of these italicized functions are given in the Appendix at the end of the paper. In particular, frequent use is made of a dollar format function Df to display numbers in dollar currency format. When dates are part of the input data, the dayno function can be used to compute a day number.All examples in this paper (except for Example 7, which uses the sparse arrays of J version 4.04) can be done with versions of J going back (at least) to J FreeWare, version 3.02.
A new family of online algorithms for category ranking
Authors: Koby Crammer, Yoram Singer
Venue: Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval (2002)

We describe a new family of topic-ranking algorithms for multi-labeled documents. The motivation for the algorithms stems from recent advances in online learning algorithms. The algorithms we present are simple to implement and are time and memory efficient. We evaluate the algorithms on the Reuters-21578 corpus and the new corpus released by Reuters in 2000. On both corpora the algorithms we present outperform adaptations to topic-ranking of Rocchio's algorithm and the Perceptron algorithm. We also outline the formal analysis of the algorithm in the mistake bound model. To our knowledge, this work is the first to report performance results with the entire new Reuters corpus.
Proceedings of the ASIAN symposium on Partial evaluation and semantics-based program manipulation
Venue: ACM/SIGPLAN Workshop Partial Evaluation and Semantics-Based Program Manipulation (2002)

This proceeding contains the papers and abstracts presented at the ASIAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation (ASIA-PEPM). The forum aims to bring together researchers working in the areas of semantics-based program manipulation, partial evaluation and program analysis. .The idea for an Asian located version of PEPM was mooted in last June, and its co-location with the 6th International Symposium on Functional and Logic Programming (FLOPS) was aimed at promoting the synergies of the two meetings. .11 papers were selected from a total of 21 papers that were received in response to a call for papers. The programme is also complimented by 4 invited talks. Each submission was refereed by at least 3 reviewers, and the papers were discussed by the program committee through email over a one week period. Papers were judged according to their originality, clarity and perceived importance. I like to thank the committee and external reviewers for their contributions in helping to shape up the technical programme.
Internet Open Trading Protocol
Authors: David Burdette, Marcus Goncalves
Venue:  (2000)

:Learn how to implement IOTP Supported by the leaders in e-commerce and computing,Internet Open Trading Protocol (IOTP) is a common standard for buying and selling on the Internet. Internet Open Trading Protocol is the first book to explain the ins and outs of IOTP. It tells you why IOTP is important for the future of e-commerce,and how to implement it. You get plenty of implementation savvy from case studies of e-commerce leaders Hewlett Packard,Open Market,Mondex,and DigiCash. Authors Donald Eastlake,David Burdette,and Marcus Goncalves are the developers and gurus of the IOTP standard,and provide expert insights into: *IOTP trading mechanisms *the advantages of IOTP over current standards such as EDI *the necessary XML coding and how it's used with IOTP *more!
Iterations: The New Image
Authors: Timothy Druckrey
Venue:  (1994)

:Digital imaging and computer technology have come to permeate our daily experience. From graphic images in bank machines to Hollywood movies awash in high-tech special effects, from advanced scientific visualization to personal digital assistants, the electronic image has changed the way our culture perceives itself and receives its information. A technology that is used throughout culture as a tool for communication, documentation, and creativity has placed itself squarely in the center of our lives. Simply stated, the computer is everywhere, having an impact on nearly everything. Copublished with The International Center of Photography, New York.