ppxscal/embedding_network huggingface dataset:
imits on the Power of Quantum Statistical Zero-Knowledge
Authors: John Watrous
Venue: Proceedings of the 43rd Symposium on Foundations of Computer Science (2002)

In this paper we propose a definition for (honest verifier) quantum statistical zero-knowledge interactive proof systems and study the resulting complexity class, which we denote QSZKHV. We prove several facts regarding this class, including:The following problem is a complete promise problem for QSZKHV: given instructions for preparing two mixed quantum states, are the states close together or far apart in the trace norm metric? This problem is a quantum generalization of the complete promise problem of Sahai and Vadhan [25] for (classical) statistical zero-knowledge.QSZKHV is closed under complement.QSZKHV \subseteq PSPACE. (At present it is not known if arbitrary quantum interactive proof systems can be simulated in PSPACE, even for one-round proof systems.)Any polynomial-round honest verifier quantum statistical zero-knowledge proof system can be simulated by a two-message (i.e., one-round) honest verifier quantum statistical zero-knowledge proof system. Similarly, any polynomial-round honest verifier quantum statistical zero-knowledge proof system can be simulated by a three-message public-coin honest verifier quantum statistical zero-knowledge proof system.These facts establish close connections between classical statistical zero-knowledge and our definition for quantum statistical zero-knowledge, and give some insight regarding the effect of this zero-knowledge restriction on quantum interactive proof systems. The relationship between our definition and possible definitions of general (i.e., not necessarily honest) quantum statistical zero-knowledge are also discussed.
Evaluating and Selecting Web Sources as External Information Resources of a Data Warehouse
Authors: Yan Zhu, Alejandro P. Buchmann
Venue: Proceedings of the 3rd International Conference on Web Information Systems Engineering (2002)

A company's local data often is not sufficient toanalyze market trends and make reasonable businessplans. Decision making must also be based on informationfrom suppliers, partners and competitors. Systematicallyintegrating suitable external data from the Web into a datawarehouse is a meaningful solution and will benefit theenterprise. However, the autonomy and the dynamics ofthe Web make the task of selecting relevant and qualifiedexternal data from the Web challenging.In this paper, we develop a set of criteria for evaluatingand selecting Web resources as external data sources of adata warehouse and discuss how to screen Web data sourcesusing Multi-Criteria Decision Making (MCDM) methods.The final decision with respect to selecting Web sources issensitive to critical factors, i.e., the criterion weight and theperformance score of alternatives in terms of each criterion.In this paper, we analyzed the sensitivity of the final rankof alternatives in terms of the critical factors in oder togain an insight into the stability of our final decision. Thecomparison of several MCDM approaches for Web sourcescreening is also presented in the paper.
Representing OCRed documents in HTML
Authors: Tao Hong, Sargur N. Srihari
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

OCR is an error-prone process. It is time-consuming and expensive to manually proofread OCR results. The errors remaining in OCRed texts can cause serious problems in reading and understanding if they do not refer to the original image representation. As demonstrated in this paper, a hybrid document which combines symbolic representation and image representation may relieve the problem. If we represent a OCRed document properly in HTML, OCR errors will not have much negative effect on the human reading process in an HTML browser and can be corrected by using an HTML authoring tool. Under this approach, an experiment evaluating a Japanese OCR system developed at CEDAR is also reported in this paper.
A QoS-Sensitive Content Adaptation System for Mobile Computing
Authors: W. Y. Lum, Francis C. M. Lau
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

We propose a decision engine with QoS awareness that can automatically negotiate for the appropriate adaptation strategies to use to produce an optimal adapted version. The QoS-sensitive approach complements the lossy nature of the transcoding operations. The decision engine will look for the best tradeoff among various parameters in order to reduce the loss of quality in various domains. Quantitative methods are suggested to measure the QoS of the content versions. Based on the particular user perception of these quality domains and other context information on the client capability, the proposed negotiation algorithm will determine a content version with a good aggregate score. We study factors such as processing overhead and the optimization accuracy of the algorithm, and their tradeoff. We have built a prototype document adaptation system for PDF documents to demonstrate the viability of our approach.
Document Presence Notification Services for Collaborative Writing
Authors: Alberto L. Morán, Jesús Favela, Ana María Martínez Enríquez, Dominique Decouchant
Venue: Proceedings of the Seventh International Workshop on Groupware (2001)

Abstract: Instant messaging applications that convey presence awareness are quickly becoming some of the most popular groupware applications. They support lightweight and intermittent interactions that allow users to quickly move between a personal and a collective space, thus blurring the traditional distinction between synchronous and asynchronous systems. Often, however, the focus of collaboration is not another person, but a shared resource that is being produced in collaboration. Thus, rather than being interested in the presence and status of a collaborator, our main interest might be whether a given document is now available for one to read or review, or if such resource has changes since it was last visited. In this paper we describe Doc2U, a system that provides presence awareness of resources stored in the Web. We describe use scenarios that motivated its development and its current implementation as an extended service of a Web server. The tool forms part of the service currently being developed to support collaborative authoring on the WWW under the PINAS platform.
The Postal Network: A Versatile Interconnection Topology
Authors: Jie Wu, Yuanyuan Yang
Venue: Proceedings of the 1998 International Conference on Parallel Processing (1998)

The postal network is an interconnection network that possesses many desirable properties which are important in network design and applications. It includes hypercubes and Fibonacci cubes as its special cases. The postal network can also be considered as a flexible version of the hypercube which relaxes the restriction on the number of nodes and thus makes it possible to construct multicomputers with arbitrary sizes. Basically, the postal network forms a series (with series number $\lambda$) that is based on the sequence $N_{\lambda}(n)= N_{\lambda}(n-1) + N_{\lambda}(n-\lambda)$, where $n$ is the dimension and $N_{\lambda}(n)$ represents the number of nodes in an $n$-dimensional postal network in series $\lambda$. In this paper, we study topological properties of postal networks and relationships between different postal networks. One application of postal networks is also shown in implementing barrier synchronization using a special spanning tree called a postal tree.
XCHOKE: Malicious Source Control for Congestion Avoidance at Internet Gateways
Authors: Panninder Chhabra, Shobhit Chuig, Anurag Goel, Ajita John, Abhishek Kumar, Huzur Saran, Rajeev Shorey
Venue: Proceedings of the 10th IEEE International Conference on Network Protocols (2002)

This paper describes an algorithm to control flows from non-adaptive sources in the Internet in a simple and lightweight fashion. The paper presents experimental results from simulationsthat demonstrate that the algorithm outperforms current well-known algorithms for buffer management in providing better protection for TCP flows under varying degrees of attack fromnon-adaptive flows.
Multi-Chain Prefetching: Effective Exploitation of Inter-Chain Memory Parallelism for Pointer-Chasing Codes
Authors: Nicholas Kohout, Seungryul Choi, Dongkeun Kim, Donald Yeung
Venue: Proceedings of the 2001 International Conference on Parallel Architectures and Compilation Techniques (2001)

Abstract: Pointer-chasing applications tend to traverse composed data structures consisting of multiple independent pointer chains. While the traversal of any single pointer chain leads to the serialization of memory operations, the traversal of independent pointer chains provides a source of memory parallelism. This paper presents multi-chain prefetching, a technique that utilizes off-line analysis and a hardware prefetch engine to prefetch multiple independent pointer chains simultaneously, thus exploiting inter-chain memory parallelism for the purpose of memory latency tolerance. This paper makes three contributions. First, we introduce a scheduling algorithm that identifies independent pointer chains in pointer-chasing codes and computes a prefetch schedule that overlaps serialized cache misses across separate chains. Our analysis focuses on static traversals. We also propose using speculation to identify independent pointer chains in dynamic traversals. Second, we present the design of a prefetch engine that traverses pointer-based data structures and overlaps multiple pointer chains according to our scheduling algorithm. Finally, we conduct an experimental evaluation of multi-chain prefetching and compare its performance against two existing techniques, jump pointer prefetching [9] and prefetch arrays [6]. Our results show multi-chain prefetching improves execution time by 40% across six pointer-chasing kernels from the Olden benchmark suite [14], and by 8% across four SPECInt CPU2000 benchmarks. Multi-chain prefetching also outperforms jump pointer prefetching and prefetch arrays by 28% on Olden, and by 12% on SPECInt. Furthermore, speculation can enable multi-chain prefetching for some dynamic traversal codes, but our technique loses its effectiveness when the pointer-chain traversal order is unpredictable. Finally, we also show that combining multi-chain prefetching with prefetch arrays can potentially provide higher performance than either technique alone.
A memory-layout oriented run-time technique for locality optimization
Authors: Yong Yan, Xiaodong Zhang, Zhao Zhang
Venue: Proceedings of the 1998 International Conference on Parallel Processing (1998)

Exploiting locality at run-time is a complementary approach to a compiler approach for those applications with dynamic memory access patterns. This paper proposes a memory-layout oriented approach to exploit cache locality for parallel loops at run-time on Symmetric Multi-Processor (SMP) systems. Guided by application dependent hints and the targeted cache architecture, it reorganizes and partitions a parallel loop through shrinking and partitioning the memory access space of the loop at run-time. In the generated task partitions, the data sharing among partitions is minimized and data reuse in a partition is maximized. The execution of tasks in partitions is scheduled in an adaptive and locality-preserved way to achieve balanced execution, for minimizing the execution time of applications by trading off load balance and locality.Based on simulation and measurement, we show our run-time approach can achieve comparable performance with the compiler optimizations for two applications, whose load balance and cache locality can be well optimized by the tiling and other program transformations. However, our experimental results also show that our approach is able to significantly improve the memory performance for the applications with dynamic memory access patterns. This type of programs are usually hard to be optimized by compilers.
An Object-Oriented form Description Language and Approach to Handwritten Form Processing
Authors: C. Cracknell, Andy C. Downton, L. Du
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

Virtually all form processing systems rely upon a form description file which holds some form design specific information. Such files are written in a form description language. This paper presents a novel form description language and a new approach to form processing which makes full use of the language.The form description language which is presented is novel in two ways: firstly, it allows the comprehensive utilisation of contextual information; secondly, it enables the storage of form models which economically describe the variations in the form design which are allowed for a particular class of forms.
Navigation Server: A Highly Parallel DBMS on Open Systems
Authors: Ron-Chung Hu, Rick Stellwagen
Venue: Proceedings of the Eleventh International Conference on Data Engineering (1995)

Navigation Server was jointly developed to provide a highly scalable, high-performance parallel database server in the industry. By combining ATandT's experience in massively parallel systems, such as Teradata system, with Sybase's industry-leading open, client/server DBMS, Navigation Server was developed with some specific design objectives: Scalability. Minimizing interference by minimizing resource sharing among the concurrent processes, the shared-nothing architecture has, as of today, emerged as the architecture of choice for highly scalable parallel systems. Navigation Server adopts the shared-nothing parallel architecture to allow parallelized queries, updates, load, backup, and other utilities on a partitioned database. Portability Built on top of Sybase's open system products, Navigation Server is portable to Unix-based parallel machines. Further the shared-nothing software architecture demands minimal changes when porting Navigation Server to various parallel platforms ranging from symmetric multi-processing, clustered, to massively parallel processing systems. Availability. For a parallel system with many nodes, it may be often to see some hardware component failure. To achieve high availability, Navigation Server implements a hierarchical monitoring scheme to monitor all the running processes. With the monitoring frequency configurable by users, a process will be restarted automatically on an alternate node once a failure is detected. Usability. Navigation Server appears as a single Sybase SQL server to end users. Besides, it provides Sybase SQL Server two management tools: Configurator and Navigation Server Manager. The Configurator analyzes customers' workload, monitors system performance, and recommends configurations for optimal performance and resource utilization. The Navigation Server Manager provides graphical utilities to administer the system simply and efficiently.
Are We Moving Toward an Information SuperHighway or a Tower of Babel? The Challenge of Large-Scale Semantic Heterogeneity
Authors: Stuart E. Madnick
Venue: Proceedings of the Twelfth International Conference on Data Engineering (1996)

The popularity and growth of the "Information Super Highway" have dramatically increased the number of information sources available for use. Unfortunately, there are significant challenges to be overcome. One particular problem is context interchange, whereby each source of information and potential receiver of that information may operate with a different context, leading to large-scale semantic heterogeneity. A context is the collection of implicit assumptions about the context definition (i.e., meaning) and context characteristics (i.e., quality) of the information. This paper describes various forms of context challenges and examples of potential context mediation services, such as data semantics acquisition, data quality attributes, and evolving semantics and quality, that can mitigate the problem.
A Spectral Algorithm for Learning Mixtures of Distributions
Authors: Santosh Vempala, Grant Wang
Venue: Proceedings of the 43rd Symposium on Foundations of Computer Science (2002)

We show that a simple spectral algorithm for learning a mixture of k spherical Gaussians in Rn works remarkably well ¿ it succeeds in identifying the Gaussians assuming essentially the minimum possible separation between their centers that keeps them unique (solving an open problem of [1]). The sample complexity and running time are polynomial in both n and k. The algorithm also works for the more general problem of learning a mixture of "weakly isotropic" distributions (e.g. a mixture of uniform distributions on cubes).
Improving I/O response times via prefetching and storage system reorganization
Authors: Chye-Lin Chee, Hongjun Lu, Hong Tang, C. V. Ramamoorthy
Venue: Proceedings of the 21st International Computer Software and Applications Conference (1997)

We present a storage management system that has the ability to adapt to the data access characteristics of the application that uses it, based on collection and analysis of runtime statistics. Adaptive reorganization is performed by the storage management system in a manner that optimizes the access patterns of the system for which it is used. Application-specific data clustering mechanisms can also be specified to override the default mechanisms provided by our prototype. Performance results from our prototype show potential read time speedups of over 80% in the best case, using a combination of storage reorganization and prefetching.
Parallelization of a wave propagation application using a data parallel compiler
Authors: Françoise André, Marc Le Fur, Yves Mahéo, Jean-Louis Pazat
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

The paper presents the parallelization process of a wave propagation application using the PANDORE environment. The PANDORE environment has been designed to facilitate the programming of data distributed applications for distributed memory computers or clusters of workstations. The compilation schemes are described and the distribution of the well known Jacobi kernel is detailed. Finally, the different steps of the parallelization of the wave propagation application are described and the results of this experiment are discussed.
Buffer Management for Video Database Systems
Authors: Doron Rotem, J. Leon Zhao
Venue: Proceedings of the Eleventh International Conference on Data Engineering (1995)

Future multimedia information systems are likely to manage thousands of videos with various lengths and display requirements. Mismatch of playback and delivery rates of compressed video data requires sophisticated buffer management algorithms to guarantee smooth playback of video data. In this paper, we address some of the many design and operational issues including buffer size requirements, refreshing policies, and support of multiple access points to the same video object. Three different buffer management strategies are proposed and analyzed to minimize the average waiting time while ensuring display without jerkiness. We also evaluate the effectiveness these buffer management strategies with a simulation study.
Probabilistic Abstraction for Model Checking: An Approach Based on Property Testing
Authors: Sophie Laplante, Richard Lassaigne, Frédéric Magniez, Sylvain Peyronnet, Michel de Rougemont
Venue: Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science (2002)

The goal of model checking is to verify the correctness of a given program, on all its inputs. The main obstacle, in many cases, is the intractably large size of the program's transition system. Property testing is a randomized method to verify whether some fixed property holds on individual inputs, by looking at a small random part of that input. We join the strengths of both approaches by introducing a new notion of probabilistic abstraction, and by extending the framework of model checking to include the use of these abstractions.Our abstractions map transition systems associated with large graphs to small transition systems associated with small random subgraphs. This reduces the original transition system to a family of small, even constant-size, transition systems. We prove that with high probability, "sufficiently" incorrect programs will be rejected (\in-robustness). We also prove that under a certain condition (exactness), correct programs will never be rejected (soundness).Our work applies to programs for graph properties such as bipartiteness, k-colorability, or any ¿ ¿ first order graph properties. Our main contribution is to show how to apply the ideas of property testing to syntactic programs for such properties. We give a concrete example of an abstraction for a program for bipartiteness. Finally, we show that the relaxation of the test alone does not yield transition systems small enough to use the standard model checking method. More specifically, we prove, using methods from communication complexity, that the OBDD size remains exponential for approximate bipartiteness.
On the Stability of Temporal Data Reference Profiles
Authors: Trishul M. Chilimbi
Venue: Proceedings of the 2001 International Conference on Parallel Architectures and Compilation Techniques (2001)

Abstract: Growing computer system complexity has made program optimization based solely on static analyses increasingly difficult. Consequently, many code optimizations incorporate information from program execution profiles. Most memory system optimizations go further and rely primarily on profiles. This reliance on profiles makes off-line optimization effectiveness dependent on profile stability across multiple program runs. While code profiles such as basic block, edge, and branch profiles, have been shown to satisfy this requirement, the stability of data reference profiles, especially temporal data reference profiles that are necessary for cache-level optimizations, has neither been studied nor established. This paper shows that temporal data reference profiles expressed in terms of hot data streams, which are data reference sequences that frequently repeat, are quite stable; an encouraging result for memory optimization research. Most hot data streams belong to one of two categories-those that appear in multiple runs with their data elements referenced in the same order, and those with the same set of elements referenced in a different order-and this category membership is extremely stable. In addition, the fraction of hot data streams that belong to the first category is quite large.
VIFOR 2: a tool for browsing and documentation
Authors: Vaclav Rajlich, Sridhar Reddy Adnapally
Venue: Proceedings of the 1996 International Conference on Software Maintenance (1996)

During the maintenance of legacy systems, the structure and the documentation of the system usually deteriorates, and hence the maintenance becomes progressively harder and harder. In order to reverse this deterioration, it is essential to record the understanding of the system continually, before it is forgotten. It is also important to structure it in such a way that it can be easily accumulated and retrieved. The authors present a tool called VIFOR 2, which is oriented rewards this situation. The tool combines two technologies: browsing and hypertext documentation. The browser supports rapid navigation around the code. The layered hypertext supports the incremental recording and retrieval of the documentation on the desired level of abstraction (domain, algorithm, representation, etc.). They briefly discuss their own experience with the tool.