ppxscal/embedding_network huggingface dataset:
Simultaneous area and delay minimum K-LUT mapping for K-exact networks
Authors: Shashidhar Thakur, D. F. Wong
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

We address the technology mapping problem for lookup table FPGAs. The area minimization problem for mapping K-bounded networks, consisting of nodes with at most K inputs using K-input lookup tables is known to be NP-complete for K/spl ges/5. The complexity was unknown for K=2, 3, and 4. The corresponding delay minimization problem (under the constant delay model) was solved in polynomial time by the flow-map algorithm, for arbitrary values of K. We study the class of K-bounded networks, where all nodes have exactly K inputs. We call such networks K-exact. We give a characterization of mapping solutions for such networks. This leads to a polynomial time algorithm for computing the simultaneous area and delay minimum mapping for such networks using K-input lookup tables. We also show that the flow-map algorithm minimizes the area of the mapped network as well, for K-exact networks. We then show that for K=2 the mapping solution for a 2-bounded network, minimizing the area and delay simultaneously, can be easily obtained from that of a 2-exact network derived from it by eliminating single input nodes. Thus the area minimization problem for 2-input lookup tables can be solved in polynomial time, resolving an open problem.
Issues on the architecture and the design of distributed shared memory systems
Authors: Nian-Feng Tzeng, Steven Wallach
Venue: Proceedings of the 1996 International Conference on Computer Design, VLSI in Computers and Processors (1996)

Distributed shared memory (DSM) systems could overcome major obstacles of the widespread use of distributed-memory multiprocessors, while retaining the attractive features of low cost and good scalability common to distributed-memory machines. A DSM system allows a natural and portable programming model on distributed-memory machines, making it possible to construct a relatively inexpensive and scalable parallel system on which programmers can develop parallel application codes. Due to its potential advantages, DSM has received increasing attention. In this panel, challenges in building efficient DSM systems for a wide range of applications are addressed and discussed.
Fast Approximation Algorithms for Fractional Steiner Forest and Related Problems
Authors: Naveen Garg, Rohit Khandekar
Venue: Proceedings of the 43rd Symposium on Foundations of Computer Science (2002)

We give a fully polynomial time approximation scheme (FPTAS) for the optimum fractional solution to the Steiner forest problem. This can easily be generalized to obtain an FPTAS for a hitting set problem on a collection of clutters. We also identify three other problems on collections of clutters and show how these four problems are related when the clutters have the max-flow min-cut (MFMC) property. Two of these problems which are generalizations of maximum multicommodity flow and maximum concurrent flow have been well studied in the past and this paper is the first attempt at designing efficient algorithms for the other two problems.Our algorithms are very simple to describe and have running times better than those of existing algorithms. For clutters that do not satisfy the MFMC property (e.g., k-spanner, multicommodity flows, T-cuts, T-joins etc.), our algorithms are the only ones known (other than the generic algorithms for linear programming) for solving these hitting set problems.
Replication of uniformly accessed shared data for large-scale data-parallel algorithms
Authors: Chung-Ming Chen, Soo-Young Lee
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

In this paper we show how to minimize data sharing overhead required in most parallel algorithms, especially in Large-Scale Data-Parallel (LSDP) algorithms on a 2D mesh. Two specific issues are addressed in this study. One is what the optimal group size is, i.e., how many PEs should share a copy of shared data. The other is where the replicated data should be allocated.
Lightweight Extensions of Collaborative Modeling Systems for Synchronous Use on PDA's
Authors: Niels Pinkwart, Christian Schäfer, Heinz Ulrich Hoppe
Venue: Proceedings IEEE International Workshop on Wireless and Mobile Technologies in Education (2002)

Based on experience in orchestrating collaborative learning scenarios with ubiquitous computing technology, two strategies for extending a co-constructive modeling environment with PDAs connected through a wireless LAN are described. One application is an annotation tool, the other replicates the modeling system on the PDA, both provide full synchronizationwith the PC environment. General implementation strategies for such extensions are discussed.
HASE in Wireless Systems
Authors: Isaac Levendel
Venue: The 4th IEEE International Symposium on High-Assurance Systems Engineering (1999)

Two problems have a significant economic impact on high assurance engineering of systems. The first problem originates from a frequent lack of discipline in the design of dependable systems, which is often exhibited by a weak or non-existent staffing exclusively dedicated to the design and implementation of a cohesive error and failure management strategy. This, in turn, results in excessive field costs for both defect repairs and system maintenance staffing.The second problem is due to the fact that traditional dependable system designs are very expensive in terms of cost of goods, because they rely heavily on proprietary hardware and software. In fact, the implementation of dependability may increase system costs by several orders of magnitude. This is why the usage of COTS appears attractive from a simple-minded viewpoint. For instance, the reality of competition in the more open wireless market has done more for component reuse that any other factor. However, the urgent need for lower cost of goods combined with of the aforementioned first problem (frequent lack of discipline in design for dependability) have led to lower service quality. Conversely, developing a discipline for dependable system design will be a necessary enabler of the use of COTS.In spite of some differences which are explained next, designing dependable systems using COTS requires the same fundamental principles as designing traditional dependable systems. First, errors and malfunctions need to be detected and located. To that effect, reusable components need to be diagnosable, namely their interfaces need to provide information about the eventual occurrence of errors and malfunctions (component observability). In addition, if the functioning of a failing component cannot be corrected, the component must be able to fail in a way that allows its real time replacement by another equivalent component (component controlability). There is also a need to design and implement, in the application software, mechanisms to manage system reconfiguration without notable service interruptions. Although these fundamental design principles are fundamental, COTS designs must emphasize clear component boundary design constraints for dependability, whereas in traditional designs boundaries are not as critical.In summary, component observability and controlability, and well-organized recovery strategies are necessary complementary requirements for the dependable integration of systems using COTS. Undoubtedly, the need to reduce cost while maintaining system dependability will provide a strong incentive for the establishment of a strong design discipline and for the adaptation of COTS for dependable integration.
Real-Time Atomic Transaction Processing Using Multi-Invariant Data Structure
Authors: I-Ling Yen, Biao Chen, Ing-Ray Chen
Venue: The 4th IEEE International Symposium on High-Assurance Systems Engineering (1999)

Many multiple server systems are now being used for heavily accessed web services. Performance, availability, and real-time transaction processing are important requirements for many of these applications. In this paper, we apply the multi-invariant data structure (MIDS) concept for real-time transaction processing. We used the MIDS scheme to develop a highly available, reliable, real-time transaction processing algorithm. We show that with very little overhead compared to the two-phase commit protocol, we achieve non-blocking atomic transaction processing. Also, the algorithm is suitable for real-time processing since a task can be preempted at any point of execution without expensive recovery procedure.
A Rule Management Framework for Negotiating Mobile Agents
Authors: M. Tuan Tu, C. Kunze, Winfried Lamersdorf
Venue: Proceedings of the 4th International conference on Enterprise Distributed Object Computing (2000)

Proposes an application framework for mobile agents which provides rule-based generic services to support the three phases of a market transaction (information phase, contracting phase and settlement phase). It is described within the four views of an electronic market (the business view, the transaction view, the services view and the infrastructure view) which describe organizational as well as technological aspects. The focus of this paper is on the technological aspects of the contracting phase in which the participating agents carry out an automated negotiation process to determine the terms of contract.
A New Approach to Verify Rule-Based Systems Using Petri Nets
Authors: Xudong He, William C. Chu, Hongji Yang, Stephen J. H. Yang
Venue: 23rd International Computer Software and Applications Conference (1999)

In the past several years, various graphical techniques were proposed to analyze various types of structural errors, including inconsistency (conflict rules), incompleteness (missing rules), redundancy (redundant rules), and circularity (circular depending rules), of rule-based systems. In this paper, we present a special reachability graph technique based on w-nets (a special type of low-level Petri nets) to detect all of the above types of structural errors. Our new technique is simple, efficient, and can be easily automated. We highlight the unique features of this new approach and demonstrate its application through an example.
Dynamic Traceability Links Supported by a System Architecture Description
Authors: Eirik Tryggeseth, Øystein Nytrø
Venue: Proceedings of the International Conference on Software Maintenance (1997)

To reduce the effort spent on system comprehension during software maintenance, easy access to different type of information describing the system features is necessary. This is used by the maintainer to build a mental model of the software. Links relating different types of information are often implicit, and called traceability links. Extracting all traceability links of possible interest from the system documentation would be an extremely complex operation. Storing and updating a database of such information manually would be an expensive task. We propose that the identification of information about a feature is done dynamically. The maintainer is provided with a powerful query mechanism for identifying a starting point for collecting information. Further information is identified dynamically by automatically expanding several predefined types of traceability links. This avoids the problems of the traditional database approach. To make the query mechanism scalable, an architectural description of the system is used to limit the size of information which must be inspected by a query.
Texture Feature Neural Classifier for Remote Sensing Image Retrieval Systems
Authors: Mauricio Pozzobon Martins, Lamartine N. Frutuoso Guimarães, Leila Maria Garcia Fonseca
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

Abstract.Texture information is useful for image data browsing and retrieval.The goal of this paper is to present a texture classification system for remote sensing images addressed to the administration of great collections of those images.The proposed classifier is a hybrid system composed by an unsupervised neural network and a supervised one.Starting from a small portion of the image (pattern)the system should recognize the most similar class to a pattern in a database as well as to identify the images that contain similar patterns. The texture feature vectors used to characterize the patterns are obtained from the images processed by a bankof Gabor Filters.Some experimental results using textures of the Brodatz album,multi-spectral and radar images are presented here.
Hybrid compiler/hardware prefetching for multiprocessors using low-overhead cache miss traps
Authors: Jonas Skeppstedt, Michel Dubois
Venue: Proceedings of the international Conference on Parallel Processing (1997)

We propose and evaluate a new data prefetching technique for cache coherent multiprocessors. Prefetches are issued by a prefetch engine which is controlled by the compiler. Second-level cache misses generate cache miss traps, and start the prefetch engine in a trap handler generated by the compiler. The only instruction overhead in our approach is when a trap handler terminates after data arrives. We present the functionality of the prefetch engine and a compiler algorithm to control it. We also study emulation of the prefetch engine in software. Our techniques are evaluated on six parallel applications using a compiler which incorporates our algorithm and a simulated multiprocessor. The prefetch engines remove up to 67% of the memory access stall time at an instruction overhead less than 0.42%. The emulated prefetch engines remove in general less stall time at a higher instruction overhead.
Parallel Inference on a Linguistic Knowledge Base
Authors: Sanda M. Harabagiu, Dan I. Moldovan
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

This paper presents a possible solution for the text inference problem - extracting information unstated in a text, but implied. The inference algorithm consists of a set of highly parallel search methods that when applied to the knowledge base find contexts of sentences that reveal information relevant to the text. Implementation, results and parallelism analysis are discussed.
Enterprise Modelling with FUNSOFT Nets
Authors: Sebastian Erdmann, Jan Wortmann
Venue: Proceedings of the 1st International Conference on Enterprise Distributed Object Computing (1997)

In this article we propose workflow techniques such as FUNSOFT for the specification of ODP Enterprise Models. Workflow-orientation as one of the most popular management paradigms and object-orientation as the state of the art software development paradigm will be integrated in the ODP framework. Our example is related to our experience in the air traffic control application domain and will demonstrate how a workflow related development perspective embedded in the ODP framework can improve the system integration on one hand and will guarantee user participation at the same time. The properties of FUNSOFT nets will be compared to the elements of the ODP Enterprise Language and an interpretation of FUNSOFT nets in the ODP framework will be proposed. We demonstrate how workflow-orientation can be used for the harmonization of business processes in the air traffic control domain.
Automatic generation of injective modular mappings
Authors: Hyuk-Jae Lee, José A. B. Fortes
Venue: Proceedings of the international Conference on Parallel Processing (1997)

Many optimizations (of programs with loops) used in parallelizing compilers and systolic array design are based on linear transformations of loop iteration spaces. Additional important optimizations and designs are possible by using recently proposed modular mappings, which are described by linear transformations modulo a constant vector. Previous work on modular mappings focused an conditions that guarantee injectivity of a modular mapping for algorithms with rectangular index sets. This paper generalizes previous work by providing new injectivity conditions that cover the cases when the program index set has arbitrary shape and size, and the target processor array and the mapping moduli are of arbitrary size. A systematic technique to efficiently generate modular mappings is also proposed. The complexity of the proposed generation technique is O(n/sup 2/n!) for a nested loop of depth n with a rectangular index set and a target processor array with as many processors as required. A bounded search scheme is also provided for general cases. Each trial is formulated as an integer linear programming problem with at most 3n variables.
Ma X: An Access Control System for Digital Libraries and the Web
Authors: Elisa Bertino, Elena Ferrari, Andrea Perego
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

Digital Libraries (DLs) introduce several challenging requirements with respect to the formulation, specification and enforcement of adequate access control policies. Unlikeconventional database environments, a DL typically is characterised by a dynamic subject population, often making accesses from remote locations, and by an extraordinarily large amount of information, stored in a variety of formats. Additionally, protecting a DL does not only means protecting documents that reside at the DL site, but also protecting accesses that the DL subscribers made to external Web documents.In this paper we present MaX, a comprehensive system for enforcing access control, specifically tailored to both DL and Web environments. Key features of MaX are the supportfor credential and content-based access control to DL and Web documents, and its full integration with standard Internet rating systems.
An Improved Approximation Algorithm for Scheduling Task Trees on Linear Arrays
Authors: Hari Krishna Tadepalli, Errol L. Lloyd
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

We address the problem of finding near optimal schedules for intree structured task graphs on a linear array with a fixed number of identical processors. Each node of the tree requires one unit of execution time and every (directed) edge of the tree denotes that a task can begin execution only after receiving a message from all of its predecessors. The communication links between the processors are bidirectional and can transmit only one message in each direction in one unit of time. The natural goal is to prescribe a schedule that results in the fastest execution (e.g. minimizes the schedule length, or makespan) of all the tasks in the tree. For this problem, we present an time algorithm that outputs a schedule that is guaranteed to be no more than 11 times the optimal schedule length. This is a significant improvement over the results of Kalpakis and Yesha [KY93]. Further, we demonstrate through simulation experiments that our algorithm performs extremely well in practice with an approximation factor that is close to 2 and not more than 3.
Supporting Preemption in Wormhole Networks
Authors: Keith Knauber, Biao Chen
Venue: 23rd International Computer Software and Applications Conference (1999)

When a computer network is used to support real-time applications, meeting delay requirements is a key issue that has to be addressed. In this paper, we study high performance networks with wormhole routing and investigate their performance in terms of meeting message delay constraints. We found that in this kind of network, preemption control performed at each node plays an important role in supporting real-time traffic. In wormhole networks, this may result in unbounded packet blocking time, making it very difficult to efficiently support real-time applications. To overcome this problem, we propose both transparent and non-transparent preemption schemes. Simulations show that combining proposed preemption schemes with other priority-based schemes can outperform the conventional priority-based schemes by a large margin, and the schemes have stable performance in large-scale networks.
Clustering Association Rules
Authors: Brian Lent, Arun N. Swami, Jennifer Widom
Venue: Proceedings of the Thirteenth International Conference on Data Engineering (1997)

The authors consider the problem of clustering two-dimensional association rules in large databases. They present a geometric-based algorithm, BitOp, for performing the clustering, embedded within an association rule clustering system, ARCS. Association rule clustering is useful when the user desires to segment the data. They measure the quality of the segmentation generated by ARCS using the minimum description length (MDL) principle of encoding the clusters on several databases including noise and errors. Scale-up experiments show that ARCS, using the BitOp algorithm, scales linearly with the amount of data.
ODMG Update
Authors: Dirk Bartels
Venue: Proceedings of the Twelfth International Conference on Data Engineering (1996)

The Object Database Management Group (ODMG) is a consortium of the leading Object Database (ODMBS) vendors. The consortium was formed in 1992 with the objective to define a standard for the emerging ODBMS industry. Within 18 months, the first release of the standard, so called ODMG-93 was published in October 1993. The following abstract gives a comprehensive overview of the standard and the extension that have been made since the initial publishing. The overview includes the ODMG Object Model, the ODMG Object Definition Language (ODL), the ODMG Object Query Language (OQL), the ODMG C++ binding and the ODMG Smalltalk binding.
Alternative Learning Arenas - Pedagogical Challenges to Mobile Learning Technology in Education
Authors: Louise Mifsud
Venue: Proceedings IEEE International Workshop on Wireless and Mobile Technologies in Education (2002)

ICT-implementation in education has mostly been aimed at enhancing learning in formal arenas ¿ the classroom. However, accepting that learning does not only forego in the formal learning arenas, it is proposed that mobile technology can be used as a bridge betweenthe formal and informal learning arenas. The question is whether the bridge between school and other arenas open or closed ¿ is there a barrier? The paper asks what strategies/changes/challenges have to be in place for the school to access and utilize learning arenas which are alternative to the formal learning arena?
Incremental Development of a High Integrity Compiler: Experience from an Industrial Development
Authors: Susan Stepney
Venue: The 3rd IEEE International Symposium on High-Assurance Systems Engineering (1998)

We have developed and successfully applied a technique to build a high integrity compiler from Pasp, a Pascal-like language, to Asp, the target language for a high integrity processor designed for the UK's Atomic Weapons Establishment at Aldermaston.We overview the technique itself, including a description of how it can be extended to separate compilation. We also describe some of our experiences whilst implementing this compiler, how successful the whole process has been, and the lessons we have learned.We have cost-effectively developed a compiler to high integrity by using mathematical specification and proof techniques.