ppxscal/embedding_network huggingface dataset:
An efficient approximation algorithm for finding a maximum clique using Hopfield network learning
Authors: Rong Long Wang, Zheng Tang, Qi Ping Cao
Venue: Neural Computation (2003)

In this article, we present a solution to the maximum clique problem using a gradient-ascent learning algorithm of the Hopfield neural network. This method provides a near-optimum parallel algorithm for finding a maximum clique. To do this, we use the Hopfield neural network to generate a near-maximum clique and then modify weights in a gradient-ascent direction to allow the network to escape from the state of near-maximum clique to maximum clique or better. The proposed parallel algorithm is tested on two types of random graphs and some benchmark graphs from the Center for Discrete Mathematics and Theoretical Computer Science (DIMACS). The simulation results show that the proposed learning algorithm can find good solutions in reasonable computation time.
Weakest Preconditions for Progress
Authors: Johan J. Lukkien, Jan L. A. Van de Snepscheut
Venue:  (1991)

Predicate transformers that map the postcondition and all intermediate conditions of a command to a precondition are introduced. They can be used to specify certain progress properties of sequential programs.
Using Stochastic Intervals to Predict Application Behavior on Contended Resources
Authors: Jennifer M. Schopf, Francine Berman
Venue: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (1999)

Current distributed parallel platforms can provide the resources required to execute a scientific application efficiently. However, when these platforms are shared by multiple users, performance prediction becomes increasingly difficult due to the dynamic behavior of the system.This paper addresses the use of stochastic values, represented by intervals, to parameterize performance models. We describe a method for using upper and lower bound information to parameterize application prediction models in order to make better predictions about the application's behavior in a contentious environment. We demonstrate this technique for a set of 3 applications under different workloads on a production network of workstations.
Composing Specifications in VSPEC
Authors: Arun Venkataraman, Murali Rangarajan, Perry Alexander
Venue: Proceedings of the 3rd IEEE International Conference on Formal Engineering Methods (2000)

As systems become increasingly complex, and existing methodologies become insufficient to handle the complexity, the design community is beginning to look at formal methods for a possible solution. Techniques involving limited use of formal techniques (such as semi-formal methods and equivalence checking) have given a glimpse of what full usage of formal techniques can achieve. For the use of formal methods to be a widely accepted methodology among designers, it must provide the designers with the capabilities of structuring specification in a manner similar to the structuring they are used to using with programming languages. In this paper, we provide a description of the structuring capabilities of VSPEC, a requirement specification language for VHDL. These capabilities include use of multiple pre- and post-condition pairs within a single specification and combination of specifications using common Boolean operators.
Performance Engineering: A Bibliography
Authors: U C Smith
Venue:  (1985)

Performance engineering is a methodology for constructing software systems to meet performance requirements. It begins early in the software life cycle when the requirements and the design are formulated. By modeling and assessing the predicted performance early, one can choose an appropriate functional architecture before significant efforts are invested in an inferior one. Since optimization is performed prior to coding, the maintainability is better (than for code that has been tuned) and the productivity of the development staff is improved (since efforts are not wasted on inferior products.) This bibliography was created to provide practitioners who are interested in applying the performance engineering methodology (PE) with the information they need to do so.
Reducing Mass Degeneracy in SAR by MS by Stable Isotopic Labeling
Authors: Chris Bailey-Kellogg, John J. Kelley, Clifford Stein, Bruce R Donald
Venue:  (2000)

Mass spectrometry (MS) promises to be an invaluable tool for functional genomics, by supporting low-cost, high-throughput experiments. However, large-scale MS faces the potential problem of mass degeneracy -- indistinguishable masses for multiple biopolymer fragments (e.g. from a limited proteolytic digest). This paper studies the tasks of planning and interpreting MS experiments that use selective isotopic labeling, thereby substantially reducing potential mass degeneracy. Our algorithms support an experimental-computational protocol called Structure-Activity Relation by Mass Spectrometry (SAR by MS), for elucidating the function of protein-DNA and protein-protein complexes. SAR by MS enzymatically cleaves a crosslinked complex and analyzes the resulting mass spectrum for mass peaks of hypothesized fragments. Depending on binding mode, some cleavage sites will be shielded; the absence of anticipated peaks implicates corresponding fragments as either part of the interaction region or inaccessible due to conformational change upon binding. Thus different mass spectra provide evidence for different structure-activity relations. We address combinatorial and algorithmic questions in the areas of data analysis (constraining binding mode based on mass signature) and experiment planning (determining an isotopic labeling strategy to reduce mass degeneracy and aid data analysis). We explore the computational complexity of these problems, obtaining upper and lower bounds. We report experimental results from implementations of our algorithms.
Error control of a nonlinear evolution problem related to phase transitions
Authors: Ulisse Stefanelli
Venue:  (1999)

In this paper we study a time discretization with variable time step of a nonlinear evolution problem which describes the behaviour of materials subjected to multi-component phase transitions with dissipation. Existence and uniqueness of solutions to this model have been investigated in [8] by using a time discretization approach. Nevertheless, no error estimates for the discretization error were shown in [8]. Here, the existence of the solution is recovered by passing to the limit in a new variable step time discretization. Then, optimal order a priori error estimates of the discretization error are shown. These estimates depend solely on data and no constraint is imposed between consecutive time steps. EMAIL:: ulisse@dimat.unipv.it KEYWORDS:: Nonlinear evolution problem, phase transitions, time discretization, convergence results, error estimates
A service with bounded degradation in quality-of-service networks
Authors: J. Liebeherr, Dongwei Liao
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 3)-Volume - Volume 3 (1995)

Many network applications that require quality-of-service (QoS) support, such as transmission of digital voice and video, tolerate a certain level of service degradation. In this study, a novel network service, referred to as service with bounded degradation (BD service), is presented that can take advantage of the delay tolerance of applications. Different from previous proposals for similar services, the BD service can guarantee hard lower bounds of the service degradation. This is achieved by strictly limiting the amount of traffic that is subject to service degradation. To implement a BD service, network traffic is partitioned into components with different delay requirements. Policing of the traffic components is achieved by multi-level leaky buckets. A novel scheduler, referred to as EDD-BD (earliest deadline due-bounded degradation) scheduler, performs switching of packets. Properties of the EDD-BD scheduler are presented and analyzed.
Communication Behavior of Linear Arrays of Processes
Authors: Tak K. Lee
Venue:  (1988)

This paper investigates the communication behavior of a linear array of processes, each process implementing the same program. For programs with cyclic communication patterns, simple criteria for determining whether they induce constant response time on the array are established. Also, an algorithm is developed for characterizing programs with more general communication patterns. 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
Computation of the distribution of accumulated reward with Fluid Stochastic Petri-Nets
Authors: G. Horton
Venue: Proceedings of the 2nd International Computer Performance and Dependability Symposium (IPDS '96) (1996)

We describe the recently introduced Fluid Stochastic Petri-Nets as a means of computing the distribution of the accumulated rate reward in a GSPN. In practice, it is the expected value of a reward which is computed, a quantity which is dependent solely on the solution of the underlying Markov chain. Until now, the instantaneous reward rates have been a function of the GSPN marking only, and the Markov chain itself was not influenced by the development of the reward value. In this paper it is shown that FSPNs may be used to simulate GSPN reward models and that they allow an important generalization in that both the firing rates of the GSPN and the reward rate may depend on the current reward value. Example models of repairable systems are used to demonstrate the additional capabilities.
Selection: 524,288 ways to say "this is interesting"
Authors: G. J. Wills
Venue: Proceedings of the 1996 IEEE Symposium on Information Visualization (INFOVIS '96) (1996)

Visualization is a critical technology for understanding complex, data-rich systems. Effective visualizations make important features of the data immediately recognizable and enable the user to discover interesting and useful results by highlighting patterns. A key element of such systems is the ability to interact with displays of data by selecting a subset for further investigation. This operation is needed for use in linked-views systems and in drill-down analysis. It is a common manipulation in many other systems. It is as ubiquitous as selecting icons in a desktop GUI. It is therefore surprising to note that little research has been done on how selection can be implemented. This paper addresses this omission, presenting a taxonomy for selection mechanisms and discussing the interactions between branches of the taxonomy. Our suggestion of 524,288 possible systems [2/sup 16/ operation systems/spl times/2 (memory/memoryless)/spl times/2 (data-dependent/independent)/spl times/2 (brush/lasso)] is more in fun than serious, as within the taxonomy there are many different choices that can be made. This framework is the result of considering both the current state of the art and historical antecedents.
Digital Field Fragment Classification and Object Clusterization Using the Fast Search Method
Authors: S. N. Ganebnikh, M. M. Lange, S. Yu. Kamenev, B. V. Kryzhanovsky
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

The method of fast classification of digital field fragments and clusterization of analogous objects has been developed using the stack algorithm of the information transmission theory. The algorithm operation speed is studied as a function of the resemblance measure. The computation complexity is evaluated. The method is tried in recognition of planar patterns. It has also been used for processing a two-dimensional digital field comprised of a set of time sequences. The algorithm allows the real-time building of the dictionary tree for a large number of time series and clusterization of input vectors for a particular resemblance measure.
Bayesian Fusion of Color and Texture Segmentations
Authors: Roberto Manduchi
Venue: Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2 (1999)

In many applications one would like to use information from both color and texture features in order to segment an image. We propose a novel technique to combine "soft" segmentations computed for two or more features independently. Our algorithm merges models according to a maximum descriptiveness criterion, and allows to choose any number of classes for the final grouping. This technique also allows to improve the quality of supervised classification based on one feature (e.g. color) by merging information from unsupervised segmentation based on another feature (e.g., texture.)
IP Traceback: A New Denial-of-Service Deterrent?
Authors: Hassan Aljifri
Venue: IEEE Security and Privacy (2003)

The increasing frequency of malicious computer attacks has caused severe economic waste and unique social threats. IP traceback- the ability to trace IP packets from source to destination-is a significant step toward identifying and, thus, stopping, attackers.
Special Year on Logic and Algorithms Tutorial Notes: Descriptive Complexity (Tutorial Lectures by Neil Immerman)
Authors: Neil Immerman
Venue:  (1997)

The 1995-1996 DIMACS Special Year on Logic and Algorithms began with three week-long tutorial sessions on the topics of the special year: Finite Model Theory Proof Complexity Computer-Aided Verification These notes on the lectures given by Neil Immerman were compiled by Eric Allender from the notes supplied by A. Arratia, Sandeep K. Shukla, J. Avigad, and D. Sivakumar. 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
A Specification of the Soar Cognitive Architecture in Z
Authors: Brian G. Milnes, Garrett Pelton, Robert Doorenbos, Mike H Laird, Paul Rosenbloom, Allen Newell
Venue:  (1992)

A formal specification of the sixth revision of the Soar architecture in the Z notation was constructed to elucidate and clarify the definition of Soar and to guide its implementation. Soar is a cognitive architecture that has been successfully applied to many domains and has been proposed as an exemplar unified theory of cognition. Z is a model theoretic specification language based in set theory that has syntax and type checking programs available. The specification has a complete coverage of the architecture, a low level of abstraction and a considerable implementation bias.
UML Bible, 1 edition
Authors: Tom Pender
Venue:  (2003)

:UML is an industry standard specification for modeling, visualizing, and documenting software projects. The UML Bible is the most comprehensive UML book available. It is the only book to cover all aspects of the UML including the use of the UML, diagramming notation, the object constraint language (OCL), and profiles all in the same book.
A Case Study of Applying an Eclectic Approach to Identify Objects in Code
Authors: G. Canfora, A. Cimitile, A. de Lucia, G. A. Di Lucca
Venue: Proceedings of the 7th International Workshop on Program Comprehension (1999)

The identification of objects in procedural programs has long been recognised as a key to successful comprehension. As a consequence, several authors have proposed methods and tools that achieve, in general, some level of success, but do not always precisely identify a coherent set of objects. We show that using an eclectic approach, where a domain expert software engineer is encouraged to tailor and combine existing approaches, may overcome the limitation of the single approaches and helps to better address the particular goals of the project at hand and the unique aspects of the subject system. The eclectic approach is illustrated by reporting experiences from a case study of identifying coarse-grained, persistent objects to be used in the migration of a COBOL system to a distributed component system.
/spl mu/-kernels must and can be small
Authors: J. Liedtke
Venue: Proceedings of the 5th International Workshop on Object Orientation in Operating Systems (IWOOOS '96) (1996)

For general acceptance, /spl mu/-kernels must be fast and not burden applications. For fulfilling these conditions, cache architectures require /spl mu/-kernels to be small. The L4 /spl mu/-kernel shows that smallness can be achieved.
The User's View Level of the GOQL Graphical Query Language
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

The paper addresses issues related to the design of a graphical query mechanism that can act as an interface to any Object-Oriented Data Base System (OODBS), in general, and the Object Model of ODMG 2.0, in particular. In the paper, a brief literature survey of related work is given, and an analysis methodology that allows the evaluation of such languages is proposed. Moreover, the User?s View level of a new graphical query language, namely GOQL (Graphical Object Query Language), for ODMG 2.0 is presented. The User?s View level provides a graphical schema that does not contain any of the perplexing details of an object-oriented database schema, and it also provides a foundation for a graphical interface that can supports ad-hoc queries for object-oriented database applications. Herein we illustrate, using an example, the User?s View level of GOQL.
The Type Theory of PL/CV3
Authors: Robert L. Constable, Daniel R. Zlatin
Venue:  (1981)

The programming logic PL/CV3 is based on the notion of a mathematical type. We present the core of the type theory, from which the full theory for program verification and specification can be derived. Whereas the full theory was designed to be useable, the core theory was selected to be analyzable. This presentation strives to be succinct yet thorough. The last section consists of examples, but the approach here is not tutorial. Key Words and phrases: automated logic, program verification, program specification, semantics of programming languages, type theory, foundations of mathematics.
MCSE Windows XP Professional Exam Cram 2 (Exam 70-270), 2 edition
Authors: Dan Balter, Derek Melber
Venue:  (2002)

:This is the perfect study guide to help you pass the first exam in Microsoft's four core OS exams - Installing, Configuring, and Administering Microsoft Windows XP Professional (Exam 70-270). With this book, you can master the skills and concepts necessary to address exam objectives including planning, installation, configuration, administration, support, security, and troubleshooting of Windows XP Professional. It teaches how to analyze Microsoft's trick questions and distracters by providing practice exam questions arranged in a format similar to the actual exam. This book is not intended to teach new material. Instead it assumes that you have a solid foundation of knowledge but can use a refresher on important concepts as well as a guide to exam topics and objectives. This book focuses exactly on what you need to get past the exam - it features test-taking strategies, time-saving study tips, and a special Cram Sheet that includes tips, acronyms, and memory joggers not available anywhere else.The accompanying CD features PrepLogic™ Practice Tests, Preview Edition. This product includes one complete PrepLogic Practice Test with approximately the same number of questions found on the actual vendor exam. Each question contains full, detailed explanations of the correct and incorrect answers. The engine offers two study modes, Practice Test and Flash Review, full exam customization, and a detailed score report.
A stochastic evolutionary neuron migration process with emerged Hebbian dynamics
Authors: Janne Haverinen, Juha Röning
Venue: Proceedings of the eighth international conference on Artificial life (2002)

In this paper, we propose a phenomenological developmental model based on a stochastic evolutionary neuron migration process (SENMP). Employing a spatial encoding scheme with lateral interaction of neurons for artificial neural networks representing candidate solutions within a neural network ensemble, neurons of the ensemble form problem-specific geometrical structures as they migrate under selective pressure. The SENMP is applied to evolve purposeful behaviors for autonomous robots and to gain new insights into the development, adaptation and plasticity in artificial neural networks. We demonstrate the feasibility and advantages of the approach by evolving a robust navigation behavior for a mobile robot. We also present some preliminary results regarding the behavior of the adapting neural network ensemble and, particularly, a phenomenon exhibiting Hebbian dynamics.
Quadratic Programming with M-Matrices
Authors: Franklin T. Luk, Marcello Pagano
Venue:  (1979)

In this paper, we study the problem of quadratic programming with M-matrices. We describe (1) an effective algorithm for the case where the variables are subject to a lower bound constraint, and (2) an analogous algorithm for the case where the variables are subject to lower and upper bounds constraints. We demonstrate the special monotone behavior of the iterate and gradient vectors. The result on the gradient vector is new. It leads us to consider a simple updating procedure which preserves the monotonicity of both vectors. The procedure uses the fact that an M-matrix has a non-negative inverse. Two new algorithms are then constructed by incorporating this updating procedure into the two given algorithms. We give numerical examples which show that the new methods can be more efficient than the original ones.
On the Complexity of Sparse Gaussian Elimination Via Bordering
Authors: E R Bank, J D Rose
Venue:  (1989)

We analyze the complexity of a general sparse Gaussian elimination algorithm based on the bordering algorithm. It has been shown that this procedure requires less integer overhead storage than more traditional general sparse procedures, but the complexity of the nonnumerical overhead calculations was not clear. Here we show the nonnumerical complexity of the original procedure was comparable to the numerical complexity for an $n$ x $n$ grid graph, and we present an enhancement of the procedure which can reduce the overhead.
Submicron Systems Architecture Project: Semiannual Technical Report
Authors: Charles L. Seitz
Venue:  (1989)

No abstract available.
A Method for Block Ordering of Sparse Matrices
Authors: James O''Neil, B D Szyld
Venue:  (1989)

Block iterative methods used for the solution of linear systems of algebraic equations can perform better when the diagonal blocks of the corresponding matrix are carefully chosen. We present a method based on combinational considerations which permutes the rows and columns of a general matrix in such a way that relatively dense blocks of various sizes appear along the diagonal. The method is particularly useful when no natural partitioning of the matrix is available. Two parameters govern the method which is $O(n+ \nu )$ in time and space, where $n$ is the order of the matrix and $\nu$ is the number of nonzeros in the matrix. Numerical test results are presented which illustrate the performance of both the ordering algorithm and the block iterative methods with the resulting orderings.