ppxscal/embedding_network huggingface dataset:
A communication network architecture for transportation information systems
Authors: Y. N. Doganata, D. C. Gazis, A. N. Tantawi
Venue: Proceedings of the IEEE Symposium on Computers and Communications (ISCC'95) (1995)

An emerging application of mobile computing and communication is the delivery of information related to the transportation system to drivers and travelers. Such real-time information would be very valuable in providing services such as pre-trip planning, route guidance, intermodal transportation, yellow pages, and ride matching and reservation. This so-called advanced traveler information system (ATIS) is an important subset of an intelligent transportation system (ITS). The authors are developing an ATIS operational field test called SWIFT (Seattle wide-area information for travelers) in the Seattle metropolitan area which uses technological advances in wireless communication, personal digital assistants (PDA), and traffic modeling and analysis. SWIFT uses an advanced 19 kbps FM subcarrier broadcast medium for the delivery of transportation information as well as personal paging information. Preliminary description of the logical and physical architecture of the SWIFT system along with communication loading analysis for this system, are presented.
Equational binary decision diagrams
Authors: Jan F Groote, Jaco C. Pol
Venue:  (2000)

We incorporate equations in binary decision diagrams (BDD). The resulting objects are called EQ-BDDs. A straightforward notion of ordered EQ-BDDs (EQ-OBDD) is defined, and it is proved that each EQ-BDD is logically equivalent to an EQ-OBDD. Moreover, on EQ-OBDDs satisfiability and tautology checking can be done in constant time. Several procedures to eliminate equality from BDDs have been reported in the literature. Typical for our approach is that we keep equalities, and as a consequence do not employ the finite domain property. Furthermore, our setting does not strictly require Ackermann''s elimination of function symbols. This makes our setting much more amenable to combinations with other techniques in the realm of automatic theorem proving, such as term rewriting. We introduce an algorithm, which for any propositional formula with equations finds an EQ-OBDD that is equivalent to it. The algorithm is proved to be correct and terminating, by means of recursive path ordering. The algorithm has been implemented, and applied to benchmarks known from literature. The performance of a prototype implementation is comparable to existing proposals.
Remeshing into normal meshes with boundaries using subdivision
Authors: Kyu-Yeul Lee, Seong-Chan Kang, Tae-Wan Kim
Venue: Computers in Industry (2003)

In this paper, we present a remeshing algorithm using the recursive subdivision of irregular meshes with boundaries. A mesh remeshed by subdivision has several advantages. It has a topological regularity, which enables it to be used as a multiresolution model and to represent an original model with less data. Topological regularity is essential for the multiresolutional analysis of the given meshes and makes additional topological information unnecessary. Moreover, we use a normal mesh to reduce the geometric data size requirements at each resolution level of the regularized meshes. The normal mesh uses one scalar value, i.e. normal offset as wavelet, to represent a vertex position, while the other remeshing schemes use one three-dimensional vector at each vertex. The normal offset is a normal distance from a base face, which is the simplified original mesh. Since the normal offset cannot be properly used for the boundaries of a mesh, we use a combined subdivision scheme that resolves the problem of the proposed normal offset method at the boundaries. Finally, we show examples that demonstrate the effectiveness of the proposed scheme in terms of reducing the data requirements of mesh models.
Selective Text Utilization and Text Traversal
Authors: Gerard Salton, James Allan
Venue:  (1993)

Many large collections of full-text documents are currently stored in machine-readable form and processed automatically in various ways. These collections may include different types of documents, such as messages, research articles, and books, and the subject matter may vary widely. To process such collections, robust text analysis methods must be used, capable of handling materials in arbitrary subject areas, and flexible access must be provided to texts and text excerpts of varying size. In this study, global text comparison methods are used to identify similarities between text elements, followed by local context-checking operations that resolve ambiguities and distinguish superficially similar texts from texts that actually cover identical topics. A linked text structure is then created that relates similar texts at various levels of detail. In particular, text links are available for full texts, as well as text sections, paragraphs, and sentence groups. The linked structures are usable to identify important text packages, to traverse texts selectively both within particular documents and between documents, and to provide flexible text access to large text collections in response to various kinds of user needs. An automated 29-volume encyclopedia is used as an example to illustrate the text accessing and traversal operations.
Implementing encrypted home directories
Authors: Mike Petullo
Venue: Linux Journal (2003)

Keep your files safely encrypted when you're logged out, and automatically get access when you log in. 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
Software Components Capture Using Graph Clustering
Authors: Yves Chiricota, Fabien Jourdan, Guy Melançon
Venue: Proceedings of the 11th IEEE International Workshop on Program Comprehension (2003)

We describe a simple fast computing and easy to implement method for finding relatively good clusterings of software systems. Our method relies on the ability to compute the strength of an edge in a graph by applying a straight-forward metric defined in terms of the neighborhoods of its end vertices. The metric is used to identify the weak edges of the graph, which are momentarily deleted to break it into several components. We study the quality metric MQ introduced in [5 ] and exhibit mathematical properties that make it a good measure for clustering quality. Letting the threshold weakness of edges vary defines a path, i.e. a sequence of clusterings in the solution space (of all possible clustering of the graph). This path is described in terms of a curve linking MQ to the weakness of the edges in the graph.
A High Speed Encoder for Recursive Systematic Convolutive Codes
Authors: A. M'sir, F. Monteiro, A. Dandache, B. Lepley
Venue: Proceedings of the Proceedings of The Eighth IEEE International On-Line Testing Workshop (IOLTW'02) (2002)

Improving the quality of service is an important target in modern multimedia applications. The main keywords defining the quality of service are the data rate and the data transmission reliability. Error correcting codes are generally employed to achieve the reability of the data transmission. The present trend is to achieve high data rates on low-cost designs (such as FPGAs). Most of the time, parallel architectures are required to process error correctingcodes with high data throughput.In this paper, an effective parallel architecture is proposed for recursive convolutive sytematic encoders. It is based on parallel and pipelining techniques and can be applied to non-recursive encoders. Data rates up to 6.93 Gbits/s can be achieved on FPGA implementations.
An interactive procedure dedicated to a bicriteria plant location model
Authors: Joana Dias, M. Eugénia, João Clímaco
Venue: Computers and Operations Research (2003)

In this paper a new algorithm is described which aims at solving efficiently a simple plant location problem with two additional constraints. Such a problem arises in the calculation phase of an interactive decision aid process that helps the decision-maker finding the non-dominated solutions for a bicriteria simple plant location problem. The two additional constraints impose upper limits on the values of each objective function. If they are relaxed, the problem turns into a simple plant location problem, which can be solved using Dualoc by Erlenkotter (oper. Res. 26(6) (1978) 992). The algorithm developed uses a slightly modified version of-Dualoc (Erlenkotter, 1978) integrated into a branch and bound procedure. The results of several computational experiments are shown, showing that the new algorithm is superior both in the computational time and memory needed, when compared with a general solver.
Interactive visualization of multiway tables
Authors: K. C. Cox, D. Hackborn
Venue: Proceedings of the 1996 IEEE Symposium on Information Visualization (INFOVIS '96) (1996)

Many business data visualization applications involve large databases with dozens of fields and millions of rows. Interactive visualization of these databases is difficult because of the large amount of data involved. We present a method of summarizing large databases which is well suited to interactive visualization. We illustrate this with a visualization tool for the domain of call billing data.
The Effects of Image Enhancement in OCR Systems: A Prototype
Authors: Ray R. Hashemi, Danny Owen, Mark S. Smith, Tim Flanigan, John R. Talburt
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

The accuracy of the Optical Character Recognition (OCR) systems is highly dependent upon the quality of the image. In this paper, we investigate and propose solutions to several issues that can arise in the processing of binary images of scanned, typeset text. The issues of concern are Image Residues from Adjacent Lines, Character Touching, Boldface Character Recognition, and Text Repairing.
Xab: A Tool for Monitoring PVM Programs
Authors: Adam L. Beguelin
Venue:  (1993)

Xab (X-window Analysis and deBugging) is a tool for run time monitoring of PVM (Parallel Virtual Machine) programs. PVM supports the programming of a network of heterogeneous computers as a single parallel computer. Using Xab, PVM programs can easily be instrumented and monitored. Xab uses PVM to monitor PVM programs. This makes Xab very portable but it leads to interesting issues of how to make Xab peacefully coincide with the programs it monitors. Xab consists of three main components, a user library, a monitoring program, and an X windows front end. The user library provides instrumented versions of the PVM calls. The monitoring program runs as a PVM process and gathers monitor events in the form of PVM messages. The Xab front end displays information graphically about PVM processes and messages. This paper discusses the design, implementation, and use of the Xab tool. Related work is briefly presented and contrasted with the approach taken with Xab. How Xab works and how it is used are discussed in detail. Finally, the current status of Xab is presented along with future directions of where the research may go from here.
TransFig: Portable Figures for TEX Version 1.4-TFX Release 4
Authors: Micah Beck
Venue:  (1989)

TransFig is a mechanism for integrating figures into TEX documents. Several ``graphics languages'''' exist which achieve such integration, but none is widely enough used to be called a standard. TransFig''s goal is to maintain the portability of TEX documents across printers and operating environments. The central mechanism in TransFig is Fig code, a graphics editor. TransFig provides an automatic and uniform way to Translate Fig code into various graphics languages and to integrate that code into a TEX document.
CAD Issues for CMOS VLSI Design in SOI
Venue: Proceedings of the 2nd International Symposium on Quality Electronic Design (2001)

This paper reviews recent progress in making circuit-level CAD tools for the design of digital integrated circuits SOI-aware, specifically transistor-level static timing and static noise analysis tools. This involves abstracting the SOI device physics of the floating body, allowing estimates of the body voltage variation under various switching activity assumptions. These body voltage estimates are then applied as "initial conditions" in the constituent simulations of the static analyses. Results are presented for a prototype static timing analysis tool and a commercial static noise analysis tool.
A Realistic Architecture for Timed Testing
Authors: Eric Petitjean, Hacène Fouchal
Venue: Proceedings of the 5th International Conference on Engineering of Complex Computer Systems (1999)

The aim of this paper is to present a convenient test architecture for the purpose of testing timed systems. A timed system is described as timed automaton which is expressed as a region graph. This latter is then translated into a flattened automaton. Test sequences are derived from the flattened automaton. In order to check the conformity of a real life implementation, we detail the test architecture needed to execute the derived test sequences. This architecture considers the behavior part as well as the timed part of the system.
Complexity Models for Incremental Computation
Authors: Bro P Miltersen, Sairam Subramanian, Scott J Vitter, Roberto Tamassia
Venue:  (1994)

\def \nrp {\hbox {\rm {\protect\small NRP}}} \def \poly {\hbox {\rm {\protect\small P}}} \def \nick {\hbox {\rm {\protect\small NC}}} \def \incrplt {\hbox {\rm {\it incr\/}\allowbreak-{\protect\small POLYLOGTIME}}} \def \logsp {\hbox {\rm {\protect\small LOGSPACE}}} \def \incrls {\hbox {\rm {\it incr\/}\allowbreak-{\protect\small LOGSPACE}}} \def \rincrls {\hbox {\rm {\it rincr\/}\allowbreak-{\protect\small LOGSPACE}}} \def \incrpls {\hbox {\rm {\it incr\/}\allowbreak-{\protect\small POLYLOGSPACE}}} \def \nlgsp{\hbox {\rm {\protect\small NLOGSPACE}}} We present a new complexity theoretic approach to incremental computation. We define complexity classes that capture the intuitive notion of incremental efficiency and study their relation to existing complexity classes. We show that problems that have small sequential space complexity also have small incremental time complexity. We show that all common \logsp-complete problems for \poly\ are also \incrplt-complete for \poly. We introduce a restricted notion of completeness called $\nrp$-completeness and show that problems which are $\nrp$-complete for \poly\ are also \incrplt-complete for~\poly. We also give incrementally complete problems for \nlgsp, \logsp, and non-uniform ${\nick}^1$. We show that under certain restrictions problems which have efficient dynamic solutions also have efficient parallel solutions. We also consider a non-uniform model of incremental computation and show that in this model most problems have almost linear complexity. In addition, we present some techniques for lower bounding the complexity of explicitly defined problems. We also look at the time complexity of circuit value and network stability problems restricted to comparator gates. We show that the comparator-circuit value problem and the ``Lex-First Maximal Matching'''' problem are in \incrls\ while the comparator-network stability and the ``Man-Optimal Stable Marriage Problem'''' are in $\rincrls(\nlgsp)$. This shows that the dynamic versions of these problems are solvable quickly in parallel even though there are no known \nick\ algorithms to solve them from scratch.
On an Architecture of Medical Image Registration System Based on Multiple-Valued Logic
Authors: Yutaka Hata, Syoji Kobashi, Naotake Kamiura, Yuri Kitamura, Toshio Yanagida
Venue: Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic (2000)

This paper proposes an architecture of a registration system for medical images. Image registration is the process of determining correspondence between all points in two images of the same scene, and is now widely used to medical images. In medical imaging, segmentation, registration and interpolation play primary roles. In those, registration is the most time consuming task because we compare all voxel data and then evaluate the matching degree many times. Quantitative evaluation criterion of matching degree with multiple-valued coding of the image feature is proposed, and an architecture to save the processing time of the data comparison is described. Finally, as a practical application, we described the summary of a registration of human brain MR volume data to diagnose brain disease.
An Investigation of Feedback Guided Dynamic Scheduling of Nested Loops
Authors: D. J. Hancock, R. W. Ford, T. L. Freeman, J. M. Bull
Venue: Proceedings of the 2000 International Workshop on Parallel Processing (2000)

In previous papers ([2], [3], [7]) feedback guided loop scheduling algorithms have been shown to be very effective for certain loop scheduling problems. In particular they perform well for problems that involve a sequential outer loop and a parallel inner loop, and timing information gathered during one execution of the parallel inner loop can be used to inform the scheduling of the subsequent execution of this loop. In this paper, we consider the extension of these feedback-guided scheduling algorithms to the more important case of nested parallel loops, again within a sequential outer loop. We describe three alternative ways of scheduling nested loops; two are based on reducing the nested loops to a single loop and applying one-dimensional techniques; the third addresses the multidimensionality of the nested loops directly.
Improved and Extended Scalable Image Coding by Spline Approximation for a Binary, Gray-Scale and Color Image
Authors: Ryoji Haruki, Takahiko Horiuchi
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems (2000)

The image coding method for a gray-scale image, which can reconstruct the high quality image against several transformations such as scaling by expressing the image signal as the shape of the mathematical function, had been proposed. This method was also applicable to a binary image, but it had not been applicable to a color image. In addition, there are some problems of the quality in this method. Therefore, this paper attempts to improve the quality and to extend the previous method to a color image. For the quality improvements, the processes at the region segmentation and at the approximation for low frequency components are reformed. For the extension to a color image, the process of the region segmentation is particularly reformed again. The performance of the proposed method is verified by some experiments. Although the quality problems remain slightly still, it is much better than the previous results. In addition, the extension to a color image proves successful. Moreover, these improvement and extension can parallelize the process more effectively.
A Formal Semantics for SPKI
Authors: Jon Howell, David Kotz
Venue:  (2000)

We extend the logic and semantics of authorization due to Abadi, Lampson, et al. to support restricted delegation. Our formal model provides a simple interpretation for the variety of constructs in the Simple Public Key Infrastructure (SPKI), and lends intuition about possible extensions. We discuss both extensions that our semantics supports and extensions that it cautions against.
Subrecursive Program Schemata I & II I. Undecidable Equivalence Problems and II. Decidable Equivalence Problems
Authors: Robert L. Constable, S. S. Muchnick
Venue:  (1972)

The study of program schemata and the study of subrecursive programming languages are both concerned with limiting program structure in order to permit a more complete analysis of algorithms while retaining sufficiently rich computing power to allow interesting algorithms. In this paper we combine these approaches by defining classes of subrecursive program schemata and investigating their equivalence problems. Since the languages are all subrecursive, any scheme written in any one of them must halt (as long as we assume the basic functions and predicates are all total). Hence equivalence of schemes is the first question of interest we can ask about these languages. We consider schematic versions of various subrecursive programming languages similar to the Loop language. We distinguish between Pre-Loop and Post-Loop languages on the basis of whether the exit condition in an iteration loop is tested before iteration, as in Algol (Pre-), or after iteration, as in FORTRAN (Post-). We show that at the program level all these languages have the same computing power (the primitive recursive functions) and all have unsolvable equivalence problems (of arithmetic degree $\Pi^{0}_{1}$). But at the level of schemes, Pre-Loop has an unsolvable equivalence problem, while at least one formulation of Post-Loop has a solvable equivalence problem. If L is a programming language or scheme language, then we denote by E(L) the equivalence problem in L. The basic languages considered are: Loop ($\equiv$ Pre-Loop) Loop language for primitive recursive functions. Post-Loop Post-Loop language for primitive recursive functions. Loop$_{\Diamond}$ Loop language with restricted conditionals. L [D, ()] Loop schemata over D with identity. L$_{\Diamond}$ [D, ()] Loop schemata with conditionals. PL [D, ()] Post-Loop schemata over D. PL$_{\Diamond}$ [D, ()] Post-Loop schemata with conditionals. P Program (flowchart) schemata. P$_{d}$ Program schemata with DO-statements. In contrast to (pure) Loop schemata studied previously by the first author, some of these languages contain the identity function so that a pure data transfer, $X \leftarrow Y$, is possible. Moreover, the equivalence algorithms given here are for the special case of linear schemes (to be defined below) with monadic function variables. Linear schemes are designated by placing L before the name of the more general class, thus LL for linear Loop, LPL for linear Post-Loop, etc. In all schemes considered here the functions are monadic, so no special designation of function rank is provided. It is well known that E(P) is recursively unsolvable and E(P) $\in \Pi^{0}_{2}$. We show that E(Loop), E(Post-Loop), E(L$_{\Diamond}$) (both with and without the pure data transfer), and E(L) are recursively unsolvable, while E(LPL) is recursively solvable. The extension of the equivalence algorithm for LPL to polyadic functions appears at present to be a tedious but straightforward modification to the monadic algorithm. We are hop
Avid Xpress DV 3.5 Editing
Authors: Avid Technology
Venue:  (2002)

:If you're serious about your career as a video editor, you need to learn on the software that the pros use. Avid Xpress DV 3.5 brings broadcast and Hollywood video editing power to your desktop for under $2,000 and Avid Xpress DV 3.5 Editing shows you how to use it. The training experts at Avid have crammed an entire beginner's course into one complete book/CD-ROM combo that lets you get hands-on fast. This book covers all stages of the editing process including how to input and organize source footage, edit sync and non-sync material, trim sequences, edit audio, create titles, and output a finished program. Even if you've never used an Avid system before, step-by-step instructions, illustrated with screenshots and reinforced with review questions and practice exercises, promise to turn you into a proficient Avid user by the time you're through with this comprehensive course. 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