ppxscal/embedding_network huggingface dataset:
Doing E-Business: Strategies for Thriving in an Electronic Marketplace
Authors: David Taylor, Alyse Terhune
Venue:  (2002)

:Strategies for becoming a fully functional E-businessThis book provides executives, managers, and entrepreneurs with practical ideas and techniques that will help them improve the way they implement and manage E-commerce and E-business. The authors have been E-business strategy consultants for over a decade, and this book is based on their experiences working with hundreds of Fortune 500 companies and dot com startups. The book is filled with examples of how companies across industries have used the Internet to sell in business-to-business E-marketplaces, as well as direct to consumers, and the problems they have encountered in the process. The book also covers many topics that other E-business books miss, including the impact of the Net's underground economy and how to involve customers emotionally with a Web-based business.David Taylor and Alyse Terhune (Stamford, CT) founded eMarket Holdings, LLC, an E-business strategy consulting firm in 1999. They have been e-commerce and e-business consultants for over a decade, primarily at Gartner Group, Inc.
On The Estimation Of Reliability Of A Software System Using Reliabilities Of Its Components
Authors: S. Krishnamurthy, A. P. Mathur
Venue: Proceedings of the Eighth International Symposium on Software Reliability Engineering (1997)

We report an experiment to evaluate a method, known as component based reliability estimation (CBRE), for the estimation of reliability of a software system using reliabilities of its components. CBRE involves computing path reliability estimates based on the sequence of components executed for each test input. Path reliability estimates are averaged over all test runs to obtain an estimate of the system reliability. In the experiment reported, three components of a Unix utility were seeded with errors and the reliability of each component was measured. The faulty components were then introduced systematically into the utility, in various combinations, to produce several faulty versions of the utility. For each faulty version, test cases were drawn from an operational profile to measure the component-based reliability. The true reliability of the faulty version was estimated using the frequency count approach. The goodness of CBRE was assessed in terms of the accuracy and efficiency of the estimates with respect to the true reliability. Results from this experiment suggest that CBRE yields reasonably accurate results at an efficient rate. However, the accuracy and efficiency of CBRE is sensitive to the dependency among successive calls to a component.
A Synthesis Preprocessor that Converts Implicit Style Verilog Into One-Hot Designs
Authors: Mark G. Arnold, James D. Shuler
Venue: Proceedings of the 1997 IEEE International Verilog HDL Conference (IVC '97) (1997)

Different synthesis vendors support different subsets of Verilog. One such subset is the implicit style state machine (multiple uses of edge triggered events within an always block). With this style, one can obtain working silicon in less time because the implicit style is more like software design. Unfortunately, most synthesis vendors do not support the implicit style. To make the implicit style more accessible, a freely available synthesis preprocessor is described here that converts implicit style always blocks into other equivalent Verilog, which can then be synthesized by most commercial synthesis tools. This paper discusses advantages of the implicit style, how the preprocessor translates implicit style code into a one-hot design, and why the language subset (non-blocking assignment) was chosen so that the semantics of the synthesized Verilog can agree with the simulation semantics defined by IEEE 1364. More information about our preprocessor can be found at http://plum.uwyo.edu/~vito or http://cs.brockport.edu/~jshuler/vito/.
Unified Optical Scanning Technology, 1 edition
Authors: Leo Beiser
Venue:  (2003)

:A cohesive view of the expanding field of optical scanning, in a single compact volumeOptical scanning is a systematic sampling of spatial information, transforming images or data to or from a temporal signal for electronic processing. The field of optical information handling has been developing rapidly, with many of its classical forms being transformed in new and fascinating ways. For instance, the once-discrete fields of serial and parallel optical information transfer are evolving into new hybrid systems as researchers add the flexibility of optical scanning for greater operational advantage in data manipulation and transfer. Insight for such creative advancement is fostered with the unification of unapparent or secluded concepts.Written by an award-winning leader in the field, this is a thoroughly integrated overview of the many facets and disciplines of optical scanning. It brings together scanning theory, scanned resolution, deflection and modulation devices, optical transfer techniques, positional error analysis and control, system architecture, new research, and the unification of complementary or analogous processes, such as active and passive scanning systems. Of particular utility to both practitioner and student are such features as:An overview of the technology and unifying principles, including active and passive scanning, optical transfer, and system architectureIn-depth chapters on scanning theory and processes, scanned resolution, scanner devices and techniques, and the control of scanner beam misplacementA comprehensive review of the government-sponsored research of agile beam steering, now primed for commercial adaptationA unique focus on the Lagrange invariant and its revealing resolution invariant
A case study of a system-level approach to power-aware computing
Authors: Thomas L. Martin, Daniel P. Siewiorek, Asim Smailagic, Matthew Bosworth, Matthew Ettus, Jolin Warren
Venue: ACM Transactions on Embedded Computing Systems (TECS) (2003)

This paper introduces a systematic approach to power awareness in mobile, handheld computers. It describes experimental evaluations of several techniques for improving the energy efficiency of a system, ranging from the network level down to the physical level of the battery. At the network level, a new routing method based upon the power consumed by the network subsystem is shown to improve power consumption by 15&percnt; on average and to reduce latency by 75&percnt; over methods that consider only the transmitted power. At the boundary between the network and the processor levels, the paper presents the problem of local versus remote processing and derives a figure of merit for determining whether a computation should be completed locally or remotely, one that involves the relative performance of the local and remote system, the transmission bandwidth and power consumption, and the network congestion. At the processor level, the main memory bandwidth is shown to have a significant effect on the relationship between performance and CPU frequency, which in turn determines the energy savings of dynamic CPU speed-setting. The results show that accounting for the main memory bandwidth using Amdahl's law permits the performance speed-up and peak power versus the CPU frequency to be estimated to within 5&percnt;. The paper concludes with a technique for mitigating the loss of battery energy capacity with large peak currents, showing an improvement of up to 10&percnt; in battery life, albeit at some cost to the size and weight of the system.
PCI Express System Architecture
Authors: Ravi Budruk, Don Anderson, Ed Solari
Venue:  (2003)

Mindshare and best selling author Ed Solari, join forces to present a book on the newest bus architecture, PCI Express. PCI EXPRESS is considered to be the most general purpose bus so it should appeal to a wide audience in this arena. Today's buses are becoming more specialized to meet the needs of the particular system applications, building the need for this book. Mindshare and their only competitor in this space (Solari) team up in this new book.
Configuring Symantec AntiVirus: Corporate Edition
Authors: Laura E. Hunter, James Stanger, Arthar A. Kahn, Jay Cee Taylor, Athar A. Khan
Venue:  (2003)

:See Whats New in NAVCE 7.6 Learn about Discovery Service, the service that locates NAVCE servers to be managed by the Symantec System Center console, and enhanced rollout to secondary servers. Master the Symantec System Center (SSC) Console The SSC provides a centralized interface that allows you to remotely perform manual virus scans, schedule virus scans, configure virus definition update options, and more. Implement Central Quarantine Master advanced features of the Quarantine Console and configure managed client PCs to route suspected viruses to the Quarantine Server. Develop an Upgrade Plan Upgrade from NAVCE 7.0 and 7.5, learn how to do automatic migration, migrate from third-party LAN antivirus programs, and develop a project plan for a NAVCE upgrade. Configure a Norton AntiVirus Corporate Edition (NAVCE) 7.6 Infrastructure See how to configure multiple NAVCE clients and servers and how to configure roaming for NAVCE 7.6 clients. Develop a Security Solution for NAVCE 7.6 Secure NAVCE 7.6 Windows NT / 2000 Servers, NAVCE 7.6 Novell NetWare Servers, NAVCE 7.6 Client PCs, and learn how to use the Reset ACL Tool. Master the Virus Definition Transport Method (VDTM) Learn how to use automated virus definition delivery and distribution and to configure clients to automatically connect to parent servers over a network link and copy updates. Troubleshoot Servers and Client PCs Find the basisc of troubleshooting, troubleshooting roaming client support, addressing performance issues, and accessing information databases. Configure Computer Virus Scans Understand outbreaks, virus scanning methods, and see how to analyze the results of virus scans. Register for Your 1 Year Upgrade The Syngress Solutions upgrade plan protects you from content obsolescence and provides monthly mailings, whitepapers, and more! CONTENTS OF THIS BOOK INCLUDE: Introduction to Norton AntiVirus Corporate Edition (NAVCE) Designing a Managed Antivirus Infrastructure Implementing Symantec System Center and Alert Management System2 (AMS2) Implementing Central Quarantine 2.01 Implementing NAVCE 7.6 to Servers Implementing NAVCE 7.6 to Client PCs Upgrading from Prior Versions Configuring Your NAVCE 7.6 Environment Securing Your NAVCE 7.6 Environment Updating Virus Protection Troubleshooting Your NAVCE 7.6 Environment Scanning for Viruses and Handling Virus Outbreaks Backup and Disaster Recovery
QoS based routing algorithm in integrated services packet networks
Authors: C. Pornavalai, G. Chakraborty, N Shiratori
Venue: Proceedings of the 1997 International Conference on Network Protocols (ICNP '97) (1997)

In this paper we study QoS based routing algorithm for supporting resource reservation in high-speed Integrated Services Packet Network (ISPN). Recently, this problem was proved to be NP-complete. However, when the considered QoS constraints are bandwidth, delay, delay jitter, and loss free, we have shown that by employing Weighted Fair Queueing (WFQ) service discipline, the complexity of the problem could be reduced to that of shortest path routing without any QoS constraints. Then such a multiple QoS constrained route could be searched in polynomial time. We also present the routing algorithm (called "QoSR/sub BF/"), which is a modified version of Bellman-Ford shortest path algorithm. Simulation results show that QoSR/sub BF/ has better performance compared to the existing QoS routing algorithms.
MAC Layer Protocols for Real-Time Traffic in Ad-Hoc Wireless Networks
Authors: Abhishek Pal, Atakan Dogan, Füsun Özgüner
Venue: Proceedings of the 2002 International Conference on Parallel Processing (2002)

Providing Quality of Service (QoS) to high bandwidth video, voice and data applications in wireless networks is an important problem. Such applications are in the class of real-time applications; they need communication operations to complete within certain targeted deadlines. Based on this premise, this paper addresses the design of distributed MAC layer protocols that incorporate explicit support for real-time traffic in an ad-hoc wireless network.Specifically, we have developed two new MAC layer protocols, namely the elimination by sieving (ES-DCF) and the deadline bursting (DB-DCF) protocols. Both algorithms use deterministic collision resolution algorithms in order to provide timely delivery guarantees to different classes of real-time traffic. The extensive simulation studies conducted confirmed that ES-DCF and DB-DCF perform well for hard-real-time traffic and soft-real-time traffic, respectively.
Adaptive information visualization based on the user's multiple viewpoints-interactive 3D visualization of the WWW
Authors: T. Teraoka, M. Maruyama
Venue: Proceedings of the 1997 IEEE Symposium on Information Visualization (InfoVis '97) (1997)

We introduce the adaptive information visualization method for hypermedia and the WWW based on the user's multiple viewpoints. We propose two graphical interfaces, the CVI and the RF-Cone. The CVI is the interface for interactive viewpoint selection. We can select a viewpoint reflecting our interests by using the CVI. According to the given viewpoint, the RF-Cone adaptively organizes the 3D representation of the hypermedia so that we can understand the semantic and structural relationship of the hypermedia and easily retrieve the information. Combining these methods, we have developed the WWW visualization system which can provide highly efficient navigation.
The leap year problem
Authors: Arie Deursen
Venue:  (1998)

A significant number of programs incorrectly treats the year 2000 as a non-leap year. We list 21 real life code fragments illustrating the large variety of ways that are used to determine whether a given year is a leap year or not. Some of these fragments are correct; others will fail in the year 2000. The fragments are written in C, Pascal, COBOL, and assembly language. We discuss the consequences for automated tool support, as well as the organizational implications of the leap year problem.
An Algorithm for Clipping Lines in Object and Image Space
Authors: J. D. Day
Venue:  (1991)

This document describes the Modula-2 front end gp2d, which produces ASCII files of the intermediate code DCode. Machine dependencies are specified in a configuration file. The document is also the reference for DCode itself. Changes from the previous revision of gp2d are specified in an appendix. 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
On the Repeatability of Metric Models and Metrics across Software Builds
Authors: Norman F. Schneidewind
Venue: Proceedings of the 11th International Symposium on Software Reliability Engineering (2000)

Over the past several years we have developed the following metrics models: Boolean discriminate functions (BDFs) for classifying quality; Kolmogorov-Smirnov distance for estimating metric critical values; various derivative calculations for assessing the quality that could be achieved with various levels of quality control and inspection; a stopping rule for deciding how many metrics to use in a discriminate function; point and confidence interval estimates of quality; Relative Critical Value Deviation metrics for indexing quality; and non-linear regression functions for predicting quality. We would like these models and metrics to be repeatable across the n builds of a software system. The great advantage of repeatability is that models and metrics only need to be developed and validated once on build 1 and then applied n-1 times without modification to subsequent builds, with considerable savings in analysis and computational effort. In practical terms, this approach involves using the same model parameters (e.g., metrics critical values) that were validated and applying them unchanged on subsequent builds. The disadvantage is that the quality and metrics data of builds 2... n, which varies across builds, is not utilized. We make a comparison of this n approach with one that involves validating models and metrics on each build i and applying them only on build i+1, and then repeating the process. The advantage of this approach is that all available data are used in the models and analysis but at considerable cost in effort. We report on experiments involving large sets of discrepancy report and metrics data on the Space Shuttle flight software, where we compare the predictive accuracy and effort of the two approaches for BDFs, critical values, derivative quality and inspection calculations, and stopping rule.
Multimedia, Cyberspace & Ethics
Venue: Proceedings of the International Conference on Information Visualisation (2000)

Cyberspace not only facilitates use of the whole range of multimedia but also provides for unlimited recombination of images, text, sound, animation and video for a huge variety of applications. For example, cyberspace facilitates the creation and visualization of new virtual spaces as well as virtual identities. As such, a huge number of ethical issues are raised. Some such issues include those of privacy, accuracy, data security, intellectual property rights and accessibility. However concern for these issues and the actual social and cultural impact on society of the burgeoning development of a multimedia cyberspace is very often overlooked in most of the, hype and, ¿techno-enthusiasm¿ that abounds. This paper will, therefore seek to address some of the ethical issues that, as computing professionals, we surely owe a duty to society to consider and expose. 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
Exact formulas for momemts of sums of classical parking functions
Authors: Joseph P. S. Kung, Catherine Yan
Venue: Advances in Applied Mathematics (2003)

For given positive integers a and b, an [a, b]-parking function of length n is a sequence (x1, x2,..., xn) of positive integers whose order statistics x(i) (the sequence obtained by rearranging the original sequence in non-decreasing order) satisfy the inequalities x(i) ≤ a + (i - 1)b for all i. Using elementary methods, we derive explicit formulas for higher moments of sums and reversed sums of parking functions of length n. These formulas are finite double sums with reasonably simple terms. They are obtained by solving a recursion based on a combinatorial decomposition which decomposes a sequence of positive integers into a "maximum" parking function and a subsequence all of whose terms have "high" values. Moments of reversed sums of ordinary parking functions (the case when a = b = 1) have a surprising connection with the enumeration of "sparsely-edged" graphs. From this connection, we obtain exact formulas and derive, using routine methods, asymptotic formulas (due originally to E.M. Wright) for the number of connected labeled graphs on N vertices and N + k edges. Our method yields a new formula for the Wright constants in terms of a sequence which satisfies a linear recursion.
Malicious packet dropping: how it might impact the TCP performance and how we can detect it
Authors: Xiaobing Zhang, S. F. Wu, Zhi Fu, Tsung-Li Wu
Venue: Proceedings of the 2000 International Conference on Network Protocols (2000)

Among various types of denial of service attacks, "dropping attack" is probably the most difficult one to handle. This paper explores the negative impacts of packet dropping attacks and a method to detect such attacks. First, three dropping patterns are classified and investigated. We demonstrate that attackers can choose different dropping patterns to degrade TCP service to different levels, and selectively dropping a very, small number of packets can result in severe damage to TCP performance. Second, we show that a hacker can utilize a DDoS attack tool to control a "uncompromised" router to emulate dropping attacks. This proves that dropping attacks are indeed practically very possible to happen in today's Internet environment. Third, we present a statistical analysis module for the detection of TCP packet dropping attacks. Three measures, session delay, the position and the number of packet reorderings, have been implemented in the statistical module. This paper has evaluated and compared their detection performance.
A Knowledge Representation and Reasoning Support for Modeling and Querying Video Data
Authors: Edoardo Ardizzone, Mohand-Said Hacid
Venue: Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence (1999)

This paper describes a knowledge-based approach for modeling and retrieving video data. Selected objects of interest in a video sequence are described and stored in a database. This database forms the object layer. On top of this layer, we define the schema layer used to capture the structured abstractions of the objects stored in the object layer. We propose two abstract languages on the basis of description logics: one for describing the contents of these layers, and the other, more expressive, for making queries. The query language provides possibilities for navigation of the schema through forward and backward traversal of links, sub-setting of attributes, and constraints on links.
Generation of the Post Lattice by Irreducible Clones
Authors: Grant R. Pogosyan, Ivo G. Rosenberg
Venue: Proceedings of the 33rd International Symposium on Multiple-Valued Logic (2003)

Clones of logic functions form an algebraic lattice,which in the case of Boolean functions was completelydescribed by E.L. Post in 1941. This lattice, often referredto as the Post Lattice, has been well studiedfrom various angles, particularly, the generation of thePost Lattice by its subsets. This paper discusses theresults about clones that are irreducible by means ofmeet- and/or join-operations of the lattice. We showthat the join-irreducible clones generate the Post Lattice,and dually, the meet-irreducible clones generatethe Post Lattice. We present a complete description ofsuch generation in both cases. We observe that anyclone can be presented as a join or meet of at most twoirreducible clones. In the former case each clone isthe join of at most four join-irreducible clones and inthe latter case each clone is the meet of at most threemeet-irreducible ones.
Computing Polynomial Composition Factors and Inverses of Automorphisms in Polynomial Time
Authors: Matthew T. Dickerson
Venue:  (1988)

The problem of determining when an endomorphism on a polynomial ring is an automorphism and, when it is, the problem of computing its inverse are long standing problems which have received much attention both recently and in the past [BCW], [N], [NS], [SS]. There has also been much attention given recently to various problems relating to the functional decomposition of polynomials [AT], [BZ], [D], [G1], [G2], [GKL], [KL]. In this paper, we present the first polynomial time algorithm for computing the left composition factor of a multivariate polynomial decomposition and we use that result in the first polynomial time algorithm for computing the inverse of an automorphism on a polynomial ring. Finally, we show how these algorithms can be used to determine when an endomorphism is an automorphism.