ppxscal/embedding_network huggingface dataset:
A repository to support requirement specifications reuse
Authors: J. L. B. Justo
Venue: Proceedings of the 1996 Information Systems Conference of New Zealand (ISCNZ '96) (1996)

Software reuse benefits from methodologies and tools to: locate, evaluate, and tailor reusable components to new developments; develop more readily reusable components; reduce cost, time, effort and probability of emerging bugs; and increase efficiency and quality of final products. The paper's focus is on the architecture of a centralized repository to support requirement specifications reuse. The repository enables the application of design-by and design-for reuse methodologies, as it is the core element, where the reusable components are stored in a hierarchy of different levels of abstraction. Indexing techniques for identifying representative descriptors of schemas and similarity techniques to compare schemas for their classification into families, are also discussed. The components engineering process, to identify, select and classify candidate schemas and components, is detailed. Methodology and tools for the repository are briefly described.
Program Schemata and Information Flow: A Study of Some Aspects of the Schema Power of Data Structures
Authors: John S Brown
Venue:  (1972)

The concept of a program schema, which represents the skeleton of a computer program, is important for its potential and actual applicability to code optimization, to understanding the behavior of programs using various control and data structure features, and to developing a theory of information flow as related to program form and power. In this study tow storage devices, the tape and the queue, are considered, and their effect on the schema power hierarchy explored. The behavior and relative capability of each one of the various types of tapes and queues is discussed in the light of the ways in which information is allowed to move, according to the inherent characteristics of the devices. Main results include the facts that addition of a single tape unit to the simplest schema class P gives no additional power, and that the basic cyclic nature of queues and the persistence of data on tapes are important power determinants. An attempt is made to bridge the gap between schema theory and actual programs not only by studying models of actual storage units but also by allowing an arbitrarily long (but finite) input stream. Such an extension generally upsets the onion-like power inclusions of the finite input hierarchy because of the calculations possible on the implicitly-input arbitrary integer, which is the number of inout values. The information flow characteristics of the data structures associated with a particular schema class may allow such an arbitrary input to be viewed exactly once, exactly twice, or in general m times, and such distinctions give rise to differences in computational power. Requirements insuring that the interconnection of schemata form a schema with the union of the capabilities of the subschemata are considered. The hierarchy of schemata without the identity assignment is also studied, and it is demonstrated that in the simplest class $P$ and the universal class $P_{Ae}$ no loss of power results from prohibiting identity assignments. Discussion of the as-yet-unsolved problem of the power of the class $P_{(2b,0)}$ and its associated derivatives is presented. A summary of prospects for developing program schema research in several different potentially practical directions concludes the work. 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
Complementary Self-Biased Scheme for the Robust Design of CMOS/SET Hybrid Multi-Valued Logic
Authors: Ki-Whan Song, Sang Hoon Lee, Dae Hwan Kim, Kyung Rok Kim, Jaewoo Kyung, Gwanghyeon Baek, Chun-An Lee, Jong Duk Lee, Byung-Gook Park
Venue: Proceedings of the 33rd International Symposium on Multiple-Valued Logic (2003)

We propose a new technique to enhance thecharacteristics of CMOS/SET hybrid multi-valued logic(MVL) circuits in terms of their stability and performance.A complementary self-biasing method enables theSET/CMOS logic to operate perfectly well at hightemperature in which the peak-to-valley current ratio ofCoulomb oscillation severely decreases. The suggestedscheme is evaluated by SPICE simulation with ananalytical SET model, and it is confirmed that even SETswith a large Si island can be utilized efficiently in themulti-valued logic. We demonstrate a quantizerimplemented by SETs with a 90-nm-long Si island on thebasis of measured device characteristics and SPICEsimulation, which shows high resolution and smalllinearity error characteristics.
Constraint Logic Programming
Authors: Pascal Van Hentenryck
Venue:  (1991)

Constraint logic programming (CLP) is a generalization of logic programming (LP) where unification, the basic operation of LP languages, is replaced by constraint handling in a constraint system. The resulting languages combine the advantages of LP (declarative semantics, nondeterminism, relational form) with the efficiency of constraint-solving algorithms. For some classes of combinatorial search problems, they shorten the development time significantly while preserving most of the efficiency of imperative languages. This paper surveys this new class of programming languages from their underlying theory, to their constraint systems, and to their applications to combinatorial problems.
Visualization Support for User-Centered Model Selection in Knowledge Discovery in Databases
Authors: Tu Bao Ho, Trong Dung Nguyen
Venue: Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence (2001)

The process of knowledge discovery in databases inherently consists of several steps that are necessarily iterative and interactive. In each application, to go through this process the user has to exploit different algorithms and their settings that usually yield different discovered models. The selection of appropriate discovered models or algorithms to achieve such models, referred to as model selection- requires meta-knowledge on algorithm/model and model performance metrics-is generally a difficult task for the user. Taking account of this difficulty, we consider that the ease of model selection is crucial in the success of real-life knowledge discovery activities. Different from most related work that aims to an automatic model selection, in our view model selection should be a semiautomatic work requiring an effective collaboration between the user and the discovery system. For such a collaboration, our solution is to give the user the ability to try easily various alternatives and to compare competing models quantitatively by performance metrics, and qualitatively by effective visualization. This paper presents our research on such model selection and visualization in the development of a knowledge discovery system called D2MS.
DHCP for mobile networking with TCP/IP
Authors: C. E. Perkins, T. Jagannadh
Venue: Proceedings of the IEEE Symposium on Computers and Communications (ISCC'95) (1995)

Mobile-IP and the Dynamic Host Configuration Protocol (DHCP) are two protocols which are likely to be implemented together for use with wireless computers. We explore the ways that they can be used with in mobile computers. These protocols interact in subtle ways, presenting a system architect with a variety of trade-offs that need careful analysis. We detail the important interactions and system design issues, and also explain the design and implementation of a new DHCP option for mobile computers. The difference between mobility and portability is explained; this paper only emphasizes approaches for mobility. We explore implementation issues that we have encountered.
Faster Smarter Microsoft Office System 2003
Authors: Katherine Murray
Venue:  (2003)

Now you can do the things you do every day with Microsoft Office 2003-create reports, manage finances, send e-mail, and make a presentation-but do them faster, smarter, and better!
National parallel processing research council executive committee charter
Authors: John R. Sopka
Venue: ACM SIGOPS Operating Systems Review (1984)

The fundamental objective of the National PARALLEL PROCESSING RESEARCH COUNCIL is to foster cooperation among industry, university, and government bodies in support of research and development on parallel computing systems. Such cooperation is considered essential to expand more rapidly both the understanding of hardware and software concepts and their utilization in development of actual computing systems.This proposal attempts to specifically identify the responsibilities and activities of an Executive Committee for the National PARALLEL PROCESSING RESEARCH COUNCIL. 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
Fusing Cooperative Technical-Specification Knowledge Components
Authors: É. Grégoire
Venue: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (2002)

In this paper, the problem of fusing logic-based technical specification knowledge components of a physical device or process, is investigated. It is shown that most standard logic approaches to beliefs fusion are not relevant in this context since some rules should be merged even in the case of consistent fusion. Accordingly, we discuss the various types of formulas that should be merged during a fusion process, in order to avoid necessary conditions for the absence of failure to become sufficient conditions. This transformation is then described formally. It can be performed as an efficient preprocessing step on the knowledge components to be fused. The properties of this transformation schema are then investigated from a semantical point of view. Finally, series of subsumption tests are proposed, preventing conditions of absence of failure from being overridden by subsumption.
Object management for network-centric systems with mobile objects
Authors: B. Lavva, O. Holder, I. Ben-Shaul
Venue: Proceedings of the Third IEEE International Conference on Engineering of Complex Computer Systems (1997)

Mobile software objects are computational entities that travel in large-scale and widely-distributed heterogeneous systems, and whose functionality can be attached to diverse computing environments. When employed over decentralized sites with operational and administrative autonomy, support for mobility raises difficult issues with respect to object management services. In particular it impacts persistence, reference handling, object naming, and requires extensive support for security. This paper discusses the requirements from an object management system that incorporates mobile, autonomous and reflective objects and presents the design and implementation of the Mobile Object Manager (MOM) which fulfills these requirements.
Exploiting Global Data Locality in Non-Blocking Multithreaded Architectures
Authors: Wen-Yen Lin, Jean-Luc Gaudiot
Venue: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (1997)

Non-Blocking Multithreaded architectures have been proposed as an effective means to overlap computation and communication in distributed memory systems. However, in these models, communication latency could only be hidden from computation as long as there are enough ready threads. In this paper, we describe our I-Structure Software Cache (ISSC) runtime system, which takes advantage of the global data locality in these models without adding any specific hardware support. Our ISSC provides a communication latency reduction technique in non-blocking multithreaded architectures while maintaining the ability of tolerating communication latency. Our simulation results show that our ISSC runtime system dramatically decreases network traffic by caching remote requests and also achieves 70% to 95% improvement on the system performance(speedup).
Alternate path reasoning in intelligent instrument fault diagnosis for gas chromatography
Authors: K. L. Adair, S. I. Hruska, J. W. Elling
Venue: Proceedings of the 1996 IEEE International Joint Symposia on Intelligence and Systems (1996)

Intelligent instrument fault diagnosis is addressed using expert networks, a hybrid technique which blends traditional rule-based expert systems with neural network style training. One of the most difficult aspects of instrument fault diagnosis is developing an appropriate rule base for the expert network. Beginning with an initial set of rules given by experts, a more accurate representation of the reasoning process can be found using example data. A methodology for determining alternate paths of reasoning and incorporating them into the expert network is presented. Our technique presupposes interaction and cooperation with the expert, and is intended to be used with the assistance of the expert to incorporate knowledge discovered from the data into the intelligent diagnosis tool. Tests of this methodology are conducted within the problem domain of fault diagnosis for gas chromatography. Performance statistics indicate the efficacy of automating the introduction of alternate path reasoning into the diagnostic reasoning system.
An Improved Algorithm for the Symbolic Reliability Analysis of Networks
Authors: Malathi Veeraraghavan
Venue:  (1988)

Techniques based on Boolean algebra have been used for the symbolic reliability analysis of a two-terminal coherent network or for the analysis of a fault tree without NOT gates. The purpose of this paper is to describe an efficient algorithm for the symbolic reliability analysis. The algorithm is applicable to a fault tree without NOT gates but with repeated nodes and $s$-independent components, or to a two-terminal network with $s$-independent components. The algorithm was originally due to Grnarov, Kleinrock and Gerla. We show that the original published algorithm had errors, we correct the errors and more importantly, we formally prove the correctness of the algorithm. We extend the algorithm to compute the reliability importance of a given component. We have also implemented the modified algorithm and we describe its measured complexity for a large set of example problems.
Secured Computing: A SSCP Study Guide
Authors: Carl F. Endorf
Venue:  (2002)

:The Systems Security Certified Professional (SSCP) designation is one of the most respected certifications an IT professional can obtain during their career. It demonstrates the ability to understand a broad range of security concerns in many areas of the security profession.This is the ultimate guide for the Systems Security Certified Professional (SSCP) Exam. It is designed for the experienced Security Professional. This guide will help to supplement your studies and further your goal of acquiring the SSCP designation. The book is designed for a security professional by a security professional. The author has strived to take the information that is needed to be successful in the security arena and to condense it into one concise volume.In addition, this book is also a great resource for anyone interested in getting a better hndle on how to secure ones organization and enterprise. This guide will help you to understand the common body of knowledge that is set forth by ISC2* and many security professionals today.* SSCP is a registered Trademark of ISC2, Inc. This publication is not endorsed nor sponsered by ISC2, Inc. The information here within is that of the authors and his intent to consolidate this informaton. The test and quiz questions are not official test questions set forth by ISC2, but intended only for the purpose of learning the knowledge needed to prepare for this test.About the AuthorCarl Endorf, CISSP, MCSE, CCNA, ITIL, CIWA is a technical security analyst for one of the largest Insurance and banking companies in the U.S. He has practical experience in forensics, corporate investigations and Internet security. He is currentlypursuing his graduate degree at the University of Illinois in Management Information Systems.
Complete Exchange Algorithms in Wormhole-Routed Torus Networks: A Divide-and-Conquer Strategy
Authors: Si-Gwan Kim, Seung Ryoul Maeng, Jung Wan Cho
Venue: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (1999)

We present efficient all-to-all personalized communication algorithms for a 2D torus in wormhole-routed networks. Our complete exchange algorithm adopts divide-and-conquer approach to reduce the start-up latency significantly, which is a good metric for network performance in wormhole networks.The first algorithm recursively divides the whole network into 2x2 networks. After specially designated nodes called master nodes have collected messages, whose destinations are the rest of the basic cells, only master nodes perform complete exchange with reduced network size. Upon finishing this complete exchange among master nodes, these nodes distribute messages to the rest of the master nodes, which results in the desired complete exchange. The second algorithm, which is more practical than the first one, divides the network only once.After we present these new algorithms, we analyze time complexities and compare several algorithms. We show that our practical algorithm is efficient by a factor of 2 in the required start-up time which means that our algorithm is suitable for wormhole-routed networks.
Well-posedness of an integro-differential Fremond model for shape memory alloys
Authors: Elena Bonetti
Venue:  (2000)

This paper deals with the nonlinear three-dimensional Fremond model for shape memory alloys in the case whern the heat flux contains some memory terms. The abstract formulation of the resulting initial-boundary PDE system is considered. Existence and uniqueness of solutions are proved by exploiting a semi-implicit time discretization scheme, combined with an a priori estimates passage to the limiti procedure as well by performing suitable contracting estimates on the solutions.
An optimal establishment of virtual path connections for ATM networks
Authors: Sang-Baeg Kim
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1 (1995)

A number of optimization models for the establishment of virtual path connections (VPCs) with reserved capacity have been proposed in the literature. All of them, however, failed to reflect the trade-off between increased capacity costs and reduced control costs explicitly in their formulations. the present authors develop a mathematical formulation for an optimal strategy for the reservation of capacity on VPCs, considering the trade-off between increased capacity costs and reduced control costs. In this formulation, they also consider the reservation of buffers on VPCs. Algorithms and numerical results are presented.
Evaluation Problems in Interactive Information Retrieval
Authors: Gerard Salton
Venue:  (1969)

Interactive retrieval procedures are normally based on rapidly accessible files. Special storage organizations and file search techniques are used, and the system user is made to fulfill an important role during the retrieval process. In the present study, the interactive retrieval environment is briefly examined. The special problems which arise in the evaluation of interactive retrieval are then discussed, and methods are described for evaluating partial file searches and user feedback techniques. Evaluation resultss obtained with the SMART system are presented.
Radio link admission algorithms for wireless networks with power control and active link quality protection
Authors: N. D. Bambos, S. C. Chen, G. J. Pottie
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1 (1995)

Presents a distributed power control scheme, which maintains the signal/interference ratios (SIRs) of operational (active) links above their required thresholds at all times (link quality protection), while new users are being admitted; furthermore, when new users cannot be successfully admitted, existing ones do not suffer fluctuations of their SIRs below their required thresholds values. The authors also present two admission/rejection control algorithms, which exercise voluntary drop-out of links inadmissible to the network so as to reduce interference and possibly facilitate the admission of other links.
Harmonization of international software standards on integrity and dependability
Authors: D. Kiang
Venue: Proceedings of the 2nd IEEE Software Engineering Standards Symposium (1995)

The requirements and the need for harmonization of International Standards of ISO/IEC JTCI/SC7/WG9 on Software Integrity and IEC/TC56/WG10 on Software Aspects of Dependability are discussed. A collaborative framework for the joint Working Group (WG) of the respective ISO/IEC Technical Committees (TC) for software standards development is presented. The harmonization process provides a unique cross disciplinary action in the collaboration by addressing integrity level as a unifying concept and dependability as a specific risk dimension in system application where software components are involved. The experience and cooperative spirit of the joint WG are captured to serve as a model for other standards development needing to extend beyond their own technical boundaries for the benefits of the ultimate users of the standards.
Decomposition of Algebraic Functions
Authors: Dexter Kozen, Susan Landau, Richard Zippel
Venue:  (1994)

Functional decomposition--whether a function $f(x)$ can be written as a composition of functions $g(h(x))$ in a nontrivial way--is an important primitive in symbolic computation systems. The problem of univariate polynomial decomposition was shown to have an efficient solution by Kozen and Landau [8]. Dickerson [5] and von zur Gathen [11] gave algorithms for certain multivariate cases. Zippel [13] showed how to decompose rational functions. In this paper, we address the issue of decomposition of algebraic functions. We show that the problem is related to univariate resultants in algebraic function fields, and in fact can be reformulated as a problem of resultant decomposition. We give an algorithm for finding a nontrivial decomposition of a given algebraic function if it exists. The algorithm involves genus calculations and constructing transcendental generators of fields of genus zero.
Alias Types for Recursive Data Structures (Extended Version)
Authors: David Walker, Greg Morrisett
Venue:  (2000)

Linear type systems permit programmers to deallocate or explicitly recycle memory, but they are severly restricted by the fact that they admit no aliasing. This paper describes a pseudo-linear type system that allows a degree of aliasing and memory reuse as well as the ability to define complex recursive data structures. Our type system can encode conventional linear data structures such as linear lists and trees as well as more sophisticated data structures including cyclic and doubly-linked lists and trees. In the latter cases, our type system is expressive enough to represent pointer aliasing and yet safely permit destructive operations such as object deallocation. We demonstrate the flexibility of our type system by encoding two common compiler optimizations: destination-passing style and Deutsch-Schorr-Waite or ``link-reversal'''' traversal algorithms.