The value of community wellbeing for locality based practice

This presentation put forward six propositions regarding the value and character of community wellbeing, in particular the economic contribution of social and community programs and initiatives. The six propositions are: 1. Community wellbeing is a useful umbrella concept 2. Everyone benefits from public programs 3. There is an economic as well as social cost of not responding well 4. Local government is key in fostering community wellbeing 5. Good practice involves bringing together a number of perspectives and levers, including social and cultural initiatives 6. Engaging with the community around wellbeing offers an opportunity to enhance the political process

Locality-sensitive hashing for protein classification

Determination of sequence similarity is a central issue in computational biology, a problem addressed primarily through BLAST, an alignment based heuristic which has underpinned much of the analysis and annotation of the genomic era. Despite their success, alignment-based approaches scale poorly with increasing data set size, and are not robust under structural sequence rearrangements. Successive waves of innovation in sequencing technologies – so-called Next Generation Sequencing (NGS) approaches – have led to an explosion in data availability, challenging existing methods and motivating novel approaches to sequence representation and similarity scoring, including adaptation of existing methods from other domains such as information retrieval. In this work, we investigate locality-sensitive hashing of sequences through binary document signatures, applying the method to a bacterial protein classification task. Here, the goal is to predict the gene family to which a given query protein belongs. Experiments carried out on a pair of small but biologically realistic datasets (the full protein repertoires of families of Chlamydia and Staphylococcus aureus genomes respectively) show that a measure of similarity obtained by locality sensitive hashing gives highly accurate results while offering a number of avenues which will lead to substantial performance improvements over BLAST..

Reconfiguring Guangzhou identity – a study of place and locality on Sina Weibo

This thesis investigates the role of Chinese microblogging platform Sina Weibo in how the people of Guangzhou understand and negotiate their sense of locality. The geo-identity approach used in this thesis opens up a new approach to explore the complex power relationships that structure our society in and through digital media. It finds that although the Chinese government is trying to orchestrate a homogeneous sense of national belonging, Weibo is constantly reinforcing people's awareness of and identification with the local. The findings show that as new communication technologies and practices reconfigure people's daily experience and social lives, they redefine our sense of self and belonging.

A positive locality record or Lepidiota Contigua Britton (Coleoptera: Scarabaeidae: Melolonthinae)

Lepidiota contigua Britton is recorded from Windsor Tableland, northern Queensland.

Locality and order-invariant logics

Malli on logiikassa käytetty abstraktio monille matemaattisille objekteille. Esimerkiksi verkot, ryhmät ja metriset avaruudet ovat malleja. Äärellisten mallien teoria on logiikan osa-alue, jossa tarkastellaan logiikkojen, formaalien kielten, ilmaisuvoimaa malleissa, joiden alkioiden lukumäärä on äärellinen. Rajoittuminen äärellisiin malleihin mahdollistaa tulosten soveltamisen teoreettisessa tietojenkäsittelytieteessä, jonka näkökulmasta logiikan kaavoja voidaan ajatella ohjelmina ja äärellisiä malleja niiden syötteinä. Lokaalisuus tarkoittaa logiikan kyvyttömyyttä erottaa toisistaan malleja, joiden paikalliset piirteet vastaavat toisiaan. Väitöskirjassa tarkastellaan useita lokaalisuuden muotoja ja niiden säilymistä logiikkoja yhdistellessä. Kehitettyjä työkaluja apuna käyttäen osoitetaan, että Gaifman- ja Hanf-lokaalisuudeksi kutsuttujen varianttien välissä on lokaalisuuskäsitteiden hierarkia, jonka eri tasot voidaan erottaa toisistaan kasvavaa dimensiota olevissa hiloissa. Toisaalta osoitetaan, että lokaalisuuskäsitteet eivät eroa toisistaan, kun rajoitutaan tarkastelemaan äärellisiä puita. Järjestysinvariantit logiikat ovat kieliä, joissa on käytössä sisäänrakennettu järjestysrelaatio, mutta sitä on käytettävä siten, etteivät kaavojen ilmaisemat asiat riipu valitusta järjestyksestä. Määritelmää voi motivoida tietojenkäsittelyn näkökulmasta: vaikka ohjelman syötteen tietojen järjestyksellä ei olisi odotetun tuloksen kannalta merkitystä, on syöte tietokoneen muistissa aina jossakin järjestyksessä, jota ohjelma voi laskennassaan hyödyntää. Väitöskirjassa tutkitaan minkälaisia lokaalisuuden muotoja järjestysinvariantit ensimmäisen kertaluvun predikaattilogiikan laajennukset yksipaikkaisilla kvanttoreilla voivat toteuttaa. Tuloksia sovelletaan tarkastelemalla, milloin sisäänrakennettu järjestys lisää logiikan ilmaisuvoimaa äärellisissä puissa.

Neighborhood Shopkeepers in Contemporary South Korea: Household, Work, and Locality

This is an ethnographic study of the lived worlds of the keepers of small shops in a residential neighborhood in Seoul, South Korea. It outlines, discusses, and analyses the categories and conceptualizations of South Korean capitalism at the level of households, neighborhoods, and Korean society. These cultural categories were investigated through the neighborhood shopkeepers practices of work and reciprocal interaction as well as through the shopkeepers articulations of their lived experience. In South Korea, the keepers of small businesses have continued to be a large occupational category despite of societal and economic changes, occupying approximately one fourth of the population in active work force. In spite of that, these people, their livelihoods and their cultural and social worlds have rarely been in the focus of social science inquiry. The ethnographic field research for this study was conducted during a 14-month period between November 1998 and December 1999 and in three subsequent short visits to Korea and to the research neighborhood. The fieldwork was conducted during the aftermath of the Asian currency crisis, colloquially termed at the time as the IMF crisis, which highlighted the social and cultural circumstances of small businesskeeper in a specific way. The livelihoods of small-scale entrepreneurs became even more precarious than before; self-employment became an involuntary choice for many middle-class salaried employees who were laid off; and the cultural categories and concepts of society and economy South Korean capitalism were articulated more sharply than before. This study begins with an overview of the contemporary setting, the Korean society under the socially and economically painful outcomes of the economic crisis, and continues with an overview of relevant literature. After introducing the research area and the informants, I discuss the Korean notion of neighborhood, which incorporates both the notions of culturally valued Koreanness and deficiency in the sense of modernity and development. This study further analyses the ways in which the businesskeepers appropriate and reproduce the Korean ideas of men s and women s gender roles and spheres of work. As the appropriation of children s labor is conditional to intergenerational family trajectories which aim not to reproduce parents occupational status but to gain entry to salaried occupations via educational credentials, the work of a married couple is the most common organization of work in small businesses, to which the Korean ideas of family and kin continuity are not applied. While the lack of generational businesskeeping succession suggests that the proprietors mainly subscribe to the notions of familial status that emanate from the practices of the white-collar middle class, the cases of certain women shopkeepers show that their proprietorship and the ensuing economic standing in the family prompts and invites inversed interpretations and uses of common cultural notions of gender. After discussing and analyzing the concept of money and the cultural categorization of leisure and work, topics that emerged as very significant in the lived world of the shopkeepers, this study charts and analyses the categories of identification which the shopkeepers employ for their cultural and social locations and identities. Particular attention is paid to the idea of ordinary people (seomin), which shopkeepers are commonly considered to be most representative of, and which also sums up the ambivalence of neighborhood shopkeepers as a social category: they are not committed to familial reproduction and continuity of the business but aspire non-entrepreneurial careers for their children, while they occupy a significant position in the elaborations of culturally valued notions and ideologies defining Koreanness such as warmheartedness and sociability.

Codes with Locality for Two Erasures

In this paper, we study codes with locality that can recover from two erasures via a sequence of two local, parity-check computations. By a local parity-check computation, we mean recovery via a single parity-check equation associated with small Hamming weight. Earlier approaches considered recovery in parallel; the sequential approach allows us to potentially construct codes with improved minimum distance. These codes, which we refer to as locally 2-reconstructible codes, are a natural generalization along one direction, of codes with all-symbol locality introduced by Gopalan et al, in which recovery from a single erasure is considered. By studying the generalized Hamming weights of the dual code, we derive upper bounds on the minimum distance of locally 2-reconstructible codes and provide constructions for a family of codes based on Turan graphs, that are optimal with respect to this bound. The minimum distance bound derived here is universal in the sense that no code which permits all-symbol local recovery from 2 erasures can have larger minimum distance regardless of approach adopted. Our approach also leads to a new bound on the minimum distance of codes with all-symbol locality for the single-erasure case.

PLUTO plus : Near-Complete Modeling of Affine Transformations for Parallelism and Locality

Affine transformations have proven to be very powerful for loop restructuring due to their ability to model a very wide range of transformations. A single multi-dimensional affine function can represent a long and complex sequence of simpler transformations. Existing affine transformation frameworks like the Pluto algorithm, that include a cost function for modern multicore architectures where coarse-grained parallelism and locality are crucial, consider only a sub-space of transformations to avoid a combinatorial explosion in finding the transformations. The ensuing practical tradeoffs lead to the exclusion of certain useful transformations, in particular, transformation compositions involving loop reversals and loop skewing by negative factors. In this paper, we propose an approach to address this limitation by modeling a much larger space of affine transformations in conjunction with the Pluto algorithm's cost function. We perform an experimental evaluation of both, the effect on compilation time, and performance of generated codes. The evaluation shows that our new framework, Pluto+, provides no degradation in performance in any of the Polybench benchmarks. For Lattice Boltzmann Method (LBM) codes with periodic boundary conditions, it provides a mean speedup of 1.33x over Pluto. We also show that Pluto+ does not increase compile times significantly. Experimental results on Polybench show that Pluto+ increases overall polyhedral source-to-source optimization time only by 15%. In cases where it improves execution time significantly, it increased polyhedral optimization time only by 2.04x.

Equivalency and Locality in Nano-Scale Measurement

Two principal problems of equivalency and locality in nano-scale measurement are considered in this paper. The conventional measurements of force and displacement are always closely related to the equivalency problem between the measuremental results by experimental system and the real physical status of the sample, and the locality of the mechanical quantities to be measured. There are some noticeable contradictions in nano-scale measurements induced by the two problems. In this paper, by utilizing a coupled molecular-continuum method, we illustrate the important effects of the two principal problems in atomic force microscopy (AFM) measurements on nano-scale. Our calculations and analysis of these typical mechanical measurement problems suggest that in nano-meter scale measurements, the two principal problems must be carefully dealt with. The coupled molecular-continuum method used in this paper is very effective in solving these problems on nano-scale.

Mitochondrial variation of the "eyed" turtles (Sacalia) based on known-locality and trade specimens

Bryan L. Stuart is thanked for his hard work to collect wild specimens, as well as providing insightful and useful comments on the data. We thank Abigail Wolf of the Field Museum for providing photographs of specimens. Robert Murphy of the Royal Ontario M

GreedyDual-Join: Locality-Aware Buffer Management for Approximate Join Processing Over Data Streams

We investigate adaptive buffer management techniques for approximate evaluation of sliding window joins over multiple data streams. In many applications, data stream processing systems have limited memory or have to deal with very high speed data streams. In both cases, computing the exact results of joins between these streams may not be feasible, mainly because the buffers used to compute the joins contain much smaller number of tuples than the tuples contained in the sliding windows. Therefore, a stream buffer management policy is needed in that case. We show that the buffer replacement policy is an important determinant of the quality of the produced results. To that end, we propose GreedyDual-Join (GDJ) an adaptive and locality-aware buffering technique for managing these buffers. GDJ exploits the temporal correlations (at both long and short time scales), which we found to be prevalent in many real data streams. We note that our algorithm is readily applicable to multiple data streams and multiple joins and requires almost no additional system resources. We report results of an experimental study using both synthetic and real-world data sets. Our results demonstrate the superiority and flexibility of our approach when contrasted to other recently proposed techniques.