We propose a new characterization of inner and outer bounds of some network information theoretic regions in terms of upper concave envelopes of certain functions of mutual information. While this characterization is related to the characterization using auxiliary random variables, it is shown that the new characterization can make computations of boundary points much simpler. Further this repr...

A bi-macrocycle with an incorporated isophthalamide substructure was synthesized by double amide formation between an isophthaloyl dichloride and two equivalents of a bis(alkenyloxy)aniline, followed by ring-closing metathesis and hydrogenation. In contrast to many related isophthalamides, the concave host exhibits a better binding for oxides, such as DMSO or pyridine-N-oxide, than for halide a...

In this paper, under the condition that $K$ is concave, we characterize lacunary series in $Q_{k}$ spaces. We improve a result due to H. Wulan and K. Zhu.

Let [Formula: see text] be a triangular array of numbers. We say that [Formula: see text] is skew log-concave if for any fixed n, the sequence [Formula: see text] is log-concave. In this paper, we show that the Boros-Moll sequences are almost skew log-concave.

BACKGROUND Understanding the fundamental mechanisms underlying the cellular response to topographical surface features will extend our knowledge regarding the regulation of cell functions. Analyzing the cellular response to different topographical features, over multiple temporal and spatial scales, is central to understanding and guiding several biological functions. We used micropatterned sub...

We use the merit function technique to formulate a linearly constrained bilevel convex quadratic problem as a convex program with an additional convex-d.c. constraint. To solve the latter problem we approximate it by convex programs with an additional convex-concave constraint using an adaptive simplicial subdivision. This approximation leads to a branch-and-bound algorithm for finding a global...

Sibson’s interpolant uses Voronoi diagrams in the plane to interpolate a set of scattered data points. This paper presents an extension of this method to handle the interpolation of a set of functional curves (transfinite surface interpolation). We derive a simple formula for this new surface type which can interpolate to any number of boundary curves. In addition, a unique surface may be creat...

In the framework of Virtual CMM [1], virtual parts are proposed to be constructed as triangulated surface models. This paper presents a novel surface reconstruction method to the creation of virtual parts. It is based on the idea of identification and sculpting of concave regions of a Delaunay triangulation of the sample data. The proposed algorithm is capable of handling the reconstruction of ...

The aim of this paper is to offer a faster and more rigorous way for calculating the Beta-Shape. The Beta-Shape is a tight-fitting concave polygonal contour, similar to the Alpha Shape, but which remains connected when data points are farther away than the desired resolution. The proposed method uses a computational geometry approach. We also propose an improvement to the original Beta Shape, a...

We consider preemptive machine scheduling problems on identical parallel machines. It is shown that every such problem with chain-like precedence constraints, release dates and a regular unit-concave objective function has the following integer preemption property : for any problem instance with integral input data there exists an optimal schedule where all interruptions (as well as starting an...