ppxscal/embedding_network huggingface dataset:
How to Formalize It? Formalization Principles for Information System Development Methods
Authors: A. H.M. ter Hofstede
Venue:  (1997)

Although the need for formalisation of modelling techniques is generally recognised, not much literature is devoted to the actual process involved. This is comparable to the situation in mathematics where focus is on proofs but not on the process of proving. This paper tries to accomodate for this lacuna and provides essential principles for the process of formalisation in the context of modelling techniques as well as a number of small but realistic formalisation case studies. 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
Localizer++: An Open Library for local Search
Authors: Laurent Michel, Pascal Van Hentenryck
Venue:  (2001)

Local search is one of the fundamental approaches to tackle large combinatorial optimization problems. Yet relatively little support is available to facilitate the design and implementation of local search algorithms. This paper introduces Localizer++, an extensible object-oriented library for local search. Localizer++ supports both declarative abstractions to describe the neighborhood and high-level search constructs to specify local moves and meta-heuristics. It also supports a variety of features typically found only in modeling languages and its extensibility allows for an easy integration of new, user-defined, abstractions. Of particular interest is the conciseness and readability of Localizer++ statements and the efficiency of the Localizer++ implementation.
The WY Representation for Products of Householder Matrices
Authors: Christian H. Bischof, Charles Van Loan
Venue:  (1985)

A new way to represent products of Householder matrices is given that makes a typical Householder matrix algorithm rich in matrix-matrix multiplication. This is very desirable in that matrix-matrix multiplication is the operation of choice for an increasing number of important high performance computers. We tested the new representation by using it to compute the QR factorization on the FPS-164/MAX. Preliminary results indicate that it is a very efficient way to organize Householder computations.
Multivalued Binary Relations and Post Algebras
Authors: Michel Serfati
Venue: Proceedings of the Twenty Ninth IEEE International Symposium on Multiple-Valued Logic (1999)

This paper deals with a multivalued extension of the concept of a binary relation on a set E. If R is such an r-valued relation on E, for every (x, y) E E2, there exists exactly one i E {O, 1, . . . . r-l} such that the degreeof comparability of (x, y) with respect to R is equal to i. The set of all r-valued relations on E is then equipped with an order relation I and turns out to be a Post algebra of order r. This first part of the paper makes a large use of the results of a previous paper (1999 a). In a second step, we study multivalued product of relations, as well as multivalued reflexivity, symmetry, antisymmetry, and transitivity. It follows for example that, from a multivalued viewpoint, symmetry and antisymmetry turn out to be quite different, since the latter is hereditary while the former is not. We finally investigate some properties of multivalued equivalences, multivalued orders and preorders. 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
Virtual experiments of FSW-fabricated aluminium structural elements
Authors: L. G. Vigh
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

The paper deals with the numerical analyses of an extruded and welded aluminium girder representing the transverse-direction structural behaviour of a recently developed aluminium deck.In order to find the possible finite element modelling ways, virtual experiments investigating the effect of different details are completed. For this, geometrical and material non-linearities are considered. The models are checked by real experiment referred as "pilot test'.Based on the virtual experiments, proposal is given for the numerical modelling, providing models that are applicable for the analysis of the entire deck.
On the design of Always Compatible Instruction Set Architecture(ACISA)
Authors: M. R. Bhujade
Venue: ACM SIGARCH Computer Architecture News (1983)

This note suggests a concept of a new kind of interrupt called GAP to be used in filling gaps in the Architecture of a computing system.
Improving the Robustness of Complementarity Solvers Using Proximal Perturbations
Authors: S. C. Billups
Venue:  (1996)

A common difficulty encountered by many solvers for complementarity problems is convergence to a local (but not global) minimum of an underlying merit function. Such difficulties can be avoided by using a proximal perturbation strategy, which allows the iterates to escape the local minimum in a controlled fashion. This paper presents the proximal perturbation strategy for a general class of complementarity solvers and proves subsequential convergence to a solution based upon a pseudo-monotonicity assumption. An example algorithm is presented, called PROXI, which uses an extremely simple (but not very robust) basic algorithm enhanced by the proximal perturbation strategy. Test results on the MCPLIB and GAMSLIB problem libraries demonstrate that PROXI is not only robust but also computationally efficient.
On the inter-residue correlation patterns and their role in classification of protein families
Authors: Galitsky Boris, Shelepin Sergey
Venue:  (2001)

We build a novel method to calculate and analyze the correlations in mutational behavior between different positions in a multiple sequence alignment. The inter-dependence between the residues for a protein family is represented as a matrix of correlation values obeying the invariance with respect to specific amino acids, the number of sequences representing a family, the length of sequences, residue variability and the uniformity of data set representation. Common and distinguishing properties of the few protein families, including immunoglobulins, are revealed, based on the geometry of correlation matrices. We analyze the specific texture of these matrices, inherent to the specific families, and suggest a way to distinguish proteins from non-protein set of sequences. The role of correlation matrix technique in classification is discussed. We suggest that the classification criteria should be based on the residues at the positions with the highest overall correlation with the other positions. Revealing the positions with various correlation strength helps to reconstruct the phylogeny of protein families.
Two coupled queues with heterogeneous traffic
Authors: Simon C. Borst, Onno J. Boxma, M. J.G. Uitert
Venue:  (2001)

We consider a system with two heterogeneous traffic classes, one having light-tailed characteristics, the other one exhibiting heavy-tailed properties. When both classes are backlogged, the two corresponding queues are each served at a certain nominal rate. However, when one queue empties, the service rate for the other class increases. This dynamic sharing of surplus service capacity is reminiscent of the Generalized Processor Sharing (GPS) discipline. GPS-based scheduling algorithms, such as Weighted Fair Queueing, provide a candidate implementation mechanism for achieving differentiated Quality-of-Service in a DiffServ architecture. \\ We characterize the asymptotic workload behavior of both traffic classes. The tail of the workload distribution of the {\em heavy-tailed\/} class is asymptotically equivalent to that of the heavy-tailed class in isolation -- but with its nominal service rate inflated by the slack capacity of the light-tailed class. For the {\em light-tailed\/} class, we show a sharp dichotomy in the qualitative behavior, depending on whether its load exceeds its nominal service rate or not. In underload scenarios, the tail of its workload distribution is equivalent to that of the light-tailed class in isolation, multiplied with a certain pre-factor. The pre-factor represents the probability that the heavy-tailed class is backlogged long enough for the light-tailed class to build up a large workload. This provides a measure for the extent to which the light-tailed class benefits from sharing surplus capacity with the heavy-tailed class. In contrast, in overload situations, the light-tailed class is adversely affected by the heavy-tailed class, and inherits its traffic characteristics.
Inside Network Perimeter Security: The Definitive Guide to Firewalls, VPNs, Routers, and Intrusion Detection Systems
Authors: Stephen Northcutt, Scott Winters, Karen Frederick, Lenny Zeltser, Ronald W. Ritchey
Venue:  (2002)

:This book is the most practical, comprehensive solution to defending your network perimeter. Get expert insight from the industry's leading voices: Stephen Northcutt and the expertise of the SANS team. Inside Network Perimeter Security is a practical guide to designing, deploying, and maintaining network defenses. It discusses perimeter components, such as firewalls, VPNs, routers, and intrusion detection systems, and it explains how to integrate them into a unified whole to meet real-world business requirements. Learn the best practices of perimeter defense from 17 information security professionals working together as a team of writers and reviewers. Because this book was developed in close coordination with the SANS Institute, it is also a valuable supplementary resource for those pursuing the GIAC Certified Firewall Analyst (GCFW) certification.
Configurable Communication Protocols for Mobile Computing
Authors: Nina T. Bhatti, Richard D. Schlichting
Venue: Proceedings of the The Fourth International Symposium on Autonomous Decentralized Systems (1999)

Mobile computing systems present challenges for message routing, support for disconnected operation, and providing quality of service guarantees related to latency, bandwidth and jitter. While multiple approaches have been developed, existing systems typically support only a small set of solutions in each area. This paper describes the design of a collection of communication protocols that supports multiple solutions within a single integrated framework based on the Coyote system. These protocols are constructed by subdividing the required functionality into orthogonal functions and then implementing variants of these functions as fine-grain software modules called micro-protocols. A customservice is then realized by choosing micro-protocols based on functionality and configuring them together with a standard runtime system that implements an event-oriented execution model.
Confidentiality and Integrity with Untrusted Hosts: Technical Report
Authors: Steve Zdancewic, Andrew C. Myers
Venue:  (2000)

Several security-typed languages have recently been proposed to enforce security properties such as confidentiality or integrity by type checking. We propose a new security-typed language, SPL@, that addresses two important limitations of previous approaches. First, existing languages assume that the underlying execution platform is trusted; this assumption does not scale to distributed computation in which a variety of differently trusted hosts are available to execute programs. Our new approach, secure program partitioning, translates programs written assuming complete trust in a single executing host into programs that execute using a collection of variously trusted hosts to perform computation. As the trust configuration of a distributed system evolves, this translation can be performed as necessary for security. Second, many common program transformations do not work in existing security-typed languages; although they produce equivalent programs, these programs are rejected because of apparent information flows. SPL@ uses a novel mechanism based on ordered linear continuations to permit a richer class of program transformations, including secure program partitioning. This report is the technical companion to [ZM00]. It contains expanded discussion and extensive proofs of both the soundness and noninterference theorems mentioned in Section 3.3 of that work.
Automatic Optimization
Authors: Aiping Liao
Venue:  (1995)

We propose some automatic techniques for unconstrained optimization with the objective function given by some computer program. We show that the Newton step can be calculated in O(m2) operations where m is the number of stages in the function evaluation program. We also show that methods developed in Coleman and Liao [1] and Liao [8] for unconstrained discrete-time optimal control problems can be modified to handle general cases. KEYWORDS: discrete-time optimal control, stagewise Newton''s method, trust region method, automatic differentiation.
Generalizing the LINPACK Condition Estimator
Authors: A. K. Cline, Andrew R. Conn, Charles Van Loan
Venue:  (1981)

Two generalizations of the Cline-Moler-Stewart-Wilkinson "LINPACK" condition estimator are described. One generalization combines the LINPACK notion of "look-ahead" with a new feature called "look-behind" that results in a more flexibly chosen right-hand side. The other generalization is a "divide-and-conquer" scheme that involves estimating the condition of certain principal submatrices whose dimension repeatedly doubles. Both generalizations require that maximization of simple objective functions. When seeking an $L_{1}$ condition estimate, these functions are convex while inthe $L_{2}$ case they are quadratic. All the algorithms considered appear to be at least as reliable as the LINPACK estimator and are equally efficient.
Minimizing Blocking Probability in a Hierarchical Storage-Based VOD Server
Authors: Y. Won, J. Srivastava
Venue: Proceedings of the 1996 International Workshop on Multi-Media Database Management Systems (IW-MMDBMS '96) (1996)

In this paper we investigate the relationship between the blocking probability and the configuration of storage hierarchy in a VOD server. Due to limited system re-sources available in a VOD server, some user requests can not be serviced immediately and are thus blocked. In general, one would expect the increasing the I/O rate will reduce the request blockage. However, we report the interesting observation that increasing the data rate from the secondary storage may increase the blocking probability, and hence degrade the server performance. We provide an analytical model of the blocking probability, which is to be used to find the optimal data rate to minimize the blocking probability for a given system configuration. By enforcing the files to reside at the staging disk for a certain amount of time, it is possible to further improve the blocking probability. We examine the problem of space management for video files on the staging disks, and devise a policy called Enforced Duration to arbitrates the duration of the file on the staging disk. Results of a simulation based performance evaluation are presented.
Generating Language-Based Editors: A Relationally-Attributed Approach
Authors: Susan B. Horwitz
Venue:  (1985)

NO SUPPLIED
Local and Linear Convergence of an Algorithm for Solving A Sparse Minimization Problem
Authors: Earl S. Marwil
Venue:  (1977)

For an unconstrained minimization problem with a sparse Hessian, a symmetric version of Schubert''s update is given which preserves the sparseness structure defined by the Hessian. At each iteration of the algorithm there are two sparse linear systems to be solved. These have the same sparseness structure defined by the Hessian. The differences between succeeding approximations to the Hessian and the Hessian at the solution are related by a careful evaluation of the difference in the Frobenius norm. This relation is used in proving the local and linear convergence of the algorithm. 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
False-name-proof multi-unit auction protocol utilizing greedy allocation based on approximate evaluation values
Authors: Kenji Terada, Makoto Yokoo
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

This paper presents the new false-name-proof multi-unit auction protocol called Greedy ALlocation (GAL) protocol. Although Internet auctions have been growing very rapidly, the possibility of a new type of cheating called false-name bids has been identified. False-name bids are bids made under fictitious names, e.g., multiple e-mail addresses. A protocol called the Iterative Reducing (IR) protocol has been developed for multi-unit auctions and proven to be false-name-proof, i.e., using false-name bids is useless. For Internet auction protocols, being false-name-proof is important since identifying each participant is virtually impossible.One shortcoming of the IR protocol is that it requires the auctioneer to carefully pre-determine a reservation price for one unit. Our newly developed GAL protocol is easier to use than the IR, since the auctioneer does not need to set a reservation price. The results of evaluation show that the GAL protocol obtains a social surplus that is very close to Pareto efficient. Furthermore, the obtained social surplus and seller's revenue are much greater than with the IR protocol even if the reservation price is set optimally.
Towards a Clone Detection Benchmark Suite and Results Archive
Authors: Arun Lakhotia, Junwei Li, Andrew Walenstein, Yun Yang
Venue: Proceedings of the 11th IEEE International Workshop on Program Comprehension (2003)

Source code clones are copies or near-copies of other portions of code, often created by copying and pasting portions of source code. This working session is concerned with building a communal research infrastructure for clone detection. The intention of this working session is to try to build a consensus on how to continue to build a benchmark suite and results archive for clone- and source comparison-related research and development. The working session is structured to foster discussion and debates over what should be collected in the archive, and how best to do it.
On the performance behavior of ATM end-stations
Authors: B. V. Patel, C. C. Bisdikian
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1 (1995)

Shaping of traffic at its source is a prominent congestion control solution in ATM networks. The "leaky bucket" with a "cell spacer" is a very popular traffic shaping approach. By sizing the leaky bucket and spacer parameters, an end-station shapes its traffic to conform to a "good behavior" contract with the network. The leaky bucket delays the transmission of selected number of cells, while the spacer forces a minimum time-distance between transmitted cells. When a contracted transmission rate is close to the traffic generation rate by the end-station, this traffic stream will utilize most of the bandwidth available on its virtual connection. The high utilization of such a connection leads to large queues of frames and cells at the end-station, With high adverse consequences to the end-to-end delay and jitter. In this paper, based on the negotiated traffic parameters and source traffic characteristics, we study, through simulations, the contribution of the leaky bucket plus cell spacer subsystem to the delay and jitter in an end-station. We also study the distribution of the size of the burst of cells leaving the end-station and entering the network. Finally, we derive the theoretical upper bound for the size of bursts of cells.
Minced Tree, With Applications to Fault-Tolerant VLSI Processor Arrays
Authors: R F K Chung., L A Rosenberg
Venue:  (1984)

We derive here a lower bound on the number of edges $f(c,d)$ that one must remove from a depth-$d$ complete binary tree in order to partition the tree into $c$ equal size pieces. We show that for the sequence of integers $c_l~=~ _{def}~ 3$ x $2^l$, \[ f(c_l,d) \geq \frac {c_l}{16} \left [ \frac {d}{2} - l \right ] \] We then apply this bound to a graph-embeddings problem related to the design of fault-tolerant VLSI processor arrays in a wafer-scale environment. The problem setting abstracts techniques that attain tolerance to faults by running buses past the implemented processing elements (PEs) and interconnecting the fault-free ones into an array of the desired structure by having PEs tap into the buses. An earlier study has exhibited a fault-tolerant implementation of tree-structured arrays, using this strategy. We show here that that implementation is optimal in area consumption (to within constant factors), even when the array to be simulated must have the structure of a {\em complete} binary tree.
XML: A Technical Introduction
Authors: Massimo Martinelli
Venue:  (2000)

This report aims at providing a technical introduction to the eXtensible Markup Language, known as XML. This language has been developed by W3C, the World Wide Web Consortium in order to offer an effective mechanism for managing structured data on the Web, thus overcoming the limits of HTML (Hyper Text Markup Language). We examine the components of the language and the way in which it differs with HTML. Examples are given of current possible uses and suggestion are made for future applications. We also briefly outline some of the new standards that are emerged, or now emering with respect to XML. 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
Learning Object-Centered Representations
Authors: Peter A. Sandon
Venue:  (1987)

When we look at a familiar object from a novel viewpoint, we are usually able to recognize it. In this thesis, we address the problem of learning to recognize objects under transformations associated with viewpoint. Our vision model combines a hierarchical representation of shape features with an explicit representation of the transformation. Shape features are represented in a layered pyramid-shaped subnetwork, while the transformation is explicitly represented in an auxiliary subnetwork. The two connectionist networks are conjunctively combined to allow object- centered shape features to be computed in the upper layers of the network. A simulation of a 2-D translation subnetwork demonstrates the ability to learn to recognize shapes in different locations in an image, such that those same shapes can be recognized in novel locations. Two new learning methods are presented, which provide improved behavior over previous backpropagation methods. Both methods involve ciompetitive interactions among clusters of nodes. The new learning methods demonstrate improved learning over the generalized delta rule when applied to a number of network tasks. In the first method, called error modification, competition is based on the error signals computed from the gradient of the output error. The result of this competition is a set of midified error signals representing a contrast enhanced version of the original errors. The error modification method reduces the occurrence of network configurations that correspond to local error minima. In the second method, called error augmentation, competition is based on that activations of the nodes in the cluster. Network changes resulting from this competition augment those specified by the error gradient computation. This competition is implemented by the trace comparison rule, a new self-organizing mechanism that is effective in developing highly discriminating features within the cluster. The error augmentation method improves learning in the lower network layers when backpropagged error is weak.