In this paper, we obtain some general results on information retrieval from the black hole interior, based recent progress quantum extremal surface formula and entanglement island. We study an AdS coupled to a bath with generic dynamics, ask whether it is possible retrieve about small perturbation in interior system. derive state reconstruction one norm. However, show that contradiction arises ...

We calculate genus distribution formulas for several families of ring-like graphs and prove that they are log-concave. The graphs in each of our ring-like families are obtained by applying the self-bar-amalgamation operation to the graphs in a linear family (linear in the sense of Stahl). That is, we join the two root-vertices of each graph in the linear family. Although log-concavity has been ...

The possibilities of exploiting the special structure of d.c. programs, which consist of optimizing the difference of convex functions, are currently more or less limited to variants of the DCA proposed by Pham Dinh Tao and Le Thi Hoai An in 1997. These assume that either the convex or the concave part, or both, are evaluated by one of their subgradients. In this paper we propose an algorithm w...

We present an algorithm for a pair of pursuers, each with one flashlight, searching for an unpredictable, moving target in a 2D environment (simple polygon). Given a polygon with n edges and m concave regions, the algorithm decides in time O(n + nm + m) whether the polygon can be cleared by the two 1-searchers, and if so, constructs a search schedule. The pursuers are allowed to move on the bou...

Abstract: An interior point method for solving nonlinear multiobjective programming problems, over a convex set contained in the real space R, has been developed in this paper. In this method a new strictly concave logarithmic barrier function has been suggested in order to transform the orginal problem into a sequence of unconstrained subproblems. These subproblems can be solved using Newton m...

Computed Atlas of Surface Topography of proteins (CASTp) provides an online resource for locating, delineating and measuring concave surface regions on three-dimensional structures of proteins. These include pockets located on protein surfaces and voids buried in the interior of proteins. The measurement includes the area and volume of pocket or void by solvent accessible surface model (Richard...

10 One of the earliest and most well known problems in computational geometry is 11 the so-called art gallery problem. The goal is to compute the minimum number of 12 guards needed to cover the interior of any polygon with n vertices; the guards are 13 to be placed on the vertices of the polygon. We consider the problem of guarding an 14 art gallery which is modeled as a polygon with curvilinea...

Selfdual variational theory – developed in [7] and [8] – allows for the superposition of appropriate boundary Lagrangians with “interior” Lagrangians, leading to a variational formulation and resolution of problems with various linear and nonlinear boundary constraints that are not amenable to standard Euler-Lagrange theory. The superposition of several selfdual Lagrangians is also possible in ...

There have been many research developments on the conceptual description of topological relations between spatial objects. In order to practically implement these conceptual topological relations in a computer environment, we need to calculate the values of the topological relations. One of the theoretical bases for doing this is a computational fuzzy topology, which is the research focus of th...

In this paper we deal with Robin and Neumann parametric elliptic equations driven by a nonhomogeneous differential operator and with a reaction that exhibits competing nonlinearities (concave-convex nonlinearities). For the Robin problem and without employing the Ambrosetti-Rabinowitz condition, we prove a bifurcation theorem for the positive solutions for small values of the parameter λ > 0. F...