Interview with Paul DeMarinis

Since the early 1970s, the American electronic media artist Paul DeMarinis (b. 1948, Cleveland, Ohio, USA) has created works that re-imagine modes of communication and reinvent the technologies that enable communication. His works (see Table 1) have taken shape as recordings, performances, electronic inventions, and site-specific and interactive installations; many are considered landmarks in the histories of electronic music and media art. Paul DeMarinis pioneered live performance with computers, collaborated on landmark works with artists like David Tudor and Robert Ashley, undertook several tours with the Merce Cunningham Dance Company, and brought to life obscure technologies such as the flame loudspeaker (featured in his 2004 sculpture Firebirds). His interactive installation The Music Room (1982), commissioned by Frank Oppenheimer for the Exploratorium in San Francisco, was the first automatic music work to reach a significant audience. His album Music As A Second Language (1991) marks one of the most extensive explorations of the synthesized voice and speech melodies to date. Installations like The Edison Effect (1989-1993), in which lasers scan ancient recordings to produce music, and The Messenger (1998/2005), in which electronic mail messages are displayed on alphabetic telegraph receivers, illustrate a creative process that Douglas Kahn (1994) has called "reinventing invention." [etc]

Making Sense of Leaving Care: The contribution of Bridges Model of Transition to Understanding the Psycho-social process.

This paper is based on research into the transition of young people leaving public care in Romania. Using this specific country example, the paper aims to contribute to present understandings of the psycho-social transition of young people from care to independent living by introducing the use of Bridges (2002) to build on existing theories and literature. The research discussed involved mixed methods design and was implemented in three phases: semi-structured interviews with 34 care leavers, focus groups with 32 professionals, and a professional-service user working group. The overall findings confirmed that young people experience two different, but interconnected transitions - social and psychological - which take place at different paces. A number of theoretical perpectives are explored to make sense of this transition including attachment theory, focal theory and identity. In addition, a new model for understanding the complex process of transitions was adapted from Bridges’ (2002) to capture the clear complexity of transition which the findings demonstrated in terms of their psycho-social transition. The paper concludes with messages for leaving and after care services with an emphasis on managing the psycho-social transition from care to independent living.

Unconscious Vigilance: Worldview Defense without Adaptations for Terror, Coalition or Uncertainty Management

Individuals subtly reminded of death, coalitional challenges, or feelings of uncertainty display exaggerated preferences for affirmations and against criticisms of their cultural in-groups. Terror management, coalitional psychology, and uncertainty management theories postulate this “worldview defense” effectas the output of mechanisms evolved either to allay the fear of death, foster social support, or reduce anxiety by increasing adherence to cultural values. In 4 studies, we report evidence for an alternative perspective. We argue that worldview defense owes to unconscious vigilance, a state of accentuatedreactivity to affective targets (which need not relate to cultural worldviews) that follows detection of subtle alarm cues (which need not pertain to death, coalitional challenges, or uncertainty). In Studies 1 and 2, death-primed participants produced exaggerated ratings of worldview-neutral affective targets. In Studies 3 and 4, subliminal threat manipulations unrelated to death, coalitional challenges, or uncertaintyevoked worldview defense. These results are discussed as they inform evolutionary interpretations of worldview defense and future investigations of the influence of unconscious alarm on judgment.

The Critical Reading of the Images Associated with Science-Related News Reports: Establishing a knowledge, skills, and attitudes framework

For the majority of adults, the media constitute their main source of information about science and science-related matters impacting on society. To help prepare young people to engage with science in the media, teachers are being exhorted to equip their students with the knowledge, skills, and attitudes to respond critically to science-related news reports. Typically, such reports comprise not only text, but also visual elements. These images are not simply adjuncts to the written word; they are integral to meaning-making. Though science teachers make considerable use of newspaper images, they tend to view these representations unproblematically, underestimating their potential ambiguity, complexity, and role in framing media messages. They rarely aim to develop students’ ability to ‘read’, critically, such graphics. Moreover, research into how this might be achieved is limited and, consequently, research-informed guidance which could support this instruction is lacking. This paper describes a study designed to formulate a framework for such teaching. Science communication scholars, science journalists and media educators with acknowledged relevant expertise were surveyed to ascertain what knowledge, skills, and attitudes they deemed useful to engagement with science related news images. Their proposals were recast as learning intentions (instructional objectives), and science and English teachers collaborated to suggest which could be addressed with secondary school students and the age group best suited to their introduction. The outcome is an inventory of learning intentions on which teachers could draw to support their planning of instructional sequences aimed at developing students’ criticality in respect of the totality of science news reports.

Perceived relevance and foods with health-related claims

Although consumer perception of the health claims and nutrition information has been studied widely there is relatively little understanding about the motivational factors underpinning claim perception. The objective of this study is to investigate how levels of perceived relevance influence consumers’ responses to health claims that either promise to reduce a targeted disease risk or improve well-being in comparison to other types of health-related messages, and how attitudes towards nutritionally healthy eating, functional food and previous experience relating to products with health claims affect the consumers’ perceptions of nutrition and health claims. The data (N=2385) were collected by paper and pencil surveys in Finland, the UK, Germany and Italy on a target group of consumers over 35 year old, solely or jointly responsible for the family’s food shopping. The results showed that relevance has a strong influence on perceptions of personal benefit and willingness to buy products with health claims. However the impact of relevance is much stronger when the health risks are relevant to self than when it is relevant to those close to oneself, especially when the claim promises a targeted risk reduction with detailed information about function and health outcome. Previous experience with products with health claims and interest in nutritionally healthy eating promoted the utility of all claims, regardless of whether they were health or nutrition claims. However, to be influenced by health claims consumers also need to have a positive attitude towards functional food products.

An Examination of Volunteer Motivation in Credit Unions: Informing Volunteer Resource Management

Volunteer recruitment and retention is a problem that most credit unions experience. Research suggests that knowledge of volunteer motivation can inform volunteer management strategies. This paper uses a survey approach to determine whether current volunteers in credit unions in Northern Ireland are more motivated by the actual act of volunteering, by the output from the volunteering activity (including altruism) or because the volunteering activity increases their human capital value. Altruistic reasons are found to be the most influential, with the act of volunteering also scoring highly. This knowledge should inform volunteer recruitment programmes and internal appraisal processes as management can reinforce messages that provide positive feedback to volunteers on the social benefits being achieved by the credit union. This will further motivate current volunteers, ensuring retention. When motivation was analyzed by volunteer characteristics we found that older volunteers, retired volunteers and volunteers who are less educated are more motivated in their role. There was little evidence that individuals volunteer to improve their human capital worth.

Logic feels so good-I like it! Evidence for intuitive detection of logicality in syllogistic reasoning

When people evaluate syllogisms, their judgments of validity are often biased by the believability of the conclusions of the problems. Thus, it has been suggested that syllogistic reasoning performance is based on an interplay between a conscious and effortful evaluation of logicality and an intuitive appreciation of the believability of the conclusions (e.g., Evans, Newstead, Allen, & Pollard, 1994). However, logic effects in syllogistic reasoning emerge even when participants are unlikely to carry out a full logical analysis of the problems (e.g., Shynkaruk & Thompson, 2006). There is also evidence that people can implicitly detect the conflict between their beliefs and the validity of the problems, even if they are unable to consciously produce a logical response (e.g., De Neys, Moyens, & Vansteenwegen, 2010). In 4 experiments we demonstrate that people intuitively detect the logicality of syllogisms, and this effect emerges independently of participants' conscious mindset and their cognitive capacity. This logic effect is also unrelated to the superficial structure of the problems. Additionally, we provide evidence that the logicality of the syllogisms is detected through slight changes in participants' affective states. In fact, subliminal affective priming had an effect on participants' subjective evaluations of the problems. Finally, when participants misattributed their emotional reactions to background music, this significantly reduced the logic effect.

In Demand: Therapeutic Services for Children and Young People Who Have Experienced Sexual Abuse

This paper describes the key findings of an NSPCC study estimating need, in the UK, for therapeutic services for children who have experienced sexual abuse. This is based upon current estimates of the prevalence and impact of sexual abuse towards children and young people against the availability of therapeutic services in the UK. Data were collected on service location, availability, scope and coverage across England, Wales, Northern Ireland and Scotland. Researchers: (1) mapped 508 services; (2) collected data from 195 services via a structured questionnaire; (3) followed up 21 service managers and 11 service commissioners with a semi-structured interview; and (4) carried out two focus groups with young people. Data were collected on service location, availability, scope and coverage The overall level of specialist provision is low, with less than one service available per 10 000 children and young people in the UK. Calculations of need indicate that 57 156 children across the UK in the last year may have been unable to access a service. Findings from services support the view that need outstrips availability; that referral routes are limited, leaving few options for young people who have been raped or seriously sexually assaulted to directly access support; that significant waiting lists mean services must focus on reactive, rather than preventive, work; and that services are less accessible for certain groups, especially sexually abused teenagers, children with disabilities and those from Black, Asian, Minority Ethnic and Refugee backgrounds. Copyright (c) 2012 John Wiley & Sons, Ltd. Key Practitioner Messages Relevant professionals must be adequately trained to talk to children about sexual abuse and to identify those vulnerable in order to identify need. Expert specialist services are well placed to share learning on early help and identification with broader children's service providers. Active steps need to be taken by commissioners in consultation with young people, voluntary sector and adult sexual violence service providers to meet the shortfall at the level of local authorities.

International on-line reciprocal peer tutoring to promote modern language development in primary schools

The paper reports data from an on-line peer tutoring project. In the project 78, 9–12-year-old students from Scotland and Catalonia peer tutored each other in English and Spanish via a managed on-line envi- ronment. Significant gains in first language (Catalonian pupils) modern language (Scottish pupils) and attitudes towards modern languages (both Catalonian and Scottish pupils) were reported for the exper- imental group as compared to the control group. Results indicated that pupils tutored each other in using Piagetian techniques of error correction during the project. Error correction provided by tutors to tutees focussed on morph syntaxys, more specifically the correction of verbs. Peer support provided via the on- line environment was predominantly based on the tutor giving the right answer to the tutee. High rates of impact on tutee corrected messages were observed. The implications for peer tutoring initiative taking place via on-line environments are discussed. Implications for policy and practice are explored

Supernatural Beliefs, Unconscious Threat and Judgment Bias in Tibetan Buddhists

Individuals who have been subtly reminded of death display heightened in-group favouritism, or “worldview defense.” Terror management theory argues (i) that death cues engender worldview defense via psychological mechanisms specifically evolved to suppress death anxiety, and (ii) that the core function of religiosity is to suppress death anxiety. Thus, terror management theory predicts that extremely religious individuals will not evince worldview defense. Here, two studies are presented in support of an alternative perspective. According to the unconscious vigilance hypothesis, subtly processed threats (which need not pertain to death) heighten sensitivity to affectively valenced stimuli (which need not pertain to cultural attitudes). From this perspective, religiosity mitigates the influence of mortality-salience only insofar as afterlife doctrines reduce the perceived threat posed by death. Tibetan Buddhism portrays death as a perilous gateway to rebirth rather than an end to suffering; faith in this doctrine should therefore not be expected to nullify mortality-salience effects. In Study 1, devout Tibetan Buddhists who were subtly reminded of death produced exaggerated aesthetic ratings unrelated to cultural worldviews. In Study 2, devout Tibetan Buddhists produced worldview defense following subliminal exposure to non-death cues of threat. The results demonstrate both the domain-generality of the process underlying worldview defense and the importance of religious doctrinal content in moderating mortality-salience effects.

On the Complexity of Universal Leader Election

Electing a leader is a fundamental task in distributed computing. In its implicit version, only the leader must know who is the elected leader. This paper focuses on studying the message and time complexity of randomized implicit leader election in synchronous distributed networks. Surprisingly, the most "obvious" complexity bounds have not been proven for randomized algorithms. The "obvious" lower bounds of O(m) messages (m is the number of edges in the network) and O(D) time (D is the network diameter) are non-trivial to show for randomized (Monte Carlo) algorithms. (Recent results that show that even O(n) (n is the number of nodes in the network) is not a lower bound on the messages in complete networks, make the above bounds somewhat less obvious). To the best of our knowledge, these basic lower bounds have not been established even for deterministic algorithms (except for the limited case of comparison algorithms, where it was also required that some nodes may not wake up spontaneously, and that D and n were not known).

We establish these fundamental lower bounds in this paper for the general case, even for randomized Monte Carlo algorithms. Our lower bounds are universal in the sense that they hold for all universal algorithms (such algorithms should work for all graphs), apply to every D, m, and n, and hold even if D, m, and n are known, all the nodes wake up simultaneously, and the algorithms can make anyuse of node's identities. To show that these bounds are tight, we present an O(m) messages algorithm. An O(D) time algorithm is known. A slight adaptation of our lower bound technique gives rise to an O(m) message lower bound for randomized broadcast algorithms.

An interesting fundamental problem is whether both upper bounds (messages and time) can be reached simultaneously in the randomized setting for all graphs. (The answer is known to be negative in the deterministic setting). We answer this problem partially by presenting a randomized algorithm that matches both complexities in some cases. This already separates (for some cases) randomized algorithms from deterministic ones. As first steps towards the general case, we present several universal leader election algorithms with bounds that trade-off messages versus time. We view our results as a step towards understanding the complexity of universal leader election in distributed networks.

Sublinear Bounds for Randomized Leader Election

This paper concerns randomized leader election in synchronous distributed networks. A distributed leader election algorithm is presented for complete n-node networks that runs in O(1) rounds and (with high probability) takes only O(n-vlog3/2n) messages to elect a unique leader (with high probability). This algorithm is then extended to solve leader election on any connected non-bipartiten-node graph G in O(t(G)) time and O(t(G)n-vlog3/2n) messages, where t(G) is the mixing time of a random walk on G. The above result implies highly efficient (sublinear running time and messages) leader election algorithms for networks with small mixing times, such as expanders and hypercubes. In contrast, previous leader election algorithms had at least linear message complexity even in complete graphs. Moreover, super-linear message lower bounds are known for time-efficientdeterministic leader election algorithms. Finally, an almost-tight lower bound is presented for randomized leader election, showing that O(n-v) messages are needed for any O(1) time leader election algorithm which succeeds with high probability. It is also shown that O(n 1/3) messages are needed by any leader election algorithm that succeeds with high probability, regardless of the number of the rounds. We view our results as a step towards understanding the randomized complexity of leader election in distributed networks.

Load Balanced Scalable Byzantine Agreement through Quorum Building, with Full Information

We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the adversary is malicious, controls a constant fraction of processors, and can view all messages in a round before sending out its own messages for that round. Furthermore, each bad processor may send an unlimited number of messages. The only constraint on the adversary is that it must choose its corrupt processors at the start, without knowledge of the processors’ private random bits.

A good quorum is a set of O(logn) processors, which contains a majority of good processors. In this paper, we give a synchronous algorithm which uses polylogarithmic time and Õ(vn) bits of communication per processor to bring all processors to agreement on a collection of n good quorums, solving Byzantine agreement as well. The collection is balanced in that no processor is in more than O(logn) quorums. This yields the first solution to Byzantine agreement which is both scalable and load-balanced in the full information model.

The technique which involves going from situation where slightly more than 1/2 fraction of processors are good and and agree on a short string with a constant fraction of random bits to a situation where all good processors agree on n good quorums can be done in a fully asynchronous model as well, providing an approach for extending the Byzantine agreement result to this model.

The forgiving tree: a self-healing distributed data structure

We consider the problem of self-healing in peer-to-peer networks that are under repeated attack by an omniscient adversary. We assume that the following process continues for up to n rounds where n is the total number of nodes initially in the network: the adversary deletesan arbitrary node from the network, then the network responds by quickly adding a small number of new edges.

We present a distributed data structure that ensures two key properties. First, the diameter of the network is never more than O(log Delta) times its original diameter, where Delta is the maximum degree of the network initially. We note that for many peer-to-peer systems, Delta is polylogarithmic, so the diameter increase would be a O(loglog n) multiplicative factor. Second, the degree of any node never increases by more than 3 over its original degree. Our data structure is fully distributed, has O(1) latency per round and requires each node to send and receive O(1) messages per round. The data structure requires an initial setup phase that has latency equal to the diameter of the original network, and requires, with high probability, each node v to send O(log n) messages along every edge incident to v. Our approach is orthogonal and complementary to traditional topology-based approaches to defending against attack.

Brief announcement: Maintaining large dense subgraphs on dynamic networks

In distributed networks, some groups of nodes may have more inter-connections, perhaps due to their larger bandwidth availability or communication requirements. In many scenarios, it may be useful for the nodes to know if they form part of a dense subgraph, e.g., such a dense subgraph could form a high bandwidth backbone for the network. In this work, we address the problem of self-awareness of nodes in a dynamic network with regards to graph density, i.e., we give distributed algorithms for maintaining dense subgraphs (subgraphs that the member nodes are aware of). The only knowledge that the nodes need is that of the dynamic diameter D, i.e., the maximum number of rounds it takes for a message to traverse the dynamic network. For our work, we consider a model where the number of nodes are fixed, but a powerful adversary can add or remove a limited number of edges from the network at each time step. The communication is by broadcast only and follows the CONGEST model in the sense that only messages of O(log n) size are permitted, where n is the number of nodes in the network. Our algorithms are continuously executed on the network, and at any time (after some initialization) each node will be aware if it is part (or not) of a particular dense subgraph. We give algorithms that approximate both the densest subgraph, i.e., the subgraph of the highest density in the network, and the at-least-k-densest subgraph (for a given parameter k), i.e., the densest subgraph of size at least k. We give a (2 + e)-approximation algorithm for the densest subgraph problem. The at-least-k-densest subgraph is known to be NP-hard for the general case in the centralized setting and the best known algorithm gives a 2-approximation. We present an algorithm that maintains a (3+e)-approximation in our distributed, dynamic setting. Our algorithms run in O(Dlog n) time. © 2012 Authors.