ppxscal/embedding_network huggingface dataset:
The impact of alternative diagrams on the accuracy of recall: a comparison of star-schema diagrams and entity-relationship diagrams
Authors: Karen Corral, David Schuff, Robert D. St. Louis
Venue: Decision Support Systems (2006)

Data warehouses can be constructed using either a relational or a dimensional model. This research compares the diagrammatic representations of these two models. Semantic network theory suggests that, because of their structure, star-schema diagrams (SSDs) are more understandable than entity-relationship diagrams (ERDs). Through two experiments that test both the accuracy and pattern of users' recall, we find strong evidence that SSDs are easier to understand than ERDs. Our findings imply that the use of the dimensional model should help decision makers query the warehouse directly, thereby reducing costs and the need for intervention and support by IT professionals.
Painless Project Management: A Step-by-Step Guide for Planning, Executing and Managing Projects
Authors: Pamela McGhee, Peter McAliney
Venue:  (2007)

A detailed guide to successful, efficient project management, written by two pros with a combined 55 years "in the trenches!"Project management is a vital and growing component of many organizations and can literally make or break a company. In this step-by-step guide, two project management consultants present a comprehensive guide to effective project management, complete with real stories and case studies from actual project managers. This straightforward guide cuts through the technical jargon to present an easy-to-follow, easy-to-learn approach to executing any project from beginning to end. Project managers, as well as those who want to learn more about project management, will find this guide to be an indispensable resource for all their projects.
Building life-like 'conscious' software agents
Authors: Stan Franklin
Venue: AI Communications (2000)

Here we will briefly describe action selection and language generation mechanisms in two 'life-like' software agents, CMattie and IDA, and discuss issues that bear on the topics of architectures for behavior control, interdependencies between emotions and goal dash;based behaviors, and coordination of scripted and improvised behaviors. These agents are life-like in the sense of interacting with humans via email in natural language. They are 'conscious' only in the sense of implementing a psychological theory of consciousness [3,4]. At this writing we are exploring the transition from scripted language production to more improvised speech generation. We are also investigating deliberative behavior selection mechanisms whereby alternative scenarios are produced and evaluated, and one of them chosen and acted upon. (Supported in part by ONR grant N00014-98-1-0332. This research was done with essential contributions from the Conscious Software Research Group including Art Graesser, Satish Ambati, Ashraf Anwar, Myles Bogner, Arpad Kelemen, Irina Makkaveeva, Lee McCauley, Aregahegn Negatu, Uma Ramamurthy, Zhaohua Zhang)
More remarks on Scolnik's approach to linear programming
Authors: David M. Gay
Venue: Issue 17 (November 1974) (1974)

This report briefly discusses certain points in Hugo Scolnik's letter (Spring 1974) to the SIGMAP membership, then examines whether superfluous constraints are responsible for the difficulties in Scolnik's approach to linear programming, and finally discusses possible starting heuristics, based on Scolnik's approach, for the simplex algorithm.
Modelling and Performability Analysis of Network Memory Servers
Authors: O Gemikonakli, G Mapp, D Thakker, E Ever
Venue: Proceedings of the 39th annual Symposium on Simulation (2006)

This paper presents an analytical method for the performability evaluation of a proposed network memory server attached to a local area network. The proposed server is expected to improve data storage and retrieval. However, the underlying network will receive an increased amount of traffic which may have a significant effect on the network's performance. The proposed analytical model and its solution can be used to evaluate the performance of such a system. Mean queue lengths and the probability that the NMS queue is full are calculated and presented.
Conflating two polygonal lines
Authors: Sukhamay Kundu
Venue: Pattern Recognition (2006)

A basic technique in comparing and detecting changes in geographical spatial data from satellite images consists of identifying linear features or edges in the image and then matching those features. A chain of connected linear features which form a polygonal line is used as the basic unit for matching two images. We develop a distance measure between two polygonal lines and an efficient algorithm for conflating or optimally matching two polygonal lines based on this distance measure. We show that some of the alternative approaches used in the literature, including Hausdorff's distance, fail to satisfy the basic requirements of a distance measure for image conflation.
Approximating the minimum weight weak vertex cover
Authors: Yong Zhang, Qi Ge, Rudolf Fleischer, Tao Jiang, Hong Zhu
Venue: Theoretical Computer Science (2006)

Accurate network flow measurement is important for a variety of network applications, where the "flow" over an edge in the network is intuitively the rate of data traffic. The problem of efficiently monitoring the network flow can be regarded as finding the minimum weight weak vertex cover for a given graph. In this paper, we present a (2 - 2/v(G)-approximation algorithm solving for this problem, which improves previous results, where v(G) is the cyclomatic number of G.
Simulation of biochemical networks using COPASI: a complex pathway simulator
Authors: Sven Sahle, Ralph Gauges, Jürgen Pahle, Natalia Simus, Ursula Kummer, Stefan Hoops, Christine Lee, Mudita Singhal, Liang Xu, Pedro Mendes
Venue: Proceedings of the 38th conference on Winter simulation (2006)

Simulation and modeling is becoming one of the standard approaches to understand complex biochemical processes. Therefore, there is a big need for software tools that allow access to diverse simulation and modeling methods as well as support for the use of these methods. Here, we present a new software tool that is platform independent, user friendly and offers several unique features. In addition, we discuss numerical considerations and support for the switching between simulation methods.
Advantage Series: Microsoft Office Excel 2003, Complete Edition, 1 edition
Authors: Glen Coulthard, Sarah Hutchinson-Clifford
Venue:  (2004)

The Advantage Series presents the Feature-Method-Practice approach to computer software applications to today's technology and business students. This series implements an efficient and effective learning model, which enhances critical thinking skills and provides students and faculty with complete application coverage.Table of contentsMICROSOFT OFFICE EXCEL 2003 CHAPTER 1: CREATING A WORKSHEET CHAPTER 2: MODIFYING A WORKSHEET CHAPTER 3: FORMATTING AND PRINTING CHAPTER 4: ANALYZING YOUR DATA CHAPTER 5: PRESENTING YOUR DATA CHAPTER 6: PERFORMING CALCULATIONS CHAPTER 7: MANAGING WORKSHEETS AND WORKBOOKS CHAPTER 8: MANAGING WORKSHEET LISTS CHAPTER 9: DECISION-MAKING USING EXCEL CHAPTER 10: AUTOMATING AND EXTENDING EXCEL CHAPTER 11: DEVELOPING APPLICATIONS USING EXCEL CHAPTER 12: INTRODUCING VISUAL BASIC FOR APPLICATIONS
Developing Extensions for Macromedia Flash 8
Authors: Barbara Snyder
Venue:  (2005)

Developing Extensions for Macromedia Flash 8describes how to build Flash JavaScript extensions to enhance the developer's experience while working in the Flash authoring environment. This book explains how each type of extension works and describes the JavaScript application programming interface (API) functions that Flash calls to implement the extension. In Developing Extensions for Macromedia Flash 8, learn how to: ·ï¾ ï¾ ï¾ Automate repetitive tasks ·ï¾ ï¾ ï¾ Add custom tools to the Tools panel ·ï¾ ï¾ ï¾ Add Timeline effects ·ï¾ ï¾ ï¾ Add, remove, and modify filters that are applied to objects on the Stage ·ï¾ ï¾ ï¾ Manage Flash project files ·ï¾ ï¾ ï¾ Access, modify, and delete files and folders on the local file system Powerful development and design tools require thorough and authoritative technical advice and documentation. When it comes to Macromedia Flash, no one is more authoritative than Macromedia Development and writing teams. Now their official documentation is available to you in printed book form. As you work, keep this guide by your side for ready access to valuable information on using Flash. We've designed it so that it's easy to annotate as you progress.
Learning Perl, Fourth Edition
Authors: Randal L. Schwartz, Tom Phoenix, Brian D. Foy
Venue:  (2005)

Learning Perl, better known as "the Llama book", starts the programmer on the way to mastery. Written by three prominent members of the Perl community who each have several years of experience teaching Perl around the world, this latest edition has been updated to account for all the recent changes to the language up to Perl 5.8. Perl is the language for people who want to get work done. It started as a tool for UNIX system administrators who needed something powerful for small tasks. Since then, Perl has blossomed into a full-featured programming language used for web programming, database manipulation, XML processing, and system administration--on practically all platforms--while remaining the favorite tool for the small daily tasks it was designed for. You might start using Perl because you need it, but you'll continue to use it because you love it. Informed by their years of success at teaching Perl as consultants, the authors have re-engineered the Llama to better match the pace and scope appropriate for readers getting started with Perl, while retaining the detailed discussion, thorough examples, and eclectic wit for which the Llama is famous. The book includes new exercises and solutions so you can practice what you've learned while it's still fresh in your mind. Here are just some of the topics covered: data structures minimal matching threading data parsing references objects modules package implementation If you ask Perl programmers today what book they relied on most when they were learning Perl, you'll find that an overwhelming majority will point to the Llama. With good reason. Other books may teach you to program in Perl, but this book will turn you into a Perl programmer.
Simulating impact of available-to-promise generation on supply chain performance
Authors: Young M. Lee
Venue: Proceedings of the 38th conference on Winter simulation (2006)

Availability management influences key supply chain performance metrics such as customer service level and inventory. The availability management process involves generating Available-to-Promise (ATP) quantities, scheduling customer orders against the ATP, and fulfilling the orders. ATP generation is a push-side of the availability management process, and it allocates expected availability into ATP quantities based on product types, demand classes, supply classes, and ATP time periods as well as various availability management polices. This paper describes a simulation work done for IBM computer hardware business to evaluate how changes in ATP generation would impact supply chain performance. The simulation work played an important role in making strategic business decisions that impacted customer services and inventory cost.
Citrix® Access Suite Security for IT Administrators, 1 edition
Venue:  (2006)

The only Citrix-authorized guide to securing the number one business access solutionWritten by Citrix engineers, this is the official security reference for Citrix Access Suite--the most complete solution for providing secure access to any business information resource regardless of location or device. Featuring outlines of specific threats and countermeasures, easy-to-follow checklists, and proven techniques, this is the only book to focus solely on securing each of the main components, including Presentation Server, Access Gateway, and Password Manager. Table of contentsChapter 1. IntroductionChapter 2. Secure DeploymentsChapter 3. Administrative Best PracticesChapter 4. Secure GatewayChapter 5. Web InterfaceChapter 6. Password ManagerChapter 7. Presentation ServerChapter 8. Presentation Server ClientChapter 9. License ServerAppendix A. Other Citrix SolutionsAppendix B. ChecklistsAppendix C. Additional ResourcesAppendix D. SSL/TLS Certificate InstallationIndex 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
Computing optimal max-min fair resource allocation for elastic flows
Authors: Dritan Nace, Nhat-Linh Doan, Eric Gourdin, Bernard Liau
Venue: IEEE/ACM Transactions on Networking (TON) (2006)

In this paper, we consider the max-min fair resource allocation problem as applied to elastic flows. We are interested in computing the optimal max-min fair rate allocation. The proposed approach is a linear programming based one and allows the computation of optimal routing paths with regard to max-min fairness, in stable and known traffic conditions. We consider nonbounded access rates, but we show how the proposed approach can handle the case of upper-bounded access rates. A proof of optimality and some computational results are also presented.
Programming in Visual Basic.NET: Update Edition for VB.NET 2003 w/ 5-CD VB.Net 2003 Software set, 5 edition
Authors: Julia Case Bradley, Anita C. Millspaugh
Venue:  (2004)

Table of contents Chapter 1 Introduction to Visual Basic.NET Chapter 2 More Controls Chapter 3 Variables, Constants, and Calculations Chapter 4 Decisions and Conditions Chapter 5 Menus, Sub Procedures, and Sub Functions Chapter 6 OOP:Creating Object-Oriented Programs Chapter 7 Lists, Loops, and Printing Chapter 8 Arrays Chapter 9 Programming With Web Forms Chapter 10 Accessing DataBase Files Chapter 11 Saving Data and Objects in Files Chapter 12 Graphics in Windows and the Web Chapter 13 Advanced Topics in Visual Basic Appendix A Answers to Feedback Questions Appendix B Methods and Functions for Working with Dates, Financial Calculations, Mathematics, and String Operations Appendix C Tips and Shortcuts for Mastering the Environment Appendix D Security Glossary Index
O'Leary Series: Microsoft Excel 2003 Brief with Student Data File CD, 1 edition
Authors: Timothy J. O'Leary, Linda I. O'Leary
Venue:  (2004)

The goal of the O’Leary Series is to give students a basic understanding of computing concepts and to build the skills necessary to ensure that information technology is an advantage in whatever career they choose in life. The O’Leary Microsoft Office 2003 texts are crafted to be the true step-by-step way for students to develop Microsoft Office application skills. The text design emphasizes step-by-step instructions with full screen captures that illustrate the results of each step performed. Each Tutorial (chapter) combines conceptual coverage with detailed software-specific instructions. A running case that is featured in each tutorial highlights the real-world applications of each software program and leads students step-by-step from problem to solution.
30 Reasons Employees Hate Their Managers: What Your People May Be Thinking and What You Can Do About It
Authors: Bruce L. Katcher, Adam Snyder
Venue:  (2007)

They're being treated like children Their contributions aren't respected Their manager doesn't listen to them Senior managers are incompetent They lack the resources and training they need to do their jobs well They get insufficient feedback Their pay isn't fairly linked to job performance They are burdened by heavy workloads or inflexible schedules.Featuring real-life examples, this eye-opening book empowers managers to make their workplaces more productive, congenial, and satisfying for their people and for themselves.
Practical Broadcast Encryption from Graph-Theoretic Techniques and Subset-Incremental-Chain Structure*The preliminary versions were presented at SCIS 2005 [5] and ASIACRYPT 2005 [7].
Authors: Nuttapong Attrapadung, Hideki Imai
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2007)

We present generic frameworks for constructing efficient broadcast encryption schemes in the subset-cover paradigm, introduced by Naor et al., based on various key derivation techniques. Our frameworks characterize any instantiation completely to its underlying graph decompositions, which are purely combinatorial in nature. These abstract away the security of each instantiated scheme to be guaranteed by the generic one of the frameworks; thus, give flexibilities in designing schemes. Behind these, we present new techniques based on (trapdoor) RSA accumulators utilized to obtain practical performances. We then give some efficient instantiations from the frameworks, via a new structure called subset-incremental-chain. Our first construction improves the currently best schemes, including the one proposed by Goodrich et al., without any further assumptions (only pseudo-random generators are used) by some factors. The second instantiation, which is the most efficient, is instantiated based on RSA and directly improves the first scheme. Its ciphertext length is of order O(r), the key size is O(1), and its computational cost is O(n1/klog2n) for any (arbitrary large) constant k; where r and n are the number of revoked users and all users respectively. To the best of our knowledge, this is the first explicit collusion-secure scheme in the literature that achieves both ciphertext size and key size independent of n simultaneously while keeping all other costs efficient, in particular, sub-linear in n. The third scheme improves Gentry and Ramzan's scheme, which itself is more efficient than the above schemes in the aspect of asymptotic computational cost.
A simple and fast multi-class piecewise linear pattern classifier
Authors: Alexander Kostin
Venue: Pattern Recognition (2006)

A simple and fast multi-class piecewise linear classifier is proposed and implemented. For a pair of classes, the piecewise linear boundary is a collection of segments of hyperplanes created as perpendicular bisectors of line segments linking centroids of the classes or parts of classes. For a multi-class problem, a binary partition tree is initially created which represents a hierarchical division of given pattern classes into groups, with each non-leaf node corresponding to some group. After that, a piecewise linear boundary is constructed for each non-leaf node of the partition tree as for a two-class problem. The resulting piecewise linear boundary is a set of boundaries corresponding to all non-leaf nodes of the tree. The basic data structures of algorithms of synthesis of a piecewise linear classifier and classification of unknown patterns are described. The proposed classifier is compared with a number of known pattern classifiers by benchmarking with the use of real-world data sets.
A prototype classification method and its use in a hybrid solution for multiclass pattern recognition
Authors: Chien-Hsing Chou, Chin-Chin Lin, Ying-Ho Liu, Fu Chang
Venue: Pattern Recognition (2006)

In this paper, we propose a prototype classification method that employs a learning process to determine both the number and the location of prototypes. This learning process decides whether to stop adding prototypes according to a certain termination condition, and also adjusts the location of prototypes using either the K-means (KM) or the fuzzy c-means (FCM) clustering algorithms. When the prototype classification method is applied, the support vector machine (SVM) method can be used to post-process the top-rank candidates obtained during the prototype learning or matching process. We apply this hybrid solution to handwriting recognition and address the convergence behavior and runtime consumption of the prototype construction process, and discuss how to combine our prototype classifier with SVM classifiers to form an effective hybrid classifier.
Using an alignment of fragment strings for comparing protein structures
Authors: Iddo Friedberg, Tim Harder, Rachel Kolodny, Einat Sitbon, Zhanwen Li, Adam Godzik
Venue: Bioinformatics (2007)

Motivation: Most methods that are used to compare protein structures use three-dimensional (3D) structural information. At the same time, it has been shown that a 1D string representation of local protein structure retains a degree of structural information. This type of representation can be a powerful tool for protein structure comparison and classification, given the arsenal of sequence comparison tools developed by computational biology. However, in order to do so, there is a need to first understand how much information is contained in various possible 1D representations of protein structure. Results: Here we describe the use of a particular structure fragment library, denoted here as KL-strings, for the 1D representation of protein structure. Using KL-strings, we develop an infrastructure for comparing protein structures with a 1D representation. This study focuses on the added value gained from such a description. We show the new local structure language adds resolution to the traditional three-state (helix, strand and coil) secondary structure description, and provides a high degree of accuracy in recognizing structural similarities when used with a pairwise alignment benchmark. The results of this study have immediate applications towards fast structure recognition, and for fold prediction and classification. Contact: idoerg@burnham.org Supplementary information:http://iddo-friedberg.org/ECCB06-supplement
If P ≠ NP then some strongly noninvertible functions are invertible
Authors: Lane A. Hemaspaandra, Kari Pasanen, Jörg Rothe
Venue: Theoretical Computer Science (2006)

Rabi, Rivest, and Sherman alter the standard notion of noninvertibility to a new notion they call strong noninvertibility, and show--via explicit cryptographic protocols for secret-key agreement (Rabi and Sherman attribute this protocol to Rivest and Sherman) and digital signatures (Rabi and Sherman)--that strongly noninvertible functions are very useful components in protocol design. Their definition of strong noninvertibility has a small twist ("respecting the argument given") that is needed to ensure cryptographic usefulness. In this paper, we show that this small twist has a consequence: unless P = NP, some strongly noninvertible functions are invertible.
An optimized linear skewing interleave scheme for on-chip multi-access memory systems
Authors: Chunyue Liu, Xiaolang Yan, Xing Qin
Venue: Proceedings of the 17th ACM Great Lakes symposium on VLSI (2007)

An optimized linear skewing interleave scheme for on-chip multi-access memory systems is proposed in this paper. The proposed scheme can support simultaneous access of multiple subarray types of data elements in a 2-D data space with modulo addressing. 2pq (pq is the number of data elements in a subarray) memory modules are used without redundancy to save the on-chip memory. It uses linear skewing in the horizontal direction and uses nonlinear skewing in the vertical direction. Fast implementation method for the proposed scheme is also described. Results show that compared to previous linear skewing schemes, the proposed scheme can reduce 13.6%, on average, of the on-chip memory for cases of pq = 4 or 8 and reduce 35.5%, on average, of the external memory bandwidth for benchmark of motion estimation due to modulo addressing.