ppxscal/embedding_network huggingface dataset:
An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 Programs
Authors: Jean B. Lasserre
Venue: SIAM Journal on Optimization (2002)

We consider the general nonlinear optimization problem in 0-1 variables and provide an explicit equivalent positive semidefinite program in 2n-1 variables. The optimal values of both problems are identical. From every optimal solution of the former, one easily finds an optimal solution of the latter, and conversely, from every solution of the latter, one may construct an optimal solution of the former. For illustration, the equivalent positive semidefinite program is explicated for quadratic 0-1 programs and MAX-CUT in $\mathbb{R}^3$. For unconstrained 0-1 programs, a special representation in terms of a weighted sum of squares is provided.
Large scale CAI: the NSF project
Authors: Erik McWilliams
Venue: Proceedings of the ACM annual conference - Volume 1 (1972)

Rapid and direct communication between a computer and a student, with instructional material dynamically tailored by the computer for each student, has been practised for some time now, generally under the label of CAI - Computer Assisted Instruction. Although results from earlier, scattered use of CAI indicate that students using it reach predefined levels of mastery somewhat sooner, and with less variation in performance, we do not find widespread use of this technology in our schools. Although there are very likely many reasons for this, we believe that high cost (from 3 to 10 times more costly than traditional instruction) and uncertainty concerning CAI's range of application have significantly delayed its adoption.Considering the makeshift nature of good deal of the early CAI material (courseware), and the technology by which it had to be delivered (costly transmission lines, ill-suited computer hardware and software, and costly and inappropriate student consoles), it is surprising that performance wasn't worse. However, two of the more recent CAI systems, MITRE's TICCIT and the University of Illinois' PLATO IV, have been designed specifically in response to these earlier weaknesses. Their promise, plus the increasing need for more and better options and a brake to the rising cost for education, has motivated the National Science Foundation (Office of Computing Activities) to organize and support the development and classroom test of each system.The major purpose of the project is to provide government, industrial, and educational decision makers with:- cost and effectiveness data from TICCIT and PLATO IV instruction.- system and components - hardware, software, courseware, and test instruments - that might prove useful after the termination of the project.- documented insight into problems or opportunities for future research and development.To this end, the Foundation has awarded contracts (totalling $10 M over a 4-1/2 year period) to MITRE, the University of Illinois, and an independent evaluator - The Princeton Educational Testing Service - for the conduct of the necessary activities. Preparations for the tests and evaluations got underway formally in February 1972. The strategies and plans governing the project are presented in the following sections. 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 largest small octagon
Authors: Charles Audet, Pierre Hansen, Frédéric Messine, Junjie Xiong
Venue: Journal of Combinatorial Theory Series A (2002)

Thrackleation of graphs and global optimization for quadratically constrained quadratic programming are used to find the octagon with unit diameter and largest area. This proves the first open case of a conjecture of R. L. Graham (J. Combin. Theory Ser. A 18 (1975), 165-170).
Multiplicative Schwarz Algorithms for the Galerkin Boundary Element Method
Authors: Matthias Maischak
Venue: SIAM Journal on Numerical Analysis (2000)

We study the multiplicative Schwarz method for the h- and the p-version Galerkin boundary element method for a hypersingular and a weakly singular integral equation of the first kind. For both integral equations we prove that the contraction rate of the multiplicative Schwarz operator is strictly less than 1 for the h-version for the two level and the multilevel methods, whereas for the p-version we show that the contraction rate approaches one only logarithmically in p for the 2-level method. Computational results are presented for both the h-version and the p-version which support our theory.
Random LSC Functions: An Ergodic Theorem
Authors: Lisa A. Korf, Roger J.-B. Wets
Venue: Mathematics of Operations Research (2001)

An ergodic theorem for random lsc (lower semicontinuous) functions is obtained by relying on a "scalarization" of such functions. In the process, Kolmogorov's extension theorem for random lsc functions is established. Applications to statistical estimation problems, composite materials, and stochastic optimization problems are briefly noted.
A Real-Time Approach to Process Control
Authors: William Y. Svrcek, Brent R. Young, Donald P. Mahoney
Venue:  (2001)

:A hands-on teaching and reference text for chemical engineersIn writing this book the authors' have focused exclusively on the vast majority of chemical engineering students who need a basic understanding of practical process control for their industrial careers. Traditionally process control has been taught using non-intuitive and highly mathematical techniques (Laplace and frequency-domain techniques). Aside from being difficult to master in a one-semester course, the traditional approach is of limited use for more complex process control problems encountered in the chemical processing industries. When designing and analyzing multi-loop control systems today, industry practitioners employ both steady-state and dynamic simulation-based methodologies. These 'real time' methods have now all but replaced the traditional approach.A Real Time Approach to Process Control provides the student with both a theoretical and practical introduction to this increasingly important approach. Assuming no prior knowledge of the subject, this text introduces all of the applied fundamentals of process control from instrumentation to process dynamics, PID loops and tuning, to distillation, multi-loop and plant-wide control. In addition, students come away with a working knowledge of the three most popular dynamic simulation packages. The text carefully balances theory and practice by offering students readings and lecture materials along with hands-on workshops that provide a 'virtual' process on which to experiment and from which to learn modern, real time control strategy development.Features: * The first and only textbook to use a completely real time approach. * Gives students theopportunity to understand and use HYSYS software. * Carefully designed workshops (tutorials) have been included to allow students to practice and apply the theory. * Includes many worked examples and student problems.
Nerds 2.0.1: A Brief History of the Internet
Authors: Stephen Segaller, Oregon Public Broadcasting
Venue:  (1998)

:Millions tuned into the Internet to access the Starr Report. Now Nerds 2.0.1, the first detailed history of computer networking, tells the dramatic story of how we have come to be wired together by the Internet and the World Wide Web. Stephen Segaller's timely book draws on detailed interviews with more than seventy of the pioneers who have user their technological genius and business skills to make incompatible systems work together, to make networking user-friendly, and to create a new global communications medium that rivals the telephone system or television in its scope and reach.
Windows Sockets 2 Programming
Authors: Jason Coombs, Ted Coombs, Martin Hall
Venue:  (1997)

:This authoritative title on WinSock 2 programming gives practical information on creating applications with WinSock 2. WinSock 2 expands Windows network APIs beyond TCP/IP to other network protocols and is a critical component for networked applications, wireless applications, multimedia, and high-speed networks.
Adaptive Push-Pull: Disseminating Dynamic Web Data
Authors: Manish Bhide, Pavan Deolasee, Amol Katkar, Ankur Panchbudhe, Krithi Ramamritham, Prashant Shenoy
Venue: IEEE Transactions on Computers (2002)

An important issue in the dissemination of time-varying web data such as sports scores and stock prices is the maintenance of temporal coherency. In the case of servers adhering to the HTTP protocol, clients need to frequently pull the data based on the dynamics of the data and a user's coherency requirements. In contrast, servers that possess push capability maintain state information pertaining to clients and push only those changes that are of interest to a user. These two canonical techniques have complementary properties with respect to the level of temporal coherency maintained, communication overheads, state space overheads, and loss of coherency due to (server) failures. In this paper, we show how to combine push and pull-based techniques to achieve the best features of both approaches. Our combined technique tailors the dissemination of data from servers to clients based on 1) the capabilities and load at servers and proxies and 2) clients' coherency requirements. Our experimental results demonstrate that such adaptive data dissemination is essential to meet diverse temporal coherency requirements, to be resilient to failures, and for the efficient and scalable utilization of server and network resources.
Webworks: E-Commerce
Authors: Katherine Tasheff Carlton
Venue:  (2001)

From the Book:Introduction by Katherine Tasheff Carlton The customer is king. The rule my great-grandfather upheld while operating a corner grocery store in the early 1900s still applies in the world of electronic commerce. Customers want to have their needs met as quickly and conveniently as possible. With an estimated 304 million people online worldwide and the average duration of a page view less than one minute, e-commerce customers are increasingly interested in the expedience the technology offers, not the technology itself. Most of the novelty of online transactions has worn off; people want to get online, make their purchases, and get on with other activities. Sites must immediately grab attention. If users are not intrigued or satisfied, they move on-quickly. Repeatedly, the conversations I've had with site designers have boiled down to this: Simplicity is the key to e-commerce design. As most developers know, a design that appears simple is often the most complicated to create. With nearly one out of every three Internet users making online purchases, e-commerce site developers must tread a delicate line between utility and aesthetics. Beyond the retail-oriented sites, the corporate world has almost universally made the leap to online transactions. Pull-down menus, heavy back-end databases, secure servers, limited bandwidth, and brand marketing all must be taken into account while creating a visually pleasing, easy-to-use environment. What does simplicity in design really mean? More often than not, ease of use is the bottom line. This means that the most important aspect of e-commerce design is understanding the company's business model and knowing how customers will accessthe site and what they will demand when they do. Many designers try to do too much, loading sites with too many bells and whistles or presenting so much information on the home page that users are immediately lost. Occasionally, the original model was a good starting point, but through the rapid expansion possible in the interactive age, sites outgrow their systems, navigation, and basic design. Sometimes simplicity in design means not changing the site around to accommodate every new advance in technology. As Rhonda Wells, director of a-commerce for Payless ShoeSource, says, 'How do you feel in this scenario? You're in the middle of cooking dinner for guests that evening when you realize you're out of an ingredient. (End of excerpt) 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
IP Multicasting with Cdrom
Authors: Marcus Goncalves, Kitty Niles
Venue:  (1998)

:IP multicasting is an emerging technology that gives you considerable cost and bandwidth savings - as it paves the way for the broadcasting of voice, video, and data over the Internet and corporate Intranets, without depleting network resources. IP Multicasting: Concepts and Applications goes far beyond an overview of what this technology is. It explains how it works inside real networks, reviews all the major products available today, and tells you what to look for when purchasing and upgrading network equipment and software. Ideal for systems managers, network administrators, systems integrators, Internet managers, and even Chief Information Officers implementing or planning to implement IP multicasting, IP Multicasting: Concepts and Application provides the technical foundation for understanding IP and broadcasting over IP networks; explains how IP multicasting works in a variety of environments, including frame relay, Layer 3 Switched, and satellite networks; and includes a complete resource directory, giving you one-stop access to reliable standards-based information, plus a comprehensive list of acronyms and a glossary.
The LIP+-Stability and Error Estimates for a Relaxation Scheme
Authors: Hailiang Liu, Jinghua Wang, Gerald Warnecke
Venue: SIAM Journal on Numerical Analysis (2000)

We show the discrete lip+-stability for a relaxation scheme proposed by Jin and Xin [ Comm. Pure Appl. Math., 48 (1995), pp. 235--277] to approximate convex conservation laws. Equipped with the lip+-stability we obtain global error estimates in the spaces W s,p for $-1 \leq s \leq 1/p$, $1 \leq p \leq \infty$ and pointwise error estimates for the approximate solution obtained by the relaxation scheme. The proof uses the framework introduced by Nessyahu and Tadmor [SIAM J. Numer. Anal., 29 (1992), pp. 1505--1519]. We also show a maximum principle for the relaxation scheme when the initial data are in an equilibrium state.
The Microsoft SQL Server 2000 Analysis Services Step by Step, 1st edition
Authors: OLAP Train, Reed Jacobson
Venue:  (1999)

:Olap Services Fundamentals is the fast, complete self-training course to online analytical processing (OLAP) from the premier provider of OLAP training. Its designed to quickly show you why multidimensional data cubes are such a powerful, popular analysis method, and teach you the pitfalls and design strategies behind using OLAP techniques. The content of the book spans a full five days of instructor-led training.Including: 2.5 days of in-depth introduction to OLAP 1.5 days of OLAP solutions and advanced concepts one day to investigate the Microsoft Excel for OLAP Client. All in all, its the fastest way to become fully conversant with Microsoft OLAP Services and the solutions you can build with them.
Microsoft Excel 2000
Authors: Shelley O'Hara, Nancy Warner
Venue:  (1999)

:A four-color visual approach to learning that is easy to follow and fun to use when learning about Microsoft Excel 2000. Learn about the most important features of this spreadsheet program, such as how to enter, edit, and format spreadsheets, how to incorporate formulas and functions into the spreadsheet, and how to create charts and manage workbooks. Easy Microsoft Excel 2000 provides all of the information a novice user needs to know to successfully use the software without overwhelming you with too much coverage.
Artficial Immune Systems and Their Applications, 1st edition
Authors: Dipankar DasGupta
Venue:  (1998)

:This is a pioneering work on the emerging field of artificial immune systems--highly distributed systems based on the principles of the natural system. Like artificial neural networks, artificial immune systems can learn new information and recall previously learned information.
Modelling summary data
Authors: Rowland R. Johnson
Venue: Proceedings of the 1981 ACM SIGMOD international conference on Management of data (1981)

Several problems in specifying aggregate functions in relational systems are investigated. We propose a solution to these problems in the form of an extension of the relational data model. In particular we introduce the concept of summary data. The query language STRAND is presented in order to describe retrieval operations on the extended model. STRAND allows a user to formulate queries involving aggregate functions without conceptualizing the query in terms of aggregation. Two example applications, proposal tracking and socio-demographic data bases, are used to illustrate the concepts of the extended model.
A Book on C; Programming in C, 3rd edition
Authors: Al Kelley, Ira Pohl
Venue:  (1994)

:Now in its fourth edition, A Book on C retains the features that have made it a proven best-selling tutorial and reference on the ANSI C programming language. This edition builds on the many existing strengths of the text to improve, update, and extend the coverage of C, and now includes information on transitioning to Java and C++ from C. Beginners and professional programmers alike will benefit from the numerous examples and extensive exercises developed to guide readers through each concept. Step-by-step dissections of program code illuminate the correct usage and syntax of C language constructs and reveal the underlying logic of their application. The clarity of exposition and format of the book make it an excellent reference on all aspects of C.
Perspectives on organizations in multi-agent systems
Authors: Les Gasser
Venue: Mutli-agents systems and applications (2001)

The aim of this paper is to illustrate and sensitize reader to the variety of perspectives and the fundamental nature of organizations as stable/stabilizing systems and as multi-perspective action systems. Researchers have been explicitly thinking about MAS/DAI organizations and attempting to link formal (human) organization theory with MAS/DAI models for at least twenty years. Despite this, the idea of organizations has been a peripheral theme in MAS/DAI research---primarily a specific coordination technique---not really one of the central intellectual issues of the field. The theory of 'natural' organizations has a somewhat longer, more diverse, and more thorough intellectual history than that of organizations in MAS. Beyond recent work in human social and organization theory, some newer research on abstract organizations has been attempting to unify concepts in biology, chemistry, physics, mathematics, and computing theory (e.g., the lambda calculus), with those of natural social organizations and multi-agent systems. The landscape for thinking about organizations in MAS is growing quite interesting, and this paper surveys this landscape. It presents and contrasts some conceptions of organization that have emerged and proven useful, and attempts to show how these have been implemented, experimented with, and applied. It also projects some future directions for research on MAS organizations, and gives some thoughts on where the most exciting issues lie.
Sid Meier's Gettysburg!: The Official Strategy Guide
Authors: David Ladyman, Melissa Tyler
Venue:  (1997)

:Players can command either the Confederate or Union army in Sid Meier's Gettysburg! This strategy guide shows gamers how to take advantage of the outstanding eight player capability, which keeps the action fast-paced and gripping.
Weaving aspects in a persistent environment
Authors: Awais Rashid
Venue: ACM SIGPLAN Notices (2002)

This paper discusses two mechanisms for weaving aspects in persistent environments founded on object-oriented databases. The first mechanism is based on exploiting existing aspect languages and their associated weavers while the second mechanism is based on building weaving functionality into the database management system (DBMS). The first mechanism has been used to integrate AspectJ and its associated weaver with the Jasmine ODBMS. The second approach has been used to implement a weaver within the SADES object database evolution system.
Current and future applications of mobile and wireless networks
Authors: Rajeswari Malladi, Dharma P. Agrawal
Venue: Communications of the ACM (2002)

Wireless and mobile networks are being used in diverse areas such as travel, education, stock trading, military, package delivery, disaster recovery, and medical emergency care.
NOVELL 'S NetWare 6 Administrator's Handbook, 1st edition
Authors: Robyn Openshaw-Pay, Jeff Harris
Venue:  (2002)

:Your Go-To Guide for NetWare 6 Questions. Filled with concept overviews, installation procedures, configuration options, maintenance schedules, and worksheets, this handbook is your quick reference for the daily tasks associated with NetWare 6. Novell veterans Kelley Lindberg and Jeffrey Harris explain how to get a handle on the many new One Net features - NSS 3.0, iFolder, new Web services, clustering, expanded printing capabilities, and more - and show you step by step how to set up a high-availability network and keep it running smoothly.
An Optimization-Based Domain Decomposition Method for the Navier--Stokes Equations
Authors: Max D. Gunzburger, Hyesuk Kwon Lee
Venue: SIAM Journal on Numerical Analysis (2000)

An optimization-based, nonoverlapping domain decomposition method for the solution of the Navier--Stokes equations is presented. The crux of the method is a constrained minimization problem for which the objective functional measures the jump in the dependent variables across the common boundaries between subdomains; the constraints are the Navier--Stokes equations in the subdomains with suitably chosen boundary conditions along the interfaces. We show that solutions of the minimization problem exist and derive an optimality system from which these solutions may be determined. Finite element approximations of the solutions of the optimality system are examined. The domain decomposition method is also reformulated as a nonlinear least-squares problem and the results of some numerical experiments are given.
The online services bill: theories and evidence of pornographic harm
Authors: Geoffrey A Sandy
Venue: Selected papers from the second Australian Institute conference on Computer ethics (2000)

On the 1 January 2000, the Broadcasting Services Amendment (Online Services) Bill 1999 came into force. It aims to censor online what is currently censored offline. Information Technology Professionals should be concerned about censorship of the internet both in their capacity as a member of the profession and as a citizen. The Bill is mainly aimed at pornographic content, and how a society treats it is a good test of its openness. The paper addresses the primary research question - "Is censorship of internet pornography justified?" Five theories about pornographic harm are distilled from an analysis of a multi-disciplinary literature, including the parliamentary debates on the Bill, and the hearings of the Senate Select Committee on Information Technologies. The research findings on pornographic harm are also summarised. The conclusion of the analysis is that censorship of internet pornography by the Australian Government is not justified on three grounds. First, suppressing speech that is offensive to some members of society, even the majority, is inconsistent with free speech that characterises an open society. Second, the research findings do not support the view that pornography directly causes harm. Third, pornography may confer positive societal benefits for both men and woman.