#### Filter Results:

- Full text PDF available (6)

#### Publication Year

2009

2017

- This year (1)
- Last 5 years (6)
- Last 10 years (7)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Yuri M. Suhov, Izabella Stuhl, Salimeh Yasaei Sekeh, Mark Kelbert
- ArXiv
- 2015

A number of simple inequalities for the weighted entropies is proposed, mirroring properties of a standard (Shannon) entropy and related quantities. 1 The weighted Gibbs inequality and its consequences The definition and initial results on weighted entropy were introduced in [1, 14]. Further progress was made, subsequently, in [27, 9, 17, 26, 28, 34, 18],… (More)

- Yuri M. Suhov, Salimeh Yasaei Sekeh, Izabella Stuhl
- ArXiv
- 2015

We produce a series of results extending information-theoretical inequalities (discussed by Dembo–Cover–Thomas in 1989-1991) to a weighted version of entropy. The resulting inequalities involve the Gaussian weighted entropy; they imply a number of new relations for determinants of positive-definite matrices.

- Karl Strambach, Izabella Stuhl
- Discrete Mathematics
- 2009

- Yuri M. Suhov, Izabella Stuhl
- ArXiv
- 2016

The weighted entropy Hw φ (X) = H w φ (f) of a random variable X with values x and a probability-mass/density function f is defined as the mean value EIw φ (X) of the weighted information Iw φ (x) = −φ(x) log f(x). Here x 7→ φ(x) ∈ R is a given weight function (WF) indicating a ’value’ of outcome x. For an n-component random vector X 0 = (X0, . . . ,Xn−1)… (More)

- Mauro César Cafundó Morais, Izabella Stuhl, +6 authors Alexandre F Ramos
- Scientific reports
- 2017

Contact inhibition is a central feature orchestrating cell proliferation in culture experiments; its loss is associated with malignant transformation and tumorigenesis. We performed a co-culture experiment with human metastatic melanoma cell line (SKMEL- 147) and immortalized keratinocyte cells (HaCaT). After 8 days a spatial pattern was detected,… (More)

- Yuri M. Suhov, Izabella Stuhl
- ArXiv
- 2016

The Shannon Noiseless coding theorem (the data-compression principle) asserts that for an information source with an alphabet X = {0, . . . , ` − 1} and an asymptotic equipartition property, one can reduce the number of stored strings (x0, . . . , xn−1) ∈ X n to `nh with an arbitrary small error-probability. Here h is the entropy rate of the source… (More)

- Charles J. Colbourn, Maria De Lourdes Merlini Giuliani, Alexander Rosa, Izabella Stuhl
- Australasian J. Combinatorics
- 2015

A loop satisfies Moufang’s theorem whenever the subloop generated by three associating elements is a group. Moufang loops (loops that satisfy the Moufang identities) satisfy Moufang’s theorem, but it is possible for a loop that is not Moufang to nevertheless satisfy Moufang’s theorem. Steiner loops that are not Moufang loops are known to arise from Steiner… (More)

- ‹
- 1
- ›