How should we live? That question was no less urgent for English men and women who lived between the early sixteenth and late eighteenth centuries than for this book's readers. Keith Thomas's ...masterly exploration of the ways in which people sought to lead fulfilling lives in those centuries between the beginning of the Reformation and the heyday of the Enlightenment illuminates the central values of the period, while casting incidental light on some of the perennial problems of human existence. Consideration of the origins of the modern ideal of human fulfilment and of obstacles to its realization in the early modern period frames an investigation that ranges from work, wealth, and possessions to the pleasures of friendship, family, and sociability. The cult of military prowess, the pursuit of honour and reputation, the nature of religious belief and scepticism, and the desire to be posthumously remembered are all drawn into the discussion, and the views and practices of ordinary people are measured against the opinions of the leading philosophers and theologians of the time. The Ends of Life offers a fresh approach to the history of early modern England, by one of the foremost historians of our time. It also provides modern readers with much food for thought on the problem of how we should live and what goals in life we should pursue.
Over the last 25 years, there has been a concerted effort to settle questions about multiple realization by bringing detailed scientific evidence to bear. Ken Aizawa and Carl Gillett have pursued ...this scientific approach to multiple realization with a precise theory and applications. This paper reviews the application of the Dimensioned approach to human color vision, addressing objections that have appeared in the literature.
One might have thought that if something has two or more distinct realizations, then that thing is multiply realized. Nevertheless, some philosophers have claimed that two or more distinct ...realizations do not amount to multiple realization, unless those distinct realizations amount to multiple “ways” of realizing the thing. Corey Maley, Gualtiero Piccinini, Thomas Polger, and Lawrence Shapiro are among these philosophers. Unfortunately, they do not explain why multiple realization requires multiple “ways” of realizing. More significantly, their efforts to articulate multiple “ways” of realizing turn out to be problematic.
•Paper updates, recalibrates and further complexifies project success.•Paper proposes a four-dimensional model of project success.•Paper outlines four multidimensionality sources of project ...success.•Paper adds green efficacy as a success dimension.•Paper captures the shared feeling of stakeholders.
Decades of research demonstrate that practitioners and scholars may have only a vague notion of what project success is and thus settle for conflicting or inaccurate attributions of this still-elusive phenomenon. Stakeholder evaluations may differ as multiple groups and coalitions seldom hold the same viewpoint. A project that meets business expectations may have unintended consequences on society, highlighting the importance of sustainability. Thus, it remains challenging to devise a parsimonious success model that key stakeholders, internal and external, can minimally agree upon. This paper updates, recalibrates and further “complexifies” project success based on four multidimensionality sources: benefits realization, stakeholder perceptions, issues of timing, and sustainability. The paper proposes a four-dimensional model of success to assess project plan success, business case success, and green efficacy, along with the shared feeling of key stakeholders. The paper concludes with an agenda highlighting future research to further our understanding of the project success phenomenon.
Dominant cultural narratives about later life dismiss the value senior citizens hold for society. In her cultural-philosophical critique, Hanne Laceulle outlines counter narratives that acknowledge ...both potentials and vulnerabilities of later life. She draws on the rich philosophical tradition of thought about self-realization and explores the significance of ethical concepts essential to the process of growing old such as autonomy, authenticity and virtue. These counter narratives aim to support older individuals in their search for a meaningful age identity, while they make society recognize its senior members as valued participants and moral agents of their own lives.
Distributed Graph Realizations Augustine, John; Choudhary, Keerti; Cohen, Avi ...
IEEE transactions on parallel and distributed systems,
2022-June-1, 2022-6-1, Letnik:
33, Številka:
6
Journal Article
Recenzirano
Odprti dostop
We study graph realization problems for the first time from a distributed perspective. Graph realization problems are encountered in distributed construction of overlay networks that must satisfy ...certain degree or connectivity properties. We study them in the node capacitated clique (NCC) model of distributed computing, recently introduced for representing peer-to-peer overlay networks. We focus on two central variants, degree-sequence realization and minimum threshold-connectivity realization. In the degree sequence problem, each node <inline-formula><tex-math notation="LaTeX">v</tex-math> <mml:math><mml:mi>v</mml:mi></mml:math><inline-graphic xlink:href="sivasubramaniam-ieq1-3104239.gif"/> </inline-formula> is associated with a degree <inline-formula><tex-math notation="LaTeX">d(v)</tex-math> <mml:math><mml:mrow><mml:mi>d</mml:mi><mml:mo>(</mml:mo><mml:mi>v</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href="sivasubramaniam-ieq2-3104239.gif"/> </inline-formula>, and the resulting degree sequence is realizable if it is possible to construct an overlay network in which the degree of each node <inline-formula><tex-math notation="LaTeX">v</tex-math> <mml:math><mml:mi>v</mml:mi></mml:math><inline-graphic xlink:href="sivasubramaniam-ieq3-3104239.gif"/> </inline-formula> is <inline-formula><tex-math notation="LaTeX">d(v)</tex-math> <mml:math><mml:mrow><mml:mi>d</mml:mi><mml:mo>(</mml:mo><mml:mi>v</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href="sivasubramaniam-ieq4-3104239.gif"/> </inline-formula>. The minimum threshold-connectivity problem requires us to construct an overlay network that satisfies connectivity constraints specified between every pair of nodes. Overlay network realizations can be either explicit or implicit. Explicit realizations require both endpoints of any edge in the realized graph to be aware of the edge. In implicit realizations, on the other hand, at least one endpoint of each edge of the realized graph needs to be aware of the edge. The main realization algorithms we present are the following. (Note that all our algorithms are randomized Las Vegas algorithms unless specified otherwise. The stated running times hold with high probability.) 1) An <inline-formula><tex-math notation="LaTeX">\tilde{O}(\min \lbrace \sqrt{m},\Delta \rbrace)</tex-math> <mml:math><mml:mrow><mml:mover accent="true"><mml:mi>O</mml:mi><mml:mo>˜</mml:mo></mml:mover><mml:mrow><mml:mo>(</mml:mo><mml:mo movablelimits="true" form="prefix">min</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:msqrt><mml:mi>m</mml:mi></mml:msqrt><mml:mo>,</mml:mo><mml:mi>Δ</mml:mi><mml:mo>}</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math><inline-graphic xlink:href="sivasubramaniam-ieq5-3104239.gif"/> </inline-formula> time algorithm for implicit realization of a degree sequence. Here, <inline-formula><tex-math notation="LaTeX">\Delta = \max _v d(v)</tex-math> <mml:math><mml:mrow><mml:mi>Δ</mml:mi><mml:mo>=</mml:mo><mml:msub><mml:mo movablelimits="true" form="prefix">max</mml:mo><mml:mi>v</mml:mi></mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>v</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math><inline-graphic xlink:href="sivasubramaniam-ieq6-3104239.gif"/> </inline-formula> is the maximum degree and <inline-formula><tex-math notation="LaTeX">m = (1/2) \sum _v d(v)</tex-math> <mml:math><mml:mrow><mml:mi>m</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>/</mml:mo><mml:mn>2</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:msub><mml:mo>∑</mml:mo><mml:mi>v</mml:mi></mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>v</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math><inline-graphic xlink:href="sivasubramaniam-ieq7-3104239.gif"/> </inline-formula> is the number of edges in the final realization. 2) <inline-formula><tex-math notation="LaTeX">\tilde{O}(\Delta)</tex-math> <mml:math><mml:mrow><mml:mover accent="true"><mml:mi>O</mml:mi><mml:mo>˜</mml:mo></mml:mover><mml:mrow><mml:mo>(</mml:mo><mml:mi>Δ</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math><inline-graphic xlink:href="sivasubramaniam-ieq8-3104239.gif"/> </inline-formula> time algorithm for an explicit realization of a degree sequence. We first compute an implicit realization and then transform it into an explicit one in <inline-formula><tex-math notation="LaTeX">\tilde{O}(\Delta)</tex-math> <mml:math><mml:mrow><mml:mover accent="true"><mml:mi>O</mml:mi><mml:mo>˜</mml:mo></mml:mover><mml:mrow><mml:mo>(</mml:mo><mml:mi>Δ</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math><inline-graphic xlink:href="sivasubramaniam-ieq9-3104239.gif"/> </inline-formula> additional rounds. 3) An <inline-formula><tex-math notation="LaTeX">\tilde{O}(\Delta)</tex-math> <mml:math><mml:mrow><mml:mover accent="true"><mml:mi>O</mml:mi><mml:mo>˜</mml:mo></mml:mover><mml:mrow><mml:mo>(</mml:mo><mml:mi>Δ</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math><inline-graphic xlink:href="sivasubramaniam-ieq10-3104239.gif"/> </inline-formula> time algorithm for the threshold connectivity problem that obtains an explicit solution and an improved <inline-formula><tex-math notation="LaTeX">\tilde{O}(1)</tex-math> <mml:math><mml:mrow><mml:mover accent="true"><mml:mi>O</mml:mi><mml:mo>˜</mml:mo></mml:mover><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math><inline-graphic xlink:href="sivasubramaniam-ieq11-3104239.gif"/> </inline-formula> algorithm for implicit realization when all nodes know each other's IDs. These algorithms yield 2-approximations w.r.t. the number of edges. We complement our upper bounds with lower bounds to show that the above algorithms are tight up to factors of <inline-formula><tex-math notation="LaTeX">\log n</tex-math> <mml:math><mml:mrow><mml:mo form="prefix">log</mml:mo><mml:mi>n</mml:mi></mml:mrow></mml:math><inline-graphic xlink:href="sivasubramaniam-ieq12-3104239.gif"/> </inline-formula>. Additionally, we provide algorithms for realizing trees (including a procedure for obtaining a tree with a minimal diameter), an <inline-formula><tex-math notation="LaTeX">\tilde{O}(1)</tex-math> <mml:math><mml:mrow><mml:mover accent="true"><mml:mi>O</mml:mi><mml:mo>˜</mml:mo></mml:mover><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math><inline-graphic xlink:href="sivasubramaniam-ieq13-3104239.gif"/> </inline-formula> round algorithm for approximate degree sequence realization and finally an <inline-formula><tex-math notation="LaTeX">O(\log ^2 n)</tex-math> <mml:math><mml:mrow><mml:mi>O</mml:mi><mml:mo>(</mml:mo><mml:msup><mml:mo form="prefix">log</mml:mo><mml:mn>2</mml:mn></mml:msup><mml:mi>n</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href="sivasubramaniam-ieq14-3104239.gif"/> </inline-formula> algorithm for degree sequence realization in the non-preassigned case namely, where the input degree sequence may be permuted among the nodes.
Grow old on purpose. This book invites readers to navigate a purposeful path from adulthood to elderhood with choice, curiosity, and courage. Everyone is getting old; not everyone is growing old. But ...the path of purposeful aging is accessible to alland it's fundamental to health, happiness, and longevity.With a focus on growing whole through developing a sense of purpose in later life, Who Do You Want to Be When You Grow Old? celebrates the experience of aging with inspiring stories, real-world practices, and provocative questions. Framed by a long conversation between two old friends, the book reconceives aging as a liberating experience that enables us to become more authentically the person we always meant to be with each passing year.In their bestseller Repacking Your Bags, Richard J. Leider and David A. Shapiro defined the good life as ';living in the place you belong, with people you love, doing the right work, on purpose.' This book builds on that definition to offer a purposeful path for living well while aging well.
This survey aims to present a comprehensive and systematic synthesis of concepts and results on the minimal state space realization problem for positive, linear, time-invariant systems. Positive ...systems are systems for which the state and the output are always non-negative for any non-negative initial state and input. They are used to model phenomena in which the variables must take non-negative values due to the nature of the underlying physical system. Restricting the state–space realization to positive systems makes the problem extremely different and much more difficult than that for ordinary systems. Indeed, a minimal positive realization may have a dimension even much greater than the order of the transfer function it realizes. Although the problem of finding a finite-dimensional positive state–space realization of a given transfer function has been solved, the characterization of minimality for positive systems is still an open problem. This survey introduces the reader to different aspects of the problem and presents the mathematical approaches used to tackle it as well as some relevant related problems. Moreover, some partial results are presented. Finally, a comprehensive bibliography on positive systems, organized by topics, is provided.
PDF
