ppxscal/embedding_network huggingface dataset:
Correlations between Horn fractions, satisfiability and solver performance for fixed density random 3-CNF instances
Authors: Hans Maaren, Linda Norden
Venue: Annals of Mathematics and Artificial Intelligence (2005)

An enhanced concept of sub-optimal reverse Horn fraction of a CNF-formula was introduced in [18]. It was shown that this fraction is very useful in effectively (almost) separating 3-colorable random graphs with fixed node-edge density from the non-3-colorable ones. A correlation between this enhanced sub-optimal reverse Horn fraction and satisfiability of random 3-SAT instances with a fixed density was observed. In this paper, we present experimental evidence that this correlation scales to larger-sized instances and that it extends to solver performances as well, both of complete and incomplete solvers. Furthermore, we give a motivation for various phases in the algorithm aHS, establishing the enhanced sub-optimal reverse Horn fraction, and we present clear evidence for the fact that the observed correlations are stronger than correlations between satisfiability and sub-optimal MAXSAT-fractions established similarly to the enhanced sub-optimal reverse Horn fraction. The latter observation is noteworthy because the correlation between satisfiability and the optimal MAXSAT-fraction is obviously 100%.
A New Electronic Cash Model
Authors: Xiaosong Hou, Chik How Tan
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

Credit card is currently the most popular electronic payment method on the Internet, but it is not an ideal method from the security and privacy point of view. Electronic cash solves many inherent problems of credit card, such as anonymity and off-line payment, and is widely accepted as an ideal electronic payment method. However, there are issues that are yet to be satisfactorily solved, such as fair traceability and double-spending prevention of off-line schemes. In this paper, we present a customer generated electronic cash model that offers unique trade-off between credit card and traditional off-line electronic cash systems. This model provides anonymity for customers and is technically more secure than credit card systems. It eliminates the withdrawal phase of electronic cash systems, thus it is more convenient for customers to use. In addition, fair traceability is provided in case crimes take place.
Apple Pro Training Series: Optimizing Your Final Cut Pro System (Apple Pro Training)
Authors: Sean Cullen, Matthew Geller, Charles Roberts, Adam Wilt
Venue:  (2005)

If it's good enough for the legendary Hollywood film editors, it's good enough for you! This guide is aimed squarely at Final Cut Pro users just like yourself--at corporate, commercial, and independent post-production houses--who want to move beyond simple Final Cut Pro installations for their film and video masterworks. Through project-based lessons and step-by-step instructions, this self-paced guide shows you how to integrate high-end capture cards, storage systems, and other industry-standard hardware into a Final Cut Pro workflow, as well as how to install and configure Final Cut Pro to make the most of your professional non-linear editing system. This is the technical information most frequently requested by Final Cut Pro users, pulled together into one book that is both a self-paced learning tool and the official curriculum for the Apple Pro Training and Certification Program. The guide covers everything from system configuration, storage, and device connectivity to the intricacies of SAN solutions, and includes special sections on optimizing short-form/broadcast workflows and long-form/HD workflows. It offers troubleshooting advice at every turn: for dropped frames, mismatched audio and audio distortion; imported graphic file issues, media management, file recovery and archiving strategies, and much more. DVD with lesson files and media included.
A proposed standard for binary floating point arthmetic
Authors: Jerome Coonen, William Kahan, John Palmer, Tom Pittman, David Stevenson
Venue: ACM SIGNUM Newsletter (1979)

This standard is a product of the Floating Point Working Group of the Microprocessor Standards Subcommittee of the IEEE Computer Society Computer Standards Committee. It is intended that the standard embody the essence of "Specifications For a Proposed Standard for Floating Point Arithmetic" by Jerome Coonen.
Denial-of-service resilience in peer-to-peer file sharing systems
Authors: D. Dumitriu, E. Knightly, A. Kuzmanovic, I. Stoica, W. Zwaenepoel
Venue: ACM SIGMETRICS Performance Evaluation Review (2005)

Peer-to-peer (p2p) file sharing systems are characterized by highly replicated content distributed among nodes with enormous aggregate resources for storage and communication. These properties alone are not sufficient, however, to render p2p networks immune to denial-of-service (DoS) attack. In this paper, we study, by means of analytical modeling and simulation, the resilience of p2p file sharing systems against DoS attacks, in which malicious nodes respond to queries with erroneous responses. We consider the file-targeted attacks in current use in the Internet, and we introduce a new class of p2p-network-targeted attacks.In file-targeted attacks, the attacker puts a large number of corrupted versions of a single file on the network. We demonstrate that the effectiveness of these attacks is highly dependent on the clients' behavior. For the attacks to succeed over the long term, clients must be unwilling to share files, slow in removing corrupted files from their machines, and quick to give up downloading when the system is under attack.In network-targeted attacks, attackers respond to queries for any file with erroneous information. Our results indicate that these attacks are highly scalable: increasing the number of malicious nodes yields a hyperexponential decrease in system goodput, and a moderate number of attackers suffices to cause a near-collapse of the entire system. The key factors inducing this vulnerability are (i) hierarchical topologies with misbehaving "supernodes," (ii) high path-length networks in which attackers have increased opportunity to falsify control information, and (iii) power-law networks in which attackers insert themselves into high-degree points in the graph.Finally, we consider the effects of client counter-strategies such as randomized reply selection, redundant and parallel download, and reputation systems. Some counter-strategies (e.g., randomized reply selection) provide considerable immunity to attack (reducing the scaling from hyperexponential to linear), yet significantly hurt performance in the absence of an attack. Other counter-strategies yield little benefit (or penalty). In particular, reputation systems show little impact unless they operate with near perfection.
Globally Optimal Geodesic Active Contours
Authors: Ben Appleton, Hugues Talbot
Venue: Journal of Mathematical Imaging and Vision (2005)

An approach to optimal object segmentation in the geodesic active contour framework is presented with application to automated image segmentation. The new segmentation scheme seeks the geodesic active contour of globally minimal energy under the sole restriction that it contains a specified internal point pint. This internal point selects the object of interest and may be used as the only input parameter to yield a highly automated segmentation scheme. The image to be segmented is represented as a Riemannian space S with an associated metric induced by the image. The metric is an isotropic and decreasing function of the local image gradient at each point in the image, encoding the local homogeneity of image features. Optimal segmentations are then the closed geodesics which partition the object from the background with minimal similarity across the partitioning. An efficient algorithm is presented for the computation of globally optimal segmentations and applied to cell microscopy, x-ray, magnetic resonance and cDNA microarray images.
The classification of deadlock prevention and avoidance is erroneous
Authors: Gertrude Neuman Levine
Venue: ACM SIGOPS Operating Systems Review (2005)

Mechanisms to control resource deadlock are frequently classified as prevention or avoidance schemes. The prevention schemes are listed as those that directly negate the necessary preconditions of resource deadlock. The avoidance schemes, although they obviously also prevent deadlock, are described as not addressing the preconditions for the occurrence of deadlock.We claim that this classification is erroneous. Typically, the necessary preconditions for resource deadlock that are provided are incomplete. Once all of the preconditions are examined, it is obvious that "deadlock avoidance" does indeed negate a precondition.
The first workshop on end-user software engineering
Authors: Gregg Rothermel, Sebastian Elbaum
Venue: Proceedings of the 27th international conference on Software engineering (2005)

WEUSE is a workshop dedicated to the problems faced by end-user programmers, and research that can address those problems.
Cognitive factors in design: overview and some implications for design
Authors: Thomas T. Hewett
Venue: Proceedings of the 5th conference on Creativity cognition (2005)

This tutorial provides a "hands-on" (actually, "minds-on") exploration of several basic processes and phenomena of human memory, and problem solving. The emphasis is on developing both intuitive and formal knowledge which can serve as background knowledge which will be useful in interpreting design guidelines and in making educated design judgments when design guidelines fail, conflict, or are nonexistent. The demonstrations used emphasize basic general phenomena with which any theory of memory or problem solving must deal. In addition, the tutorial suggests some of the implications of these phenomena for designing interactive computing systems.
An Event Processing Language (EPL) for Building Sense and Respond Applications
Authors: E. Albek, E. Bax, G. Billock, K. M. Chandy, I. Swett
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 2 - Volume 03 (2005)

Robust systems are designed to deal with some anticipated, though probably unusual, situations such as equipment failure and overloads. They must also be designed to deal with unanticipated situations: no matter how much careful planning is carried out, unexpected events may occur. This paper describes a system, EPL 5.0, for sensing unusual situations and responding appropriately. This paper also describes an event processing language that helps business users specify both conditions that require responses, and the appropriate responses to these conditions. Unanticipated situations are dealt with by specifying normal conditions, and defining an anomaly as a significant deviation from normality. The system also facilitates machine learning of normal and anomalous conditions from examples.
Circuit recognition and verification from bipolar and MOS layout information
Authors: I. Ablasser, U. Jäger
Venue: ACM SIGDA Newsletter (1981)

The mathematical and technical background information for our highly efficient procedure of circuit recognition and verification from layout information is presented. Completeness and extremely short computing times are the main features. This procedure can be performed for bipolar as well as for MOS technologies and is part of the whole control system LOCATE.
Evaluation of Spatio-temporal Predicates on Moving Objects
Authors: Markus Schneider
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

Moving objects databases managing spatial objects with continuously changing position and extent over time have recently found large interest in the database community. Queries about moving objects become particularly interesting when they ask for temporal changes in the topological relationships between evolving spatial objects. A concept of spatio-temporal predicates has been proposed to describe these relationships. The goal of this paper is to designefficient algorithms for them so that they can be used in spatio-temporal joins and selections. This paper proposes not to design an algorithm for each new predicate individually but to employ a generic algorithmic scheme which is able to cover present and future predicate definitions.
Effects of display blurring on the behavior of novices and experts during program debugging
Authors: Roman Bednarik, Markku Tukiainen
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

The Restricted Focus Viewer (RFV) relates a small part of an otherwise blurred display to the focus of visual attention. A user controls which part of the screen is in focus by using a computer mouse. The RFV tool records these movements. Recently, some studies used the RFV to investigate the cognitive behavior of users and some others have even enhanced the tool for research of usability issues.We report on an eye-tracking study where the effects of RFV's display blurring on the visual attention allocation of 18 novice and expert programmers were investigated. We replicated a previous RFV-based study and analyzed attention switching and fixation durations reported by an eye tracker. Our results indicate that the blurring interferes with the strategies possessed by experts and has an effect on fixation duration: however, we found that debugging performance was preserved. We discuss possible reasons and implications.
Numerical method for stationary distribution of stochastic differential equations with Markovian switching
Authors: Xuerong Mao, Chenggui Yuan, G. Yin
Venue: Journal of Computational and Applied Mathematics (2005)

In principle, once the existence of the stationary distribution of a stochastic differential equation with Markovian switching is assured, we may compute it by solving the associated system of the coupled Kolmogorov-Fokker-Planck equations. However, this is nontrivial in practice. As a viable alternative, we use the Euler-Maruyama scheme to obtain the stationary distribution in this paper.
Integration of Specification-Based and CR-Based Approaches for GUI Testing
Authors: Woei-Kae Chen, Tung-Hung Tsai, Hung-Hsing Chao
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

A common method for GUI testing is the CR (capture and replay) script technique. However, a deficiency of CR based technologies is that test scripts can not be generated before an application under test is ready for testing. Thus, test specification based approaches have been studied as alternatives. In this paper, we propose the concept of integrating the design of GUI specification languages and CR tools. Our approach is to endow a CR tool with the support of writing and replaying GUI specifications. We implemented a visual GUI testing tool (GTT) for Java applications to demonstrate our results. We discuss the techniques used in GTT, including event model, event abstraction, and test points. We also show how to apply GTT in a test-first programming style for GUI testing.
Global Indexing Scheme for Location-Dependent Queries in Multi Channels Mobile Broadcast Environment
Authors: Agustinus Borgy Waluyo, Bala Srinivasan, David Taniar
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

Broadcast indexing is necessary to be applied in a wireless broadcast environment as such the scheme helps mobile clients to find the desired data instances efficiently. This is particularly important considering the inherent limitations in mobile environment. In this paper, we present a global indexing scheme for location dependent queries. The proposed scheme is designed to serve queries in which the query result is relevant to clientýs location. Global indexing scheme aims to minimise index access time while having all the advantages of index broadcasting. We develop a simulation model to find out the access time performance of global indexing scheme as compared to non-global indexing scheme. Additionally, we analyse the efficiency of valid scope used in the global index scheme as compared with an existing valid scope. It is found that global index performs substantially better than the existing indexing concept.
A Parallel Variable-Mesh FDTD Algorithm for the Solution of Large Electromagnetic Problems
Authors: L. Catarinucci, P. Palazzari, L. Tarricone
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 13 - Volume 14 (2005)

The use of numerical methods for the solution of large electromagnetic (EM) problems is nowadays a common practice. Among the several available techniques, the Finite Difference Time Domain (FDTD) is one of the most frequently adopted algorithms, thanks to its versatility and its ability to deal with complex structures. Unfortunately, the method requires a huge computational effort, so that the study of large simulation domains and the investigation of many practical EM aspects cannot be afforded by using traditional computers. Also, the needs of high accuracy when the simulation domain is modeled, implies small mesh size, with a non-negligible impact on the memory requirement if a uniform mesh scheme is adopted. The proposed variable mesh FDTD (VM-FDTD) algorithm allows a natural and efficient parallel implementation, guaranteeing the possibility of managing large memory requirements. Results on relevant topics such as the antennas characterization and the interaction between humans and EM sources are investigated, demonstrating its ability to deal with complex EM problems.
Simultaneous Independent Online Auctions with Discrete Bid Increments
Authors: Vipul Bansal, Rahul Garg
Venue: Electronic Commerce Research (2005)

Decentralized multi-item auctions offer great opportunities for integrating fragmented online auction markets into larger markets with more efficient outcomes. This paper extends the theory of multi-item ascending auctions of substitutes by considering any finite positive bid increment and allowing the bidders to bid asyn-chronously instead of bidding in a round-robin fashion. We consider a setup where the bidders' utilities over multiple items are additive and bound the maximum inefficiency in the allocation when the bidders follow a simple greedy strategy. We also obtain the limits within which the prices of individual items can vary from one outcome to another. For the special case of single unit bidder demand, we also bound the maximum surplus which a bidder can extract by unilaterally switching to some other strategy. The paper suggests an upper bound for the minimum required bid increment which would be necessary for competitive price discovery and truthful bidding in a practical online implementation.
Development of the HRL route navigation dialogue system
Authors: Robert Belvin, Ron Burns, Cheryl Hein
Venue: Proceedings of the first international conference on Human language technology research (2001)

In this paper we report on our work on a prototype route navigation dialogue system for use in a vehicle. The system delivers spoken turn-by-turn directions, and has been developed to accept naturally phrased navigation queries, as part of our overall effort to create an in-vehicle information system which delivers information as requested while placing minimal cognitive load on the driver.
Machine translation by interaction between paraphraser and transfer
Authors: Kazuhide Yamamoto
Venue: Proceedings of the 19th international conference on Computational linguistics - Volume 1 (2002)

A machine translation model has been proposed where an input is translated through both source-language and target-language paraphrasing processes. We have implemented our prototype model for the Japanese-Chinese language pair. This paper. describes our core idea of translation, where a source language paraphraser and a language transfer cooperates in translation by exchanging information about the source input.
Sparse matrix test problems
Authors: Iain Duff, Roger Grimes John Lewis
Venue: ACM SIGNUM Newsletter (1982)

The development, analysis and production of algorithms in sparse linear algebra often requires the use of test problems to demonstrate the effectiveness and applicability of the algorithms. Many algorithms have been developed in the context of specific application areas and have been tested in the context of sets of test problems collected by the developers. Comparisons of algorithms across application areas and comparisons between algorithms has often been incomplete, due to the lack of a comprehensive set of test problems. Additionally we believe that a comprehensive set of test problems will lead to a better understanding of the range of structures in sparse matrix problems and thence to better classification and development of algorithms. We have agreed to sponsor and maintain a general library of sparse matrix test problems, available on request to anyone for a nominal fee to cover postal charges. Contributors to the library will, of course, receive a free copy.
Permanence of a single-species dispersal system and predator survival
Authors: Jing'an Cui, Yasuhiro Takeuchi
Venue: Journal of Computational and Applied Mathematics (2005)

This paper considers permanence of a single-species dispersal periodic system with the possibility of the loss for the species during their dispersion among patches. The condition obtained for permanence generalizes the known condition on the system without loss for the species in the process of movement. Next, we add predators into every patch and consider the survival possibility of the predator. It is shown that the total amount of the predators can remain positive, if the single-species (prey) dispersal system has a positive periodic solution and the quantity of prey in each patch is enough for survival of the predator.
Pattern computation in neural communication systems
Authors: Peter Andras
Venue: Biological Cybernetics (2005)

Biological data suggests that activity patterns emerging in small- and large-scale neural systems may play an important role in performing the functions of the neural system, and in particular, neural computations. It is proposed in this paper that neural systems can be understood in terms of pattern computation and abstract communication systems theory. It is shown that analysing high-resolution surface EEG data, it is possible to determine abstract probabilistic rules that describe how emerging activity patterns follow earlier activity patterns. The results indicate the applicability of the proposed approach for understanding the working of complex neural systems.
Some myths of software engineering education
Authors: Hans van Vliet
Venue: Proceedings of the 27th international conference on Software engineering (2005)

Based on many years of teaching software engineering, I present a number of lessons I have learned over the years. I do so in the form of a series of myths, the reverse of which can be considered challenges to educators. The overall message I wish to convey is that there's more to software engineering than engineering. The engineering metaphor gives us a lot of useful guidance in shaping our profession. But there's also a downside, in that this goes at the expense of the human, social dimension that is an essential element of our profession.