ppxscal/embedding_network huggingface dataset:
Search engines
Authors: Glen Harmon
Venue: Journal of Computing Sciences in Colleges (2004)

Search engines are like an index for a book of the Internet. Using automated programs called bots, search engines organize the web and make it possible for users to quickly acquire data from the millions of pages on the web. 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
The SLATEC mathematical subroutine library
Authors: W. H. Vandevender, K. H. Haskell
Venue: ACM SIGNUM Newsletter (1982)

The SLATEC Common Mathematical Subroutine Library is an experiment in resource sharing by the computing departments of several Department of Energy Laboratories. The objective is to cooperatively assemble and install at each site a mathematical subroutine library characterized by portability, good numerical technology, good documentation, robustness, and quality assurance. The result is a portable Fortran mathematical subroutine library of over 130,000 lines of code.Much of the following report is based on [1], a chapter to be included in a forthcoming book about mathematical software.
User feedback based enhancement in web search quality
Authors: M. M. Sufyan Beg
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2005)

Of late, there has been a paradigm shift in web searching from the content based searching to the connectivity based or more commonly known as hyperlink based (or simply link based) searching. But, both the content based approach as well as the link based approach are objective ones, which are totally dependent on the effectiveness of their "feature extraction" mechanisms, with no apparent consideration to the preference of the searcher. In this work, a "user satisfaction" guided web search procedure is proposed. We calculate the importance weight of each document viewed by the user based on the feedback vector obtained from his actions. This document weight is then used to update the index database in such a way that the documents being consistently preferred go up the ranking, while the ones being neglected go down. Our simulation results show a steady rise in the satisfaction levels of the modeled users as more and more learning goes into our system. We also propose a couple of novel additions to the web search querying techniques.
The Latest in VPNs: Part II
Authors: Chris Metz
Venue: IEEE Internet Computing (2004)

In part I of this series,we defined a virtual private network (VPN) as a discrete network entity configured and operated over a public or private shared network infrastructure. We now turn our attention to an equally important type of VPN that is generating much interest and activity in the industry. A Layer-2 VPN (L2VPN) is defined as a VPN that transports native L2 frames across a shared IP or MPLS packet switch network (PSN). The L2 frames can be frame relay protocol data units, ATM cells, or even Ethernet frames and are carried across the PSN using one of several different tunnel encapsulation schemes.
A web-based learning system with the framework of linking explanations of related knowledge to web pages
Authors: Hiroyuki Mitsuhara, Youji Ochi, Yoneo Yano
Venue: Systems and Computers in Japan (2004)

In exploratory learning using Web pages, the learner tries to understand a visited page by recalling and applying related knowledge. The learner also refers to and applies explanations of the related knowledge if access is possible. The expectation is that the knowledge used in understanding various pages will be organized and integrated, and will be stabilized in the memory. The purpose of this study is to develop a WBL (Web-based learning) system that assists such knowledge stabilization. The authors consider that the most fundamental knowledge stabilization assistance consists of helping the learner refer to and apply explanations of related knowledge from the visited page. Consequently, this paper proposes a framework in which related knowledge is linked to Web pages, and presents a WBL system based on such a framework. The effectiveness of the proposed system is investigated through an experiment. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(10): 102&ndash;113, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10517
Automatic cell placement for quantum-dot cellular automata
Authors: Ramprasad Ravichandran, Sung Kyu Lim, Mike Niemier
Venue: Integration, the VLSI Journal (2005)

Quantum-dot cellular automata (QCA) is a novel nano-scale computing mechanism that can represent binary information based on spatial distribution of electron charge configuration in chemical molecules. In this paper we develop the first cell-level placement of QCA circuits under buildability constraints. We formulate the QCA cell placement as a unidirectional geometric embedding of k-layered bipartite graphs. We then present an analytical and a stochastic solution for minimizing the wire crossings and wire length in these placement solutions.
Spatial Orientation in Buildings Using Models with Haptic Feedback
Authors: Ludek Pokluda, Jiri Sochor
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

Techniques and experiments described in this article explore several ways of accessing spatial information by blind people using a computer with a force-feedback device. This study focuses on approaches supporting orientation inside buildings. Preliminary results show that a wide spectrum of different techniques tuned to the individual needs of blind people should be offered.
Pseudorandom generators for low degree polynomials
Authors: Andrej Bogdanov
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

We investigate constructions of pseudorandom generators that fool polynomial tests of degree d in m variables over finite fields F. Our main construction gives a generator with seed length O(d4 log m (1 + log(d ⁄ ε) ⁄ log log m) + log |F|) bits that achieves arbitrarily small bias ε and works whenever |F| is at least polynomial in d, log m, and 1⁄ε. We also present an alternate construction that uses a seed that can be described by O(c2d8m6⁄(c-2) log(d⁄ε) + log |F|) bits (more precisely, O(c2d8m6⁄(c-2)) field elements, each chosen from a set of size poly(cd⁄ε), plus two field elements ranging over all of F), works whenever |F| is at least polynomial in c, d, and 1⁄ε, and has the property that every element of the output is a function of at most c field elements in the input. Both generators are computable by small arithmetic circuits. The main tool used in the construction is a reduction that allows us to transform any "dense" hitting set generator for polynomials into a pseudorandom generator.
Bideterministic automata and minimal representations of regular languages
Authors: Hellis Tamm, Esko Ukkonen
Venue: Theoretical Computer Science (2004)

Bideterministic automata are deterministic automata with the property of their reversal automata also being deterministic. It has been known that a bideterministic automaton is the minimal deterministic automaton accepting its language. This paper shows that any bideterministic automaton is the unique minimal automaton among all (including nondeterministic) automata accepting the same language. We also present a more general result that shows that under certain conditions a minimal deterministic automaton accepting some language or the reversal of the minimal deterministic automaton of the reversal language is a minimal automaton representation of the language. These conditions can be checked in polynomial time.
Practical uses for AI research
Authors: Alan E. Filsinger
Venue: Issue 80 (April 1982) (1982)

AI research is sometimes believed to be an area of limited practicality. A discussion of a few applications of AI to practical uses may help some to have a less limited view of the field.
Establishing pairwise keys in distributed sensor networks
Authors: Donggang Liu, Peng Ning, Rongfang Li
Venue: ACM Transactions on Information and System Security (TISSEC) (2005)

Pairwise key establishment is a fundamental security service in sensor networks; it enables sensor nodes to communicate securely with each other using cryptographic techniques. However, due to the resource constraints on sensor nodes, it is not feasible to use traditional key management techniques such as public key cryptography and key distribution center (KDC). A number of key predistribution techniques have been proposed for pairwise key establishment in sensor networks recently. To facilitate the study of novel pairwise key predistribution techniques, this paper develops a general framework for establishing pairwise keys between sensor nodes using bivariate polynomials. This paper then proposes two efficient instantiations of the general framework: a random subset assignment key predistribution scheme, and a hypercube-based key predistribution scheme. The analysis shows that both schemes have a number of nice properties, including high probability, or guarantee to establish pairwise keys, tolerance of node captures, and low storage, communication, and computation overhead. To further reduce the computation at sensor nodes, this paper presents an optimization technique for polynomial evaluation, which is used to compute pairwise keys. This paper also reports the implementation and the performance of the proposed schemes on MICA2 motes running TinyOS, an operating system for networked sensors. The results indicate that the proposed techniques can be applied efficiently in resource-constrained sensor networks.
New media effects: Do formats organize networks?: Research Articles
Authors: Richard Rogers
Venue: Complexity (2005)

New media networks differ from old media networks in the sense that for the press, TV, and radio, the formats are more established. To old media one sends a press release, a prepared sound bite, or an edited video can. One organizes a scripted event and invites journalists in the hopes that the story eventually told adheres to the prepared text and overall narrative. But what does one send to a network? Does one send information in the &ldquo;old media&rdquo; formats? What does a network do with a press release? Are certain formats routinely filed away or deleted, while others tend to circulate in networks, creating &ldquo;new media network effects?&rdquo; The work treats formats broadly and also makes distinctions between various kinds of new media networks&ndash;social networks, issue networks, and stranger networks. In a discussion of the formats circulated and network behaviors effected by the Association of Progressive Communications&mdash;a highly professionalized civil society network actor in the field of information and communications policy&mdash;the purpose of the article is to open up avenues of thought into how different formats operate in various types of networks, and in particular, whether formats may organize new media networks and, perhaps, social movements. &copy; 2005 Wiley Periodicals, Inc. Complexity 10: 22&ndash;34, 2005This paper was submitted as part of the Special Issue: Understanding Complex Systems (Complexity, Vol. 10&#x002F;No. 3 and No. 4)
What's New in Mac OS X Tiger: Peachpit Learning Series (Apple Training)
Authors: Robin Williams
Venue:  (2005)

If you want to tame Mac OS X Tiger, but you want to do so in the comfort of your own home, this guide makes it possible! Robin Williams uses her trademark friendly teaching style to reveal exactly what you want to know: What's new in Tiger, what's great about it, and how can you get the most out of it fast! Focused lessons take you step-by-step through practical, real-world projects that teach Mac OS X Tiger inside and out. Covers everything from upgrading your Mac to Tiger and customizing and troubleshooting your system to all of Tiger's new goodies: configuring the spoken-user interface, audio and video messaging with multiple people at once, a Dashboard full of Widgets, the innovative Spotlight Search system, the enhanced Safari RSS browser, and more.
Automatic impostor placement for guaranteed frame rates and low memory requirements
Authors: Stefan Jeschke, Michael Wimmer, Heidrun Schumann, Werner Purgathofer
Venue: Proceedings of the 2005 symposium on Interactive 3D graphics and games (2005)

Impostors are image-based primitives commonly used to replace complex geometry in order to reduce the rendering time needed for displaying complex scenes. However, a big problem is the huge amount of memory required for impostors. This paper presents an algorithm that automatically places impostors into a scene so that a desired frame rate and image quality is always met, while at the same time not requiring enormous amounts of impostor memory. The low memory requirements are provided by a new placement method and through the simultaneous use of other acceleration techniques like visibility culling and geometric levels of detail.
How to Do Everything with Your eBay Business, Second Edition, 2 edition
Authors: Greg Holden
Venue:  (2005)

This user-friendly book shows you how to turn the satisfaction and excitement of eBay sales into a lucrative small business--and possibly even a full-time job! Find out how to establish a seller’s account, post attention-getting auction listings, and build confidence among bidders. Author Greg Holden explains how to apply the secrets of successful brick and mortar businesses to the online world. After learning the ropes, you'll find out how to boost sales with techniques such as no-reserve selling and “buy it now” pricing. Plus--tips for locating inventory, implementing marketing plans, and getting free advertising are revealed.
Prediction of Minor Head Injured Patients Using Logistic Regression and MLP Neural Network
Authors: Fatih S. Erol, Hadi Uysal, Uçman Ergün, Necaattin Barişçi, Selami Serhatholu, Firat Hardalaç
Venue: Journal of Medical Systems (2005)

In this study it is aimed to assess the posttraumatic cerebral hemodynamia in minor head injured patients. Eighty patients with minor head injury (Group 1) evaluated in the early 8 h of posttraumatic period between July 2003 and February 2004. The control group (Group 2) has composed of 32 healthy people. Bilateral blood flow velocities of middle cerebral arteries (MCA) had measured using transtemporal technique while internal carotid arteries were evaluated by submandibular examination. Two different mathematical models such as the traditional statistical method on the basis of logistic regression and a multi-layer perceptron (MLP) neural network are used to classify the age, sex, velocitiy parameters of MCA, mean velocity of extracranial ICAs and VMCA/ VICA ratios. The neural network was trained, cross-validated and tested with subject's transcranial Doppler signals. As a result of these classifications, we found the success rate of logistic regression, the success rate of MLP neural network is 88.2 and 89.1%, respectively. The classification results show that MLP neural network is offering the best results in the case of diagnosis.
Teaching human aspects of software engineering
Authors: Orit Hazzan, Jim Tomayko
Venue: Proceedings of the 27th international conference on Software engineering (2005)

This paper highlights the teaching of human aspects of software engineering, by presenting a course that deals with this topic. Specifically, this paper outlines the course's objective and structure, and, as the CfP asks, suggests two challenges an instructor of software engineering faces today.
Alternate Testing of RF Transceivers Using Optimized Test Stimulus for Accurate Prediction of System Specifications
Authors: Soumendu Bhattacharya, Achintya Halder, Ganesh Srinivasan, Abhijit Chatterjee
Venue: Journal of Electronic Testing: Theory and Applications (2005)

In the recent past, with the emergence of System-on-Chip (SoC), focus has shifted towards testing system specifications rather than device or module specifications. While the problem of test accessibility for test stimulus application and response capture for such high-speed systems remains a challenge to the test engineers, new test strategies are needed which can address the problem in a practical manner. In this paper, the problem of testing the transmitter and the receiver subsystems of a RF transceiver for system level specification is addressed. Instead of using different conventional test stimuli for testing each of the system level specifications of RF subsystems, a specially crafted test stimulus is used for testing all the specifications from the response of the subsystem-under-test. A new simulation approach has also been developed to perform fast behavioral simulations in frequency domain for the system-under-test. In the test method, frequency domain test response spectra are captured and non-linear regression models are constructed to map the spectral measurements onto the specifications of interest. In the presented simulation results, the test stimuli have been validated using netlist level simulation of the subsystem-under-test and specifications have been predicted within an error of ±3% of the actual value.
An efficient way to filter out data dependences with a sufficiently large distance between memory references
Authors: Patricio Bulić, Veselko Guštin
Venue: ACM SIGPLAN Notices (2005)

There are a number of data dependence tests that have been proposed in the literature. The most widely used approximate data dependence tests are the Banerjee inequality and the GCD test. In this paper we consider parallelization for microprocessors with the multimedia extensions. For the short SIMD parallelism extraction it is essential that, if dependency exists, then the distance between memory references is greater than or equal to the number of data processed in the SIMD register. This implies that some loops that could not be vectorized on traditional vector processors can still be parallelized for the short SIMD execution. In this paper we present an accurate and simple method that can filter out data dependences with a sufficiently large distance between memory references for linear array references within a nested loop. The presented method is suitable for use in a dependence analyzer that is organized as a series of tests, progressively increasing in accuracy, as a replacement for the GCD or Banerjee tests.
Cooperative Learning and Web Applications: A Case Study
Authors: Nicoletta Sala
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

Recent advances in the Internet technologies and in the World Wide Web can promote the cooperative learning (CL) that is a teaching strategy in which small teams, each composed by students of different levels of ability, use different learning activities to improve their understanding of a subject. This paper focuses on a study which analyses 45 high school students' cognitive abilities while are developing a database available online that contains the students evaluations, using cooperative learning and the "Learning by Doing" environment. The database has been protected with passwords to realise different level of priority to read (e.g, principal, school manager, parents and students). This project has been developed in the Laboratory of System and Techniques of Transmission (three hours in the week throughout the school year) in a High School in Italy, under the control of a professor of Università della Svizzera italiana (University of Lugano, Switzerland).
Analysis of hop-distance relationship in spatially random sensor networks
Authors: Serdar Vural, Eylem Ekici
Venue: Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing (2005)

In spatially random sensor networks, estimating the Euclidean distance covered by a packet in a given number of hops carries a high importance for various other methods such as localization and distance estimations. The inaccuracies in such estimations motivate this study on the distribution of the Euclidean distance covered by a packet in spatially random sensor networks in a given number of hops. Although a closed-form expression of distance distribution cannot be obtained, highly accurate approximations are derived for this distribution in one dimensional spatially random sensor networks. Using statistical measures and numerical examples, it is also shown that the presented distribution approximation yields very high accuracy even for small number of hops. A discussion on how these principles can be extended to the analysis of the same problem in two dimensional networks is also provided.
Reconfigurable Address Generators for Stream-Based Computation Implemented on FPGAs
Authors: Kjetil E. Vistnes, Oddvar Sorasen
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 3 - Volume 04 (2005)

This paper describes the design and implementation of an address generator for stream-based computation. The unit can generate addresses by a 1, 2 or 3-dimensional mapping from a linear data string in memory. A processing unit will get the required data in a continuous stream without empty time slots, even when switching between addressing algorithms. Each algorithm is specified by a set of parameters loaded into FIFOs in background. The unit is specified by VHDL, simulated, synthesized and implemented on an FPGA of type Xilinx Virtex-II Pro. A speed of 144 MHz is obtained for generating 36 bit addresses. Ideas for expanding the flexibility of the unit is discussed.
M-ECho: a middleware for morphable data-streaming in pervasive systems
Authors: Himanshu Raj, Karsten Schwan, Ripal Nathuji
Venue: Proceedings of the 2005 workshop on End-to-end, sense-and-respond systems, applications and services (2005)

The end-to-end performance of pervasive mobile systems is commonly dictated by the availability of resources at the weakest link. However, a number of run-time adaptations or morphing steps can be performed to tune the system performance. In this paper, we present M-ECho, a middleware for system morphing. M-ECho is designed with focus on data streaming applications, specifically in the field of pervasive mobile systems. We consider an autonomous robotics application comprising of a set of cooperating mobile robots to demonstrate and evaluate M-ECho's system morphing capabilities. Optimizations are based upon metrics of average instantaneous power consumption at a single node (local) as well as the power consumed by all participants (global). Experimental results show that M-ECho is able to achieve improved end-to-end performance with its dynamic code morphing techniques.
Handling Heterogeneity in Shared-Disk File Systems
Authors: Changxun Wu, Randal Burns
Venue: Proceedings of the 2003 ACM/IEEE conference on Supercomputing (2003)

We develop and evaluate a system for load management in shared-disk file systems built on clusters of heterogeneous computers. The system generalizes load balancing and server provisioning. It balances file metadata workload by moving file sets among cluster server nodes. It also responds to changing server resources that arise from failure and recovery and dynamically adding or removing servers. The system is adaptive and self-managing. It operates without any a-priori knowledge of workload properties or the capabilities of the servers. Rather, it continuously tunes load placement using a technique called adaptive, non-uniform (ANU) randomization. ANU randomization realizes the scalability and metadata reduction benefits of hash-based, randomized placement techniques. It also avoids hashing's drawbacks: load skew, inability to cope with heterogeneity, and lack of tunability. Simulation results show that our load-management algorithm performs comparably to a prescient algorithm.