Bayesian estimate of system availability for consecutive k-out-of-n:F system

In the efficient design and functionality of complex systems, redundancy problems in systems play a key role. The consecutive-k-out-of-n:F structure, which has broad application in street light arrangements, vacuum systems in an accelerator, sliding window detection, relay stations for a communication system. Availability is one of the significant measures for a maintained device because availability accounts for the repair capability. A very significant feature is the steady-state availability of a repairable device. For the repairable consecutive k-out-of-n:F system with independent and identically distributed components, the Bayesian point estimate (B.P.E) of steady-state availability under squared error loss function (SELF) and confidence interval are obtained.

Spherical Distributions Used in Evolutionary Algorithms

Performance of evolutionary algorithms in real space is evaluated by local measures such as success probability and expected progress. In high-dimensional landscapes, most algorithms rely on the normal multi-variate, easy to assemble from independent, identically distributed components. This paper analyzes a different distribution, also spherical, yet with dependent components and compact support: uniform in the sphere. Under a simple setting of the parameters, two algorithms are compared on a quadratic fitness function. The success probability and the expected progress of the algorithm with uniform distribution are proved to dominate their normal mutation counterparts by order n!!.

Graphic modeling in Distributed Autonomous and Asynchronous Automata (DA3)

Automated verification of distributed systems becomes very important in distributed computing. The graphical insight into the system in the early and late stages of the project is essential. In the design phase, the visual input helps to articulate the collaborative distributed components clearly. The formal verification gives evidence of correctness or malfunction, but in the latter case, graphical simulation of counterexample helps for better understanding design errors. For these purposes, we invented Distributed Autonomous and Asynchronous Automata (DA3), which have the same semantics as the formal verification base—Integrated Model of Distributed Systems (IMDS). The IMDS model reflects the natural characteristics of distributed systems: unicasting, locality, autonomy, and asynchrony. Distributed automata have all of these features because they share the same semantics as IMDS. In formalism, the unified system definition has two views: the server view of the cooperating distributed nodes and the agent view of the migrating agents performing distributed computations. The automata have two formally equivalent forms that reflect two views: Server DA3 for observing servers exchanging messages, and Agent DA3 for tracking agents, which visit individual servers in their progress of distributed calculations. We present the DA3 formulation based on the IMDS formalism and their application to design and verify distributed systems in the Dedan environment. DA3 formalism is compared with other concepts of distributed automata known from the literature.

Further Results of the TTT Transform Ordering of Order n

To compare the variability of two random variables, we can use a partial order relation defined on a distribution class, which contains the anti-symmetry. Recently, Nair et al. studied the properties of total time on test (TTT) transforms of order n and examined their applications in reliability analysis. Based on the TTT transform functions of order n, they proposed a new stochastic order, the TTT transform ordering of order n (TTT-n), and discussed the implications of order TTT-n. The aim of the present study is to consider the closure and reversed closure of the TTT-n ordering. We examine some characterizations of the TTT-n ordering, and obtain the closure and reversed closure properties of this new stochastic order under several reliability operations. Preservation results of this order in several stochastic models are investigated. The closure and reversed closure properties of the TTT-n ordering for coherent systems with dependent and identically distributed components are also obtained.

Flygenvectors: The spatial and temporal structure of neural activity across the fly brain

What are the spatial and temporal scales of brainwide neuronal activity, and how do activities at different scales interact? We used SCAPE microscopy to image a large fraction of the central brain of adult Drosophila melanogaster with high spatiotemporal resolution while flies engaged in a variety of behaviors, including running, grooming and flailing. This revealed neural representations of behavior on multiple spatial and temporal scales. The activity of most neurons across the brain correlated (or, in some cases, anticorrelated) with running and flailing over timescales that ranged from seconds to almost a minute. Grooming elicited a much weaker global response. Although these behaviors accounted for a large fraction of neural activity, residual activity not directly correlated with behavior was high dimensional. Many dimensions of the residual activity reflect the activity of small clusters of spatially organized neurons that may correspond to genetically defined cell types. These clusters participate in the global dynamics, indicating that neural activity reflects a combination of local and broadly distributed components. This suggests that microcircuits with highly specified functions are provided with knowledge of the larger context in which they operate, conferring a useful balance of specificity and flexibility.

Ordering and aging properties of systems with dependent components governed by the Archimedean copula

Copula is one of the widely used techniques to describe the dependency structure between components of a system. Among all existing copulas, the family of Archimedean copulas is the popular one due to its wide range of capturing the dependency structures. In this paper, we consider the systems that are formed by dependent and identically distributed components, where the dependency structures are described by Archimedean copulas. We study some stochastic comparisons results for series, parallel, and general $r$ -out-of- $n$ systems. Furthermore, we investigate whether a system of used components performs better than a used system with respect to different stochastic orders. Furthermore, some aging properties of these systems have been studied. Finally, some numerical examples are given to illustrate the proposed results.

Secure and Privacy-Respecting Documentation for Interactive Manufacturing and Quality Assurance

The automated documentation of work steps is a requirement of many modern manufacturing processes. Especially when it comes to important procedures such as safety critical screw connections or weld seams, the correct and complete execution of certain manufacturing steps needs to be properly supervised, e.g., by capturing video snippets of the worker to be checked in hindsight. Without proper technical and organizational safeguards, such documentation data carries the potential for covert performance monitoring to the disadvantage of employees. Naïve documentation architectures interfere with data protection requirements, and thus cannot expect acceptance of employees. In this paper we outline use cases for automated documentation and describe an exemplary system architecture of a workflow recognition and documentation system. We derive privacy protection goals that we address with a suitable security architecture based on hybrid encryption, secret-sharing among multiple parties and remote attestation of the system to prevent manipulation. We finally contribute an outlook towards problems and possible solutions with regards to information that can leak through accessible metadata and with regard to more modular system architectures, where more sophisticated remote attestation approaches are needed to ensure the integrity of distributed components.

The Logical Timestamp Skew Anomaly in Event-Replicated Transaction Schedulers

To sidestep reasoning about the complex effects of concurrent execution, many system designers have conveniently embraced strict serializability on the strength of its claims, support from commercial and open-source database communities and ubiquitous levels of industry adoption. Crucially, distributed components are built on this model; multiple schedulers are composed in an event-driven architecture to form larger, ostensibly correct systems. This paper examines the oft-misconstrued position of strict serializability as a composable correctness criterion in the design of such systems. An anomaly is presented wherein a strict serializable scheduler in one system produces a history that cannot be serially applied to even a weak prefix-consistent replica in logical timestamp order. Several solutions are presented under varying isolation properties, including novel isolation properties contributed by this paper. We also distinguish between concurrent schedulers based on their propensity to produce deterministic histories. It is further shown that every nondeterministic scheduler is anomaly-prone, every nonconcurrent scheduler is anomaly-free, and that at least one deterministic concurrent scheduler is anomaly-free.

The Logical Timestamp Skew Anomaly in Event-Replicated Transaction Schedulers

To sidestep reasoning about the complex effects of concurrent execution, many system designers have conveniently embraced strict serializability on the strength of its claims, support from commercial and open-source database communities and ubiquitous levels of industry adoption. Crucially, distributed components are built on this model; multiple schedulers are composed in an event-driven architecture to form larger, ostensibly correct systems. This paper examines the oft-misconstrued position of strict serializability as a composable correctness criterion in the design of such systems. An anomaly is presented wherein a strict serializable scheduler in one system produces a history that cannot be serially applied to even a weak prefix-consistent replica in logical timestamp order. Several solutions are presented under varying isolation properties, including novel isolation properties contributed by this paper. We also distinguish between concurrent schedulers based on their propensity to produce deterministic histories. It is further shown that every nondeterministic scheduler is anomaly-prone, every nonconcurrent scheduler is anomaly-free, and that at least one deterministic concurrent scheduler is anomaly-free.