ppxscal/embedding_network huggingface dataset:
Pair Programming on the C3 Project
Authors: Jim Haungs
Venue: Computer (2001)

XP's pair programming helps programmers synthesize their individual expertise into an effective combination.
TellMaris and deep map: two navigational assistants
Authors: Katri Laakso, Christian Kray
Venue: Proceedings of the 8th international conference on Intelligent user interfaces (2003)

This demo will present Tellmaris and Deep Map, two system offering navigational assistance and other services to an untrained user. We will put an emphasis on different ways to present route instructions on mobile devices.
Integrated multi-strategic Web document pre-processing for sentence and word boundary detection
Authors: Junhyeok Shim, Dongseok Kim, Jeongwon Cha, Gary Geunbae Lee, Jungyun Seo
Venue: Information Processing and Management: an International Journal (2002)

Most work in NLP requires that texts have been previously segmented into sentences and words. Segmenting a text into sentences and words, however, is a complex task, due to the ambiguity of many punctuation marks and spaces. Furthermore, Web texts such as HTML documents are more difficult to make into well refined and segmented texts because they are described in a more free style, with many sentence boundary and spacing errors. The objective of this paper introduces a multi-strategic integrated text preprocessing method for difficult problems of sentence boundary disambiguation and word boundary disambiguation of Web texts. We have applied a hybrid method (the regular expression rule, the heuristic rule, and the inductive learning of statistical decision trees, using a C4.5 learner) synergically to the task of raw corpus preprocessing. This work contributes to a more correct morphological analysis and guarantees a more stable working of application systems. We tackle easily definable problems with automatically acquired constraints and we use inductively learned decision trees to solve ill-defined ambiguity problems by incorporating multiple features (n-grams, relative frequency, entropy, tri-dictionary index). The multistrategy approach was thoroughly tested: it achieved approximately 99.12% (with punctuation marks) and 98.04% (without any punctuation marks) accuracy in sentence boundary disambiguation, 95.39% accuracy of word spacing correction, and 94.61% accuracy for whole intermixed text preprocessing problems, from Korean news script Web documents.
Technical writing as a speciality
Authors: Merri Boylan
Venue: Proceedings of the 7th annual ACM SIGUCCS conference on User services (1979)

Good technical writing can enhance the quality of service to users by not only providing readable documentation, but by providing a different point of view in design and debugging of programs and systems that are being documented.
Advanced Transaction Processing in Multilevel Secure File Stores
Authors: Elisa Bertino, Sushil Jajodia, Luigi Mancini, Indrajit Ray
Venue: IEEE Transactions on Knowledge and Data Engineering (1998)

The concurrency control requirements for transaction processing in a multilevel secure file system are different from those in conventional transaction processing systems. In particular, there is the need to coordinate transactions at different security levels avoiding both potential timing covert channels and the starvation of transactions at higher security levels. Suppose a transaction at a lower security level attempts to write a data item that is being read by a transaction at a higher security level. On the one hand, a timing covert channel arises if the transaction at the lower security level is either delayed or aborted by the scheduler. On the other hand, the transaction at the high security level may be subjected to an indefinite delay if it is forced to abort repeatedly. This paper extends the classical two-phase locking mechanism to multilevel secure file systems. The scheme presented here prevents potential timing covert channels and avoids the abort of higher level transactions nonetheless guaranteeing serializability. The programmer is provided with a powerful set of linguistic constructs that supports exception handling, partial rollback, and forward recovery. The proper use of these constructs can prevent the indefinite delay in completion of a higher level transaction, and allows the programmer to trade off starvation with transaction isolation.
Expert Focus-Estimating Manpower Requirements for Expert System Projects
Venue: IEEE Expert: Intelligent Systems and Their Applications (1988)

Guidelines for scoping manpower requirements of rule-based and frame-based expert systems are provided. An evolutionary methodology is presented that allows the estimation structure to increase as problem complexity increases. It is in the form of a six-month formula that enables organizations to get started in expert systems with minimal risk. The first project month is spent picking an expert system tool, isolating a problem, and writing a rudimentary project plan. The next two months are spent getting the first prototype up and running. The fourth month is divided between reviewing where you've been and where you're going. The fifth month is spent finishing the expert system, and the final month in completing system documentation and deployment. 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
LDL: A Technology for the Realization of Tightly Coupled Expert Database Systems
Authors: Shalom Tsur
Venue: IEEE Expert: Intelligent Systems and Their Applications (1988)

The problems encountered in developing expert database systems (EDSs) are described. It is suggested that what is needed is an EDS shell that is general-purpose and thus alleviates much of the ad hoc tedium associated with constructing present EDSs, and overcomes performance and semantic problems stemming from the present mismatch in the front and back ends of these systems. A language called LDL (logic data language) is described that was developed for this purpose. The discussion is restricted to LDL features with an immediate bearing on the main theme, i.e. tightly coupled systems.
Estimating anomalies from indirect observations
Authors: Jari P. Kaipio, Erkki Somersalo
Venue: Journal of Computational Physics (2002)

Indirect observations often lead to ill-posed inverse problems, where the use of prior information plays a crucial role. When correctly used, informative priors should be based on our belief of what the typical situation looks like, while the aim of the measurement procedure is often to find deviations from the typical. This work proposes a method of implementing priors that on one hand reflects the belief concerning the typical situation and on the other retains sensitivity to anomalies of the prescribed type. Numerical results are based on Bayesian sampling methods.
Multigrid-like technique for power grid analysis
Authors: Joseph N. Kozhaya, Sani R. Nassif, Farid N. Najm
Venue: Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design (2001)

Modern sub-micron VLSI designs include huge power grids that are required to distribute large amounts of current, at increasingly lower voltages. The resulting voltage drop on the grid reduces noise margin and increases gate delay, resulting in a serious performance impact. Checking the integrity of the supply voltage using traditional circuit simulation is not practical, for reasons of time and memory complexity. We propose a novel multigrid-like technique for the analysis of power grids. The grid is reduced to a coarser structure, and the solution is mapped back to the original grid. Experimental results show that the proposed method is very efficient as well as suitable for both DC and transient analysis of power grids.
On the design of Chant: a talking threads package
Authors: Matthew Haines, David Cronk, Piyush Mehrotra
Venue: Proceedings of the 1994 ACM/IEEE conference on Supercomputing (1994)

Lightweight threads are becoming increasingly useful for supporting parallelism and asynchronous control structures in applications and language implementations. However, lightweight thread packages for distributed memory systems have received little attention. In this paper, we introduce the design of a runtime interface, called Chant, that supports communicating threads in a distributed memory environment. In particular, Chant is layered atop standard message passing and lightweight thread libraries, and supports efficient point-to-point and remote service request communication primitives. We examine the design issues of Chant, the efficiency of its point-to-point communication layer, and the evaluation of scheduling policies to poll for the presence of incoming messages.
Algorithm level re-computing: a register transfer level concurrent error detection technique
Authors: Kaijie Wu, Ramesh Karri
Venue: Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design (2001)

In this paper we propose two algorithm-level time redundancy based Concurrent Error Detection (CED) schemes that exploit diversity in a Register Transfer (RT) level implementation. RT level diversity can be achieved either by changing the operation-to-operator allocation (allocation diversity) or by shifting the operands before re-computation (data diversity). By enabling a fault to affect the normal result and the re-computed result in two different ways, RT level diversity yields good CED capability with low area overhead. We used Synopsys Behavior Complier (BC) to implement the technique.
Third-Generation Versus Fourth-Generation Software Development
Authors: Santosh K. Misra, Paul J. Jalics
Venue: IEEE Software (1988)

A case study examines how fourth-generation languages do well and how they come up short compared to their predecessors. Two fourth-generation tools dBase III and PC/Focus were used, and a solution in Cobol was developed to use as a benchmark for third-generation-language performance. For each solution, development effort, code size, and performance characteristics were examined. It was found that even though the code sizes were smaller with both fourth-generation tools, Cobol was clearly superior in performance. It took longer to develop the solution in Cobol than in dBase III but less time than in PC/Focus.
Efficient Signature File Methods for Text Retrieval
Authors: Dik Lun Lee, Young Man Kim, Gaurav Patel
Venue: IEEE Transactions on Knowledge and Data Engineering (1995)

Signature files have been studied extensively as an access method for textual databases. Many approaches have been proposed for searching signatures files efficiently. However, different methods make different assumptions and use different performance measures, making it difficult to compare their performance. In this paper, we study three basic methods proposed in the literature, namely, the indexed descriptor file, the two-level superimposed coding scheme, and the partitioned signature file approach. The contribution of this paper is two-fold. First, we present a uniform analytical performance model so that the methods can be compared fairly and consistently. The analysis shows that the two-level superimposed coding scheme, if stored in a transposed file, has the best performance. Second, we extend the two-level superimposed coding method into a multilevel superimposed coding method, we obtain the optimal number of levels for the multilevel method and show that for databases with reasonable size the optimal value is much larger than 2, which is assumed in the two-level method. The accuracy of the analytical formula is demonstrated by simulation.
WVTDB-A Semantic Content-Based Video Database System on the World Wide Web
Authors: Haitao Jiang, Ahmed K. Elmagarmid
Venue: IEEE Transactions on Knowledge and Data Engineering (1998)

This paper describes the design and implementation of a web-based video database system (WVTDB) that demonstrates our research on video data modeling, semantic content-based video query, and video database system architecture. The video data model of WVTDB is based on multilevel video data abstractions and annotation layering, thus allowing dynamic and incremental video annotation and indexing, multiuser view sharing, and video data reuse. Users can query, retrieve, and browse video data based on their semantic content descriptions and temporal constraints on the video segments. WVTDB employs a modular system architecture that supports distributed video query processing and subquery caching. Several techniques, such as video wrappers and lazy delivery, are also proposed specifically to address the network bandwidth limitations for this kind of web-based system. We also address adaptivity, data access control, and user profile issues.
Attribute preserving dataset simplification
Authors: Jason D. Walter, Christopher G. Healey
Venue: Proceedings of the conference on Visualization '01 (2001)

This paper describes a novel application of feature preserving mesh simplification to the problem of managing large, multidimensional datasets during scientific visualization. To allow this, we view a scientific dataset as a triangulated mesh of data elements, where the attributes embedded in each element form a set of properties arrayed across the surface of the mesh. Existing simplification techniques were not designed to address the high dimensionality that exists in these types of datasets. As well, vertex operations that relocate, insert, or remove data elements may need to be modified or restricted. Principal component analysis provides an algorithm-independent method for compressing a dataset's dimensionality during simplification. Vertex locking forces certain data elements maintain their spatial locations; this technique is also used to guarantee a minimum density in the simplified dataset. The result is a visualization that significantly reduces the number of data elements to display, while at the same time ensuring that high-variance regions of potential interest remain intact. We apply our techniques to a number of well-known feature preserving algorithms, and demonstrate their applicability in a real-world context by simplifying a multidimensional weather dataset. Our results show a significant improvement in execution time with only a small reduction in accuracy; even when the dataset was simplified to 10% of its original size, average per attribute error was less than 1%.
Design for Testability in Hardware-Software Systems
Authors: Harald P. e. Vranken, Marc F. Witteman, Ronald C. van WUIJTSWINKEL
Venue: IEEE Design Test (1996)

Design for testability (DFT) is a key concern during the development of both hardware and software. However, different approaches towards DFT are adopted in hardware and software development. For hardware designers, attention is focussed on techniques that will allow the correctness of each finished product to be verified, while software designers focus on techniques that help verify design specifications and detailed coding. When considering today's complex systems, consisting of both hardware and software, it is clear that both approaches must be used together to achieve a successful overall solution. This paper investigates existing and new concepts that may lead to one overall Design For Test strategy for the future.
Conquering Noise in Deep-Submicron Digital ICs
Authors: Kenneth L. Shepard, Vinod Narayanan
Venue: IEEE Design Test (1998)

Design methodologies for digital integrated circuits are ultimately concerned with validating a design against metrics which ensure functionality, testability, and that the design satisfies power and timing requirements. Electronic design automation (EDA) tools and techniques have been developed to analyze each of these metrics. With technology scaling and increasing clock frequencies, noise and signal integrity are becoming important new design concerns in verifying functionality and accurately predicting timing. In this article, we describe a new metric for verifying functionality in the presence of noise, noise stability, and a static noise analysis methodology to verify it. In addition, we describe the effects of noise on delay and how these can be considered in the context of static timing analysis.
Locating Perceptually Salient Points on Planar Curves
Authors: M. A. Fischler, H. C. Wolf
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

This paper describes the underlying ideas and algorithmic details of a computer program that performs at a human level of competence for a significant subset of the curve partitioning task. It extends and rounds out the technique and philosophical approach originally presented by Fischler and Bolles (1986). In particular, it provides a unified strategy for selecting and dealing with interactions between salient points, even when these points are salient at different scales of resolution. Experimental results are presented involving on the order of 1000 real and synthetically generated images.
Virtual Memory in Contemporary Microprocessors
Authors: Bruce Jacob, Trevor Mudge
Venue: IEEE Micro (1998)

This article presents a survey of commercial memory-management designs and describes how each processor architecture supports the common features of virtual memory, such as address space protection, shared memory, and large address spaces.
Behavioral-Level Fault Simulation
Authors: Sumit Ghosh
Venue: IEEE Design Test (1988)

An approach to fault simulation is presented in which behavioral fault models represent complex failures in VLSI designs. Errors are deliberately introduced into the description of a design that contains no faults. These errors can be fault values of variables that represent state or timing parameters, a faulty description that is substituted for part of the good description, or a combination of these. The algorithm guarantees accurate results by deferring the output assignments. The approach can also be used to detect and discard inconsistent output assignments. The algorithm has been implemented in Stanford University's Sable simulator using the Adlib behavioral modeling language.
Physical Layer Design Alternatives for High Speed Outdoor Packet Radio Local and Medium Area Networks
Authors: Chokri Trabelsi, Erdal Torun
Venue: Wireless Personal Communications: An International Journal (1999)

In the last few years, the development of wireless local area networks (WLANs) has become a major goal in the field of computer and wireless communications. The Network Technologies Research group at the Communications Research Center in Canada has been working on a project to develop a high speed outdoor WLAN. In contrast to many existing WLANs, the new WLAN supports multimedia traffic such as voice, data and video; and will be used mainly in an outdoor environment with a cell coverage range of approximately 20 km. In this paper the physical layer design alternatives for the outdoor WLAN with a speed of 10 to 20 Mbps are described. Simulation results for some of the techniques considered to be used for the WLAN system are presented. The study is concluded by proposing two possible systems that one may consider for the implementation of a high speed outdoor WLAN. Although this study was primarily focused on WLAN applications, the results presented in this paper are applicable to several high speed wireless networks.
Fault-Tolerant Clock Synchronization in Large Multicomputer Systems
Authors: A. Olson, K. G. Shin
Venue: IEEE Transactions on Parallel and Distributed Systems (1994)

The cost of synchronizing a multicomputer increases with system size. For largemulticomputers, the time and resources spent to enable each node to estimate the clockvalue of every other node in the system can be prohibitive. We show how to reduce thecost of synchronization by assigning each node to one or more groups, then having eachnode estimate the clock values of only those nodes with which it shares a group. Sinceeach node estimates the clock value of only a subset of the nodes, the cost ofsynchronization can be significantly reduced. We also provide a method for computing the maximum skew between any two nodes in the multicomputer, and a method for computing the maximum time between synchronizations. We also show how the fault tolerance of the synchronization algorithm may be determined.
The Slippery Path to Productivity Improvement
Authors: Tarek K. Abdel-Hamid
Venue: IEEE Software (1996)

Since the 1970s, software-producing organizations have invested in dozens of technological innovations such as fourth-generation languages, CASE products, object-oriented analysis and programming, and software reuse. Yet productivity tools simply aren't delivering increased productivity even when a project is managed "by the book."The oldest conventional explanation blames this stagnation on poor management. This article attempts to demonstrate that there may be more systemic, albeit counterintuitive, causes for the "productivity paradox." Specifically, the productivity potential of software engineering tools may be squandered not because organizations fail to institute the necessary managerial practices but because the software development environment is a complex social system that causes such practices to have unintended consequences. In real life, organizations are much worse off. Many more things can go wrong, and often do.
Using Components for Rapid Distributed Software Development
Authors: Alexander Repenning, Andri Ioannidou, Michele Payton, Wenming Ye, Jeremy Roschelle
Venue: IEEE Software (2001)

How well are component-based approaches suited for the rapid design and implementation of interactive applications by distributed teams? A large geographically distributed testbed consisting of domain experts, component framework coordinators, developers, publishers, and users is producing and publishing educational applications.
High Dimensional Similarity Joins: Algorithms and Performance Evaluation
Authors: Nick Koudas, Kenneth C. Sevcik
Venue: IEEE Transactions on Knowledge and Data Engineering (2000)

Current data repositories include a variety of data types, including audio, images, and time series. State-of-the-art techniques for indexing such data and doing query processing rely on a transformation of data elements into points in a multidimensional feature space. Indexing and query processing then take place in the feature space. In this paper, we study algorithms for finding relationships among points in multidimensional feature spaces, specifically algorithms for multidimensional joins. Like joins of conventional relations, correlations between multidimensional feature spaces can offer valuable information about the data sets involved. We present several algorithmic paradigms for solving the multidimensional join problem and we discuss their features and limitations. We propose a generalization of the Size Separation Spatial Join algorithm, named Multidimensional Spatial Join (MSJ), to solve the multidimensional join problem. We evaluate MSJ along with several other specific algorithms, comparing their performance for various dimensionalities on both real and synthetic multidimensional data sets. Our experimental results indicate that MSJ, which is based on space filling curves, consistently yields good performance across a wide range of dimensionalities.