3,234 research outputs found
Jack, Rene and Neil
No full textMr Jack and Mrs Rene Hawley and Neil, taken at Tomahawk Billabong, Hooker Creek Native Settlement, Northern Territory.Kettle, Ellen.Date:195
Facing the Future: the Changing Shape of Academic Skills Support at Bournemouth University
No full textThis paper explores the potential impact of changes to higher education in England on student expectations, engagement, lifestyles and diversity, and outlines implications for the development of digital literacy within academic skills support at Bournemouth University (BU). We will investigate how tackling resource constraints with organisational change can also enable efficient, centralised provision of support materials that utilise networks to overcome the risk of fragmented support for digital literacy. We will also look at how changing delivery modes for support can accommodate changing student lifestyles whilst tackling a weakness of centralised support for digital literacy: that it can become detached from the student’s subject-focused academic practice. Finally we will explore how involving students in developing support can help us to face changes to student expectations and engagement whilst ensuring that materials are authentic and speak to learners in their own voice
Why Privacy Matters: An Interview with Neil Richards
No full textProfessor Daniel J. Solove discusses the book \u27Why Privacy Matters\u27 and the future of privacy with the author, Professor Neil Richards
Interview with AntipodeFoundation.org: “Much More Than You Think: The Spatialities of Italian Autonomy” – Interview with Neil Gray, author of “Beyond the Right to the City: Territorial Autogestion and the Take over the City Movement in 1970s Italy”
No full textNo abstract available
Jere Nash Interview with Neil McMillen (Part 2 of 2)
No full textInterview conducted by author Jere Nash with University of Southern Mississippi history professor Neil R. McMillen in the process of writing Mississippi Politics: The Struggle for Power, 1976-2006. Topics discussed include Aaron Henry; race relations after the civil rights movement; and William Winter
Maximizing Research Impact Through Institutional and National Open-Access Self-Archiving Mandates
No full textNo research institution can afford all the journals its researchers may need, so all articles are losing research impact (usage and citations). Articles made “Open Access,” (OA) by self-archiving them on the web are cited twice as much, but only 15% of articles are being spontaneously self-archived. The only institutions approaching 100% self-archiving are those that mandate it. Surveys show that 95% of authors will comply with a self-archiving mandate; the actual expe-rience of institutions with mandates has confirmed this. What institutions and funders need to mandate is that (1) immediately upon acceptance for publication, (2) the author’s final draft must be (3) deposited into the Institutional Repository. Only the depositing needs to be mandated; set-ting access privileges to the full-text as either OA or Restricted Access (RA) can be left up to the author. For articles published in the 93% of journals that have already endorsed self-archiving, access can be set as OA immediately; for the remaining 7%, authors can email the eprint in re-sponse to individual email requests automatically forwarded by the Repository
Gaiman, Neil
No full textA brief description of the main characteristics of the works for children of the British author Neil Gaiman, the themes he privileges in his stories, the way he portrays children and the relationship between children and adults
Dissimilarity is used as evidence of category membership in multidimensional perceptual categorization: a test of the similarity-dissimilarity generalized context model
No full textIn exemplar models of categorization, the similarity between an exemplar and category members constitutes evidence that the exemplar belongs to the category. We test the possibility that the dissimilarity to members of competing categories also contributes to this evidence. Data were collected from two 2-dimensional perceptual categorization experiments, one with lines varying in orientation and length and the other with coloured patches varying in saturation and brightness. Model fits of the similarity-dissimilarity generalized context model were used to compare a model where only similarity was used with a model where both similarity and dissimilarity were used. For the majority of participants the similarity-dissimilarity model provided both a significantly better fit and better generalization, suggesting that people do also use dissimilarity as evidence
Jere Nash Interview with Neil McMillen (Part 1 of 2)
No full textInterview conducted by author Jere Nash with University of Southern Mississippi history professor Neil R. McMillen in the process of writing Mississippi Politics: The Struggle for Power, 1976-2006. Topics dicussed include race and politics in Mississippi; southern historians including Dewey Grantham, C. Vann Woodward, Numan V. Bartley, John Boles; segregation in Mississippi and resistance to change; genesis of McMillin\u27s book Dark Journey; fifteenth Freedom Summer reunion at Millsaps and Tougaloo; John Ditmer; contributing to A History of Mississippi edited by Richard Aubrey McLemore and reaction by the public and University of Southern Mississippi officials; hiring of African American faculty at USM; M.M. Roberts; and William D. McCain
Anytime Algorithms for ROBDD Symmetry Detection and Approximation
No full textReduced Ordered Binary Decision Diagrams (ROBDDs) provide a dense and memory efficient representation of Boolean functions. When ROBDDs are applied in logic synthesis, the problem arises of detecting both classical and generalised symmetries. State-of-the-art in symmetry detection is represented by Mishchenko's algorithm. Mishchenko showed how to detect symmetries in ROBDDs without the need for checking equivalence of all co-factor pairs. This work resulted in a practical algorithm for detecting all classical symmetries in an ROBDD in O(|G|3) set operations where |G| is the number of nodes in the ROBDD. Mishchenko and his colleagues subsequently extended the algorithm to find generalised symmetries. The extended algorithm retains the same asymptotic complexity for each type of generalised symmetry. Both the classical and generalised symmetry detection algorithms are monolithic in the sense that they only return a meaningful answer when they are left to run to completion. In this thesis we present efficient anytime algorithms for detecting both classical and generalised symmetries, that output pairs of symmetric variables until a prescribed time bound is exceeded. These anytime algorithms are complete in that given sufficient time they are guaranteed to find all symmetric pairs. Theoretically these algorithms reside in O(n3+n|G|+|G|3) and O(n3+n2|G|+|G|3) respectively, where n is the number of variables, so that in practice the advantage of anytime generality is not gained at the expense of efficiency. In fact, the anytime approach requires only very modest data structure support and offers unique opportunities for optimisation so the resulting algorithms are very efficient. The thesis continues by considering another class of anytime algorithms for ROBDDs that is motivated by the dearth of work on approximating ROBDDs. The need for approximation arises because many ROBDD operations result in an ROBDD whose size is quadratic in the size of the inputs. Furthermore, if ROBDDs are used in abstract interpretation, the running time of the analysis is related not only to the complexity of the individual ROBDD operations but also the number of operations applied. The number of operations is, in turn, constrained by the number of times a Boolean function can be weakened before stability is achieved. This thesis proposes a widening that can be used to both constrain the size of an ROBDD and also ensure that the number of times that it is weakened is bounded by some given constant. The widening can be used to either systematically approximate an ROBDD from above (i.e. derive a weaker function) or below (i.e. infer a stronger function). The thesis also considers how randomised techniques may be deployed to improve the speed of computing an approximation by avoiding potentially expensive ROBDD manipulation
- …
