Wear Next: An Exploration into the Future of Wearable Technology

Technology is increasingly infiltrating all aspects of our lives and the rapid uptake of devices that live near, on or in our bodies are facilitating radical new ways of working, relating and socialising. This distribution of technology into the very fabric of our everyday life creates new possibilities, but also raises questions regarding our future relationship with data and the quantified self. By embedding technology into the fabric of our clothes and accessories, it becomes ‘wearable’. Such ‘wearables’ enable the acquisition of and the connection to vast amounts of data about people and environments in order to provide life-augmenting levels of interactivity. Wearable sensors for example, offer the potential for significant benefits in the future management of our wellbeing. Fitness trackers such as ‘Fitbit’ and ‘Garmen’ provide wearers with the ability to monitor their personal fitness indicators while other wearables provide healthcare professionals with information that improves diagnosis. While the rapid uptake of wearables may offer unique and innovative opportunities, there are also concerns surrounding the high levels of data sharing that come as a consequence of these technologies. As more ‘smart’ devices connect to the Internet, and as technology becomes increasingly available (e.g. via Wi-Fi, Bluetooth), more products, artefacts and things are becoming interconnected. This digital connection of devices is called The ‘Internet of Things’ (IoT). IoT is spreading rapidly, with many traditionally non-online devices becoming increasingly connected; products such as mobile phones, fridges, pedometers, coffee machines, video cameras, cars and clothing. The IoT is growing at a rapid rate with estimates indicating that by 2020 there will be over 25 billion connected things globally. As the number of devices connected to the Internet increases, so too does the amount of data collected and type of information that is stored and potentially shared. The ability to collect massive amounts of data - known as ‘big data’ - can be used to better understand and predict behaviours across all areas of research from societal and economic to environmental and biological. With this kind of information at our disposal, we have a more powerful lens with which to perceive the world, and the resulting insights can be used to design more appropriate products, services and systems. It can however, also be used as a method of surveillance, suppression and coercion by governments or large organisations. This is becoming particularly apparent in advertising that targets audiences based on the individual preferences revealed by the data collected from social media and online devices such as GPS systems or pedometers. This type of technology also provides fertile ground for public debates around future fashion, identity and broader social issues such as culture, politics and the environment. The potential implications of these type of technological interactions via wearables, through and with the IoT, have never been more real or more accessible. But, as highlighted, this interconnectedness also brings with it complex technical, ethical and moral challenges. Data security and the protection of privacy and personal information will become ever more present in current and future ethical and moral debates of the 21st century. This type of technology is also a stepping-stone to a future that includes implantable technology, biotechnologies, interspecies communication and augmented humans (cyborgs). Technologies that live symbiotically and perpetually in our bodies, the built environment and the natural environment are no longer the stuff of science fiction; it is in fact a reality. So, where next?... The works exhibited in Wear Next_ provide a snapshot into the broad spectrum of wearables in design and in development internationally. This exhibition has been curated to serve as a platform for enhanced broader debate around future technology, our mediated future-selves and the evolution of human interactions. As you explore the exhibition, may we ask that you pause and think to yourself, what might we... Wear Next_? WEARNEXT ONLINE LISTINGS AND MEDIA COVERAGE: http://indulgemagazine.net/wear-next/ http://www.weekendnotes.com/wear-next-exhibition-gallery-artisan/ http://concreteplayground.com/brisbane/event/wear-next_/ http://www.nationalcraftinitiative.com.au/news_and_events/event/48/wear-next http://bneart.com/whats-on/wear-next_/ http://creativelysould.tumblr.com/post/124899079611/creative-weekend-art-edition http://www.abc.net.au/radionational/programs/breakfast/smartly-dressed-the-future-of-wearable-technology/6744374 http://couriermail.newspaperdirect.com/epaper/viewer.aspx RADIO COVERAGE http://www.abc.net.au/radionational/programs/breakfast/wear-next-exhibition-whats-next-for-wearable-technology/6745986 TELEVISION COVERAGE http://www.abc.net.au/radionational/programs/breakfast/wear-next-exhibition-whats-next-for-wearable-technology/6745986 https://au.news.yahoo.com/video/watch/29439742/how-you-could-soon-be-wearing-smart-clothes/#page1

Directional dominance on stature and cognition in diverse human populations

Homozygosity has long been associated with rare, often devastating, Mendelian disorders1, and Darwin was one of the first to recognize that inbreeding reduces evolutionary fitness2. However, the effect of the more distant parental relatedness that is common in modern human populations is less well understood. Genomic data now allow us to investigate the effects of homozygosity on traits of public health importance by observing contiguous homozygous segments (runs of homozygosity), which are inferred to be homozygous along their complete length. Given the low levels of genome-wide homozygosity prevalent in most human populations, information is required on very large numbers of people to provide sufficient power3, 4. Here we use runs of homozygosity to study 16 health-related quantitative traits in 354,224 individuals from 102 cohorts, and find statistically significant associations between summed runs of homozygosity and four complex traits: height, forced expiratory lung volume in one second, general cognitive ability and educational attainment (P < 1 × 10−300, 2.1 × 10−6, 2.5 × 10−10 and 1.8 × 10−10, respectively). In each case, increased homozygosity was associated with decreased trait value, equivalent to the offspring of first cousins being 1.2 cm shorter and having 10 months’ less education. Similar effect sizes were found across four continental groups and populations with different degrees of genome-wide homozygosity, providing evidence that homozygosity, rather than confounding, directly contributes to phenotypic variance. Contrary to earlier reports in substantially smaller samples5, 6, no evidence was seen of an influence of genome-wide homozygosity on blood pressure and low density lipoprotein cholesterol, or ten other cardio-metabolic traits. Since directional dominance is predicted for traits under directional evolutionary selection7, this study provides evidence that increased stature and cognitive function have been positively selected in human evolution, whereas many important risk factors for late-onset complex diseases may not have been.

Augmenting process elicitation with visual priming: An empirical exploration of user behaviour and modelling outcomes

Business process models have become an effective way of examining business practices to identify areas for improvement. While common information gathering approaches are generally efficacious, they can be quite time consuming and have the risk of developing inaccuracies when information is forgotten or incorrectly interpreted by analysts. In this study, the potential of a role-playing approach to process elicitation and specification has been examined. This method allows stakeholders to enter a virtual world and role-play actions similarly to how they would in reality. As actions are completed, a model is automatically developed, removing the need for stakeholders to learn and understand a modelling grammar. An empirical investigation comparing both the modelling outputs and participant behaviour of this virtual world role-play elicitor with an S-BPM process modelling tool found that while the modelling approaches of the two groups varied greatly, the virtual world elicitor may not only improve both the number of individual process task steps remembered and the correctness of task ordering, but also provide a reduction in the time required for stakeholders to model a process view.

Dynamics after a sweep through a quantum critical point

The coherent quantum evolution of a one-dimensional many-particle system after slowly sweeping the Hamiltonian through a critical point is studied using a generalized quantum Ising model containing both integrable and nonintegrable regimes. It is known from previous work that universal power laws of the sweep rate appear in such quantities as the mean number of excitations created by the sweep. Several other phenomena are found that are not reflected by such averages: there are two different scaling behaviors of the entanglement entropy and a relaxation that is power law in time rather than exponential. The final state of evolution after the quench is not characterized by any effective temperature, and the Loschmidt echo converges algebraically for long times, with cusplike singularities in the integrable case that are dynamically broadened by nonintegrable perturbations.

Large molecular motions are tolerated in crystals of diamine double salt of trans-chlorocinnamic acids with trans-1,2-diaminocyclohexane

Contrary to the general assumption that photoreactions in crystals may not proceed with large molecular motions, a pedal-like motion prompted by electronic excitation is believed to be involved during the β-dimer formation from the crystals of the diamine double salt of trans-2,4-dichlorocinnamic acid and trans-1,2-diaminocyclohexane.

Exact bounds for distributed graph colouring

A distributed system is a collection of networked autonomous processing units which must work in a cooperative manner. Currently, large-scale distributed systems, such as various telecommunication and computer networks, are abundant and used in a multitude of tasks. The field of distributed computing studies what can be computed efficiently in such systems. Distributed systems are usually modelled as graphs where nodes represent the processors and edges denote communication links between processors. This thesis concentrates on the computational complexity of the distributed graph colouring problem. The objective of the graph colouring problem is to assign a colour to each node in such a way that no two nodes connected by an edge share the same colour. In particular, it is often desirable to use only a small number of colours. This task is a fundamental symmetry-breaking primitive in various distributed algorithms. A graph that has been coloured in this manner using at most k different colours is said to be k-coloured. This work examines the synchronous message-passing model of distributed computation: every node runs the same algorithm, and the system operates in discrete synchronous communication rounds. During each round, a node can communicate with its neighbours and perform local computation. In this model, the time complexity of a problem is the number of synchronous communication rounds required to solve the problem. It is known that 3-colouring any k-coloured directed cycle requires at least ½(log* k - 3) communication rounds and is possible in ½(log* k + 7) communication rounds for all k ≥ 3. This work shows that for any k ≥ 3, colouring a k-coloured directed cycle with at most three colours is possible in ½(log* k + 3) rounds. In contrast, it is also shown that for some values of k, colouring a directed cycle with at most three colours requires at least ½(log* k + 1) communication rounds. Furthermore, in the case of directed rooted trees, reducing a k-colouring into a 3-colouring requires at least log* k + 1 rounds for some k and possible in log* k + 3 rounds for all k ≥ 3. The new positive and negative results are derived using computational methods, as the existence of distributed colouring algorithms corresponds to the colourability of so-called neighbourhood graphs. The colourability of these graphs is analysed using Boolean satisfiability (SAT) solvers. Finally, this thesis shows that similar methods are applicable in capturing the existence of distributed algorithms for other graph problems, such as the maximal matching problem.

Zur Wiedergabe von Helsinkier Toponymen in den deutschen Übersetzungen von drei finnischen Romanen

Tutkielma keskittyy tarkastelemaan, kuinka Helsingin erilaiset paikannimet on välitetty kaunokirjallisuuden saksannoksissa kohdekieliselle lukijalle. Helsingin paikannimiin lukeutuvat tutkielmassa mm. Helsingissä tai pääkau-punkiseudulla sijaitsevien katujen, kaupunginosien, tunnettujen tavaratalojen ja ravintoloiden, julkisten rakennusten ja patsaiden nimet. Tutkimusmateriaalina on kolme suomenkielistä romaania ja niiden saksankieliset käännökset: Joel Haahtelan Perhoskerääjä (Der Schmetterlingssammler), Kari Hotakaisen Juoksuhaudantie (Aus dem Leben eines unglücklichen Mannes) ja Outi Pakkasen Punainen pallotuoli (Der rote Sessel). Yhteistä näille kolmelle kaunokirjalliselle teokselle on, että niiden tapahtumat sijoittuvat Helsinkiin. Tutkimusmateriaalin keskeisenä valintakriteerinä on ollut, että kunkin romaanin on saksantanut eri kääntäjä. Tutkielman tarkoitus on havainnollistaa esimerkein deskriptiivis-kvalitatiivisesti, kuinka kääntäjä voi toimia, kun lähtöteksti sisältää pulmia tuottavia kulttuurisidonnaisia paikannimiä. Tutkielman teoriaosuudessa tarkastellaan paikannimiä kulttuurisidonnaisina käännösongelmina sekä esitellään, millaisia funktioita paikannimillä voi olla kaunokirjallisessa teoksessa. Teoriaosuudessa pohditaan myös aiempien teorioiden avulla, ovatko paikannimet ylipäätään käännettävissä vieraalle kielelle. Lisäksi esitetään käännöstieteellisiä näkemyksiä siitä, kuinka kääntäjän olisi välitettävä kaunokirjallisen lähtötekstin paikannimet kohdekieleen. Helsingin katujen nimeämisperiaatteita esitellään lyhyesti historian ja nykyajan valossa keskittyen tutkielman kannalta relevantteihin nimiin. Tutkimusmateriaalin analyysin yhtenä perustana on Bödekerin ja Freesen (1987) luoma prototypologia, jossa käännösratkaisuja tarkastellaan ensin leksikaalisella tasolla ja sitten lähtö- ja kohdekielen välisenä etäisyytenä. Kujamäki (1998) on omassa tutkimuksessaan kehittänyt tätä prototypologiaa eteenpäin sulauttamalla yhteen nämä molemmat ulottuvuudet. Samalla hän on jakanut käännösstrategiat yksityiskohtaisempiin luokkiin: vieras-sanalaina (Fremdwortübernahme), käännöslaina (Lehnübersetzung), selittävä kääntäminen (erklärendes Übersetzen), analogia (Anwendung einer Analogie in der Zielsprache), hyperonyyminen käännös (hyperonymische Übersetzung), kohyponyyminen käännös (kohyponymische Übersetzung), assosioiva käännös (assoziative Übersetzung), poisto (Auslassung) ja lisäys (Hinzufügung), jotka toimivat tässä tutkielmassa käännösratkaisujen tarkastelun lähtökohtana. Kujamäen (1998) luokituksesta poiketen lisään luokitukseen puolittaisen käännöslainan (Halblehnübersetzung), määrittelen selittävän kääntämisen luokan siten, että siihen sisältyvät sekä eksplikaatio (Explikation) että kiertoilmaus (Umschreibung), ja jätän Kujamäen käyttämän lisäyksen pois. Analyysissä pyritään esittelemään kulloisenkin paikannimen funktio tekstiympäristössään, minkä pohjalta tarkastellaan kääntäjien tekemiä ratkaisuja. Edellä mainitun luokituksen ohella tuon jokaisen käännösratkaisun kohdalla esiin Bödekerin ja Freesen (1987) luokituksen mukaisen luokkayhdistelmän, jota kulloinenkin kääntäjän tekemä valinta edustaa. Lopputuloksena on pääteltävissä, että ensisijaisesti paikannimen funktio tekstissä vaikuttaa siihen, kuinka nimi välitetään käännöksessä kohdekieliselle lukijalle. Lopuksi todetaan vielä, ettei tämän tutkielman perusteella voi antaa suosituksia, kuinka tulisi toimia välitettäessä kaunokirjallisen tekstin paikannimiä kohdekieleen, vaan tarkoitus havainnollistaa, mitä mahdollisuuksia kääntäjällä on, ja jokainen ratkaisu on punnittava kontekstissaan.

Tax havens and their impacts on the non-haven countries

Tax havens have attracted increasing attention from the authorities of non-haven countries. The financial crisis exacerbates the negative attitude to tax havens. Offshore zones are now under strong pressure from the international, both financial and political institutions. Thus, the thesis will focus on the current problem of the modern economy, namely tax havens and their impact on the non-haven countries. This thesis will be based on the several articles, in particular “Tax Competition With Parasitic Tax Havens” by Joel Slemrod and John D. Wilson (University of Michigan, 2009) and “Do Havens Divert Economic Activity” by James R. Hines Jr., C. Fritz Foley and Mihir A. Desai (Ross School of Business, 2005). This paper provides two completely different and contradictory viewpoints on the problem of coexisting tax havens and non-haven countries. There are two models, examined in this work, present two important researches. The first one will be concentrated on the positive effect from tax havens whereas the last model will be focused on the completely negative effect from offshore jurisdictions. The first model gives us a good explanation and proof of its statement why tax havens can positively influence on nearby high-tax countries. It describes that the existence of offshore jurisdictions can stimulate the growth of operations and facilitates economic activity in non-haven countries. In contrast to above mentioned, the model with quite opposite view was presented. This economic model and its analysis confirms the undesirability of the existence of offshore areas. Taking into consideration, that the jurisdictions choose their optimal policy, the elimination of offshores will have positive impact on the rest of countries. The model proofs the statement that full or partial elimination of tax havens raises the equilibrium level of the public good and increases country welfare. According to the following study, it can be concluded that both of the models provide telling arguments to prove their assertions. Thereby both of these points of view have their right to exist. Nevertheless, the ongoing debate concerning this issue still will raise a lot of questions.

A local 2-approximation algorithm for the vertex cover problem

We present a distributed 2-approximation algorithm for the minimum vertex cover problem. The algorithm is deterministic, and it runs in (Δ + 1)2 synchronous communication rounds, where Δ is the maximum degree of the graph. For Δ = 3, we give a 2-approximation algorithm also for the weighted version of the problem.

A local 2-approximation algorithm for the vertex cover problem

We present a distributed 2-approximation algorithm for the minimum vertex cover problem. The algorithm is deterministic, and it runs in (Δ + 1)2 synchronous communication rounds, where Δ is the maximum degree of the graph. For Δ = 3, we give a 2-approximation algorithm also for the weighted version of the problem.

An optimal local approximation algorithm for max-min linear programs

In a max-min LP, the objective is to maximise ω subject to Ax ≤ 1, Cx ≥ ω1, and x ≥ 0 for nonnegative matrices A and C. We present a local algorithm (constant-time distributed algorithm) for approximating max-min LPs. The approximation ratio of our algorithm is the best possible for any local algorithm; there is a matching unconditional lower bound.

Analysing local algorithms in location-aware quasi-unit-disk graphs

A local algorithm with local horizon r is a distributed algorithm that runs in r synchronous communication rounds; here r is a constant that does not depend on the size of the network. As a consequence, the output of a node in a local algorithm only depends on the input within r hops from the node. We give tight bounds on the local horizon for a class of local algorithms for combinatorial problems on unit-disk graphs (UDGs). Most of our bounds are due to a refined analysis of existing approaches, while others are obtained by suggesting new algorithms. The algorithms we consider are based on network decompositions guided by a rectangular tiling of the plane. The algorithms are applied to matching, independent set, graph colouring, vertex cover, and dominating set. We also study local algorithms on quasi-UDGs, which are a popular generalisation of UDGs, aimed at more realistic modelling of communication between the network nodes. Analysing the local algorithms on quasi-UDGs allows one to assume that the nodes know their coordinates only approximately, up to an additive error. Despite the localisation error, the quality of the solution to problems on quasi-UDGs remains the same as for the case of UDGs with perfect location awareness. We analyse the increase in the local horizon that comes along with moving from UDGs to quasi-UDGs.

Local approximability of max-min and min-max linear programs

In a max-min LP, the objective is to maximise ω subject to Ax ≤ 1, Cx ≥ ω1, and x ≥ 0. In a min-max LP, the objective is to minimise ρ subject to Ax ≤ ρ1, Cx ≥ 1, and x ≥ 0. The matrices A and C are nonnegative and sparse: each row ai of A has at most ΔI positive elements, and each row ck of C has at most ΔK positive elements. We study the approximability of max-min LPs and min-max LPs in a distributed setting; in particular, we focus on local algorithms (constant-time distributed algorithms). We show that for any ΔI ≥ 2, ΔK ≥ 2, and ε > 0 there exists a local algorithm that achieves the approximation ratio ΔI (1 − 1/ΔK) + ε. We also show that this result is the best possible: no local algorithm can achieve the approximation ratio ΔI (1 − 1/ΔK) for any ΔI ≥ 2 and ΔK ≥ 2.

An Algebraic Implicitization and Specialization of Minimum KL-Divergence Models

In this paper we study representation of KL-divergence minimization, in the cases where integer sufficient statistics exists, using tools from polynomial algebra. We show that the estimation of parametric statistical models in this case can be transformed to solving a system of polynomial equations. In particular, we also study the case of Kullback-Csiszar iteration scheme. We present implicit descriptions of these models and show that implicitization preserves specialization of prior distribution. This result leads us to a Grobner bases method to compute an implicit representation of minimum KL-divergence models.

Permanent Genetic Resources added to Molecular Ecology Resources Database 1 August 2010-30 September 2010

This article documents the addition of 229 microsatellite marker loci to the Molecular Ecology Resources Database. Loci were developed for the following species: Acacia auriculiformis x Acacia mangium hybrid, Alabama argillacea, Anoplopoma fimbria, Aplochiton zebra, Brevicoryne brassicae, Bruguiera gymnorhiza, Bucorvus leadbeateri, Delphacodes detecta, Tumidagena minuta, Dictyostelium giganteum, Echinogammarus berilloni, Epimedium sagittatum, Fraxinus excelsior, Labeo chrysophekadion, Oncorhynchus clarki lewisi, Paratrechina longicornis, Phaeocystis antarctica, Pinus roxburghii and Potamilus capax. These loci were cross-tested on the following species: Acacia peregrinalis, Acacia crassicarpa, Bruguiera cylindrica, Delphacodes detecta, Tumidagena minuta, Dictyostelium macrocephalum, Dictyostelium discoideum, Dictyostelium purpureum, Dictyostelium mucoroides, Dictyostelium rosarium, Polysphondylium pallidum, Epimedium brevicornum, Epimedium koreanum, Epimedium pubescens, Epimedium wushanese and Fraxinus angustifolia.