ppxscal/embedding_network huggingface dataset:
Restoration of Archival Documents Using a Wavelet Technique
Authors: Chew Lim Tan, Ruini Cao, Peiyi Shen
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

This paper addresses a problem of restoring handwritten archival documents by recovering their contents from the interfering handwriting on the reverse side caused by the seeping of ink. We present a novel method that works by first matching both sides of a document such that the interfering strokes are mapped with the corresponding strokes originating from the reverse side. This facilitates the identification of the foreground and interfering strokes. A wavelet reconstruction process then iteratively enhances the foreground strokes and smears the interfering strokes so as to strengthen the discriminating capability of an improved Canny edge detector against the interfering strokes. The method has been shown to restore the documents effectively with average precision and recall rates for foreground text extraction at 84 percent and 96 percent, respectively.
A new fuzzy controller for stabilization of parallel-type double inverted pendulum system
Authors: Jianqiang Yi, Naoyoshi Yubazaki, Kaoru Hirota
Venue: Fuzzy Sets and Systems (2002)

A new fuzzy controller with 6 input items and 1 output item for stabilizing a parallel-type double inverted pendulum system is presented based on the single input rule modules (SIRMs) dynamically connected fuzzy inference model. Each input item is assigned with a SIRM and a dynamic importance degree. The SIRMs and the dynamic importance degrees are designed such that the angular control of the longer pendulum takes the highest priority over the angular control of the shorter pendulum and the position control of the cart when the angle of the longer pendulum is big. By using the SIRMs and the dynamic importance degrees, the priority orders of the three controls are automatically adjusted according to control situations. The proposed fuzzy controller has a simple and intuitively understandable structure, and executes the three controls entirely in parallel. Simulation results show that the proposed fuzzy controller can stabilize completely a parallel-type double inverted pendulum system within 10.0 s for a wide range of the initial angles of the two pendulums. This is the first result for a fuzzy controller to achieve successfully complete stabilization control of a parallel-type double inverted pendulum system.
General Modeling and Performance Analysis for Location Management in Wireless Mobile Networks
Authors: Yuguang Fang
Venue: IEEE Transactions on Computers (2002)

Location management plays a significant role in current and future wireless mobile networks in effectively delivering services to the mobile users on the move. Many schemes have been proposed and investigated extensively in the last decade. However, most performance analyses were carried out either under simplistic assumptions on some time variables or via simulations. In this paper, we present a new analytical approach to investigate the tradeoff (cost) analysis for location management schemes under fairly general assumption. For two specific location management schemes, Pointer Forwarding Scheme (PFS) and Two-Location Algorithm (TLA), we present analytical formulae to compute the total costs. These formulae are easy to compute. Numerical results show that the traditional exponential model approximation may lead to a wrong decision in the tradeoff analysis. However, our analytical results can be easily used to find the appropriate parameters in PFS and TLA.
Sequential and Parallel Cellular Automata-Based Scheduling Algorithms
Authors: Franciszek Seredynski, Albert Y. Zomaya
Venue: IEEE Transactions on Parallel and Distributed Systems (2002)

In this paper, we present a novel approach to designing cellular automata-based multiprocessor scheduling algorithms in which extracting knowledge about the scheduling process occurs. This knowledge can potentially be used while solving new instances of the scheduling problem. We consider the simplest case when a multiprocessor system is limited to two-processors, but we do not imply any limitations on the size and parameters of parallel programs. To design cellular automata corresponding to a given program graph, we propose a generic definition of program graph neighborhood, transparent to the various kinds, sizes, and shapes of program graphs. The cellular automata-based scheduler works in two modes. In learning mode we use a genetic algorithm to discover rules of cellular automata suitable for solving instances of a scheduling problem. In operation mode, discovered rules of cellular automata are able to automatically find an optimal or suboptimal solution of the scheduling problem for any initial allocation of a program graph in two-processor system graph. Discovered rules are typically suitable for sequential cellular automata working as a scheduler, while the most interesting and promising feature of cellular automata are their massive parallelism. To overcome difficulties in evolving parallel cellular automata rules, we propose using coevolutionary genetic algorithm. Discovered this way, rules enable us to design effective parallel schedulers. We present a number of experimental results for both sequential and parallel scheduling algorithms discovered in the context of a cellular automata-based scheduling system.
Fault Diagnosis for Linear Analog Circuits
Authors: Jun Weir Lin, Chung Len Lee, Chau Chin Su, Jwu-E. Chen
Venue: Journal of Electronic Testing: Theory and Applications (2001)

This paper presents a novel scheme to diagnose single and double faults for linear analog circuits. The scheme first proposes a simple transformation procedure to transform the tested linear analog circuit into a discrete signal flow graph, then constructs &ldquo;diagnosing evaluators,&rdquo; which model the faulty components, to form a diagnosis configuration to diagnose the faults through digital simulation. This saves much computation time. Furthermore, a simple method to un-power OP's is also proposed to differentiate equivalent faults. The scheme can diagnose faults in passive components as well as active faults in OP's.
Rational Communication in Multi-Agent Environments
Authors: Piotr J. Gmytrasiewicz, Edmund H. Durfee
Venue: Autonomous Agents and Multi-Agent Systems (2001)

We address the issue of rational communicative behavior among autonomous self-interested agents that have to make decisions as to what to communicate, to whom, and how. Following decision theory, we postulate that a rational speaker should design a speech act so as to optimize the benefit it obtains as the result of the interaction. We quantify the gain in the quality of interaction in terms of the expected utility, and we present a framework that allows an agent to compute the expected utilities of various communicative actions. Our framework uses the Recursive Modeling Method as the specialized representation used for decision-making in a multi-agent environment. This representation includes information about the agent's state of knowledge, including the agent's preferences, abilities and beliefs about the world, as well as the beliefs the agent has about the other agents, the beliefs it has about the other agents' beliefs, and so on. Decision-theoretic pragmatics of a communicative act can be then defined as the transformation the act induces on the agent's state of knowledge about its decision-making situation. This transformation leads to a change in the quality of interaction, expressed in terms of the expected utilities of the agent's best actions before and after the communicative act. We analyze decision-theoretic pragmatics of a number of important kinds of communicative acts and investigate their expected utilities using examples. Finally, we report on the agreement between our method of message selection and messages that human subjects choose in various circumstances, and show an implementation and experimental validation of our framework in a simulated multi-agent environment.
PC Software Performance Tuning
Authors: Mark Atkins, Ramesh Subramaniam
Venue: Computer (1996)

PC hardware doubles in processing power every two years, or with each new generation, at approximately constant price. But software has not. Sixteen-bit code developed in the 1980s or early '90s may be slowed two to 20 times by I/O bottlenecks like VGA graphics, artificial data dependencies, poor memory use, obsolete compilers and libraries, and a host of other factors. Software can be designed to scale more readily with greater hardware power, but programmers typically do not profile their code unless it runs "too slowly." Modern compilers provide excellent executables, but developers must choose the best settings of compiler switches, profilers, and optimized runtime libraries. They must also understand the intricacies and idiosyncrasies of the target hardware--in this case, the Intel 486, Pentium, Pentium Pro processors, and the new MMX technology. They must also consider what types of algorithms lend themselves to optimization and what code optimization techniques are most effective. We consider each of these issues before describing a profiling tool called VTune.
The Myth of the Educational Computer
Authors: W. Neville Holmes
Venue: Computer (1999)

To dispel the delusion that the computer by itself can educate, the author believes computer professionals need to press for reforms that properly exploit digital technology in the classroom. He feels that the current computer-as-educator delusion is harmful and yet seems to go largely unquestioned, even by computing professionals. Despite the fact that good technical work is being done to develop course-ware, what seems to be missing is a full appreciation of the relationship between technology and education. Literature on the subject suggests that much of the work done by computing professionals is isolated from what generally goes on in schools. The computing profession's focus seems to be on how to find smart ways to use computers in the classroom, not on how to solve the really important problems deplored in the educational literature. The author claims that if the profession was doing all its educational computing work in close partnership with professional educators, more computing professionals would be pressing for the reforms needed to exploit digital technology properly. The primary responsibility for what happens in schools must remain with the professional educators. But educators need the support of the computing profession to ensure that they are fully and properly trained and supported in their use of computers.
Process Definition: Theory and Reality
Venue: IEEE Software (1992)

The approach taken by General Electric Aerospace to define the process it uses to develop and maintain software is outlined. It is shown that two major issues in process definition are deciding what information to include and what form of graphical representation to use. The lessons learned in developing and implementing this approach are discussed.
Processing large-scale multi-dimensional data in parallel and distributed environments
Authors: Michael Beynon, Chialin Chang, Umit Catalyurek, Tahsin Kurc, Alan Sussman, Henrique Andrade, Renato Ferreira, Joel Saltz
Venue: Parallel Computing (2002)

Analysis of data is an important step in understanding and solving a scientific problem. Analysis involves extracting the data of interest from all the available raw data in a dataset and processing it into a data product. However, in many areas of science and engineering, a scientist's ability to analyze information is increasingly becoming hindered by dataset sizes. The vast amount of data in scientific datasets makes it a difficult task to efficiently access the data of interest, and manage potentially heterogeneous system resources to process the data. Subsetting and aggregation are common operations executed in a wide range of data-intensive applications. We argue that common runtime and programming support can be developed for applications that query and manipulate large datasets. This paper presents a compendium of frameworks and methods we have developed to support efficient execution of subsetting and aggregation operations in applications that query and manipulate large, multi-dimensional datasets in parallel and distributed computing environments.
Performance evaluation of three distributed computing environments for scientific applications
Authors: Rod Fatoohi, Sisira Weeratunga
Venue: Proceedings of the 1994 ACM/IEEE conference on Supercomputing (1994)

We present performance results for three distributed computing environments using the three simulated CFD applications in the NAS Parallel Benchmark suite. These environments are the DCF cluster, the LACE cluster, and an Intel iPSC/860 machine. The DCF is a prototypic cluster of loosely coupled SGI R3000 machines connected by Ethernet. The LACE cluster is a tightly coupled cluster of 32 IBM RS6000/560 machines connected by Ethernet as well as by either FDDI or an IBM Allnode switch. Results of several parallel algorithms for the three simulated applications are presented and analyzed based on the interplay between the communication requirements of an algorithm and the characteristics of the communication network of a distributed system.
Concurrent Communication in High-Speed Wide Area Networks
Authors: J. K. Antonio
Venue: IEEE Transactions on Parallel and Distributed Systems (1994)

A performance metric called receptivity is introduced for quantifying the degree ofconcurrent communication possible in high-speed wide area networks (WAN's). Given astochastic demand pattern model, receptivity is defined to be the probability that allrequested connections can be established concurrently. Because calculation of the exactvalue of receptivity is shown to (generally) have an exponential complexity, an analyticestimate for its value is derived. The derived estimate is dependent on networkparameters such as the number of links, link capacity values, and a weighted hopdistance metric (which depends on the topological structure of the network and itsrelationship to parameter values of the stochastic model for the demand patterns). Thederived estimate for the proposed metric compares reasonably well with simulated valuesfor several asymmetric topological structures ranging from planar meshes to randomgraphs. The utility of the estimate is twofold. First, it can be computed quickly, i.e., inpolynomial time. Second, its simple analytic form provides the network architect withinsight into some of the inherent limitations and consequences associated with topological design choices for high-speed WAN's.
Computing Reliability Intervals for k-Resilient Protocols
Authors: Yennun Huang, Sampath Rangarajan, Satish K. Tripathi
Venue: IEEE Transactions on Computers (1995)

k-resilient protocols are used in some parallel and distributed system applications for increased availability of resources. A protocol running on an n site system is k resilient if it could tolerate up to k failures and operate correctly. The reliability of such a protocol is defined as the probability that no more than k sites have failed. Such a k-resilient protocol is beneficial only when its reliability is greater than the reliability of a protocol running on a system with a single site. We consider k-resilient protocols and develop a general technique for approximately computing the time until which these protocols have higher reliability than protocols running on single site systems. We call this time the reliability interval. Our general techniques for computing the reliability interval can be used irrespective of the type of failure distribution (with respect to time) of the sites of the system. We use experimental results to validate our technique.
Interpreting Reverse-Engineering Law
Venue: IEEE Software (1990)

No abstract available The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Constraint satisfaction for relative location assignment and scheduling
Authors: Carlos Alba-Pinto, Bart Mesman, Jochen Jess
Venue: Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design (2001)

Tight data-and timing constraints are imposed by communication and multimedia applications. The architecture for the embedded processor imply resource constraints. Instead of random-access registers, relative location storages or rotating register files are used to exploit the available parallelism of resources by means of reducing the initiation interval in pipelined schedules. Therefore, the compiler or synthesis tool must deal with the difficult tasks of scheduling of operations and location assignment of values while respecting all the constraints including the storage file capacity. This paper presents a method that handles constraints of relative location storages during scheduling together with timing and resource constraints. The characteristics of the coloring of conflict graphs, representing the relative overlap of value instances, are analyzed in order to identify the bottlenecks for location assignment with the aim of serializing their lifetimes. This is done with pairs of loop instances of values until it can be guaranteed that all constraints will be satisfied. Experiments show that high quality schedules for kernels and inner loops can be efficiently obtained.
Review and Development of Reception Reliability Estimation Techniques for Mobile Radio System Planning
Authors: Helen D. M. Gurr, Kevin W. Sowerby
Venue: Wireless Personal Communications: An International Journal (1999)

There are two general types of reception reliability estimation techniques presented in the literature, namely bit detection techniques and statistical channel techniques. This paper presents a review of these techniques and assesses their usefulness as tools for system planners. In the planning of wideband systems the effects of power delay spread need to be considered. A new statistical channel technique incorporating delay spread, noise and cochannel interference is presented in this paper. The results from this technique are consistent with those derived from more specialised and computationally expensive bit detection techniques.
Interleaved All-to-All Reliable Broadcast on Meshes and Hypercubes
Authors: S. Lee, K. G. Shin
Venue: IEEE Transactions on Parallel and Distributed Systems (1994)

All-to-all (ATA) reliable broadcast is the problem of reliably distributing information from every node to every other node in point-to-point interconnection networks. A goodsolution to this problem is essential for clock synchronization, distributed agreement, etc.We propose a novel solution in which the reliable broadcasts from individual nodes areinterleaved in such a manner that no two packets contend for the same link at any giventime-this type of method is particularly suited for systems which use virtual cut-throughor wormhole routing for fast communication between nodes. Our solution, called the IHCAlgorithm, can be used on a large class of regular interconnection networks includingregular meshes and hypercubes. By adjusting a parameter /spl eta/ referred to as theinterleaving distance, we can flexibly decrease the link utilization of the IHC algorithm (for normal traffic) at the expense of an increase in the time required for ATA reliablebroadcast. We compare the IHC algorithm to several other possible virtual cut-throughsolutions and a store-and-forward solution. The IHC algorithm with the minimum value of /spl eta/ is shown to be optimal in minimizing the execution time of ATA reliable broadcast when used in a dedicated mode (with no other network traffic).
Automatic Knowledge Acquisition and Maintenance for Semantic Query Optimization
Authors: C. T. Yu, W. Sun
Venue: IEEE Transactions on Knowledge and Data Engineering (1989)

The authors present an approach to acquiring knowledge from previously processed queries. By using newly acquired knowledge together with given semantic knowledge, it is possible to make the query processor and/or optimizer more intelligent so that future queries can b processed more efficiently. The acquired knowledge is in the form of constraints. While some constraints are to be enforced for all database states, others are known to be valid for the current state of the database. The former constraints are statistic integrity constraints, while the latter are called dynamic integrity constraints. Some situations in which certain dynamic semantic constraints can be automatically extracted are identified. This automatic tool for knowledge acquisition can also be used as an interactive tool for identifying potential static integrity constraints. The concept of minimal knowledge base is introduced, and a method to maintain the knowledge base is presented. An algorithm to compute the restriction (selection) closure, i.e. all deductible restrictions, from a given set of restrictions, join predicates (as given in a query), and constraints is given.
Special numbers of crossings for complete graphs
Authors: Heiko Harborth
Venue: Discrete Mathematics (2002)

Cycle drawings of Kn use edges either inside or outside of a convex n-gon. The smallest n such that a drawing of Kn exists and a cycle drawing with the same number of crossings does not exist is proved to be at most 14, and equality is conjectured.
Algorithms and reductions for rewriting problems. II
Authors: Rakesh Verma
Venue: Information Processing Letters (2002)

In this paper we give polynomial-time reductions between a version of joinability for rewrite systems and the word problem for rewrite systems. We prove log-space hardness or completeness for P for several problems of ground rewrite systems. We show that matching (and unification) modulo ground equations is NP-hard even when variables are restricted to at most two occurrences in the pattern and the subject is just a constant. Finally, we give the first polynomial-time algorithms for matching modulo ground equations with linear pattern and for joinability problem with ground rewrite systems. The joinability result leads to polynomial time algorithms for: local confluence of ground rewrite systems, confluence of terminating ground rewrite systems, and completeness of ground rewrite systems. The results for matching modulo ground equations are optimal with respect to occurrences of variables.
Visibility: The Key To Quality Improvement
Authors: Suzanne Robertson
Venue: IEEE Software (1995)

Sometimes we forget that software is part of a larger system, which includes not only people and hardware, but possibly different organizations and even cultures. Suzanne Robertson, principal in the Atlantic Systems Guild, shows us how, by viewing software from a systems perspective, we can take advantage of these diverse information sources to make problems visible and improve the software¿s quality.¿ Shari Lawrence-Pfleeger The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player