in this study, a method for determining the location and extent of myocardial infarction using body surface potential map data that is obtained from physionet challenge 2007 database has been suggested. this data is related to four patients with myocardial infarction that we used from two patients as training set to determine rules, and from two other patients for testing set and the conclusion...

This survey paper is based on the lecture notes for the mini course in the summer school at Yau Mathematics Science Center, Tsinghua University, 2014. We describe and characterize all random subsets K of simply connected domain which satisfy the “conformal restriction” property. There are two different types of random sets: the chordal case and the radial case. In the chordal case, the random s...

We refine the bound on the packing number, originally shown by Haussler, for shallow geometric set systems. Specifically, let V be a finite set system defined over an n-point set X; we view V as a set of indicator vectors over the n-dimensional unit cube. A δ-separated set of V is a subcollection W, s.t. the Hamming distance between each pair u,v ∈ W is greater than δ, where δ > 0 is an integer...

We consider the parameterized complexity of the Unique Coverage problem: given a family of sets and a parameter k, we ask whether there exists a subfamily that covers at least k elements exactly once. This NP-complete problem has applications in wireless networks and radio broadcasting and is also a natural generalization of the well-known Max Cut problem. We show that this problem is fixed-par...

In ‎this ‎paper, ‎we ‎study ‎the ‎relation ‎between ‎the ‎soft ‎sets ‎and ‎soft ‎Lie ‎algebras ‎with ‎the ‎lattice theory. ‎We ‎introduce ‎the ‎concepts ‎of ‎the ‎lattice ‎of ‎soft ‎sets, ‎full ‎soft ‎sets ‎and ‎soft ‎Lie ‎algebras ‎and next, we ‎verify ‎some ‎properties ‎of ‎them. We ‎prove ‎that ‎the ‎lattice ‎of ‎the ‎soft ‎sets ‎on ‎a fixed parameter set is isomorphic to the power set of a ...

Vertex deletion problems are at the heart of parameterized complexity. For a graph class F , the F-Deletion problem takes as input a graph G and an integer k. The question is whether it is possible to delete at most k vertices from G such that the resulting graph belongs to F . Whether Perfect Deletion is fixed-parameter tractable, and whether Chordal Deletion admits a polynomial kernel, when p...

Lifespan in individually housed medflies (virgins of both sexes) and daily reproduction for females were studied following one of 12 dietary restriction (DR) treatments in which the availability of high-quality food (yeast-sugar mixture) for each fly was based on a Markov chain feeding scheme--a stochastic dietary regime which specifies that the future dietary state depends only on the present ...

The assumption of positivity or experimental treatment assignment requires that observed treatment levels vary within confounder strata. This article discusses the positivity assumption in the context of assessing model and parameter-specific identifiability of causal effects. Positivity violations occur when certain subgroups in a sample rarely or never receive some treatments of interest. The...