God is Wonderful in All His Works : A Contemporary Account of Vincentian Activity in the District of Cape Girardeau, Missouri, 1828-1850

John Francis McGerry recounts the Vincentians’ role in establishing Catholicism in the Cape Girardeau region. He describes John Timon’s ministry, which mostly consisted of baptisms, work with condemned prisoners, and various efforts to help the Daugherty family, including purchasing their land. McGerry also relates how John Mary Odin and John Brands worked with non-Catholics and converts despite anti-Catholic prejudice. Finally, McGerry gives details regarding the building and beginning of Saint Vincent’s College at Cape Girardeau

Differential timing of spring migration in wood warblers (Parulinae).

Spring migration patterns of 18 species of paruline warbler at Prince Edward Point, Ontario showed that males arrived earlier than females in all species. Adult males arrived significantly earlier than second-year males in American Redstarts (Setophaga ruticilla), and there was evidence for a similar trend in other species. The difference in mean arrival dates between the sexes was greatest in species that arrived earliest. Similarly, within species, the difference between sexes was greatest in years when the males arrived earliest. For individuals within a species there was a significant negative correlation between arrival date and wing length; however, males of a particular size generally arrived earlier than females of the same size. Thus, larger size may be an advantage to early arrival, but is not sufficient to explain the difference in arrival between sexes. Species that winter furthest north arrived earliest, but sexual differences in wintering grounds have not been reported. These results are consistent with the hypothesis that males are selected to arrive as early as food resources or climatic conditions are adequate, whereas females arrive later, closer to the time when they can successfully begin nesting

Exact algorithms to minimize interference in wireless sensor networks

AbstractFinding a low-interference connected topology is a fundamental problem in wireless sensor networks (WSNs). The problem of reducing interference through adjusting the nodes’ transmission radii in a connected network is one of the most well-known open algorithmic problems in wireless sensor network optimization. In this paper, we study minimization of the average interference and the maximum interference for the highway model, where all the nodes are arbitrarily distributed on a line. First, we prove that there is always an optimal topology with minimum interference that is planar. Then, two exact algorithms are proposed. The first one is an exact algorithm to minimize the average interference in polynomial time, O(n3Δ), where n is the number of nodes and Δ is the maximum node degree. The second one is an exact algorithm to minimize the maximum interference in sub-exponential time, O(n3ΔO(k)), where k=O(Δ) is the minimum maximum interference. All the optimal topologies constructed are planar

Analysis of telephone network traffic based on a complex user network

The traffic in telephone networks is analyzed in this paper. Unlike the classical traffic analysis where call blockings are due to the limited channel capacity, we consider here a more realistic cause for call blockings which is due to the way in which users are networked in a real-life human society. Furthermore, two kinds of user network, namely, the fully-connected user network and the scale-free network, are employed to model the way in which telephone users are connected. We show that the blocking probability is generally higher in the case of the scale-free user network, and that the carried traffic intensity is practically limited not only by the network capacity but also by the property of the user network.Comment: 17 pages, 9 figures, accepted for Physica

Slavonic Translations of Saint Basil’s Works

This feature "ЛѢТОПИСЬ" ('Chronicle') reports on recent events in the field of Early Slavic studies, e.g., celebrations, conferences, symposia, announcements of forthcoming colloquia, and past study groups, etc.On March 21-24 1981, in Birmingham, the Fifteenth Spring Symposium of Byzantine Studies held a conference on Byzantium and the Slavs. This announcement gives a summary of presentations by Faith C.M. Wigzell, Danica Petrović, Dimitrije Stefanović, William R. Veder, and Francis J. Thomson on the following topics: hagiographical writing among the Orthodox Slavs, the importance of the Chilendari Music Manuscripts for the history of Serbian church music, the melodic origin of a sticheron in honor of Prince Lazar, the imitation of Byzantine models in translations, and Slavonic translations of St. Basil's works

Cosmological Large-scale Structures beyond Linear Theory in Modified Gravity

We consider the effect of modified gravity on the growth of large-scale structures at second order in perturbation theory. We show that modified gravity models changing the linear growth rate of fluctuations are also bound to change, although mildly, the mode coupling amplitude in the density and reduced velocity fields. We present explicit formulae which describe this effect. We then focus on models of modified gravity involving a scalar field coupled to matter, in particular chameleons and dilatons, where it is shown that there exists a transition scale around which the existence of an extra scalar degree of freedom induces significant changes in the coupling properties of the cosmic fields. We obtain the amplitude of this effect for realistic dilaton models at the tree-order level for the bispectrum, finding them to be comparable in amplitude to those obtained in the DGP model.Comment: 25 pages, 11 figure

Mining criminal networks from unstructured text documents

Digital data collected for forensics analysis often contain valuable information about the suspects’ social networks. However, most collected records are in the form of unstructured textual data, such as e-mails, chat messages, and text documents. An investigator often has to manually extract the useful information from the text and then enter the important pieces into a structured database for further investigation by using various criminal network analysis tools. Obviously, this information extraction process is tedious and error-prone. Moreover, the quality of the analysis varies by the experience and expertise of the investigator. In this paper, we propose a systematic method to discover criminal networks from a collection of text documents obtained from a suspect’s machine, extract useful information for investigation, and then visualize the suspect’s criminal network. Furthermore, we present a hypothesis generation approach to identify potential indirect relationships among the members in the identified networks. We evaluated the effectiveness and performance of the method on a real-life cybercrimine case and some other datasets. The proposed method, together with the implemented software tool, has received positive feedback from the digital forensics team of a law enforcement unit in Canada

Plenarna diskusija o zaključcima pojedinih radnih grupa

International audienc