A unified approach to the solution of plane problems of Magneto-elasticity with special reference to a hole in a thin infinite conducting plate

Under certain specific assumption it has been observed that the basic equations of magneto-elasticity in the case of plane deformation lead to a biharmonic equation, as in the case of the classical plane theory of elasticity. The method of solving boundary value problems has been properly modified and a unified approach in solving such problems has been suggested with special reference to problems relating thin infinite plates with a hole. Closed form expressions have been obtained for the stresses due to a uniform magnetic field present in the plane of deformation of a thin infinite conducting plate with a circular hole, the plate being deformed by a tension acting parallel to the direction of the magnetic field.

Considering gambling involvement in the understanding of problem gambling: A large cross-sectional study of an Australian population

Instead of regarding a particular type of gambling activity (for example, electronic gambling machines, table games) as an isolated factor for problem gambling, recent research suggests that gambling involvement (for example, as measured by the number of different types of gambling activities played) should also be considered. Using a large sample of the Victorian adult population, this study found that the strength of association between problem gambling and the type of gambling reduced after adjusting for gambling involvement. This finding supports recent research that gambling involvement is an important factor in assessing the risk of problem gambling. The study also provides insights into the measurements of gambling involvement and provides alternative statistical modelling to analyse problem gambling.

Data distribution and task scheduling for distributed computing of all-to-all comparison problems

This research studied distributed computing of all-to-all comparison problems with big data sets. The thesis formalised the problem, and developed a high-performance and scalable computing framework with a programming model, data distribution strategies and task scheduling policies to solve the problem. The study considered storage usage, data locality and load balancing for performance improvement in solving the problem. The research outcomes can be applied in bioinformatics, biometrics and data mining and other domains in which all-to-all comparisons are a typical computing pattern.

Early childhood profiles of sleep problems and self-regulation predict later school adjustment

Background Children’s sleep problems and self-regulation problems have been independently associated with poorer adjustment to school, but there has been limited exploration of longitudinal early childhood profiles that include both indicators. Aims This study explores the normative developmental pathway for sleep problems and self-regulation across early childhood, and investigates whether departure from the normative pathway is associated with later social-emotional adjustment to school. Sample This study involved 2880 children participating in the Growing Up in Australia: The Longitudinal Study of Australian Children (LSAC) – Infant Cohort from Wave 1 (0-1 years) to Wave 4 (6-7 years). Method Mothers reported on children’s sleep problems, emotional, and attentional self-regulation at three time points from birth to 5 years. Teachers reported on children’s social-emotional adjustment to school at 6-7 years. Latent profile analysis was used to establish person-centred longitudinal profiles. Results Three profiles were found. The normative profile (69%) had consistently average or higher emotional and attentional regulation scores and sleep problems that steadily reduced from birth to 5. The remaining 31% of children were members of two non-normative self-regulation profiles, both characterised by escalating sleep problems across early childhood and below mean self-regulation. Non-normative group membership was associated with higher teacher-reported hyperactivity and emotional problems, and poorer classroom self-regulation and prosocial skills. Conclusion Early childhood profiles of self-regulation that include sleep problems offer a way to identify children at risk of poor school adjustment. Children with escalating early childhood sleep problems should be considered an important target group for school transition interventions.

Application of partition method to vibration problems of plates

The “partition method” or “sub-domain method” consists of expressing the solution of a governing differential equation, partial or ordinary, in terms of functions which satisfy the boundary conditions and setting to zero the error in the differential equation integrated over each of the sub-domains into which the given domain is partitioned. In this paper, the use of this method in eigenvalue problems with particular reference to vibration of plates is investigated. The deflection of the plate is expressed in terms of polynomials satisfying the boundary conditions completely. Setting the integrated error in each of the subdomains to zero results in a set of simultaneous, linear, homogeneous, algebraic equations in the undetermined coefficients of the deflection series. The algebraic eigenvalue problem is then solved for eigenvalues and eigenvectors. Convergence is examined in a few typical cases and is found to be satisfactory. The results obtained are compared with existing results based on other methods and are found to be in very good agreement.

Improved management of key northern region weeds: diverse problems, diverse solutions

The cropping region of northern Australia has a diverse range of cropping systems and weed flora. A fallow phase is commonly required between crops to enable the accumulation of stored soil water in these farming systems dominated by reduced tillage. During the fallow phase, weed control is important and is heavily reliant on herbicides. The most commonly used herbicide has been glyphosate. As a result of over-reliance on glyphosate, there are now seven confirmed glyphosate-resistant weeds and several glyphosate-tolerant species common in the region. As a result, the control of summer fallow weeds is become more complex. This paper outlines project work investigating improved weed control for summer fallows in the northern cropping region. Areas of research include weed ecology, chemical and non-chemical tactics, glyphosate resistance and resistance surveys. The project also has an economic and extension component. As a result of our research we have a better understanding of the ecology of major northern weeds and spread of glyphosate resistance in the region. We have identified and defined alternative herbicide and non-chemical approaches for the effective control of summer fallow weeds and have extended our research effectively to industry.

Weeds of Direct-Seeded Rice in Asia: Problems and Opportunities

Rice production symbolizes the single largest land use for food production on the Earth. The significance of this cereal as a source of energy and income seems overwhelming for millions of people in Asia, representing 90% of global rice production and consumption. Estimates indicate that the burgeoning population will need 25% more rice by 2025 than today's consumption. As the demand for rice is increasing, its production in Asia is threatened by a dwindling natural resource base, socioeconomic limitations, and uncertainty of climatic optima. Transplanting in puddled soil with continuous flooding is a common method of rice crop establishment in Asia. There is a dire need to look for rice production technologies that not only cope with existing limitations of transplanted rice but also are viable, economical, and secure for future food demand.Direct seeding of rice has evolved as a potential alternative to the current detrimental practice of puddling and nursery transplanting. The associated benefits include higher water productivity, less labor and energy inputs, less methane emissions, elimination of time and edaphic conflicts in the rice-wheat cropping system, and early crop maturity. Realization of the yield potential and sustainability of this resource-conserving rice production technique lies primarily in sustainable weed management, since weeds have been recognized as the single largest biological constraint in direct-seeded rice (DSR). Weed competition can reduce DSR yield by 30-80% and even complete crop failure can occur under specific conditions. Understanding the dynamics and outcomes of weed-crop competition in DSR requires sound knowledge of weed ecology, besides production factors that influence both rice and weeds, as well as their association. Successful adoption of direct seeding at the farmers' level in Asia will largely depend on whether farmers can control weeds and prevent shifts in weed populations from intractable weeds to more difficult-to-control weeds as a consequence of direct seeding. Sustainable weed management in DSR comprises all the factors that give DSR a competitive edge over weeds regarding acquisition and use of growth resources. This warrants the need to integrate various cultural practices with weed control measures in order to broaden the spectrum of activity against weed flora. A weed control program focusing entirely on herbicides is no longer ecologically sound, economically feasible, and effective against diverse weed flora and may result in the evolution of herbicide-resistant weed biotypes. Rotation of herbicides with contrasting modes of action in conjunction with cultural measures such as the use of weed-competitive rice cultivars, sowing time, stale seedbed technique, seeding rate, crop row spacing, fertilizer and water inputs and their application method/timing, and manual and mechanical hoeing can prove more effective and need to be optimized keeping in view the type and intensity of weed infestation. This chapter tries to unravel the dynamics of weed-crop competition in DSR. Technological issues, limitations associated with DSR, and opportunities to combat the weed menace are also discussed as a pragmatic approach for sustainable DSR production. A realistic approach to secure yield targets against weed competition will combine the abovementioned strategies and tactics in a coordinated manner. This chapter further suggests the need of multifaceted and interdisciplinary research into ecologically based weed management, as DSR seems inevitable in the near future.

Solution of a class of vibration problems by flowgraph methods

A 4-degree-of-freedom single-input system and a 3-degree-of-freedom multi-input system are solved by the Coates', modified Coates' and Chan-Mai flowgraph methods. It is concluded that the Chan-Mai flowgraph method is superior to other flowgraph methods in such cases.

A parametric differentiation version with finite-difference scheme applicable to a class of problems in boundary layer flow with massive blowing

A numerical procedure, based on the parametric differentiation and implicit finite difference scheme, has been developed for a class of problems in the boundary-layer theory for saddle-point regions. Here, the results are presented for the case of a three-dimensional stagnation-point flow with massive blowing. The method compares very well with other methods for particular cases (zero or small mass blowing). Results emphasize that the present numerical procedure is well suited for the solution of saddle-point flows with massive blowing, which could not be solved by other methods.

Problems and Algorithms for Sequence Segmentations

The analysis of sequential data is required in many diverse areas such as telecommunications, stock market analysis, and bioinformatics. A basic problem related to the analysis of sequential data is the sequence segmentation problem. A sequence segmentation is a partition of the sequence into a number of non-overlapping segments that cover all data points, such that each segment is as homogeneous as possible. This problem can be solved optimally using a standard dynamic programming algorithm. In the first part of the thesis, we present a new approximation algorithm for the sequence segmentation problem. This algorithm has smaller running time than the optimal dynamic programming algorithm, while it has bounded approximation ratio. The basic idea is to divide the input sequence into subsequences, solve the problem optimally in each subsequence, and then appropriately combine the solutions to the subproblems into one final solution. In the second part of the thesis, we study alternative segmentation models that are devised to better fit the data. More specifically, we focus on clustered segmentations and segmentations with rearrangements. While in the standard segmentation of a multidimensional sequence all dimensions share the same segment boundaries, in a clustered segmentation the multidimensional sequence is segmented in such a way that dimensions are allowed to form clusters. Each cluster of dimensions is then segmented separately. We formally define the problem of clustered segmentations and we experimentally show that segmenting sequences using this segmentation model, leads to solutions with smaller error for the same model cost. Segmentation with rearrangements is a novel variation to the segmentation problem: in addition to partitioning the sequence we also seek to apply a limited amount of reordering, so that the overall representation error is minimized. We formulate the problem of segmentation with rearrangements and we show that it is an NP-hard problem to solve or even to approximate. We devise effective algorithms for the proposed problem, combining ideas from dynamic programming and outlier detection algorithms in sequences. In the final part of the thesis, we discuss the problem of aggregating results of segmentation algorithms on the same set of data points. In this case, we are interested in producing a partitioning of the data that agrees as much as possible with the input partitions. We show that this problem can be solved optimally in polynomial time using dynamic programming. Furthermore, we show that not all data points are candidates for segment boundaries in the optimal solution.

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.

Dealing with discomfort: How the unspeakable confounds wicked planning problems

The idea of ‘wicked’ problems has made a valuable contribution to recognising the complexity and challenges of contemporary planning. However, some wicked policy problems are further complicated by a significant moral, psychological, religious or cultural dimension. This is particularly the case for problems that possess strong elements of abjection and symbolic pollution and high degrees of psychosocial sensitivity. Because this affects the way these problems are framed and discussed they are also characterised by high levels of verbal proscription. As a result, they are not discussed in the rational and emotion-free way that conventional planning demands and can become obscured or inadequately acknowledged in planning processes. This further contributes to their wickedness and intractability. Through paradigmatic urban planning examples, we argue that placing their unspeakable nature at the forefront of enquiry will enable planners to advocate for a more contextually and culturally situated approach to planning, which accommodates both emotional and embodied talk alongside more technical policy contributions. Re-imagining wicked problems in this way has the potential to enhance policy and plan-making and to disrupt norms, expose their contingency, and open new ways of planning for both the unspeakable and the merely wicked.