The Lewy extension theorem asserts the holomorphic extendability of CR functions defined in a neighborhood of a point on a hypersurface in C. The edge-of-the-wedge theorem asserts the extendability of holomorphic functions defined in wedges in C with edge a maximally real submanifold. In this article we prove under suitable hypotheses the holomorphic extendability to an open set in C of CR func...

This paper introduces a method which provides robust tracking results and accurately segmented object boundaries in short computation time. The first step of the algorithm is to apply a novel edge detector on efficiently calculated color probability maps in an object-specific Fisher color space. The proposed edge detector exploits context information by finding the maximally stable boundaries o...

purpose this study was performed to introduce and evaluate the potential of kinematic magnetic resonance imaging (kmri) using a high-field open-magnet magnetic resonance (mr) system. methods we attempted to perform kmri of healthy volunteers’ lumbar spine and knee in the lateral position and ankle in the supine position utilizing the superconducting, horizontally opened, 1.2 t mr system (oasis,...

Although people use critical, redundant and ordinary categories to concisely distinguish the importance of edges in maintaining the controllability of networks in linear timeinvariant (LTI) model, a specific network analysis is still uncertain to confirm edges of each category and guide further edge protection. Given a large, sparse, Erdős-Rényi random digraph that is in LTI model and has a kno...

Correlations that violate a Bell inequality are said to be nonlocal; i.e., they do not admit a local and deterministic explanation. Great effort has been devoted to study how the amount of nonlocality (as measured by a Bell inequality violation) serves to quantify the amount of randomness present in observed correlations. In this work we reverse this research program and ask what do the randomn...

A connected digraph of minimum degree δ is said to be maximally connected if the cardinality of every cutset is al least δ, and it is called superconnected if moreover every minimum disconnecting set F consists of the vertices adjacent to or from a given vertex not belonging to F . Let π be an integer, 0 ≤ π ≤ δ − 2, δ being the minimum degree of the digraph. In this work, we prove that if D ≤ ...

A Right Angle Crossing Graph (also called RAC graph for short) is a graph that has a straight-line drawing where any two crossing edges are orthogonal to each other. A 1-planar graph is a graph that has a drawing where every edge is crossed at most once. We study the relationship between RAC graphs and 1-planar graphs in the extremal case that the RAC graphs have as many edges as possible. It i...

For the complex short time-varying signals, a highorder predictor does not always yield good performance. For this, we investigate the use of a short-order adaptive predictor. Since the maximally flat filters are the optimal predictors for polynomial signal prediction, the adaptation is based on the combination of a set of maximally flat filters. For compression efficiency, the dynamic ranges o...