ppxscal/embedding_network huggingface dataset:
Tasks for and tasks in human-computer interaction
Authors: Dan Diaper, Colston Sanger
Venue: Interacting with Computers (2006)

It is argued that the engineering discipline of human-computer interaction (HCI) has developed over the last couple of decades in an ad hoc manner, driven by the need to solve real problems, rather than being informed by high level, general theories of the discipline. A retrospective role for general HCI theories is suggested. A start at such a general theory, which must be simple and able to encompass all the discipline of HCI's activities, is proposed, based on the concept of tasks. Tasks are characterised as the means by which work is performed. A general systems modelling approach is introduced which divides the assumed world it models into work systems and the application domains that are changed by work performance. The role of different work systems, defined by their differing boundaries and goals, to define different subtasks is introduced and illustrated with a number of simple examples.
Evaluating and implementing a collaborative office document system
Authors: Andy Adler, John C. Nash, Sylvie Noël
Venue: Interacting with Computers (2006)

Collaborative work with office suite documents such as word processing, spreadsheet and presentation files usually demands special tools and methods. For this application, we have developed TellTable, a relatively simple web-based framework built largely from available software and infrastructure. TellTable allows the use of existing office-suite software in a collaborative manner that is controlled but is familiar to users of common single user software. From the literature and our research, we identify twelve challenges to collaborative editing software that we use in an evaluation checklist: time and space, awareness, communication, private and shared work spaces, intellectual property, simultaneity and locking, protection, workflow, security, file format, platform independence, and user benefit. We then use this checklist to characterize TellTable in comparison to some other collaborative office tools.
Fundamentals of Network Security, 1 edition
Authors: Eric Maiwald
Venue:  (2003)

This hands-on, project-based approach to the fundamentals of network security concepts and skills helps students understand security best practices, laws, and standards that will enable them to build a complete security program. This book introduces a strong foundation that includes security policy, planning, and development of good processes. A step-by-step design teaches students security implementation using recent advances in security tools, such as firewalls, VPN's, encryption, techniques, and intrusion detection devises. Platform-specific defenses are revealed for the desktop, Windows networks, UNIX, Internet, and wireless systems. Laws and government regulation are also covered, including the Patriot Act, homeland security initiatives, and special information on relevant state laws. Table of contents PART I: Information Security Basics 1: What Is Information Security? 2: Types of Attacks 3: Hacker Techniques 4: Information Security Services PART II: Groundwork 5: Legal Issues in Information Security 6: Policy 7: Managing Risk 8: Information Security Process 9: Information Security Best Practices PART III: Security Technologies 10: Firewalls 11: Virtual Private Networks 12: Encryption 13: Intrusion Detection PART IV: Practical Applications and Platform-Specific Implementations 14: Desktop Protection 15: Unix Security Issues 16: Windows NT Security Issues 17: Windows 2000/ Windows 2003 Server Security Issues 18: Internet Architecture 19: E-Commerce Security Needs 20: Wireless Security 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
RFID Implementation, 1 edition
Authors: Dennis Brown
Venue:  (2006)

Complete coverage of this widespread technology This is the only book available to offer in-depth, practical details for implementing an RFID project from start to finish. From Wal-Mart and beyond, RFID (Radio Frequency Identification) is in use everywhere--enabling superior supply-chain management by tracking inventory via microchip-tagged products. RFID Implementation delivers step-by-step instructions for initiating, installing, and managing an RFID rollout. Table of contentsPart I: The BasicsChapter 1. RFID Physics, Standards, and RegulationsChapter 2. The EPCglobal NetworkChapter 3. Components of an RFID SystemChapter 4. Bar Codes and RFID TagsPart II: ApplicationsChapter 5: RFID ApplicationsChapter 6: RFID at the United States Department of DefenseChapter 7: The Pharmaceutical IndustryChapter 8: RFID in the Supply ChainPart III: Your ProjectChapter 9: Business Justification for RFIDChapter 10: Plan Your ProjectChapter 11: Tag-and-ShipChapter 12: Engineering Tag PerformanceChapter 13: Data Integrity and Data SynchronizationChapter 14: PrivacyPart IV: ReferencesAppendix A: Typical Application ProfilesAppendix B: BibliographyGlossaryIndex 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
Learning Wcf
Authors: Michele LeRoux Bustamante
Venue:  (2007)

This easy-to-use introduction to Microsoft Windows Communication Foundation (WCF) is ideal for developers who want to learn to build services on a company network or as part of an enterprise system. Built into Windows Vista and Longhorn, and available for Windows XP and Windows 2003, WCF provides a platform for service-oriented architecture (SOA) that enables secure and reliable communication among systems within an organization or across the Internet. With WCF, software developers can focus on their business applications and not the plumbing required to connect them. Furthermore, with WCF developers can learn a single programming API to achieve results previously provided by ASMX, Enterprise Services and .NET Remoting. Learning WCF removes the complexity of using this platform by providing detailed answers, explanations and code samples for the most common questions asked by software developers. Windows Communication Foundation (or WCF, formerly code name "Indigo") provides a set of programming APIs that make it easy to build and consume secure, reliable, and transacted services. This platform removes the need for developers to learn different technologies such as ASMX, Enterprise Services and .NET Remoting, to distribute system functionality on a corporate network or over the Internet. The first truly service-oriented platform, WCF provides innovations that decouple service design and development from deployment and distribution - creating a more flexible and agile environment. WCF also encapsulates all of the latest web service standards for addressing, security, reliability and more.
Details of the Nitech HMM-Based Speech Synthesis System for the Blizzard Challenge 2005
Authors: Heiga Zen, Tomoki Toda, Masaru Nakamura, Keiichi Tokuda
Venue: IEICE - Transactions on Information and Systems (2007)

In January 2005, an open evaluation of corpus-based text-to-speech synthesis systems using common speech datasets, named Blizzard Challenge 2005, was conducted. Nitech group participated in this challenge, entering an HMM-based speech synthesis system called Nitech-HTS 2005. This paper describes the technical details, building processes, and performance of our system. We first give an overview of the basic HMM-based speech synthesis system, and then describe new features integrated into Nitech-HTS 2005 such as STRAIGHT-based vocoding, HSMM-based acoustic modeling, and a speech parameter generation algorithm considering GV. Constructed Nitech-HTS 2005 voices can generate speech waveforms at 0.3 ×RT (real-time ratio) on a 1.6 GHz Pentium 4 machine, and footprints of these voices are less than 2 Mbytes. Subjective listening tests showed that the naturalness and intelligibility of the Nitech-HTS 2005 voices were much better than expected.
IBM AIX 5L Reference for HP-UX System Administrators
Authors: Dino Quintero, Harrison Leal, Geoffrey Mattes, Manoj Sooka
Venue:  (2006)

The AIX 5L Differences Guide Version 5.2, SG24-5765-02, and AIX 5L Differences Guide Version 5.3, SG24-7463-00, are excellent references for learning about AIX 5L. No matter what your skill level of UNIX, you will be able to use the AIX 5L Differences Guides as a starting point into many of the newest features of AIX 5L. This IBM Redbook concentrates on providing experienced systems administrators in one flavor of UNIX (either HP-UX or AIX 5L) with a jump start into easy administration of the other. We concentrate on HP-UX 11i Version 1 (also known as HP-UX 11.11) as we had no access to the Integrity platform (Itanium family of processors) to allow any hands-on testing with HP-UX 11i Version 2 (also known as HP-UX 11.23). There are sections of this book that touch on HP-UX 11i Version 2 to explain, where possible, the differences in concepts between Version 11, Version 2, and AIX 5L. Many of the examples given for both HP-UX and AIX 5L concentrate on the actual command line rather than from the available GUIs for the respective operating systems. The command line provides a closer feel for what is actually happening on the machine.
Solaris 9 System Administration Training Guide (Exam CX-310-014 and CX-310-015)
Authors: Bill Calkins
Venue:  (2003)

Author Bill Calkins is the leading voice of this industry, and he's once again delivered the perfect study companion for UNIX system professionals preparing for the Solaris 9 System Administrator exams (310-014 and 310-015). Readers preparing for this exam find our Training Guide series to be the most efficient self-study tool in the market. This book is their one-stop shop because of its teaching methodology, the accompanying PrepLogic testing software, and superior Web site support at www.quepublishing.com/certification. Training Guides are subjected to rigorous technical review by a team of industry experts, and are Cramsession Approved Study Material!The accompanying CD features PrepLogic(R) Practice Tests, Preview Edition. This product includes one complete PrepLogic Practice Test with approximately the same number of questions found on the actual vendor exam. Each question contains full, detailed explanations of the correct and incorrect answers. The engine offers two study modes, Practice Test and Flash Review, full exam customization, and a detailed score report.
Using median sets for inferring phylogenetic trees
Authors: Matthias Bernt, Daniel Merkle, Martin Middendorf
Venue: Bioinformatics (2007)

Motivation: Algorithms for phylogenetic tree reconstruction based on gene order data typically repeatedly solve instances of the reversal median problem (RMP) which is to find for three given gene orders a fourth gene order (called median) with a minimal sum of reversal distances. All existing algorithms of this type consider only one median for each RMP instance even when a large number of medians exist. A careful selection of one of the medians might lead to better phylogenetic trees. Results: We propose a heuristic algorithm amGRP for solving the multiple genome rearrangement problem (MGRP) by repeatedly solving instances of the RMP taking all medians into account. Algorithm amGRP uses a branch-and-bound method that branches over medians from a selected subset of all medians for each RMP instance. Different heuristics for selecting the subsets have been investigated. To show that the medians for RMP vary strongly with respect to different properties that are likely to be relevant for phylogenetic tree reconstruction, the set of all medians has been investigated for artificial datasets and mitochondrial DNA (mtDNA) gene orders. Phylogenetic trees have been computed for a large set of randomly generated gene orders and two sets of mtDNA gene order data for different animal taxa with amGRP and with two standard approaches for solving the MGRP (GRAPPA-DCM and MGR). The results show that amGRP outperforms both other methods with respect to solution quality and computation time on the test data. Availability: The source code of amGRP, additional results and the test instances used in this paper are freely available from the authors. Contact: merkle@informatik.uni-leipzig.de
Search on transportation networks for location-based service
Authors: Jun Feng, Yuelong Zhu, Naoto Mukai, Toyohide Watanabe
Venue: Applied Intelligence (2007)

The issue of how to provide location-based service (LBS) attracted many researchers. In this paper, we focus on a typical situation of LBS which is to provide services for users in cars that move in a road network. To provide such kind of services, an integration method for representing transportation information with a road map is proposed. By using our integration method, since the transportation information of road networks is managed under the spatial index structure created for road networks, spatial queries on them can take advantages of the spatial index structure and achieve an efficient process. Moreover, we discuss path search, region search, nearest neighbor search and continuous nearest neighbor search in this paper, which are based on transportation networks with (or without) considering the static spatial objects outside the transportation networks. Using transportation information and the corresponding real road network, the paper offers evaluations by comparing our representation method and query method with those in related works. The results show a good performance of our methods.
Using boosting to prune bagging ensembles
Authors: Gonzalo Martínez-Muñoz, Alberto Suárez
Venue: Pattern Recognition Letters (2007)

Boosting is used to determine the order in which classifiers are aggregated in a bagging ensemble. Early stopping in the aggregation of the classifiers in the ordered bagging ensemble allows the identification of subensembles that require less memory for storage, classify faster and can improve the generalization accuracy of the original bagging ensemble. In all the classification problems investigated pruned ensembles with 20% of the original classifiers show statistically significant improvements over bagging. In problems where boosting is superior to bagging, these improvements are not sufficient to reach the accuracy of the corresponding boosting ensembles. However, ensemble pruning preserves the performance of bagging in noisy classification tasks, where boosting often has larger generalization errors. Therefore, pruned bagging should generally be preferred to complete bagging and, if no information about the level of noise is available, it is a robust alternative to AdaBoost.
Mathematical programming applications in the analysis of the deployment and utilization of fire-fighting resources
Authors: Peter Kolesar
Venue: Issue 14 (May 1973) (1973)

This paper gives a brief review of some applications of mathematical programming in the analysis of the deployment of fire engines. We discuss a semi-Markov decision process (linear programming) formulation of the problem of deciding how many fire engines to dispatch to a new alarm, a staged integer programming formulation of the problem of relocating fire engines to rebalance city-wide protection when extremely large fires deplete part of the city, and simple non-linear integer programming formulations of strategic resource allocation problems. All analyses have resulted in policy recommendations that have influenced current operations of the New York City Fire Department.
Designer's Guide to Mac OS X Tiger
Authors: Jeff Gamet
Venue:  (2006)

You held off on moving to Mac OS X until your bread-and-butter applications made the jump, and now you're thinking of moving up to Tiger. This book is especially geared toward designers who've become comfortable working under Mac OS X and are ready now to make the Tiger transition. Designer and prepress pro Jeff Gamet focuses on the Mac OS X Tiger features that matter most to illustrators, designers, and other graphic professionals. He explains not only how things work in Mac OS X Tiger, but how Tiger enables users to work efficiently and effectively. In chapters devoted to fonts, printing, PDF, color management, networking, the Mac's built-in design tools, and much more, readers will learn how to: ï¾ * Solve the nitty-gritty issues designers confront daily * Improve production workflow and avoid common problems * Optimize, maintain, and secure your network, whether you work in a complex office environment or a small graphics studio 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
Randomly shifted lattice rules for unbounded integrands
Authors: Frances Y. Kuo, Grzegorz W. Wasilkowski, Benjamin J. Waterhouse
Venue: Journal of Complexity (2006)

We study the problem of multivariate integration over Rd with integrands of the form f(x)ρd(x) where ρd is a probability density function. Practical problems of this form occur commonly in statistics and mathematical finance. The necessary step before applying any quasi-Monte Carlo method is to transform the integral into the unit cube [0,1]d. However, such transformations often result in integrands which are unbounded near the boundary of the cube, and thus most of the existing theory on quasi-Monte Carlo methods cannot be applied. In this paper we assume that f belongs to some weighted tensor product reproducing kernel Hilbert space Hd of functions whose mixed first derivatives, when multiplied by a weight function ψd, are bounded in the L2-norm. We prove that good randomly shifted lattice rules can be constructed component by component to achieve a worst case error of order O(n-1/2), where the implied constant can be independent of d. We experiment with the Asian option problem using the rules constructed in several variants of the new function space. Our results are as good as those obtained in the anchored Sobolev spaces and they are significantly better than those obtained by the Monte Carlo method.
E - a brainiac theorem prover
Authors: Stephan Schulz
Venue: AI Communications (2002)

We describe the superposition-based theorem prover E. E is a sound and complete prover for clausal first order logic with equality. Important properties of the prover include strong redundancy elimination criteria, the DISCOUNT loop proof procedure, a very flexible interface for specifying search control heuristics, and an efficient inference engine. We also discuss strength and weaknesses of the system.
Usability professionals-current practices and future development
Authors: Jan Gulliksen, Inger Boivie, Bengt Göransson
Venue: Interacting with Computers (2006)

The usability concept has now received such a wide recognition in information technology (IT) development that working with usability can be regarded as a profession in its own right. In recent research projects, we have surveyed and studied usability work on an individual level in a number of Swedish development organisations, including success factors and obstacles. What we have seen relates to the individual usability professional and her background and experiences, the organisation in which she operates, the development process, communication and communication means, and finally the attitudes and basic values held by the people involved. In this paper, we compile and reflect on selected findings from different studies on usability work in practical systems development in a number of Swedish organisations. We discuss our findings from a practical point of view and relate them to the research of others within the international HCI community. Finally, we discuss some issues we consider important for the future development of the practice of usability that we believe is of interest to the international community of usability professionals.
Accurate Thickness Measurement of Two Adjacent Sheet Structures in CT Images
Authors: Yuanzhi Cheng, Yoshinobu Sato, Hisashi Tanaka, Takashi Nishii, Nobuhiko Sugano, Hironobu Nakamura, Hideki Yoshikawa, Shuguo Wang, Shinichi Tamura
Venue: IEICE - Transactions on Information and Systems (2007)

Accurate thickness measurement of sheet-like structure such as articular cartilage in CT images is required in clinical diagnosis as well as in fundamental research. Using a conventional measurement method based on the zero-crossing edge detection (zero-crossings method), several studies have already analyzed the accuracy limitation on thickness measurement of the single sheet structure that is not influenced by peripheral structures. However, no studies, as of yet, have assessed measurement accuracy of two adjacent sheet structures such as femoral and acetabular cartilages in the hip joint. In this paper, we present a model of the CT scanning process of two parallel sheet structures separated by a small distance, and use the model to predict the shape of the gray-level profiles along the sheet normal orientation. The difference between the predicted and the actual gray-level profiles observed in the CT data is minimized by refining the model parameters. Both a one-by-one search (exhaustive combination search) technique and a nonlinear optimization technique based on the Levenberg-Marquardt algorithm are used to minimize the difference. Using CT images of phantoms, we present results showing that when applying the one-by-one search method to obtain the initial values of the model parameters, Levenberg-Marquardt method is more accurate than zero-crossings and one-by-one search methods for estimating the thickness of two adjacent sheet structures, as well as the thickness of a single sheet structure.
SOA-standard-conform modeling as a high-level-standard for discrete simulation
Authors: Thomas Wiedemann, Peter Eichhorst
Venue: Proceedings of the 38th conference on Winter simulation (2006)

Simulation models, created with leading simulation tools can not be exchanged between the systems, because there is no universal standard for discrete simulation. This results in very high investments and maintenance costs for simulation studies and some additional problems with flexibility in large simulations. A new approach seems now possible by using Service Oriented Architectures (SOA). The integration of SOA-interfaces in simulation systems connects them to the IT-infrastructure of ERP-systems, business process modeling systems and web-services. This option allows a dual use of the generated models for simulation and real control software. The SOA standards BPMN and BPEL are also capable for simulation modelling and are accepted by all major IT companies. The poster presents examples, how BPMN models can be converted to single simulation programs, which eliminates the critical performance issues of SOA-webservice interfaces. In conclusion, the SOA technology can open a new chapter in discrete simulation modelling.