1,727,082 research outputs found
Webscience, 'social machines' and principles for redesigning theories of agency: a prolegomenon
This paper argues that the advent of the WWW and the principles now developing for the move ‘social machines’ has posed serious challenges to traditional social theory. In particular, it is argued that the concept of social machines and the forms of distributed agency they imply amplify ‘deep flaws’ in the underlying principles of current agency theories that make empirical work using such frameworks ‘undecidable’. The occasioning of social machines and the WWW here are examined for the ways in which the traditional models of agency, involving reflexivity/skill dynamics, can be dismantled and new principles for re-designed agency theory posed. One key problem and three re-design principles are identified
The Ability of Cyanobacterial Cells to Restore UV-B Radiation Induced Damage to Photosystem II is Influenced by Photolyase Dependent DNA Repair
Damage of DNA and Photosystem-II are among the most significant effects of UV-B irradiation in photosynthetic organisms. Both damaged DNA and Photosystem-II can be repaired, which represent important defense mechanisms against detrimental UV-B effects. Correlation of Photosystem-II damage and repair with the concurrent DNA damage and repair was investigated in the cyanobacterium Synechocystis PCC6803 using its wild type and a photolyase deficient mutant, which is unable to repair UV-B induced DNA damages. A significant amount of damaged DNA accumulated during UV-B exposure in the photolyase mutant concomitant with decreased Photosystem-II activity and D1 protein amount. The transcript level of psbA3, which is a UV-responsive copy of the psbA gene family encoding the D1 subunit of the Photosystem-II reaction center, is also decreased in the photolyase mutant. The wild-type cells, however, did not accumulate damaged DNA during UV-B exposure, suffered smaller losses of Photosystem-II activity and D1 protein, and maintained higher level of psbA3 transcripts than the photolyase mutant. It is concluded that the repair capacity of Photosystem-II depends on the ability of cells to repair UV-B-damaged DNA through maintaining the transcription of genes, which are essential for protein synthesis-dependent repair of the Photosystem-II reaction center
Partnerships in maths: parents and schools: the IMPACT project
The IMPACT Project involves individuals concerned with formal maths education and aims to bring parents and children together to share in maths activities. Each part of this book focuses on a particular aspect of parental involvement.Written by authors well known in their fields, Merttens and Vass bring together diverse and different views on IMPACT of wide reading appeal. In the current economy, should teachers be regarded as producers and parents as consumers? There is no issue in education more urgent than that concerning the relationships between parents, teachers and children. The IMPACT project involves individuals concerned with formal maths education including students, teachers, parents, governors, researchers, inspectors and education officers. Its primary aim is to bring together parents and children so they share regular maths activities together, the results of which are brought back into class to inform the following week's work. IMPACT is also an initiative in maths INSET training and a form of monitoring.; The book is aimed at therapists, educational psychologists, education students, teachers, academics, parents, governors, inspectors and education officers
Probation day centres as an alternative to custody : a 'Trojan Horse' examined. by Antony A. Vass
tag=1 data=Probation day centres as an alternative to custody : a 'Trojan Horse' examined. by Antony A. Vass.
tag=2 data=Vass, Antony A.%Weston, Alan
tag=3 data=British Journal of Criminology.
tag=4 data=30
tag=5 data=2
tag=6 data=Spring 1990
tag=7 data=189-206.
tag=8 data=PRISONS%CRIME & CRIMINALS
tag=9 data=ALTERNATIVES TO CUSTODY
tag=10 data=The authors briefly review the 'dispersal of discipline' thesis and suggest that the assumption that alternatives to custody do more harm than good by widening the net of surveillance and social control has serious limitations. Provided by MICAH, Canberra.
tag=11 data=1990/2/10
tag=12 data=360
tag=13 data=CABThe authors briefly review the 'dispersal of discipline' thesis and suggest that the assumption that alternatives to custody do more harm than good by widening the net of surveillance and social control has serious limitations. Provided by MICAH, Canberra
Correction to: The possibilities and practicalities of professional learning in support of Indigenous student experiences in schooling: A systematic review
Correction to: The Australian Educational Researcher https://doi.org/10.1007/s13384-019-00313-7
In the original publication of the article, the author group was incorrectly published without the co-authors. The correct author group is “Greg Vass, Kevin Lowe, Cathie Burgess, Neil Harrison, Nikki Moodie”.No Full Tex
Vass Street Tree PLan
This is a street tree plan for Vass, North Carolina, covering the contiguous area of the Town of Vass as of December 2022. It is meant to serve as an advisory public policy document for Vass's street tree planting and maintenance program. It explains the benefits of street trees and trees in other public spaces, situates the pursuit of a street tree program within Vass’s ecological landscape, history, and its current physical and legal environment, establishes goals, policies, and implementation strategies for a street tree program in Vass, and prescribes a suite of appropriate tree species.Master of City and Regional Plannin
Regular Separators for {VASS} Coverability Languages
We study regular separators of vector addition systems (VASS, for short) with coverability semantics. A regular language R is a regular separator of languages K and L if K ⊆ R and L ∩ R = ∅. It was shown by Czerwiński, Lasota, Meyer, Muskalla, Kumar, and Saivasan (CONCUR 2018) that it is decidable whether, for two given VASS, there exists a regular separator. In fact, they show that a regular separator exists if and only if the two VASS languages are disjoint. However, they provide a triply exponential upper bound and a doubly exponential lower bound for the size of such separators and leave open which bound is tight.
We show that if two VASS have disjoint languages, then there exists a regular separator with at most doubly exponential size. Moreover, we provide tight size bounds for separators in the case of fixed dimensions and unary/binary encodings of updates and NFA/DFA separators. In particular, we settle the aforementioned question.
The key ingredient in the upper bound is a structural analysis of separating automata based on the concept of basic separators, which was recently introduced by Czerwiński and the second author. This allows us to determinize (and thus complement) without the powerset construction and avoid one exponential blowup
Ruston, Frederick Vass, 6509
This record was harvested from a previous catalogue system and will be withdrawn in 2025. Information in this record may be superseded or incomplete. Visit this record in UMA's new catalogue at: https://archives.library.unimelb.edu.au/nodes/view/414835Surname: RUSTON. Given Name(s) or Initials: FREDERICK VASS. Military Service Number or Last Known Location: 6509. Missing, Wounded and Prisoner of War Enquiry Card Index Number: 27894.234852
Item: [2016.0049.47096] "Ruston, Frederick Vass, 6509
Universality Problem for Unambiguous VASS
We study languages of unambiguous VASS, that is, Vector Addition Systems with States, whose transitions read letters from a finite alphabet, and whose acceptance condition is defined by a set of final states (i.e., the coverability language). We show that the problem of universality for unambiguous VASS is ExpSpace-complete, in sheer contrast to Ackermann-completeness for arbitrary VASS, even in dimension 1. When the dimension d ∈ ℕ is fixed, the universality problem is PSpace-complete if d ≥ 2, and coNP-hard for 1-dimensional VASSes (also known as One Counter Nets)
Deciding Polynomial Termination Complexity for VASS Programs
We show that for every fixed degree k ≥ 3, the problem whether the termination/counter complexity of a given demonic VASS is O(n^k), Ω(n^k), and Θ(n^k) is coNP-complete, NP-complete, and DP-complete, respectively. We also classify the complexity of these problems for k ≤ 2. This shows that the polynomial-time algorithm designed for strongly connected demonic VASS in previous works cannot be extended to the general case. Then, we prove that the same problems for VASS games are PSPACE-complete. Again, we classify the complexity also for k ≤ 2. Tractable subclasses of demonic VASS and VASS games are obtained by bounding certain structural parameters, which opens the way to applications in program analysis despite the presented lower complexity bounds
- …
