ppxscal/embedding_network huggingface dataset:
Work/place: mobile technologies and arenas of activity
Authors: Elizabeth F. Churchill, Alan J. Munro
Venue: ACM SIGGROUP Bulletin (2001)

Wireless, portable communication devices continue to promise newer and better ways of being constantly available and in touch with information and with other people. In tandem with developments in wireless, mobile access, dreams of refashioning the world of work are woven: if we are to believe the rhetoric, work activities and communications can now take place anytime, anywhere. In this short paper, we raise a number of issues that have been appearing in common discourses of the impact of wireless technologies on the world of work, and consider the relationship of these discourses to ideas of the design of the workplace. Further, we present a summary of papers that appear in this special issue. As the papers were initially presented at a workshop held at ECSCW in Bonn in September of 2001, we present in addition an overview of the comments and discussions that took place at the workshop.
Scalable analysis and design of ad hoc networks via random graph theory
Authors: András Faragó
Venue: Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications (2002)

We lay down the foundations of a new approach for the scalable analysis of ad hoc networks, with special regard to the properties of the random network topology. The proposed methodology is rooted in the theory of random graphs, but we significantly extend the conventional random graph model, as in its original form it would be too "sterile" to capture realistic ad hoc networks. We analyze some fundamental properties of the proposed new, general model and demonstrate that it is capable of solving analysis/design problems which would otherwise be difficult to capture.
Efficient algorithms for minimizing tree pattern queries
Authors: Prakash Ramanan
Venue: Proceedings of the 2002 ACM SIGMOD international conference on Management of data (2002)

We consider the problem of minimizing tree pattern queries (TPQ) that arise in XML and in LDAP-style network directories. In [Minimization of Tree Pattern Queries, Proc. ACM SIGMOD Intl. Conf. Management of Data, 2001, pp. 497-508], Amer-Yahia, Cho, Lakshmanan and Srivastava presented an O(n4) algorithm for minimizing TPQs in the absence of integrity constraints (Case 1); n is the number of nodes in the query. Then they considered the problem of minimizing TPQs in the presence of three kinds of integrity constraints: required-child, required-descendant and subtype (Case 2). They presented an O(n6) algorithm for minimizing TPQs in the presence of only required-child and required-descendant constraints (i.e., no subtypes allowed; Case 3). We present O(n2), O(n4) and O(n2) algorithms for minimizing TPQs in these three cases, respectively, based on the concept of graph simulation. We believe that our O(n2) algorithms for Cases 1 and 3 are runtime optimal.
A Robust Adaptive Method for a Quasi-Linear One-Dimensional Convection-Diffusion Problem
Authors: Natalia Kopteva, Martin Stynes
Venue: SIAM Journal on Numerical Analysis (2001)

A quasi-linear conservative convection-diffusion two-point boundary value problem is considered. To solve it numerically, an upwind finite difference scheme is applied. The mesh used has a fixed number (N+1) of nodes and is initially uniform, but its nodes are moved adaptively using a simple algorithm of de Boor based on equidistribution of the arc-length of the current computed piecewise linear solution. It is proved for the first time that a mesh exists that equidistributes the arc-length along the polygonal solution curve and that the corresponding computed solution is first-order accurate, uniformly in $\varepsilon$, where $\varepsilon$ is the diffusion coefficient. In the case when the boundary value problem is linear, if N is sufficiently large independently of $\varepsilon$, it is shown that after $O({\rm ln}(1/\varepsilon)/{\rm ln} N)$ iterations of the algorithm, the piecewise linear interpolant of the computed solution achieves first-order accuracy in the $L^\infty[0,1]$ norm uniformly in $\varepsilon$. Numerical experiments are presented that support our theoretical results.
A neuroscience-based design of intelligent tools for the elderly and disabled
Authors: Tohru Ifukube
Venue: Proceedings of the 2001 EC/NSF workshop on Universal accessibility of ubiquitous computing: providing for the elderly (2001)

The author has developed one basic research approach for universal accessibility over a period of 28 years. As reviewed in this paper, he and his co-researchers have designed several intelligent tools for universal accessibility as well as obtained many basic findings concerning neuroscience of human information processing. Some of the tools have been manufactured in Japan and the technologies as well as the basic findings have been applied to construct human-centered computer interfaces such as virtual reality, automatic speech recognition and speech syntheses. Moreover, these newly developed computer interface technologies have led to the improvement in the design of models for developing universal accessibility devices. Lastly, the author has emphasized that a neuroscience-based design of intelligent tools for the elderly and disabled may open a large market.
A knowledge discovery method: APL implementation and application
Authors: Alexander O. Skomorokhov
Venue: ACM SIGAPL APL Quote Quad (2000)

The paper concentrates on one direction of Knowledge Discovery in Data Bases and Data Mining, known as automatic rule extraction from data sets.The rule extraction algorithm has been implemented in Dyalog APL. The paper presents APL functions and tests made on artificial data sets.The real life problem solution is described as an application of implemented APL code. The problem is to find automatically rules to describe the corrosion rate of steel in sodium as a function of alloy additions. The input data are experimental data of corrosion rate measured for different steel samples. The output is a set of IF-THEN rules, which describe the dependence of corrosion rate on alloy additions. An expert in corrosion has validated the rules and an example of real "discovery" has been mentioned.
WordPerfect 6.0 Made Easy, 1st edition
Authors: Katie Layman, Lavaughn Hart
Venue:  (1993)

:Text highlights:. By focusing on the SCANS competencies and providing visual cues that identify the particular competency being practiced/developed, Layman/Hart ensure student mastery of key work-ready skills. Plentiful written and visual guides expose students to correct document formatting techniques. Vocabulary, punctuation, and grammar rules are reviewed within the text's exercises to sharpen student's language arts skills. At least eight hands-on exercises per chapter - all of which are based on authentic business documents - provide plenty of practice material. Each chapter contains a mix of guided and independent activities as well as Challenge Your Skills exercises to ease students through mastery of the program. End-of-part Production Skill-Builders enable students to develop decision-making and critical thinking skills.
Moving least squares approximation on the sphere
Authors: Holger Wendland
Venue: Mathematical Methods for Curves and Surfaces: Oslo 2000 (2001)

We introduce moving least squares approximation as an approximation scheme on the sphere. We prove error estimates and approximation orders. Finally, we show certain numerical results.
Mathematical and Computational Biology: Computational Morphogenesis, Hierarchical Complexity, and Digital Evolution : An International Workshop on Mathematical and Computational Biology
Authors: Chrystopher L. Nehaniv
Venue:  (1999)

:This volume contains 13 selected lectures from the International Workshop on Mathematical and Computational Biology subtitled "Computational Morphogenesis, Hierarchical Complexity and Digital Evolution" held at the University of Aizu (Japan). This interdisciplinary workshop brought together researchers working on aspects of evolutionary, mathematical, and computational biology that are of particular interest for computer scientists, biologists, and mathematicians.
Object-Oriented Simulation: Reusability, Adaptability, Maintainability, 1st edition
Authors: George W. Zobrist, James V. Leonard
Venue:  (1997)

:The second part of a yearly series on simulation technology, OBJECT-ORIENTED SIMULATION presents an outstanding variety of the very latest advances in simulation techniques. This leading-edge volume contains a cohesive selection of presentations written by the world-renowned experts in a broad range of topics. OBJECT-ORIENTED SIMULATION is a key resource for anyone involved in computer simulator research and design as well as developers, producers, scholars, and managers. It is an excellent tool for preparing proposals for simulation in commercial and military fields.
Agent-based processing of navigational queries in INFOWEAVER
Authors: Kazunori Katoh, Atsuyuki Morishima, Hiroyuki Kitagawa
Venue: Information organization and databases: foundations of data organization (2000)

We are developing InfoWeaver, an information integration system for the Web, relational databases, and structured document repositories. To collect Web pages required for integration, InfoWeaver deals with navigational queries. In this paper, we present design and evaluation of query processing scheme for navigational queries. In general, navigational queries can cause very lagre data transfer cost if all the necessary pages are transferred to the system. To alleviate this problem, our proposed scheme uses distributed agents, named navigators. They cooperatively take part of the system's functions at Web server sites, to reduce the cost of Web page transfer. This paper includes experimental results on data transfer costs in this scheme.
Relational reinforcement learning
Authors: Kurt Driessens
Venue: Mutli-agents systems and applications (2001)

This paper presents an introduction to reinforcement learning and relational reinforcement learning at a level to be understood by students and researchers with different backgrounds. It gives an overview of the fundamental principles and techniques of reinforcement learning without involving a rigorous deduction of the mathematics involved through the use of an example application. Then, relational reinforcement learning is presented as a combination of reinforcement learning with relational learning. Its advantages &mdash;such as the possibility of using structural representations, making abstraction from specific goals pursued and exploiting the results of previous learning phases&mdash;are discussed.
On the complexity of verifying concurrent transition systems
Authors: David Harel, Orna Kupferman, Moshe Y. Vardi
Venue: Information and Computation (2002)

In implementation verification , We check that an implementation is correct with respect to a specification by checking whether the behaviors of a transition system that models its specification. In this paper, we investigate the effect of concurrency on the complexity of implementation verification. We consider trace-based and tree-based approaches to the verification of concurrent transition systems, with and without fairness. Our results show that in almost all cases the complexity of the problem is exponentially harder than that of the sequential case. Thus, as in the model-checking verification methodology, the state-explosion problem cannot be avoided.
A constructive algorithm for finding the exact roots of polynomials with computable real coefficients
Authors: David Lester, Scott Chambers, Heoi Lee Lu
Venue: Theoretical Computer Science (2002)

In this paper we will show that it is possible to generate the roots of monic polynomials with computable real coefficients as computable complex numbers. A result from constructive analysis has already shown that the roots are computable numbers; however, because the proof is non-constructive it does not provide an effective method for finding the roots. In this work we combine two extra stages to a standard numerical algorithm: an exact error analysis, and a method for aligning sets of complex rational numbers so that the result is a set of computable complex numbers. The method of effectivization is of interest as it can be used in other situations where an algorithm will work with rational approximations, but comparison operations prevent its use with computable numbers.
Programming Languages: Principles and Paradigms
Authors: Allen B. Tucker
Venue:  (2001)

:Programming Languages: Principles and Paradigms by Allen Tucker and Robert Noonan is provides balanced coverage of both the principles of language design and the different programming paradigms. The principles of language design are covered using a formal model and a hands-on laboratory suite that uses a Java interpreter to implement the formal model. This approach gives students an excellent grasp of language design theory and its relationship to practice. It also lays the foundation for the paradigms that are presented in the second half of the book. The text presents and contrasts six major programming paradigms: imperitave,object-oriented,functional,logic,concurrent,and event-driven programming. Through the use of one language for each paradigm,students gain a deep understanding of the paradigm without being distracted by a profusion of languages.
Qualified data flow problems
Authors: L. Howard Holley, Barry K. Rosen
Venue: Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (1980)

It is known that not all paths are possible in the run time control flow of many programs. It is also known that data flow analysis cannot restrict attention to exactly those paths that are possible. It is therefore usual for analytic methods to consider all paths. Sharper information can be obtained by considering a recursive set of paths that is large enough to include all possible paths but small enough to exclude many of the impossible ones. This paper presents a simple uniform methodology for sharpening data flow information by considering certain recursive path sets of practical importance. Associated with each control flow arc there is a relation on a finite set Q. The paths that qualify to be considered are (essentially) those for which the composition of the relations encountered is nonempty. For example, Q might be the set of all assignments of values to each of several bit variables used by a program to remember some facts about the past and branch accordingly in the future. Given any data flow problem together with qualifying relations on Q associated with the control flow arcs, we construct a new problem. Considering all paths in the new problem is equivalent to considering only qualifying paths in the old one. Preliminary experiments (with a small set of real programs) indicate that qualified analysis is feasible and substantially more informative than ordinary analysis. The methodology also has a beneficial feedback effect on the delicate task of passing from programs to meaningful data flow analysis problems. Even when all paths qualify, unusually sharp information can be obtained by passing from programs to problems in ways suggested by our theorems.
EDUNET: what it is --- will it work?
Authors: Ron Code
Venue: Proceedings of the 4th annual ACM SIGUCCS conference on User services (1976)

A prototype network which connects several universities across the country is now being developed. If this network is successful, it could provide a model for a communications system which would allow a user at almost any location to use the computer of his choice, regardless of distance. Twenty-two member universities of The Interuniversity Communications Council (EDUCOM) form the basis for the prototype network (EDUNET) which will use commercially available communication systems --- at least in the beginning.The session will explain purpose, operation and aspirations of EDUNET without neglecting the many difficulties which face networking. One of the most serious problems in the network is the user services functions. How can users receive documentation, classes and consulting help from a computer center 2000 miles away? How can accounts be opened, bills sent and refunds processed? An EDUNET user services seminar was held in Chicago September 27-28 to address these and other questions. The panelists in this session participated in the Chicago seminar and will add their perspectives to the discussion. 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 Promise of Neural Networks
Authors: J. G. Taylor
Venue:  (1993)

:What is the promise of Neural Networks? Just this: they may provide better answers to many "real-world" questions. Problems in industry and business are all too frequently beyond the scope of our present generation of computers. They run into trouble if data is incomplete or contains errors, if a "best guess" is needed, or if it isn't clear how a problem should be tackled. Neural networks are already handling this kind of complex task in areas such as machine vision, time series analysis, robotics, control, cost analysis, and even share price and currency prediction. Neural Networks can learn if they are presented with a range of examples, deduce their own rules for solving problems, and produce valid answers from noisy data. Managers in industry and business, policy-makers, researchers - even undergraduates - will find this book an ideal introduction to Neural Networks. The contents are carefully balanced so as to be accessible to the non-technical reader, while providing detailed information for those with more academic requirements. The EC-funded DEANNA Project (Database for European Artificial Neural Network Activity) has constructed a database of current research, which can be used to judge the success of various applications, in order to assist technology transfer. The results of the DEANNA questionnaire are summarized here.
Sams Teach Yourself Outlook 98 in 24 Hours, 1st edition
Authors: John R. Nicholson, et al
Venue:  (1998)

:In just 24 sessions of one hour or less, you will be up and running with Outlook 98. Using a straightforward, step-by-step approach, each lesson builds upon the previous one, allowing you to learn the essentials of Outlook 98 from the ground up.
Civic Space/Cyberspace: The American Public Library in the Information Age
Authors: Redmond Kathleen Molz, Phyllis Dain
Venue:  (2001)

:In Civic Space/Cyberspace Redmond Kathleen Molz and Phyllis Dain assess the current condition and direction of the American public library. They consider the challenges and opportunities presented by new electronic technologies, changing public policy, fiscal realities, and cultural trends. They draw on site visits and interviews conducted across the country; extensive reading of reports, surveys, and other documents; and their long-standing interest in the library's place in the social and civic structure. The book uniquely combines a scholarly, humanistic, and historical approach to public libraries with a clear-eyed look at their problems and prospects, including their role in the emerging national information infrastructure.
Broadcasting,Cable,the Internet and beyond: An Introduction to Modern Electronic Media, 4th edition
Authors: Joseph R. Dominick, Fritz Messere, Barry L. Sherman
Venue:  (1999)

:This text surveys the field of modern electronic media and beyond. Beyond,more than a word in the title,refers to the new technologies,regulations,programming,and competition that affect our world and the broadcasting industry. The authors of Broadcasting,Cable,the Internet and Beyond have three main goals for every edition: 1) to convey the excitement of the industry,2) to provide a survey of the industry,and 3) presenting a readable text that makes even the most difficult information understandable. With new information and innovations added to an already strong foundation,this edition achieves each of these goals,again.
Enhanced PhotoShop 4 with Cdrom, 10th edition
Authors: David Xenakis
Venue:  (1997)

:Achieve high-level Photoshop mastery - and produce even the most complex imagery with speed and efficiency. This richly illustrated guide provides everything you need - explanations, concepts, and practical advice - to deliver expert results in any medium.
Building virtual worlds with the big-bang model
Authors: Neville Churcher, Alan Creek
Venue: Proceedings of the 2001 Asia-Pacific symposium on Information visualisation - Volume 9 (2001)

Visualisations implemented as virtual worlds can allow users to comprehend large graphs more effectively. Good 3D layout algorithms are an important element. ANGLE has been developed as a platform for experimenting with 3D force-directed layout algorithms. The big-bang modification is proposed as a means of obtaining efficiently good 3D layouts for a wide range of graphs. Results are presented and compared with those from a conventional approach.
Final Fantasy Tactics Greatest Hits: Prima's Official Strategy Guide
Authors: Prima Publishing
Venue:  (2001)

:Battle-by-battle strategies70 battle maps in 3DAll Treasures, secret places, and hidden items revealedStatistical information for action, reaction, and movement skells for every job classDiscover how to play FF VII's cloud strife 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 Java Tutorial: A Short Course on the Basics, 3rd edition
Authors: Mary Campione, Kathy Walrath, Alison Huml
Venue:  (2000)

:Praise for The Java™ Tutorial, Second Edition "This book stands above the rest because it has been available on the web and read by thousands of Java programmers. The authors have received an enormous amount of feedback about which sections are good and which sections are confusing; the confusing ones have been improved. I doubt that any other Java book has undergone such trial by fire...." -Metroplex Java User Group. Whether you're taking a class or learning on the job, The Java™ Tutorial, Third Edition, is a hands-on guide that lets you quickly become proficient with the Java programming language. Written by members of the Java Software team at Sun Microsystems, the book uses an interactive approach to help you learn the Java platform by example. Since its first online release in 1995, the material in The Java™ Tutorial has been updated continuously to reflect reader feedback and new releases of the Java platform. This third edition has been thoroughly updated to cover v1.3 of the Java Platform, Standard Edition, as well as preceding versions as early as JDK 1.1. You will find clear explanations of such fundamentals as objects, classes, and data structures. In addition, the book provides introductions to object-oriented programming, applet construction, and user interface design. Other topics include exceptions, I/O, and threads. To help beginners avoid many common mistakes, an entire chapter is devoted to programming problems and their solutions. Convenient summaries at the end of each section are new to this edition. Also new for this edition are "Questions and Exercises"sections to help you practice what you learn. The accompanying CD-ROM is filled with valuable resources, including: All three Java™ Tutorial books in HTML: The Java™ Tutorial, The Java™ Tutorial Continued, and The JFC Swing Tutorial. All major versions of the Java platform, versions 1.0.2 through 1.3 for the Solaris and Win32 platforms. The latest Java platform for Linux, Standard Edition v1.3, is also included. API documentation for the Java platform. Source code for all examples. After working through the lessons in this proven tutorial, you will be well prepared to use the Java programming language in your school or workplace.