ppxscal/embedding_network huggingface dataset:
A study on production line automation with LonWorksTM control networks
Authors: N. G. P. C. Mahalik, S. K. Lee
Venue: Computer Standards Interfaces (2002)

Industrial automation systems look forward to implement new generation of control architecture in response to high flexibility and productivity. Control system users are now keen to promote the emergence of digital technology (DT) in place of 4-20-mA analogue systems. The trend is to implement DT-based distributed control systems (DCS) solution. DCS is becoming very popular because of its own advantages over the whole operating system. A case study in the context of realizing production line automation with DT and DCS philosophy has been presented in this paper. Emphasis has been given on the use of "Fieldbus technology: a digital control networking system". In this study, Echelon's Local Operating Network (LON) fieldbus system was used because of availability of a wide range of products. A system was integrated with sensors, microswitches and a drive, while a pick-and-place robotic workstation was selected as the representative target platform.
Internet Bible with Cdrom, 2nd edition
Authors: Brian Underdahl, Keith Underdahl
Venue:  (2000)

:Your one-stop Internet resource  Whether you're an online newbie or a seasoned surfer, this revised and updated guide gives you all the information and advice you need to make the most of the Internet. From cable modems to instant messaging, e-mail to e-commerce, experts Brian and Keith Underdahl show you how to navigate the Internet with confidence, zero in on the best online resources, and even create your own Web site. Inside, you'll find complete coverage of the Internet*Get the lowdown on service providers and high-speed access options*Customize and enhance Web browsers, including the new Opera*Do more with e-mail, from forwarding services to spam filters*Find the Web's best software, audio, chat rooms, and more*Work with Web design software for Windows, Macs, or Linux*Create and host a Web site with all the bells and whistles*Maintain your privacy and security online*Shop, invest, play games, and even hold meetings on the Web40+ Freeware, Shareware, and Demo Programs Dreamweaver  Eudora  Homesite  McAfee Internet Guard Dog  QuickTime  WinZip  and many more Plus a bonus Web Directory with over 800 live links Shareware programs are fully functional, free trial versions of copyrighted programs. If you like particular programs, register with their authors for a nominal fee and receive licenses, enhanced versions, and technical support. Freeware programs are free, copyrighted games, applications, and utilities. You can copy them to as many PCs as you likefreebut they have no technical support. MAC Windows System Requirements: Pentium-class PC running Windows 9x/NT/2000 or PowerPC Macrunning system 7.6.1 or higher; 32MB RAM (recommended); Internet connection
Provisioning on-line games: a traffic analysis of a busy counter-strike server
Authors: Francis Chang, Wu-chang Feng, Wu-chi Feng, Jonathan Walpole
Venue: ACM SIGCOMM Computer Communication Review (2002)

This poster describes the results of a 500 million packet trace of a popular on-line, multiplayer, game server. The results show that the traffic behavior of this heavily loaded game server is highly predictable and can be attributed to the fact that current game designs target the saturation of the narrowest, last-mile link (i.e. 56k modems). Specifically, in order to maximize the interactivity of the game itself and to provide relatively uniform experiences between players playing over different network speeds, on-line games typically fix their usage requirements in such a way as to saturate the network link of their lowest speed players. While the traffic observed is highly predictable, the trace also indicates that these on-line games provide significant challenges to current network infrastructure. As a result of synchronous game logic requiring an extreme amount of interactivity, a close look at the trace reveals the presence of large, highly periodic, bursts of small packets. With such stringent demands on interactivity, routers must be designed with enough capacity to quickly route such bursts without delay. As current routers are designed for bulk data transfers with larger packets, a significant, concentrated deployment of on-line game servers will have the potential for overwhelming current networking equipment.
Bounds for the element distinctness problem on one-tape Turing machines
Authors: Holger Petersen
Venue: Information Processing Letters (2002)

We disprove a conjecture of López-Ortiz by showing that the Element Distinctness Problem for n numbers of size O(logn) can be solved in O(n2(logn)3/2(loglogn)1/2) steps by a nondeterministic one-tape Turing machine. Further we give a simplified algorithm for solving the problem for shorter numbers in time O(n2 log n) on a deterministic one-tape Turing machine and a new proof of the matching lower bound.
Tenchu 2: Birth of the Stealth Assassins Official Strategy Guide
Authors: Tim Bogenn, Douglas Walsh
Venue:  (2000)

:BradyGAMES Tenchu 2 Official Strategy Guide Features: Exclusive maps, along with call-outs, that guide players through every mission. The walkthrough provides step-by-step ninja strategy on how to grapple, disguise, creep, duck, and numerous other moves to prepare players for every adversary. Game secrets, including codes and unlocking secret items, are revealed!
A directionality based location discovery scheme for wireless sensor networks
Authors: Asis Nasipuri, Kai Li
Venue: Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications (2002)

A sensor network is a large ad hoc network of densely distributed sensors that are equipped with low power wireless transceivers. Such networks can be applied for cooperative signal detection, monitoring, and tracking, and are especially useful for applications in remote or hazardous locations. This paper addresses the problem of location discovery at the sensor nodes, which is one of the central design challenges in sensor networks. We present a new method by which a sensor node can determine its location by listening to wireless transmissions from three or more fixed beacon nodes. The proposed method is based on an angle-of-arrival estimation technique that does not increase the complexity or cost of construction of the sensor nodes. We present the performance of the proposed method obtained from computer simulations.
Guide to Microsoft Excel for Scientists and Engineers, 2nd edition
Authors: Bernard V. Liengme
Venue:  (2000)

:This book provides scientists and engineers with an introductory look at the tools available to them in Microsoft Excel. It provides valuable information on the more technical functions of Microsoft Excel in a user friendly style. 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
An iterative initial-points refinement algorithm for categorical data clustering
Authors: Ying Sun, Qiuming Zhu, Zhengxin Chen
Venue: Pattern Recognition Letters (2002)

The original k-means clustering algorithm is designed to work primarily on numeric data sets. This prohibits the algorithm from being directly applied to categorical data clustering in many data mining applications. The k-modes algorithm [Z. Huang, Clustering large data sets with mixed numeric and categorical value, in: Proceedings of the First Pacific Asia Knowledge Discovery and Data Mining Conference. World Scientific, Singapore, 1997, pp. 21-34] extended the k-means paradigm to cluster categorical data by using a frequency-based method to update the cluster modes versus the k-means fashion of minimizing a numerically valued cost. However, as is the case with most data clustering algorithms, the algorithm requires a pre-setting or random selection of initial points (modes) of the clusters. The differences on the initial points often lead to considerable distinct cluster results. In this paper we present an experimental study on applying Bradley and Fayyad's iterative initial-point refinement algorithm to the k-modes clustering to improve the accurate and repetitiveness of the clustering results [cf. P. Bradley, U. Fayyad, Refining initial points for k-mean clustering, in: Proceedings of the 15th International Conference on Machine Learning, Morgan Kaufmann, Los Altos, CA, 1998]. Experiments show that the k-modes clustering algorithm using refined initial points leads to higher precision results much more reliably than the random selection method without refinement, thus making the refinement process applicable to many data mining applications with categorical data.
The Computer and the Brain, 2nd edition
Authors: John Von Neumann
Venue:  (2000)

:This book, composed of material prepared for the Silliman Lectures by john von Neumann before his death, represents the views of one of the greatest mathematicians of the twentieth century on the analogies between computing machines adn the living human brain. He concludes that the brain operates in part digitally, in part analogically, but uses a peculiar statistical language unlike that employed in the operation of man-made computers. At the time of his death in February 1957, Dr. von Neumann, renowned for his theory of games and his work at the Electronic Computer Project at the Institute for Advanced Study, was serving as a member of the Atomic Energy Commission. A year earlier, he had written: "I still cherish the hope that I will be able to deliver hte Silliman Lectures as planned." These plans were never brought to fruition, however, and the manuscript for this book constitutes the last writing to come from him.
Selected papers from the Pan-Sydney workshop on Visualisation - Volume 2
Authors: Peter Eades, John Weckert
Venue: ACM International Conference Proceeding Series; Vol. 9 (2000)

The Pan-Sydney Workshop on Visual Information Processing was held at the University of Sydney on December 1, 2000. This was the sixth such workshop. As with the previous workshops, the aim was to communicate recent research in key technological areas related to the large-scale use of information in a visual form.Sixteen papers and a large number of posters were presented. A program committee of international standing strictly refereed all contributions. Eight papers and seventeen poster summaries were selected for publication in these proceedings.The papers cover a wide variety of topics within the general theme, from feature extraction to video manipulation, to navigation of large-scale visualizations, to graphical definitions of knowledge spaces.Participants mainly came from Universities and research institutions in Sydney, but included researchers from as far a field as Singapore.
TCP westwood: end-to-end congestion control for wired/wireless networks
Authors: Claudio Casetti, Mario Gerla, Saverio Mascolo, M. Y. Sanadidi, Ren Wang
Venue: Wireless Networks (2002)

TCP Westwood (TCPW) is a sender-side modification of the TCP congestion window algorithm that improves upon the performance of TCP Reno in wired as well as wireless networks. The improvement is most significant in wireless networks with lossy links. In fact, TCPW performance is not very sensitive to random errors, while TCP Reno is equally sensitive to random loss and congestion loss and cannot discriminate between them. Hence, the tendency of TCP Reno to overreact to errors. An important distinguishing feature of TCP Westwood with respect to previous wireless TCP "extensions" is that it does not require inspection and/or interception of TCP packets at intermediate (proxy) nodes. Rather, TCPW fully complies with the end-to-end TCP design principle. The key innovative idea is to continuously measure at the TCP sender side the bandwidth used by the connection via monitoring the rate of returning ACKs. The estimate is then used to compute congestion window and slow start threshold after a congestion episode, that is, after three duplicate acknowledgments or after a timeout. The rationale of this strategy is simple: in contrast with TCP Reno which "blindly" halves the congestion window after three duplicate ACKs, TCP Westwood attempts to select a slow start threshold and a congestion window which are consistent with the effective bandwidth used at the time congestion is experienced. We call this mechanism faster recovery. The proposed mechanism is particularly effective over wireless links where sporadic losses due to radio channel problems are often misinterpreted as a symptom of congestion by current TCP schemes and thus lead to an unnecessary window reduction. Experimental studies reveal improvements in throughput performance, as well as in fairness. In addition, friendliness with TCP Reno was observed in a set of experiments showing that TCP Reno connections are not starved by TCPW connections. Most importantly, TCPW is extremely effective in mixed wired and wireless networks where throughput improvements of up to 550% are observed. Finally, TCPW performs almost as well as localized link layer approaches such as the popular Snoop scheme, without incurring the overhead of a specialized link layer protocol.
Convergence of the Optimal Feedback Policies in a Numerical Method for a Class of Deterministic Optimal Control Problems
Authors: Paul Dupuis, Adam Szpiro
Venue: SIAM Journal on Control and Optimization (2001)

We consider a Markov chain based numerical approximation method for a class of deterministic nonlinear optimal control problems. It is known that methods of this type yield convergent approximations to the value function on the entire domain. These results do not easily extend to the optimal control, which need not be uniquely defined on the entire domain. There are, however, regions of strong regularity on which the optimal control is well defined and smooth. Typically, the union of these regions is open and dense in the domain. Using probabilistic methods, we prove that, on the regions of strong regularity, the Markov chain method yields a convergent sequence of approximations to the optimal feedback control. The result is illustrated with several examples.
An adaptive load balancing scheme for web servers
Authors: James Aweya, Michel Ouellette, Delfin Y. Montuno, Bernard Doray, Kent Felske
Venue: International Journal of Network Management (2002)

This paper describes an overload control scheme for web servers which integrates admission control and load balancing. The admission control mechanism adaptively determines the client request acceptance rate to meet the web servers' performance requirements while the load balancing or client request distribution mechanism determines the fraction of requests to be assigned to each web server. The scheme requires no prior knowledge of the relative speeds of the web servers, nor the work required to process each incoming request.
Real Basic: The Definitive Guide, 1st edition
Authors: Matt Neuburg
Venue:  (1999)

:REALbasic is a very inexpensive program that allows users to design full-fledged applications. Simply put, it is like having Visual Basic on the Mac. It is an application for writing applications that are astonishingly small and fast. REALbasic uses a simple interface and an object- and event-oriented language; this makes development, maintenance, and alteration of projects very easy. There is no other program like this for the Mac. If you want to write a Mac application, you have little choice of application frameworks, and REALbasic is the only one with visual design, object orientation, and an easy language. With the Macintosh's popularity on the rise and REALbasic, which presently only runs on Mac, with plans to make Windows applications, the interested audience is wider than the platform implies. Presently there are no ordered instructional books for REALbasic. REALbasic: The Definitive Guide gives people the information they can't get from the documentation alone and provides new users with the details they need to grasp the program's essential concepts. This book takes the reader from zero knowledge of programming to the ability to program every aspect of REALbasic. The book is divided into three main sections. Divided into three main sections, REALbasic: The Definitive Guide covers: Fundamentals: provides a detailed and comprehensive summary of the language that does more than list the details -- it quickly shows you how to think about programming and accomplish your goals in less time User Interface: goes on to cover the creation of a complete application with details of the rich classes and pre-defined tools that make life so much easier for the REALbasic programmer. Reaching Out: rounds out the book with comprehensive coverage of Internet communications, databases, multimedia, game programming and more! This book covers REALbasic 1 and REALbasic 2. Version 2 adds an internal database, an interface to SQL servers, and the ability to compile for Windows and Java. REALbasic: The Definitive Guide is poised to become an essential reference for the expanding legion of developers who are are discovering the power and flexibility of this program.
Microsoft VBA Professional Projects
Authors: Taruna Goel, Rachna Chaudhary
Venue:  (2002)

:Incorporating four hands-on projects, Microsoft VBA Professional Projects is your key to unlocking the power of Visual Basic for Applications. Each project focuses on a specific concept and is based on a real-world situation. You will be able to use the skills that you develop throughout the book to modify the projects as needed to fit your professional needs.
Understanding and Using Microsoft Visual Basic Version 4.0
Authors: Jonathan C. Barron
Venue:  (1997)

:This user-friendly text provides a complete reference to Microsoftr Visual Basic Version 4 in an accessible fashion. The text teaches specific skills required to program in Visual Basic Version 4, presenting concepts and skills through guided activities, exercises, applications, and examples. A complete chapter (Chapter 13) on OLE, a standard set of component interfaces supported at the system level, has been added to this edition.
Enterprise JavaBeans, Second Edition, 2nd edition
Authors: Richard Monson-Haefel
Venue:  (2000)

:Enterprise JavaBeans, Second Edition, is the definitive guide to EJB 1.1, which incorporates the latest developments in EJB technology. Enterprise JavaBeans allows you to build complex, mission-critical systems using snap-together software components that model business objects and processes. EJB greatly simplifies the process of development by taking care of issues like object persistence, security, and transaction management." "EJB 1.1 delivers on a promise that was astonishing a few years ago: not only can Enterprise JavaBeans run without modification on any operating system, they could run without modification within any EJB 1.1 enterprise server. EJB 1.0 was a "down payment" that showed portability was possible; EJB 1.1 goes much further in making server-side components more powerful, portable, and easy to deploy." "This book teaches you how to develop Enterprise JavaBeans to model your business and how to use those beans in clients.
Elements of Web Design, 2nd edition
Authors: Darcy DiNucci, Maria Giudice, Lynne Stiles
Venue:  (2000)

:Elements of Web Design, 2nd Edition is written for people who know design but just don't know the Web. It describes how your skills can be applied to the exciting world of Web design and introduces the terms, tricks, and technologies you'll need to know to get started. When you're done, you'll have a grasp of every element of Web design, from assembling your team through planning your pages and publishing your site online.
Making the Invisible Visible: How Companies Win with the Right Information, People, and It
Authors: David A. Marchand, William Kettinger, John D. Rollins
Venue:  (2001)

:This book presents a new way of seeing the business value of information, people, and IT as well as a way of measuring and managing these capabilities in order to improve business performance. Packed with real-world examples, the book presents the best and worst practices companies have implemented to address these issues. Case studies from more than thirty international companies are strategically used throughout the book, including Banco Bilbao Vizcayo, Philips Business Electronics, Dell Europe, Ernst Young, General Electric, IKEA, Ritz Carlton Hotels, and Wal Mart. This fascinating guide offers a diagnostic tool that senior managers can use to evaluate the three information capabilities of their company. Plus, the book provides hands-on management prescriptions on how to improve a companys information capabilitiesand how to use these capabilities in achieving business strategies and in the implementating change. Donald Marchand (Lausanne, Switzerland) is a management specialist at the International Institute of Management Development (IMD).
Classification of Homomorphisms to Oriented Cycles and of k-Partite Satisfiability
Authors: Tomás Feder
Venue: SIAM Journal on Discrete Mathematics (2001)

We show that, for every choice of an oriented cycle H, the problem of whether an input digraph G has a homomorphism to H is either polynomially solvable or NP-complete. Along the way, we obtain simpler proofs for two known polynomial cases, namely, oriented paths and unbalanced oriented cycles, and exhibit two new simple polynomial cases of balanced oriented cycles. The more difficult cases of the classification are handled by means of a new problem, the bipartite boolean satisfiability problem. In general, the k-partite boolean satisfiability problems are shown to be either polynomially solvable or NP-complete, thus generalizing Schaefer's classification of boolean satisfiability problems.
More Excel 5 for Windows for Dummies, 1st edition
Authors: Greg Harvey, Christopher
Venue:  (1994)

:Thousands of people like you have discovered how to use the world's most popular spreadsheet program with Excel 5 For Windows For Dummies. Now, with MORE Excel 5 For Windows For Dummies, you can build on your spreadsheet proficiency thanks to author Greg Harvey's expert tips on Excel add-ins, macros, scenarios, templates, workbook organization, outlining, charts, error checking, and other topics. You'll also find productivity-enhancing techniques and advice on one of the Excel program's most important features: integrating spreadsheet data and information contained in documents produced by word processing, database, and other applications.
An ELLAM Scheme for Multidimensional Advection-Reaction Equations and Its Optimal-Order Error Estimate
Authors: Hong Wang, Xiquan Shi, Richard E. Ewing
Venue: SIAM Journal on Numerical Analysis (2000)

We present an Eulerian--Lagrangian localized adjoint method (ELLAM) scheme for initial-boundary value problems for advection-reaction partial differential equations in multiple space dimensions. The derived numerical scheme is not subject to the Courant--Friedrichs--Lewy condition and generates accurate numerical solutions even if large time steps are used. Moreover, the scheme naturally incorporates boundary conditions into its formulation without any artificial outflow boundary conditions needed, and it conserves mass. An optimal-order error estimate is proved for the scheme. Numerical experiments are performed to verify the theoretical estimate.