ppxscal/embedding_network huggingface dataset:
Scatter of journals and literature obsolescence reflected in document delivery requests: Research Articles
Authors: Yaşar Tonta, Yurdagül Ünal
Venue: Journal of the American Society for Information Science and Technology (2005)

In this paper we investigate the scattering of journals and literature obsolescence reflected in more than 137,000 document delivery requests submitted to a national document delivery service. We first summarize the major findings of the study with regards to the performance of the service. We then identify the &ldquo;core&rdquo; journals from which article requests were satisfied and address the following research questions: (a) Does the distribution of (core) journals conform to the Bradford's Law of Scattering? (b) Is there a relationship between usage of journals and impact factors, journals with high impact factors being used more often than the rest? (c) Is there a relationship between usage of journals and total citation counts, journals with high total citation counts being used more often than the rest? (d) What is the median age of use (half-life) of requested articles in general? (e) Do requested articles that appear in core journals get obsolete more slowly? (f) Is there a relationship between obsolescence and journal impact factors, journals with high impact factors being obsolete more slowly? (g) Is there a relationship between obsolescence and total citation counts, journals with high total citation counts being obsolete more slowly? Based on the analysis of findings, we found that the distribution of highly and moderately used journal titles conform to Bradford's Law. The median age of use was 8 years for all requested articles. Ninety percent of the articles requested were 21 years of age or younger. Articles that appeared in 168 core journal titles seem to get obsolete slightly more slowly than those of all titles. We observed no statistically significant correlations between the frequency of journal use and ISI journal impact factors, and between the frequency of journal use and ISI- (Institute for Scientific Information, Philadelphia, PA) cited half-lives for the most heavily used 168 core journal titles. There was a weak correlation between usage of journals and ISI-reported total citation counts. No statistically significant relationship was found between median age of use and journal impact factors and between median age of use and total citation counts. There was a weak negative correlation between ISI journal impact factors and cited half-lives of 168 core journals, and a weak correlation between ISI citation half-lives and use half-lives of core journals. No correlation was found between cited half-lives of 168 core journals and their corresponding total citation counts as reported by ISI. Findings of the current study are discussed along with those of other studies. &copy; 2005 Wiley Periodicals, Inc.
From Crayons to Computers
Authors: Micah Altman, Karin Macdonald, Michael Mcdonald
Venue: Social Science Computer Review (2005)

Following the most recent round of redistricting, observers across the political spectrum warned that computing technology had fundamentally changed redistricting, for the worse. They are concerned that computers enable the creation of finely crafted redistricting plans that promote partisan and career goals, to the detriment of electoral competition, and that, ultimately, thwart voters' ability to express their will through the ballot box. In this article, we provide an overview of the use of computers in redistricting, from the earliest reports of their utilization, through today. We then report responses to our survey of state redistricting authorities'computer use in 1991 and 2001. With these data, we assess the use of computers in redistricting, and the fundamental capabilities of computer redistricting systems.
Classical and Quantum Complexity of the Sturm--Liouville Eigenvalue Problem
Authors: A. Papageorgiou, H. Woźniakowski
Venue: Quantum Information Processing (2005)

We study the approximation of the smallest eigenvalue of a Sturm--Liouville problem in the classical and quantum settings. We consider a univariate Sturm--Liouville eigenvalue problem with a nonnegative function q from the class C2 ([0,1]) and study the minimal number n(¿) of function evaluations or queries that are necessary to compute an ¿-approximation of the smallest eigenvalue. We prove that n(¿)=¿(¿¿1/2) in the (deterministic) worst case setting, and n(¿)=¿(¿¿2/5) in the randomized setting. The quantum setting offers a polynomial speedup with bit queries and an exponential speedup with power queries. Bit queries are similar to the oracle calls used in Grover's algorithm appropriately extended to real valued functions. Power queries are used for a number of problems including phase estimation. They are obtained by considering the propagator of the discretized system at a number of different time moments. They allow us to use powers of the unitary matrix exp((1/2) iM), where M is an n× n matrix obtained from the standard discretization of the Sturm--Liouville differential operator. The quantum implementation of power queries by a number of elementary quantum gates that is polylog in n is an open issue. In particular, we show how to compute an ¿-approximation with probability (3/4) using n(¿)=¿(¿¿1/3) bit queries. For power queries, we use the phase estimation algorithm as a basic tool and present the algorithm that solves the problem using n(¿)=¿(log ¿¿1) power queries, log 2¿¿1 quantum operations, and (3/2) log ¿¿1 quantum bits. We also prove that the minimal number of qubits needed for this problem (regardless of the kind of queries used) is at least roughly (1/2) log ¿¿1. The lower bound on the number of quantum queries is proven in Bessen (in preparation). We derive a formula that relates the Sturm--Liouville eigenvalue problem to a weighted integration problem. Many computational problems may be recast as this weighted integration problem, which allows us to solve them with a polylog number of power queries. Examples include Grover's search, the approximation of the Boolean mean, NP-complete problems, and many multivariate integration problems. In this paper we only provide the relationship formula. The implications are covered in a forthcoming paper (in preparation).
The price of anarchy of finite congestion games
Authors: George Christodoulou, Elias Koutsoupias
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

We consider the price of anarchy of pure Nash equilibria in congestion games with linear latency functions. For asymmetric games, the price of anarchy of maximum social cost is Θ(√N), where N is the number of players. For all other cases of symmetric or asymmetric games and for both maximum and average social cost, the price of anarchy is 5/2. We extend the results to latency functions that are polynomials of bounded degree. We also extend some of the results to mixed Nash equilibria.
Google Hacking for Penetration Testers
Authors: Johnny Long, Ed Skoudis, Alrik van Eijkelenborg
Venue:  (2004)

Google Hacking for Penetration Testers explores the explosive growth of a technique known as "Google Hacking." This simple tool can be bent by hackers and those with malicious intents to find hidden information, break into sites, and access supposedly secure information. Borrowing the techniques pioneered by malicious "Google hackers," this book aims to show security practitioners how to properly protect clients from this often overlooked and dangerous form of information leakage. The sophistication and functionality of Google searches has resulted in several publications boasting Google's superiority to other search engines, providing tips, tricks and even hacks for novice, intermediate, and advanced Internet users. However few of these publications even mention security, and none are written with the IT professional's security tasks in mind. This book not only explores the more obscure and compound features of Google, but it educates the reader how to protect himself against the hacking muscle that this supreme search engine has become. Google.com domain continues to distance itself from the competition and has reached an all-time high in U.S. search referral market share. As of March 23, 2004, Google.com posted a U.S.search referral percentage of nearly 41 percent. Second place competitor and former leading search referral domain, Yahoo.com, posted a referral percentage of 27.40 percent. Google's market dominance is due in large part to the detail, sophistication, and accuracy of the results it provides. These same factors that make Google so useful to the everyday Web surfer are the same ones that make it so dangerous in the hands of a malicious hacker.
The collaborative system strategies
Authors: Amirrudin Kamsin, Mas Idayu Md Sabri
Venue: Proceedings of the 2004 international symposium on Information and communication technologies (2004)

Collaborative system strategies are not just a catch phrase or fad; it is an essential shift in the way IT delivers value to a business. This shift is already underway. Information delivery cycles have been shrinking since businesses began rejecting seven-year projects that rarely finished on time and almost never delivered what was needed seven years later. Development has, by necessity, become iterative and, by definition, must be collaborative.To address the need for more flexible and more responsive information systems, organizations need to establish a development environment that fuses business requirements, development activities, emerging technologies and legacy architectures. Synthesizing these diverse disciplines into information solutions requires collaboration among a wide variety of people. Companies that utilize collaborative system strategies development solutions will turn business requirements into operational applications more quickly and effectively than companies that do not utilize collaborative solutions.
Losers and finders: indexing audio-visual digital media
Authors: Mike Leggett
Venue: Proceedings of the 5th conference on Creativity cognition (2005)

The contemporary burgeoning usage of digital movies, photos, audio and text, their distribution through networks both electronic and physical will be considered in the context of a convergence of these media with a popular interest in personal and community history and identity.The paper introduces interdisciplinary research into human memory as a context for understanding its relation to machine memory and methods of storing and retrieval. It proposes an approach to indexing audio-visual media utilising a time-space representational system, drawing upon a real-world time-space representation as the taxonomy of the indexing procedure.An interactive experimental prototype, PathScape, will be described and evaluated and further practice-based research approaches to author-defined storage and retrieval systems will be outlined.
WebRogue: virtual presence in web sites
Authors: Alessandro Soro, Ivan Marcialis, Davide Carboni, Gavino Paddeu
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

WebRogue is an application for virtual presence over the Web. It provides the Web Browser with a chat subwindow that allows users connected to the same Web site to meet, share opinions and cooperate in a totally free, non moderated and uncensored environment. Each time the user loads a Web page in the Web Browser, WebRogue opens a discussion channel in a centralized server application, that is completely decoupled from the Web server, using the URL of the Web site as a key. Thus whenever a new page is loaded the user can see who is connected, as if entering a physical site. Interactivity is supported by means of two type of commands: comunication commands allow synchronous interaction as with chat or instant messaging software; Social commands allow cooperation: group surfing, exchange of visit-cards and wait in line.
Design of a New Parallel Haptic Device for Desktop Applications
Authors: Florian Gosselin, Jean-Pierre Martins, Catherine Bidard, Claude Andriot, Julien Brisset
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

In this paper, we present a new six degrees of freedom haptic device developed at CEA-LIST for desktop applications emphasizing quick and precise manipulation. This device relies on a light parallel architecture connecting the base of the robot to the mobile platform manipulated by the user. It is dimensioned and optimized to fit design requirements associated with Computer Aided Design or virtual sculpting. The design methodology relies on a geometric and static optimization which takes into account technological constraints associated with the main off the shelf components. The control scheme of this device is also described. Finally, feedback obtained from first integration tests are presented.
Information Navigation Profiles for Mediation and Adaptation
Authors: Ullas Gargi
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

Information retrieval (IR) systems offer a variety of interfaces and interaction modes. A given IR system's interface and interaction mode may not be optimal for a given accessing device/network pair, or desired by a given user. In this paper we propose a set of attributes to characterize IR interfaces, interaction and presentation modes. We call a set of these bound attributes an Information Navigation Profile (INP). We suggest the use of INPs in dynamic adaptation of IR interface, interaction and presentation modes by both origin and proxy servers.
Reinforcement Learning of Player Agents in RoboCup Soccer Simulation
Authors: Abhinav Sarje, Amit Chawre, Shivashankar B. Nair
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

Multi-agent Systems have emerged as an active sub field of Artificial Intelligence. Machine learning techniques have played a significant role by handling the inherent complexity of such systems. Robotic Soccer is a typical multi-agent system, wherein the challenge is to develop and hone the skills of the agents that take part in the game. For an indepth and sophisticated understanding of the game, soccerplaying agents must possess the capability to learn and acquire low-level skills. These skills can later be put together and used to emulate the expertise of experienced players. This paper describes the use of reinforcement learning, a machine learning technique, to acquire the base level skills of intercepting a moving ball. Results of simulation runs using the Robocup Soccer server have also been presented.
Multiple-Description Geometry Compression for Networked Interactive 3D Graphics
Authors: Pavel Jaromersky, Xiaolin Wu, Yi-Jen Chiang, Nasir Memon
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

In web-based visualization applications, such as internet computer games, tele-medicine and so on, 3D geometric data are typically communicated in a distributed and networked environment. The commonly used TCP/IP network protocols can provide reliable transmission, but they often introduce unpredictable delays. On the other hand, users in these applications can tolerate degradation of rendering quality when network conditions deteriorate, but not excessive delay or stoppage of animation sequences.
A network flow approach to cost allocation for rooted trees
Authors: Satoru Iwata, Nozomu Zuiki
Venue: Networks (2004)

In the game theory approach to cost allocation, the main computational issue is an algorithm for finding solutions such as the Shapley value and the nucleolus. In this article, we consider the problem of allocating the maintenance cost of a tree network that connects the supply source at the root to the users at the leaves. We show that the core of the game can be expressed in terms of network flows. Based on this observation, we present O&lpar;n log n&rpar; algorithms for computing the nucleolus and the egalitarian allocation. &copy; 2004 Wiley Periodicals, Inc. NETWORKS, Vol. 44&lpar;4&rpar;, 297&ndash;301 2004
Using treemaps to visualize threaded discussion forums on PDAs
Authors: Björn Engdahl, Malin Köksal, Gary Marsden
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

This paper describes a new way of visualizing threaded discussion forums on compact displays. The technique uses squarified treemaps to render the threads in discussion forums as colored rectangles, thereby using 100% of the limited screen space. We conducted a preliminary user study, which compared the treemap version and a traditional text based tree interface. This showed that the contents of the discussion forum were easily grasped when using a treemap, even though there were in excess of one hundred threads. In particular our technique showed a significant improvement in time for finding the largest and most active threads. Overall, it was shown that the benefits derived from using treemaps on desktop computers are still valid for small screens.
A Two-Stage Level Set Evolution Scheme for Man-Made Objects Detection in Aerial Images
Authors: Guo Cao, Xin Yang, Zhihong Mao
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

A novel two-stage level set evolution method for detecting man-made objects in aerial images is described. The method is based on a modified Mumford-Shah model and it uses a two-stage curve evolution strategy to get a preferable detection. It applies fractal error metric, developed by Cooper[1], et al. at the first curve evolution stage and adds additional constraint- texture edge descriptor that is defined by using DCT (Discrete Cosine Transform) coefficients on the image at the next stage. Man-made objects and natural areas are optimally differentiated by evolving the partial differential equation. The method artfully avoids selecting a threshold to separate the fractal error image, while an improper threshold often results in great segmentation errors. Experiments of the segmentation show that the proposed method is efficient.
Reducing Branch Misprediction Penalty via Selective Branch Recovery
Authors: Amit Gandhi, Haitham Akkary, Srikanth T. Srinivasan
Venue: Proceedings of the 10th International Symposium on High Performance Computer Architecture (2004)

Branch misprediction penalty consists of two components: the time wasted on mis-speculative execution until the mispredicted branch is resolved and the time to restart the pipeline with useful instructions once the branch is resolved. Current processor trends, large instruction windows and deep pipelines, amplify both components of the branch misprediction penalty. In this paper, we propose a novel method, called Selective Branch Recovery (SBR), to reduce both components of branch misprediction penalty. SBR exploits a frequently occurring type of control independence ¿ exact convergence ¿ where the mispredicted path converges exactly at the beginning of the correct path. In such cases, SBR selectively reuses the results computed during mis-speculative execution and obviates the need to fetch or rename convergent instructions again. Thus, SBR addresses both components of branch misprediction penalty. To increase the likelihood of branch mispredictions that can be handled with SBR, we also present an effective means for inducing exact convergence on mis-speculative paths. With SBR, we significantly improve performance (between 3%-22%, average 8%) on a wide range of benchmarks over our baseline processor that does not exploit SBR.
Haptic and audio correlation in user interfaces
Authors: Dessislava Peeva
Venue: Journal of Computing Sciences in Colleges (2004)

With the rising popularity of the internet, user interfaces are becoming increasingly important. The dominant parts of interfaces in Virtual Reality (VR) are not only the visual stimulation, but also the combinations between sounds and textures in the VR world. Lederman (1979) conducted a study in which she investigated the role of touch-produced sounds in the perception of surface texture. She was able to show that subjects were capable of judging roughness on the basis of sounds alone. Auditory judgments were similar, but not identical to corresponding haptic touch judgments. The above suggests that there may be a correlation between audio and texture roughness and it is this topic that we decided to explore further in a VR environment with the use of a haptic tool called the Phantom.
Efficient Power Management Based on Application Timing Semantics for Wireless Sensor Networks
Authors: Octav Chipara, Chenyang Lu, Gruia-Catalin Roman
Venue: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (2005)

This paper proposes Efficient Sleep Scheduling based on Application Timing (ESSAT), a novel power management scheme that aggressively exploits the timing semantics of wireless sensor network applications. We present three ESSAT protocols each of which integrates (1) a lightweight traffic shaper that actively shapes the workload inside the network to achieve predictable timing properties over multiple hops, and (2) a local scheduling algorithm that wakes up nodes just-in-time based on the timing properties of shaped workloads. Our ESSAT protocols have several distinguishing features. First, they can save significant energy with minimal delay penalties. Second, they do not maintain TDMA schedules or communication backbones; as such, they are highly efficient and suitable for resource constrained sensor platforms. Moreover, the protocols are robust in highly dynamic network environments, i.e., they can handle variable multi-hop communication delays and aggregate workloads involving multiple queries, and can adapt to varying workload and network topologies. Our simulations showed that DTS-SS, an ESSAT protocol, achieved an average node duty cycle38-87% lower than SPAN, and query latencies 36-98% lower than PSM and SYNC.
XScale Hardware Acceleration on Cryptographic Algorithms for IPSec Applications
Authors: Hung-Ching Chang, Chun-Chin Chen, Chih-Feng Lin
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

Internet Protocol Security (IPSec) is proposed to provide security services at the IP layer in both the IPv4 and the IPv6 environment. It is composed of a set of protocols that utilizes cryptographic algorithms to encrypt and authenticate packets. This security mechanism has been widely deployed to implement Virtual Private Networks (VPNs). To protect data during transmission and ensure data integration after transmission, both of the forward and the inverse cryptographic operations suffer from a very high cost of computation load. To lower down this cost, various hardware accelerators have been developed to offload these operations from the core CPU. Among them, Intel had integrated three security accelerators in its XScale core. On top of them, we had developed software modules to upgrade the performance of IPSec applications. Results show that acceleration has been achieved. In terms of network throughput, hardwareaided solutions have an average of 2.7 times faster than the software solutions.
Parallel processing of natural language: the Hebrew University
Authors: E. L. Lozinskii, S. Nirenburg
Venue: Issue 79 (January 1982) (1982)

Among the various traditions established in computer processing of natural language during the twenty-odd years of research, the understanding that any such processing is to be done sequentially has a special status.