Search

Start Over Subject 23 Date Unknown

11. Maximizing the Bregman divergence from a Bregman family

Creator:
Rauh, Johannes
Format:
print, bez média, and svazek
Type:
model:article and TEXT
Subject:
optimalizace, optimization, exponential family, relative entropy, Bregman divergence, 23, and 007
Language:
English
Description:
The problem to maximize the information divergence from an exponential family is generalized to the setting of Bregman divergences and suitably defined Bregman families., Johannes Rauh., and Obsahuje bibliografické odkazy
Rights:
http://creativecommons.org/publicdomain/mark/1.0/ and policy:public

12. One-adhesive polymatroids

Creator:
Csirmaz, Laszlo
Format:
print, bez média, and svazek
Type:
model:article and TEXT
Subject:
amalgámy, amalgams, polymatroid, entropy function, adhesive polymatroid, polyhedral cone, 23, and 007
Language:
English
Description:
Adhesive polymatroids were defined by F. Matúš motivated by entropy functions. Two polymatroids are adhesive if they can be glued together along their joint part in a modular way; and are one-adhesive, if one of them has a single point outside their intersection. It is shown that two polymatroids are one-adhesive if and only if two closely related polymatroids have joint extension. Using this result, adhesive polymatroid pairs on a five-element set are characterized., Laszlo Csirmaz., and Obsahuje bibliografické odkazy
Rights:
http://creativecommons.org/publicdomain/mark/1.0/ and policy:public

13. Otevřený přístup k vědeckým informacím a politika otevřeného přístupu

Creator:
Martin Lhoták and Iva Burešová
Type:
article, články, model:article, and TEXT
Subject:
Počítačové sítě, open access, vědní politika, akademie věd, scientific policy, academies of science, 23, and 004.7
Language:
Czech
Description:
The phrase open access refers to unrestricted online access to articles published in scholarly journals. Open Access comes in two forms - Gratis versus Libre: Gratis OA is no-cost online access, while Libre OA offers some additional usage rights. is similar to OA, but usually includes the right to modify the work, whereas in scholarly publishing it is customary to keep an article’s content intact by associating it with a specific author. Open access can be offered in two ways: Green OA is provided by authors publishing in any journal and then self-archiving their post prints in their institutional repository or on some other OA website. Green OA journal publishers endorse immediate OA self-archiving by their authors. Gold OA is offered by authors publishing in an that provides immediate OA to all of its articles on the publisher’s website. and Martin Lhoták, Iva Burešová.
Rights:
http://creativecommons.org/publicdomain/mark/1.0/ and policy:public

14. Programy pro zpracování a analýzu kvalitativních dat

Creator:
Čížek, Tomáš
Format:
print, bez média, and svazek
Type:
model:article and TEXT
Subject:
kvalitativní výzkum, analýza dat, počítačové programy, qualitative research, data analysis, computer programs, Audacity (zvukový editor), Transcriber, Express Scribe, Transana, kódování textových souborů, 303.022, 303.7, 004.42, 23, and 004.4/.6
Language:
Czech
Description:
Tomáš Čížek. and 1 obrázek
Rights:
http://creativecommons.org/publicdomain/mark/1.0/ and policy:public

16. Secret sharing schemes for ports of matroids of rank 3

Creator:
Farràs, Oriol
Format:
print, bez média, and svazek
Type:
model:article and TEXT
Subject:
teorie matroidů, matroid theory, secret sharing schemes, matroid ports, 23, and 007
Language:
English
Description:
A secret sharing scheme is ideal if the size of each share is equal to the size of the secret. Brickell and Davenport showed that the access structure of an ideal secret sharing scheme is determined by a matroid. Namely, the minimal authorized subsets of an ideal secret sharing scheme are in correspondence with the circuits of a matroid containing a fixed point. In this case, we say that the access structure is a matroid port. It is known that, for an access structure, being a matroid port is not a sufficient condition to admit an ideal secret sharing scheme. In this work we present a linear secret sharing scheme construction for ports of matroids of rank 3 in which the size of each share is at most nn times the size of the secret. Using the previously known secret sharing constructions, the size of each share was O(n2/logn) the size of the secret. Our construction is extended to ports of matroids of any rank k≥2, obtaining secret sharing schemes in which the size of each share is at most nk-2 times the size of the secret. This work is complemented by presenting lower bounds: There exist matroid ports that require (Fq,ℓ)-linear secret schemes with total information ratio Ω(2n/2/ℓn3/4log⁡q)., Oriol Farràs., and Obsahuje bibliografické odkazy
Rights:
http://creativecommons.org/publicdomain/mark/1.0/ and policy:public

17. Slovenský archív sociálnych dát: možnosti podpory výskumu a slovensko-českej spolupráce v sociologických výskumoch

Creator:
Tížik, Miroslav and Bahna, Miloslav
Format:
print, bez média, and svazek
Type:
model:article and TEXT
Subject:
sociologický výzkum, sociologická data, datové archivy, digitální repozitáře, sociological research, digital archives, archivace dat, archivy sociálních dat, Slovenský archív sociálnych dat, 316:303, 316:004.6, 930.25:004.08, (437.6), 23, and 004.4/.6
Language:
Czech
Description:
Text sa v úvode venuje histórii reprezentatívnych výskumov na Slovensku a v Československu od roku 1948 a na tomto príklade zdôrazňuje dôležitosť archivácie. Neexistencia dátového archívu mala za následok stratu údajov z mnohých výskumov realizovaných pred rokom 1989. Štúdium predstavuje pokusy o založenie dátového archívu na Slovensku a bližšie predstavuje Slovenský archív sociálnych dát (SASD), ktorý je v súčasnosti prevádzkovaný Katedrou sociológie FF UK a Sociologickým ústavom SAV. Relatívne neskorá inštitucionalizácia archívu na Slovensku ponúkla možnosť, archivovať dáta priamo v aktuálnom štandarde DDI. Cieľ SASD - zvyšovať metodologické štandardy výskumov realizovaných na Slovensku, demonštruje text na príkladoch nejednotnosti slovenských prekladov otázok a variantov odpovedí z medzinárodných výskumov, ako aj na príklade nejednotnosti použitých škál. Na záver štúdia predstavuje možnú spoluprácu archívov sociálnych dát v ČR a SR. Jej náplňou by mohla byť archivácia a kompletizácia informácií o výskumoch z obdobia spoločného štátu, prípadne aj tvorba rozdelených dátových súborov reprezentatívnych pre Čechy a Slovensko., Miroslav Tížik, Miloslav Bahna., 5 obrázků, 5 tabulek, and Obsahuje bibliografii
Rights:
http://creativecommons.org/publicdomain/mark/1.0/ and policy:public

19. Violations of the Ingleton inequality and revising the four-atom conjecture

Creator:
Boston, Nigel and Nan, Ting-Ting
Format:
print, bez média, and svazek
Type:
model:article and TEXT
Subject:
kybernetika, cybernetics, information inequalities, entropy vectors, subgroup indices, 23, and 007
Language:
English
Description:
The entropy region is a fundamental object of study in mathematics, statistics, and information theory. On the one hand, it involves pure group theory, governing inequalities satisfied by subgroup indices, whereas on the other hand, computing network coding capacities amounts to a convex optimization over this region. In the case of four random variables, the points in the region that satisfy the Ingleton inequality (corresponding to abelian groups and to linear network codes) form a well-understood polyhedron, and so attention has turned to Ingleton-violating points in the region. How far these points extend is measured by their Ingleton score, where points with positive score are Ingleton-violating. The Four-Atom Conjecture stated that the Ingleton score cannot exceed 0.089373, but this was disproved by Matúš and Csirmaz. In this paper we employ two methods to investigate Ingleton-violating points and thereby produce the currently largest known Ingleton scores. First, we obtain many Ingleton-violating examples from non-abelian groups. Factorizability appears in many of those and is used to propose a systematic way to produce more. Second, we rephrase the problem of maximizing Ingleton score as an optimization question and introduce a new Ingleton score function, which is a limit of Ingleton scores with maximum unchanged. We use group theory to exploit symmetry in these new Ingleton score functions and the relations between them. Our approach yields some large Ingleton scores and, using this methodology, we find that there are entropic points with score 0.09250007770, currently the largest known score., Nigel Boston and Ting-Ting Nan., and Obsahuje bibliografické odkazy
Rights:
http://creativecommons.org/publicdomain/mark/1.0/ and policy:public