ppxscal/embedding_network huggingface dataset:
eBay Auction Templates Starter Kit
Authors: Michael Miller
Venue:  (2006)

Looking for "it"? That something different that will increase your eBay auction sale rates and selling prices? One of the most effective ways to generate more sales at high price-points is to create a more attractive, attention-getting auction listing. The easiest way to do this is through the use of templates that you can quickly populate with minimal effort and will maintain a style consistency across all of your auctions.eBay Auction Templates Starter Kit is a combination book/CD designed to help all levels of eBay sellers create better-looking eBay auction listings as quickly and easily as possible. The text describes how to use HTML to create sophisticated auction templates; the CD includes dozens of pre-designed templates that can be used as-is. If you're a little more ambitious, you'll also learn how toï¾ create great-looking auction listings using HTML. 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 a null divergence velocity field using smoothed particle hydrodynamics
Authors: F. Colin, R. Egli, F. Y. Lin
Venue: Journal of Computational Physics (2006)

A new use of smoothed particle hydrodynamics (SPH) in fluid simulation is presented: an algorithm solving the Helmholtz-Hodge decomposition using SPH in order to find the null divergence velocity field for incompressible flow simulation. Accordingly, a new version of the Laplacian for a vector field is proposed here. In order to improve the accuracy of the SPH technique, the paper also presents some test problems for understanding the limitations of different kinds of gradient and Laplacian approximation formulas.
PowerPoint 2003 Personal Trainer (Personal Trainer (O'Reilly))
Venue:  (2004)

PowerPoint is the world's most widely used presentation program, a favorite of educators, trainers, and, of course, those in business everywhere. Yet, every time Microsoft releases a new version of the program, they introduce another set of features---most of which you'll never understand or use. Even if you have experience with PowerPoint, you'll struggle to keep up with the improvements. If you're a beginner, you probably don't know where to start. Now, with PowerPoint 2003 Personal Trainer, beginners and experts alike can become black belts with this presentation program, quickly and easily. This fully illustrated book takes a modular approach to learning, allowing you to start with the fundamentals and work your way to advance topics through dozens of task-oriented lessons--at your own pace. The companion CD tutorial guides you through each lesson interactively. PowerPoint 2003 Personal Trainer includes sections on editing, formatting, drawing, working with word art, tables, organization charts, multimedia, other programs, the Internet, and how to optimize presentation delivery. Every chapter includes detailed diagrams and a review at the end to help you absorb and retain all you have learned. If you already use PowerPoint, you can dive right into those topics (and only those topics) that you need or want to learn. Unlike many consumer software tutorials that dumb down the material or present it in a confusing fashion, PowerPoint 2003 Personal Trainer is written in a non-technical and engaging style that you will find fun, easy, and most of all, clear and informative. You don't have to wade through tons of jargon and technical information to become proficient. Part of our new Personal Trainer Series, this book is based on content from CustomGuide (http://www.customguide.com), a leading provider of computer training materials. Founded by instructors who grew dissatisfied with the industry's dry course materials, CustomGuide offers courseware (for instructors and students), quick references, to software bulletins and e-learning courses that are fun, flexible, and easy to use. 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
Resilient multicast using overlays
Authors: Suman Banerjee, Seungjoon Lee, Bobby Bhattacharjee, Aravind Srinivasan
Venue: IEEE/ACM Transactions on Networking (TON) (2006)

We introduce Probabilistic Resilient Multicast (PRM): a multicast data recovery scheme that improves data delivery ratios while maintaining low end-to-end latencies. PRM has both a proactive and a reactive components; in this paper we describe how PRM can be used to improve the performance of application-layer multicast protocols especially when there are high packet losses and host failures. Through detailed analysis in this paper, we show that this loss recovery technique has efficient scaling properties-the overheads at each overlay node asymptotically decrease to zero with increasing group sizes.As a detailed case study, we show how PRM can be applied to the NICE application-layer multicast protocol. We present detailed simulations of the PRM-enhanced NICE protocol for 10000 node Internet-like topologies. Simulations show that PRM achieves a high delivery ratio (>97%) with a low latency bound (600 ms) for environments with high end-to-end network losses (1%-5%) and high topology change rates (5 changes per second) while incurring very low overheads (<5%).
SICDOC - a challenge
Authors: Jack Cover
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1975)

Our leader, Joe Rigo, states that a computer system development project is essentially a document-publishing organization for most of its life. While this is perhaps a bit simplistic, the important kernel of truth is there. A systems and programming project which has been properly documented from start to finish is at least one giant step ahead of a typical sear-of-the-pants-we'll-do-the-documentation-later type project. 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
SAGA: a subgraph matching tool for biological graphs
Authors: Yuanyuan Tian, Richard C. Mceachin, Carlos Santos, David J. States, Jignesh M. Patel
Venue: Bioinformatics (2007)

Motivation: With the rapid increase in the availability of biological graph datasets, there is a growing need for effective and efficient graph querying methods. Due to the noisy and incomplete characteristics of these datasets, exact graph matching methods have limited use and approximate graph matching methods are required. Unfortunately, existing graph matching methods are too restrictive as they only allow exact or near exact graph matching. This paper presents a novel approximate graph matching technique called SAGA. This technique employs a flexible model for computing graph similarity, which allows for node gaps, node mismatches and graph structural differences. SAGA employs an indexing technique that allows it to efficiently evaluate queries even against large graph datasets. Results: SAGA has been used to query biological pathways and literature datasets, which has revealed interesting similarities between distinct pathways that cannot be found by existing methods. These matches associate seemingly unrelated biological processes, connect studies in different sub-areas of biomedical research and thus pose hypotheses for new discoveries. SAGA is also orders of magnitude faster than existing methods. Availability: SAGA can be accessed freely via the web at http://www.eecs.umich.edu/saga. Binaries are also freely available at this website. Contact: jignesh@eecs.umich.edu Supplementary material: Supplementary material is available at http://www.eecs.umich.edu/periscope/publ/saga-suppl.pdf.
Microlens fabrication using an etched glass master
Authors: P. Zhang, G. Londe, J. Sung, E. Johnson, M. Lee, H. J. Cho
Venue: Microsystem Technologies (2006)

This paper presents a micromachining technique to fabricate microlenses using an etched glass master. The isotropic etching profile of the glass master was utilized for microlens replication. The master was treated by C4F8 plasma to form a conformal anti-adhesion layer. Lens arrays were replicated on polymer substrates by hot embossing. Microlenses with a large numerical aperture could be fabricated with this method. This work facilitates and simplifies fabrication steps for microlenses.
MCSA/MCSE Implementing and Administering Security in a Windows 2000 Network Exam Cram 2 (Exam Cram 70-214)
Authors: Roberta Bragg
Venue:  (2003)

MCSE Implementing and Administering Security in a Windows 2000 Network (Exam Cram 70-214) helps you pass the 70-214 exam, which is a core exam for the new Microsoft security track. This exam measures the ability to implement and administer security and network infrastructures that use Windows 2000 and Active Directory. This book is not intended to teach new material. Instead, it assumes that you have a solid foundation of knowledge but could use a refresher on important concepts, as well as a guide to exam topics and objectives. The book features test-taking strategies, time-saving study tips, and a special Cram Sheet that includes tips, acronyms, and memory joggers not available anywhere else! The Cram Sheet is especially useful for last-minute review before the test begins.The CD features PrepLogicï¾¿ Practice Tests, Preview Edition. This product includes one complete PrepLogic Practice Test with approximately the same number of questions found on the actual vendor exam. Each question contains full, detailed explanations of the correct and incorrect answers. The engine offers two study modes, Practice Test and Flash Review, full exam customization, and a detailed score report.The best-selling Exam Cram 2 series is supported online at examcram.com, offering industry news, study tips, practice questions, and discussion forums. Each book is published under the direction of Series Editor Ed Tittel, the leading authority on IT certification. This book has been subjected to rigorous technical review by a team of industry experts, ensuring content is superior in both coverage and technical accuracy, and has earned the distinction of Cramsessionï¾¿ Approved Study Material.
On the formal pescription of microoperations and its impact on automatic microcode generation
Authors: Chen Bingcong, Wei Xiaofan, Yao Xin
Venue: ACM SIGMICRO Newsletter (1985)

Automatic microcode generation is a significant research field of firmware engineering. In the research System AMPS, three kinds of formal description of microoperations will be needed in automatic microcode generation from high level microprogramming language: algorithmic microoperations, real microoperations, and formal microoperations. In this paper, we present and discuss the formal descriptions, the relationship among real microoperations as well as the factors by which the concurrency of microoperations can be identified; we also show the vitality of these three kinds of description mentioned above in allowing the high level microprogramming language being machine-independent, and the generality of microcode compaction algorithm.
Experiences using the NETGEN program
Authors: Clyde W. Ford
Venue: Issue 18 (February 1975) (1975)

NETGEN, a program for generating network problems has been described in recent issues of the Journal of Management Science and the SIGMAP Newsletter. NETGEN's authors, Messrs. D. Klingman A. Napier and J. Stutz, described NETGEN as a general purpose code for "generating a variety of feasible network problems . . . capacitated and uncapacitated transportation and minimum cost flow network problems". Furthermore, say the authors, "researchers can generate identical networks using this code. . .". While this description would seem to reveal a potentially valuable tool for scientists working in the field of network problems, this researcher has encountered several difficulties in utilizing the NETGEN program. 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
A comparative genome approach to marker ordering
Authors: T. Faraut, S. De Givry, P. Chabrier, T. Derrien, F. Galibert, C. Hitte, T. Schiex
Venue: Bioinformatics (2007)

Motivation: Genome maps are fundamental to the study of an organism and essential in the process of genome sequencing which in turn provides the ultimate map of the genome. The increased number of genomes being sequenced offers new opportunities for the mapping of closely related organisms. We propose here an algorithmic formalization of a genome comparison approach to marker ordering. Results: In order to integrate a comparative mapping approach in the algorithmic process of map construction and selection, we propose to extend the usual statistical model describing the experimental data, here radiation hybrids (RH) data, in a statistical framework that models additionally the evolutionary relationships between a proposed map and a reference map: an existing map of the corresponding orthologous genes or markers in a closely related organism. This has concretely the effect of exploiting, in the process of map selection, the information of marker adjacencies in the related genome when the information provided by the experimental data is not conclusive for the purpose of ordering. In order to compute efficiently the map, we proceed to a reduction of the maximum likelihood estimation to the Traveling Salesman Problem. Experiments on simulated RH datasets as well as on a real RH dataset from the canine RH project show that maps produced using the likelihood defined by the new model are significantly better than maps built using the traditional RH model. Availability: The comparative mapping approach is available in the last version of de Givry,S. et al. [(2004) Bioinformatics, 21, 1703--1704, www.inra.fr/mia/T/CarthaGene], a free (the LKH part is free for academic use only) mapping software in C++, including LKH (Helsgaun,K. (2000) Eur. J. Oper. Res., 126, 106--130, www.dat.ruc.dk/keld/research/LKH) for maximum likelihood computation. Contact: thomas.faraut@toulouse.inra.fr
Fireflies: scalable support for intrusion-tolerant network overlays
Authors: Håvard Johansen, André Allavena, Robbert van Renesse
Venue: ACM SIGOPS Operating Systems Review (2006)

This paper describes and evaluates Fireflies, a scalable protocol for supporting intrusion-tolerant network overlays. While such a protocol cannot distinguish Byzantine nodes from correct nodes in general, Fireflies provides correct nodes with a reasonably current view of which nodes are live, as well as a pseudo-random mesh for communication. The amount of data sent by correct nodes grows linearly with the aggregate rate of failures and recoveries, even if provoked by Byzantine nodes. The set of correct nodes form a connected submesh; correct nodes cannot be eclipsed by Byzantine nodes. Fireflies is deployed and evaluated on PlanetLab.
Automatically Conflating Road Vector Data with Orthoimagery
Authors: Ching-Chien Chen, Craig A. Knoblock, Cyrus Shahabi
Venue: Geoinformatica (2006)

Recent growth of the geospatial information on the web has made it possible to easily access a wide variety of spatial data. The ability to combine various sets of geospatial data into a single composite dataset has been one of central issues of modern geographic information processing. By conflating diverse spatial datasets, one can support a rich set of queries that could have not been answered given any of these sets in isolation. However, automatically conflating geospatial data from different data sources remains a challenging task. This is because geospatial data obtained from various data sources may have different projections, different accuracy levels and different formats (e.g., raster or vector format), thus resulting in various positional inconsistencies. Most of the existing algorithms only deal with vector to vector data conflation or require human intervention to accomplish vector data to imagery conflation. In this paper, we describe a novel geospatial data fusion approach, named AMS-Conflation, which achieves automatic vector to imagery conflation. We describe an efficient technique to automatically generate control point pairs from the orthoimagery and vector data by exploiting the information from the vector data to perform localized image processing on the orthoimagery. We also evaluate a filtering technique to automatically eliminate inaccurate pairs from the generated control points. We show that these conflation techniques can automatically align the roads in orthoimagery, such that 75% of the conflated roads are within 3.6 meters from the real road axes compared to 35% for the original vector data for partial areas of the county of St. Louis, MO.
An approximation scheme for stochastic linear programming and its application to stochastic integer programs
Authors: David B. Shmoys, Chaitanya Swamy
Venue: Journal of the ACM (JACM) (2006)

Stochastic optimization problems attempt to model uncertainty in the data by assuming that the input is specified by a probability distribution. We consider the well-studied paradigm of 2-stage models with recourse: first, given only distributional information about (some of) the data one commits on initial actions, and then once the actual data is realized (according to the distribution), further (recourse) actions can be taken. We show that for a broad class of 2-stage linear models with recourse, one can, for any &epsi; > 0, in time polynomial in 1/&epsi; and the size of the input, compute a solution of value within a factor (1&plus;&epsi;) of the optimum, in spite of the fact that exponentially many second-stage scenarios may occur. In conjunction with a suitable rounding scheme, this yields the first approximation algorithms for 2-stage stochastic integer optimization problems where the underlying random data is given by a &ldquo;black box&rdquo; and no restrictions are placed on the costs in the two stages. Our rounding approach for stochastic integer programs shows that an approximation algorithm for a deterministic analogue yields, with a small constant-factor loss, provably near-optimal solutions for the stochastic generalization. Among the range of applications, we consider are stochastic versions of the multicommodity flow, set cover, vertex cover, and facility location problems.
Analysis of a transmission scheduling algorithm for supporting bandwidth guarantees in bufferless networks
Authors: Mahmoud Elhaddad, Rami Melhem, Taieb Znati
Venue: ACM SIGMETRICS Performance Evaluation Review (2006)

In a network of bufferless packet multiplexers, the user-perceived capacity of an ingress-egress tunnel (connection) may degrade quickly with increasing path length. This is due to the compounding of transmission blocking probabilities along the path of the connection, even when the links are not overloaded. In such an environment, providing users (e.g., client ISPs) with tunnels of statistically guaranteed bandwidth may limit the network's connection-carrying capacity.In this paper, we introduce and analyze a transmission-scheduling algorithm that employs randomization and traffic regulation at the ingress, and batch scheduling at the links. The algorithm ensures that a fraction of transmissions from each connection is consistently subject to small blocking probability at every link, so that these transmissions are likely to survive long paths. For this algorithm, we obtain tight bounds on the expectation and tail probability of the blocking rate of any ingress-egress connection. We compare the bounds to those obtained using the FCFS link-scheduling rule. We find that the proposed scheduling algorithm significantly improves the network's connection-carrying capacity.In deriving the desired bounds, we develop an analytic framework for stochastically comparing network-wide routing and bandwidth allocation scenarios with respect to blocking in a packet multiplexer. The framework enables us to formally characterize the routing and bandwidth allocation scenarios that maximize the expected blocking rate along the path of a tagged connection.
Improved Direction-of-Arrival Estimation Using Wavelet Based Denoising Techniques
Authors: R. Sathish, G. V. Anand
Venue: Journal of VLSI Signal Processing Systems (2006)

In this paper, we explore the use of wavelet based denoising techniques to improve the Direction-of-Arrival (DOA) estimation performance of array processors at low SNR. Traditional single sensor wavelet denoising techniques are not suitable for this application since they fail to preserve the intersensor signal correlation. We propose two correlation preserving techniques for denoising multi-sensor signals: (1) the Temporal Wavelet Array Denoising (TWAD) technique developed by Rao and Jones [IEEE Trans. Signal Processing, vol. 48, pp. 1225---1234, 2000], and (2) a new Spatial Wavelet Array Denoising (SWAD) technique. It is shown that SWAD offers the advantage of a significant reduction in computational complexity at the cost of a slight reduction in SNR gain. The denoised array data is used for DOA estimation by the MUSIC algorithm. Simulation results are presented for MUSIC (without denoising), TWAD-MUSIC, and SWAD-MUSIC, to illustrate the improvement in DOA estimation performance brought about by denoising.
HDLQ: A HDL environment for QCA design
Authors: Marco Ottavi, Luca Schiano, Fabrizio Lombardi, Douglas Tougaw
Venue: ACM Journal on Emerging Technologies in Computing Systems (JETC) (2006)

Emerging technologies have attracted a substantial interest in overcoming the physical limitations of CMOS as projected at the end of the Technology Roadmap; among these technologies, quantum-dot cellular automata (QCA) relies on different and novel paradigms to implement dense, low power circuits and systems for high-performance computing. As applicable to existing technologies, a hierarchical process can be utilized to facilitate the design of QCA circuits. Tools and methodologies both at system and physical levels are required to support all design phases. This article presents an HDL model to describe QCA &ldquo;devices&rdquo; (also referred elsewhere in the technical literature as building blocks, i.e., majority voter, inverter, wire, crossover) and facilitate the evaluation of their design. This tool, referred to as HDLQ, allows a designer to verify the logic characteristics of a QCA system, while supporting within a design environment different operational mechanisms (such as fault injection) and the unique features of QCA (such as bidirectionality and timing/clocking partitioning). The applicability of this design environment to various memory circuits for logic and timing verification is presented in detail. Various defective conditions for kinks due to thermodynamic effects and permanent faults due to manufacturing defects are considered for injection.
Monitoring variability of autocorrelated processes using standardized time series variance estimators
Authors: Seong-Hee Kim
Venue: Proceedings of the 38th conference on Winter simulation (2006)

We consider the problem of monitoring variability of autocorrelated processes. This paper combines variance estimation techniques from the simulation literature with a statistical process control chart from statistical process control (SPC) literature. The proposed SPC method does not require any assumptions on the distribution of the underlying process and uses a variance estimate from each batch as a basic observation. The control limits of the chart are determined analytically. The proposed chart is tested using stationary processes with both normal and non-normal marginals.