Node (circuits)

Abstract: It is shown that a singularity occurs in isoparametric finite elements if the mid-side nodes are moved sufficiently from their normal position. By choosing the mid-side node positions on standard isoparametric elements so that the singularity occurs exactly at the corner of an element it is possible to obtain quite accurate solutions to the problem of determining the stress intensity at the tip of a crack. The solutions compare favourably with those obtained using some types of special crack tip elements, but are not as accurate as those given by a crack tip element based on the hybrid principle. However, the hybrid elements are more difficult to use.

Abstract: Most event-triggered controllers available nowadays are based on static state-feedback controllers. As in many control applications full state measurements are not available for feedback, it is the objective of this paper to propose event-triggered dynamical output-based controllers. The fact that the controller is based on output feedback instead of state feedback does not allow for straightforward extensions of existing event-triggering mechanisms if a minimum time between two subsequent events has to be guaranteed. Furthermore, since sensor and actuator nodes can be physically distributed, centralized event-triggering mechanisms are often prohibitive and, therefore, we will propose a decentralized event-triggering mechanism. This event-triggering mechanism invokes transmission of the outputs in a node when the difference between the current values of the outputs in the node and their previously transmitted values becomes “large” compared to the current values and an additional threshold. For such event-triggering mechanisms, we will study closed-loop stability and L∞-performance and provide bounds on the minimum time between two subsequent events generated by each node, the so-called inter-event time of a node. This enables us to make tradeoffs between closed-loop performance on the one hand and communication load on the other hand, or even between the communication load of individual nodes. In addition, we will model the event-triggered control system using an impulsive model, which truly describes the behavior of the event-triggered control system. As a result, we will be able to guarantee stability and performance for event-triggered controllers with larger minimum inter-event times than the existing results in the literature. We illustrate the developed theory using three numerical examples.

Abstract: Regenerating codes are a class of distributed storage codes that optimally trade the bandwidth needed for repair of a failed node with the amount of data stored per node of the network. Minimum Storage Regenerating (MSR) codes minimize first, the amount of data stored per node, and then the repair bandwidth, while Minimum Bandwidth Regenerating (MBR) codes carry out the minimization in the reverse order. An [n, k, d] regenerating code permits the data to be recovered by connecting to any k of the n nodes in the network, while requiring that repair of a failed node be made possible by connecting (using links of lesser capacity) to any d nodes. Previous, explicit and general constructions of exact-regenerating codes have been confined to the case n=d+1. In this paper, we present optimal, explicit constructions of MBR codes for all feasible values of [n, k, d] and MSR codes for all [n, k, d >= 2k-2], using a product-matrix framework. The particular product-matrix nature of the constructions is shown to significantly simplify system operation. To the best of our knowledge, these are the first constructions of exact-regenerating codes that allow the number n of nodes in the distributed storage network, to be chosen independent of the other parameters. The paper also contains a simpler description, in the product-matrix framework, of a previously constructed MSR code in which the parameter d satisfies [n=d+1, k, d >= 2k-1].