ppxscal/embedding_network huggingface dataset:
Spreadsheets Formatting and Printing
Authors: Sue Etherington
Venue:  (2000)

:World-renowned for its digital expertise, Dorling Kindersley shares its know-how in a series of user-friendly visual guides to all the computer skills you'll ever need. The Essential Computers series provides simple, visual references to all the computer skills you need, from word processing to the internet. Addressing the issues that thousands of new users face every day, the Essential Computers series helps them join the "Information Age." Each book in the series is geared toward solving a specific task by using the most up-to-date software available. Whether the issue is creating spreadsheets in Microsoft Excel or parental control of the internet, each lesson is taught in the simple, step-by-step style that DK made famous. The text is clearly illustrated with pictures pulled directly from computer screens, showing the reader what to expect at each stage.
Efficient algorithms for block-cyclic array redistribution between processor sets
Authors: Neungsoo Park, Viktor K. Prasanna, Cauligi Raghavendra
Venue: Proceedings of the 1998 ACM/IEEE conference on Supercomputing (CDROM) (1998)

Run-time array redistribution is necessary to enhance the performance of parallel programs on distributed memory supercomputers. In this paper, we present an efficient algorithm for array redistribution from cyclic(x) on P processors to cyclic(Kx) on Q processors. The algorithm reduces the overall time for communication by considering the data transfer, communication schedule, and index computation costs. The proposed algorithm is based on a generalized circulant matrix formalism . Our algorithm generates a schedule that minimizes the number of communication steps and eliminates node contention in each communication step. The network bandwidth is fully utilized by ensuring that equal-sized messages are transferred in each communication step. Furthermore, the procedure to compute the schedule and the index sets is extremely fast. It takes O(max(P, Q)) time. Therefore, our proposed algorithm is suitable for run-time array redistribution. To evaluate the performance of our scheme, we have implemented the algorithm using C and MPI. The experiments were conducted on the IBM SP2. The experimental results show that the proposed algorithm outperforms well-known algorithms when the total communication time including the data transfer and schedule and index computation times are considered.
Programming Web services with SOAP
Authors: James Snell, Doug Tidwell
Venue:  (2002)

Programming Web Services with SOAP is a detailed guide to using SOAP and other leading web services standards---WSDL (Web Service Description Language) and UDDI (Universal Description, Discovery, and Integration protocol). You'll learn the concepts of the web services architecture and get practical advice on building and deploying web services in the enterprise.
Rewired: An Optimized Web History
Authors: David Hudson
Venue:  (1997)

:David Hudson charts the course of the Internet from its quiet birth, through its anarchic salad days, to the impact of commercialization of the web and the current rush to convert the Net into a passive infotainment medium. In interviews with Wired editor Louis Rossetto and former Wired contributing writer Paulina Borsook, Hudson takes measure of the magazine that claims to be "the voice of the digital revolution" and the libertarianism it has helped to promote. Howard Rheingold discusses his current views on virtual communities and his hopes of bringing a more social form of communication to the web, and eight network administrators describe the ideals behind their hands-on efforts to wire their local communities. Surveying the shifting landscape, Hudson unravels the fringe ideas of a technotranscendental global consciousness and Extropian sci-fi dreams of uploading the human mind onto computer hard disks, probes the deeper issues of online identity, privacy and censorship, and explores new forms of publishing and artistic expression. 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
Children and the World Wide Web: Tool or Trap?
Authors: Samuel Joshua Friedman
Venue:  (2000)

:The emergence of the Internet as a global form of communication has raised issues regarding advertising to children. Is the Internet a broadcaster or a publisher? How does the First Amendment relate to Mass Communication? How do Internet technology and games modify children's development? "Children and the World Wide Web" examines both the legal issues, specifically the regulation of the Internet, and the behavioral issues that are central to a discussion of children and the Internet.Author Biography: Samuel Joshua Friedman is a Psychologist for the Jersey City Board of Education and an adjunct professor at Touro College in New York.
Using the Oracle Toolset, 1st edition
Authors: Mike Krohn
Venue:  (1992)

:Do you have some experience of commercial computer applications and the use of third generation language or 4GLs? Are you faced with the challenge of implementing and developing an Oracle-based system and looking for a practical guide that will accelerate you on your learning curve to rapid success? Then Using the Oracle Toolset is the book for you. 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
Planning as constraint satisfaction: solving the planning graph by compiling it into CSP
Authors: Minh Binh Do, Subbarao Kambhampati
Venue: Artificial Intelligence (2001)

The idea of synthesizing bounded length plans by compiling planning problems into a combinatorial substrate, and solving the resulting encodings has become quite popular in recent years. Most work to-date has however concentrated on compilation to satisfiability (SAT) theories and integer linear programming (ILP). In this paper we will show that CSP is a better substrate for the compilation approach, compared to both SAT and ILP. We describe GP-CSP, a system that does planning by automatically converting Graphplan's planning graph into a CSP encoding and solving it using standard CSP solvers. Our comprehensive empirical evaluation of GP-CSP demonstrates that it is superior to both the Blackbox system, which compiles planning graphs into SAT encodings, and an ILP-based planner in a wide range of planning domains. Our results show that CSP encodings outperform SAT encodings in terms of both space and time requirements in various problems. The space reduction is particularly important as it makes GP-CSP less susceptible to the memory blow-up associated with SAT compilation methods. The paper also discusses various techniques in setting up the CSP encodings, planning specific improvements to CSP solvers, and strategies for variable and value selection heuristics for solving the CSP encodings of different types of planning problems. Copyright 2001. Elsevier Science B.V.
Engineering Problem Solving with ANSI C: Fundamental Concepts
Authors: Delores M. Etter
Venue:  (1995)

:Focusing on five major engineering/scientific applications as examples, this volume presents a design process for solving engineering problems, and then develops corresponding solutions using ANSI C. An accompanying diskette contains all the example problems and data files used in the book.
Subtyping dependent types
Authors: David Aspinall, Adriana Compagnoni
Venue: Theoretical Computer Science (2001)

The need for subtyping in type systems with dependent types has been realized for some years. But it is hard to prove that systems combining the two features have fundamental properties such as subject reduction. Here we investigate a subtyping extension of the system λP, which is an abstract version of the type system of the Edinburgh Logical Framework LF. By using an equivalent formulation, we establish some important properties of the new system λP6=, including subject reduction. Our analysis culminates in a complete and terminating algorithm which establishes the decidability of type-checking. Copyright 2001 Elsevier Science B.V.
Java: An Introduction to Computer Science and Programming, 2nd edition
Authors: Walter J. Savitch
Venue:  (2000)

:Written by a best-selling author, this concise, accessible introduction covers key language features as well as uses a conversational style to teach programmers problem solving and programming techniques with Java. Readers are introduced to object-oriented programming and important computer science concepts such as testing and debugging techniques, program style, inheritance, and exception handling. It includes thorough coverage of the Swing libraries and event driven programming. Thorough early coverage of objects is included, with an emphasis on applications over applets. Java: An Introduction to Computer Science and Programming starts from the beginning and teaches traditional, more basic techniques, such as algorithm design. The author includes a highly flexible format that allows instructors and readers to adapt coverage of topics to their preferred order. Covers Java2, Sun's latest version of the Java language and contains a flexible design. Appropriate for readers interested in an introduction to Computer Science using Java (CS1 with Java) and other introductory programming courses.
Problem solving in automata, languages, and complexity
Venue:  (2001)

Automata, formal language, and complexity theory are central to the understanding of computer science. This book provides, in an accessible, practically oriented style, a thorough grounding in these topics for practitioners and students on all levels.
The accepting power of unary string logic programs
Authors: Tatsuru Matsushita, Colin Runciman
Venue: Theoretical Computer Science (2001)

The set of programs written in a small subset of pure Prolog called US is shown to accept exactly the class of regular languages. The language US contains only unary predicates and unary function symbols. Also, a subset of US called RUS is shown to be equivalent to US in its ability in accepting the class of regular languages. Every clause in RUS contains at most one function symbol in the head and at most one literal with no function symbol in the body. The result is very close to a theorem of Matos (TCS April 1997) but our proof is quite different. Though US and RUS have the same accepting power, their conciseness of expression is dramatically different: if we try to write an RUS program equivalent to a US program, the number of predicates in the RUS program could be O(22N2) where N is the sum of the number of predicates and the number of functors in the US program. Copyright 2001 Elsevier Science B.V.
Microsoft Word 2000
Authors: Maria Reid
Venue:  (1999)

:Learn about Word's revamped table editor and 100 basic Word 2000 functions with this visual reference.
An immersive modeling system for 3D free-form design using implicit surfaces
Authors: Masatoshi Matsumiya, Haruo Takemura, Naokazu Yokoya
Venue: Proceedings of the ACM symposium on Virtual reality software and technology (2000)

We present a new free-form interactive modeling technique based on the metaphor of clay work. This paper discusses design issues and an immersive modeling system which enables a user to design intuitively and interactively 3D solid objects with curved surfaces by using one's finger. Shape deformation is expressed by simple formulas without complex calculation because of skeletal implicit surfaces employed to represent smooth free-form surfaces. A polygonization algorithm that generates polygonal representation from implicit surfaces is developed to reduce the time required for rendering curved surfaces, since conventional graphics hardware is optimized for displaying polygons. The prototype system has shown that a user can design 3D solid objects composed of curved surfaces in a short time by deforming objects intuitively using one's finger in real time.
Internet vulnerabilities related to TCP/IP and T/TCP
Authors: Marco de Vivo
Venue: ACM SIGCOMM Computer Communication Review (1999)

The Internet put the rest of the world at the reach of our computers. In the same way it also made our computers reachable by the rest of the world. Good news and bad news! Over the last decade, the Internet has been subject to widespread security attacks. Besides the classical terms, new ones had to be found in order to designate a large collection of threats: Worms, break-ins, hackers, crackers, hijacking, phrackers, spoofing, man-in-the-middle, password-sniffing, denial-of-service, and so on.Since the Internet was born of academic efforts to share information, it never strove for high security measures. In fact in some of its components, security was consciously traded for easiness in sharing. Although the advent of electronic commerce has pushed for "real security" in the Internet, there are still a large number of users (including computer scientists) that are very vulnerable to attacks, mostly because they are not aware of the nature (and ease) of the attacks and still believe that a "good" password is all they need to be concerned about.Aiming for a better understanding of the subject, we wrote a first paper [1] in which we discussed several threats and attacks related to TCP/IP. The present work is an extension of the first one, and its main goal is to include T/TCP in the discussion. Additionally, in an effort to make this paper more comprehensive, we included some sections from the former.Besides the description of each attack (the what), we also discuss the way they are carried out (the how) and, when possible, the related means of prevention, detection and/or defense.
Business and Information Systems, 2nd edition
Authors: Robert C. Nickerson
Venue:  (2000)

:This question prompted the writing of this text. Chapter, "Business Fundamentals", provides students with patient, clear explanations and numerous illustrations of basic business concepts that they need to know in order to fully comprehend the role of information systems in business. Features of the Second Edition. Expanded coverage of the Internet and Electronic Commerce Both the Internet and Electronic Commerce introduced in Part I, and then integrated throughout the book. Chapter 1 introduces EC applications students are likely to know; Chapter 6 explores the technology behind Electronic Commerce; Chapter 12, "Electronic Commerce and the Strategic Impact of Information Systems," examines the topic from an organizational perspective; and Chapter 13 discusses developing systems for Electronic Commerce. Streamlined introduction to Information Systems Fundamentals Chapter 3 emphasizes the business need for the technological and other components of the information system. Chapter 8: Personal Productivity and Problem Solving Chapter 8 focuses on the need for improved personal productivity in the workplace and explores common end-user software to improve productivity and to solve business problems. Chapter 13: Problem Solving and Information System Development Chapter 13 focuses on the business need for systems development, including those designed for Electronic Commerce. Real-World Cases and Bookmarks Updates Cases adapted from sources such as Computerworld and Infoworld reflect today's hottest issues.The Bookmarks sections of the book provide students with relevant, current scenarios to illustrate key text concepts.
An authorization model for temporal and derived data: securing information portals
Authors: Vijayalakshmi Atluri, Avigdor Gal
Venue: ACM Transactions on Information and System Security (TISSEC) (2002)

The term information portals refers to Web sites that serve as main providers of focused information, gathered from distributed data sources. Gathering and disseminating information through information portals introduce new security challenges. In particular, the authorization specifications, as well as the granting process, are temporal by nature. Also, more often than not, the information provided by the portal is in fact derived from more than one backend data source. Therefore, any authorization model for information portals should support access control based on temporal characteristics of the data, and also should provide tools to prevent indirect unauthorized access through the use of derived data. In this article we focus our attention on devising such an authorization model. The distinguishing features of this model include: (1) the specification of authorizations based on temporal characteristics of data, and (2) a formal framework to derive authorizations in a consistent and safe manner, based on relationships among data.
Tutorials for the Biomedical Sciences: Animations, Simulations, and Calculations Using Mathematica, 1st edition
Authors: Charles Pidgeon
Venue:  (1999)

:Tutorials for the Biomedical Sciences is an exciting new book and computer disk package designed to help instructors, researchers, and undergraduate students achieve a greater comprehension of the basic chemical and physicochemical processes as related to drug action, drug discovery, and biomedical science in general. The Tutorials use Mathematica software as an instructional tool to display, animate, and calculate various complex physical phenomena in a highly understandable manner. The Mathematica software integrates text and graphics and allows for rapid calculation. 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
New results on procedures that select the best system using CRN
Authors: Stephen E. Chick, Koichiro Inoue
Venue: Proceedings of the 32nd conference on Winter simulation (2000)

One use of simulation is to inform decision makers that seek to select the best of several alternative systems. The system with the highest (or lowest) mean value for simulation output is often selected as best, and simulation output is used to infer the value of the unknown mean of each system. Statistical procedures that help to identify the best system by suggesting an appropriate number of replications for each system are therefore useful tools in simulation. This article explores the performance of representative procedures from two approaches to develop statistical procedures, with the goal of understanding tradeoffs involving the ease of use, computational requirements, and the range of applicability. The focus is primarily on procedures that use common random numbers to sharpen comparisons between systems.
Down-time announcement and recovery network
Authors: Jim Dumoulin
Venue: Proceedings of the 17th annual Southeast regional conference (1979)

The PLATO IV computer-based education system is a large scale timesharing communications network capable of supporting hundreds of remote terminals. Terminals are located in offices, college campuses and high schools throughout Florida and tie into the FSU computing system by standard voice grade phone lines.Anyone who has worked with computers is aware that occasionally an interruption of service will occur. It is especially important in the PLATO environment that all users be informed if the system must be down for a short unscheduled interruption.Since all the terminals are connected via dedicated phone lines, ideally, what is needed is a way to send downtime information through the phone network without having to rely on the computer or any of its associated peripherals. The DARN (Downtime Announcement and Recovery Network) which is currently under development at FSU will provide that capability.A standard cassette recorder will play pre-recorded streams of digital data words into the communications network. The cassettes are recorded with an interactive display and character designing editor while the computer is running, and a tape recording is then made of the formatted output. Thereby, even when the computer is down, this tape can be played back in order to recreate any display which was created at an earlier session with the computer. This paper will contain a description of the hardware and software utilized in making the DARN system work. 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
Spreadsheets in Structural Design
Authors: S. R. Davies
Venue:  (1994)

:Spreadsheets in Structural Design provides a unique and highly practical explanation of the use of spreadsheets to facilitate the design of structures in a range of key materials, such as concrete, steel and brick. Using spreadsheets in this way has important implications in terms of cost and efficiency, and represents a very useful tool hitherto largely neglected by the design community. Each chapter contains spreadsheet layouts to illustrate the method, drawn from different areas of design and using a range of materials and Codes of Practice. Examples used relate to reinforced concrete, reinforced masonry and steel but the approach is easily extended to other materials and other fields of design. Practising structural engineers, civil engineers and architects will find this book an invaluable guide for the solution of routine design problems. It is also useful reading for advanced undergraduate and postgraduate students of structural design, civil engineering and architecture.
Internet Starter Kit for the MacIntosh
Authors: Adam C. Engst
Venue:  (1993)

:Take your Mac on a world tour. No matter what you need. Regardless of where you have to go, the Internet can take you there. This book is your ticket. Mac terminal programs, universal email, news services, real-time conversations with people all across the globe, special interest networks, and libraries of programs and information - all this and more is waiting for you. This book also includes all the guidelines and software you need to get going on the Internet - without going bankrupt. Plus, a special connect site offer helps cut costs. Doing this all on your own could cost hundreds of dollars! Other books just tell you about the Internet; this one gets you there.