ppxscal/embedding_network huggingface dataset:
Generalized Pickands constants
Authors: K. Debicki
Venue:  (2001)

Pickands constants play an important role in the exact asymptotic of extreme values for Gaussian stochastic processes. By the {\it generalized Pickands constant} ${\cal H}_{\eta}$ we mean the limit \begin{eqnarray*} {\cal H}_{\eta}= \lim_{T \to \infty}\frac{ {\cal H}_{\eta}(T)}{T}, \end{eqnarray*} where ${\cal H}_{\eta}(T)= \Exp \exp \left(\max_{t \in [0,T]} \left(\sqrt{2} \eta(t)- \sigma^2_{\eta}(t)\right)\right)$ and $\eta(t)$ is a centered Gaussian process with stationary increments and variance function $\sigma^2_{\eta}(t)$. Under some mild conditions on $\sigma^2_{\eta}(t)$ we prove that ${\cal H}_{\eta}$ is well defined and we give a comparison criterion for the generalized Pickands constants. Moreover we prove a theorem result of Pickands for certain stationary Gaussian processes. As an application we obtain the exact asymptotic behavior of $\psi(u)=\Prob(\sup_{t\ge0}\zeta(t)-ct<u)$ as $u\to\infty$, where $\zeta(x)= \int_0^x Z(s)\,ds$ and $Z(s)$ is a stationary centered Gaussian process with covariance function $R(t)$ fulfilling some integrability conditions. 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 Reliable Multicast
Authors: Jaehee Yoon, Azer Bestavros, Ibrahim Matta
Venue:  (1999)

Abstract An increasing number of applications, such as distributed interactive simulation, live auctions, distributed games and collaborative systems, require the network to provide a reliable multicast service. This service enables one sender to reliably transmit data to multiple receivers. Reliability is traditionally achieved by having receivers send negative acknowledgments (NACKs) to request from the sender the retransmission of lost (or missing) data packets. However, this Automatic Repeat reQuest (ARQ) approach results in the well-known NACK implosion problem at the sender. Many reliable multicast protocols have been recently proposed to reduce NACK implosion. But, the message overhead due to NACK requests remains significant. Another approach, based on Forward Error Correction (FEC), requires the sender to encode additional redundant information so that a receiver can independently recover from losses. However, due to the lack of feedback from receivers, it is impossible for the sender to determine how much redundancy is needed. In this paper, we propose a new reliable multicast protocol, called ARM for Adaptive Reliable Multicast. Our protocol integrates ARQ and FEC techniques. The objectives of ARM are (1) reduce the message overhead due to NACK requests, (2) reduce the amount of data transmission, and (3) reduce the time it takes for all receivers to receive the data intact (without loss). During data transmission, the sender periodically informs the receivers of the number of packets that are yet to be transmitted. Based on this information, each receiver predicts whether this amount is enough to recover its losses. Only if it is not enough, that the receiver requests the sender to encode additional redundant packets. Using ns simulations, we show the superiority of our hybrid ARQ-FEC protocol over the well-known Scalable Reliable Multicast (SRM) protocol.
Monotone Linkage Clustering and Quasi-Convex Set Functions
Authors: Yulia Kempner, Boris Mirkin
Venue:  (1995)

Selecting subsets with adding the elements one by one is implicitely employed in many heuristical clustering procedures. Such a procedure, seriation, can be described generally in terms of a linkage function measuring entity-to-set similarities. A quite known clustering technique, Single linkage, can be considered an example of the seriation procedure (actually, based on the minimum spanning tree construction) leading to the global maximum of a corresponding "minimum split" set function. The purpose of this work is to have the property extended to a class of the linkage functions called monotone linkages. It is proved that the monotone linkage functions are minimum split functions for the quasi-convex set functions (and only for them). This allows to prove that the global optima of the quasi-convex set functions can be found with the multiple seriation algorithm based on corresponding linkage function.
Inelastic behaviour of I-shaped aluminium beams
Authors: G. De Matteis, R. Landolfo, M. Manganiello, F. M. Mazzolani
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

In this paper, the results of an extensive numerical analysis devoted to the evaluation of the inelastic behaviour of the I-shaped aluminium alloy beams are presented. By using a numerical model implemented in the implicit FEM code ABAQUS/Standard and largely calibrated against experimental tests, the main geometrical and mechanical parameters influencing the rotational capacity of I-beams subject to non-uniform bending are investigated. The study outlines the important role of the material hardening that, in addition to the local slenderness of compressed elements, has a strong influence on both moment capacity and ductility of the member. Moreover, it has been shown that, if interactive buckling phenomena are avoided, the influence of the other parameters (namely flange-to-web slenderness ratio, moment gradient, web slenderness and sectional area ratio) on the stable part of rotational capacity is of a secondary importance.
The M/G/1 fluid model with heavy-tailed message length distributions
Authors: J. W. Cohen
Venue:  (1997)

For the $M/G/1$ fluid model the stationary distribution of the buffer content is investigated for the case that the message length distribution $B(t)$ has a Pareto-type tail, i.e. behaves as $1- {\rm O} (t^{-\nu} )$ for $t \rightarrow \infty$ with $1> \nu >2$. This buffer content distribution is closely related to the stationary waiting time distribution $W(t)$ of a stable $M/G/1$ model with service time distribution $B(t)$, in particular when the input rate $\gamma$ of the messages into the buffer is not less than its output rate $c=1$. The actual waiting process of this $M/G/1$-model has an imbedded ${\ux}_{n}$-process which for $\gamma \geq 1$ has the same probabilistic structure as the ${\bf \omega} \hspace{-2mm} {\bf \omega} _n$-process, the latter one being an imbedded process of the buffer content process. The relations between the stationary distributions $U(t)$ and $W(t)$ are investigated, in particular between their tail probabilities. The results obtained are quite explicit in particular for $\nu = 1 \frac12$. Further heavy traffic results are obtained. These results lead to a heavy traffic result for the stationary distribution of the ${\bf \omega} \hspace{-2mm} {\bf \omega} _n$-process and to an asymptotic for the tail probabilities of this distribution.
Model checking for ACL compliance verification
Authors: Marc-Philippe Huget, Michael Wooldridge
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

The problem of checking that agents correctly implement the semantics of an agent communication language has become increasingly important as agent technology makes its transition from the research laboratory to field-tested applications. In this paper, we show how model checking techniques can be applied this problem. Model checking is a technique developed within the formal methods community for automatically verifying that finite-state concurrent systems implement temporal logic specifications. We first describe a variation of the MABLE multiagent BDI programming language, which permits the semantics (pre- and post-conditions) of ACL performatives to be defined separately from a system where these semantics are used. We then show how assertions defining compliance to the semantics of an ACL can be captured as claims about MABLE agents, expressed using MABLE's associated assertion language. In this way, compliance to ACL semantics reduces to a conventional model checking problem. We illustrate our approach with a number of short case studies.
Mixed PTL/Static Logic Synthesis Using Genetic Algorithms for Low-Power Applications
Authors: Grun Rae Cho
Venue: Proceedings of the 3rd International Symposium on Quality Electronic Design (2002)

We present a new mixed pass-transistor logic (PTL) and static CMOS logic synthesis method based on genetic search. The proposed synthesis method first performs search for possible matches between a logic structure and a set of predefined PTL/CMOS logic gates using BDDs. The unique contribution of our approach is the use of a genetic algorithm to determine the best mixture of PTL and static cells based on area and power. Our experimental results demonstrate that circuits synthesized using proposed mixed PTL/CMOS synthesis method outperforms their static counterparts in delay or power consumption or both in a 0.25um CMOS process. The average area, power consumption, and power-delay product of ISCAS85 and MCNC91 benchmark circuits using the proposed method are 25%, 40%, and 45% better than their static counterparts, respectively.
On the Concept of "Stability" in Asynchronous Distributed Decision-Making Systems
Authors: Tony Lee, Sumit Ghosh
Venue: Proceedings of the The Fourth International Symposium on Autonomous Decentralized Systems (1999)

Asynchronous, distributed, decision-making (ADDM) systems constitute a special class of distributed problems and are characterized as large, complex, real-world systems wherein the principal elements are the geographically-dispersed entities that communicate among themselves, asynchronously, through message passing and are permitted autonomy in local decision-making. Such systems generally offer significant advantages over the traditional, centralized algorithms in the form of concurrency, scalability, high throughput, efficiency, low vulnerability to catastrophic failures, and robustness. A fundamental property of ADDM systems is stability that refers to their behavior under representative perturbations to their operating environments, given that such systems are intended to be real, complex, and to some extent, mission critical systems, and are subject to unexpected changes in their operating conditions. This paper introduces the concept of stability in ADDM systems and proposes, for the first time, an intuitive definition that reects those used in Control Systems and Physics. A comprehensive stability analysis on an accurate simulation model will provide the necessary assurance, with a high level of confidence, that the system will perform adequately. An ADDM system is defined as a stable system if it returns to a steady-state in finite time, following perturbation, provided that it is initiated in a steady-state. Equilibrium or steady-state is defined through placing bounds on the measured error in the system. Where the final steady-state is equivalent to the initial one, the system is referred to as strongly stable. If the final steady-state is potentially worse then the initial one, the system is deemed marginally stable. When the system fails to return to steady-state following the perturbation, it is unstable. The perturbations are classified as either changes in the input pattern or changes in one or more environmental characteristics of the system such as hardware failures. To facilitate the understanding of stability in representative real-world systems, this paper reports the in-depth analysis of a basic manifestation of ADDM systems { a decentralized military command and control problem, MFAD. The entities in MFAD lack temporal external inputs and their interactions are subject to their initial conditions. Stability analysis of MFAD accurately highlights key stable and unstable conditions. Performance analysis reveals that MFAD is strongly stable to perturbations of short durations, it is inherently marginally stable, the sensor degradation bears a greater impact on sensor error than movement error, and the impact of communication failure is higher on movement error as opposed to sensor error.
Lower bounds in Computational Complexity
Authors: Ming Li
Venue:  (1985)

No abstract available 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
On linear morphisms of product spaces
Authors: Alessandro Bichara, Hans Havlicek, Corrado Zanella
Venue: Discrete Mathematics (2003)

Let χ be a linear morphism of the product of two projective spaces PG(n,F) and PG(m,F) into a projective space. Let γ be the Segre embedding of such a product. In this paper we give some sufficient conditions for the existence of an automorphism α of the product space and a linear morphism of projective spaces φ, such that γφ = αχ.
Skeletal images as visual cues in graph visualization
Authors: Ivan Herman, M. S Marshall, Guy Melancon, D. J. Duke, M. Delest, J. Domenger
Venue:  (1998)

The problem of graph layout and drawing is fundamental to many aproaches to the visualization of relational information structures. As the data set grows, the visualization problem is compounded by the need to reconcile the user''s need for orientation cues with the danger of information overload. Put simply: How can we limit the number of visual elements on the screen so as not to overwhelm the user yet retain enough information that the user is able to navigate and explore the data set confidently? How can we provide orientational cues so that a user can understand the location of the current viewpoint in a large data set? These are problems inherent not only to graph drawing but information visualization in general. We propose a method which extracts the significant features of a directed acyclic graph as the basis for navigation.
Microsoft ASP.NET Programming with Microsoft Visual Basic
Authors: G. Andrew Duthie
Venue:  (2003)

Teach yourself how to build Web applications with ASP.NET and Visual Basic .NET version 2003-one step at a time. Learn essential techniques by working at your own pace through dozens of hands-on exercises and instructive code samples.
SICStus Prolog Library Manual
Authors: Jonas Almgren, Stefan Andersson, Mats Carlsson, Lena Flood, Seif Haridi, Claes Frisk, Hans Nilsson, Jan Sundberg
Venue:  (1993)

Documentation of the SICStus Prolog Library.
AIX 5L Administration, 1 edition
Authors: Randal K. Michael
Venue:  (2002)

Configure, customize, and administer AIX version 5L effectively using this expert resource. Use system management tools, work with network and distributed file systems, manage the user environment, tune and monitor the system, and much more.Table of contents Part I: System Administration Tasks and Tools 1: Introduction 2: DocSearch and the Online Manual Pages: Getting Help from the System Part II: Systems and System Architecture 3: POWER Processors and Systems 4: AIX 5L Kernel Part III: System Installation and Management 5: System Management Tools 6: AIX Installation and Maintenance 7: AIX System Boot and Shutdown Part IV: System Configuration and Customization 8: AIX Runtime Configuration 9: AIX Device Configuration Manager (cfgmgr) and the Object Data Manager (ODM) 10: Tape Systems 11: The AIX Logical Volume Manager (LVM) 12: Printers and the Print Subsystem Part V: Network Configuration and Customization 13: TCP/IP Part VI: Networked Filesystems 14: Networked Filesystems: NFS, NIS, and NIS+ 15: Distributed File System Part VII: Linux Affinity 16: Linux Affinity with AIX Part VIII: Distributed Services 17: Mail and Sendmail 18: Apache Web Service 19: X11 Administration Part IX: Managing Users and Resources 20: Managing the User Environment 21: Process Management 22: System Accounting Part X: Security 23: Auditing and Security 24: Distributed Computing Environment (DCE) Part XI: System Recovery and Tuning 25: Backup and Copy Utilities 26: System Monitoring and Tuning 27: Problem Analysis and Recovery Part XII: High Availability 28: HACMP and Clustering Part XIII: Storage Area Networks and Network Attached Storage 29: SAN, NAS, and iSCSI Consolidated Storage Appendix
{\bf (Revised to CS-1994-28.)} Using Vapnik-Chervonenkis Dimension to Analyze the Testing Complexity of Program Segments
Authors: Kathleen Romanik, Scott J Vitter
Venue:  (1993)

We examine the complexity of testing different program constructs. We do this by defining a measure of testing complexity known as VCP-dimension, which is similar to the Vapnik-Chervonenkis dimension, and applying it to classes of programs, where all programs in a class share the same syntactic structure. VCP-dimension gives bounds on the number of test points needed to determine that a program is approximately correct, so by studying it for a class of programs we gain insight into the difficulty of testing the program construct represented by the class. We investigate the VCP-dimension of straight line code, if-then-else statements, and for loops. We also compare the VCP-dimension of nested and sequential if-then-else statements as well as that of two types of for loops with embedded if-then-else statements. Finally, we perform an empirical study to estimate the expected complexity of straight line code.
Identifying Design-Code Inconsistencies in Object-Oriented Software: a Case Study
Authors: R. Fiutem, G. Antoniol
Venue: Proceedings of the International Conference on Software Maintenance (1998)

Traceability is a key issue to ensure consistency among software artifacts of subsequent phases of the development cycle. However few works have addressed the theme of tracing object oriented design into its software.This paper presents an approach to check the compliance of OO design with respect to source code. The process works on design artefacts expressed in OMT notation and accepts C++ source code. It recovers an ``as is'' design from the code, compares recovered design with the actual design and helps the user to deal with inconsistency by pointing out regions of code which do not match with design.The recovery process exploits regular expression and edit distance to bridge the gap between code and design. Results as well as consideration related to presentation issues are reported in the paper.
A Formalism to Automate Mapping from Program Features to Code
Authors: Jean-Christophe Deprez, Arun Lakhotia
Venue: Proceedings of the 8th International Workshop on Program Comprehension (2000)

How does one locate the segments of code that implement a particular feature? Wilde and Scully (WS) pioneered the use of execution traces to map program features to code. Using their technique, to locate the implementation of a particular feature, a program is executed with two sets of inputs, one set invokes the feature of interest and the other set does not. Operations such as set-difference and set-intersection, amongst others, are then applied on the execution traces to obtain answers for various questions related to a feature and its implementation. Previous researchers have automated the tasks of computing the execution traces and performing operations on the execution traces. We present a formalism to automate the most time-consuming aspect of this approach for locating code, namely, the partitioning of the input-sets into invoking and non-invoking sets. A collection of input-sets is partitioned using feature syntax, a grammar of the program's input annotated with feature names. An input-set is placed in the invoking set if and only if its parse tree is annotated with that feature. WS' technique solely applies set operations on the execution traces of inputs, b, n, m, h, j, k, l, 0.. 0, in our technique, we also apply the set operations among the set of features used by these inputs. By doing so, we can precisely determine the features whose implementation is identified when applying the operations on the execution traces.
Realistic Worst-Case Modeling by Performance Level Principal Component Analysis
Authors: Alessandra Nardi, Andrea Neviani, Carlo Guardiani
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

A new algorithm to determine the number and value of realistic worst-case models for the performance of module library components is presented in this paper. The proposed algorithm employs Principal Components Analysis (PCA) at the performance level to identify the main independent sources of variance for the performance of a set of library modules.Response Surfaces Methodology (RSM) and Propagation Of Variance (POV) based algorithms are used to efficiently compute the performance level covariance matrix and non-linear maximum likelihood optimization to trace back worst case models at the SPICE level. The effectiveness of the proposed methodology has been demonstrated by determining a realistic set of worst case models for a 0.25mm CMOS standard cell library.
The difference between splitting in $n$ and $n+1$
Authors: Rob J. Glabbeek, Frits W. Vaandrager
Venue:  (1995)

It is established that durational and structural aspects of actions can in general not be modeled in interleaving semantics, even when a time-consuming action is represented by a pair of instantaneous events denoting its start and finish. By means of a series of counterexamples it is shown that, for any $n$, it makes a difference whether actions are split in $n$ or in $n+1$ parts.
Self-Stabilizing Smoothing and Counting
Authors: Maurice Herlihy, Srikanta Tirthapura
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

A smoothing network is a distributed data structure thataccepts tokens on input wires and routes them to outputwires. It ensures that however imbalanced the traffic oninput wires, the numbers of tokens emitted on output wiresare approximately balanced.Prior work on smoothing networks always assumed thatsuch networks were properly initialized. In a real distributedsystem, however, network switches may be rebootedor replaced dynamically, and it may not be practical to determinethe correct initial state for the new switch. Prioranalyses do not work under these new assumptions.This paper makes the following contributions. First, weshow that some well-known 1-smoothing networks, knownas counting networks, when started in an arbitrary initialstate (perhaps chosen by an adversary), remain remarkablysmooth, degrading from 1-smooth to log(n)-smooth, wheren is the number of input/output wires.Second, we show that the same networks can be madeeventually 1-smooth by "piggy-backing" a small amount ofadditional information on messages when (and only when)trouble is detected.
Prioritized Dispersal: a Scheme for Selective Exploitation of Redundancy in Distributed Systems
Authors: Yitzhak Birk, Noam Bloch
Venue: Proceedings of the 8th Israeli Conference on Computer-Based Systems and Software Engineering (1997)

In distributed redundant-resource systems such as communication networks with multiple paths between nodes, there is a choice in allocating resources to tasks; this can be used for fault-tolerance, but also in order to improve performance. The allocation, however, is complicated by the fact that system state is not known and changes dynamically. Exploiting redundancy by partitioning a message into several submessages and sending them along with several ``redundant'' submessages along different paths, as is done by dispersal schemes, increases the load, reduces capacity and even increases delay at permissible heavy loads. We present and analyze novel ``prioritized dispersal'' schemes, whereby ``redundant'' submessages receive lower priority than the ``original'' submessages, and show their performance to substantially exceed that of non-prioritized schemes. This extends the beneficial applicability of selective exploitation of redundancy, whose benefits for centralized systems have been established, to distributed systems.