Rights, Rationality and Reproduction: Balancing Interests in the Abortion Debate

As medical technology has advanced, so too have our attitudes towards the level of control we can or should expect to have over our procreative capacities. This creates a multidimensional problem for the law and family planning services in terms of access to services – whether to avoid conception or terminate a pregnancy – and the negligent provision of these services. These developments go to the heart of our perception of autonomy. Unsurprisingly, these matters also raise a moral dilemma for the law. Distinctively, discourse in this area is dominated by assertions of subjective moral value; in relation to life, to personal choice and to notions of the archetypal family. Against this, I stress that a model of objective morality can answer these challenging questions and resolve the inherent problems of legal regulation. Therefore, I argue that notions of autonomy must be based on a rational, action-based understanding of what it means to be a ‘moral agent’. I claim that from this we might support a legal standard, based on objective rational morality, which can frame our constitutional norms and our conception of justice in these contentious areas. This paper claims that the current regulation of abortion is outdated and requires radical reform. It proposes a scheme that would shift the choice towards the mother (and the father), remove the unnecessarily broad disability ground and involve doctors having a role of counsel (rather than gatekeeper).

Energy efficient scheduling for cluster-tree wireless sensor networks with time-bounded data flows: application to IEEE 802.15.4/ZigBee

Cluster scheduling and collision avoidance are crucial issues in large-scale cluster-tree Wireless Sensor Networks (WSNs). The paper presents a methodology that provides a Time Division Cluster Scheduling (TDCS) mechanism based on the cyclic extension of RCPS/TC (Resource Constrained Project Scheduling with Temporal Constraints) problem for a cluster-tree WSN, assuming bounded communication errors. The objective is to meet all end-to-end deadlines of a predefined set of time-bounded data flows while minimizing the energy consumption of the nodes by setting the TDCS period as long as possible. Sinceeach cluster is active only once during the period, the end-to-end delay of a given flow may span over several periods when there are the flows with opposite direction. The scheduling tool enables system designers to efficiently configure all required parameters of the IEEE 802.15.4/ZigBee beaconenabled cluster-tree WSNs in the network design time. The performance evaluation of thescheduling tool shows that the problems with dozens of nodes can be solved while using optimal solvers.

Simulation study of energy efficient scheduling for IEEE 802.15.4/ZigBee cluster-treeWireless Sensor Networks with time-bounded data flows

The simulation analysis is important approach to developing and evaluating the systems in terms of development time and cost. This paper demonstrates the application of Time Division Cluster Scheduling (TDCS) tool for the configuration of IEEE 802.15.4/ZigBee beaconenabled cluster-tree WSNs using the simulation analysis, as an illustrative example that confirms the practical applicability of the tool. The simulation study analyses how the number of retransmissions impacts the reliability of data transmission, the energy consumption of the nodes and the end-to-end communication delay, based on the simulation model that was implemented in the Opnet Modeler. The configuration parameters of the network are obtained directly from the TDCS tool. The simulation results show that the number of retransmissions impacts the reliability, the energy consumption and the end-to-end delay, in a way that improving the one may degrade the others.

Time-bounded distributed QoS-aware service configuration in heterogeneous cooperative environments

The scarcity and diversity of resources among the devices of heterogeneous computing environments may affect their ability to perform services with specific Quality of Service constraints, particularly in dynamic distributed environments where the characteristics of the computational load cannot always be predicted in advance. Our work addresses this problem by allowing resource constrained devices to cooperate with more powerful neighbour nodes, opportunistically taking advantage of global distributed resources and processing power. Rather than assuming that the dynamic configuration of this cooperative service executes until it computes its optimal output, the paper proposes an anytime approach that has the ability to tradeoff deliberation time for the quality of the solution. Extensive simulations demonstrate that the proposed anytime algorithms are able to quickly find a good initial solution and effectively optimise the rate at which the quality of the current solution improves at each iteration, with an overhead that can be considered negligible.

Particle swarm optimization for two-connected networks with bounded rings

The Two-Connected Network with Bounded Ring (2CNBR) problem is a network design problem addressing the connection of servers to create a survivable network with limited redirections in the event of failures. Particle Swarm Optimization (PSO) is a stochastic population-based optimization technique modeled on the social behaviour of flocking birds or schooling fish. This thesis applies PSO to the 2CNBR problem. As PSO is originally designed to handle a continuous solution space, modification of the algorithm was necessary in order to adapt it for such a highly constrained discrete combinatorial optimization problem. Presented are an indirect transcription scheme for applying PSO to such discrete optimization problems and an oscillating mechanism for averting stagnation.

Fitness to stand trial : how discourses of rationality, reasonableness and culpability inform the law and psychiatry to create standards of normal

The objective of this thesis is to demonstrate the importance of the concepts of rationality, reasonableness, culpability and autonomy that inform and support our conception of both the person and the punishable subject. A critical discourse analysis tracing these concepts through both the law and psychological tools used to evaluate the fitness of a person reveals that these concepts and their implied values are inconsistently applied to the mentally disordered who come into conflict with the law. I argue that the result of this inconsistency compromises a person's autonomy which is a contradiction to this concept as a foundational principle of the law. Ultimately, this thesis does not provide a solution to be employed in policy making, but its analysis leaves open possibilities for further exploration into the ways legal and social justice can be reconciled.

The Rationality of Revolution.

Did the recent transition to liberal democracy in Eastern Europe consitute revolutions? Here, game theory is used to structure an explanation of institutional change proposed by Harold Innis (1950).

Social Norms and Rationality of Choice

Ever since Sen (1993) criticized the notion of internal consistency of choice, there exists a wide spread perception that the standard rationalizability approach to the theory of choice has difficulties coping with the existence of external social norms. This paper introduces a concept of norm-conditional rationalizability and shows that external social norms can be accommodated so as to be compatible with norm-conditional rationalizability by means of suitably modified revealed preference axioms in the theory of rational choice on general domains à la Richter (1966;1971) and Hansson (1968)

Rationality, External Norms and the Epistemic Value of Menus

Ever since Sen’s (1993; 1997) criticism on the notion of internal consistency or menu independence of choice, there exists a widespread perception that the standard revealed preference approach to the theory of rational choice has difficulties in coping with the existence of external norms, or the information a menu of choice might convey to a decision-maker, viz., the epistemic value of a menu. This paper provides a brief survey of possible responses to these criticisms of traditional rational choice theory. It is shown that a novel concept of norm-conditional rationalizability can neatly accommodate external norms within the standard framework of rationalizability theory. Furthermore, we illustrate that there are several ways of incorporating considerations regarding the epistemic value of opportunity sets into a generalized model of rational choice theory.

Spectral Analysis of Bounded Self-adjoint operators - A Linear Algebraic Approach

This thesis Entitled Spectral theory of bounded self-adjoint operators -A linear algebraic approach.The main results of the thesis can be classified as three different approaches to the spectral approximation problems. The truncation method and its perturbed versions are part of the classical linear algebraic approach to the subject. The usage of block Toeplitz-Laurent operators and the matrix valued symbols is considered as a particular example where the linear algebraic techniques are effective in simplifying problems in inverse spectral theory. The abstract approach to the spectral approximation problems via pre-conditioners and Korovkin-type theorems is an attempt to make the computations involved, well conditioned. However, in all these approaches, linear algebra comes as the central object. The objective of this study is to discuss the linear algebraic techniques in the spectral theory of bounded self-adjoint operators on a separable Hilbert space. The usage of truncation method in approximating the bounds of essential spectrum and the discrete spectral values outside these bounds is well known. The spectral gap prediction and related results was proved in the second chapter. The discrete versions of Borg-type theorems, proved in the third chapter, partly overlap with some known results in operator theory. The pure linear algebraic approach is the main novelty of the results proved here.

The median function on graphs with bounded profiles

The median of a profile = (u1, . . . , uk ) of vertices of a graph G is the set of vertices x that minimize the sum of distances from x to the vertices of . It is shown that for profiles with diameter the median set can be computed within an isometric subgraph of G that contains a vertex x of and the r -ball around x, where r > 2 − 1 − 2 /| |. The median index of a graph and r -joins of graphs are introduced and it is shown that r -joins preserve the property of having a large median index. Consensus strategies are also briefly discussed on a graph with bounded profiles.