ppxscal/embedding_network huggingface dataset:
Complexity of Decision Trees for Boolean Functions
Authors: Rusins Freivalds, Masahiro Miyakawa, Ivo G. Rosenberg
Venue: Proceedings of the 33rd International Symposium on Multiple-Valued Logic (2003)

For every positive integer k we present an example of aBoolean function fk of n = (2k \choose k) + 2k variables, an optimaldeterministic tree T'k for fk of complexity 2k + 1 aswell as a nondeterministic decision tree Tk computing fkwith complexity k + 2; thus of complexity about 1\over2 of the optimaldeterministic decision tree.Certain leaves of Tk arecalled priority leaves.For every input a \epsilon {0, 1}n if any ofthe parallel computation reaches a priority leaves then itslabel is f,(a).If the priority leaves are not reached at allthen the label on any of the remaining leaves reached by thecomputation is fk(a).
Experiences in Teaching Software Evolution and Program Comprehension
Authors: Arie van Deursen, Jean-Marie Favre, Rainer Koschke, Juergen Rilling
Venue: Proceedings of the 11th IEEE International Workshop on Program Comprehension (2003)

A large amount of research is devoted to software evolution and program understanding, but these topics are often neglected in software engineering curricula. The CCSE initiative from IEEE/ACM proposes guidelines for the future. At the ICSM'02 conference, a panel was held to establish what should be taught in the future. This working session focuses on what is being taught and what will be taught in the near future. The goals include (1) to share experiences in teaching software evolution and program understanding, (2) to establish the state of the practice and (3) to identify future directions.
A Synthesis Method for Fault-tolerant and Flexible Multipath Routing Protocols
Authors: Yutaka Hatanaka, Masahide Nakamura, Yoshiaki Kakuda, Tohru Kikuno
Venue: Proceedings of the Third IEEE International Conference on Engineering of Complex Computer Systems (1997)

Design of practical routing protocols is complex and difficult due to complicated requirements of fault-tolerance and flexibility. The protocol is defined to be fault-tolerant if messages can be rerouted via another path when the communication channel fails. In this paper, we propose a new synthesis method for generating a fault-tolerant routing protocol for a given service specification and a network topology. The routing protocol thus obtained adopts a multipath routing augmented with sets, where each set stores the next nodes for routing, and updates the sets according to network topology changes. Additionally, the routing protocol can attain flexibility by the multipath routing mechanism in the sense that only a small amount of changes is needed for addition or deletion of nodes. Finally, we show the effectiveness of the proposed method through an application to a typical routing service of message delivery from a source node to a destination node.
Visualizing World-Wide Web Search Engine Results
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

Most of the popular WWW search engines show the documents that match the users' queries as pages of scrolled lists. If lots of information are retrieved this is not very user-friendly. Moreover, there is no mechanism to easily determine documents linked to the retrieved documents or the relevant keywords. This paper presents a system that allows the user to visualize various related information for the search results. We also introduce a focus+context visualization technique for the search space of WWW queries.
Official Red Hat Linux Administrator's Guide
Authors: Sandra A. Moore
Venue:  (2002)

:Red Hat sealed and approved! Compiled by Red Hats own documentation team and reviewed by a Red Hat qualified technical expert, this comprehensive, authoritative guide delivers all the know-how you need to manage Linux networks and systems, troubleshoot problems, and provide optimum client service.Youll find in-depth coverage of creating network scripts, configuring Apache and Samba, Kickstart installations, and managing major protocols such as SSH, LDAP, DHCP, and BIND. Learn what you need to know about Red Hat Linux 8 exclusives like GRUB and ext3 and get extensive information on topics most Linux guides dont even address, like Tripwire, PAM, Samba, and RAID.This guidebook is your single official source for documentation, instruction, and answers about Red Hat Linux 8.Proven Red Hat Linux Administration SolutionsUnderstand the pros and cons of Kerberos 5 and configure both server and clientUpgrade the kernel and learn about working with kernel modulesAdd SMB, NCP, and JetDirect printers, modify existing printers, and configure the CUPS systemManage console access and use xinetd to control access to servicesConfigure, enhance, and maintain an Apache secure serverSelect, configure, and update appropriate security installationsTroubleshoot NFS, /proc, ext3, and the Red Hat Linux File SystemAdd packages and maintain Red Hat Linux with regular updates
Formalized Metareasoning in Type Theory
Authors: Todd B. Knoblock, Robert L. Constable
Venue:  (1986)

In this paper we present two practical methods of formalizing the metatheory of constructive type theory and demonstrate how they would be used to improve the reasoning capabilities of formal problem solving systems such as Nuprl. One method depends upon the design of a family of languages, and we sketch that construction. The second approach depends on a particular metatheorem that justifies partial reflection, and we outline this proof. We also illustrate the construction of simple metatheoretic functions, tactics, in Nuprl.
Integrating groupware activities into workflow management systems
Authors: I. Z. Ben-Shaul, G. E. Kaiser
Venue: Proceedings of the 7th Israeli Conference on Computer-Based Systems and Software Engineering (1996)

Computer supported cooperative work (CSCW) has been recognized as a crucial enabling technology for multi-user computer-based systems, particularly in cases where synchronous human-human interaction is required between geographically dispersed users. Workflow is an emerging technology that supports complex business processes in modern corporations by allowing to explicitly define the process, and by supporting its execution in a workflow management system (WFMS). Since workflow inherently involves humans carrying out parts of the process, it is only natural to explore how to synergize these two technologies. The authors analyze the relationships between groupware and workflow management, present their general approach to integrating synchronous groupware tools into a WFMS, and conclude with an example process that was implemented in the Oz WFMS and integrated such tools. Their main contribution lies in the integration and synchronization of individual groupware activities into modelled workflow processes, as opposed to being a built-in part of the workflow WFMS.
Faithful Translations between Polyvariant Flows and Polymorphic Types
Authors: Torben Amtoft, Franklyn Turbak
Venue:  (2000)

Abstract Recent work has shown equivalences between various type systems and flow logics. Ideally, the translations upon which such equivalences are based should be faithful in the sense that information is not lost in round-trip translations from flows to types and back or from types to flows and back. Building on the work of Nielson & Nielson and of Palsberg & Pavlopoulou, we present the first faithful translations between a class of finitary polyvariant flow analyses and a type system supporting polymorphism in the form of intersection and union types. Additionally, our flow/type correspondence solves several open problems posed by Palsberg & Pavlopoulou: (1) it expresses call-string based polyvariance (such as k-CFA) as well as argument based polyvariance; (2) it enjoys a subject reduction property for flows as well as for types; and (3) it supports a flow-oriented perspective rather than a type-oriented one.
Complex spectral decision diagrams
Authors: B. J. Falkowski, S. Rahardja
Venue: Proceedings of the 26th International Symposium on Multiple-Valued Logic (1996)

Different decision diagrams for representations of binary and multiple-valued functions in the form of Complex Hadamard Transforms and Spectra are introduced in this paper. Since Complex Hadamard Transform matrix can be recursively expanded through Kronecker products, complex hybrid decision diagrams can be easily derived. Other types of decision diagrams introduced are: complex multi-terminal decision diagrams, complex algebraic decision diagrams, real and imaginary decision diagrams and complex edge-valued decision diagrams. The latter decision diagrams are derived from partial Complex Hadamard Transform. Introduction of different efficient representations of Complex Hadamard Transforms and spectra in the form of decision diagrams with their useful properties as the discrete transformations should open the possibility of new applications of spectral techniques based on such transformations in the design of binary and multiple-valued logic systems.
Architectural Illustration: The Advancement of Light, Shade, and Shadows Knowledge with 3D Digital Technology
Authors: Clark A. Cory
Venue: Proceedings of the International Conference on Information Visualisation (2000)

The transition from traditional graphics into computer graphics over the past decade has brought about a multitude of changes that graphics educators and other graphics professionals have had to address and incorporate. The ever evolving integration of Computer Aided Design (CAD) in architecture and engineering have revolutionized the design and documentation process. In the area of graphic communications, changes from layout and design to desk-top publishing and interactive 'new media' design for CD-ROM and Web distribution are but a few of the changes graphic educators have to keep up with. One problem with new technology is computer graphics encompasses several components and areas, and some of these areas are not able to progress into technology as quickly as others. This paper will give an overview of the Shades, Shadows, and Perspective course at Purdue University and how it has evolved into an integrated 2D and 3D Digital Lighting and Rendering illustration 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
How to index anything
Authors: Josh Rabinowitz
Venue: Linux Journal (2003)

Create a local search engine to search HTML and every other document format on your system.
Software visualization in software maintenance, reverse engineering, and re-engineering: a research survey
Authors: Rainer Koschke
Venue: Journal of Software Maintenance: Research and Practice (2003)

Software visualization is concerned with the static visualization as well as the animation of software artifacts, such as source code, executable programs, and the data they manipulate, and their attributes, such as size, complexity, or dependencies. Software visualization techniques are widely used in the areas of software maintenance, reverse engineering, and re-engineering, where typically large amounts of complex data need to be understood and a high degree of interaction between software engineers and automatic analyses is required. This paper reports the results of a survey on the perspectives of 82 researchers in software maintenance, reverse engineering, and re-engineering on software visualization. It describes to which degree the researchers are involved in software visualization themselves, what is visualized and how, whether animation is frequently used, whether the researchers believe animation is useful at all, which automatic graph layouts are used if at all, whether the layout algorithms have deficiencies, and--last but not least--where the medium-term and long-term research in software visualization should be directed. The results of this survey help to ascertain the current role of software visualization in software engineering from the perspective of researchers in these domains and give hints on future research avenues.
Micro-Checkpointing: Checkpointing for Multithreaded Applications
Authors: K. Whisnant, Z. Kalbarczyk, R. K. Iyer
Venue: Proceedings of the 6th IEEE International On-Line Testing Workshop (IOLTW) (2000)

In this paper, we introduce an efficient technique for checkpointing multithreaded applications. Our approach makes use of processes constructed around the ARMOR (Adaptive Reconfigurable Mobile Objects of Reliability) paradigm implemented in our Chameleon testbed. ARMOR processes are composed of disjoint elements (objects) with controlled manipulation of element state. These characteristics of ARMOR's allow the process state to be collected during runtime in an efficient manner and saved to disk when necessary. We call this approach micro-checkpointing.We demonstrate micro-checkpointing in the Chameleon testbed; an environment for developing reliable distributed applications. Our results show that the overhead ranges from between 39% to 141% with an aggressive checkpointing policy, depending upon the degree to which the process conforms to our ARMOR paradigm.
Election Vs. Consensus in Asynchronous Systems
Authors: Laura S. Sabel, Keith Marzullo
Venue:  (1995)

It was shown in 1985 that the {\em Consensus problem} cannot be solved in an asynchronous system if even a single crash failure can occur. In this paper, we show that there are other problems that cannot be solved in an asynchronous system, and for the same intuitive reason: it is impossible to distinguish a very slow processor from a crashed processor. However, these problems are harder than Consensus, in that there are contexts in which Consensus can be solved but these other problems cannot. More precisely, the weakest failure detector that is needed to solve these problems is a Perfect Failure Detector, which is strictly stronger than the weakest failure detector that is needed to solve Consensus. We use a formulation of the Election problem as the prototype for these problems that are harder than Consensus.
Fluid Analysis of Delay Performance for QoS Support in Wireless Networks
Authors: Jeong Geun Kim, Marwan Krunz
Venue: Proceedings of the Seventh Annual International Conference on Network Protocols (1999)

Providing quality of service (QoS) guarantees over wireless links requires thorough understanding and quantification of the interactions among the traffic source, the wireless channel, and the underlying error control mechanisms. In this paper, we account for such interactions in a network-layer model that we use to investigate the delay performance for an ON/OFF traffic stream transported over a wireless link. The capacity of this link fluctuates according to a fluid version of Gilbert-Elliot's model. We derive the packet delay distribution via two different approaches: uniformization and Laplace transform. Conputational aspects of both approaches are discussed. The delay distribution is then used to quantify the wireless effective bandwidth under a given delay guarantee. Numerical results and simulations are used to verify the adequacy of our analysis and to study the impact of error control and bandwidth allocation on the packet delay performance.
Haptic Representation of the Atom
Authors: Erica Harvey, Chaim Gingold
Venue: Proceedings of the International Conference on Information Visualisation (2000)

Three-dimensional functions that represent atomic orbitals are traditionally difficult for chemistry students to conceptualize. Large sections of undergraduate physical chemistry texts are devoted to breaking apart and simplifying electron density functions so they can be visually represented. Traditional methodologies include skins (isosurfaces and enclosures of certain probabilities), three-dimensional projections (color, contours, slices) and two-dimensional graphs. Preliminary work with the Phantom 3D haptic interface suggests that haptics are an important addition to the chemist's tool set for representing atomic orbitals. With the Phantom, users simply move through real three-dimensional space and perceive the electron density as the force on the Phantom's pen.In our work, the force is proportional to the probability density function for the electron at any point, given by the square of the wave-function describing a particular atomic orbital \math. Nodes are felt as regions of zero force, increasing \math, two values are felt as increasing resistance, and maxima are communicated by haptic ¿clicks.¿Previous application of the Phantom to chemistry by Wanger utilized haptics for molecular docking feedback [1]. The present work tackles the altogether different problem of haptically visualizing the probability density functions of individual atomic orbitals. Feedback from chemistry students is positive and interest in continued development of the work is high among chemistry faculty.
Strong normalizability in Martin-Lof''s Type Theory
Authors: Gunnar Sjodin, Clas Lofwall
Venue:  (1991)

In this paper we prove that any subexpression of a correct judgement in Martin-Lof''s Type Theory is strongly normalizable. We use the well-established technique with a ``computability predicate''''. The logic used in the proof is classical set theory.
On structuring operating systems with monitors
Authors: J. L. Keedy
Venue: ACM SIGOPS Operating Systems Review (1979)

This paper considers whether Hoare's monitor proposal for structuring operating systems could usefully be applied in the design of substantial operating systems for medium or large computers. Attention is drawn to problems which might arise in terms of the structural form of monitors, the approach to resource scheduling, and the monitor approach to synekrordsation and process scheduling. An appended note considers the related technique proposed by Wirth in the Modula language.
Parsing C++ Despite Missing Declarations
Authors: Gregory Knapen, Bruno Laguë, Michel Dagenais, Ettore Merlo
Venue: Proceedings of the 7th International Workshop on Program Comprehension (1999)

This paper addresses the problem of parsing a C++ software system that is known to compile correctly, but for which some header files are unavailable. A C++ program file typically depends on numerous included header files from the same system, a third party library, or the operating system standard libraries. It is not possible with a conventional parser to analyze C++ source code without obtaining the complete environment where the program is to be compiled. This paper studies the parsing ambiguities resulting from missing header files and proposes a special parser which uses additional rules and type inference in order to determine the missing declarations. This new parser has achieved 100% accuracy on a large system with numerous missing header files.
A Package for Solving Sparse Symmetric Positive Definite Systems on Distributed-memory Multiprocessors
Authors: Chunguang Sun
Venue:  (1992)

We describe the structure and use of PSSPD, a sparse matrix package for solving large sparse symmetric positive definite systems efficiently on distributed-memory multiprocessors. This package is implemented in C and presently runs on Intel iPSC/2 and iPSC/860 machines. The attractive features of this package are its high performance on distributed-memory multiprocessors and ease of use. It provides simple and efficient mechanisms for solving systems with multiple right hand sides and systems with same sparsity structure but different sets of numerical values. This package embodies the state of the art in sparse matrix technology and requires the use of complicated data structures and algorithms for ordering, symbolic factorization, task partitioning and mapping, parallel numerical factorization, and parallel triangular solution. However, the easy-to-use user interface of this package effectively insulates the user from considerations of these complex data structures and algorithmic issues.
Identification of Data Cohesive Subsystems Using Data Mining Techniques
Authors: Carlos Montes de Oca, Doris L. Carver
Venue: Proceedings of the International Conference on Software Maintenance (1998)

The activity of reengineering and maintaining large legacy systems involves the use of design recovery techniques to produce abstractions that facilitate the understanding of the system. In this paper, we present an approach to design recovery based on data mining. This approach derives from the observation that data mining can discover unsuspected non-trivial relationships among elements in large databases. This observation suggests that data mining can be used to elicit new knowledge about the design of a subject system and that it can be applied to large legacy systems. We describe the ISA methodology which uses data mining to identify data cohesive subsystems. We were able to decompose COBOL systems into subsystems by using this approach. Our experience shows that data mining can identify data cohesive subsystems without any previous knowledge of the subject system. Furthermore, data mining can produce meaningful results regardless of system size making this approach especially appropriate to the analysis of large undocumented systems.
Visualisation of surveillance coverage by latency mapping
Authors: Patrick Chisan Hew
Venue: Proceedings of the Asia-Pacific symposium on Information visualisation - Volume 24 (2003)

This paper introduces latency mapping as a technique for visualising surveillance coverage. Built on a concept for modelling the total effort by a surveillance force, latency mapping provides an understanding of the collective sensor coverage against a region of interest, in space and time. Latency mapping has been used to support the analysis of maritime surveillance operations in Australia's northern waters, and has been proposed for integration into Australia's Joint Command Support System (JCSS).
Nonmonotonic back-tracking trust region interior point algorithm for linear constrained optimization
Authors: Detong Zhu
Venue: Journal of Computational and Applied Mathematics (2003)

In this paper, we modify the trust region interior point algorithm proposed by Bonnans and Pola in (SIAM J. Optim. 7(3) (1997) 717) for linear constrained optimization. A mixed strategy using both trust region and line-search techniques is adopted which switches to back-tracking steps when a trial step produced by the trust region subproblem may be unacceptable. The global convergence and local convergence rate of the improved algorithm are established under some reasonable conditions. A nonmonotonic criterion is used to speed up the convergence progress in some ill-conditioned cases. The results of numerical experiments are reported to show the effectiveness of the proposed algorithm.