5,689 research outputs found
The Alternative Library
Get PDFMuch time and effort has been devoted to designing and developing library Web sites that are easy to navigate by both new students and experienced researchers. In a review of the Southampton Institute Library it was decided that in addition to updating the existing homepage an alternative would be offered. Drawing on theory relating to user interface design,learning styles and creative thinking, an Alternative Library navigation system was added to the more traditional library homepage. The aim was to provide students with a different way to explore and discover the wide range of information resources available by taking a less formal approach to navigation based on the metaphor of physical space and playful exploration
Overwintering and low temperature biology of cereal aphids
No full textThe aphids Sitobion avenae F., Metopolophium dirhodum Wlk. and Rhopalosiphum nadi L. are important pests of cereal crops. More knowledge of their biology during autumn, winter and spring is needed to improve the control of summer outbreaks. The work described in this thesis was undertaken to investigate the species' low temperature biology and overwintering ecology. All three species can survive the winter as eggs (holocyclic overwintering) or as viviparae (anholocyclic overwintering). Most of the work in this study investigated anholocyclic overwintering. It concentrated particularly on the central role played by low temperatures in winter development, reproduction and survival.The host plant in most of the experiments on viviparae was winter wheat, the crop on which cereal aphids cause most damage. Environmental and intrinsic factors affecting low temperature mortality were investigated in the laboratory. As extensive winter sampling of natural populations in Hampshire was being undertaken by S.C. Hand, fieldwork on anholocyclic overwintering in the present study involved experiments on artificially established populations. In these the processes of mortality, development and reproduction were analysed separately, which enabled relatively precise mathematical relationships to be determined. Mortality due to weather factors was quantified in a field experiment which also allowed comparisons between low temperature mortality under laboratory and field conditions to be made. Detailed monitoring of clip-caged S. avenae viviparae on winter wheat from September to March enabled relationships between development rate, reproduction rate and temperature and between survival, reproduction rate and age to be determined accurately. A less detailed investigation of differences in winter performance between S. avenae and R. padi on winter wheat and perennial rye grass was also carried out.Nearly all the work on holocyclic overwintering concerned M. dirhodum on its primary hosts, Rosa spp. Population surveys in spring and autumn in a west Hampshire study area were undertaken to estimate population densities and characterize favourable overwintering sites. The surveys were done in collaboration with S.C. Hand, who undertook the great bulk of the analysis involved. Colonies of N_. dirhodum on selected rose bushes were monitored to determine the timing of the holocyclic cycle and obtain information on mortality factors. The monitoring and surveys allowed the importance of holocyclic overwintering in M. dirhodum to be assessed. A small amount of laboratory work on holocyclic life-stages was also undertaken.</p
Tickle me, Timothy, do! [music] /
No full textSixpenny popular edition, no. 503 (Publisher number). For voice and piano, with melody line.; Melody line and full verses on cover verso.; "Sung by Billy Williams (The man in the velvet suit)".; Cover carries illustration of Billy Williams.; Publisher's no.: Sixpenny popular edition, no. 503.; Also available online http://nla.gov.au/nla.mus-vn1116377; MUS: N, G.E. 064032.; Library's N copy imperfect: P. 5 wanting
3SUM and Related Problems in Fine-Grained Complexity (Invited Talk)
No full text3SUM is a simple to state problem: given a set S of n numbers, determine whether S contains three a,b,c so that a+b+c = 0. The fastest algorithms for the problem run in n² poly(log log n)/(log n)² time both when the input numbers are integers [Ilya Baran et al., 2005] (in the word RAM model with O(log n) bit words) and when they are real numbers [Timothy M. Chan, 2020] (in the real RAM model).
A hypothesis that is now central in Fine-Grained Complexity (FGC) states that 3SUM requires n^{2-o(1)} time (on the real RAM for real inputs and on the word RAM with O(log n) bit numbers for integer inputs). This hypothesis was first used in Computational Geometry by Gajentaan and Overmars [A. Gajentaan and M. Overmars, 1995] who built a web of reductions showing that many geometric problems are hard, assuming that 3SUM is hard. The web of reductions within computational geometry has grown considerably since then (see some citations in [V. Vassilevska Williams, 2018]).
A seminal paper by Pǎtraşcu [Mihai Pǎtraşcu, 2010] showed that the integer version of the 3SUM hypothesis can be used to prove polynomial conditional lower bounds for several problems in data structures and graph algorithms as well, extending the implications of the hypothesis to outside computational geometry. Pǎtraşcu proved an important tight equivalence between (integer) 3SUM and a problem called 3SUM-Convolution (see also [Timothy M. Chan and Qizheng He, 2020]) that is easier to use in reductions: given an integer array a of length n, do there exist i,j ∈ [n] so that a[i]+a[j] = a[i+j]. From 3SUM-Convolution, many 3SUM-based hardness results have been proven: e.g. to listing graphs in triangles, dynamically maintaining shortest paths or bipartite matching, subset intersection and many more.
It is interesting to consider more runtime-equivalent formulations of 3SUM, with the goal of uncovering more relationships to different problems. The talk will outline some such equivalences. For instance, 3SUM (over the reals or the integers) is equivalent to All-Numbers-3SUM: given a set S of n numbers, determine for every a ∈ S whether there are b,c ∈ S with a+b+c = 0 (e.g. [V. Vassilevska Williams and R. Williams, 2018]).
The equivalences between 3SUM, 3SUM-Convolution and All-Numbers 3SUM are (n²,n²)-fine-grained equivalences that imply that if there is an O(n^{2-ε}) time algorithm for one of the problems for ε > 0, then there is also an O(n^{2-ε'}) time algorithm for the other problems for some ε' > 0. More generally, for functions a(n),b(n), there is an (a,b)-fine-grained reduction [V. Vassilevska Williams, 2018; V. Vassilevska Williams and R. Williams, 2010; V. Vassilevska Williams and R. Williams, 2018] from problem A to problem B if for every ε > 0 there is a δ > 0 and an O(a(n)^{1-δ}) time algorithm for A that does oracle calls to instances of B of sizes n₁,…,n_k (for some k) so that ∑_{j = 1}^k b(n_j)^{1-ε} ≤ a(n)^{1-δ}. With such a reduction, an O(b(n)^{1-ε}) time algorithm for B can be converted into an O(a(n)^{1-δ}) time algorithm for A by replacing the oracle calls by calls to the B algorithm. A and B are (a,b)-fine-grained equivalent if A (a,b)-reduces to B and B (b,a)-reduces to A.
One of the main open problems in FGC is to determine the relationship between 3SUM and the other central FGC problems, in particular All-Pairs Shortest Paths (APSP). A classical graph problem, APSP in n node graphs has been known to be solvable in O(n³) time since the 1950s. Its fastest known algorithm runs in n³/exp(√{log n}) time [Ryan Williams, 2014]. The APSP Hypothesis states that n^{3-o(1)} time is needed to solve APSP in graphs with integer edge weights in the word-RAM model with O(log n) bit words. It is unknown whether APSP and 3SUM are fine-grained reducible to each other, in either direction. The two problems are very similar. Problems such as (min,+)-convolution (believed to require n^{2-o(1)} time) have tight fine-grained reductions to both APSP and 3SUM, and both 3SUM and APSP have tight fine-grained reductions to problems such as Exact Triangle [V. Vassilevska Williams and R. Williams, 2018; V. Vassilevska and R. Williams, 2009; V. Vassilevska Williams and Ryan Williams, 2013] and (since very recently) Listing triangles in sparse graphs [Mihai Pǎtraşcu, 2010; Tsvi Kopelowitz et al., 2016; V. Vassilevska Williams and Yinzhan Xu, 2020]. The talk will discuss these relationships and some of their implications, e.g. to dynamic algorithms
Our Savior and King: Theology proper in 1 Timothy
No full textIn this dissertation the author seeks to present a holistic theology proper (hereafter, simply "theology") for the first epistle to Timothy, with special regard to the letter's doxologies (King) and divine title, Savior. Chapter 1 identifies the problem, includes a history of research, and describes the method and procedure of the dissertation. The method of inquiry consists of determining the meaning and function of the letter's theology. Thus, the author seeks to understand the background and character of 1 Timothy's theology, while also wishing to discern why the author of 1 Timothy chose to emphasize these peculiar theological themes.
Chapter 2 explores the meaning and function of the theological descriptions found in the doxologies of 1 Timothy 1:17 and 6:15-16. By thorough comparison to Greco-Roman, early Jewish, and OT literature, the author suggests a basically OT-informed view of God. The doxologies depict God as the only Sovereign who rules over all. The writer then determines that the doxologies function as a support and encouragement for Timothy to heed Paul's charge. This conclusion is largely based on the positioning of the doxologies and the macrostructure of the letter.
Chapter 3 examines the meaning and function of the divine epithet Savior. After comparing this term to its occurrences in Greco-Roman, early Jewish, and OT literature, the author again favors an OT background for Savior. This term depicts God as one who mercifully and indiscriminately reconciles sinners who trust in Christ. While also recognizing other functions, the author suggests that God as Savior may have been aimed at the primary implied reader, Timothy, as well. Accordingly, the idea of Savior informs and strengthens Timothy, so that he might continue to labor in presenting the life-giving gospel of God.
Chapter 4 considers every remaining theological description in 1 Timothy, as well as themes that significantly relate to the letter's theology, such as Christology. The author suggests that the entire theology of 1 Timothy either coheres with or supports the predominant ideas of God as King and Savior.
Chapter 5 summarizes the dissertation's findings and concludes with suggested implications for NT studies
Petersen Electric, Inc. v. David R. Williams : Brief of Appellee
Get PDFAppeal from the Third District Court, Salt Lake County, the Honorable Judge Timothy R. Hanson, Presidin
Petersen Electric, Inc. v. David R. Williams : Brief of Appellant
Get PDFAppeal from the Third District Court, Salt Lake County, the Honorable Judge Timothy R. Hanson, Presidin
Petersen Electric Inc. v. David R. Williams : Reply Brief
Get PDFAppeal from the Third District Court, Salt Lake County, the Honorable Judge Timothy R. Hanson, Presidin
A web-based screening tool for near-port air quality assessments
Get PDFAuthor(s): Isakov, Vlad; Barzyk, Timothy M; Smith, Elizabeth R; Arunachalam, Saravanan; Naess, Brian; Venkatram, Akul
Roma, magistra mundi. Itineraria culturae medievalis. Mélanges offerts au Père L.E. Boyle à l\u27occasion de son 75e anniversaire
No full textR. James Long (with Timothy B. Noone) is a contributing author, Fishacre and Rufus on the Metaphysics of Light: Two Unedited Texts , Volume 2, pp. 517-548
- …
