ppxscal/embedding_network huggingface dataset:
Quantum Lower Bounds for the Collision and the Element Distinctness Problems
Authors: Yaoyun Shi
Venue: Proceedings of the 43rd Symposium on Foundations of Computer Science (2002)

Given a function f as an oracle, the collision problem is to find two distinct inputs i and j such that f(i) = f(j) under the promise that such inputs exist. In this paper, we prove that any quantum algorithm for finding a collision in an r -to-one function must evaluate the function\Omega (({n \mathord{\left/ {\vphantom {n r}} \right. \kern-\nulldelimiterspace} r}){1 \mathord{\left/ {\vphantom {1 {3)}}} \right. \kern-\nulldelimiterspace} {3)}} times, where n is the size of the domain and {r \mathord{\left/ {\vphantom {r n}} \right. \kern-\nulldelimiterspace} n}. This lower bound matches, up to a constant factor, the upper bound of Brassard, Hyer, and Tapp [ACM SIGACT News, 28:14-19, 1997], which uses the quantum algorithm of Grover [Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, pages 212-219, 1996] in a novel way. The previously best quantum lower bound is \Omega (({n \mathord{\left/ {\vphantom {n {r)^{{1 \mathord{\left/ {\vphantom {1 5}} \right. \kern-\nulldelimiterspace} 5}} }}} \right. \kern-\nulldelimiterspace} {r)^{{1 \mathord{\left/ {\vphantom {1 5}} \right. \kern-\nulldelimiterspace} 5}} }}) evaluations, due to Aaronson [Proceedings of the Thirty-Fourth Annual ACM Symposium on the Theory of Computing, pages 635-642, 2002]. Our result implies a quantum lower bound of \Omega (n^{{2 \mathord{\left/ {\vphantom {2 3}} \right. \kern-\nulldelimiterspace} 3}}) queries to the inputs for another well studied problem, the element distinctness problem, which is to determine whether or not the given n real numbers are distinct. The previous best lower bound is \Omega (\sqrt n ) queries in the black-box model; and \Omega (\sqrt n \log n) comparisons in the comparisons-only model, due to Hyer, Neerbek, and Shi [Lecture Notes in ComputerScience, Vol. 2076, pp. 346-357, 2001].
Mining Sequential Patterns
Authors: Rakesh Agrawal, Ramakrishnan Srikant
Venue: Proceedings of the Eleventh International Conference on Data Engineering (1995)

We are given a large database of customer transactions, where each transaction consists of customer-id, transaction time, and the items bought in the transaction. We introduce the problem of mining sequential patterns over such databases. We present three algorithms to solve this problem, and empirically evaluate their performance using synthetic data. Two of the proposed algorithms, AprioriSome and AprioriAll, have comparable performance, albeit AprioriSome performs a little better when the minimum number of customers that must support a sequential pattern is low. Scale-up experiments show that both AprioriSome and AprioriAll scale linearly with the number of customer transactions. They also have excellent scale-up properties with respect to the number of transactions per customer and the number of items in a transaction.
Modelling the maintenance process at Zurich Life Insurance
Authors: Harry M. Sneed
Venue: Proceedings of the 1996 International Conference on Software Maintenance (1996)

This paper is based on the experience made at the Zurich Life Insurance Company in introducing a formalized software maintenance process. The basis for the process definition was the ANSI/IEEE standard P1219-Guide to Software Maintenance. This standard was adapted and enhanced to define all the steps from the initiation of a maintenance request to the acceptance of the modified version by the user. Experience has shown that a well defined maintenance process is necessary to saving costs while improving the customer service.
Advanced Transaction Models in Workflow Contexts
Authors: Gustavo Alonso, Divyakant Agrawal, Amr El Abbadi, Mohan Kamath, Roger Günthör, C. Mohan
Venue: Proceedings of the Twelfth International Conference on Data Engineering (1996)

In recent years, numerous transaction models have been proposed to address the problems posed by advanced database applications, but only a few of these models are being used in commercial products. In this paper, we make the case that such models may be too centered around databases to be useful in real environments. Advanced applications raise a variety of issues that are not addressed at all by transaction models. These same issues, however, are the basis for existing workflow systems, which are having considerable success as commercial products in spite of not having a solid theoretical foundation. We explore some of these issues and show that, in many aspects, workflow models are a superset of transaction models and have the added advantage of incorporating a variety of ideas that to this date have remained outside the scope of traditional transaction processing.
A Region-Based Object Recognition Algorithm
Authors: Paulo Sérgio Rodrigues, Arnaldo de Albuquerque Araújo
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

This paper presents a new algorithm for recognition of objects in a given image. This algorithm transforms the input image into a directed graph which is constructed through several defined rules. The graph characteristics represent the global shape information of the object inside the input image, and are extracted during the graph construction. This strategy prevents the postprocessing traversing to the graph, with consequent improvement of computational time. The algorithm was tested over a specific data base, and the experiments were conducted to show its performance in the light of two types of problems: object class recognition and similar image retrieval.
Interestingness PreProcessing
Authors: Sigal Sahar
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

As the size of databases increases, the number of rules mined from them also increases, often to a extent that overwhelms users. To address this problem, an important part of the KDD process is dedicated to determining which of these patterns is interesting. In this paper we define the Interestingness PreProcessing Step, and introduce a new framework for interestingness analysis. In asimilar fashion to data-preprocessing, this preprocessing should always be applied prior to interestingness processing. A strictrequirement, and the biggest challenge, in defining Interestingness PreProcessing techniques is that the preprocessing will not eliminate any potentially interesting patterns. That is, the preprocessing methods must be domain-,task-and user-independent. This property differentiates the preprocessing methods from existing interestingness criteria, and, since they can be applied automatically, makes them very useful. This generic nature also makes them rare: PreProcessing methods are very challenging to define.We also define in this paper the first two preprocessing techniques, and present the empirical results of applying them to six databases. The results indicate that Interestingness PreProcessing Step is very powerful: in most cases, an average of half the rules mined were eliminated by the application of the two Interestingness PreProcessing techniques. These results are Particularly significant since no user-interaction is required to achieve them.
The Evaluation of GRADD: A GDSS Supporting Asynchronous and Distributed Meetings
Authors: Karin Becker, Ana Paula Terra Bacelo
Venue: Proceedings of the 6th International Workshop on Groupware (2000)

GRADD is a group decision support system (GDSS) targeted at asynchronous and distributed meetings. The distinctive features of GRADD are the combination of a rationale model for discussion support, voting techniques for deliberation activities and automatic norm control for process structure definition and control. This paper presents the results of an empirical evaluation of GRADD's functionality with regard to these distinctive features. The experiment, though empirical, enabled us to detect the strong and weak points of the proposed functionality and/or of the current GRADD prototype, and to establish future extensions and improvements.
Hardness Results for Coloring 3 -Colorable 3 -Uniform Hypergraphs
Authors: Subhash Khot
Venue: Proceedings of the 43rd Symposium on Foundations of Computer Science (2002)

In this paper, we consider the problem of coloring a 3-colorable 3-uniform hypergraph. In the minimization version of this problem, given a 3-colorable 3-uniform hypergraph, one seeks an algorithm to color the hypergraph with as few colors as possible. We show that it is NP-hard to color a 3-colorable 3-uniform hypergraph with constantly many colors. In fact, we show a stronger result that it is NP-hard to distinguish whether a 3-uniform hypergraph with nvertices is 3-colorable or it contains no independent set of size \delta n for an arbitrarily small constant \delta >0. In the maximization version of the problem, given a 3-uniform hypergraph,the goal is to color the vertices with 3 colors so as to maximize the number of non-monochromatic edges. We show that it is NP-hard to distinguish whether a 3-uniformhypergraph is 3-colorable or any coloring of the vertices with 3 colors has at most \frac{8}{9} + \varepsilonfraction of the edges non-monochromatic where \varepsilon > 0 is an arbitrarily small constant. This result is tight since assigning a random color independently to every vertex makes \frac{8}{9} fraction of the edges non-monochromatic.These results are obtained via a new construction of a probabilistically checkable proof system (PCP) for NP. We develop a new construction of the PCP Outer Verifier. An important feature of this construction is smoothening of the projection maps.Dinur, Regev and Smyth [6] independently showed that it is NP-hard to color a 2-colorable 3-uniform hypergraph with constantly many colors. In the "good case", the hypergraph they construct is 2-colorable and hence their result is stronger. In the "bad case" however, the hypergraph we construct has a stronger property, namely, it does not even contain an independent set of size \delta n.
Experience Using Formal Methods for Capturing Requirements of Web-Based Applications
Authors: Abdesselam Redouane
Venue: Proceedings of the 1st IEEE International Conference on Cognitive Informatics (2002)

The current practice in capturing requirements of web-based applications is accomplished by an ad-hoc and informal manner. In this paper we investigate the use of formal methods to formalize the requirements of a web-based application. We have used a simple yet powerful Definitional Specification Language (DSL) for this task. DSL is based on first order predicate calculus, and has three main concepts: a resource, a transitional, and a state type. These concepts help in specifying dynamic behaviors and the resultant specification is clear with no cumbersome manipulation of time variables. A brief description of DSL is given before we provide the informal requirements of our web-based application. We formalize the requirements using DSL and describe how this is done. We conclude that the benefits gained with such formalization have made the development clear and minimized the cycle of fix-and-test.
Test generation for multiple state-table faults in finite-state machines
Authors: Irith Pomeranz, Sudhakar M. Reddy
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

A test generation procedure to detect multiple state-table faults in finite-state machines is proposed. The importance of multiple state-table faults and their advantages as test generation objectives to avoid the need for checking experiments are considered. The proposed procedure is based on a new method for implicit enumeration of large numbers of multiple faults by using incompletely specified faulty machines. Experimental results are presented to demonstrate the effectiveness of implicit fault enumeration in detecting large numbers of multiple faults.
Robust Stroke Segmentation Method for Handwritten Chinese Character Recognition
Authors: Ke Liu, Yea S. Huang, Ching Y. Suen
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

This paper presents a robust thinning-based method for the segmentation of strokes from handwritten Chinese characters. A new set of feature points is proposed for the analysis of skeleton images. A geometrical graph based approach is developed for the analysis of strokes. A novel criterion is proposed for the identification of the fork points in a skeleton image which correspond to the same joint points in the original character image. The experimental results show that the proposed method is effective.
A Distributed Multimedia Multiple Access Protocol for Adhoc Networks
Authors: Noritaka Fukagawa, Noboru Iida, Takashi Watanabe
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

This paper discusses a wireless multiple access protocol for multimedia traffic called DMMA (Distributed control Multimedia Multiple Access). The protocol is used where a number of users dynamically migrate to/from an adhoc network to communicate multimedia messages. The protocol have four features. 1) Since the protocol doesn't need a center station, it can construct an adhoc wireless network. 2) The protocol assigns a transmission slot periodically for real-time data, while for non-real-time data it assigns as many slots as possible to enhance efficiency. 3) The protocol uses a stable continual tree algorithm for slot reservation to reduce admission delay. 4) Every transmission data includes the control data indicating requiring slots successively, which enables a terminal to join and leave the network dynamically. The protocol is evaluated by simulation to show fair throughput for any multimedia data.
On the Business Impact of Software Process Improvement
Authors: Rob J. Kusters, Jos J. M. Trienekens, Wilmar Hassoldt
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

This paper describes research on the perceived impact of process improvement activities on the quality of the services provided to the (internal) customers. A questionnaire was developed to map the notion 'quality of service' from the point of view from both IT-departments and business customers. These assessments were measures against a subjective scale that runs from 'insufficient' to 'sufficient'. This survey was used in 9 different IT-development organisations, all part of the same holding. On the basis of the internal report on this survey top-management accepted those SPI-investments were providing sufficient benefits and required a repeat at one-year intervals.
Efficient Parallel Algorithms on Distance-Hereditary Graphs
Authors: Sun-Yuan Hsieh, Chin-Wen Ho, Gen-Huey Chen, Tsan-sheng Hsu, Ming-Tat Ko
Venue: Proceedings of the international Conference on Parallel Processing (1997)

In this paper, we present efficient parallel algorithms for finding a minimum weighted independent set, a minimum weighted Steiner tree for a distance-hereditary graph which takes O(\log n) time using O(n+m) processors on a CRCW PRAM, where n and m are the number of vertices and edges of a given graph, respectively. We also find a maximum weighted clique of a distance-hereditary graph in O(\log^{2} n) time using O(n+m) processors on a CREW PRAM.
On-line recognition of cursive Hangul characters by modeling extended graphemes
Authors: Kyung Hee Kim, Tae Jin Seong, Jeong In Do
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

We propose an effective method for online cursive Hangul recognition. Extended graphemes are modeled separately to recognize cursive characters, and rule processing is combined with elastic matching to discriminate similar characters. The extended graphemes consist of basic graphemes and connected graphemes of two or three basic graphemes which are frequently found in cursive Hangul characters. The rule based processing catches the specific features of graphemes whereas the elastic matching catches the general features of graphemes so the integration of two methods could complement the deficiencies of each other. In terms of integrating rules with elastic matching we could reduce 40.35% of error rates of grapheme recognition. The experiments produce 94.1% recognition rate for 479,326 Hangul characters (2350 different characters).
A system for automatically reading IATA flight coupons
Authors: Jianchang Mao, Raymond A. Lorie, K. M. Mohiuddin
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

We describe a prototype system for reading IATA flight coupons. The system exploits various characteristics of IATA coupons to determine reliably coupon types and field boundaries, and to minimize the amount of manual keying. In particular, we propose a method for extracting and recognizing fixed-pitch characters on noisy images with a complex background. The method does not require a complete drop-out of background, pre-printed text, or lines before recognition, and allows for recovering partially damaged characters (e.g., overlap with form content, handwritten annotations, etc.).
Clustering Web Sessions by Sequence Alignment
Authors: Weinan Wang, Osmar R. Zaïane
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

In the context of web mining, clustering could be used to cluster similar click-streams to determine learning behaviours in the case of e-learning, or general site access behaviours in e-commerce. Most of the algorithms presented in the literature to deal with clustering web sessions treat sessions as sets of visited pages within a time period and don't consider the sequence of the click-stream visitation. This has a significant consequence when comparingsimilarities between web sessions. We propose in this paper a new algorithm based on sequence alignment to measure similarities between web sessions where sessions arechronologically ordered sequences of page accesses.
Divide-and-conquer programming on MIMD computers
Authors: Santhosh Kumaran, Michael J. Quinn
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

We have developed a programming template to implement divide and conquer algorithms on MIMD computers. The template is based on the parallel divide and conquer function of Z.G. Mou and P. Hudak (1988). We explore the programmability and performance of this approach by solving some well known numerical problems on a shared memory multiprocessor and a multicomputer. A byproduct of this work is a new parallel algorithm for solving tridiagonal systems of equations.
An adaptive mobile wireless handover
Authors: Robert N. Smith, Balan Mahesh, Sharada Bindiganavale
Venue: Proceedings of the 21st International Computer Software and Applications Conference (1997)

The paper recommends a mobile assisted look ahead handover protocol with a self position locating feature to be utilized primarily as a network layer protocol to enhance handover. The handover protocol has been designed to improve the quality of service primarily during handover operations. A preconceived optimal list of candidate parent base stations is generated by the mobile unit while also performing triangulation on the pilot/beacon channel signal. Redundancy is included to provide for a higher probability of handover success.
A 2-D Parallel Convex Hull Algorithm with Optimal Communication Phases
Authors: Jieliang Zhou, Xiaotie Deng, Patrick W. Dymond
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

We investigate the problem of finding the two-dimensional convex hull of a set of points on a coarse-grained parallel computer. Recently Goodrich has devised a parallel sorting algorithm for n items on P processors which achieves an optimal number of communication phases for all ranges of P
An Investigation into the Effects of Code Coupling on Team Dynamics and Productivity
Authors: James Westland Cain, Rachel Jane McCrindle
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

During the past three decades a number of theories have been proposed to explain the idiosyncrasies of software development as a team activity. These theories variously relate to: adding more programmers to a late project makes it later (Brooks); the structure of the systemmirrors the structure of the organization that designed it (Conway); software modules are a responsibility assignment (Parnas) and one must consider stability and responsibility during dependency analysis (Martin). This paper compares and combines these theories into acoherent model of software development that links software coupling and dependency management with team productivity.As a practical test of this model, the paper then investigates the effects of coupling in two large commercial systems (both measured in person decades of effort). It achieves this by using the VCML Views visualisation technique, developed by the authors, to expose the system wide coupling found in the code and how this coupling develops during the lifetime of a project. It then compares the resultant VCML views with simple attributes of the two projects, such as programmer numbers and programmer productivity to derive a set of important conclusions.In particular, it finds that unmanaged coupling within the code is a good indicator of potential productivity bottlenecks; that the number of programmers on a project is not necessarily a good indicator of programmer productivity; and that the architecture of a software system can radically alter the number of programmers that can effectively work together on a system.
An empirical study of datapath, memory hierarchy, and network in SIMD array architectures
Authors: Martin C. Herbordt, Charles C. Weems
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

Although SIMD arrays have been built for 30 years, they have as a class been the subject of few empirical design studies. Using ENPASSANT, a simulation environment developed for that purpose, we analyze several aspects of SIMD array architecture with respect to a test suite of spatially mapped applications. Several surprising results are obtained. With respect to memory hierarchy, we find that adding a level of cache to current PE designs is likely to be advantageous, but that such a cache will look quite different than expected. In particular, we find that associativity has unusual significance and that performance varies inversely with block size. Router network results indicate the importance of support for local transfers, broadcast, and reduction even at the expense of arbitrary permutations. Other communication results point to the appropriate dimensionality of k-ary n-cube networks (2 or 3), and the criticality of supporting bidirectional transfers, even if the overall bandwidth remains unchanged.
A Model for Change Propagation Based on Graph Rewriting
Authors: Vaclav Rajlich
Venue: Proceedings of the International Conference on Software Maintenance (1997)

This paper presents a model of change propagation during software maintenance and evolution. Change propagation is modeled as a sequence of snapshots, where each snapshot represents one particular moment in the process, with some software dependencies being consistent and others being inconsistent. A snapshot is changed into the next one by a change in one software entity and the dependencies related to it. The formalism for this process is based on graph rewriting. The paper discusses two basic processes of change propagation: change-and-fix, and top-down propagation. It also describes a prototype tool "Ripples 2" which supports both processes, and an example of the use of the tool.