1,572 research outputs found

    Whose Forum? Imperial and Elite Patronage in the Forum of Pompeii

    Get PDF
    The forums of municipal towns in the Roman Empire displayed architectural and ideological connections to the capital. This was the case in Pompeii where structures in the forum alluded to buildings in Rome and housed the institution of the Imperial Cult. Studying the forum of Pompeii, in any facet, proves difficult due to a scarcity of evidence. However, using the sparse evidence, this study seeks to create a chronology of the forum of Pompeii’s connection to Imperial Rome. Studying the design and history of four structures on the east side of the forum (Macellum, Imperial Cult Building, Sanctuary of Augustus, Eumachia Building) reveal a change in this connection from the time of Augustus to Pompeii’s destruction in 79 C.E. Initially, elite Pompeians dedicated structures in a manner that glorified the Imperial Family while promoting their own political and social standing. However, after an earthquake in 62 C.E., the forum was repaired in order to create a single statement of Imperial presence. It is likely that a member of the Imperial inner circle or the emperor Nero himself oversaw this rebuilding project in order to standardize Imperial presence at Pompeii. Ultimately, this change in patronage reveals a shift in the way Pompeian citizens perceived their relationship with Rome and the Imperial Family

    Induced restricted Ramsey theorems for spaces

    Get PDF
    AbstractThe induced restricted versions of the vector space Ramsey theorem and of the Graham-Rothschild parameter set theorem are proved

    Negotiating Julio-Claudian Memory: The Vespasianic Building Program and the Representation of Imperial Power in Ancient Rome

    Get PDF
    In 70 C.E., the general Vespasian became the emperor of the Roman world. His accession marked the end of a year-long civil war and the beginning of the second imperial dynasty. The legitimacy of his rule depended on addressing the memory of his predecessors, the Julio-Claudian dynasty. This paper examines expressions of Vespasian’s relationship with the Julio-Claudians as evident in the emperor’s public buildings in Rome. The form, location, and symbolism of five structures that constituted Vespasian’s building program will be considered. These buildings utilized several modes for interacting with the past including: condemning some Julio-Claudian rulers, emulating other Julio-Claudian rulers, reviving pre-Julio-Claudian tradition, and asserting the ingenuity of Flavian power without precedent from the past. These statements defined Vespasian’s principate and the sources of his authority

    Full Scale Proton Beam Impact Testing of new CERN Collimators and Validation of a Numerical Approach for Future Operation

    Full text link
    New collimators are being produced at CERN in the framework of a large particle accelerator upgrade project to protect beam lines against stray particles. Their movable jaws hold low density absorbers with tight geometric requirements, while being able to withstand direct proton beam impacts. Such events induce considerable thermo-mechanical loads, leading to complex structural responses, which make the numerical analysis challenging. Hence, an experiment has been developed to validate the jaw design under representative conditions and to acquire online results to enhance the numerical models. Two jaws have been impacted by high-intensity proton beams in a dedicated facility at CERN and have recreated the worst possible scenario in future operation. The analysis of online results coupled to post-irradiation examinations have demonstrated that the jaw response remains in the elastic domain. However, they have also highlighted how sensitive the jaw geometry is to its mounting support inside the collimator. Proton beam impacts, as well as handling activities, may alter the jaw flatness tolerance value by ±\pm 70 μ{\mu}m, whereas the flatness tolerance requirement is 200 μ{\mu}m. In spite of having validated the jaw design for this application, the study points out numerical limitations caused by the difficulties in describing complex geometries and boundary conditions with such unprecedented requirements.Comment: 22 pages, 17 figures, Prepared for submission to JINS

    Testing Linear-Invariant Non-Linear Properties

    Get PDF
    We consider the task of testing properties of Boolean functions that are invariant under linear transformations of the Boolean cube. Previous work in property testing, including the linearity test and the test for Reed-Muller codes, has mostly focused on such tasks for linear properties. The one exception is a test due to Green for "triangle freeness": a function f:\cube^{n}\to\cube satisfies this property if f(x),f(y),f(x+y)f(x),f(y),f(x+y) do not all equal 1, for any pair x,y\in\cube^{n}. Here we extend this test to a more systematic study of testing for linear-invariant non-linear properties. We consider properties that are described by a single forbidden pattern (and its linear transformations), i.e., a property is given by kk points v_{1},...,v_{k}\in\cube^{k} and f:\cube^{n}\to\cube satisfies the property that if for all linear maps L:\cube^{k}\to\cube^{n} it is the case that f(L(v1)),...,f(L(vk))f(L(v_{1})),...,f(L(v_{k})) do not all equal 1. We show that this property is testable if the underlying matroid specified by v1,...,vkv_{1},...,v_{k} is a graphic matroid. This extends Green's result to an infinite class of new properties. Our techniques extend those of Green and in particular we establish a link between the notion of "1-complexity linear systems" of Green and Tao, and graphic matroids, to derive the results.Comment: This is the full version; conference version appeared in the proceedings of STACS 200

    An exploration of bullying behaviours in nursing : a review of the literature

    Get PDF
    This article explores bullying behaviours in nursing in the United Kingdom and other countries, why it happens and suggests actions to prevent or combat it. Bullying involves intentional and repeated psychological violence humiliating and isolating staff from colleagues. Current literature reports that 20-25% of nursing staff experience bullying behaviour. The main perpetrators are nurses in a senior position to those being bullied and colleagues who are established staff members. Those likely to be bullied are students and new staff members. Bullying can cause distress and depression, with up to 25 per cent of those bullied leaving their jobs or the profession, and have an impact on patient care. Factors contributing to bullying are hierarchical management and employees not feeling empowered. Silence and inaction by managers and colleagues allows this behaviour to continue. A zero tolerance and the addressing of this behaviour clearly and promptly by managers should be instigated. Staff being bullied should be supported by colleague

    Refugees, trauma and adversity-activated development

    Get PDF
    The nature of the refugee phenomenon is examined and the position of mental health professionals is located in relation to it. The various uses of the word 'trauma' are explored and its application to the refugee context is examined. It is proposed that refugees' response to adversity is not limited to being traumatized but includes resilience and Adversity-Activated Development (AAD). Particular emphasis is given to the distinction between resilience and AAD. The usefulness of the 'Trauma Grid' in the therapeutic process with refugees is also discussed. The Trauma Grid avoids global impressions and enables a more comprehensive and systematic way of identifying the individual refugee's functioning in the context of different levels, i.e. individual, family, community and society/culture. Finally, I discuss implications for therapeutic work with refugees

    Access Structure Hiding Secret Sharing from Novel Set Systems and Vector Families

    Full text link
    Secret sharing provides a means to distribute shares of a secret such that any authorized subset of shares, specified by an access structure, can be pooled together to recompute the secret. The standard secret sharing model requires public access structures, which violates privacy and facilitates the adversary by revealing high-value targets. In this paper, we address this shortcoming by introducing \emph{hidden access structures}, which remain secret until some authorized subset of parties collaborate. The central piece of this work is the construction of a set-system H\mathcal{H} with strictly greater than exp(c1.5(logh)2loglogh)\exp\left(c \dfrac{1.5 (\log h)^2}{\log \log h}\right) subsets of a set of hh elements. Our set-system H\mathcal{H} is defined over Zm\mathbb{Z}_m, where mm is a non-prime-power, such that the size of each set in H\mathcal{H} is divisible by mm but the sizes of their pairwise intersections are not divisible by mm, unless one set is a subset of another. We derive a vector family V\mathcal{V} from H\mathcal{H} such that superset-subset relationships in H\mathcal{H} are represented by inner products in V\mathcal{V}. We use V\mathcal{V} to "encode" the access structures and thereby develop the first \emph{access structure hiding} secret sharing scheme. For a setting with \ell parties, our scheme supports 22/2O(log)+12^{2^{\ell/2 - O(\log \ell) + 1}} out of the 22O(log)2^{2^{\ell - O(\log \ell)}} total monotone access structures, and its maximum share size for any access structures is (1+o(1))2+1π/2(1+ o(1)) \dfrac{2^{\ell+1}}{\sqrt{\pi \ell/2}}. The scheme assumes semi-honest polynomial-time parties, and its security relies on the Generalized Diffie-Hellman assumption.Comment: This is the full version of the paper that appears in D. Kim et al. (Eds.): COCOON 2020 (The 26th International Computing and Combinatorics Conference), LNCS 12273, pp. 246-261. This version contains tighter bounds on the maximum share size, and the total number of access structures supporte

    A vontade de sentido na obra de Viktor Frankl

    Full text link

    Rank-width and Tree-width of H-minor-free Graphs

    Get PDF
    We prove that for any fixed r>=2, the tree-width of graphs not containing K_r as a topological minor (resp. as a subgraph) is bounded by a linear (resp. polynomial) function of their rank-width. We also present refinements of our bounds for other graph classes such as K_r-minor free graphs and graphs of bounded genus.Comment: 17 page
    corecore