Filetype
Distributed algorithms for solving coupled semidefinite programs (SDPs) commonly require many iterations to converge. They also put high computational demand on the computational agents. In this paper we show that in case the coupled problem has an inherent tree structure, it is possible to devise an efficient distributed algorithm for solving such problems. The proposed algorithm relies on predic
Cloud computing technology provides the means to share physical resources among multiple users and data center tenants by exposing them as virtual resources. There is a strong industrial drive to use similar technology and concepts to provide timing sensitive services. One such domain is a chain of connected virtual network functions. This allows the capacity of each function to be scaled up and d
Common harmonic oscillator topologies, such as class-B and class-C, are typically unable to meet ultra stringent phase noise requirements, due to the exceedingly large capacitance (and, symmetrically, low inductance) that would be required in the parallel resonator. In this paper, we show that an oscillator making use of series resonators is ideally able to overcome this limitation, with the addit
There is a strong industrial drive to use cloud computing technologies and concepts for providing timing sensitive services in the networking domain since it would provide the means to share the physical resources among multiple users and thus increase the elasticity and reduce the costs. In this work, we develop a mathematical model for user-stateless virtual network functions forming a forwardin
Cloud computing technology provides the means to share physical resources among multiple users and data center ten- ants by exposing them as virtual resources. There is a strong industrial drive to use similar technology and concepts to provide timing sensitive services. One such is virtual net- working services, so called services chains, which consist of several interconnected virtual network fu
Predicting the sign of press perturbation responses in ecological networks is challenging, due to the poor knowledge of the strength of the direct interactions among the species, and to the entangled coexistence of direct and indirect effects. We show in this paper that, for a class of networks that includes mutualistic and monotone networks, the sign of press perturbation responses can be qualita
This paper investigates the topology-independent stability of homogeneous dynamical networks, composed of interconnected equal systems. Precisely, dynamical systems with identical nominal transfer function F(s) are associated with the nodes of a directed graph whose arcs account for their dynamic interactions, described by a common nominal transfer function G(s). It is shown that topology-independ
Evidence of arterial pulse pressure variations caused by cardio-pulmonary interactions, and their connection to volume status via the Frank–Starling relationship, are well documented in the literature. Computation of pulse pressure variations from arterial pressure measurements is complicated by the fact that systolic and diastolic peaks are not evenly spaced in time. A robust, structurally uncomp
The global carbon cycle is an important component of the Earth system and it interacts with the hydrology, energy and nutrient cycles as well as ecosystem dynamics. A better understanding of the global carbon cycle is required for improved projections of climate change including corresponding changes in water and food resources and for the verification of measures to reduce anthropogenic greenhous
There is a strong industrial drive to use cloud computing technologies and concepts for providing timing sensitive services in the networking domain since it would provide the means to share the physical resources among multiple users and thus increase the elasticity and reduce the costs. In this work, we develop a mathematical model for user-stateless virtual network functions forming a forwardin
Operating systems code is often developed according to principles like simplicity, low overhead, and low memory footprint. Schedulers are no exceptions. A scheduler is usually developed with flexibility in mind, and this restricts the ability to provide real-time guarantees. Moreover, even when schedulers can provide real-time guarantees, it is unlikely that these guarantees are properly quantifie
Level crossing sampling (LCS) is a power-efficient analog-to-digital conversion scheme for spikelike signals that arise in many Internet of Things-enabled automotive and environmental monitoring applications. However, LCS scheme requires a dedicated time-to-digital converter with large dynamic range specifications. In this paper, we present a compressed LCS that exploits the signal sparsity in the
This brief presents an on-chip memory subsystem for massive multiple-input-multiple-output (MIMO) baseband processing at the base station. In massive MIMO systems, the required memory bandwidth and capacity are orders of magnitude higher than those used in conventional wireless systems, due to the large number of serving antennas. These are further combined with design targets on low access latenc
We develop a simple routine unifying the analysis of several important recently-developed stochastic optimization methods including SAGA, Finito, and stochastic dual coordinate ascent (SDCA). First, we show an intrinsic connection between stochastic optimization methods and dynamic jump systems, and propose a general jump system model for stochastic optimization methods. Our proposed model recover
We consider the problem of finding an event-based sampling scheme that optimizes the trade-off between average sampling rate and control performance in a linear-quadratic-Gaussian (LQG) control problem setting with output feedback. Our analysis is based on a recently presented sampled-data controller structure, which remains LQG-optimal for any choice of sampling scheme. We show that optimization
Resilience has become a key aspect in the design of contemporary infrastructure networks. This comes as a result of ever-increasing loads, limited physical capacity, and fast-growing levels of interconnectedness and complexity due to the recent technological advancements. The problem has motivated a considerable amount of research within the last few years, particularly focused on the dynamical as
Application performance on these processor array platforms is highly sensitive to how functionality is physically placed on the device, as this choice crucially determines communication latencies and congestion patterns of the on-chip inter-core communication. The problem of identifying the best, or just a good enough, partitioning and placement does not, in general, admit to an analytic solution,
This paper presents the mathematical conditions and the associated design methodology of an active fault diagnosis technique for continuous-time linear systems. Given a set of faults known a priori, the system is modeled by a finite family of linear time-invariant systems, accounting for one healthy and several faulty configurations. By assuming bounded disturbances and using a residual generator,
