ppxscal/embedding_network huggingface dataset:
Buying Travel Services on the Internet
Authors: Durant Imboden
Venue:  (2001)

:The world's leading e-commerce association shows how to find the best travel deals online. Looking for rock-bottom prices on airline tickets and car rentals? In search of the perfect hotel or resort? Checking out cruises? Doing research on business desitnations,family vacations,orromantic getaways? Travel already draws more people to the Internet than any other topic - and online travel revenues will reach an astounding $12 billion by 2002,according to The Industry Standard,which tracks Net economy. It all adds up to a huge built-in audience for this taime-saving guide. Like a well-connected travel agent,it takes netsurfing travelers straight to the best deals. Special features include: Guided tours of key sites like Travelocity and City. net; Tips on using Priceline and similar "name your price" services; Advice on comparison-shopping and bargaining; Questions to ask and scams to avoid. Where do you want to go today? Fly direct to the best travel information on the Web! Did you know that travel is the most sought-for topic on the world wide web? With good reason. Wherever you want to go,whatever you want to know,it's there somewhere on the Internet: the cheap fares,the hard-to-find information,the time-saving services. But how do you find what you need without wandering all across cyberspace? Start your trip here: Buying Travel Services on the Internet. Travel writer Durant Imboden and CommerceNet,the foremost nonprofit organization for e-commerce,have done the legwork for you. They sifted thousands of sitesthey even researched the search enginesto collect only the best into one definitive,unibiased guidebook that puts your destination justa click away! Whether you're heading for Machu Pichu or Missoula,on the road for business or pleasure,this URL-packed,globe-trotting,web-navigating guidebook is your best ticket to the most useful,money-saving,and interesting travel-related sites on the Internet. Get right to the sites that help you: comparison shop for airline and cruise bargains virtual-visit almost every spot on earthfrom Algarve to Zimbabwe; check into lodging,from 5-star hotels to eco-campgrounds; rent a car,track a rail route,book a berth on a freighter; map door-to-door travel directions; apply for a passport and visas; plan family vacations,gay/lesbian travel,adventures,and other special-interest trips; prepare with health and safety into,and weather forecasts; calculate currency conversions. 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
PipeRench: A Reconfigurable Architecture and Compiler
Authors: Seth Copen Goldstein, Herman Schmit, Mihai Budiu, Srihari Cadambi, Matt Moe, R. Reed Taylor
Venue: Computer (2000)

With the proliferation of highly specialized embedded computer systems has come a diversification of workloads for computing devices. General-purpose processors are struggling to efficiently meet these applications' disparate needs, and custom hardware is rarely feasible. According to the authors, reconfigurable computing, which combines the flexibility of general-purpose processors with the efficiency of custom hardware, can provide the alternative.PipeRench and its associated compiler comprise the authors' new architecture for reconfigurable computing. Combined with a traditional digital signal processor, microcontroller, or general-purpose processor, PipeRench can support a system's various computing needs without requiring custom hardware.The authors describe the PipeRench architecture and how it solves some of the preexisting problems with FPGA architectures, such as logic granularity, configuration time, forward compatibility, hard constraints, and compilation time.
From control effects to typed continuation passing
Authors: Hayo Thielecke
Venue: Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (2003)

First-class continuations are a powerful computational effect, allowing the programmer to express any form of jumping. Types and effect systems can be used to reason about continuations, both in the source language and in the target language of the continuation-passing transform. In this paper, we establish the connection between an effect system for first-class continuations and typed versions of continuation-passing style. A region in the effect system determines a local answer type for continuations, such that the continuation transforms of pure expressions are parametrically polymorphic in their answer types. We use this polymorphism to derive transforms that make use of effect information, in particular, a mixed linear/non-linear continuation-passing transform, in which expressions without control effects are passed their continuations linearly.
Evaluation of the performance of ID systems in a switched and distributed environment: the real secure case study
Authors: Charles Iheagwara, Andrew Blyth
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2002)

With the phenomenal increase of unwarranted Internet traffic into corporate networks the need for the development and effective use of currently available intrusion detection (ID) systems has acquired great importance. Compounding this is the constantly evolving techniques by professional hackers to defeat any and every counter measure designed to stem or at least contain their acts.In this paper, we present the results of tests conducted to assess the effectiveness of intrusion detection system in a switched and distributed network environment. The results reveal that the performance of ID systems is a function of various factors including network topology, deployment techniques, and network throughput, bandwidth and network traffic conditions.Within the limits of our studies, the findings can be summarized as: 1. The detection capability of the ID system diminishes with increase in bandwidth utilization with the obvious implication that better performance could be achieved with the use of multiple sensors. 2. Deployment at network or domain entry points i.e. outside decoy provides better performance results by up to 11%. 3. Deployment with packet loss limiting devices produces a better result than deployment with the port mirroring technique by up to 27%.
Neural Networks and Knowledge Engineering
Authors: Y. -H. Pao, D. J. Sobajic
Venue: IEEE Transactions on Knowledge and Data Engineering (1991)

A brief overview is given of the nature of present day artificial neural net computing and the authors emphasize the theme that in this mode of computing, knowledge is not represented symbolically, but in the form of distributed processing and localized decision rules. The authors propose that in neural-net computing, the processing is the representation. In other words, the very nature of the processing encodes the knowledge. There is no place and no need for a separate body of global rules to be used by the network for inferencing. If rules exist at all, they are in the nature of local processing steps carried out at individual processors in response to stimuli from other neurons. The authors develop this theme together with a theme which is closely related to it. The second notion is that neural networks may also be thought of and implemented in terms of heterogeneous networks, rather than always or only in terms of massive arrays of identical elemental processors.
Surfactant mediated growth of silicides
Authors: S. Teichert, H. Hortenbach, G. Beddies, H.-J. Hinneberg
Venue: Microelectronic Engineering (2002)

The surfactant mediated growth of several silicides is reported. The preparation of MnSi1.7, TiSi2 and NiSi2 was carried out by reactive deposition of the metals onto Si(001) and onto Sb terminated Si(001) at substrate temperatures between 400 and 600°C. In case of MnSi1.7, the application of Sb as surfactant strongly increased the silicide island density. In case of TiSi2, a suppression of pinhole formation due to the surfactant was observed. For NiSi2 an enhanced diffusion of Ni was found with respect to the not terminated Si(001) substrate resulting in the formation of larger silicide islands. During the silicide growth process the Sb used for the termination of the Si substrate segregates to the surface of the samples. No remarkable desorption or incorporation of Sb is observed for all the investigated silicides.
The platform for privacy preference as a social protocol: An examination within the U.S. policy context
Authors: Harry Hochheiser
Venue: ACM Transactions on Internet Technology (TOIT) (2002)

As a "social protocol" aimed at providing a technological means to address concerns over Internet privacy, the Platform for Privacy Preferences (P3P) has been controversial since its announcement in 1997. In the U.S., critics have decried P3P as an industry attempt to avoid meaningful privacy legislation, while developers have portrayed the proposal as a tool for helping users make informed decisions about the impact of their Web surfing choices. This dispute touches upon the privacy model underlying P3P, the U.S. political context regarding privacy, and the technical components of the protocol. This article presents an examination of these factors, with an eye towards distilling lessons for developers of future social protocols.
New, Faster Algorithms for Supervised Competitive Learning: Counterpropagation and Adaptive-Resonance Functionality
Authors: Granino A. Korn
Venue: Neural Processing Letters (1999)

Hecht-Nielsen&lsquo;s counterpropagation networks often learn to associate input and output patterns more quickly than backpropagation networks. But simple competitive learning cannot separate closely spaced input patterns without adaptive-resonance-like (ART) functionality which prevents neighboring patterns from &rsquo;stealing&lsquo; each other&lsquo;s templates. We demonstrate &rsquo;pseudo-ART&lsquo; functionality with a new, simple, and very fast algorithm which requires no pattern normalization at all. Competition can be based on either Euclidean or L1-norm matching. In the latter case, the new algorithm emulates fuzzy ART. We apply the pseudo-ART scheme to several new types of counterpropagation networks, including one based on competition among combined input/output patterns, and discuss application with and without noise.
Finite element simulations of orthotropic hyperelasticity
Authors: Jeffrey E. Bischoff, Ellen M. Arruda, Karl Grosh
Venue: Finite Elements in Analysis and Design (2002)

Given the geometry and boundary conditions that characterize most in vivo tests on biological soft tissue as well as the material heterogeneity that can be present in both in vivo or in vitro tests, it is often necessary to use finite elements to model the response of tissue to a specified loading protocol. The ability of ABAQUS to simulate such tests is explored using a newly developed, microstructurally-based orthotropic hyperelastic constitutive law. Simulations are performed to model simple tests for which there are "exact" solutions in order to verify the implementation of the constitutive law into ABAQUS and more complex boundary value problems are simulated to explore the limits of the computational model.
Testing properties of directed graphs: acyclicity and connectivity
Authors: Michael A. Bender, Dana Ron
Venue: Random Structures Algorithms (2002)

This article initiates the study of testing properties of directed graphs. In particular, the article considers the most basic property of directed graphs--acyclicity. Because the choice of representation affects the choice of algorithm, the two main representations of graphs are studied. For the adjacency-matrix representation, most appropriate for dense graphs, a testing algorithm is developed that requires query and time complexity of Õ(1/ε2), where ε is a distance parameter independent of the size of the graph. The algorithm, which can probe the adjacency matrix of the graph, accepts every graph that is acyclic, and rejects, with probability at least 2/3, every graph whose adjacency matrix should be modified in at least ε fraction of its entries so that it becomes acyclic. For the incidence list representation, most appropriate for sparse graphs, an Ω(|V|1/3) lower bound is proved on the number of queries and the time required for testing, where V is the set of vertices in the graph. Along with acyclicity, this article considers the property of strong connectivity. Contrasting upper and lower bounds are proved for the incidence list representation. In particular, if the testing algorithm can query on both incoming and outgoing edges at each vertex, then it is possible to test strong connectivity in Õ(1/ε) time and query complexity. On the other hand, if the testing algorithm only has access to outgoing edges, then Ω(√N) queries are required to test for strong connectivity.
Buffer Analysis for a Data Sharing Environment with Skewed Data Access
Authors: A. Dan, D. M. Dias, P. S. Yu
Venue: IEEE Transactions on Knowledge and Data Engineering (1994)

Examines the effect of skewed database access on the transaction response time in a multisystem data sharing environment, where each computing node has access to shared data on disks, and has a local buffer of recently accessed granules. Skewness in data access can increase data contention since most accesses go to few data items. For the same reason, it can also increase the buffer hit probability. We quantify the resultant effect on the transaction response time, which depends not only on the various system parameters but also on the concurrency control (CC) protocol. Furthermore, the CC protocol can give rise to rerun transactions that have different buffer hit probabilities. In a multisystem environment, when a data block gets updated by a system, any copies of that block in other systems' local buffers are invalidated. Combining these effects, we find that higher skew does not necessarily lead to worse performance, and that with skewed access, optimistic CC is more robust than pessimistic CC. Examining the buffer hit probability as a function of the buffer size, we find that the effectiveness of additional buffer allocation can be broken down into multiple regions that depend on the access frequency distribution.
Cache performance in vector supercomputers
Authors: L. I. Kontothanassis, R. A. Sugumar, G. J. Faanes, J. E. Smith, M. L. Scott
Venue: Proceedings of the 1994 ACM/IEEE conference on Supercomputing (1994)

Traditional supercomputers use a flat multi-bank SRAM memory organization to supply high bandwidth at low latency. Most other computers use a hierarchical organization with a small SRAM cache and slower, cheaper DRAM for main memory. Such systems rely heavily on data locality for achieving optimum performance. This paper evaluates cache-based memory systems for vector supercomputers. We develop a simulation model for a cache-based version of the Cray Research C90 and use the NAS parallel benchmarks to provide a large scale workload. We show that while caches reduce memory traffic and improve the performance of plain DRAM memory, they still lag behind cacheless SRAM. We identify the performance bottle-necks in DRAM-based memory systems and quantify their contribution to program performance degradation. We find the data fetch strategy to be a significant parameter affecting performance, evaluate the performance of several fetch policies, and show that small fetch sizes improve performance by maximizing the use of available memory bandwidth.
Line Pattern Retrieval Using Relational Histograms
Authors: Benoit Huet, Edwin R. Hancock
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1999)

This paper presents a new compact shape representation for retrieving line-patterns from large databases. The basic idea is to exploit both geometric attributes and structural information to construct a shape histogram. We realize this goal by computing the N-nearest neighbor graph for the lines-segments for each pattern. The edges of the neighborhood graphs are used to gate contributions to a two-dimensional pairwise geometric histogram. Shapes are indexed by searching for the line-pattern that maximizes the cross correlation of the normalized histogram bin-contents. We evaluate the new method on a database containing over 2,500 line-patterns each composed of hundreds of lines.
Reliability Analysis in Distributed Systems
Authors: C. S. Raghavendra, V. K. P. Kumar, S. Hariri
Venue: IEEE Transactions on Computers (1988)

Reliability of a distributed processing system is an important design parameter that can be described in terms of the reliability of processing elements and communication links and also of the redundancy of programs and data files. The traditional terminal-pair reliability does not capture the redundancy of programs and files in a distributed system. Two reliability measures are introduced: distributed program reliability, which describes the probability of successful execution of a program requiring cooperation of several computers, and distributed system reliability, which is the probability that all the specified distributed programs for the system are operational. These two reliability measures can be extended to incorporate the effects of user sites on reliability. An efficient approach based on graph traversal is developed to evaluate the proposed reliability measures.
Architectural Considerations for CPU and Network Interface Integration
Authors: Charles D. Cranor, R. Gopalakrishnan, Peter Z. Onufryk
Venue: IEEE Micro (2000)

The authors describe UNUM, an architecture for integrating communications functionality into the CPU. UNUM not only simplifies the design of communications processors but also improves their performance and provides them with greater flexibility.
Complete System of Equivalent Transformations for Multitape Automata
Authors: V. E. Khachatryan
Venue: Programming and Computing Software (2003)

A classical model of computations&mdash;multitape automata&mdash;is considered. For any n, n &ge; 2, a system of equivalent transformations that is complete in the set of all n-tape automata is constructed.
Electrical properties of TiSi2 clusters in poly Si
Authors: A. M. Piro, M. S. Alessandrino, C. Bongiorno, F. La Via, C. Spinella, M. G. Grimaldi
Venue: Microelectronic Engineering (2002)

Clusters of TiSi2 were formed in a polysilicon matrix by thermal annealing of a Ti-Si multilayer structure. The silicide grain size was varied by suitable thermal treatments. The DC electrical resistivity of the composite material has been measured in the 4-500 K temperature range by van der Pauw technique. Structural characterisation was performed by transmission electron microscopy equipped with an electron energy loss spectrometer. The dependence of resistivity on temperature indicated that at low temperature the electric transport occurs by percolation through connected TiSi2 grains, whilst at high temperature hopping between insulated grain dominates. The volume fraction of percolating grains and the hopping probability has been derived from the fit of the experimental data.
The Art of Massive Storage: A Web Image Archive
Authors: Nisha Talagala, Satoshi Asami, David Patterson, Bob Futernick, Dakin Hart
Venue: Computer (2000)

The advent of the World Wide Web and the decreasing cost of disk drives have made it possible to store and disseminate information at a rate unimagined a decade ago. For several thousand dollars, individuals today can save online an amount of text equal to all the information they will read and hear in their lifetimes. Storehouses of Internet-accessible information range from personal-photography and image collections to large-scale FTP sites and digital libraries with geographical image data and video. Museums and libraries are beginning to open this storage cornucopia to the world by digitizing their collections and placing them on the Web.The authors describe the issues they faced in the design and management of their own Web-based image collection, the Thinker ImageBase, containing more than 75,000 images of artwork from the Fine Arts Museums of San Francisco.The authors focus on two requirements. First, the sys-tem must be accessible to people using various Internet connections. Second, it must provide as much information, as many images, and as much detail within an image as possible. To meet these requirements, user interface and storage hardware are key.
The Circulating Processor Model of Parallel Systems
Authors: Amy W. Apon, Larry W. Dowdy
Venue: IEEE Transactions on Computers (1997)

This paper introduces the circulating processor model for parallel computer systems. Models of parallel systems tend to be computationally complex due to synchronization constraints such as task forking and joining. However, product form queuing network models remain computationally efficient as the size of the system grows by calculating only the mean performance metrics of the system. The circulating processor model is a product form queuing network model that differs from more traditional models in that the processors circulate among the parallel applications. In traditional models, the tasks of the parallel application circulate among the processors. Behaviors such as forking and joining of tasks and barrier synchronizations are better captured using this new approach. The circulating processor model may be load-dependent or load-independent. For systems that contain a single parallel application, the load-dependent circulating processor model is exact, while the load-independent model is not. In the latter case, an exact error can be calculated. For systems that contain multiple parallel applications, the load-dependent circulating processor model is a good approximation to the actual system, while the load-independent model is not. A case study using Parallel Virtual Machine (PVM) on a network of workstations illustrates the applicability of the circulating processor model.
Varying rendering fidelity by exploiting human change blindness
Authors: Kirsten Cater, Alan Chalmers, Colin Dalton
Venue: Proceedings of the 1st international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2003)

The complexity of most virtual environments prevents them being rendered in real time even on modern graphics hardware. Knowledge of the visual system of the user viewing the environment may be used to significantly reduce image computation times. In this paper, we demonstrate the principle of Change Blindness, a major side effect of brief visual disruptions, including an eye saccade, a flicker, or a blink, where portions of the scene that have changed simultaneously with the visual disruption go unnoticed to the viewer. The onset of the visual disruption inhibits visual attention by swamping the user's local motion signals, short-circuiting the automatic system that normally draws attention to the change location. Without automatic control, attention is controlled entirely by slower, higher-level mechanisms in the visual system, that search the scene, object by object, until attention finally focuses on the object that is changing.Previous work in perception-based rendering has exploited human visual acuity, to control detail (and therefore time) spent on rendering parts of a scene. In our experiment we show that if changes in rendering detail occur when there is a visual disruption, then visual attention to the change is dramatically slowed as in natural scenes. Therefore, if the principal is used in dynamic animations the change will have passed through the visual field without notice before the viewers' attention has picked up the change. Our results clearly show that flaws in the human visual system, such as Change Blindness, can be exploited to reduce rendering times substantially without compromising perceived visual quality.