ppxscal/embedding_network huggingface dataset:
Systematic evaluation methodology for cell phone user interfaces
Authors: Young Seok Lee, Sang W. Hong, Tonya L. Smith-Jackson, Maury A. Nussbaum, Kei Tomioka
Venue: Interacting with Computers (2006)

As cell phones have expanded their functionality with enhanced mobile technology, use of cell phones has become complex. Although usability of cell phones has been improved by featuring hierarchical menu systems, designing comprehensible navigation in the menu hierarchy is still a major challenge to cell phone user interface (UI) developers as more diverse users are adopting cell phones. To develop an easy-to-use cell phone UI, an effective usability evaluation method (UE) is essential. While various usability evaluation methods (UEM) have been developed, laboratory-based usability testing produces high-quality usability data from actual users. Yet, the effectiveness of such testing can vary dramatically depending on what data is collected and how the data are analyzed. To provide a practical guidance for the effective laboratory testing, we developed a systematic evaluation methodology for cell phone user interfaces (SEM-CPU). SEM-CPU is specifically designed to integrate five empirical methods (scenario-based task performance, questionnaires, post-task interview, user observation, and retrospective think aloud) into a laboratory-based test in order to evaluate cell phone UIs. By following SEM-CPU, usability engineers should be able to (1) conduct laboratory-based testing with multiple empirical methods in an efficient way, (2) collect diverse but useful data to measure necessary usability attributes, (3) identify determinants of usability problems, and (4) integrate all usability data to generate proper solutions for the problems. Detailed descriptions of SEM-CPU are presented along with a case study where SEM-CPU was applied to a comparative cell phone usability test.
Computing Essentials 2008 Introductory Edition, 19 edition
Authors: Timothy J. O'Leary, Linda I. O'Leary
Venue:  (2007)

Computing Essentials 2008 Intro edition is a computing concepts text that focuses on current coverage of a broad range of computing topics, including computer components, applications software, databases, storage devices, etc. This O'Leary concepts text provides a complete learning package focusing on the most important and essential concepts of information technology. Students are given a streamlined, concise, attractive approach to the fundamental issues surrounding the world of computing. Features include strong concept reinforecement, relevant research, new application-based material, easy-to-follow design and student friendly design. This text also correlates with SimNet Online, our online training and assessment program for office 2007 and also computing concepts!. Table of contents Computing Essentials 2008, Introductory Edition Chapter 1 Information Technology, the Internet, and You Chapter 2 The Internet, the Web, and Electronic Commerce Chapter 3 Basic Application Software Chapter 4 Specialized Application Software Chapter 5 System Software Chapter 6 The System Unit Chapter 7 Input and Output Chapter 8 Secondary Storage Chapter 9 Communication and Networks Chapter 10 Privacy and Security Chapter 11 Your Future and Information Technology Appendices The Evolution of the Computer Age The Buyer¿s Guide: How to Buy Your Own Microcomputer System The Upgrade¿s Guide: How to Upgrade Your Microcomputer System
On Scolnik's proposed polynomial-time linear programming algorithm
Authors: David M. Gay
Venue: Issue 16 (April 1974) (1974)

At the Eighth International Symposium on Mathematical Programming (August 1973 at Stanford), Hugo Scolnik suggested a line of reasoning leading to an algorithm which he thought might solve the linear programming problem in polynomial time. The algorithm which Scolnik contemplated would construct an optimal basis one column at a time, in such a way that once a column is selected to be in this basis, it need never be thrown out later; after t basic columns had been selected, the algorithm would first use two rejection criteria (a) and (b) to reduce the number of candidates for the (t+1)st column and would then use a selection criterion (c) to choose one of the remaining candidates.
ACM Special Interest Group on Microprogramming
Authors: Stanley Habib
Venue: ACM SIGMICRO Newsletter (1975)

As the enclosed news release indicates, Data Saab has merged its interest in medium and large computers with UNIVAC in Scandanavia. The new company will market the medium and large scale products of both Data Saab and UNIVAC.
An identity for a general class of approximation operators
Authors: Ulrich Abel
Venue: Journal of Approximation Theory (2006)

We prove an identity for basis functions of a general family of positive linear operators. It covers as special cases the Bernstein, Szász-Mirakjan and Baskakov operators. A corollary of our result can be considered a pointwise orthogonality relation. The Bernstein case is the univariate case of a remarkable identity which recently was presented by Jetter and Stöckler. As an application we give a representation of a restricted dual basis and define a class of quasi-interpolants.
Gestalt-based feature similarity measure in trademark database
Authors: Hui Jiang, Chong-Wah Ngo, Hung-Khoon Tan
Venue: Pattern Recognition (2006)

Motivated by the studies in Gestalt principle, this paper describes a novel approach on the adaptive selection of visual features for trademark retrieval. We consider five kinds of visual saliencies: symmetry, continuity, proximity, parallelism and closure property. The first saliency is based on Zernike moments, while the others are modeled by geometric elements extracted illusively as a whole from a trademark. Given a query trademark, we adaptively determine the features appropriate for retrieval by investigating its visual saliencies. We show that in most cases, either geometric or symmetric features can give us good enough accuracy. To measure the similarity of geometric elements, we propose a maximum weighted bipartite graph (WBG) matching algorithm under transformation sets which is found to be both effective and efficient for retrieval.
Properties and mechanisms of self-organizing MANET and P2P systems
Authors: Bartosz Biskupski, Jim Dowling, Jan Sacha
Venue: ACM Transactions on Autonomous and Adaptive Systems (TAAS) (2007)

Despite the recent appearance of self-organizing distributed systems for Mobile Ad Hoc Networks (MANETs) and Peer-to-Peer (P2P) networks, specific theoretical aspects of both their properties and the mechanisms used to establish those properties have been largely overlooked. This has left many researchers confused as to what constitutes a self-organizing distributed system and without a vocabulary with which to discuss aspects of these systems. This article introduces an agent-based model of self-organizing MANET and P2P systems and shows how it is realised in three existing network systems. The model is based on concepts such as partial views, evaluation functions, system utility, feedback and decay. We review the three network systems, AntHocNet, SAMPLE, and Freenet, and show how they can achieve high scalability, robustness and adaptability to unpredictable changes in their environment, by using self-organizing mechanisms similar to those found in nature. They are designed to improve their operation in a dynamic, heterogeneous environment, enabling them to often demonstrate superior performance to state of the art distributed systems. This article is also addressed at researchers interested in gaining a general understanding of different mechanisms and properties of self-organization in distributed systems.
Detection of a polymorphic Mesoamerican symbol using a rule-based approach
Authors: Yann Frauel, Octavio Quesada, Ernesto Bribiesca
Venue: Pattern Recognition (2006)

This paper describes a technique to recognize a Mesoamerican symbol whose shape is extremely variable. We extract symbols from a drawing and we encode them as discrete curves. We perform the recognition using a set of rules that define the correct symbol. One of the rules is the presence of a single symmetry axis. We describe a comparison metric between curves in order to search for symmetries. The other rules used for the recognition concern the morphology of the symbol. The proposed technique proves to be fast and efficient. We present recognition results obtained on various pre-hispanic images. The rule-based approach proposed and implemented here, appears suitable to detect polymorphic signs, a common feature of Mesoamerican symbols. To the best of our knowledge, this is the first study of pattern recognition into the field of Mesoamerican iconography.
PowerPoint 2007: The Missing Manual
Authors: E. A. Vander Veer
Venue:  (2006)

Like every other application in Microsoft Office suite, PowerPoint is loaded with features. So many, in fact, that even veterans don't know where to find them all. Microsoft solved this problem in PowerPoint 2007 by redesigning the user interface with a tabbed toolbar that makes features easy to locate and use. PowerPoint 2007 also boasts improved graphics, additional templates, the ability to save custom layouts, and improved collaboration through SharePoint. One thing Microsoft hasn't improved is its poor documentation. To learn the ins and outs of all the features in PowerPoint 2007, Microsoft merely offers online help. If you're familiar with previous versions of the program, you may be lost the first time you fire up the new PowerPoint; or you would be if it weren't for PowerPoint 2007: The Missing Manual. This new book, written specifically for this version of the software, not only offers the basics of how to create, save, set up, run, and print a basic bullets-and-background slideshow, but takes you into the world of multimedia, animation, and interactivity. You'll learn how to add pictures, sound, video, animated effects, and controls (buttons and links) to their slides, along with ways to pull text, spreadsheets, and animations created in other programs. You can also create your own reusable design templates and learn to automate repetitive tasks with macros. Learn how to take advantage of advanced functions (such as adding custom background images) that existed in previous PowerPoint versions, but were so cleverly hidden that few people ever found them.
Firefox Hacks: Tips & Tools for Next-Generation Web Browsing (Hacks)
Authors: Nigel McFarlane
Venue:  (2005)

Firefox Hacks is ideal for power users who want to maximize the effectiveness of Firefox, the next-generation web browser that is quickly gaining in popularity. This highly-focused book offers all the valuable tips and tools you need to enjoy a superior and safer browsing experience. Learn how to customize its deployment, appearance, features, and functionality.
Pattern recognition methods for advanced stochastic protein sequence analysis using HMMs
Authors: Thomas Plötz, Gernot A. Fink
Venue: Pattern Recognition (2006)

Currently, Profile Hidden Markov Models (Profile HMMs) are the methodology of choice for probabilistic protein family modeling. Unfortunately, despite substantial progress the general problem of remote homology analysis is still far from being solved. In this article we propose new approaches for robust protein family modeling by consequently exploiting general pattern recognition techniques. A new feature based representation of amino acid sequences serves as the basis for semi-continuous protein family HMMs. Due to this paradigm shift in processing biological sequences the complexity of family models can be reduced substantially resulting in less parameters which need to be trained. This is especially favorable when only little training data is available as in most current tasks of molecular biology research. In various experiments we prove the superior performance of advanced stochastic protein family modeling for remote homology analysis which is especially relevant for e.g. drug discovery applications.
The SMART way to migrate replicated stateful services
Authors: Jacob R. Lorch, Atul Adya, William J. Bolosky, Ronnie Chaiken, John R. Douceur, Jon Howell
Venue: ACM SIGOPS Operating Systems Review (2006)

Many stateful services use the replicated state machine approach for high availability. In this approach, a service runs on multiple machines to survive machine failures. This paper describes SMART, a new technique for changing the set of machines where such a service runs, i.e., migrating the service. SMART improves upon existing techniques in three important ways. First, SMART allows migrations that replace non-failed machines. Thus, SMART enables load balancing and lets an automated system replace failed machines. Such autonomic migration is an important step toward full autonomic operation, in which administrators play a minor role and need not be available twenty-four hours a day, seven days a week. Second, SMART can pipeline concurrent requests, a useful performance optimization. Third, prior published migration techniques are described in insufficient detail to admit implementation, whereas our description of SMART is complete. In addition to describing SMART, we also demonstrate its practicality by implementing it, evaluating our implementation's performance, and using it to build a consistent, replicated, migratable file system. Our experiments demonstrate the performance advantage of pipelining concurrent requests, and show that migration has only a minor and temporary effect on performance.
AJAX and Flash Development with OpenLaszlo: A Tutorial
Authors: Chris Coremans
Venue:  (2006)

Introducing developers to OpenLaszlo-a new technology for developing Flash that is based on XML and JavaScript-this guide provides developers with all the information about this free and open-source tool, including how to code within the OpenLaszlo development environment and the OpenLaszlo development suite as it applies to rapid development time. How and why OpenLaszlo is used and supported by industry leaders such as IBM and Yahoo! is also discussed. 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
Automation of investment analysis
Authors: Jerry Felsen
Venue: Issue 53 (August 1975) (1975)

This brief report outlines some recent results of our research program involving applications of cybernetic concepts and artificial intelligence techniques to automation of business problem solving. Specifically, it reports an application of generalized perceptron-type pattern recognition techniques to (at least partial) automation of investment decision making. As man-machine systems, we have implemented investment decision systems programming both, stock market timing and investment selection. They were tested in actual investment analysis, and their performance was then gradually improved with the aid of machine learning algorithms. The experimental results indicate that with such techniques investment performance can be improved.
Microsoft SQL Server 2000 Notification Services (Microsoft Windows Server System)
Authors: Shyam Pather
Venue:  (2004)

Learn SQL Server Notification Services from the topic authority! Shyam Pather is the Development Lead for the SQL Notification Services Team at Microsoft. He has a unique understanding of the SQL-NS product, having been one of its key architects since its inception. Microsoft SQL Server 200 Notification Services will instruct you on how to program SQL Notification Services as a platform for building applications that send notifications on a large scale. It covers the basic problem of notification applications, describes the SQL Notification Services platform and describes how to use it to build rich, scalable notification applications. Topics covered include: Event Collection Chronicles Scheduled Subscriptions Notification Generation Performance Tuning Deployment and Administration TroubleshootingEach concept is taught through working sample code that you can actually run. In addition to illustrating platform features, this book provides design guidelines that help you build the best application possible. 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
Unix for Mac OS X 10.4 Tiger: Visual QuickPro Guide (2nd Edition) (Visual QuickPro Guide)
Authors: Matisse Enzer
Venue:  (2005)

ï¾ As Unix spreads its tentacles across users' desktops, more and more Mac users are starting to pop the hood and learn about the operating system that's at the root of it all. And there's no better way to conquer that fear than by consulting this Visual QuickPro Guide. Matisse Enzer, who wrote the first edition of this book, Unix for Mac OS X: Visual QuickPro Guide has completely updated this guide to reflect all that's new in Tiger's version of Unix. Readers will learn everything they need to know to make sense of the commands and technical jargon surrounding Unix. In the process they'll find out about useful utilities, editing and printing files, security, and more--all through simple, step-by-step instructions that break the learning process into manageable chunks. Throughout, users will find plenty of the tips and visual references that have become the hallmark of Peachpit's popular Visual QuickPro Guides. Unix for Mac OS X 10.4: Visual QuickPro Guide is perfect for any Mac user interested in learning about the Unix operating system. 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
Analysis of route stability under the random direction mobility model
Authors: G. Carofiglio, C. Chiasserini, M. Garetto, E. Leonardi
Venue: ACM SIGMETRICS Performance Evaluation Review (2006)

In this work we study the stability of routing paths in a Mobile Ad-hoc Network (MANET), where links are subject to failure due to nodes' mobility. We focus on the Random Direction mobility model, and consider as metrics of interest the duration and availability of links and paths.
Ferret: a toolkit for content-based similarity search of feature-rich data
Authors: Qin Lv, William Josephson, Zhe Wang, Moses Charikar, Kai Li
Venue: Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006 (2006)

Building content-based search tools for feature-rich data has been a challenging problem because feature-rich data such as audio recordings, digital images, and sensor data are inherently noisy and high dimensional. Comparing noisy data requires comparisons based on similarity instead of exact matches, and thus searching for noisy data requires similarity search instead of exact search.The Ferret toolkit is designed to help system builders quickly construct content-based similarity search systems for feature-rich data types. The key component of the toolkit is a content-based similarity search engine for generic, multi-feature object representations. To solve the similarity search problem in high-dimensional spaces, we have developed approximation methods inspired by recent theoretical results on dimension reduction. The search engine constructs sketches from feature vectors as highly compact data structures for matching, filtering and ranking data objects. The toolkit also includes several other components to help system builders address search system infrastructure issues. We have implemented the toolkit and used it to successfully construct content-based similarity search systems for four data types: audio recordings, digital photos, 3D shape models and genomic microarray data.
Agent-based demand forecast in multi-echelon supply chain
Authors: Wen-Yau Liang, Chun-Che Huang
Venue: Decision Support Systems (2006)

Supply chain management (SCM) is an emerging field that has commanded attention and support from the industrial community. Demand forecast taking inventory into consideration is an important issue in SCM. There are many diverse inventory systems, in theory or practice, which are operated by entities (companies) in a supply chain. In order to increase supply chain effectiveness, minimize total cost, and reduce the bullwhip effect, integration and coordination of these different systems in the supply chain (SC) are required using information technology and effective communication. The paper develops a multi-agent system to simulate a supply chain, where agents operate these entities with different inventory systems. Agents are coordinated to control inventory and minimize the total cost of a SC by sharing information and forecasting knowledge. The demand is forecasted with a genetic algorithm (GA) and the ordering quantity is offered at each echelon incorporating the perspective of "systems thinking". By using this agent-based system, the results show that total cost decreases and the ordering variation curve becomes smooth.
A better N-best list: practical determinization of weighted finite tree automata
Authors: Jonathan May, Kevin Knight
Venue: Proceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics (2006)

Ranked lists of output trees from syntactic statistical NLP applications frequently contain multiple repeated entries. This redundancy leads to misrepresentation of tree weight and reduced information for debugging and tuning purposes. It is chiefly due to nondeterminism in the weighted automata that produce the results. We introduce an algorithm that determinizes such automata while preserving proper weights, returning the sum of the weight of all multiply derived trees. We also demonstrate our algorithm's effectiveness on two large-scale tasks.
Similarity-based analysis for large networks of ultra-low resolution sensors
Authors: Christopher R. Wren, David C. Minnen, Srinivasa G. Rao
Venue: Pattern Recognition (2006)

By analyzing the similarities between bit streams coming from a network of motion detectors, we can recover the network geometry and discover structure in the human behavior being observed. This means that a low-cost network of sensors can provide powerful contextual information to building systems: improving the efficiency of elevators, lighting, heating, and cooling; enhancing safety and security; and opening up new opportunities for human-centered information systems. This paper will show how signal similarity can be used to calibrate a sensor network to accuracies below the resolution of the individual sensors. This is done by analyzing the similarity structures in the unconstrained movement of people in the observed space. We will also present our efficient behavior-learning algorithm that yields 90% correct behavior-detection in data from a sensor network comprised of motion detectors by employing similarity-based clustering to automatically decompose complex activities into detectable sub-classes.
CCNP CIT Exam Cram 2 (642-831)
Authors: Sean Odom
Venue:  (2003)

Your resource to passing the Cisco CCNP CIT Certification Exam!Join the ranks of readers who have trusted Exam Cram 2 to their certification preparation needs! The Cisco CCNP CIT Exam Cram 2 (Exam 642-831) is focused on what you need to know to pass the CCNP CIT exam. The Exam Cram 2 Method of Study provides you with a concise method to learn the exam topics. The book includes tips, exam notes, acronyms and memory joggers in order to help you pass the exam.Included in the CCNP CIT Exam Cram 2 (Exam 642-831): A tear-out "Cram Sheet" for last minute test preparation. Updated for the latest exam objectives to cover exam 642-831. The PrepLogic Practice Tests, test engine to simulate the testing environment and test your knowledge.Trust in the series that has helped many others achieve certification success - Exam Cram 2.