ppxscal/embedding_network huggingface dataset:
Minimal Sensor Integrity in Sensor Grids
Authors: Rajgopal Kannan, Sudipta Sarangi, Sibabrata Ray, S. S. Iyengar
Venue: Proceedings of the 2002 International Conference on Parallel Processing (2002)

Given the increasing importance of optimal sensor deployment for battlefield strategists, the converse problem of reacting to a particular deployment by an enemy is equally significant and not yet addressed in a quantifiable manner in the literature. We address this issue by modelinga two stage game in which the opponent deploys sensors to cover a sensor field and we attempt to maximally reduce his coverage at minimal cost. In this context, we introduce the concept of minimal sensor integrity which measures the vulnerability of any sensor deployment.We find the best response by quantifying the merits of each response. While the problem of optimally deploying sensors subject to coverage constraints is NP-Complete, in this paper we show that the best response (i.e the maximum vulnerability) can be computed in polynomial time for sensors with arbitrary coverage capabilities deployed over points in any dimensional space. In the special case when sensor coverages form an interval graph (as in a linear grid), we describe a better O(Min(M2 ;NM)) dynamic programming algorithm.
Maxwell's Guide to Authority Work
Authors: Robert L. Maxwell
Venue:  (2002)

:"Authority work is the linchpin of the library catalog. As Maxwell puts it, "Without authority control the burden is placed on the user to think of all the possible forms a cataloger might have used to give access in the catalog to a given author or subject." From one of the preeminent experts in the field, this step-by-step guide for ensuring that your library and staff are creating and maintaining authority records with the end user in mind is a must-have." "In this text, authority work is broken down to its most basic components so that you can trace and follow the preparation of a complete authority record. Helpful illustrations identify the key characteristics of good authority records, common acronyms are defined, and cross-references throughout reinforce material." The authoritative tool for making certain a person, author, corporate body, organization, book, or other media is appropriately accessible under its authority name, subject, and form, Maxwell's should be part of any library's toolbox. 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
Hardness of Approximation of the Loading Problem for Multi-layered Feedforward Neural Nets
Authors: DasGupta Bhaskar, Hammer Barbara
Venue:  (1999)

In this paper we deal with the problem of efficient learning of feedforward neural networks. First, we consider the case when the objective is to maximize the ratio r of the correctly classified points compared to all points in a training set. We show that, for an arbitrary multilayered threshold network with varying input dimension and with a constant n_1 <= 2 neurons in the first hidden layer, it is NP-hard to approximate r within a relative error of at most \varepsilon=1/(68 n_1 2^{n_1}+ 136 n_1^3+ 136 n_1^2 +170n_1). If n_1 <= 3, then the above result is true with \varepsilon=c(n_1-1)/(5n_1^3+2n_1^32^{n_1}+4n_1^5+4n_1^4) for some positive constant c, even if restricted to situations where a solution without any misclassifications exists. Restricted to architectures with only one hidden layer and two hidden neurons approximation of r with relative error at most 1/c is NP-hard even if either (a) c=2244, the threshold activation function in the hidden layer is substituted by the classical sigmoid function, and the situation of \epsilon-separation of the output classification is assumed, or (b) c=2380 and the threshold activation function is substituted by the semilinear activation function commonly used in the neural net literature. For a single hidden layer threshold network with varying input dimension and k hidden nodes, approximating r within a relative error of at most c/k^5, for some positive constant c, is NP-hard even if restricted to situations where the number of examples is at most k^4. Finally, we consider the case when the objective is to minimize the failure ratio f in the presence of missclassification errors. We show that it is NP-hard to approximate f within any constant c<1 for a multilayered threshold network if the input biases are fixed to zero.
A Jacobi-like Algorithm for Computing the QR-Decomposition
Authors: Franklin T. Luk
Venue:  (1984)

A parallel Jacobi-like method for computing the QR-decomposition of an $n \times n$ matrix is proposed. It requires $O(n^{2})$ processors and $O(n)$ units of time. The method can be extended to handle an $m \times n$ matrix $(m \geq n)$. The requirements become $O(n^{2})$ processors and $O(m)$ time.
Least cost routing in multi-service networks. II
Authors: A. Kolarov, J. Hui
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1 (1995)

In Part I, we proposed a distributed, state dependent, dynamic routing method, called least cost routing in multi-service networks (LCRM), for multirate circuit-switched broadband ISDN networks, which support a variety of traffic classes with different characteristics. This method represents the one-step policy improvement on a chosen base policy. As a base policy /spl pi//sub 0/, we use the policy which allows direct link routing only. The policy /spl pi//sub 0/ also requires that each call class has a portion of link bandwidth dedicated to it. The task is to find an efficient computational way to obtain the corresponding relative cost values, which represent costs of routing a call over one link. We consider the one-link model with two types of traffic. Our main result is that the system of linear equations associated with the two-dimensional Markov chain can be decomposed into several systems of linear equations, each one associated with the one-dimensional Markov chain.
Risk Bands - A Novel Feature of Safecharts
Authors: Nimal Nissanke, Hamdan Z. Dammag
Venue: Proceedings of the 11th International Symposium on Software Reliability Engineering (2000)

Safecharts [2] are a safety oriented variant of Statecharts [3] and have been developed especially for the use in specification and design of safety critical systems. One of the fundamental aspects of Safecharts is the explicit ordering of system states according to their risk levels. Based on this ordering, transitions are classified according to the nature of their risk and are given a priority scheme favoring the execution of safer transitions in the event of any nondeterminism. As a precaution, transitions between states with unknown relative risk levels are not permitted. As a result, many transitions, including those, which might be functionally desirable, may be potentially excluded between states, which are located in sparsely populated areas of risk graphs. This is an inadequacy, which may be attributed to factors such as incomplete hazard analysis, the lack of information about relative risk levels of different states of the system, etc. In order to extend the permitted transition space in such circumstances and to enhance the risk ordering relation, this paper introduces the concept of risk band. Risk bands enable an unambiguous interpretation of the relevant risk level of states, thus allowing a well understood enhancement of risk graphs and an extension of the concept of safe non-determinism introduced in [2]. An example drawn from the nuclear industry demonstrates the application of Safecharts.
Visual C# .Net Enterprise Development, 1 edition
Authors: John Paul Mueller, Paul John Mueller
Venue:  (2002)

:Now that you've learned the essentials of C#, it's time to start using the power of the language to develop complex enterprise applications. Visual C# .NET Developer's Handbook details C#'s strengths and gets you started building real-world projects. Author John Mueller also details what C# doesn't do well, to help you through difficult programming situations and provide you with solutions for your own applications. As you'll discover, C# combines the ease of Visual Basic with the power required to tap into both the .NET Framework and the Windows API. You'll master standard application development with C#, including creating controls and components, working with threads and Active Directory, and programming security. You'll also master C#'s database connectivity capabilities through ADO.NET and its support for distributed development. You'll be able to build flexible applications that can connect desktops over a LAN or that work over the web with XML and SOAP, or even provide wireless access to mobile devices. Throughout, Mueller provides advice on working efficiently, taking advantage of C#'s rich visual environment, and avoiding errors, including those to which the language is prone. Two appendices provide special help with making the transition from VB and Visual C++, and a third offers an otherwise undocumented trick: creating a Microsoft Management Console (MMC) snap-in. Featured on the CD The enclosed CD contains all the example code used in the book ready for you to use in your own projects. You also get a collection of utilities of interest to C# developers, including Alchemy Mindworks Graphics Workshop and GIF Construction Set, C Point Antechinus C# Programming Editor, and Phillip Craig's NUnit. About the Author John Mueller is a freelance author and technical editor. He has writing in his blood, having produced 54 books and over 200 articles to date, on topics ranging from networking to artificial intelligence to database management to heads-down programming. He is currently the editor of the .NET electronic newsletter for Pinnacle Publishing.
Near-Horn Prolog and the Ancestry Family of Procedures
Authors: W D Reed, W D Loveland
Venue:  (1992)

The Near-Horn Prolog procedures have been proposed as effective procedures in the area of disjunctive logic programming, an extension of logic programming to the (first-order) non-Horn clause domain. In this paper, we show that these case-analysis based procedures may be viewed as members of a class of procedures called the ``ancestry family,'''' which also includes Model Elimination (and its variants), the Positive Refinement of Model Elimination, and SLWV. The common feature which binds these procedures is the extension of SLD-resolution to full first-order logic with the addition of an ancestor cancellation rule. Procedures in the ancestry family are all sound and complete first-order procedures that can be seen to vary along three parameters: (1) the number of clause contrapositives required, (2) the amount of ancestor checking that must occur, and (3) the use (if any) of a Restart rule. Using a sequent-style presentation format for all procedures, we highlight the close relationships between these procedures and compare their relative advantages.
System Requirements and Formal Specifications of Hierarchical Reactive Systems
Authors: Atsushi Togashi, Xiaosong Lu, Fumiaki Kanezashi
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems (2000)

A methodology for the description of system requirements and formal specifications of reactive systems, and the synthesis of formal specifications is presented. Based on a hierarchical structure of system properties a hierarchical assertional language is used as a requirement language and hierarchical state transition systems are used as formal specifications. Sound and complete formal specifications are synthesized from system requirements automatically. Modularity and reusability are supported by the introduction of requirement and specification modules and a partial order relation over these modules. The methodology has a practical significance because desired specifications of reactive systems can be derived or synthesized from user requirements on system functions in a systematic and stepwise way.
The effects of pair-wise and higher order correlations on the firing rate of a post-synaptic neuron
Authors: Sander M. Bohte, H. Spekreijse, P. R. Roelfsema
Venue:  (1998)

Coincident firing of neurons projecting to a common target cell is likely to raise the probability of firing of this post-synaptic cell. Therefore synchronized firing constitutes a significant event for post-synaptic neurons and is likely to play a role in neuronal information processing. Physiological data on synchronized firing in cortical networks is primarily based on paired recordings and cross-correlation analysis. However, pair-wise correlations among all inputs onto a post-synaptic neuron do not uniquely determine the distribution of simultaneous post-synaptic events. We develop a framework in order to calculate the amount of synchronous firing that, based on maximum entropy, should exist in a homogeneous neural network in which the neurons have known pair-wise correlations and higher order structure is absent. According to the distribution of maximal entropy, synchronous events in which a large proportion of the neurons participates should exist, even in the case of weak pair-wise correlations. Network simulations also exhibit these highly synchronous events in the case of weak pair-wise correlations. If such a group of neurons provides input to a common post-synaptic target, these network bursts may enhance the impact of this input, especially in the case of a high post-synaptic threshold. Unfortunately, the proportion of neurons participating in synchronous bursts can be approximated by our method under restricted conditions. When these conditions are not fulfilled, the spike trains have less than maximal entropy, which is indicative of the presence of higher order structure. In this situation, the degree of synchronicity cannot be derived from the pair-wise correlations.
Moving Forward?
Authors: Jim Hearn
Venue: IEEE Security and Privacy (2003)

The author compares and contrasts the US government's and the European Commission's cybersecurity policies, recognizing that only time will reveal the differences in execution and effectiveness between the strategies.
Resource Allocation in a Distributed Network
Authors: Heikkinen Tiina
Venue:  (2000)

This paper discusses distributed resource allocation in a communication system. Some recent approaches to decentralized resource allocation in a communication system are summarized. A characterization for resource control and pricing in a distributed wireless network with transmit power control is presented. Power control is modelled as a noncooperative externality game between the users. In the absence of a price each user has the incentive to increase the transmit power to increase the quality-of service as measured by the signal-to-noise ratio. However, the increase in transmission energy of a representative user by definition deteriorates the signal-to-noise ratio for all other users, thus imposing an externality cost. The Nash equilibrium in an uncontrolled distributed network is one where the system fails due to excessive congestion. However, by introducing a simple linear pricing penalty, the distributed system can be made to achieve the Pareto-optimal quality of service. Convergence to an efficient Nash equilibrium under pricing is observed in a numerical example assuming that the users apply a standard learning automaton. Paper Available at: ftp://dimacs.rutgers.edu/pub/dimacs/TechnicalReports/TechReports/2000/2000-40.ps.gz 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
Adaptive populations of endogenously diversifying Pushpop organisms are reliably diverse
Authors: Lee Spector
Venue: Proceedings of the eighth international conference on Artificial life (2002)

This paper discusses the evolution of diversifying reproduction. We measured the average difference between mothers and their children, the number of species, and the degree of adaptation in evolving populations of endogenously diversifying digital organisms using the Pushpop system. The data show that the number of species in adaptive populations is higher than in nonadaptive populations, while the variance in the differences between mothers and their children is less for adaptive populations than for non-adaptive populations. In other words, in adaptive populations the species were more numerous and the diversification processes were more reliable.
Producer-Consumer Pipelining for Structured-Data in a Fine-Grain Non-Strict Dataflow Language on Commodity Machines
Authors: Kentaro Inenaga, Shigeru Kusakabe, Makoto Amamiya
Venue: Proceedings of the 1999 International Workshop on Innovative Architecture (1999)

Fine-grain non-strict data structures such as I-structures provide high-level abstraction to easily write programs with potentially high parallelism due to the eager evaluation of non-strict functions and non-strict structured-data. Non-strict data structures require frequent dynamic scheduling at a fine-grain level, which offsets the gain of latency hiding and asynchronous accesses to structured-data using non-strict data structures. These cause heavy overhead on commodity machines. In order to solve these problems for fine-grain non-strict structured-data, we employ a method to analyze dependencies between the structured-data and to schedule their producers and consumers. The performance evaluation results indicate that the scheduling technique is effective to improve the performance of fine-grain non-strict programs on commodity machines.
Optimal Loop Parallelization
Authors: Alexander Aiken, Alexandru Nicolau
Venue:  (1988)

Parallelizing compilers promise to exploit the parallelism available in a given program, particularly parallelism that is too low-level or irregular to be expressed by hand in an algorithm. However, existing parallelization techniques do not handle loops in a satisfactory manner. Fine-grain (instruction level) parallelization, or compaction, captures irregular parallelism inside a loop body but does not exploit parallelism across loop iterations. Coarser methods, such as doacross [9], sacrifice irregular forms of parallelism in favor of pipelining iterations (software pipelining). Both of these approaches often yield suboptimal speedups even under the best conditions-when resources are plentiful and processors are synchronous. In this paper we present a new technique bridging the gap between fine-and coarse-grain loop parallelization, allowing the exploitation of parallelism inside and across loop iterations. Furthermore, we show that, given a loop and a set of dependencies between its statements, the execution schedule obtained by our transformation is time optimal: no transformation of the loop based on the given data-dependencies can yield a shorter running time for that loop.
An Experimental Study of SBH with Gapped Probes
Authors: Benoit Hudson
Venue:  (1999)

Sequencing by Hybridization (SBH) has been proposed as a means of automating the task of DNA sequencing. The original SBH proposal was able to sequence DNA of length about $2^k$ nucleotides with a cost $O(4^k)$ (in linear time). Preparata and Upfal have recently proposed a new method, which was predicted to be able to sequence DNA of length $O(4^k)$, still for a cost $O(4^k)$. This work describes a simulation of the method developed to test the theoretical results.
Critical-Path-Based Message Logging for Incremental Replay of Message-Passing Programs
Authors: Robert H. B. Netzer, Sairam Subramanian, Jian Xu
Venue:  (1994)

Debugging long-running, nondeterministic message-passing parallel programs requires incremental replay, the ability to exactly replay selected parts of an execution. To support incremental replay we must log enough messages and checkpoint processes often enough to allow any requested replay to complete quickly. We present an adaptive tracing strategy to keep the message-logging overhead down. We let the user specify a bound on the maximum time any replay request is allowed to take. Our algorithm tracks what each processes'' critical path will be during a replay and logs enough messages to ensure the critical path will never exceed the bound. Overhead is kept low by not logging messages that can be recomputed during a replay. Experiments indicate that we log about 0.1-5 reasonable bound on any replay.
A uniform approach for selecting views and indexes in a data warehouse
Authors: C. I. Ezeife
Venue: Proceedings of the 1997 International Symposium on Database Engineering & Applications (1997)

Careful selection of aggregate views and some of their most used indexes to materialize in a data warehouse reduces the warehouse query response time as well as warehouse maintenance cost under some storage space constraint. Data warehouses collect and store large amounts of integrated enterprise data from a number of independent data sources over a long period of time. Warehouse data are used for online analytical processing to assist management in making quick and competitive business decisions. Precomputing and storing summary tables (materialized views) reduces the amount of time needed to recompute these views across several source tables in order to answer complex warehouse queries. A data cube is an elegant way for representing aggregate information in a Warehouse and is an n-dimensional view with 2/sup n/ subviews. The paper presents a uniform technique for selecting the subviews of the data cube and their indexes to materialize in order to produce the best resultant benefit to the system in terms of query response time and maintenance cost while satisfying some storage space constraint.
Global convergence of a two-parameter family of conjugate gradient methods without line search
Authors: Xiongda Chen, Jie Sun
Venue: Journal of Computational and Applied Mathematics (2002)

We study the global convergence of a two-parameter family of conjugate gradient methods in which the line search procedure is replaced by a fixed formula of stepsize. This character is of significance if the line search is expensive in a particular application. In addition to the convergence results, we present computational results for various conjugate gradient methods without line search including those discussed by Sun and Zhang. (Ann. Oper. Res. 103 (2001) 161-173).
GCC: The Complete Reference, 1 edition
Authors: Arthur Griffith
Venue:  (2002)

:Learn to use GCC (GNU Compiler Collection) to develop and deploy a wide range of software across virtually all platforms and languages. Computer consultant Arthur Griffith provides a rich array of information on the most important piece of open source software in the world. Divided into three clearly-defined sections, this book explains command online options for each of the languages, describes in detail how multiple languages can be successfully mixed to build applications, and concludes with chapters devoted to utility programs such as automatic configuration and the debugger. Discover exciting new programming possibilities with this professional resource -- plus, utilize the added ability in GCC to compile Java code into native code or bytecodes.