ppxscal/embedding_network huggingface dataset:
Statistical analysis of TCP's retransmission timeout algorithm
Authors: Liangping Ma, Kenneth E. Barner, Gonzalo R. Arce
Venue: IEEE/ACM Transactions on Networking (TON) (2006)

The retransmission timeout (RTO) algorithm of Transmission Control Protocol (TCP), which sets a dynamic upper bound on the next round-trip time (RTT) based on past RTTs, plays an important role in reliable data transfer and congestion control of the Internet. A rigorous theoretical analysis of the RTO algorithm is important in that it provides insight into the algorithm and prompts optimal design strategies. Nevertheless, such an analysis has not been conducted to date. This paper presents such an analysis from a statistical approach. We construct an auto-regressive (AR) model for the RTT processes based on experimental results that indicate: 1) RTTs along a certain path in the Internet can be modeled by a shifted Gamma distribution and 2) the temporal correlation of RTTs decreases quickly with lag. This model is used to determine the average reaction time and premature timeout probability for the RTO algorithm. We derive a closed-form expression for the first measure and a formula for numerically calculating the second. Both measures are validated through tests on simulated and real RTT data. The theoretical analysis strengthens a number of observations reported in past experiment-oriented studies.
Class-dependent PCA, MDC and LDA: A combined classifier for pattern classification
Authors: Alok Sharma, Kuldip K. Paliwal, Godfrey C. Onwubolu
Venue: Pattern Recognition (2006)

Several pattern classifiers give high classification accuracy but their storage requirements and processing time are severely expensive. On the other hand, some classifiers require very low storage requirement and processing time but their classification accuracy is not satisfactory. In either of the cases the performance of the classifier is poor. In this paper, we have presented a technique based on the combination of minimum distance classifier (MDC), class-dependent principal component analysis (PCA) and linear discriminant analysis (LDA) which gives improved performance as compared with other standard techniques when experimented on several machine learning corpuses.
The design and implementation of VAMPIRE
Authors: Alexandre Riazanov Andrei Voronkov
Venue: AI Communications (2002)

In this article we describe VAMPIRE: a high-performance theorem prover for first-order logic. As our description is mostly targeted to the developers of such systems and specialists in automated reasoning, it focuses on the design of the system and some key implementation features. We also analyze the performance of the prover at CASC-JC.
Improving duplicate elimination in storage systems
Authors: Deepak R. Bobbarjung, Suresh Jagannathan, Cezary Dubnicki
Venue: ACM Transactions on Storage (TOS) (2006)

Minimizing the amount of data that must be stored and managed is a key goal for any storage architecture that purports to be scalable. One way to achieve this goal is to avoid maintaining duplicate copies of the same data. Eliminating redundant data at the source by not writing data which has already been stored not only reduces storage overheads, but can also improve bandwidth utilization. For these reasons, in the face of today's exponentially growing data volumes, redundant data elimination techniques have assumed critical significance in the design of modern storage systems.Intelligent object partitioning techniques identify data that is new when objects are updated, and transfer only these chunks to a storage server. In this article, we propose a new object partitioning technique, called fingerdiff, that improves upon existing schemes in several important respects. Most notably, fingerdiff dynamically chooses a partitioning strategy for a data object based on its similarities with previously stored objects in order to improve storage and bandwidth utilization. We present a detailed evaluation of fingerdiff, and other existing object partitioning schemes, using a set of real-world workloads. We show that for these workloads, the duplicate elimination strategies employed by fingerdiff improve storage utilization on average by 25&percnt;, and bandwidth utilization on average by 40&percnt; over comparable techniques.
Practical Software Estimation: Function Point Methods for Insourced and Outsourced Projects (Infosys Press)
Authors: M. A. Parthasarathy
Venue:  (2007)

"A clearly written book that is a useful primer for a very complicated set of topics."--Capers Jones, Chief Scientist Emeritus, Software Productivity Research LLCPractical Software Estimation brings together today's most valuable tips, techniques, and best practices for accurately estimating software project efforts, costs, and schedules. Written by a leading expert in the field, it addresses the full spectrum of real-world challenges faced by those who must develop reliable estimates.M. A. Parthasarathy draws on the immense experience of Infosys, one of the world's largest and most respected providers of IT-enabled business solutions, to bring you the only book with detailed guidance on estimating insourced and outsourced software projects, as well as projects that blend both approaches. He demonstrates how to successfully utilize Function Point (FP) methods, the industry's leading estimation model. Then, using real case studies, he systematically identifies pitfalls that can lead to inaccurate estimates--and offers proven solutions.Coverage includes How to estimate all types of software projects, including "fresh" development, reengineering, and maintenance How to incorporate the impact of core project elements on estimates: scope, environment, experience, and tools FP analysis from start to finish: data and transaction functions, general system characteristics, and more FP methods for any platform or business function Innovative re-estimation methods to track progress How to quote RFPs and prepare contracts: fixed price, time/material, and project execution lifecycle models Alternatives to FP: Delphi, COCOMO II, and COSMIC-FFP How to choose the right estimation toolsPractical Software Estimation is the definitive reference for anyone who must estimate software projects accurately: project and IT managers, individual developers, system designers, architects, executives, consultants, and outsourcers alike.List of Figures List of Tablesï¾ Foreword Preface AcknowledgmentsChapter 1: Introduction Chapter 2: Role of Estimation in Software Projects Chapter 3: A Study of Function Point Analysis Chapter 4: Data Functions Chapter 5: Transactional Functions Chapter 6: General System Characteristics Chapter 7: Size, Effort, and Scheduling of Projects Chapter 8: Estimation Flavors Chapter 9: A Sense of Where You Are Chapter 10: Tips, Tricks, and Traps Chapter 11: Insourcing versus Outsourcing Chapter 12: Key Factors in Software Contracts Chapter 13: Project Estimation and Costing Chapter 14: Other Estimation Methods Chapter 15: Estimation Tools Chapter 16: Estimation Case Study Appendix A: Reference Tables: Transaction Function Counts Appendix B: Reference Tables: Data Function Points Bibliography Indexï¾
Stationarity of some processes in transport protocols
Authors: Teunis J. Ott, Jason Swanson
Venue: ACM SIGMETRICS Performance Evaluation Review (2006)

This note establishes stationarity of a number of stochastic processes of interest in the study of Transport Protocols. For many of the processes studied in this note stationarity had been established before, but for one class the result is new. For that class, it was counterintuitive that stationarity was hard to prove. This note also explains why that class offered such stiff resistance.The stationarity is proven using Liapunov functions, without first proving tightness by proving boundedness of moments. After the 2006 MAMA workshop simple conditions for existence of such moments were obtained and were added to this note.
Hacking Exposed Computer Forensics, 1 edition
Authors: Chris Davis, Aaron Philipp, David Cowen
Venue:  (2004)

Investigate computer crime, corporate malfeasance, and hacker break-ins quickly and effectively with help from this practical and comprehensive resource. You’ll get expert information on crucial procedures to successfully prosecute violators while avoiding the pitfalls of illicit searches, privacy violations, and illegally obtained evidence. It’s all here--from collecting actionable evidence, re-creating the criminal timeline, and zeroing in on a suspect to uncovering obscured and deleted code, unlocking encrypted files, and preparing lawful affidavits. Plus, you’ll get in-depth coverage of the latest PDA and cell phone investigation techniques and real-world case studies. Table of contentsPart I: Preparing for an IncidentChapter 1: The Forensics Process Chapter 2: Computer Fundamentals Chapter 3: Forensic Lab Environment PreparationPart II: Collecting the EvidenceChapter 4: Forensically Sound Evidence Collection Chapter 5: Remote Investigations and CollectionsPart III: Forensic Investigation TechniquesChapter 6: Microsoft Windows Systems Analysis Chapter 7: Linux AnalysisChapter 8: Macintosh AnalysisChapter 9: Defeating Anti-Forensic TechniquesChapter 10: Enterprise Storage AnalysisChapter 11: E-mail AnalysisChapter 12: Tracking User ActivityChapter 13: Cell Phone and PDA AnalysisPart IV: Presenting Your FindingsChapter 14: Documenting the InvestigationChapter 15: The Justice SystemPart V: AppendixesAppendix A: Forensic Forms and ChecklistsAppendix B: Understanding Legal ConcernsAppendix C: The Digital Evidence Legal ProcessAppendix D: Searching TechniquesAppendix E: The Investigator’s ToolkitGlossary
SQL Server 2005 Distilled (Microsoft Windows Server System Series)
Authors: Eric L. Brown
Venue:  (2006)

Need to get your arms around Microsoft SQL Server 2005 fast, without getting buried in the details? Need to make fundamental decisions about deploying, using, or administering Microsoft's latest enterprise database?Need to understand what's new in SQL Server 2005, and how it fits with your existing IT and business infrastructure? SQL Server 2005 Distilled delivers the answers you needï¾quickly, clearly, and objectively.Former SQL Server team member Eric L. Brown offers realistic insight into every significant aspect of SQL Server 2005: its new features, architecture, administrative tools, security model, data management capabilities, development environment, and much more. Brown draws on his extensive experience consulting with enterprise users, outlining realistic usage scenarios that leverage SQL Server 2005's strengths and minimize its limitations. Coverage includes Architectural overview: how SQL Server 2005's features work together and what it means to you Security management, policies, and permissions: gaining tighter control over your data SQL Server Management Studio: Microsoft's new, unified tool suite for authoring, management, and operations Availability enhancements: online restoration, improved replication, shorter maintenance/recovery windows, and more Scalability improvements, including a practical explanation of SQL Server 2005's complex table partitioning feature Data access enhancements, from ADO.NET 2.0 to XML SQL Server 2005's built-in .NET CLR: how to use it, when to use it, and when to stay with T-SQL Business Intelligence Development Studio: leveraging major improvements in reporting and analytics Visual Studio integration: improving efficiency throughout the coding and debugging process Simple code examples demonstrating SQL Server 2005's most significant new features
Realizing believable agents: an integration of the author-based and the model-based approaches
Authors: Paola Rizzo
Venue: AI Communications (2000)

A major research problem regarding believable agents is how to develop and execute their behavioral libraries. This work identifies two different approaches: the &lsquo;author&dash;based&rsquo; one, depending on the designer's ability to hand&dash;code each agent's behavioral features, and the &lsquo;model&dash;based&rsquo; one, grounded on a model which, starting from a set of primitives provided by the designer, automatically generates the agents' typical actions. This paper proposes to integrate the two methods by means of a two&dash;phase&sol;two&dash;step strategy, that partially relieves the designer of the burden of hand&dash;coding all the behavioral libraries, while still allowing a good control over the characters' performance, and enabling the runtime creation and storage of new behaviors. A case study concretely illustrates how such strategy is implemented by means of a hybrid planning architecture, coupled with a goal&dash;based model of personality, in order to realize characters that interact with the user according to their personalities.
Building the Perfect PC
Authors: Barbara Fritchman Thompson, Robert Bruce Thompson
Venue:  (2006)

This popular Build-It-Yourself (BIY) PC book covers everything you want to know about building your own system: Planning and picking out the right components, step-by-step instructions for assembling your perfect PC, and an insightful discussion of why you'd want to do it in the first place. Most big brand computers from HP, Dell and others use lower-quality components so they can meet their aggressive pricing targets. But component manufacturers also make high-quality parts that you can either purchase directly, or obtain through distributors and resellers. Consumers and corporations alike are opting to build rather than buy PCs to ensure high quality and compatibility. The new edition of Building the Perfect PC shows you how to construct a variety of top-flight systems with the latest technology, including AMD Socket AM-2 and Intel Core 2 processors, that are Vista- and Linux-ready. The book includes several new options, including:A Budget PC you can build for approximately $350 that offers performance and reliability similar to that of mainstream systemsA full-blown media-center system that runs Linux and MythTV or Windows MCE with multiple tuners and HDTV supportA fire-breathing high-performance gaming systemA fast, low-power, low-heat, low-noise, Small Form Factor system (the size of a shoe box)A low-cost SOHO (small office, home office) server system with a 2 terabyte (2,000 GB) disk subsystem that's suitable for a residential environment rather than a server closetRegardless of your technical experience, Building the Perfect PC will guide you through the entire process of building or upgrading your own computer. You'll use the latest top-quality components, including Intel's Core 2 Duo and AMD's Athlon X2 CPUs. And you'll know exactly what's under the hood and how to fix or upgrade your PC, should that become necessary. Not only is the process fun, but the result is often less expensive and always better quality and far more satisfying than anything you could buy off the shelf.
Fusion rules for merging uncertain information
Authors: Anthony Hunter, Weiru Liu
Venue: Information Fusion (2006)

In previous papers, we have presented a logic-based framework based on fusion rules for merging structured news reports. Structured news reports are XML documents, where the textentries are restricted to individual words or simple phrases, such as names and domain-specific terminology, and numbers and units. We assume structured news reports do not require natural language processing. Fusion rules are a form of scripting language that define how structured news reports should be merged. The antecedent of a fusion rule is a call to investigate the information in the structured news reports and the background knowledge, and the consequent of a fusion rule is a formula specifying an action to be undertaken to form a merged report. It is expected that a set of fusion rules is defined for any given application. In this paper we extend the approach to handling probability values, degrees of beliefs, or necessity measures associated with textentries in the news reports. We present the formal definition for each of these types of uncertainty and explain how they can be handled using fusion rules. We also discuss the methods of detecting inconsistencies among sources.
A Framework for Verifying Bit-Level Pipelined Machines Based on Automated Deduction and Decision Procedures
Authors: Panagiotis Manolios, Sudarshan K. Srinivasan
Venue: Journal of Automated Reasoning (2006)

We describe an approach to verifying bit-level pipelined machine models using a combination of deductive reasoning and decision procedures. While theorem-proving systems such as ACL2 have been used to verify bit-level designs, they typically require extensive expert user support. Decision procedures such as those implemented in UCLID can be used to automatically and efficiently verify term-level pipelined machine models, but these models use numerous abstractions, implement a subset of the instruction set, and are far from executable. We show that by integrating UCLID with the ACL2 theorem-proving system, we can use ACL2 to reduce the proof that an executable, bit-level machine refines its instruction set architecture to a proof that a term-level abstraction of the bit-level machine refines the instruction set architecture, which is then handled automatically by UCLID. We demonstrate the efficiency of our approach by applying it to verify a complex, seven-stage, bit-level interface pipelined machine model that implements 593 instructions and has features such as branch prediction, exceptions, and predicated instruction execution. Such a proof is not possible using UCLID and would require prohibitively more effort using just ACL2.
Biological network comparison using graphlet degree distribution
Authors: Nataša Pržulj
Venue: Bioinformatics (2007)

Motivation: Analogous to biological sequence comparison, comparing cellular networks is an important problem that could provide insight into biological understanding and therapeutics. For technical reasons, comparing large networks is computationally infeasible, and thus heuristics, such as the degree distribution, clustering coefficient, diameter, and relative graphlet frequency distribution have been sought. It is easy to demonstrate that two networks are different by simply showing a short list of properties in which they differ. It is much harder to show that two networks are similar, as it requires demonstrating their similarity in all of their exponentially many properties. Clearly, it is computationally prohibitive to analyze all network properties, but the larger the number of constraints we impose in determining network similarity, the more likely it is that the networks will truly be similar. Results: We introduce a new systematic measure of a network's local structure that imposes a large number of similarity constraints on networks being compared. In particular, we generalize the degree distribution, which measures the number of nodes 'touching' k edges, into distributions measuring the number of nodes 'touching' k graphlets, where graphlets are small connected non-isomorphic subgraphs of a large network. Our new measure of network local structure consists of 73 graphlet degree distributions of graphlets with 2--5 nodes, but it is easily extendible to a greater number of constraints (i.e. graphlets), if necessary, and the extensions are limited only by the available CPU. Furthermore, we show a way to combine the 73 graphlet degree distributions into a network 'agreement' measure which is a number between 0 and 1, where 1 means that networks have identical distributions and 0 means that they are far apart. Based on this new network agreement measure, we show that almost all of the 14 eukaryotic PPI networks, including human, resulting from various high-throughput experimental techniques, as well as from curated databases, are better modeled by geometric random graphs than by Erdös--Rény, random scale-free, or Barabási--Albert scale-free networks. Availability: Software executables are available upon request. Contact: natasha@ics.uci.edu
Confer at the ISTA congress
Authors: Karl L. Zinn
Venue: ACM SIGCUE Outlook (1977)

Computing and telecommunications were used during the Second International Congress of the International Society for Technology Assessment (ISTA) to facilitate the discussion and contribute to the Congress report. In particular, the telecommunications activity was designed to enhance interaction on substantive issues and convergence on conclusions and interpretations. Only incidentally were we conducting an experiment or trial (with support from NSF) for a community of potential users of computer-aided conferencing.
Graph transformation and designing parallel sparse matrix algorithms beyond data dependence analysis
Authors: H. X. Lin
Venue: Scientific Programming (2004)

Algorithms are often parallelized based on data dependence analysis manually or by means of parallel compilers. Some vector/matrix computations such as the matrix-vector products with simple data dependence structures (data parallelism) can be easily parallelized. For problems with more complicated data dependence structures, parallelization is less straightforward. The data dependence graph is a powerful means for designing and analyzing parallel algorithms. However, for sparse matrix computations, parallelization based on solely exploiting the existing parallelism in an algorithm does not always give satisfactory results. For example, the conventional Gaussian elimination algorithm for the solution of a tri-diagonal system is inherently sequential, so algorithms specially for parallel computation has to be designed. After briefly reviewing different parallelization approaches, a powerful graph formalism for designing parallel algorithms is introduced. This formalism will be discussed using a tri-diagonal system as an example. Its application to general matrix computations is also discussed. Its power in designing parallel algorithms beyond the ability of data dependence analysis is shown by means of a new algorithm called ACER (Alternating Cyclic Elimination and Reduction algorithm).
Video motion analysis for the synthesis of dynamic cues and Futurist art
Authors: J. P. Collomosse, P. M. Hall
Venue: Graphical Models (2006)

This paper presents new methods for stylising video to produce cartoon motion emphasis cues and modern art. Specifically, we introduce "dynamic cues" as a class of motion emphasis cue, encompassing traditional animation techniques such as anticipation and motion exaggeration. We describe methods for automatically synthesising such cues within video premised upon the recovery of articulated figures, and the subsequent manipulation of the recovered pose trajectories. Additionally, we show how our motion emphasis framework may be applied to emulate artwork in the Futurist style, popularised by Duchamp.