The identification and description of point sources is one the oldest problems in astronomy; yet, even today correct statistical treatment for remains field's hardest problems. For dim or crowded sources, likelihood based inference methods are required to estimate uncertainty on characteristics source population. In this work, a new parametric constructed problem using Compound Poisson Generato...

Abstract The high increase in the use of graph databases also for business- and privacy-critical applications demands a sophisticated, flexible, fine-grained authorization access control (AC) approach. Attribute-based (ABAC) supports definition rules policies. Attributes can be associated with subject, requested resource action, but environment. Thus, this is promising starting point. However, ...

Graph editing problems have a long history and have been widely studied [35, 53] , with applications in biochemistry [23] and complex network analysis [5]. They generally ask whether an input graph can be modified by inserting and deleting vertices and edges to a graph with the desired property [5, 22]. We consider the problem Graph-Editto-NDL (GEN) where the goal is to modify to a graph with a...

The optimization problem for a stopped Markov decision process is considered to be taken over stopping times constrained so that E 5 for some xed > 0. We introduce the concept of a randomized stationary stopping time which is a mixed extension of the entry time of a stopping region and prove the existence of an optimal constrained pair of stationary policy and stopping time by utilizing a Lagra...

We consider the implications for optimal fiscal policy when taxes are non-distortionary and households are heterogeneous and borrowing constrained. The main result is that optimal policy keeps some households borrowing constrained in order to reduce interest rates on government debt. © 2016 Elsevier B.V. All rights reserved.

To prevent an exploit, the security analyst must implement a suitable countermeasure. In this paper, we consider cost-sensitive attack graphs (CAGs) for network vulnerability analysis. In these attack graphs, a weight is assigned to each countermeasure to represent the cost of its implementation. There may be multiple countermeasures with different weights for preventing a single exploit. Also,...