相关论文: Resilient and Survivable Ring Star Problems
We consider the problem of covering hypersphere by a set of spherical hypercaps. This sort of problem has numerous practical applications such as error correcting codes and reverse k-nearest neighbor problem. Using the reduction of non…
In this paper we extend the notion of {\em locally repairable} codes to {\em secret sharing} schemes. The main problem that we consider is to find optimal ways to distribute shares of a secret among a set of storage-nodes (participants)…
We present a set of integer programs (IPs) for the Steiner tree problem with the property that the best solution obtained by solving all, provides an optimal Steiner tree. Each IP is polynomial in the size of the underlying graph and our…
We consider the possibility of the existence of a stable massive charged particle by a minimal extension of the standard model particle content. Absolute stability in the case of singly charged particle is not possible if the usual doublet…
This paper develops a novel numerical method for obtaining structures of rapidly rotating stars based on a self-consistent field scheme. The solution is obtained iteratively. Both rapidly rotating barotropic and baroclinic equilibrium…
A hybrid network is a static (electronic) network that is augmented with optical switches. The Reconfigurable Routing Problem (RRP) in hybrid networks is the problem of finding settings for the optical switches augmenting a static network…
A (control) network over a finite ring is proposed. Using semi-tensor product (STP) of matrices, a set of algebraic equations are provided to verify whether a finite set with two binary operators is a ring. It is then shown that the…
We develop a Lagrangian perturbation framework for rotating non-relativistic superfluid neutron stars. This leads to the first generalization of classic work on the stability properties of rotating stars to models which account for the…
The problem of searchability in decentralized complex networks is of great importance in computer science, economy and sociology. We present a formalism that is able to cope simultaneously with the problem of search and the congestion…
A classical question in PL topology, asked among others by Hudson, Lickorish, and Kirby, is whether every linear subdivision of the d-simplex is simplicially collapsible. The answer is known to be positive for d<4. We solve the problem up…
Recoverable robust optimization is a popular multi-stage approach, in which it is possible to adjust a first-stage solution after the uncertain cost scenario is revealed. We consider recoverable robust optimization in combination with…
We introduce an extension of decision problems called resiliency problems. In resiliency problems, the goal is to decide whether an instance remains positive after any (appropriately defined) perturbation has been applied to it. To tackle…
It is known that receding horizon control with a strictly pre-dissipative optimal control problem yields a practically asymptotically stable closed loop when suitable state constraints are imposed. In this note we show that alternatively…
More and more applications that require high reliability and fault tolerance are realized with wireless network architectures and thus ultimately rely on the wireless channels, which can be subject to impairments and blockages. Hence, these…
In the real world, the stable operation of a network is usually inseparable from the mutual support of other networks. In such an interdependent network, a node in one layer may depend on multiple nodes in another layer, forming a complex…
In this paper we develop the new semi-analitical model of a tidally perturbed or tidally disrupted star proposed recently by two of us. This model is effectively a one dimensional Lagrangian model and it can be evolved numerically much…
The Internet is emerging as the new universal telecommunication medium. IP over WDM has been envisioned as one of the most attractive architectures for the new Internet. Consequently survivability is a crucial concern in designing IP over…
Distributed Hash Tables offer a resilient lookup service for unstable distributed environments. Resilient data storage, however, requires additional data replication and maintenance algorithms. These algorithms can have an impact on both…
We show that the finite time blow up solutions for the co-rotational Wave Maps problem constructed in [7,15] are stable under suitably small perturbations within the co-rotational class, provided the scaling parameter $\lambda(t) =…
The aim of this article is to propose a model, that is a planar version of the Full Two-Body Problem, and discuss the existence and stability of a relevant periodic solution. Consider two homogeneous ellipsoids orbiting around each other in…