Future, large-scale, exoplanet direct-imaging missions will be capable of discovering and characterizing Earth-like exoplanets. These mission designs can evaluated using completeness, the fraction planets from some population that are detectable by a telescope at an arbitrary observation time. However, original formulation completeness uses instrument visibility limits ignores additional integr...

An oriented graph −→ G is said weak (resp. strong) if, for every pair {u, v} of vertices of −→ G , there are directed paths joining u and v in either direction (resp. both directions). In case, for every pair of vertices, some of these directed paths have length at most k, we call −→ G k-weak (resp. k-strong). We consider several problems asking whether an undirected graph G admits orientations...

Piecemeal endoscopic mucosal resection (EMR) is generally indicated for laterally spreading tumors (LST) >2 cm in diameter. However, the segmentation of adenomatous parts does not affect the histopathological diagnosis and completeness of cure. Thus, possible indications for piecemeal EMR are both adenomatous homogenous-type granular-type LST (LST-G) and LST-G as carcinoma in adenoma without se...

The governing equation is ut= a x ux x, 0 x 1, t 0, u x ,0 =0, u 0, t =0, a 1 u 1, t = f t . The extra data are u 1, t =g t . It is assumed that a x is a piecewise-constant function and f 0. It is proved that the function a x is uniquely defined by the above data. No restrictions on the number of discontinuity points of a x and on their locations are made. The number of discontinuity points is ...

The network-diversion problem (ND) is defined on a directed or undirected graph G = (V , E ) having nonnegative edge weights, a source vertex s, a sink vertex t , and a “diversion edge” e ′. This problem, with intelligence-gathering and war-fighting applications, seeks a minimum-weight, minimal s-t cut EC ⊆ E in G such that e ′ ∈ EC . We present (a) a new NP-completeness proof for ND on directe...

We introduce autonomous gossiping (A/G), a new genre epidemic algorithm for selective dissemination of information in contrast to previous usage of epidemic algorithms which flood the whole network. A/G is a paradigm which suits well in a mobile ad-hoc networking (MANET) environment because it does not require any infrastructure or middleware like multicast tree and (un)subscription maintenance...

Given two graphs G and H as input, the Induced Subgraph Isomorphism (ISI) problem is to decide whether G has an induced subgraph that is isomorphic to H. This problem is NP-complete already when G and H are restricted to disjoint unions of paths, and consequently also NP-complete on proper interval graphs and on bipartite permutation graphs. We show that ISI can be solved in polynomial time on ...