ppxscal/embedding_network huggingface dataset:
A Methodology for Test Selection
Authors: John A. N. Lee, Xudong He
Venue:  (1988)

Software creation requires not only testing during the development cycle by the development staff, but also independent testing following the completion of the implementation. However in the latter case, the amount of testing that can be carried out is often limited by time and resources. At the very most, independent testing can be expected to provide 100% test coverage of the test requirements (or specifications) associated with the software element with the minimum of effort. This paper describes a methodology employing integer programming by which the amount of testing required to provide the maximum possible test coverage of the test requirements (for the given test set) is assured while at the same time minimizing the total number of tests to be included in a test suite. A collateral procedure provides recommendations on which tests might be eliminated if less than 100% test coverage of the test requirements is permitted. This latter procedure will be useful in determining the risk of not running the minimum set of tests for 100% test coverage. A third process selects from the test matrix the set of tests to be applied to the system following maintenance modification of any test requirements-- that is, to provide a submatrix for regression testing. The potential benefits for applying the integer programming technique in test data selection is also discussed.
Reducing Model Checking of the Many to the Few
Authors: E. A Emerson, Vineet Kahlon
Venue:  (2000)

Systems with an arbitrary number of homogeneous processes occur in many applications. The Parametrized Model Checking Problem (PMCP) is to determine whether a temporal property is true for every size instance of the system. Unfortunately, it is undecidable in general. We are able to establish, nonetheless, decidability of the PMCP in quite a broad framework. We consider asynchronous systems comprised of an arbitrary number n of homogeneous copies of a generic process template. The process template is represented as a synchronization skeleton while correctness properties are expressed using Indexed CTL*nX. We reduce model checking for systems of arbitrary size n to model checking for systems of size (up to) a small cutoff size c. This establishes decidability of PMCP as it is only necessary to model check a finite number of relatively small systems. Efficient decidability can be obtained in some cases. The results generalize to systems comprised of multiple heterogeneous classes of processes, where each class is instantiated by many homogeneous copies of the class template (e.g., m readers and n writers).
Limitations of Back Propagation Artificial Neural Nets
Authors: Mike Alder, Sok G Lim, Yianni Attikiouzel
Venue:  (1990)

This paper considers some of the limitations of Back- Propagation neural nets. We show that the Feed-Forward three layered Neural nets of Rumelhart, Hinton and Williams are equivalent to committees of TLU''s in the sense of Nilsson. We also show that the generalised delta rule may be formulated in terms of committees of threshold logic units. This allows us to deduce that the Feed forward Layered nets are unlikely to behave well with data sets that are not of low complexity. We make the notion of the complexity two, the XOR data set has complexity three. It is argued that the only successful applications of neural nets have been to problems which are in a certain sense ''trivial'', and that this is likely to be the case in general. Finally we produce some depressing estimates of the processing capabilities of real brains.
Local Area Networks and the Dynamic Hierarchy: A Tutorial
Authors: Emory J Derrick, Richard E. Nance
Venue:  (1986)

The technology of the 197O''s and 80''s has introduced electronics equipment with capabilities that were not considered possible only a few short years ago. The impact has been widespread, providing innovations in business, professional, military, and government applications with considerable political, economic, and social ramifications. With the rapid increase in capabilities has come a corresponding growth in the need to better manage these high-tech resources in order to realize their potential. A primary key to achieving this end is the cost effective, rapid, and reliable processing of information through networking.
Maya: A Simulation Platform for Parallel Architectures and Distributed Shared Memories
Authors: Divyakant Agrawal, Manhoi Choy, Hong V Leong, Ambuj K. Singh
Venue:  (1994)

Maya is a simulation platform for evaluating the performance of parallel programs on parallel architectures with different memory coherence protocols. It uses the communication library PVM to ensure portability. Rapid prototyping of different memory protocols of varying degrees of coherence is possible and the impact of these protocols on the performance of application programs can be studied. We describe the design of Maya and the simulation mechanism briefly. Some of the performance results on architectural simulation with different memory coherence protocols are presented. Parallel discrete event simulation techniques are adopted for the execution-driven simulation of parallel architectures.
MAPbox: Using Parameterized Behavior Classes to Confine Applications
Authors: A. Acharya, M. Raje
Venue:  (1999)

Designing a suitable mechanism to confine commonly used applications is challenging as such a mechanism needs to satisfy conflicting requirements. The trade-off is between configurability and ease of use. In this paper, we present the design, implementation and evaluation of MAPbox, a general-purpose confinement mechanism that retains the ease of use of specialized sandboxes such as Janus and SBOX while providing significantly more configurability. The key idea is to group application behaviors into classes based on the expected functionality and the resources required to achieve that functionality. Classification of behaviors provides a set of behavior labels (class names) that can be used to concisely communicate the expected functionality of programs between the provider and the users. This is similar to the MIME-types used to concisely describe the expected format of data files. Classification of application behaviors also allows class-specific sandboxes to be built and instantiated for each behavior class. We present a study of the behavior and resource requirements of a set of commonly used applications and use the results of this study to define a set of application behavior classes. We also evaluate how effective this technique is in confining a variety of commonly used applications and how much overhead it introduces.
Hurwitz Interconnect Delay Evaluation - HIDE: User''s Manual
Authors: Xiao Yang, Zhanhai Qin, Chung Cheng
Venue:  (2000)

This is a user''s manual of HIDE, an efficient RC Interconnect Delay Evaluation package. The program features: Delay evaluation using a user-defined delay threshold; Rise time evaluation between given start and end delay threshold; Waveform evaluation; Equivalent load generation; Hspice netlist generation for verification; Moment generation.
DESIGN CHOICES FOR WEAK-CONSISTENCY GROUP COMMUNICATION
Authors: Richard A. Golding, Darrell D. E. Long
Venue:  (1992)

Many wide-area distributed applications can be implemented using distributed group communication, a mechanism for coordinating the activities of related processes running at different sites. We have developed a modular architecture for group communication systems that can be used to build a system tailored to application requirements. We focus on *weak consistency* mechanisms for group communication, since these allow highly efficient operation on wide-area internetworks. We examine several design choices that can be made in building a weakly-consistent group communication mechanism, and discuss the decisions we made in building two very different wide-area applications. The architecture accommodates both systems well, and allows several application-specific decisions that increase efficiency and flexibility.
Uniform Antimatroid Closure Spaces
Authors: Pfaltz John L., Karro John E.
Venue:  (1998)

Often the structure of discrete sets can be described in terms of a closure operator. When each closed set has a unique minimal generating set (as in convex geometries in which the extreme points of a convex set generate the closed set), we have an antimatroid closure space. In this paper, we show there exist antimatroid closure spaces of any size, of which convex geometries are only a sub-family, all of whose closed sets are generated by precisely the same number of points. We call them uniform closure spaces.
Termination and Output Measure Generation in Optimistic and Conservative-Synchronous Parallel Simulations
Authors: Marc Abrams, Vasant Sanjeevan, Debra S. Richardson
Venue:  (1992)

This paper proposes algorithms to stop parallel discrete event simulations using arbitrary termination conditions and to collect output measures. We show that the time complexity of termination can be higher than that of the underlying simulation; therefore termination can reduce or even preclude speed-up. We propose simulation protocol independent algorithms solving the termination and generation problems. Implementations of the algorithms for conservative-synchronous and optimistic protocols are presented. The predicted and measured increase in real time required to execute a time warp and a bounded lag simulation equipped with our termination algorithms is presented. The chief conclusion is that when the time required for each evaluation of the termination condition exceeds the mean time to execute an event, termination can dominate the simulation running time.
Suitability of Optimization Packages for an MDO Environment
Authors: Haim D., Giunta A.A., Holzwarth M.M., Mason W.H., Watson L.T., Haftka R.T.
Venue:  (1996)

An examination of the performance of several optimization packages and their suitability for inclusion in a realistic multidisciplinary design optimization (MDO) environment is conducted. The packages are incorporated into a High-Speed Civil Transport (HSCT) aircraft design code and are used with both a response surface (RS) model and a more detailed, noisy model. While most packages converge to similar designs, there are large variations in CPU times and usability. Results are reported for a SGI workstation.
On the Complexity of Verifying Concurrent Transition Systems
Authors: D. Harel, O. Kupferman, M. Y. Vardi
Venue:  (1997)

Model-checking methods suffer from the state explosion problem : In a concurrent setting, the program under consideration is typically the parallel composition of many processes, and traversing the exceedingly large state space introduced by the parallel composition cannot be avoided. Another fruitful verification methodology is implementation-specification verification . Here, we check that an implementation is correct with respect to a specification by checking whether the behaviors of a transition system that models the program''s implementation correlate with the behaviors of a transition system that models its specification. In this paper we investigate the effect of concurrency on the complexity of implementation-specification verification. We consider trace-based and tree-based approaches to the verification of concurrent transition systems, with and without fairness. Our results show that in almost all cases the complexity of the problem is exponentially harder than that of the non-concurrent case. Thus, in this methodology too, the state-explosion problem cannot be avoided.
A Computationally Intractable Problem on Simplicial Complexes
Authors: Omer Egecioglu, Teofilo Gonzalez
Venue:  (1993)

We analyze the problem of computing the minimum number er(C) of internal simplexes that need to be removed from a simplicial 2-complex C so that the remaining complex can be nulled by deleting a sequence of external simplexes. This is equivalent to requiring that the resulting complex be collapsible to a 1-complex. By reducing a restricted version of SAT, we show that this problem is NP-complete and therefore computationally intractable. This implies that there is no simple formula for er(C) terms of the Betti numbers of the complex. The problem remains NP-complete for higher dimensional complexes, but can be solved in polynomial time for graphs.
Boundedness of Automorphic L-Functions in Vertical Strips
Authors: S. Gelbart, F. Shahidi
Venue:  (1999)

The purpose of this paper is to prove the boundedness in vertical strips of finite width for all the L-functions that appear in constant terms of Eisenstein series, under a certain natural assumption on local normalized intertwining operators. As a corollary, we prove the boundedness for a number of important L-functions, among them the symmetic cube and triple product L-functions attached to cusp forms on GL(2), as well as several Rankin-Selberg product L-functions, where the local assumption was alredy proved to be valid in each case. Under the same assumption, the finiteness of poles on all of C for all of these L-functions is also proved, a necessary step in the proof of boundedness in vertical strips.
An immunogenetic approach in chemical spectrum recognition
Authors: Yuehua Cao, Dipankar Dasgupta
Venue: Advances in evolutionary computing: theory and applications (2003)

This chapter describes an immunogenetic approach to recognize spectra for chemical analysis. In particular, an immunological model for chemical reactions is described in which a population of specialists for each of the possible products is evolved using a genetic algorithm. Accordingly, a small well-trained specialist library is established for testing their pattern recognition ability. The model was experimented with several real-world datasets to identify components in chemical spectra (such as IR spectra and Raman spectra). Experimental results exhibit the performance of the approach in finding correct products that correspond to an input spectrum, specifically, for a composite spectrum in which there are multiple products physically mixed. It would be very difficult to interpret otherwise.
The Effect of Knowledge on Belief: Conditioning, Specificity and the Lottery Paradox in Default Reasoning
Authors: David Poole
Venue:  (1990)

How should what one knows about an individual affect default conclusions about that individual? This paper contrasts two views of ``knowledge'''' in default reasoning systems. The first is the traditional view that one knows just what is in one''s knowledge base. It is shown how, under this interpretation, having to know an exception is too strong for default reasoning. It is argued that we need to distinguish ``background'''' and ``contingent'''' knowledge in order to be able to handle specificity, and that this is a natural distinction. The second view of knowledge is what is contingently known about the world under consideration. Using this view of knowledge, a notion of conditioning that seems like a minimal property of a default is defined. Finally, a qualitative version of the lottery paradox is given; if we want to be able to say that individuals that are typical in every respect do not exist, we should not expect to conclude the conjunction of our default conclusions. \n This paper expands on work in the proceedings of the First International Conference on Principles of Knowledge Representation and Reasoning [35].
Strategies for Parallelizing PDE Software
Authors: Calvin J. Ribbens, George G. Pitts
Venue:  (1992)

Three strategies for parallelizing components of the mathematical software package ELLPACK are considered: an explicit approach using compiler directives available only on the target machine, an automatic approach using an optimizing and parallelizing precompiler, and a two-level approach based on extensive use of a set of low level computational kernels. Each approach to parallelization is described in detail, along with a discussion of the effort involved. In connection with the third strategy, a set of computational kernels useful for PDE solving is proposed. We describe our experience in parallelizing six problem solving components of ELLPACK using each of the three strategies and give performance results for a shared memory multiprocessor. Our results suggest that the two-level strategy allows the best balance among programmer effort, portability, and parallel performance.
How informatics can solve methodological gap in e-business modeling
Authors: Masao J. Matsumoto
Venue: Enterprise information systems IV (2003)

e-business architecture modeling method is needed in many of industrial sectors either on their stand-alone or interrelated basis. However, most of the methods do not provide seamless support for business and technical aspects of e-business architecture modeling. This paper points out several non-trivial problems that e-business modelers are currently encountering. This also presents some come-up from the Interprise Modeling research project touching on VPI method that is featured as a seamless support for value-centric e-business architecture modeling.
HANA: A Model of Type and Inheritance for Object-Oriented ProgrammingLanguages
Authors: Keung H Lee, Dennis G. Kafura
Venue:  (1990)

Most current object-oriented languages consider inheritance as subtyping. However, a type system which views inheritance as subtyping allows neither multiple representations of a type nor method exclusion without violating typing constraints. These problems and the difference between inheritance and subtyping have been well recognized recently. Another approach to subtyping found in the literature is to separate inheritance from subtyping. In this approach, subtyping is solely determined by inheritance conformance. While subtyping based on interface conformance can support multiple representations, it cannot distinguish intended conformance from accidental conformance. This paper describes a new model of type and inheritance, called HANA, in which subtyping and inheritance are not separated, although differentiated. The notion of subtyping in HANA is based on both inheritance and interface conformance. HANA integrates multiple inheritance multiple representations, method exclusion, and method name overloading with static typing. HANA extends other existing methods of inheritance and subtyping with enhanced expressive power, increased reusability, and program efficiency. We show that the differentiation made by HANA between inheritance and subtyping allows name collision to be resolved without compromising the integrity of the type system. The capability of excluding an inherited method without violating static typing offers a sound solution for resolving name collision in multiple inheritance when used together with other mechanisms. We show that the mechanisms of method exclusion, addition, and renaming are othogonal with respect to the power of resolving name collision in multiple inheritance.
Rapid Prototyping of Application-Specific Counterflow Pipelines
Authors: Bruce R. Childers, Jack W. Davidson
Venue:  (1999)

Application-specific processor (ASIP) design is a promising approach for meeting the performance and cost goals of an embedded system. We have developed a new microarchitecture for automatically constructing ASIP''s. This new architecture, called a wide counterflow pipeline (WCFP), is based on the counterflow pipeline organization proposed by Sproull, Sutherland, and Molnar. Our ASIP synthesis technique uses software pipelining and design space exploration to generate a custom WCFP and instruction set for an embedded application. This type of architecture synthesis requires an infrastructure for rapidly prototyping ASIP''s to evaluate design trade-offs. This paper presents the requirements and implementation of such an environment for automatic design of WCFP''s. First, we describe a database for specifying design elements and architectural constraints. Second, we present an intermediate representation for WCFP synthesis and reconfigurable simulation. Finally, we describe a fast and reconfigurable simulation methodology for WCFP''s.
Pharos: A Scalable Distributed Architecture for Locating Heterogeneous Information Sources
Authors: R. Dolin, D. Agrawal, L. Dillon, A. E Abbadi
Venue:  (1996)

This paper presents the design of Pharos: a scalable distributed architecture for locating heterogeneous information sources. The system incorporates a hierarchical metadata structure into a multi-level retrieval system. Queries are resolved through an iterative decision-making process. The first step retrieves coarse-grain metadata, about all sources, stored on local, massively replicated, high-level servers. Further steps retrieve more detailed metadata, about a greatly reduced set of sources, stored on remote, sparsely replicated, topic-based mid-level servers. We describe the structure, distribution, and retrieval of the metadata in Pharos to enable users to locate desirable information sources over the Internet.
Evaluation of Logical External Memory Architectures for MultiprocessorSystems
Authors: S. Sivaramakrishnan
Venue:  (1988)

Parallel structuring of External Memory operations has been a relatively unexplored area in Parallel Processing. This thesis effort describes an effective parallel formulation of two I/O-intensive seismic data processing algorithms on a large shared-memory multiprocessor system. Simulation modeling has been used as the vehicle for performance evaluation. Results suggest that applications which are I/O bound in most uniprocessors would probably become more compute-bound in memory-rich environments that are characteristic of large multiprocessor systems.
Enhancing geotechnical education using interactive multimedia simulations
Authors: M. Budhu
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

In this paper, the use of modern information technologies to enhance learning and retention in geotechnical engineering is presented and discussed. Interactive multimedia simulations have been incorporated into selected topics in an undergraduate geotechnical course to improve understanding and knowledge retention. These simulations are integrated into a comprehensive interactive multimedia courseware that also contains interactive problem solving, electronic quizzes, a glossary, notation, a notepad, computer program utilities and virtual laboratories in which students can conduct simulated standard tests and explore other test conditions.
Detection, Representation and Classification of Anomalies in Homogeneous Images
Authors: Paul S Williams, Mike Alder
Venue:  (1996)

This paper examines the problem of detecting anomalies and defects within images of homogeneous textural characteristics. A novel approach is used to extract local information from the image. The feature extraction process obtains correlations between local regions of the image at a defined scale making it adaptable to changes in image sampling and quantisation. Given that the majority of the image is homogeneous, points in the corresponding feature space combine to form one dense cluster. Points close to this cluster are considered background and removed identifying anomalous points for further examination. The feature vectors corresponding to each spatially disjoint anomaly form a defined structure in an N dimensional Euclidean space as determined by the characteristics of the anomaly. We consider it desirable to represent this structure by a number of lower order manifolds embedded in this N dimensional space. A local Karhunen Loeve Transformation is used to model the neighbourhood surrounding each feature vector by a local affine section of some determined dimension. Given sufficient data points and structure these affine sections can be agglomerated into manifolds. Finally we address the topic of classification. This is achieved through the extraction of simple information from these higher level structures which is sufficient to classify the relatively small available data set.