ppxscal/embedding_network huggingface dataset:
Modeling and Analysis of Using Memory Management Unit to Improve Software Reliability
Authors: Shih-Jeh Chang, Prudence T. Zacarias Kapauan
Venue: Proceedings of the 12th International Symposium on Software Reliability Engineering (2001)

Voice and data convergence, voice over packets and 3G Wireless demand rapid evolvability for switching systems to succeed in the global marketplace. To succeed, a switching platform's software architecture must be able to quickly absorb new technologies andrespond to new market needs. This presents a new challenge to switching software architects because a switching platform must also be able to meet very stringent reliability requirements. One such requirement is no more than 0.5 minute per year of total downtime (i.e. better than six 9's in total system availability) as specified in Telecordia's GR-929-CORE. This paper establishes a framework for improving switching platform software fault tolerance while meeting the needs of fast-time-to-market via the use of a very common component of modern microprocessor called memory management unit (MMU) and provides a modelingand analytical method for evaluating different implementation alternatives.Finally, the paper presents examples based on modeling a 3G Wireless switching platform, to illustrate the effectiveness of using the proposed method. Modeling results show more than 200times improvement can be achieved with use of MMU.
Microprocessor Specification in Hawk
Authors: John Matthews, Byron Cook, John Launchbury
Venue: Proceedings of the 1998 International Conference on Computer Languages (1998)

Modern microprocessors require an immense investment of time and effort to create and verify, from the high-level architectural design downwards. We are exploring ways to increase the productivity of design engineers by creating a domain-specific language for specifying and simulating processor architectures. We believe that the structuring principles used in modern functional programming languages, such as static typing, parametric polymorphism, first-class functions, and lazy evaluation provide a good formalism for such a domain-specific language, and have made initial progress by creating a library on top of the functional language Haskell. We have specified the integer subset of an out-of-order, superscalar DLX microprocessor, with register-renaming, a reorder buffer, a global reservation station, multiple execution units, and speculative branch execution. Two key abstractions of this library are the signal abstract data type (ADT), which models the simulation history of a wire, and the transaction ADT, which models the state of an entire instruction as it travels through the microprocessor.
A "Design for Verification" Methodology
Authors: A. Castelnuovo
Venue: Proceedings of the 2nd International Symposium on Quality Electronic Design (2001)

New tools are getting available on the market that help alleviating the problem and improve the quality of functional verification of today's complex systems. A methodology that makes use of such tools is described and compared to the traditional approach followed in the context of a specific project. The scope is limited to functional verification but spans from block- to system-level.
An Overview of Lambda Prolog
Authors: Gopalan Nadathur, Dale Miller
Venue:  (1988)

$\lambda$Prolog is a logic programming language that extends Prolog by incorporating notions of higher-order functions, $\lambda$-terms, higher-order unification, polymorphic types, and mechanisms for building modules and secure abstract data types. These new features are provided in a principled fashion by extending the classical first-order theory of Horn clauses to the intuitionistic higher-order theory of {\em hereditary Harrop} formulas. The justification for considering this extension a satisfactory logic programming language is provided through the proof-theoretic notion of a {\em uniform proof}. The correspondence between each extension to Prolog and the new features in the stronger logical theory is discussed. Also discussed are various aspects of an experimental implementation of $\lambda$Prolog.
A Logical-Semiotic Filtering for Economic Data
Authors: Ana Marostica
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

This paper presents the definition of a filter (i.e, a logical-semiotic detector that produces aCut off in the amount of distorted information).And an algorithm for a first-order formal Framework that would evaluate and check whether grounded formulas which predicates,Involved in semiotic trees, are ambiguous terns in economics.A toy example in financialEconomics illustrates this heuristic-semiotic procedure.
On a Deductive Reasoning Model and Method for Uncertainty
Authors: Makoto Suzuki, Toshiyasu Matsushima, Shigeichi Hirasawa
Venue: Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence (1999)

In this paper, we will discuss a problem of deduction with uncertainty that has been dealt with by various diagnostic expert systems. Our two main points are as follows. First, we will propose a mathematical framework of deductive reasoning with uncertainty. Second, we will establish a new reasoning method. Our deduction algorithm can compute a result which minimizes a divergence.
Knowledge-based system associated with foundations in expansive soils
Authors: M. E. M. Hamadto, J. Oliphant
Venue: Proceedings of the sixth international conference on Application of artificial intelligence to civil & structural engineering (2001)

This paper is dealing with the development of a Knowledge-Based System (KBS) for foundations in expansive soils using a system shell (CONFOUND), designed for teaching undergraduates about foundation engineering at Durham university, coupled with on-line-help file developed using Microsoft Help Author for Word 6.0.The system contains three phases for classification of swelling potential, heave prediction of the expansive soil layer and the provision of foundation design alternatives in expansive soils.Evaluation of the KBS was carried out in two steps: • Verification through the test mode, which is built in the CONFOUND shell. The system was tested during the development process to ensure right syntax. • Validation, which was carried out through the application of six case studies. The system gave acceptable recommendations for the three phases of the KBS.
Relationship Management: Secure Collaboration in a Ubiquitous Environment
Authors: Edward C. Epp
Venue: IEEE Pervasive Computing (2003)

Intel recently conducted an experiment focusing on local identity management. Developers created an application that ran on desktops, laptops, and PDAs in which groups of people could securely share documents, text messages, and other electronic media. This application's heart is Relationship Management, a middleware component that supports ad hoc persistent group formation, end-to-end security, and client-based identity management with network independence.
An Approach to Testing COTS Software for Robustness to Operating System Exceptions and Errors
Authors: Anup K. Ghosh, Matthew Schmid
Venue: Proceedings of the 10th International Symposium on Software Reliability Engineering (1999)

One of the least tested but most critical portions of software systems is error and exception handling. Error/exception handling routines are the safety net for any system to handle unexpected circumstances such as when operating system (OS) or hardware failures occur. As more critical systems are developed from commercial off the shelf (COTS) software, the robustness of these applications to operating system failures, and in general, to failures from third party software, becomes increasingly critical. In this paper, we present an approach and tool for assessing the robustness of COTS applications to failures from OS functions or other third-party COTS software. The approach consists of wrapping executable application software with an instrumentation layer that can capture, record, perturb, and question all interactions with the operating system. The wrapper is used to return error codes and exceptions from calls to operating system functions. The effect of the failure from the OS call is then assessed. If the application crashes under these anomalous conditions, the application is determined to be non-robust to a particular failing OS call. A failure simulation tool has been developed for testing the robustness of Win32 applications to these types of anomalous OS conditions.
A Preliminary Investigation into Dynamic Distributed Workflow
Authors: Daniel M. Zimmerman
Venue:  (1998)

In this thesis, we describe the concept of dynamic distributed workflow. We briefly discuss three possible approaches to the construction of a system to support dynamic distributed workflow, and identify theoretical questions which arise when considering the operation of such a system. We also present UberNet, a Java-based system which implements inter-object communication as a limited form of dynamic distributed workflow. This system, which provides extremely powerful communication capabilities to distributed Java objects, serves both as a proof of concept for dynamic distributed workflow and as a starting point for the future implementation of more complex dynamic distributed workflow systems.
Efficent Algorithmic Learning of the Structure of Permutation Groups by Examples
Authors: Salman Azhar
Venue:  (1989)

This paper discusses learning algorithms for ascertaining membership, inclusion and equality in permutation groups. The main results are randomized {\em learning algorithms} which take a random generator set of a fixed group $G \leq S_n$ as input. We will discuss randomized algorithms for learning the concepts of group membership, inclusion, and equality by representing the group in terms of its strong sequence of generators using random examples from $G$. We present $0(n^3 log~n)$ time sequential learning algorithms for testing membership, inclusion and equality. The running time is expressed as a function of the size of the object set. $(G \leq S_n$ can have as many as $n!$ elements.) Our bounds hold for all input groups. We also introduce limited parallelism, and our lower processor bounds make our algorithms more practical. Finally, we show that learning 2-groups is in class NC by reducing the membership, inclusion, and inequality problems to solving linear systems over $GF$(2). We present an $0(log^3n)$ time learning algorithm using $n ^{log_2 7}$ processors for learning 2-groups from examples.
Typed Output and Programming in the Interface
Authors: Francesmary Modugno, Brad A. Myers
Venue:  (1993)

A visual shell, (e.g., Apple Macintosh), is a direct manipulation interface to an operating system. Although such shells are easier to use than Unix, they have limitations: they are not programmable; the output of utilities can not be directly input to other utilities; and they lack the functionality of utilities such as `awk''. PURSUIT is a visual shell that introduces a novel interface model, typed utility output, to address some of these limitations. In PURSUIT, all objects are typed. A typed object is an iconic representation of an object in the system, such as a file, user id, network address, etc., that users can manipulate in the traditional direct manipulation way. Because all objects in PURSUIT are typed, all utility output is typed. By selecting part of the output of one utility and using it as input to another utility, users can create straight-line programs (i.e., Unix pipes) directly in the interface. By manipulating the contents of a typed output window, users can access the common functionality of utilities, such as column selection in `awk'', without knowing any special utility names and flags. PURSUIT thus provides users with programming abilities, the common functionality of utilities, and the functionality of pipes directly in the interface without requiring them to learn obscure programming languages, commands or interaction techniques.
Analysis, approximations and admission control of a multi-service multiplexing system with priorities
Authors: A. Elwalid, D. Mitra
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2 (1995)

We consider an ATM system with an architecture which is designed to accommodate users with very different quality of service requirements. Sources which belong to a high priority class share a FCFS buffer, which has priority access to the trunk. A low priority class of sources have a separate FCFS buffer, which receives the residual bandwidth, if any. By administering admission control the service guarantees for both classes may be satisfied. The sources are bursty and stochastic fluid models are used to handle burst-scale congestion effects. We develop simple, fast and robust analytic approximations for the queue distributions in the two buffers. We calculate the admissible set by using our analytic approximations and find that it is reasonably accurate and a conservative approximation to the correct set. The key element in our analysis is a characterization of the output of the high priority buffer as another Markov-modulated fluid source. A refinement to the now well known effective bandwidth approximation is used to calculate buffer content distributions.
A recognition and parsing algorithm for arbitrary conjunctive grammars
Authors: Alexander Okhotin
Venue: Theoretical Computer Science (2003)

Conjunctive grammars are basically context-free grammars with an explicit set intersection operation added to the formalism of rules. This paper presents a cubic-time recognition and parsing algorithm for this family of grammars, which is applicable to an arbitrary conjunctive grammar without any initial transformations.The algorithm is in fact an extension of the context-free recognition and parsing algorithm due to Graham, Harrison and Ruzzo, and it retains the cubic time complexity of its prototype. It is shown that for the case of linear conjunctive grammars this algorithm can be modified to work in quadratic time and use linear space.The given algorithm is then applied to solve the membership problem for conjunctive grammars in polynomial time, and subsequently to prove the problem's P-completeness, as well as P-completeness of the membership problem for linear conjunctive grammars.
A necessary and sufficient condition for Lukasiewicz logic functions
Authors: N. Takagi, K. Nakashima, M. Mukaidono
Venue: Proceedings of the 26th International Symposium on Multiple-Valued Logic (1996)

The literal, TSUM, min and max operations employed in multiple-valued logic design can be expressed in terms of the implication and the negation of Lukasiewicz logic. We can easily show that the set of multiple-valued functions composed of the above four operations and the negation is equivalent to the set of all multiple-valued functions composed of the Lukasiewicz implication and the negation. This implies that from the viewpoint of the multiple-valued logic design, Lukasiewicz multiple-valued logic is a fundamental system. In this paper, we clarify a necessary and sufficient condition for a multiple-valued function to be a Lukasiewicz logic function, which is defined as a function in terms of the Lukasiewicz implication and the negation.
Physically-Based Combinations of Views: Representing Rigid and Nonrigid Motion
Authors: S. Sclaroff, A. P. Pentland
Venue:  (1994)

Abstract Nonrigid motion can be described as morphing or blending between extremal shapes, e.g., heart motion can be described as transitioning between the systole and diastole states. Using physically-based modeling techniques, shape similarity can be measured in terms of forces and strain. This provides a physically-based coordinate system in which motion is characterized in terms of physical similarity to a set of extremal shapes. Having such a low-dimensional characterization of nonrigid motion allows for the recognition and the comparison of different types of nonrigid motion.
Exploiting fast hardware floating point in high precision computation
Authors: Keith O. Geddes, Wei Wei Zheng
Venue: Proceedings of the 2003 international symposium on Symbolic and algebraic computation (2003)

We apply an iterative refinement method based on a linear Newton iteration to solve a particular group of high precision computation problems. The method generates an initial solution at hardware floating point precision using a traditional method and then repeatedly refines this solution to higher precision, exploiting hardware floating point computation in each iteration. This is in contrast to direct solution of the high precision problem completely in software floating point. Theoretical cost analysis, as well as experimental evidence, shows a significant reduction in computational cost is achieved by the iterative refinement method on this group of problems.
A Fast Parallel Implementation of the Wavelet Packet Best Basis Algorithm on the MP-2 for Real-Time MRI
Authors: Sumit Chawla, Dennis M. Healy
Venue:  (1996)

This technical report is equivalent to technical report PCS-TR96-271, issued in October 1996.
Automatic Handwriting Recognition and Writer Matching on Anthrax-Related Handwritten Mail
Authors: Sargur N. Srihari, Sangjik Lee
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

A handwriting recognition technique and a handwriting identification technique were combined and applied on anthrax-related handwritten mail. HWAI (Handwritten AddressInterpretation) system interprets the address on the anthrax-related letters. The HWAI process can be modified to provide specific alphabet images which can then be used for writer identification. Micro-level feature values from segmented characters were extracted and an identification test was conducted. Preliminary results based on automatic handwriting recognition and identification are shown.
Brown''s Method and Some Generalizations, With Applications to Minimization Problems
Authors: David M. Gay
Venue:  (1975)

Newton''s method attempts to find a zero of $f \in C^{1}(IR^{n})$ by taking a step which is intended to make all components of $f$ vanish at once. In this respect Newton''s method processes the components of $f$ in parallel. Contrasting to this, Brown''s method and the generalizations thereof considered in this thesis process the components of $f$ serially, one after another. One major iteration of these methods may be described as follows: given the starting point (i.e. current major iterate) $y_{0}$, linearize the first component $f_{1}$ of $f$ at $y_{0}$ and find a point $y_{1}$ in the $n-1$ dimensional hyperplane $H_{1}$ on which this linearization vanishes; in general, having found a point $y_{k} (1 \leq k > n)$ in the $n-k$ dimensional hyperplane $H_{k}$ on which the heretofore constructed linearizations vanish, restrict $f_{k+1}$ to $H_{k}$, linearize this restriction at $y_{k}$, and find a point $y_{k+1}$ in the $n-(k+1)$ dimensional hyperplane $H_{k+1}$ on which this linearization vanishes; stop when $Y_{n}$ has been found and let $y_{n}$ be the next major iterate. When $f$ is a general nonlinear function and finite differences are used to construct the linearizations, this approach must do work equivalent to approximating only about half the components of $f''$ and thus requires only about half as many function evaluations per major iteration as the corresponding finite difference Newton''s method, while still enjoying the same rate of local convergence.
Parallel Algorithms for $K_{5}$-minor Free Graphs
Authors: Samir Khuller
Venue:  (1988)

For several problems, restricting attention to special classes of graphs has yielded better algorithms. In particular, restricting to planar graphs yields efficient parallel algorithms for several graph problems. In this paper, we extend these algorithms to $K_{5}$-minor free graphs, showing that the restriction of planarity is not important. The two problems dealt with are: graph coloring and maximal independent sets. We also show that $K_{5}$-minor free graphs are four colorable (this bound is tight). We also give an NC algorithms to recognize $K_{5}$-minor free graphs. 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
The software process and application domains
Authors: A. T. Berztiss
Venue: Proceedings of the 10th International Software Process Workshop (1996)

We introduce a software process model that is intended to facilitate reuse. The reuse potential is provided by a pattern library that supplies a major part of a system specification. The patterns can be easily adapted to allow the specification of a line of related software products, e.g., information systems for car rental and hotel room "rental".
A Fuzzy Description Logic
Authors: Umberto Straccia
Venue:  (1998)

Description Logics (DLs, for short) allow reasoning about individuals and concepts, i.e. set of individuals with common properties. Typically, DLs are limited to dealing with crisp, well defined concepts. That is, concepts for which the problem whether an individual is an instance of it is a yes/no question. More often than not, the concepts encountered in the real world do not have a precisely defined criteria of membership: we may say that an individual is an instance of a concept only to a certain degree, depending on the individual''s properties. Concepts of this kind are rather vague than precise. As fuzzy logic directly deals with the notion of vagueness and imprecision, it offers an appealing foundation for a generalisation of DLs to vague concepts. In this paper we present a general fuzzy DL, which combines fuzzy logic with DLs. We define its syntax, semantics and present constraint propagation calculi for reasoning in it. TEL:: +39.050.593404 EMAIL:: straccia@iei.pi.cnr.it
Accelerating the Successful Reuse of Problem Solving Knowledge Through the Domain Lifecycle
Authors: Scott Henninger
Venue: Proceedings of the 4th International Conference on Software Reuse (1996)

The inability of software reuse to reach its full potential lies partially in the product-centric way in which we view software development. Methods are needed that help us reason about product families and degrees of support that can be offered for problem domains. This paper uses a "domain lifecycle" to formalize a process in which increasing levels of formality can be provided as a domain matures. The first step in this process is to collect and disseminate project experiences that can accelerate the process of identifying and refining application domains with significant impact in a software development organization. This approach facilitates the reuse of a broad spectrum of knowledge at multiple levels of formality. Based on empirical investigations of a software development organization, a prototype of a case-based organizational memory repository for software development practices is presented and assessed for its impact on reusing software development knowledge.