The doctrine of necessity and the detention and restraint of people with intellectual impairment: Is there any justification?

In Australia, the legal basis for the detention and restraint of people with intellectual impairment is ad hoc and unclear. There is no comprehensive legal framework that authorises and regulates the detention of, for example, older people with dementia in locked wards or in residential aged care, people with disability in residential services or people with acquired brain injury in hospital and rehabilitation services. This paper focuses on whether the common law doctrine of necessity (or its statutory equivalents) should have a role in permitting the detention and restraint of people with disabilities. Traditionally, the defence of necessity has been recognised as an excuse, where the defendant, faced by a situation of imminent peril, is excused from the criminal or civil liability because of the extraordinary circumstances they find themselves in. In the United Kingdom, however, in In re F (Mental Patient: Sterilisation) and R v Bournewood Community and Mental Health NHS Trust, ex parte L, the House of Lords broadened the defence so that it operated as a justification for treatment, detention and restraint outside of the emergency context. This paper outlines the distinction between necessity as an excuse and as a defence, and identifies a number of concerns with the latter formulation: problems of democracy, integrity, obedience, objectivity and safeguards. Australian courts are urged to reject the United Kingdom approach and retain an excuse-based defence, as the risks of permitting the essentially utilitarian model of necessity as a justification are too great.

A measure of logical complexity of programs

The research in software science has so far been concentrated on three measures of program complexity: (a) software effort; (b) cyclomatic complexity; and (c) program knots. In this paper we propose a measure of the logical complexity of programs in terms of the variable dependency of sequence of computations, inductive effort in writing loops and complexity of data structures. The proposed complexity mensure is described with the aid of a graph which exhibits diagrammatically the dependence of a computation at a node upon the computation of other (earlier) nodes. Complexity measures of several example programs have been computed and the related issues have been discussed. The paper also describes the role played by data structures in deciding the program complexity.

Recognising the necessity for Indo-Pacific seagrass conservation.

Seagrass meadows are declining globally at an unprecedented rate, yet these valuable ecosystem service providers remain marginalized within many conservation agendas. In the Indo-Pacific, this is principally because marine conservation priorities do not recognize the economic and ecological value of the goods and services that seagrasses provide. Dependency on coastal marine resources in the Indo-Pacific for daily protein needs is high relative to other regions and has been found in some places to be up to 100%. Habitat loss therefore may have negative consequences for food security in the region. Whether seagrass resources comprise an important contribution to this dependency remains largely untested. Here, we assemble information sources from throughout the Indo-Pacific region that discuss shallow water fisheries, and examine the role of seagrass meadows in supporting production, both directly, and indirectly through process of habitat connectivity (e.g., nursery function and foraging areas). We find information to support the premise that seagrass meadows are important for fisheries production. They are important fishery areas, and they support the productivity and biodiversity of coral reefs. We argue the value of a different paradigm to the current consensus on marine conservation priorities within the Indo-Pacific that places seagrass conservation as a priority.

Logical design of a negative binary adder-subtracter

Two different designs for negative binary adder-subtracter are compared. Ono design uses the method of a hybrid-carry—borrow, while the other 11303 the method of polarization and addition.

Necessity for quantum mechanical simulation for the future technology nodes

In this paper we present and compare the results obtained from semi-classical and quantum mechanical simulation for a Double Gate MOSFET structure to analyze the electrostatics and carrier dynamics of this device. The geometries like gate length, body, thickness of this device have been chosen according to the ITRS specification for the different technology nodes. We have shown the extent of deviation between the semi-classical and quantum mechanical results and hence the need of quantum simulations for the promising nanoscale devices in the future technology nodes predicted in ITRS.

Proofs, Paradoxes, and Probabilities : The Logical Turn of Philosophy in Finland

This monograph describes the emergence of independent research on logic in Finland. The emphasis is placed on three well-known students of Eino Kaila: Georg Henrik von Wright (1916-2003), Erik Stenius (1911-1990), and Oiva Ketonen (1913-2000), and their research between the early 1930s and the early 1950s. The early academic work of these scholars laid the foundations for today's strong tradition in logic in Finland and also became internationally recognized. However, due attention has not been given to these works later, nor have they been comprehensively presented together. Each chapter of the book focuses on the life and work of one of Kaila's aforementioned students, with a fourth chapter discussing works on logic by authors who would later become known within other disciplines. Through an extensive use of correspondence and other archived material, some insight has been gained into the persons behind the academic personae. Unique and unpublished biographical material has been available for this task. The chapter on Oiva Ketonen focuses primarily on his work on what is today known as proof theory, especially on his proof theoretical system with invertible rules that permits a terminating root-first proof search. The independency of the parallel postulate is proved as an example of the strength of root-first proof search. Ketonen was to our knowledge Gerhard Gentzen's (the 'father' of proof theory) only student. Correspondence and a hitherto unavailable autobiographic manuscript, in addition to an unpublished article on the relationship between logic and epistemology, is presented. The chapter on Erik Stenius discusses his work on paradoxes and set theory, more specifically on how a rigid theory of definitions is employed to avoid these paradoxes. A presentation by Paul Bernays on Stenius' attempt at a proof of the consistency of arithmetic is reconstructed based on Bernays' lecture notes. Stenius correspondence with Paul Bernays, Evert Beth, and Georg Kreisel is discussed. The chapter on Georg Henrik von Wright presents his early work on probability and epistemology, along with his later work on modal logic that made him internationally famous. Correspondence from various archives (especially with Kaila and Charlie Dunbar Broad) further discusses his academic achievements and his experiences during the challenging circumstances of the 1940s.

Design of logical topologies for wavelength-routed optical networks

his paper studies the problem of designing a logical topology over a wavelength-routed all-optical network (AON) physical topology, The physical topology consists of the nodes and fiber links in the network, On an AON physical topology, we can set up lightpaths between pairs of nodes, where a lightpath represents a direct optical connection without any intermediate electronics, The set of lightpaths along with the nodes constitutes the logical topology, For a given network physical topology and traffic pattern (relative traffic distribution among the source-destination pairs), our objective is to design the logical topology and the routing algorithm on that topology so as to minimize the network congestion while constraining the average delay seen by a source-destination pair and the amount of processing required at the nodes (degree of the logical topology), We will see that ignoring the delay constraints can result in fairly convoluted logical topologies with very long delays, On the other hand, in all our examples, imposing it results in a minimal increase in congestion, While the number of wavelengths required to imbed the resulting logical topology on the physical all optical topology is also a constraint in general, we find that in many cases of interest this number can be quite small, We formulate the combined logical topology design and routing problem described above (ignoring the constraint on the number of available wavelengths) as a mixed integer linear programming problem which we then solve for a number of cases of a six-node network, Since this programming problem is computationally intractable for larger networks, we split it into two subproblems: logical topology design, which is computationally hard and will probably require heuristic algorithms, and routing, which can be solved by a linear program, We then compare the performance of several heuristic topology design algorithms (that do take wavelength assignment constraints into account) against that of randomly generated topologies, as well as lower bounds derived in the paper.

Necessity for quatum simulation for future technology nodes

In this paper we present and compare the results obtained from semi-classical and quantum mechanical simulation for a double gate MOSFET structure to analyze the electrostatics and carrier dynamics of this device. The geometries like gate length, body thickness of this device have been chosen according to the ITRS specification for the different technology nodes. We have shown the extent of deviation between the semi- classical and quantum mechanical results and hence the need of quantum simulations for the promising nanoscale devices in the future technology nodes predicted in ITRS.

Interference Alignment in Regenerating Codes for Distributed Storage: Necessity and Code Constructions

Regenerating codes are a class of recently developed codes for distributed storage that, like Reed-Solomon codes, permit data recovery from any arbitrary of nodes. However regenerating codes possess in addition, the ability to repair a failed node by connecting to any arbitrary nodes and downloading an amount of data that is typically far less than the size of the data file. This amount of download is termed the repair bandwidth. Minimum storage regenerating (MSR) codes are a subclass of regenerating codes that require the least amount of network storage; every such code is a maximum distance separable (MDS) code. Further, when a replacement node stores data identical to that in the failed node, the repair is termed as exact. The four principal results of the paper are (a) the explicit construction of a class of MDS codes for d = n - 1 >= 2k - 1 termed the MISER code, that achieves the cut-set bound on the repair bandwidth for the exact repair of systematic nodes, (b) proof of the necessity of interference alignment in exact-repair MSR codes, (c) a proof showing the impossibility of constructing linear, exact-repair MSR codes for d < 2k - 3 in the absence of symbol extension, and (d) the construction, also explicit, of high-rate MSR codes for d = k+1. Interference alignment (IA) is a theme that runs throughout the paper: the MISER code is built on the principles of IA and IA is also a crucial component to the nonexistence proof for d < 2k - 3. To the best of our knowledge, the constructions presented in this paper are the first explicit constructions of regenerating codes that achieve the cut-set bound.

Necessity of dietary calcium supplement in file fish (Monacanthus cirrhifer)

File fish, Monacanthus cirrhifer, juveniles with initial mean body weight of 0.27g were fed purified diets with or without calcium (Ca) supplement for 10 weeks at a water temperature of 27.0±1.4°C. Growth was significantly low in fish fed diet without Ca supplement than fish fed diet with Ca supplement. Feed efficiency and condition of fish were also significantly decreased in absence of a dietary Ca supplementation, Minerals contents of bone were similar in both the treatment groups and did not appear as a suitable indicator of Ca requirement. It appeared that Ca supplement to the purified diet is necessary for file fish for their proper growth and feed utilization.

Genetic structure and low-genetic diversity suggesting the necessity for conservation of the Chinese Longsnout catfish, Leiocassis longirostris (Pisces : Bagriidae)

Genetic variation and phylogenetic relationship of Leiocassis longirostris populations from the Yangtze River were investigated at mitochondrial DNA level. The samples were collected from the upstream and mid-downstream of the Yangtze River. Three mitochondrial DNA fragments, ND5/6, cytochrome b (Cyt b) and control region (D-loop), were amplified and then digested by 10 restriction endonucleases. Twenty-three D-loop fragments randomly selected were sequenced. Digestion patterns of ND5/6 by AluI and HaeIII, D-loop by HinfI and RsaI, and Cyt b by HaeIII were polymorphic. Ten and eighteen haplotypes were obtained from RFLP data and sequence data, respectively. The individuals from upstream and mid-downstream of the Yangtze River were apparently divided into two groups. The average genetic distance was 0.008 and 0.010 according to the two data. Low diversities and decreasing abundance indicated that Leiocassis longirostris may be in severe danger and reasonable measures of fishery management should be taken.