ppxscal/embedding_network huggingface dataset:
Incremental Evaluation of BDD-Represented Set Operators
Authors: Heraldo Maciel França Madeira, Junior Barbera
Venue: Proceedings of the 13th Brazilian Symposium on Computer Graphics and Image Processing (2000)

In mathematical morphology set operators are described by a formal language, whose vocabulary is composed of dilations, erosions, complementation, union and intersection. They are called morphological operators when expressed in this form. Translation invariant and locally defined set operators are called W-operators. Decision diagrams have been used as an alternative representation for some 2-D and 3-D discrete W-operators. This paper shows that the reduced and ordered binary decision diagram (ROBDD) is a non-ambiguous scheme for representing W-operators and presents a method to compute the ROBDD of any W-operator from a corresponding morphological operator. This procedure of computing decision diagrams can be applied to the automatic proof of equivalence between morphological operators, since the W-operator they represent are equal if and only if they have the same ROBDD.
Adaptive Scenario-Based Object-Oriented Test Frameworks for Testing Embedded
Authors: Wei-Tek Tsai, Yinghui Na, Ray J. Paul, F. Lu, A. Saimi
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

This paper presents a process to develop adaptive object-oriented scenario-based test frameworks for testing embedded systems. Embedded systems often require rigorous testing due to the mission-critical nature of their applications, and they are often developed as a family of products. The process uses techniques such as design-for-change, design patterns, scenarios, ripple effect analysis, and regression testing. This paper then uses an example to illustrate this process by applying it to test a mobile phone system, and the framework constructed can facilitate generation of numerous test cases quickly with minimum effort, and it can also accommodates many changes suggested by another party without changing the overall structure of the framework.
The Proof Complexity of Linear Algebra
Authors: Michael Soltys, Stephen A. Cook
Venue: Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science (2002)

We introduce three formal theories of increasing strength for linear algebra in order to study the complexity of the concepts needed to prove the basic theorems of the subject. We give what is apparently the first feasible proofs of the Cayley-Hamilton theorem and other properties of the determinant, and study the propositional proof complexity of matrix identities.
GAPS: A Genetic Programming System
Authors: Michael D. Kramer, Du Zhang
Venue: 24th International Computer Software and Applications Conference (2000)

Genetic programming tackles the issues of how to automatically create a working computer program for a given problem from some initial problem statement. The goal is accomplished in genetic programming by genetically breeding a population of computer programs in terms of the principles of Darwinian natural selection of the fittest and genetic operations. In this paper, we describe a genetic programming system called GAPS. GAPS have the following features: (1) It implements the prototypical generational algorithm for genetic programming with three improvements (the honor roll, improved termination criteria and the tree techniques for fitness evaluation). (2) It includes an extensible language tailored to the needs of genetic programming. And (3) it is a complete, standalone system that allows for genetic programming tasks to be carried out without requiring other tools such as compilers. Preliminary results with GAPS have been satisfactory.
High Accuracy Handwritten Chinese Character Recognition by Improved Feature Matching Method
Authors: Cheng-Lin Liu, In-Jung Kim, Jin Hyung Kim
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

In this paper, we propose some strategies to improve the recognition performance of feature matching method for handwritten Chinese character recognition (HCCR). Favorable modifications are given to all stages throughout the recognition. In preprocessing, we devised a modified nonlinear normalization algorithm and a connectivity-preserving smoothing algorithm. For feature extraction, an efficient directional decomposition algorithm and a systematic approach to design blurring mask are presented. Finally, a modified LVQ3 algorithm is applied to optimize the reference vectors for classification. The integrated effect of these strategies significantly improves the recognition performance. Recognition results on databases ETL8B2 and ETL9B are promising.
SSM-MP: more scalability in shared-memory multi-processor
Authors: Shigeaki Iwasa, Shung Ho Shing, Hisashi Mogi, Hiroshi Nozuwe, Hiroo Hayashi, Osamu Wakamori, Takashi Ohmizo, Kuninori Tanaka, Hiroshi Sakai, Mitsuo Saito
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

Bus-based shared-memory multi-processors (SM-MP) have successfully been used commercially, since implementation requires no drastic changes to the programming paradigm. In this paper we propose the memory structure called SSM-MP (Scalable shared-memory multi-processors), aimed to shorten the cache refill latency and to relax the bus bottle neck problem. In this machine, main memory consists of local memories dedicated to each of the processors and something called MTag. MTag is a small piece of hardware that filters out bus traffic headed to the system bus and maintains cache coherency. A popular UNIX (SVR4 ES/MP) was ported. Original OS code works well due to its natural locality. Furthermore, by allocating tasks to the local memory, we were able to reduce the system bus traffic to nearly a quarter. SSM-MP is an effective approach in building a multi-processor system with a medium number (4-32) of processors.
Methodological Contributions to Professional Education and Training
Authors: Günther Ruhe
Venue: 24th International Computer Software and Applications Conference (2000)

Professional education and training plays a crucial role for successful transfer of innovative Software Engineering technologies and for achieving long-term strategic goals of an organization. We describe how empirically validated knowledge related to methods, tools, and techniques is organized and maintained in an organizational unit called Experience Factory. Emphasis of the paper is to describe how the knowledge and experience available from the Experience Factory is integrated into professional education and training courses and programs. The web-based training approach is focusing on computer supported collaborative learning. We apply the fundamental Quality Improvement Paradigm to describe the different steps for how to perform and develop courses and programs by applying principles of systematic product and process management.
On-line recognition handwritten mathematical symbol
Authors: Xuejun Zhao, Xinyu Liu, Shengling Zheng, Baochang Pan, Yuan Yan Tang
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

The paper aims at online recognition of handwritten mathematical symbols. It analyses the structures of 94 opt used mathematical symbols and concludes that all of them consist of 10 basic elements. It proposes a new method of basic element ordering and reduces the number of standard symbols by extracting three primary features of mathematical symbols, namely, basic element vector, relative positions between basic elements and basic element length vector. The traditional dynamic programming method is improved by means of classifying roughly 94 mathematical symbols, considering matching and unmatching value, adding geometric restraints and solving matching problem, through improved Kohn-Munkres algorithm. Correctness rate reaches 90.52%, incorrectness rate 5.03% and refusal rate 4.45%.
Disk Read-Write Optimizations and Data Integrity in Transaction Systems Using Write-Ahead Logging
Authors: C. Mohan
Venue: Proceedings of the Eleventh International Conference on Data Engineering (1995)

We discuss several disk read-write optimizations that are implemented in different transaction systems and disk hardware to improve performance. These include: (1) when multiple sectors are written to disk, the sectors may be written out of sequence (SCSI disk interfaces do this). (2) Avoiding initializing pages on disk when a file is extended. (3) Not accessing individual pages during a mass delete operation (e.g., dropping an index from a file which contains multiple indexes). (4) Permitting a previously deallocated page to be reallocated without the need to read the deallocated version of the page from disk during its reallocation. (5) Purging of file pages from the buffer pool during a file erase operation (e.g., a table drop). (6) Avoiding logging for bulk operations like index create. We consider a system which implements the above optimizations and in which a page consists of multiple disk sectors and recovery is based on write-ahead logging using a log sequence number on every page. For such a system, we present a simple method for guaranteeing the detection of the partial disk write of a page. Detecting partial writes is very important not only to ensure data integrity from the users' viewpoint but also to make the transaction system software work correctly. Once a partial write is detected, it is easy to recover such a page using media recovery techniques. Our method imposes minimal CPU and space overheads. It has been implemented in DB2/6000 and ADSM.
Attacking DDoS at the Source
Authors: Jelena Mirkovic, Gregory Prier, Peter L. Reiher
Venue: Proceedings of the 10th IEEE International Conference on Network Protocols (2002)

Distributed denial-of-service (DDoS) attacks present an Internet-wide threat. We propose D-WARD, a DDoS defense system deployed at source-end networks that autonomously detects and stops attacks originating from these networks. Attacks are detected by the constant monitoring of two-way traffic flows between the network and the rest of the Internet and periodic comparison with normal flow models. Mismatching flows are rate-limited in proportion to their aggressiveness. D-WARD offers good service to legitimate traffic even during an attack, while effectively reducing DDoS traffic to a negligible level. A prototype of the system has been built in a Linux router. We show its effectiveness in various attack scenarios, discuss motivations for deployment, and describe associated costs.
Designing Role Hierarchies for Access Control in Workflow Systems
Authors: Reinhardt A. Botha, Jan H. P. Eloff
Venue: Proceedings of the 25th International Computer Software and Applications Conference on Invigorating Software Development (2001)

Due to the correspondence between the role abstraction in Role-based Access Control (RBAC) and the notion of organizational positions, it seems easy to construct role hierarchies. This is, however, a misconception. This paper argues that, in order to reflect the functional requirements, a role hierarchy becomes very complex. In a bid to simplify the design of role hierarchies suitable for the expression of access control requirements in workflow systems, the paper proposes a ``typed'' role hierarchy. In a ``typed'' role hierarchy a role is of a specific type. The associations between different types of roles are limited by rules that govern the construction of a role hierarchy. This paper proposes a methodology to systematically construct a ``typed'' role hierarchy. Since the ``typed'' nature of the role hierarchy is only relevant during the construction of the role hierarchy, it can seamlessly be integrated into existing RBAC schemes that support the concept of role hierarchies.
Code Reordering and Speculation Support for Dynamic Optimization System
Authors: Erik M. Nystrom, Ronald D. Barnes, Matthew C. Merten, Wen-mei W. Hwu
Venue: Proceedings of the 2001 International Conference on Parallel Architectures and Compilation Techniques (2001)

Abstract: For dynamic optimization systems, success is limited by two difficult problems arising from instruction reordering. Following optimization within and across basic block boundaries, both the ordering of exceptions and the observed processor register contents at each exception point must be consistent with the original code. While compilers traditionally utilize global data-flow analysis to determine which registers require preservation, this analysis is often infeasible in dynamic optimization systems due to both strict time/space constraints and incomplete code discovery. This paper presents an approach called Precise Speculation that addresses these problems. The proposed mechanism is a component of our vision for Run-time Optimization ARchitecture, or ROAR, to support aggressive dynamic optimization of programs. It utilizes a hardware mechanism to automatically recover the precise register states when a deferred exception is reported, utilizing the original unoptimized code to perform all recovery. We observe that Precise Speculation enables a dynamic optimization system to achieve a large performance gain over aggressively optimized base code, while preserving precise exceptions. For an 8-issue EPIC processor, the dynamic optimizer achieves between 3.6% and 57% speedup over a full-strength optimizing compiler that employs profile-guided optimization.
Dynamic Scene Occlusion Culling Using a Regular Grid
Authors: Harlen Costa Batagelo, Shin-Ting Wu
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

Abstract. We present an output-sensitive occlusion culling algorithm for densely occluded dynamic scenes where both the viewpoint and objects move arbitrarily. Our method works on a regular grid that represents a volumetric discretization of the space and uses the opaque regions of the scene as virtual occluders. We introduce new techniques of efficient traversal of voxels, object discretization and occlusion computation that strengthen the benefits of regular grids in dynamic scenes. The method also exploits temporal coherence and realizes occluder fusion in object-space. For each frame, the algorithm computes a conservative set of visible objects that greatly accelerates the visualization of complex dynamic scenes. We discuss the results of a 2D and 3D case implementation.
Workspace Awareness in Relaxed WYSIWIS Systems
Authors: Shin-Ting Wu, Luiz Gonzaga Da Silveira,  Jr.
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

Abstract. CoMo is a prototype of a collaborative 3D geometric modeling environment designed to support temporally and geographically dispersed work teams. In this environment the participants may work in different parts of the space and have distinct perspective viewing of the space. Maintaining workspace awareness becomes, therefore, much more difficult. In this paper we present graphics solutions that we adopted for enhancing the 3D workspace awareness in CoMo. We reused several individual awareness mechanisms provided by the MTK graphics library designed to single-user applications. Appropriate communication and distribution platform for coordinating individual actions was devised. The main contribution of this paper is to show how group awareness can be implemented by adequately reusing the existing individual awareness facilities.
Global Campus: Learning to Walk with Webbed Feet
Authors: Chris Sadler, Walaa Mohamed Bakry, Pav Chera, Stylianos Hatzipanagos, Maya Milankovic-Atkinson, Alan Murphy
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

Universities that wish to expand their provision beyond their local catchment areas need to consider whether to bring the students to the tuition or take the tuition to the students. Current-day educational and information technologies make the latter option a much more achievable prospect than it has been in the past. Nevertheless, careful consideration needs to be given to the nature of the distance-learning students' learning experiences and the extent to which these may be comparable with those of the local students.These matters are considered in this paper against the background of the Global Campus project whereby Middlesex University's School of Computing Science sought to take its initial steps in distance-learning provision.
Supporting Handheld Collaboration through COMAL
Authors: Manuel Alba, Jesús Favela
Venue: Proceedings of the 6th International Workshop on Groupware (2000)

Handheld computers represent one of the fastest growing segments of the computer industry today. As this happens, they become a natural medium for collaboration. Besides storing much of the user's personal data, they are always at hand, in sharp contrast with desktop computers. However, much work remains to be done for handheld computers to become the platform of choice for computer-mediated collaboration. First, we must determine the role that these devices should play in a collaboration architecture that includes not only server and desktop computers, but also the growing number of computers placed around our living environments. Second, tools need to be built to facilitate the development of handheld collaborative applications. The paper addresses these two issues, describing use scenarios for handheld collaboration and presenting COMAL, a framework for the development of handheld collaborative applications. The use of this framework is illustrated with the development of a sample application.
VLSI issues in memory-system design for video signal processors
Authors: Santanu Dutta, Wayne Wolf, Andrew Wolfe
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

This paper addresses the design of memory-system architectures for video signal processors. The memory subsystem is the bottleneck of most video computing systems and demands a careful analysis of the design tradeoffs related to area, cycle time, and utilization. We emphasize the need to consider technological and circuit-level issues during the design of a system architecture, particularly that of a video processor, and present a method whereby the conceptual organization of the memory architecture can be evaluated before a detailed design is undertaken. Our analysis suggests that the organization of an efficient memory hierarchy for video signal processors is different from the register-cache based hierarchy of general-purpose programmable microprocessors.
Tandem Computers Incorporated: Performance Modeling of ServerNetTM Topologies
Authors: Robert W. Horst, Doug Jewett, William J. Watson, L. Young, Dimiter R. Avresky, R. Wilkinson, Chris M. Cunningham
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

This paper describes a performance analysis of ServerNet, a new system area network architecture developed by Tandem Computers. The paper focuses on three main topics: a brief description of the ServerNet architecture and the simulation tool, the basis for modeling assumptions, and the initial results of the analysis. ServerNet is a new core technology for server architectures that focuses on moving data. The analysis uses simulation to obtain performance characteristics such as delivery time, throughput, and hot spot identification. The goal of the analysis is to provide a realistic measure of current system performance, while optimizing features such as network topology and traffic patterns to provide future improvement.
Algorithms for Recognition of the Main Engineering Drawing Entities
Authors: Sergey Ablameyko, V. Bereishik, O. Frantskevich, M. Homenko, N. Paramonova
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

The paper introduces the main principles of automatic interpretation of engineering drawing images. The technology of ED interpretation is proposed based on the introduced principles. The algorithms for automatic recognition of the main ED entities: line types, circular arcs, blocks, crosshatched areas, dimensions are proposed. They have been verified experimentally in the whole ED interpretation technology and show good results.
Parallel Algorithms for Force Directed Scheduling of Flattened and Hierarchical Signal Flow Graphs
Authors: Pradeep Prabhakaran, Prithviraj Banerjee
Venue: Proceedings of the 1996 International Conference on Computer Design, VLSI in Computers and Processors (1996)

In this paper, we present some novel algorithms for scheduling hierarchical signal flow graphs in the domain of high-level synthesis. There are several key contributions of this paper. First, we develop a novel extension of the force-directed scheduling problem which naturally handles loops and conditionals by coming up with a scheme of scheduling {\em hierarchical} signal flow graphs. Second, we develop three new parallel algorithms for the scheduling problem. Third, our parallel algorithms are portable across a wide range of parallel platforms. We report results on a set of high-level synthesis benchmarks on 8-processor SGI Challenge and a network of 4 SUN SPARCstation5 work stations. Finally, while some parallel algorithms for VLSI CAD reported by earlier researchers have reported a loss of qualities of results, our parallel algorithms produce exactly the same results as the sequential algorithms on which they are based. Keywords: High-level synthesis,force-directed scheduling, hierarchical graphs,parallel algorithms,multiprocessors,network of workstations.
Fast Link Layer and Intra-Domain Handoffs for Mobil Internet
Authors: Jyh-Cheng Chen, Prathima Agrawal
Venue: 24th International Computer Software and Applications Conference (2000)

To support fast and efficient handoffs, we propose a single protocol for both link layer (within IP subnet) and IP layer (across IP subnet) handoffs within a local domain. It is a complementary protocol to Mobile IP, in which Mobile IP deals with inter-domain mobility in the wide area. By combining routing table in IP layer and bridging table in link layer to form a single forwarding table, packets destined to a mobile terminal can be forwarded by simple table look-ups. When a mobile terminal moves, the new route can be established by table updates initiated by the mobile terminal. Comparing with Mobile IP, the proposed scheme does not need IP encapsulation and does not have triangular routing problem. In addition, the overhead and latency caused by interfacing the mobility management in link layer and IP layer are eliminated. Although link layer mobility management depends on the underlying wireless technologies in certain extent, the proposed scheme is general enough for most wireless multiple access protocols.