ppxscal/embedding_network huggingface dataset:
Workshop Summary: Computational and Complexity Issues in Automated Verification
Authors: R. Brayton, A. Emerson, J. Feigenbaum
Venue:  (1996)

The correctness of computer hardware and software is an area of growing theoretical interest and practical importance. It is now widely acknowledged that effective reasoning about program correctness requires: (i) the use of appropriate formalisms, such as temporal logic or automata, for rigorously specifying correct behavior, and (ii) the use of mechanical reasoning algorithms, such as model checkers, to permit proofs of correctness to be constructed automatically that could not reasonably be constructed by hand owing to the intractable amount of tedious detail. A principal limiting factor in automated verification is the computational complexity of various associated mechanical reasoning problems; this complexity might be prohibitively high because of the combinatorial state explosion problem, which appears in many guises. The DIMACS Workshop on Computational and Complexity Issues in Automated Verification, held at Rutgers University on March 25-28, 1996, and organized by Bob Brayton (University of California at Berkeley), Allen Emerson (University of Texas), Joan Feigenbaum (AT&T Research), featured both theoretical and practical work in this important area of computer science. This report contains short abstracts of all talks given at the workshop, as well as pointers to sources of more information.
Multiagent planning for agents with internal execution resource constraints
Authors: Haksun Li, H. Durfee, Kang G. Shin
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

We study how agents can cooperate to revise their plans as they attempt to ensure that they do not over--utilize their local resource capacities. An agent in a multiagent environment should in principle be prepared for all environmental events as well as all events that could conceivably be caused by other agents' actions. The resource requirements to execute such omnipotent plans are usually overwhelming, however. Thus, an agent must decide which tasks to perform and which to ignore in the multiagent context. Our strategy is to have agents selectively communicate relevant details of their plans so that each gets a sufficiently accurate view of the events others might cause. Reducing uncertainties about the world trajectory improves the agents' resource allocation decisions and decreases their resource consumptions. In fact, our experiments over a sample domain show that, on average, 50% of an agent's initial actions are planned for states it can discover it will never reach. The protocol we develop in this paper thus discovers futile actions and reclaims resources that would otherwise be wasted.
Bifurcation of relative equilibria in mechanical systems with symmetry
Authors: Pascal Chossat, Debra Lewis, Juan-Pablo Ortega, Tudor S. Ratiu
Venue: Advances in Applied Mathematics (2003)

The relative equilibria of a symmetric Hamiltonian dynamical system are the critical points of the so-called augmented Hamiltonian. The underlying geometric structure of the system is used to decompose the critical point equations and construct a collection of implicitly defined functions and reduced equations describing the set of relative equilibria in a neighborhood of a given relative equilibrium. The structure of the reduced equations is studied in a few relevant situations. In particular, a persistence result of Lerman and Singer [Nonlinearity 11 (1998) 1637-1649] is generalized to the framework of Abelian proper actions. Also, a Hamiltonian version of the Equivariant Branching Lemma and a study of bifurcations with maximal isotropy are presented. An elementary example illustrates the use of this approach.
Inf-semilattice approach to self-dual morphology
Authors: Henk J.A.M. Heijmans, R. Keshet
Venue:  (2001)

Today, the theoretical framework of mathematical morphology is phrased in terms of complete lattices and operators defined on them. That means in particular that the choice of the underlying partial ordering is of eminent importance, as it determines the class of morphological operators that one ends up with. The duality principle for partially ordered sets, which says that the opposite of a partial ordering is also a partial ordering, gives rise to the fact that all morphological operators occur in pairs, e.g., dilation and erosion, opening and closing, etc. This phenomenon often prohibits the construction of tools that treat foreground and background of signals in exactly the same way. In this paper we discuss an alternative framework for morphological image processing that gives rise to image operators which are intrinsically self-dual. As one might expect, this alternative framework is entirely based upon the definition of a new self-dual partial ordering.
Newspaper document analysis featuring connected line segmentation
Authors: Phillip E. Mitchell, Hong Yan
Venue: Proceedings of the Pan-Sydney area workshop on Visual information processing - Volume 11 (2001)

This paper presents an algorithm designed to segment and classify newspaper documents. A notable feature of this algorithm is the ability to detect lines in the document - including lines that are connected to other components. A bottom-up approach is used to segment the image into patterns, and then each pattern is classified into one of seven types. Complete regions are then formed from the classified patterns.
Quantitative Approaches in Object-Oriented Software Engineering
Authors: H. Sahraoui, G. Poels, P. Britoe Abreu
Venue:  (2003)

:Software internal attributes have been extensively used to help software managers, customers and users characterize, assess and improve the quality of software products. The key topics in this publication cover metrics collection, quality assessment, metrics validation and process management. The contributors are from leading research establishments in Europe, South America and Canada.
An Improved Interface Simulation Architecture
Authors: Shannon W Price
Venue:  (1994)

Changes made to system requirements late in development are more costly than revisions made early in development. There is, therefore, significant motivation to reduce the number of changes to a proposed system as development proceeds. Simulating a system allows developers to clarify and iteratively refine requirements specifications early in development. NASA has requested that a simulation architecture be developed that will allow developers to demonstrate the functionality of proposed systems and to evaluate the effectiveness of the user interface during the requirements phase of development. The process, which will be applied to on-board displays for Space Station Freedom [Moore, 1992], will allow developers to iteratively refine and clarify requirements before full-scale development (i.e. flight-code development) begins. Moore [1993a] has described a simulation architecture which allows for design of the displays, building of a low fidelity simulation of the system, establishment of a realtime connection between the interface and the simulator, and integration of an interface evaluation tool. Later, the interface that has been developed will be connected to a high fidelity simulator and finally to the actual on-board flight software. Minimizing the number of changes that need to be made during flight-code development will significantly reduce development costs. 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
Dynamic Optimization of Index Scans Restricted by Booleans
Venue: Proceedings of the Twelfth International Conference on Data Engineering (1996)

When index retrieval is restricted to a range or singleton, an index scan is not done in its entirety because key portions before and after the range are skipped. Likewise, in some production databases, gaps between multiple ranges are skipped. However, ranges on the second attribute of a composite key are considered unproductive for key skip because they do not constitute a key range. This is not so. Restriction age=40 for index [sex,age] can be viewed as ORed singletons "female"
We Are All Security Consumers
Authors: Bruce Schneier
Venue: IEEE Security and Privacy (2003)

Bruce Schneier advocates security engineers educate consumers to become better security consumers. 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
Optimal Realization of Hypercubes by Three-Dimensional Space-Invariant Optical Interconnections
Authors: Shin'ichiro Tago, Shuichi Ueno
Venue: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (1997)

It is known that an N-vertex hypercube Q_N can be realized by three-dimensional space-invariant optical interconnections using an optical interconnect module (OIM) with fan-out of size 2logN-1 and two array planes of area O(N log^4 N). We show that (8logN-12)/5 and N(logN+1)/2 are lower bounds for the size of fan-out of OIM and the area of the array plane to realize Q_N, respectively. We also show a realization of Q_N using an OIM with fan-out of size 2logN and two array planes of area NlogN+N/2. Our realization is optimal to within a small constant factor.
Reduction of artifacts in cosine transform coded images
Authors: Ju Jia Zou, Hong Yan
Venue: Proceedings of the Pan-Sydney area workshop on Visual information processing - Volume 11 (2001)

A method for reducing blocking artifacts in compressed images coded by the block discrete cosine transform (BDCT) is presented. Problems arising from the independent transfrom and quantization of individual blocks result in blocking artifacts. This study is aimed at reducing the blocking artifacts while avoiding excessively blurring the underlying image. The theory of projection onto convex sets (POCS) is applied. An image before compression is simulated by a locally adaptive triangualr mesh. The forms the basis of a smoothness constraint set. To construct such a mesh, each image block is divided into a set of triangles. The number of triangles in a perimental results show that the proposed method outperforms two competing methods.
Getting the Most from Online Learning: A Learner's Guide
Authors: George M. Piskurich
Venue:  (2003)

:This book helps e-learners help themselves by teaching them how to prepare for, participate in, and apply e-learning. It is a companion guide to Preparing Learners for E-Learning (0-7879-6396-8) which considers the topic from the view of designers, instructors, and administrators. Getting the Most from Online Learning is also a reference for instructors who are preparing their learners for e-learning, a tool that organizations can distribute to their employees before embarking on an e-learning intervention, and a useful resource for individual and group e-learning programs.
Fault-Tolerant Scheduling in Distributed Real-Time Systems
Authors: N. V. Satyanarayana, Rajib Mall, Aajit Pal
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

In distributed systems, a real-time task has several subtasks which need to be executed at different nodes. Some of these subtasks can be executed in parallel on different nodes without violating their precedence relationships, if any, among them. To better exploit the parallelism, it becomes necessary to assign separate deadlines to subtasks and schedule them independently. We use three subtask deadline assignment policies which we have introduced earlier [4], [7] to develop a bidding-based fault-tolerant scheduling algorithm for distributed real-time systems. A local scheduler which resides on each node, tries to determinea schedule for each subtask according to the primary-backup approach. In this paper we discuss the algorithm and present the results of simulation studies conducted to establish the efficacy of our algorithm.
Dense Patch-oriented Matrix Factorization on a Hypercube Multiprocessor
Authors: Doug W. Moore
Venue:  (1987)

We develop algorithms for Cholesky factorization and the solution of triangular systems of linear equations on a hypercube multiprocessor. Specifically, we describe algorithms that apply when the matrix is distributed around the hypercube by submatrices, or patches. We show that these algorithms use asymptomatically less internode communication than more common rowand columnoriented algorithms. Empirical results accompany the analysis and show that patch-oriented algorithms are competitive with, but not demonstrably superior to, the other algorithms for hypercubes of low dimension. Implementations in C appear in an appendix. 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
Digitale Wasserzeichen fur MPEG Video LOCTITLE:: Digitale Wasserzeichen fur MPEG Video
Authors: bibliothek ARRAY(0x8475918) EMAIL::
Venue:  (1998)

The development of new multimedia services and environments requires new concepts both to support the new working process on distributed computers and to protect the multimedia data during the production and the distribution in digital marketplaces. This study addresses copyright protection as a major security demand in digital marketplaces. We propose and compare two watermarking techniques for MPEG video with the intention to show the advantages and the possible weakness in the schemes working in the frequency domain and in the spatial domain. To improve the view to the distortion of the watermarked frames we generate a 3D-diverence view measuring the changes which were made during watermarking process and/or caused by several damaging attacks. LOCLANGUAGE:: German LOC :: Mit der Entwicklung neuer multimedialer Dienste und Applikationen sind auch neue Arbeitsprozesse und Sicherheitsstandards zum Schutz digitaler Daten gefragt. Die Akzeptanz von Anbietern digitaler Dienste gegenuber dem Medium Internet hangt in hohem Ma?e davon ab, ob z.B. entsprechende Techniken fur den Schutz von digitalen Videos existieren. Es werden zwei Watermarking-Verfahren zum Schutz von Urheberrechten, speziell fur MPEG-Videos, vorgestellt. Die Starken und Schwachen der im Bild- bzw. Frequenzraum arbeitenden Verfahren, werden anhand von diversen Angriffen getesten und analysiert. Um die durch die Wasserzeichen und Attacken verursachten, kaum sichtbaren Bildstrungen besser zu veranschaulichen, werden 3D-Differenzbilder generiert. Die vorgestellten Watermarking-Verfahren geben Autoren von digitalen Daten die Mglichkeit ihr Eigentum zu signieren und damit ihre rechtma?igen Anspruche sicher zu stellen. 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
gccXfront: Exploiting gcc as a Front End for Program Comprehension Tools via XML/XSLT
Authors: Mark Hennessy, Brian A. Malloy, James F. Power
Venue: Proceedings of the 11th IEEE International Workshop on Program Comprehension (2003)

Parsing programming languages is an essential component of the front end of most program comprehension tools. Languages such as C++ can be difficult to parse and so it can prove useful to re-use existing front ends such as those from the GNU compiler collection, gcc. We have modified gcc to provide syntactic tags in XML format around the source code which can greatly enhance our comprehension of the program structure. Further, by using XML transformation stylesheets, the XML outputted by our modified gcc can be translated into a more readable format. Our tool, gccXfront leverages the power and portability of the gcc suite, since any C, C++, Objective C or Java program can be processed using gcc. Our tool can thus act as a bridge between gcc and other program comprehension tools that accept XML formatted input.
How Near is a Stable Matrix to an Unstable Matrix?
Authors: Charles Van Loan
Venue:  (1984)

In this paper we explore how close a given stable matrix A is to being unstable. As a measure of ``how stable'''' a stable matrix is, the spectral abscissa is shown to be flawed. A better measure of stability is the Frobenius norm of the smallest perturbation that shifts one of A''s eigenvalues to the imaginary axis. This leads to a singular value minimization problem that can be approximately solved by heuristic means. However, the minimum destabilizing perturbation may be complex even when A is real. This suggests that in the real case we look for the smallest real perturbation that shifts one of the eigenvalues to the imaginary axis. Unfortunately, a difficult constrained minimization problem ensues and no practical estimation technique could be devised.
Effects of Different Types of New Attribute on Constructive Induction
Authors: Zijian Zheng
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

This paper studies the effects on decision tree learning of constructing four types of attribute (conjunctive, disjunctive, M-of-N, and X-of-N representations). To reduce effects of other factors such as tree learning methods, new attribute search strategies, evaluation functions, and stopping criteria, a single tree learning algorithm is developed. With different option settings, it can construct four different types of new attribute, but all other factors are fixed. The study reveals that conjunctive and disjunctive representations have very similar performance in terms of prediction accuracy and theory complexity on a variety of concepts. Moreover, the study demonstrates that the stronger representation power of M-of-N than conjunction and disjunction and the stronger representation power of X-of-N than these three types of new attribute can be reflected in the performance of decision tree learning.
Modeling Web Caching Schemes for Performance Studies
Authors: Cho-Yu Chiang, Mikihiro Ueno, Ming T. Liu, Mervin E. Muller
Venue: Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing (2000)

This paper outlines a generic approach to modeling Web caching schemes. Four Web caching schemes -- SH, ICP, CD, and CNP -- were modeled to study their performance in terms of request latencies. There were two important findings. First, conventional Web caching schemes such as SH, ICP, and CD would have shorter request latencies if total numbers of levels in their caching hierarchies were one or two. Second, under some reasonable assumptions, CNP was found to outperform the other schemes in terms of request latencies.
The Multi-Agent Systems for Computer Network Security Assurance: Frameworks and Case Studies
Authors: V. Gorodetski, I. Kotenko
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

The paper presents experience in application of multi-agent technology for design and implementation of multi-agent systems (MASs) intended to cooperatively solve the currently critical tasks in the area of computer network security assurance. These MASs are Agent-based Simulator of Attacks against Computer Networks, Multi-agent Intrusion Detection System and Multi-agent Intrusion Detection Learning System. Each of these MASs is based on strict formal frameworks proposed by authors and designed and implemented as software prototypes on the basis of common technology and software tool "Multi-agent System Development Kit" developed by authors. The paper sketches the above MASs and analysesadvantages of use of multi-agent architecture for computer network assurance.
Data Mining for Constructing Ellipsoidal Fuzzy Classifier with Various Input Features Using GRBF Neural Networks
Authors: Dianhui Wang, Tharam Dillon, Elizabeth Chang
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

This paper aims at developing a theoretical framework for constructing ellipsoidal fuzzy classifiers with various input features from a data mining viewpoint.The proposed methodology for constructing fuzzy classification systems with ellipsoidal regions contains four parts, that is, rule-set initialization using a fully connected RBF neural network with an APC-III learning algorithm and cross entropy criterion; feature selection by using a simple and practical algorithm; determination of rule-set structure and representation using a generalized RBF neural network, where a fuzzy plus operator is employed as the activation function of the neurons at the output layer; and a regularization cost function addressing the trade-offbetween misclassification, recognition and generalization for optimizing the initial rule-set.
A Block QR Factorization Scheme for Loosely Coupled Systems of Array Processors
Authors: Charles V Loan
Venue:  (1987)

A statically scheduled parallel block QR factorization procedure is described. It is based on "block" Givens rotations and is modeled after the Gentleman-Kung systolic QR procedure. Independent tasks are associated with each block column. "Tallest possible" subproblems are always solved. The method has been implemented on the IBM Kingston LCAP-1 system, which consists of ten FPS-164/MAX array processors that can communicate through a large shared bulk memory. The implementation revealed much about the tradeoff between block size and load balancing. Large blocks make load balancing more difficult but give better 164/MAX performance and less shared memory traffic. The results obtained indicate that our approach to parallelizing the QR factorization is competitive for very large problems, e.g., of the order 5000-by-1000.
Pull the Weighted Center Towards the Solution of LP
Authors: A. Liao
Venue:  (1994)

In the paper of Liao and Todd [3] two weighted centers are introduced and used to design algorithms for solving systems of linear inequalities. The linear programming problems can be solved via the weighted centers of a sequence of linear inequalities formed by letting the objective be an extra constraint and increasing the lower bound corresponding to the objective function as long as it is possible. In this paper we study the second kind of weighted center of [3] which is more computationally oriented and show that, under a regularity assumption, the weighted center of the linear inequality with the objective as an extra constraint converges to the solution of the linear programming problem under consideration as the upper bound corresponding to the objective function is pulled towards the infinity. We propose a relaxed version of one of the algorithms of [3]. This modified version does not try to find an accurate center during each iteration; instead, an approximate center which is the k-th feasible iterate is determined in the k-th iteration. We show that this modified algorithm finds an e-solution in finity many iterations. Some limited numerical results are presented to compare our algorithm with the simplex method and indicate that our algorithm is promising. Keywords: weighted center, Newton''s method, linear programming 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