275 research outputs found
Computing the Exact Radius of Large Graphs
No full textThe radius of a graph is an important structural parameter which plays a key role in social network analysis and related applications. It measures the minimum shortest path distance that is required to reach all nodes in the graph from a single node. A node from which all other nodes are within a distance equal to the radius is called a center of the graph. In a graph with n nodes and m edges, the center and the radius can be determined in Õ(nm) by computing shortest path distances between all pairs of nodes. Fine-grained complexity results suggest that asymptotically faster algorithms are unlikely to exist. In this paper, we describe a novel randomized algorithm for exact radius computation in weighted digraphs with an expected running time in Õ(d³m) where d is the so-called combinatorial dimension. Our methodology is inspired by Clarkson’s algorithm for LP-type problems. The value of d denotes the size of a basis, which is a smallest subset of nodes which enforce the same radius as the whole node set. While we show that there exist graphs with d ∈ Θ(n), our empirical analysis reveals that even large real-world graphs have small combinatorial dimension. This allows us to compute the radius in near-linear time on such instances. The significantly improved scalability can be clearly observed in our experimental evaluation on a diverse set of benchmark graphs
An Upper Bound on the Number of Extreme Shortest Paths in Arbitrary Dimensions
No full textGraphs with multiple edge costs arise naturally in the route planning domain when apart from travel time other criteria like fuel consumption or positive height difference are also objectives to be minimized. In such a scenario, this paper investigates the number of extreme shortest paths between a given source-target pair s, t. We show that for a fixed but arbitrary number of cost types d ≥ 1 the number of extreme shortest paths is in n^O(log^{d-1}n) in graphs G with n nodes. This is a generalization of known upper bounds for d = 2 and d = 3
Preference-Based Trajectory Clustering - An Application of Geometric Hitting Sets
No full textIn a road network with multicriteria edge costs we consider the problem of computing a minimum number of driving preferences such that a given set of paths/trajectories is optimal under at least one of these preferences. While the exact formulation and solution of this problem appears theoretically hard, we show that in practice one can solve the problem exactly even for non-homeopathic instance sizes of several thousand trajectories in a road network of several million nodes. We also present a parameterized guaranteed-polynomial-time scheme with very good practical performance
Gnoses generales iuris : opus, inter ea quae olim edita sunt, cum ad discendam, tum etiam ad exercendam Iurisprudentiam expeditissimum : accesserunt duo indices titolorum ...
No full textClaudio Prato Iurisc. author
Claudius Hollyband: The author behind the lexicographer
No full textDictionaries are reference works to be consulted. But they can also be assessed as texts and interpreted. For this approach, which is based on a close reading of the entire lexicographical work, the term ‘lexicature’ has been suggested. The chapter takes the French–English dictionary compiled by the French Bourbonnais Huguenot Claudius Hollyband as a striking example of this new type of study. A number of criteria are identified which reveal the persona of the author behind his work. It is shown how the persona influences the description of the lexicon: in the preferences for word selection, the personal expertise or bias in the description of the meanings of words, and in the choice of examples illustrating the use of words.</p
The « Salarium » of Claudius Gothicus (Claudius XIV, 2-15) viewed as a Historical Document
No full textThe so-called Salarium of Claudius (Claudius XIV, 2-15) consists of a genuine Roman salary warrant issued for a dux ducenarius between the years A. D. 296 and 312, in which the author or editor of the biography appears to have substituted a salutation and conclusion of his own for the originals. This document, while it does little to establish the daté or disclose the manner of composition of the Augustan History, nevertheless sheds a. welcome light upon the working of Diocletian's financial system and allied topicsE. Van Sickle C. E. The « Salarium » of Claudius Gothicus (Claudius XIV, 2-15) viewed as a Historical Document. In: L'antiquité classique, Tome 23, fasc. 1, 1954. pp. 47-62
Na+ absorption by Claudius’ cells is regulated by purinergic signaling in the cochlea
No full textConclusion: Claudius’ cells absorb Na+ through the amiloride-sensitive epithelial sodium channel (ENaC). Transepithelial ion transport through ENaC and possibly a Cl[superscript]- secretory pathway is regulated by P2Y purinergic signaling.
Objectives: The purpose of this study was to investigate the ion transport in the Claudius’ cells and its purinergic regulation.
Method: Young adult Sprague–Dawley rats and gerbils were studied. The Claudius’ cell layer on the basilar membrane was dissected from the basal turn of the cochlea. The voltage-sensitive vibrating probe was used to measure transepithelial short circuit current (I[subscript]sc). The baseline I[subscript]sc of Claudius’ cells was measured in the perilymph-like control solution and the change of Isc after
application of amiloride (10 μM) or uridine triphosphate (UTP, 100 μM).
Results: A negative baseline I[subscript]sc was observed in the control solution (-12.50 ± 3.95 μA/cm[superscript]2, n=8) and the addition of amiloride resulted in a decrease of I[subscript]sc by 75.8%. The application of UTP, an agonist for P2Y purinergic receptors, led to a partial inhibition of Isc (by 38.2 ± 3.2%, n=5), and subsequent addition of amiloride abolished the remaining I[subscript]sc
El emperador Claudius, autor de epigramas en un pasaje de Suetonio
No full textAccording to Suetonius (Cl. 2,2), in a "libellus" Claudius complained about his master who had been a "superiumentarius" (a commander of a mule train). This ironic hyperbole, which refers to the brutal use of whip, seems an allusion to the rough Horace's teacher ("plagosus Orbilius"), and so suggests the possibility that Claudius' words were part of an epigram, whose reconstruction the author of this article attempts to, starting from some recognizable jambic sequences
My, Claudius: A Case Against The King As Villain.
No full textThe role of Claudius in Shakespeare\u27s The Tragedy of Hamlet has traditionally been affixed with the label of villain, coupled with a presumption of malice. This prejudice has plagued the role, relegating it to shallow melodrama throughout the majority of the play\u27s 440 odd-year history. Although it has now become more commonplace to see him portrayed as a capable, intelligent, even initially likable king, this has only been the case for the past 50 years or so, and even so the label of villain and the assumption of malice persist and prevail even in contemporary practice. While the author is reluctant to insist on the benevolence of the King as imperative, they do contend that Claudius should not be portrayed as a villain. Doing so undermines the primary conflict - that of Hamlet vs. Claudius - cripples the possibilities for exploration of the King as a role, hinders the potential for Hamlet\u27s journey, and absolves the viewer of active engagement by playing directly into expectations. Within this thesis, consideration of historical analysis and editorial tradition are utilized in order to demonstrate a progressively encompassing disregard that has led to the role\u27s neglect. An account of the 2006 University of Central Florida Conservatory Theatre production is used to validate the necessity of avoiding a villainous portrayal of the King. A brief description of the author\u27s ideal Claudius explores the realm of possibility opened by such non-villainous portrayal, and potential for the role\u27s complexity is examined through a thorough voice/text analysis and brief discussion of Jaques Lecoq\u27s movement equilibrium theory via appendices
On hierarchical search and preference-based routing in transportation networks
No full textIn dieser Arbeit werden verschiedene Problemstellungen der Routenplanung in Transportnetzwerken behandelt
- …
