A Design for Testability of Undetectable Crosspoint Faults in Programmable Logic Arrays

In this paper, the validity of'single fault assumption in deriving diagnostic test sets is examined with respect to crosspoint faults in programmable logic arrays (PLA's). The control input procedure developed here can be used to convert PLA's having undetectable crosspoint faults to crosspoint-irredundant PLA's for testing purposes. All crosspoints will be testable in crosspoint-irredundant PLA's. The control inputs are used as extra variables during testing. They are maintained at logic I during normal operation. A useful heuristic for obtaining a near-minimal number of control inputs is suggested. Expressions for calculating bounds on the number of control inputs have also been obtained.

Edistys ja yhteinen hyvä vapaudenajan ruotsalaisessa poliittisessa kielessä

This dissertation analyses the notions of progress and common good in Swedish political language during the Age of Liberty (1719 1772). The method used is conceptual analysis, but this study is also a contribution to the history of political ideas and political culture, aiming at a broader understanding of how the bounds of political community were conceptualised and represented in eighteenth-century Sweden. The research is based on the official documents of the regime, such as the fundamental laws and the solemn speeches made at the opening and closing of the Diet, on normative or alternative descriptions of society such as history works and economic literature, and on practical political writings by the Diet and its members. The rhetoric of common good and particular interest is thus examined both in its consensual and theoretical contexts and in practical politics. Central political issues addressed include the extent of economic liberties, the question of freedom to print, the meaning of privilege, the position of particular estates or social groups and the economic interests of particular areas or persons. This research shows that the modern Swedish word for progress (framsteg) was still only rarely used in the eighteenth century, while the notion of progress, growth and success existed in a variety of closely related terms and metaphorical expressions. The more traditional concept of common good (allmänna bästa) was used in several variants, some of which explicitly related to utility and interest. The combination of public utility and private interest in political discourse challenged traditional ideals of political morality, where virtue had been the fundament of common good. The progress of society was also presented as being linked to the progress of liberty, knowledge and wealth in a way that can be described as characteristic of the Age of Enlightenment but which also points at the appearance of early liberal thought.

Genetic alternatives to mulesing and tail docking in sheep: a review

A genetic solution to breech strike control is attractive, as it is potentially permanent, cumulative, would not involve increased use of chemicals and may ultimately reduce labour inputs. There appears to be significant opportunity to reduce the susceptibility of Merinos to breech strike by genetic means although it is unlikely that in the short term breeding alone will be able to confer the degree of protection provided by mulesing and tail docking. Breeding programmes that aim to replace surgical techniques of flystrike prevention could potentially: reduce breech wrinkle; increase the area of bare skin in the perineal area; reduce tail length and wool cover on and near the tail; increase shedding of breech wool; reduce susceptibility to internal parasites and diarrhoea; and increase immunological resistance to flystrike. The likely effectiveness of these approaches is reviewed and assessed here. Any breeding programme that seeks to replace surgical mulesing and tail docking will need to make sheep sufficiently resistant that the increased requirement for other strike management procedures remains within practically acceptable bounds and that levels of strike can be contained to ethically acceptable levels.

Determination of mode 1 notch stress intensity factor by the photoelastic technique

The structural integrity of any member subjected to a load gets impaired due to the presence of cracks or crack-like defects. The notch severity is one of the several parameters that promotes the brittle fracture. The most severe one is an ideal crack with infinitesimal width and infinitesimal or zero root radius. Though analytical investigations can handle an ideal crack, experimental work, either to validate the analytical conclusions or to impose the bounds, needs to be carried out on models or specimens containing the cracks which are far from the ideal ones. Thus instead of an ideal crack with infinitesimal width the actual model will have a slot or a slit of finite width and instead of a crack ending in zero root radius, the model contains a slot having a finite root radius. Another factor of great significance at the root is the notch angle along which the transition from the slot to the root takes place. This paper is concerned with the photoelastic determination of the notch stress intensity factor in the case of a “crack” subjected to Mode 1 deformation.

Approximation algorithm for maximum independent set in planar traingle-free graphs

The maximum independent set problem is NP-complete even when restricted to planar graphs, cubic planar graphs or triangle free graphs. The problem of finding an absolute approximation still remains NP-complete. Various polynomial time approximation algorithms, that guarantee a fixed worst case ratio between the independent set size obtained to the maximum independent set size, in planar graphs have been proposed. We present in this paper a simple and efficient, O(|V|) algorithm that guarantees a ratio 1/2, for planar triangle free graphs. The algorithm differs completely from other approaches, in that, it collects groups of independent vertices at a time. Certain bounds we obtain in this paper relate to some interesting questions in the theory of extremal graphs.

Phased-Mission Analysis for Evaluating the Effectiveness of Aerospace Computing-Systems

Effectiveness evaluation of aerospace fault-tolerant computing systems used in a phased-mission environment is rather tricky and difficult because of the interaction of its several degraded performance levels with the multiple objectives of the mission and the use environment. Part I uses an approach based on multiobjective phased-mission analysis to evaluate the effectiveness of a distributed avionics architecture used in a transport aircraft. Part II views the computing system as a multistate s-coherent structure. Lower bounds on the probabilities of accomplishing various levels of performance are evaluated.

Assessment of accuracies of some approximate solutions

The classic work of Richardson and Gaunt [1 ], has provided an effective means of extrapolating the limiting result in an approximate analysis. From the authors' work on "Bounds for eigenvalues" [2-4] an interesting alternate method has emerged for assessing monotonically convergent approximate solutions by generating close bounds. Whereas further investigation is needed to put this work on sound theoretical foundation, we intend this letter to announce a possibility, which was confirmed by an exhaustive set of examples.

Floristic composition and pasture condition of Aristida/Bothriochloa pastures in central Queensland. II. Soil and pasture condition interactions

Sustainable management of native pastures requires an understanding of what the bounds of pasture composition, cover and soil surface condition are for healthy pastoral landscapes to persist. A survey of 107 Aristida/Bothriochloa pasture sites in inland central Queensland was conducted. The sites were chosen for their current diversity of tree cover, apparent pasture condition and soil type to assist in setting more objective bounds on condition ‘states’ in such pastures. Assessors’ estimates of pasture condition were strongly correlated with herbage mass (r = 0.57) and projected ground cover (r = 0. 58), and moderately correlated with pasture crown cover (r = 0.35) and tree basal area (r = 0.32). Pasture condition was not correlated with pasture plant density or the frequency of simple guilds of pasture species. The soil type of Aristida/Bothriochloa pasture communities was generally hard-setting, low in cryptogam cover but moderately covered with litter and projected ground cover (30–50%). There was no correlation between projected ground cover of pasture and estimated ground-level cover of plant crowns. Tree basal area was correlated with broad categories of soil type, probably because greater tree clearing has occurred on the more fertile, heavy-textured clay soils. Of the main perennial grasses, some showed strong soil preferences, for example Tripogon loliiformis for hard-setting soils and Dichanthium sericeum for clays. Common species, such as Chrysopogon fallax and Heteropogon contortus, had no strong soil preference. Wiregrasses (Aristida spp.) tended to be uncommon at both ends of the estimated pasture condition scale whereas H. contortus was far more common in pastures in good condition. Sedges (Cyperaceae) were common on all soil types and for all pasture condition ratings. Plants identified as increaser species were Tragus australianus, daisies (Asteraceae) and potentially toxic herbaceous legumes such as Indigofera spp. and Crotalaria spp. Pasture condition could not be reliably predicted based on the abundance of a single species or taxon but there may be scope for using integrated data for four to five ecologically contrasting plants such as Themeda triandra with daisies, T. loliiformis and flannel weeds (Malvaceae).

Dirichlet problem at infinity for p-harmonic functions on negatively curved spaces

The object of this dissertation is to study globally defined bounded p-harmonic functions on Cartan-Hadamard manifolds and Gromov hyperbolic metric measure spaces. Such functions are constructed by solving the so called Dirichlet problem at infinity. This problem is to find a p-harmonic function on the space that extends continuously to the boundary at inifinity and obtains given boundary values there. The dissertation consists of an overview and three published research articles. In the first article the Dirichlet problem at infinity is considered for more general A-harmonic functions on Cartan-Hadamard manifolds. In the special case of two dimensions the Dirichlet problem at infinity is solved by only assuming that the sectional curvature has a certain upper bound. A sharpness result is proved for this upper bound. In the second article the Dirichlet problem at infinity is solved for p-harmonic functions on Cartan-Hadamard manifolds under the assumption that the sectional curvature is bounded outside a compact set from above and from below by functions that depend on the distance to a fixed point. The curvature bounds allow examples of quadratic decay and examples of exponential growth. In the final article a generalization of the Dirichlet problem at infinity for p-harmonic functions is considered on Gromov hyperbolic metric measure spaces. Existence and uniqueness results are proved and Cartan-Hadamard manifolds are considered as an application.

Distortion of Dimension under Quasiconformal Mappings

Quasiconformal mappings are natural generalizations of conformal mappings. They are homeomorphisms with 'bounded distortion' of which there exist several approaches. In this work we study dimension distortion properties of quasiconformal mappings both in the plane and in higher dimensional Euclidean setting. The thesis consists of a summary and three research articles. A basic property of quasiconformal mappings is the local Hölder continuity. It has long been conjectured that this regularity holds at the Sobolev level (Gehring's higher integrabilty conjecture). Optimal regularity would also provide sharp bounds for the distortion of Hausdorff dimension. The higher integrability conjecture was solved in the plane by Astala in 1994 and it is still open in higher dimensions. Thus in the plane we have a precise description how Hausdorff dimension changes under quasiconformal deformations for general sets. The first two articles contribute to two remaining issues in the planar theory. The first one concerns distortion of more special sets, for rectifiable sets we expect improved bounds to hold. The second issue consists of understanding distortion of dimension on a finer level, namely on the level of Hausdorff measures. In the third article we study flatness properties of quasiconformal images of spheres in a quantitative way. These also lead to nontrivial bounds for their Hausdorff dimension even in the n-dimensional case.

Optimisation Problems in Wireless Sensor Networks : Local Algorithms and Local Graphs

This thesis studies optimisation problems related to modern large-scale distributed systems, such as wireless sensor networks and wireless ad-hoc networks. The concrete tasks that we use as motivating examples are the following: (i) maximising the lifetime of a battery-powered wireless sensor network, (ii) maximising the capacity of a wireless communication network, and (iii) minimising the number of sensors in a surveillance application. A sensor node consumes energy both when it is transmitting or forwarding data, and when it is performing measurements. Hence task (i), lifetime maximisation, can be approached from two different perspectives. First, we can seek for optimal data flows that make the most out of the energy resources available in the network; such optimisation problems are examples of so-called max-min linear programs. Second, we can conserve energy by putting redundant sensors into sleep mode; we arrive at the sleep scheduling problem, in which the objective is to find an optimal schedule that determines when each sensor node is asleep and when it is awake. In a wireless network simultaneous radio transmissions may interfere with each other. Task (ii), capacity maximisation, therefore gives rise to another scheduling problem, the activity scheduling problem, in which the objective is to find a minimum-length conflict-free schedule that satisfies the data transmission requirements of all wireless communication links. Task (iii), minimising the number of sensors, is related to the classical graph problem of finding a minimum dominating set. However, if we are not only interested in detecting an intruder but also locating the intruder, it is not sufficient to solve the dominating set problem; formulations such as minimum-size identifying codes and locating dominating codes are more appropriate. This thesis presents approximation algorithms for each of these optimisation problems, i.e., for max-min linear programs, sleep scheduling, activity scheduling, identifying codes, and locating dominating codes. Two complementary approaches are taken. The main focus is on local algorithms, which are constant-time distributed algorithms. The contributions include local approximation algorithms for max-min linear programs, sleep scheduling, and activity scheduling. In the case of max-min linear programs, tight upper and lower bounds are proved for the best possible approximation ratio that can be achieved by any local algorithm. The second approach is the study of centralised polynomial-time algorithms in local graphs these are geometric graphs whose structure exhibits spatial locality. Among other contributions, it is shown that while identifying codes and locating dominating codes are hard to approximate in general graphs, they admit a polynomial-time approximation scheme in local graphs.

A new type of high-order elements based on the mesh-free interpolations

We propose a new type of high-order elements that incorporates the mesh-free Galerkin formulations into the framework of finite element method. Traditional polynomial interpolation is replaced by mesh-free interpolations in the present high-order elements, and the strain smoothing technique is used for integration of the governing equations based on smoothing cells. The properties of high-order elements, which are influenced by the basis function of mesh-free interpolations and boundary nodes, are discussed through numerical examples. It can be found that the basis function has significant influence on the computational accuracy and upper-lower bounds of energy norm, when the strain smoothing technique retains the softening phenomenon. This new type of high-order elements shows good performance when quadratic basis functions are used in the mesh-free interpolations and present elements prove advantageous in adaptive mesh and nodes refinement schemes. Furthermore, it shows less sensitive to the quality of element because it uses the mesh-free interpolations and obeys the Weakened Weak (W2) formulation as introduced in [3, 5].

Can technology provide a glimmer of hope for economic growth in the midst of chaos? A case of Zimbabwe

In this paper we examine the effect of technology on economic growth in Zimbabwe over the period 1975–2014 whilst accounting for structural breaks. We use the extended Cobb–Douglas type Solow (Q J Econ 70(1):65–94, 1956) framework and the ARDL bounds procedure to examine cointegration and short run and long run effects. Using unit root tests, we note that structural changes in Zimbabwe are generally marked by the period 1982 onwards. We find that mobile technology has a positive short-run (0.09 %) and long-run (0.08 %) impact on the output per capita. The structural changes post-1982 periods show positive impact in the short-run (0.06) and the long-run (0.09), whereas the coefficient of trend in the short-run (−0.03) and the long-run (−0.04) is negative. The Granger non-causality test shows a unidirectional causality from capital stock (investment) per capita to output per capita and a bi-directional causality between mobile cellular technology and output per capita. The plausible reasons for estimated magnitude effects and the direction of causality are explained for policy deliberation.

Estimation of Execution Times of Process Control Algorithms on Microcomputers

An important question which has to be answered in evaluting the suitability of a microcomputer for a control application is the time it would take to execute the specified control algorithm. In this paper, we present a method of obtaining closed-form formulas to estimate this time. These formulas are applicable to control algorithms in which arithmetic operations and matrix manipulations dominate. The method does not require writing detailed programs for implementing the control algorithm. Using this method, the execution times of a variety of control algorithms on a range of 16-bit mini- and recently announced microcomputers are calculated. The formulas have been verified independently by an analysis program, which computes the execution time bounds of control algorithms coded in Pascal when they are run on a specified micro- or minicomputer.

Automatic Path Planning and Control Design for Autonomous Landing of UAVs using Dynamic Inversion

In this paper a nonlinear control has been designed using the dynamic inversion approach for automatic landing of unmanned aerial vehicles (UAVs), along with associated path planning. This is a difficult problem because of light weight of UAVs and strong coupling between longitudinal and lateral modes. The landing maneuver of the UAV is divided into approach, glideslope and flare. In the approach UAV aligns with the centerline of the runway by heading angle correction. In glideslope and flare the UAV follows straight line and exponential curves respectively in the pitch plane with no lateral deviations. The glideslope and flare path are scheduled as a function of approach distance from runway. The trajectory parameters are calculated such that the sink rate at touchdown remains within specified bounds. It is also ensured that the transition from the glideslope to flare path is smooth by ensuring C-1 continuity at the transition. In the outer loop, the roll rate command is generated by assuring a coordinated turn in the alignment segment and by assuring zero bank angle in the glideslope and flare segments. The pitch rate command is generated from the error in altitude to control the deviations from the landing trajectory. The yaw rate command is generated from the required heading correction. In the inner loop, the aileron, elevator and rudder deflections are computed together to track the required body rate commands. Moreover, it is also ensured that the forward velocity of the UAV at the touch down remains close to a desired value by manipulating the thrust of the vehicle. A nonlinear six-DOF model, which has been developed from extensive wind-tunnel testing, is used both for control design as well as to validate it.