1000 resultados para borrowing problems
Resumo:
The aim of this investigation is to evolve a method of solving two-dimensional unsteady flow problems by the method of characteristics. This involves the reduction of the given system of equations to an equivalent system where only interior derivatives occur on a characteristic surface. From this system, four special bicharacteristic directional derivatives are chosen. A finite difference scheme is prescribed for solving the equations. General rectangular lattices are also considered. As an example, we investigate the propagation of an initial pressure distribution in a medium at rest.
Resumo:
Conyza bonariensis is a major weed infesting zero-tilled cropping systems in subtropical Australia, particularly in wheat and winter fallows. Uncontrolled C.bonariensis survives to become a problem weed in the following crops or fallows. As no herbicide has been registered for C.bonariensis in wheat, the effectiveness of 11 herbicides, currently registered for other broad-leaved weeds in wheat, was evaluated in two pot and two field experiments. As previous research showed that the age of C.bonariensis, and to a lesser extent, the soil moisture at spraying affected herbicide efficacy, these factors also were investigated. The efficacy of the majority of herbicide treatments was reduced when large rosettes (5-15cm diameter) were treated, compared with small rosettes (<5cm diameter). However, for the majority of herbicide treatments, the soil moisture did not affect the herbicide efficacy in the pot experiments. In the field, a delay in herbicide treatment of 2 weeks reduced the herbicide efficacy consistently across herbicide treatments, which was related to weed age but not to soil moisture differences. Across all the experiments, four herbicides controlled C.bonariensis in wheat consistently (83-100%): 2,4-D; aminopyralid + fluroxypyr; picloram + MCPA + metsulfuron; and picloram + high rates of 2,4-D. Thus, this problem weed can be effectively and consistently controlled in wheat, particularly when small rosettes are treated, and therefore C.bonariensis will have a less adverse impact on the following fallow or crop.
Resumo:
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.
Resumo:
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.
Resumo:
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.
Resumo:
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.
Resumo:
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.
Resumo:
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.
Resumo:
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.
Resumo:
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.
Resumo:
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.