ppxscal/embedding_network huggingface dataset:
A data-integrated nurse activity simulation model
Authors: Durai Sundaramoorthi, Victoria C. P. Chen, Seoung B. Kim, Jay M. Rosenberger, Deborah F. Buckley-Behan
Venue: Proceedings of the 38th conference on Winter simulation (2006)

This research develops a data-integrated approach for constructing simulation models based on a real data set provided by Baylor Regional Medical Center (Baylor) in Grapevine, Texas. Tree-based models and kernel density estimation were utilized to extract important knowledge from the data for the simulation. Classification and Regression Tree model, a data mining tool for prediction and classification, was used to develop two tree structures: (a) a regression tree, from which the amount of time a nurse spends in a location is predicted based on factors, such as the primary diagnosis of a patient and the type of nurse; and (b) a classification tree, from which transition probabilities for nurse movements are determined. Kernel density estimation is used to estimate the continuous distribution for the amount of time a nurse spends in a location. Merits of using our approach for Baylor's nurse activity simulation are discussed.
Difference detection in LC-MS data for protein biomarker discovery
Authors: Jennifer Listgarten, Radford M. Neal, Sam T. Roweis, Peter Wong, Andrew Emili
Venue: Bioinformatics (2007)

Motivation: There is a pressing need for improved proteomic screening methods allowing for earlier diagnosis of disease, systematic monitoring of physiological responses and the uncovering of fundamental mechanisms of drug action. The combined platform of LC-MS (Liquid-Chromatography-Mass-Spectrometry) has shown promise in moving toward a solution in these areas. In this paper we present atechnique for discovering differences in protein signal between two classes of samples of LC-MS serum proteomic data without use of tandem mass spectrometry, gels or labeling. This method works on data from a lower-precision MS instrument, the type routinely used by and available to the community at large today. We test our technique on a controlled (spike-in) but realistic (serum biomarker discovery) experiment which is therefore verifiable. We also develop a new method for helping to assess the difficulty of a given spike-in problem. Lastly, we show that the problem of class prediction, sometimes mistaken as a solution to biomarker discovery, is actually a much simpler problem. Results: Using precision--recall curves with experimentally extracted ground truth, we show that (1) our technique has good performance using seven replicates from each class, (2) performance degrades with decreasing number of replicates, (3) the signal that we are teasing out is not trivially available (i.e. the differences are not so large that the task is easy). Lastly, we easily obtain perfect classification results for data in which the problem of extracting differences does not produce absolutely perfect results. This emphasizes the different nature of the two problems and also their relative difficulties. Availability: Our data are publicly available as a benchmark for further studies of this nature at http://www.cs.toronto.edu/~jenn/LCMS Supplementary Information: http://www.cs.toronto.edu/~jennl/LCMS Contact: jenn@cs.toronto.edu
Cyberethics bibliography 2005
Authors: Herman T. Tavani
Venue: ACM SIGCAS Computers and Society (2005)

Included in the 2005 cyberethics bibliography update is an annotated list of more than fifty recent books; each has a publisher's date of 2002 or later. This list expands upon the books identified and annotated in cyberethics bibliography included in the June 2003 issue of ACM Computers and Society Magazine. For information about selected books published between 1998 and 2002, see the June 1999, June 2000, June 2001, and June 2002 issues of Computers and Society; and for a comprehensive list of books and articles published before 1997, see my Computing, Ethics, and Social Responsibility: A Bibliography (available at http://cyberethics.cbi.msstate.edu/biblio).
SWORD: scalable and flexible workload generator for distributed data processing systems
Authors: Kay S. Anderson, Joseph P. Bigus, Eric Bouillet, Parijat Dube, Nagui Halim, Zhen Liu, Dimitrios Pendarakis
Venue: Proceedings of the 38th conference on Winter simulation (2006)

Workload generation is commonly employed for performance characterization, testing and benchmarking of computer systems and networks. Workload generation typically aims at simulating or emulating traffic generated by different types of applications, protocols and activities, such as web browsing, email, chat, as well as stream multimedia traffic. We present a Scalable WORkloaD generator (SWORD) that we have developed for the testing and benchmarking of high-volume data processing systems. The tool is not only scalable but is also flexible and extensible allowing the generation of workload of a variety of types of applications and of contents.
The "BEST" algorithm for solving stochastic mixed integer programs
Authors: Susan M. Sanchez, R. Kevin Wood
Venue: Proceedings of the 38th conference on Winter simulation (2006)

We present a new algorithm for solving two-stage stochastic mixed-integer programs (SMIPs) having discrete first-stage variables, and continuous or discrete second-stage variables. For a minimizing SMIP, the BEST algorithm (1) computes an upper Bound on the optimal objective value (typically a probabilistic bound), and identifies a deterministic lower-bounding function, (2) uses the bounds to Enumerate a set of first-stage solutions that contains an optimal solution with pre-specified confidence, (3) for each first-stage solution, Simulates second-stage operations by repeatedly sampling random parameters and solving the resulting model instances, and (4) applies statistical Tests (e.g., "screening procedures") to the simulated outcomes to identify a near-optimal first-stage solution with pre-specified confidence. We demonstrate the algorithm's performance on a stochastic facility-location problem.
CNET Do-It-Yourself Home Networking Projects, 1 edition
Authors: Dave Prochnow
Venue:  (2007)

Set up a high-speed home networkNetwork the computers and peripheral devices in your home or small office with the fun and practical projects packed inside this hands-on guide. Produced in conjunction with CNET.com, the place you go for the latest in tech and consumer electronics, this book shows you how to create a wired or wireless network so you can share files, printers, and other resources. You'll also learn to set up a server and secure and expand your network. Inside, you'll find 24 self-contained projects, step-by-step instructions, a list of tools needed at the beginning of each project, and hundreds of clear photos and screenshots. CNET Do-It-Yourself Home Networking Projects takes you from beginning through advanced tasks with ease! Control other PCs remotelyShare network storage without a serverSet up a webcam serverEnable and share a cellular data connectionWatch live TV from anywhere via a Sling Media bridge Integrate IM and VoIP applications into your networkRun your own PC weather stationConnect TiVo to your home network Table of contentsForewordAcknowledgmentsIntroductionPart I: EasyProject 1. Basic DSL Broadband ConnectionProject 2. Go WirelessProject 3. File SharingProject 4. Printer SharingProject 5. Shared Network Storage Without the ServerProject 6. Webcam ServerProject 7. Cellular Internet Connection to the RescueProject 8. TiVo at HomeProject 9. Sling Media BridgePart II: AdvancedProject 10. Sharing Your Basic DSL Broadband ConnectionProject 11. Configuring Firewall Protection for Your NetworkProject 12. Home Network WorkgroupProject 13. Creating Computer User AccountsProject 14. Control other PCs RemotelyProject 15. Stream Your Own ContentProject 16. Supreme Cellular Data Connection SharingProject 17. PC Weather StationProject 18. SlingLink TURBOProject 19. Firewall Configuration for IM and Voice over IPPart III: ChallengingProject 20. Bridging a Gap, WirelesslyProject 21. Expanding Beyond the BridgeProject 22. Create a ServerProject 23. Dealing with Dynamic IP AddressesProject 24. Access TiVo Files AnywhereIndex 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
Access 2003 for Starters: Exactly What You Need to Get Started (Missing Manual)
Authors: Kate J. Chase, Scott Palmer
Venue:  (2005)

Maybe you got Access as part of Microsoft Office and wonder what it can do for you and your household; maybe you're a small business manager and don't have a techie on staff to train the office in Microsoft Access. Regardless, you want to quickly get your feet wet--but not get in over your head--and Access 2003 for Starters: The Missing Manual is the book to make it happen. Far more than a skimpy introduction but much less daunting than a weighty tech book, Access 2003 for Starters: The Missing Manual demystifies databases and explains how to design and create them with ease. It delivers everything you need--and nothing you don't--to use Access right away. It's your expert guide to the Access features that are most vital and most useful, and it's your trusted advisor on the more in-depth features that are best saved for developers and programmers.Access is sophisticated and powerful enough for professional developers but easy and practical enough for everyday users like you. This Missing Manual explains all the major features of Access 2003, including designing and creating databases, organizing and filtering information, and generating effective forms and reports.Bestselling authors, database designers, and programmers Scott Palmer, Ph.D., and Kate Chase are your guides for putting the world's most popular desktop data management program to work. Their clear explanations, step-by-step instructions, plenty of illustrations, and timesaving advice help you get up to speed quickly and painlessly.Whether you're just starting out or you know you've been avoiding aspects of the program and missing out on much of what it can do, this friendly, witty book will gently immerse you in Microsoft Access. Keep it handy, as you'll undoubtedly refer to it again and again.
Permutation polytopes and indecomposable elements in permutation groups
Authors: Robert M. Guralnick, David Perkinson
Venue: Journal of Combinatorial Theory Series A (2006)

Each group G of n × n permutation matrices has a corresponding permutation polytope, P(G) := conv(G) ⊂ Rn × n. We relate the structure of P(G) to the transitivity of G. In particular, we show that if G has t nontrivial orbits, then min{2t, ⌊n/2⌋} is a sharp upper bound on the diameter of the graph of P(G). We also show that P(G) achieves its maximal dimension of (n - 1)2 precisely when G is 2-transitive. We then extend the results of Pak [I. Pak, Four questions on Birkhoff polytope, Ann. Comb. 4 (1) (2000) 83-90] on mixing times for a random walk on P(G). Our work depends on a new result for permutation groups involving writing permutations as products of indecomposable permutations.
FILTRANE, a Fortran 95 filter-trust-region package for solving nonlinear least-squares and nonlinear feasibility problems
Authors: Nicholas I. M. Gould, Philippe L. Toint
Venue: ACM Transactions on Mathematical Software (TOMS) (2007)

FILTRANE, a new Fortran 95 package for finding vectors satisfying general sets of nonlinear equations and/or inequalities, is presented. Several algorithmic variants are discussed and extensively compared on a set of CUTEr test problems, indicating that the default variant is both reliable and efficient. This discussion provides a first experimental study of the parameters inherent in filter algorithms.
Special Edition Using Microsoft Windows XP Professional (3rd Edition) (Special Edition Using)
Authors: Robert Cowart, Brian Knittel
Venue:  (2004)

This updated edition covers all of the updates to Windows XP since it was released, including Service Packs 1 and 2, and Reloaded. From-the-trenches advice on upgrading to Windows XP Pro - including detailed rollout advice for IT managers. Plan and manage deployment of Windows easily and efficiently - whether you're upgrading just a handful of computers, or an entire corporation! Includes hands-on coverage of installing, configuring and surviving on a Windows XP-based network. We not only show you how to set up Windows networking features, we show you how to install and set up basic networking hardware.Sharing files with other platforms, such as Novell Netware, Unix and Linux, Macintosh and other Windows flavors.
A SAT-based procedure for verifying finite state machines in ACL2
Authors: Warren A. Hunt,  Jr., Erik Reeber
Venue: Proceedings of the sixth international workshop on the ACL2 theorem prover and its applications (2006)

We describe a new procedure for verifying ACL2 properties about finite state machines (FSMs) using satisfiability (SAT) solving. We present an algorithm for converting ACL2 conjectures into conjunctive normal form (CNF), which we then output and check with an external satisfiability solver. The procedure is directly available as an ACL2 proof request. When the SAT tool is successful, a theorem is added to the ACL2 system database as a lemma for use in future proof attempts. When the SAT tool is unsuccessful, we use its output to construct a counter-example to the original ACL2 property.
Essential SNMP, Second Edition
Authors: Douglas R. Mauro, Kevin J. Schmidt
Venue:  (2005)

Simple Network Management Protocol (SNMP) provides a "simple" set of operations that allows you to more easily monitor and manage network devices like routers, switches, servers, printers, and more. The information you can monitor with SNMP is wide-ranging--from standard items, like the amount of traffic flowing into an interface, to far more esoteric items, like the air temperature inside a router. In spite of its name, though, SNMP is not especially simple to learn. O'Reilly has answered the call for help with a practical introduction that shows how to install, configure, and manage SNMP. Written for network and system administrators, the book introduces the basics of SNMP and then offers a technical background on how to use it effectively. Essential SNMP explores both commercial and open source packages, and elements like OIDs, MIBs, community strings, and traps are covered in depth. The book contains five new chapters and various updates throughout. Other new topics include:Expanded coverage of SNMPv1, SNMPv2, and SNMPv3Expanded coverage of SNMPcThe concepts behind network management and change managementRRDTool and CricketThe use of scripts for a variety of tasksHow Java can be used to create SNMP applicationsNet-SNMP's Perl moduleThe bulk of the book is devoted to discussing, with real examples, how to use SNMP for system and network administration tasks. Administrators will come away with ideas for writing scripts to help them manage their networks, create managed objects, and extend the operation of SNMP agents.Once demystified, SNMP is much more accessible. If you're looking for a way to more easily manage your network, look no further than Essential SNMP, 2nd Edition.
HyperCard, Flying Solo, Textbook, 1 edition
Venue:  (1995)

Let your students' imaginations soar as they learn to create and manipulate stacks. This program contains everything you need to introduce HyperCard, from "ground zero." 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
Using AI and machine learning to study expressive music performance: project survey and first report
Authors: Gerhard Widmer
Venue: AI Communications (2001)

This article presents a long&dash;term inter&dash;disciplinary research project situated at the intersection of the scientific disciplines of Musicology and Artificial Intelligence. The goal is to develop AI, and in particular machine learning and data mining, methods to study the complex phenomenon of expressive music performance. Formulating formal, quantitative models of expressive performance is one of the big open research problems in contemporary (empirical and cognitive) musicology. Our project develops a new direction in this field: we use inductive learning techniques to discover general and valid expression principles from (large amounts of) real performance data. The project is currently starting its third year and is planned to continue for at least four more years.In the following, we explain the basic notions of expressive music performance, and why this is such a central phenomenon in music. We present the general research framework of the project, and discuss the various challenges and research opportunities that emerge in this framework. We then briefly describe the current state of the project and list the main achievements made so far. In the rest of the paper, we discuss in more detail one particular data mining approach (including a new algorithm for learning characterisation rules) that we have developed recently. Preliminary experimental results demonstrate that this algorithm can discover very general and robust expression principles, some of which actually constitute novel discoveries from a musicological viewpoint.
The Photoshop CS2 Speed Clinic: Automating Photoshop to Get Twice the Work Done in Half the Time
Authors: Matt Kloskowski
Venue:  (2006)

If you're looking for an easy way to work fast in Photoshop CS2, congratulations, you've found it! Matt Kloskowski, Education and Curriculum Developer for the NAPP, shows you how to use the power of automation to instantly save time, money, and frustration. Once you master these powerful tools, you'll wonder how you ever got along without them. ï¾ You'll learn how to: ·ï¾ ï¾ ï¾ Effectively use Adobe Bridge to manage your images ·ï¾ ï¾ ï¾ Add automation using actions ·ï¾ ï¾ ï¾ Create smarter actions ·ï¾ ï¾ ï¾ Use batch processing ·ï¾ ï¾ ï¾ Speed up the Camera Raw workflow ·ï¾ ï¾ ï¾ Customize scripts ·ï¾ ï¾ ï¾ Fine tune filters and preferences ·ï¾ ï¾ ï¾ And much more! This guide is not only packed with info, it will also show you hidden actions and automation gems that are already loaded when you install Photoshop CS2! If you want to increase your speed, and get twice the work done with half the headaches--this is the book for you! ï¾
The development of CASC
Authors: Francis Jeffry Pelletier, Geoff Sutcliffe, Christian Suttner
Venue: AI Communications (2002)

Researchers who make theoretical advances also need some way to demonstrate that an advance really does have general, overall positive consequences for system performance. For this it is necessary to evaluate the system on a set of problems that is sufficiently large and diverse to be somehow representative of the intended application area as a whole. It is only a small step from system evaluation to a communal system competition. The CADE ATP System Competition (CASC) has been run annually since 1996. Any competition is difficult to design and organize in the first instance, and to then run over the years. In order to obtain the full benefits of a competition, a thoroughly organized event, with an unambiguous and motivated design, is necessary. For some issues relevant to the CASC design, inevitable constraints have emerged. For other issues there have been several choices, and decisions have had to be made. This paper describes the evolution of CASC, paying particular attention to its design, design changes, and organization.
PUMPKIN: (another) microprogramming language
Authors: Gregory R. Lloyd
Venue: ACM SIGMICRO Newsletter (1974)

This paper provides a source level description of a compiled microprogramming language for the Microprogrammed Control Unit (MCU) of the Signal Processing Element (AN/UYK-17), currently under development at the Naval Research Laboratory. Its present form is strictly that of a "paper" language; current research at Brown is directed toward the problems encountered in optimizing microcode for this (horizontal) machine. The structure and syntax of PUMPKIN is closely related to that of LSD - a Language for Systems Development which has been implemented at Brown [BE71, BE72, MA74]. The level (power, expressibility, distance from hardware capabilities) of PUMPKIN provides some hope that we may be able to generate usable code for the MCU - no machine independence goals exist for PUMPKIN. Some aspects of the design philosophy behind the language are contained in the paper "Design Considerations for Microprogramming Languages" [LL74], to be published in the 1974 NCC Proceedings.
Abstracts from symposium
Venue: Issue 15 (November 1973) (1973)

Here follows many of the abstracts from the 8th International Mathematical Programming Symposium. Each author was invited to update his abstract following his oral presentation to include the latest ideas. The updated abstracts were used when available, otherwise the original abstracts were used. Where an abstract was modified by the editor, an (M) is included at the end. Where there are multiple authors to a paper, the one giving the paper is underlined and the address refers to that author. 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
Device-independent web browsing based on CC/PP and annotation
Authors: Hwe-Mo Kim, Kyong-Ho Lee
Venue: Interacting with Computers (2006)

This paper presents a transcoding method that dynamically adapts Web pages to various devices. The proposed method is based on a CC/PP profile that is a standard description of a device's context information. For a sophisticated transcoding, we define an annotation schema to describe an annotation that is meta information about original contents. Since a mobile device has a screen of limited size, a Web page might be split into many smaller pages. For an efficient navigation, the proposed method constructs a navigation map that represents the hierarchical relations among the split pages. Experimental results with various Web contents show that the proposed method has performed successfully in terms of users' convenience of navigation and the transcoding quality.
A pattern recognition-based approach for phylogenetic network construction with constrained recombination
Authors: M. A. H. Zahid, Ankush Mittal, R. C. Joshi
Venue: Pattern Recognition (2006)

The tree representation of evolutionary relationship oversimplifies the view of the process of evolution as it cannot take into account the events such as horizontal gene transfer, hybridization, homoplasy and genetic recombination. Several algorithms exist for constructing phylogenetic networks which result from events such as horizontal gene transfer, hybridization and homoplasy. Very little work has been published on the algorithmic detail of phylogenetic networks with constrained recombination. The problem of minimizing the number of recombinations in a phylogenetic network, constructed using binary DNA sequences, is NP-hard. In this paper, we propose a pattern recognition-based O(n^2) time approach for constructing the phylogenetic network, where n is the number of nodes or sequences in the input data. The network is constructed with the restriction that no two cycles in the network share a common node.