Corporate Social Responsibility in the Diamond Mining Industry on the West Coast of South Africa

the study was aimed at seeing how communities benefit from minin

Beware of the Small-World neuroscientist!

The SW has undeniably been one of the most popular network descriptors in the neuroscience literature. Two main reasons for its lasting popularity are its apparent ease of computation and the intuitions it is thought to provide on how networked systems operate. Over the last few years, some pitfalls of the SW construct and, more generally, of network summary measures, have widely been acknowledged

Finding k-Dissimilar Paths with Minimum Collective Length

Shortest path computation is a fundamental problem in road networks. However, in many real-world scenarios, determining solely the shortest path is not enough. In this paper, we study the problem of finding k-Dissimilar Paths with Minimum Collective Length (kDPwML), which aims at computing a set of paths from a source s to a target t such that all paths are pairwise dissimilar by at least \theta and the sum of the path lengths is minimal. We introduce an exact algorithm for the kDPwML problem, which iterates over all possible s-t paths while employing two pruning techniques to reduce the prohibitively expensive computational cost. To achieve scalability, we also define the much smaller set of the simple single-via paths, and we adapt two algorithms for kDPwML queries to iterate over this set. Our experimental analysis on real road networks shows that iterating over all paths is impractical, while iterating over the set of simple single-via paths can lead to scalable solutions with only a small trade-off in the quality of the results.Comment: Extended version of the SIGSPATIAL'18 paper under the same titl

Need for support or economic competition? Implicit associations with immigrants during the 2015 migrant crisis

Funding The author(s) disclosed receipt of the following financial support for the research, authorship, and/or publication of this article: This work was supported by the Austrian National Election Study (AUTNES), a National Research Network (NFN) sponsored by the Austrian Science Fund (FWF) [S10902-G11].Peer reviewedPublisher PD

J. C. Nelkenbrecher's allgemeines Taschenbuch der Münz-, Maß- und Gewichtskunde für Banquiers und Kaufleute

Nelkenbrechers Taschenbuch erschien im Jahre 1828 zum vierzehnten Male, und erfreute sich einer so günstigen Aufnahme, daß schon im Laufe des vorigen Jahres zur Veranstaltungen einer neuen Auflage geschritten werden mußte. ..

Universal classification of twisted, strained and sheared graphene moir\'e superlattices

Moir\'e superlattices in graphene supported on various substrates have opened a new avenue to engineer graphene's electronic properties. Yet, the exact crystallographic structure on which their band structure depends remains highly debated. In this scanning tunneling microscopy and density functional theory study, we have analysed graphene samples grown on multilayer graphene prepared onto SiC and on the close-packed surfaces of Re and Ir with ultra-high precision. We resolve small-angle twists and shears in graphene, and identify large unit cells comprising more than 1,000 carbon atoms and exhibiting non-trivial nanopatterns for moir\'e superlattices, which are commensurate to the graphene lattice. Finally, a general formalism applicable to any hexagonal moir\'e is presented to classify all reported structures.Comment: 14 pages, 6 figure