Grandpa

Documentary.Author biography: Lu Olkowski is a contributing producer to Studio 360 with Kurt Anderson. Her work has also been heard on All Things Considered, Day to Day, Radio Lab, This American Life, and Weekend America. She has been honored by the American Women in Radio & Television; The Missouri Review; and the Third Coast International Audio Festival. Prior to a career in public radio, Lu was a creative director at Nickelodeon where she led a team of producers in exploring new ways of storytelling by using emerging technologies. [2010]"On this Missouri Review podcast, we present the first place winner in the Documentary category of our 2007 Audio Competition. Lu Olkowski, in her documentary 'Grandpa,' looks at the Zagar family and how they deal with death. A father and son have a contest to take the best photos of their dying father/grandpa. The result is an up-close portrait of death. Olkowski is a regular contributor to Studio 360. Her work has also appeared on All Things Considered, Day to Day, This American Life and Weekend America. 'Grandpa' appeared on WNYC's program Radio Lab."--Publisher's Web site

Consensus in Networks Prone to Link Failures

We consider deterministic distributed algorithms solving Consensus in synchronous networks of arbitrary topologies. Links are prone to failures. Agreement is understood as holding in each connected component of a network obtained by removing faulty links. We introduce the concept of stretch, which is a function of the number of connected components of a network and their respective diameters. Fast and early-stopping algorithms solving Consensus are defined by referring to stretch resulting in removing faulty links. We develop algorithms that rely only on nodes knowing their own names and the ability to associate communication with local ports. A network has $n$ nodes and it starts with $m$ functional links. We give a general algorithm operating in time $n$ that uses messages of $O(\log n)$ bits. If we additionally restrict executions to be subject to a bound $\Lambda$ on stretch, then there is a fast algorithm solving Consensus in time $O(\Lambda)$ using messages of $O(\log n)$ bits. Let $\lambda$ be an unknown stretch occurring in an execution; we give an algorithm working in time $(\lambda+2)^3$ and using messages of $O(n\log n)$ bits. We show that Consensus can be solved in the optimal $O(\lambda)$ time, but at the cost of increasing message size to $O(m\log n)$. We also demonstrate how to solve Consensus by an algorithm that uses only $O(n)$ non-faulty links and works in time $O(n m)$, while nodes start with their ports mapped to neighbors and messages carry $O(m\log n)$ bits. We prove lower bounds on performance of Consensus solutions that refer to parameters of evolving network topologies and the knowledge available to nodes

Fast Agreement in Networks with Byzantine Nodes

We study Consensus in synchronous networks with arbitrary connected topologies. Nodes may be faulty, in the sense of either Byzantine or proneness to crashing. Let t denote a known upper bound on the number of faulty nodes, and D_s denote a maximum diameter of a network obtained by removing up to s nodes, assuming the network is (s+1)-connected. We give an algorithm for Consensus running in time t + D_{2t} with nodes subject to Byzantine faults. We show that, for any algorithm solving Consensus for Byzantine nodes, there is a network G and an execution of the algorithm on this network that takes ?(t + D_{2t}) rounds. We give an algorithm solving Consensus in t + D_{t} communication rounds with Byzantine nodes using authenticated messages of polynomial size. We show that for any numbers t and d > 4, there exists a network G and an algorithm solving Consensus with Byzantine nodes using authenticated messages in fewer than t + 3 rounds on G, but all algorithms solving Consensus without message authentication require at least t + d rounds on G. This separates Consensus with Byzantine nodes from Consensus with Byzantine nodes using message authentication, with respect to asymptotic time performance in networks of arbitrary connected topologies, which is unlike complete networks. Let f denote the number of failures actually occurring in an execution and unknown to the nodes. We develop an algorithm solving Consensus against crash failures and running in time ?(f + D_{f}), assuming only that nodes know their names and can differentiate among ports; this algorithm is also communication-efficient, by using messages of size ?(mlog n), where n is the number of nodes and m is the number of edges. We give a lower bound t+D_t-2 on the running time of any deterministic solution to Consensus in (t+1)-connected networks, if t nodes may crash

STRUGGLE FOR THE SO-CALLED RECLAMATION OF CULTURAL GOODS IN VILNIUS AFTER WORLD WAR II

The article describes the so-called requisition campaign carried out in Vilnius city and region and Kaunas, Lithuania, the aim of which was to recover the cultural heritage which was supposed to stay abroad as a result of the change of borders after World War II for the Polish State and its citizens People connected with the Cultural Department established by the Polish Committee of National Liberation in 1944 at the Office of the Chief Plenipotentiary for Evacuation in the Lithuanian Soviet Socialist Republic. The Cultural Department carried out this activity under the Agreement between the Polish Committee of National Liberation and the Government of the Lithuanian Soviet Socialist Republic regarding the evacuation of Polish citizens from Soviet Lithuania and Lithuanian citizens from Poland concerning the mutual repatriation of peoples. The article aims to recall the private collections and most important cultural institutions in Vilnius from the period before 1939 which failed to be transported from Vilnius to Poland, despite the great efforts of many people. However, regardless of the result, the actions described and those who conducted them deserve to be recalled and mentioned in the subject-matter literature

Planejamento da licitação de obras públicas de edificação e saneamento

- Divulgação dos SUMÁRIOS das obras recentemente incorporadas ao acervo da Biblioteca Ministro Oscar Saraiva do STJ. Em respeito à Lei de Direitos Autorais, não disponibilizamos a obra na íntegra.- Localização na estante: 351.712.2(81) P712

Dynamic Data Structures for Parameterized String Problems

We revisit classic string problems considered in the area of parameterized complexity, and study them through the lens of dynamic data structures. That is, instead of asking for a static algorithm that solves the given instance efficiently, our goal is to design a data structure that efficiently maintains a solution, or reports a lack thereof, upon updates in the instance. We first consider the Closest String problem, for which we design randomized dynamic data structures with amortized update times $d^{\mathcal{O}(d)}$ and $|\Sigma|^{\mathcal{O}(d)}$, respectively, where $\Sigma$ is the alphabet and $d$ is the assumed bound on the maximum distance. These are obtained by combining known static approaches to Closest String with color-coding. Next, we note that from a result of Frandsen et al.~[J. ACM'97] one can easily infer a meta-theorem that provides dynamic data structures for parameterized string problems with worst-case update time of the form $\mathcal{O}(\log \log n)$, where $k$ is the parameter in question and $n$ is the length of the string. We showcase the utility of this meta-theorem by giving such data structures for problems Disjoint Factors and Edit Distance. We also give explicit data structures for these problems, with worst-case update times $\mathcal{O}(k2^{k}\log \log n)$ and $\mathcal{O}(k^2\log \log n)$, respectively. Finally, we discuss how a lower bound methodology introduced by Amarilli et al.~[ICALP'21] can be used to show that obtaining update time $\mathcal{O}(f(k))$ for Disjoint Factors and Edit Distance is unlikely already for a constant value of the parameter $k$.Comment: 28 page

Optimal Algorithms for Free Order Multiple-Choice Secretary

Suppose we are given integer $k \leq n$ and $n$ boxes labeled $1,\ldots, n$ by an adversary, each containing a number chosen from an unknown distribution. We have to choose an order to sequentially open these boxes, and each time we open the next box in this order, we learn its number. If we reject a number in a box, the box cannot be recalled. Our goal is to accept the $k$ largest of these numbers, without necessarily opening all boxes. This is the free order multiple-choice secretary problem. Free order variants were studied extensively for the secretary and prophet problems. Kesselheim, Kleinberg, and Niazadeh KKN (STOC'15) initiated a study of randomness-efficient algorithms (with the cheapest order in terms of used random bits) for the free order secretary problems. We present an algorithm for free order multiple-choice secretary, which is simultaneously optimal for the competitive ratio and used amount of randomness. I.e., we construct a distribution on orders with optimal entropy $\Theta(\log\log n)$ such that a deterministic multiple-threshold algorithm is $1-O(\sqrt{\log k/k})$-competitive. This improves in three ways the previous best construction by KKN, whose competitive ratio is $1 - O(1/k^{1/3}) - o(1)$. Our competitive ratio is (near)optimal for the multiple-choice secretary problem; it works for exponentially larger parameter $k$; and our algorithm is a simple deterministic multiple-threshold algorithm, while that in KKN is randomized. We also prove a corresponding lower bound on the entropy of optimal solutions for the multiple-choice secretary problem, matching entropy of our algorithm, where no such previous lower bound was known. We obtain our algorithmic results with a host of new techniques, and with these techniques we also improve significantly the previous results of KKN about constructing entropy-optimal distributions for the classic free order secretary

FATORES DESENCADEADORES DO ESTRESSE EM SERVIDORES PÚBLICOS NO ATENDIMENTO À POPULAÇÃO

O mundo do trabalho passou por mudanças significativas com a evolução das tecnologias, dos processos e procedimentos da organização do trabalho para as organizações se manterem adaptadas ao contexto globalizado dos mercados. O mercado de trabalho passou a exigir profissionais qualificados que promovam as mudanças organizacionais necessárias. Se os trabalhadores não souberem lidar com essas exigências e mudanças poderão desenvolver disfunções de ordem física e mental, social, profissional ou pessoal. Uma dessas disfunções pode ser o estresse que passou a ser um tema abordado com frequência nas relações de trabalho neste início da década de 2000. Este estudo objetivou compreender os fatores que podem desencadear o estresse nos servidores de um órgão público no que diz respeito ao atendimento à população. É uma pesquisa qualitativo-descritiva; os sujeitos foram cinco servidores de diferentes setores que trabalham com atendimento à população de um órgão público localizado em um município da região Oeste de Santa Catarina. Foi usado o Termo de Consentimento Livre e Esclarecido (TCLE) e uma entrevista semiestruturada de acordo com as dimensões observadas. O estudo obteve aprovação do Comitê de Ética em Pesquisa (CEP) da Universidade do Oeste de Santa Catarina (Unoesc). Os entrevistados revelaram que os conflitos, as expectativas, as pressões organizacionais, o excesso de regras, a falta de decisões coletivas, a economia em recessão, a experiência no trabalho e a personalidade de cada um são os principais fatores que geram estresse no trabalho do servidor público.Palavras-chave: Estresse. Servidor público. Relações de trabalho

Pig Feeding under the Potato-green Forage Base System with or without Addition of Herbs versus a Concentrate Based System: Effect on Post-slaughter Performance and Pork Characteristics

This study examined carcass and meat quality parameters in growing/finishing pigs fed unconventionally versus the concentrate-based system. Ninety-six, 12 wk old pigs (34±SD 0.3 kg) were randomly divided into three groups, assigned to one of the three dietary treatments: standard complete concentrate mixture, conventional (C diet); unconventional, steamed potato-green forage-concentrate based diet (U diet), and unconventional basal diet+herbage mix (UH diet). Pigs fed U diet showed lower dressing percentage, meatiness, loin eye area, and weight of pork neck (p≤0.05), but their carcasses were significantly (p≤0.05) longer and had increased backfat depth (p≤0.05). There was no impact of the diet on the meat content of dry matter, crude ash, acidity, and colour parameters of m. longissimus. Unconventional feeding significantly (p≤0.05) elevated water the holding capacity of m. longissimus and slightly improved the sensory attributes analysis of meat. The addition of herbs resulted in increased loin eye area (p≤0.05), decreased fat content (p≤0.05) in m. longissimus, and tended to improve some sensory attributes of meat. There were significant gender differences in response to all diets. There were significant diet×sex interactions for some measured variables, but there were no clearly identifiable trends with regard to any specific carcass or meat parameters. Feeding unconventional diet to pigs may offer better culinary attributes of the meat, and improve some technologically important characteristics of pig carcass, but may negatively affect some carcass or meat parameters