ppxscal/embedding_network huggingface dataset:
The Categorisation of Hidden Web Databases through Concept Specificity and Coverage
Authors: Yih-Ling Hedley, Muhammad Younas, Anne James
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

Hidden Web databases maintain a collection of specialised documents, which are dynamically generated in response to usersý queries. The categorisation of such databases into a set of pre-defined categories has been widely employed to assist users in their information searches. In this paper we present a technique that automatically categorises a document database through its content summary and concepts described by their specificity and coverage. Experimental Results show that our approach categorises databases with a larger number of relevant categories.
Impact of the proposed IEEE floating point standard on numerical software
Authors: W. J. Cody
Venue: ACM SIGNUM Newsletter (1979)

The proposed IEEE Floating Point Standard, which is being prepared with unprecedented reliance on the advice of experienced numerical analysts, appears to be the answer to long-standing pleas for sensible floating-point arithmetic systems. The committee drafting the standard has not settled some of the details, but it has agreed that the standard is intended to encourage high-quality numerical programming. To this end the committee agrees on basic arithmetic operations that round correctly and are otherwise clean and free of anomalies. Many of us applaud that accomplishment and eagerly await the appearance of standard-conforming machines. Our frustrations with arithmetic systems in which multiplication is not commutative, in which X+X differs from 2.0&times;X by a decimal place or more, and in which the least significant half of a double precision number underflows and flushes to zero independent of the most significant half thus abruptly dropping the computation to single precision (without warning, of course) are almost over. The new machines will have none of these or the even more exotic mathematical atrocities existing in our current machines. But our joy at the dream we see materializing before our eyes must be tempered by the realization that the new machines will not solve all of our problems immediately and may even introduce a few new ones.
Resilient Capacity-Aware Multicast Based on Overlay Networks
Authors: Zhan Zhang, Shigang Chen, Yibei Ling, Randy Chow
Venue: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (2005)

The global deployment of IP multicast has been slow due to the difficulties related to heterogeneity, scalability, manageability, and lack of a robust inter-domain multicast routing protocol. Application-level multicast becomes a promising alternative. Many overlay multicast systems have been proposed in recent years. However, they are insufficient in supporting applications that require large-scale any-source multicast with highly varied host capacities and highly dynamic membership. In this paper, we propose two capacity-aware multicast systems that focus on host heterogeneity, dynamic membership, scalability, and any source multicast. We extend Chord and Koorde to be capacity-aware. We then embed implicit degree-varying multicast trees on top of the overlay network and develop multicast routines that automatically follow the trees to disseminate multicast messages. The implicit trees are well balanced with workload evenly spread across the network. We also perform extensive simulations to evaluate the proposed multicast systems.
The virtual firefly: an interdisciplinary undergraduate research project
Authors: Kevin Austin, Julie Dunlap, Matthew Glover, Joshua McKinnon, Duane Mohney, Michael Taft, Brian Vysocky, Christopher Cratsley
Venue: Journal of Computing Sciences in Colleges (2005)

This paper describes an interdisciplinary undergraduate research project involving students and faculty from the Biology and Computer Science departments at our college. The goal of the project is to conduct innovative biological research using a unique device developed by our computer science students called the "Virtual Firefly". Students and faculty collaborated to develop a virtual firefly device that is able to generate, recognize and respond to flash signaling patterns of various firefly species. The device is also capable of recording experimental data for post-hoc analysis. The project provided our computer science undergraduates with an opportunity to be involved with a development project from the conceptual stages through device deployment. Our efforts resulted in a working product that was deployed and successfully used in experiments involving actual fireflies in the laboratory.
RCS Analysis of the Reinforced Carbon-Carbon Tee-Seals as Potential "Flight Day 2" Candidates in Support of the Columbia Accident Investigation
Authors: Kueichien Hill, John Gulick, Brian Kent, Tri Van
Venue: Proceedings of the 2004 Users Group Conference (2004)

During the Columbia Shuttle investigation, AFRL tried to identify a piece of on-orbit debris that originated from the Orbiter during its second day in space. This "Flight Day Two (FD2)" object was detected by UHF radar and tracked for three days before falling out of orbit. Extensive RCS measurements performed by AFRL and corresponding ballistic analysis by USAF Space Command narrowed the potential candidates down to just two possible classes of objects; (1)a section of Reinforced Carbon-Carbon (RCC) leading edge panel acreage, and (2) a section of RCC "Tee-seals". During the investigation, AFRL was asked to estimate the UHF RCS of various whole and fragmentary Tee-seals originating between panel segment #6 and #11 on the Shuttle Orbiter left wing, in order to compare with the on-orbit UHF RCS observations. Since actual Orbiter Tee-seal hardware, either whole or fractured, from the left wing area were not available, we predicted UHF RCS on various virtual Tee-seal fragment geometries to confirm or eliminate the Tee-seal as a candidate for the FD2 object. In this paper, we summarize our RCS predictions which conclusively show that a whole or partial RCC Tee-seal could not be the FD2 object. This left the RCC panel acreage as the only known object that satisfies both the on-orbit observed ballistic and UHF RCS data, a confirming piece of evidence in the Columbia investigation.
On-line balanced k-channel data allocation with hybrid schedule per channel
Authors: Navrati Saxena, M. Cristina Pinottti
Venue: Proceedings of the 6th international conference on Mobile data management (2005)

Broadcast is an efficient and scalable technique for disseminating data over wireless channels to an arbitrary large number of clients. The prime objective of broadcast schedules, both on-line and off-line, is to minimize the average amount of time a client needs to wait before receiving its desired item. In off-line schedules, it is assumed that both the entire set of data items and the demand probability for each data is known in advance. Such schedules are guaranteed to obtain the minimum average waiting time only when a skewed partition of the data among multiple-channels and flat schedules per channel are assumed. On the contrary, the on-line broadcast schedules decide which item to transmit without any a-priori knowledge of either the entire set of data or the data demand probabilities. Although no optimal solutions are known for the latter schedules, the volatility of the set of data items to be transmitted makes on-line schedules much more desirable than its off-line counterparts. In this paper, a new on-line broadcast schedule for broadcast over multiple channels is presented. The strategy partitions the data among the broadcast channels in a balanced way, and adopts a hybrid push-pull broadcast schedule per channel. Simulation experiments point out that the results of our new algorithm outperforms the minimum average waiting time achieved by the optimal off-line schedule (skewed partition of data among channels and flat schedule for channel), and the on-line broadcast schedule based on the square root rule.
Comprehensive multiprocessor cache miss rate generation using multivariate models
Authors: Ilya Gluhovsky, Brian O'Krafka
Venue: ACM Transactions on Computer Systems (TOCS) (2005)

This article presents a technique for taking a sparse set of cache simulation data and fitting a multivariate model to fill in the missing points over a broad region of cache configurations. We extend previous work by its applicability to multiple miss rate components and its ability to model a wide range of cache parameters, including size, associativity and sharing. Miss rate models are useful for broad design exploration in which many cache configurations cannot be simulated directly due to limitations of trace collection setups or available resources. We show the effectiveness of the technique by applying it to two commercial workloads and presenting miss rate data for a broad design space with cache size, associativity, sharing and number of processors as variables. The fitted data match the simulation data very well. The various curves show how a miss rate model is useful for not only estimating the performance of specific configurations, but also for providing insight into miss rate trends. Furthermore, this modeling methodology is robust in the presence of corrupted simulation data and variations in simulation data from multiple sources.
Multi-GHz SiGe design methodologies for reconfigurable computing
Authors: Kuan Zhou, John F. McDonald
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

A high-speed and low-power Field Programmable Gate Array (FPGA) is the dream of digital designers. The availability of Silicon Germanium (SiGe) Heterojunction Bipolar Transistor (HBT) devices has opened a door for GHz FPGAs [3, 4]. In the past, high static power consumption discouraged the significant scale-up of bipolar FPGAs. This paper details new ideas to reduce power and layout area in designing high-speed SiGe BiCMOS FPGAs. The paper explains new methods to reduce circuitry and utilize novel serial dual configuration planes to achieve an efficient programmability. In addition, new layout techniques are developed to reduce the bipolar areas. Several SiGe FPGA test chips based on Xilinx 6200 and Virtex Configurable Logic Blocks (CLBs) have been fabricated for demonstration.
The Design and Evolution of Jefferson Lab's Jasmine Mass Storage System
Authors: Bryan K. Hess, Michael Haddox-Schatz, M. Andrew Kowalski
Venue: Proceedings of the 22nd IEEE / 13th NASA Goddard Conference on Mass Storage Systems and Technologies (2005)

We describe the Jasmine mass storage system, in operation since 2001. Jasmine has scaled to meet the challenges of grid applications, petabyte class storage, and hundreds of MB/sec throughput using commodity hardware, Java technologies, and a small but focused development team. The evolution of the integrated disk cache system, which provides a managed online subset of the tape contents, is examined in detail. We describe how the storage system has grown to meet the special needs of the batch farm, grid clients, and new performance demands.
Linux Desktop Hacks (Hacks)
Authors: Jono Bacon, Nicholas Petreley
Venue:  (2005)

With hacks that any user can follow, Linux Desktop Hacks demonstrates how easy it is to modify Linux to suit your desires. The book is packed with tips on customizing and improving the interface, boosting performance, administering your desktop, and generally making the most out of what X, KDE, Gnome, and the console have to offer.
Supporting communication and knowledge creation in digitally networked communities in the humanities
Authors: Ralf Klamma, Marc Spaniol
Venue: ACM SIGGROUP Bulletin (2003)

Scholarly communication in the humanities heavily depends on the discursive nature of knowledge creation and the media that is in use. This communication has changed over the centuries due to the evolution of media, altering not only the communicational culture of scholars regarding their archives and text production strategies but also the communication situation in society, leading to scientific, artistic, and societal revolutions. The change from scroll to book in the edition of the Babylonian Talmud is a good example of such a medium revolution. The interdisciplinary collaborative research center "Media and cultural communication"1 was founded in 1999 to research the nature and impact of media on the discourses in cultural communication. Historically, and by creating new interdisciplinary workplaces for scientists in the 21st century, our subproject analyzes the impact of networked information systems on cooperation and knowledge organization in scientific communities and public debates.
Foreground and background interaction with sensor-enhanced mobile devices
Authors: Ken Hinckley, Jeff Pierce, Eric Horvitz, Mike Sinclair
Venue: ACM Transactions on Computer-Human Interaction (TOCHI) (2005)

Building on Buxton's foreground/background model, we discuss the importance of explicitly considering both foreground interaction and background interaction, as well as transitions between foreground and background, in the design and implementation of sensing techniques for sensor-enhanced mobile devices. Our view is that the foreground concerns deliberate user activity where the user is attending to the device, while the background is the realm of inattention or split attention, using naturally occurring user activity as an input that allows the device to infer or anticipate user needs. The five questions for sensing systems of Bellotti et al. [2002] proposed as a framework for this special issue, primarily address the foreground, but neglect critical issues with background sensing. To support our perspective, we discuss a variety of foreground and background sensing techniques that we have implemented for sensor-enhanced mobile devices, such as powering on the device when the user picks it up, sensing when the user is holding the device to his ear, automatically switching between portrait and landscape display orientations depending on how the user is holding the device, and scrolling the display using tilt. We also contribute system architecture issues, such as using the foreground/background model to handle cross-talk between multiple sensor-based interaction techniques, and theoretical perspectives, such as a classification of recognition errors based on explicitly considering transitions between the foreground and background. Based on our experiences, we propose design issues and lessons learned for foreground/background sensing systems.
A Principled Approach to Detecting Surprising Events in Video
Authors: Laurent Itti, Pierre Baldi
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

Primates demonstrate unparalleled ability at rapidly orienting towards important events in complex dynamic environments. During rapid guidance of attention and gaze towards potential objects of interest or threats, often there is no time for detailed visual analysis. Thus, heuristic computations are necessary to locate the most interesting events in quasi real-time. We present a new theory of sensory surprise, which provides a principled and computable shortcut to important information. We develop a model that computes instantaneous low-level surprise at every location in video streams. The algorithm significantly correlates with eye movements of two humans watching complex video clips, including television programs (17,936 frames, 2,152 saccadic gaze shifts). The system allows more sophisticated and time-consuming image analysis to be efficiently focused onto the most surprising subsets of the incoming data.
Floquet Theory as a Computational Tool
Authors: Gerald Moore
Venue: SIAM Journal on Numerical Analysis (2004)

We describe how classical Floquet theory may be utilized, in a continuation framework, to construct an efficient Fourier spectral algorithm for approximating periodic orbits. At each continuation step, only a single square matrix, whose size equals the dimension of the phase-space, needs to be factorized; the rest of the required numerical linear algebra just consists of back-substitutions with this matrix. The eigenvalues of this key matrix are the Floquet exponents, whose crossing of the imaginary axis indicates bifurcation and change-in-stability. Hence we also describe how the new periodic orbits created at a period-doubling bifurcation point may be efficiently computed using our approach.
Exploitation of parallelism to nested loops with dependence cycles
Authors: Weng-Long Chang, Chih-Ping Chu, Michael Ho
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2004)

In this paper, we analyze the recurrences from the breakability of the dependence links formed in general multi-statements in a nested loop. The major findings include: (1) A sink variable renaming technique, which can reposition an undesired anti-dependence and/or output-dependence link, is capable of breaking an anti-dependence and/or output-dependence link. (2) For recurrences connected by only true dependences, a dynamic dependence concept and the derived technique are powerful in terms of parallelism exploitation. (3) By the employment of global dependence testing, link-breaking strategy, Tarjan's depth-first search algorithm, and a topological sorting, an algorithm for resolving a general multi-statement recurrence in a nested loop is proposed. Experiments with benchmark cited from Vector loops showed that among 134 subroutines tested, 3 had their parallelism exploitation amended by our proposed method. That is, our offered algorithm increased the rate of parallelism exploitation of Vector loops by approximately 2.24%.
Dynamic properties of automatic control systems: Investigation via order reduction
Authors: L. D. Blistanova, I. V. Zubov, N. V. Zubov, N. A. Severtsev
Venue: Automation and Remote Control (2005)

Recurrent methods are applied to study the stability of automatic control systems in the first linear approximation. These methods are not analytic in general sense, but, in performance, accuracy, and practical realization, supplement the well-known Routh-Hurwitz, Mikhailov, Jury, Pontryagin, Neimark, and Barabanov analytical criteria and recurrent algorithms and similar criteria in this field.
Book review: Case-Based Planning: Viewing Planning as a Memory Task by Krlstian J. Hammond (Academic Press, 1989)
Venue: ACM SIGART Bulletin (1990)

Much of the research at the Yale AI Lab relates to the investigation of memory. Learning and reminding form the basis of case-based reasoning in general and case-based planning (CBP) in particular. By remembering past successes and failures in planning, a planner may reduce much of its work to retrieving previously used plans and applying the to the situation at hand.
Computational complexity of itemset frequency satisfiability
Authors: Toon Calders
Venue: Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2004)

Computing frequent itemsets is one of the most prominent problems in data mining. We introduce a new, related problem, called FREQSAT: given some itemset-interval pairs, does there exist a database such that for every pair the frequency of the itemset falls in the interval? It is shown in this paper that FREQSAT is not finitely axiomatizable and that it is NP-complete. We also study cases in which other characteristics of the database are given as well. These characteristics can complicate FREQSAT even more. For example, when the maximal number of duplicates of a transaction is known, FREQSAT becomes PP-hard. We describe applications of FREQSAT in frequent itemset mining algorithms and privacy in data mining.
AN AFTER-SCENARIO QUESTIONNAIRE FOR USABILITY STUDIES: PSYCHOMETRIC EVALUATION OVER THREE TRIALS
Authors: James R. Lewis
Venue: ACM SIGCHI Bulletin (1991)

The purpose of this report is to (1) describe a psychometric evaluation of a printer scenario questionnaire (PSQ) that was used to assess user satisfaction during scenario-based usability studies of printers and (2) compare the psychometric properties of the PSQ with those of the After-Scenario Questionnaire (ASQ) (Lewis, 1991b). The PSQ is similar to the ASQ, but is composed of three five-point scales rather than three seven-point scales.
An Inertial and Visual Sensing System for a Small Autonomous Helicopter
Authors: Peter Corke
Venue: Journal of Robotic Systems (2004)

This paper describes the design and architecture of a low-cost and light-weight inertial and visual sensing system for a small-scale autonomous helicopter. A custom 6-axis IMU and a stereo vision system provide vehicle attitude, height, and velocity information. We discuss issues such as robust visual processing, motion resolution, dynamic range, and sensitivity. &copy; 2004 Wiley Periodicals, Inc.
Approximately matching polygonal curves with respect to the Fréchet distance
Authors: Axel Mosig, Michael Clausen
Venue: Computational Geometry: Theory and Applications (2005)

In this paper we present approximate algorithms for matching two polygonal curves with respect to the Fréchet distance. We define a discrete version of the Fréchet distance as a distance measure between polygonal curves and show that this discrete version is bounded by the continuous version of the Fréchet distance.For the task of matching with respect to the discrete Fréchet distance, we develop an algorithm that is based on intersecting certain subsets of the transformation group under consideration. Our algorithm for matching two point sequences of lengths m and n under the group of rigid motions has a time complexity of O(m2n2) for matching under the discrete Fréchet distance and can be modified for matching subcurves, closed curves and finding longest common subcurves, Group theoretical considerations allow us to eliminate translation components of affine transformations and to consider matching under arbitrary linear algebraic groups.
Defining Autonomic Computing: A Software Engineering Perspective
Authors: Paul Lin, Alexander MacArthur, John Leaney
Venue: Proceedings of the 2005 Australian conference on Software Engineering (2005)

As a rapidly growing field, Autonomic Computing is a promising new approach for developing large scale distributed systems. However, while the vision of achieving self-management in computing systems is well established, the field still lacks a commonly accepted definition of ýwhatý an Autonomic Computing system is. Without a common definition to dictate the direction of development, it is not possible to know whether a system or technology is a part of Autonomic Computing, or if in fact an Autonomic Computing system has already been built. The purpose of this paper is to establish a standardised and quantitative definition of Autonomic Computing through the application of the Quality Metrics Framework described in IEEE Std 1061-1998 [1]. Through the application of this methodology, stakeholders were systematically analysed and evaluated to obtain a balanced and structured definition of Autonomic Computing. This definition allows for further development and implementation of quality metrics, which are project-specific, quantitative measurements that can be used to validate the success of future Autonomic Computing projects.