Improving management of summer weeds in dryland cropping systems with Cotton

In 2001 a scoping study (phase I) was commissioned to determine and prioritise the weed issues of cropping systems with dryland cotton. The main findings were that the weed flora was diverse, cropping systems complex, and weeds had a major financial and economical impact. Phase II 'Best weed management strategies for dryland cropping systems with cotton' focused on improved management of the key weeds, bladder ketmia, sowthistle, fleabane, barnyard grass and liverseed grass.In Phase III 'Improving management of summer weeds in dryland cropping systems with cotton', more information on the seed-bank dynamics of key weeds was gained in six pot and field studies. The studies found that these characteristics differed between species, and even climate in the case of bladder ketmia. Species such as sowthistle, fleabane and barnyard grass emerged predominately from the surface soil. Sweet summer grass was also in this category but also had a significant proportion emerging from 5 cm depth. Bladder ketmia in central Queensland emerged mainly from the top 2 cm, whereas in southern Queensland it emerged mainly from 5 cm. Liverseed grass had its highest emergence from 5 cm below the surface. In all cases the persistence of seed increased with increasing soil depth. Fleabane was also found to be sensitive to soil type with no seedlings emerging in the self-mulching black vertisol soil. A strategic tillage trial showed that burial of fleabane seed, using a disc or chisel plough, to a depth of greater than 2 cm can significantly reduce subsequent fleabane emergence. In contrast, tillage increased barnyard grass emergence and tended to decrease persistence. This research showed that weed management plans can not be blanketed across all weed species, rather they need to be targeted for each main weed species.This project has also resulted in an increased knowledge of how to manage fleabane from the eight experiments; one in wheat, two in sorghum, one in cotton and three in fallow on double knock. For summer crops, the best option is to apply a highly effective fallow treatment prior to sowing the crops. For winter crops, the strategy is the integration of competitive crops, residual herbicide followed by a knockdown to control survivors. This project explored further the usefulness of the double knock tactic for weed control and preventing seed set. Two field and one pot experiments have shown that this tactic was highly effective for fleabane control. Paraquat products provided good control when followed by glyphosate. When 2, 4-D was added in a tank mix with glyphosate and followed by paraquat products, 99-100% control was achieved in all cases. The ideal follow-up times for paraquat products after glyphosate were 5-7 days. The preferred follow-up times for 2, 4-D after glyphosate were on the same day and one day later. The pot trial, which compared a population from a cropping field with previous glyphosate exposure and a population from a non-cropping area with no previous glyphosate herbicide exposure, showed that the pervious herbicide exposure affected the response of fleabane to herbicidal control measures. The web-based brochure on managing fleabane has been updated.Knowledge on management of summer grasses and safe use of residual herbicides was derived from eight field and pot experiments. Residual grass and broadleaf weed control was excellent with atrazine pre-plant and at-planting treatments, provided rain was received within a short interval after application. Highly effective fallow treatments (cultivation and double knock), not only gave excellent grass control in the fallow, also gave very good control in the following cotton. In the five re-cropping experiments, there were no adverse impacts on cotton from atrazine, metolachlor, metsulfuron and chlorsulfuron residues following use in previous sorghum, wheat and fallows. However, imazapic residues did reduce cotton growth.The development of strategies to reduce the heavy reliance on glyphosate in our cropping systems, and therefore minimise the risk of glyphosate resistance development, was a key factor in the research undertaken. This work included identifying suitable tactics for summer grass control, such as double knock with glyphosate followed by paraquat and tillage. Research on fleabane also concentrated on minimising emergence through tillage, and applying the double knock tactic. Our studies have shown that these strategies can be used to prevent seed set with the goal of driving down the seed bank. Utilisation of the strategies will also reduce the reliance on glyphosate, and therefore reduce the risk of glyphosate resistance developing in our cropping systems.Information from this research, including ecological and management data were collected from an additional eight paddock monitoring sites, was also incorporated into the Weeds CRC seed bank model "Weed Seed Wizard", which will be able to predict the impact of different management options on weed populations in cotton and grain farming systems. Extensive communication activities were undertaken throughout this project to ensure adoption of the new strategies for improved weed management and reduced risk for glyphosate resistance.

Optimal Interconnections in the Design of Microprocessors and Digital Systems

This paper recasts the multiple data path assignment problem solved by Torng and Wilhelm by the dynamic programming method [1] into a minimal covering problem following a switching theoretic approach. The concept of bus compatibility for the data transfers is used to obtain the various ways of interconnecting the circuit modules with the minimum number of buses that allow concurrent data transfers. These have been called the feasible solutions of the problem. The minimal cost solutions are obtained by assigning weights to the bus-compatible sets present in the feasible solutions. Minimization of the cost of the solution by increasing the number of buses is also discussed.

Reverse Channel Training For Reciprocal Mimo Systems With Spatial Multiplexing

This paper investigates the problem of designing reverse channel training sequences for a TDD-MIMO spatial-multiplexing system. Assuming perfect channel state information at the receiver and spatial multiplexing at the transmitter with equal power allocation to them dominant modes of the estimated channel, the pilot is designed to ensure an stimate of the channel which improves the forward link capacity. Using perturbation techniques, a lower bound on the forward link capacity is derived with respect to which the training sequence is optimized. Thus, the reverse channel training sequence makes use of the channel knowledge at the receiver. The performance of orthogonal training sequence with MMSE estimation at the transmitter and the proposed training sequence are compared. Simulation results show a significant improvement in performance.

L2-stability of nonstationary feedback systems: Frequency-domain criteria

A frequency-domain positivity condition is derived for linear time-varying operators in2and is used to develop2stability criteria for linear and nonlinear feedback systems. These criteria permit the use of a very general class of operators in2with nonstationary kernels, as multipliers. More specific results are obtained by using a first-order differential operator with a time-varying coefficient as multiplier. Finally, by employing periodic multipliers, improved stability criteria are derived for the nonlinear damped Mathieu equation with a forcing function.

Design challenges for electronic medication administration record systems in residential aged care facilities: A formative evaluation

Introduction Electronic medication administration record (eMAR) systems are promoted as a potential intervention to enhance medication safety in residential aged care facilities (RACFs). The purpose of this study was to conduct an in-practice evaluation of an eMAR being piloted in one Australian RACF before its roll out, and to provide recommendations for system improvements. Methods A multidisciplinary team conducted direct observations of workflow (n=34 hours) in the RACF site and the community pharmacy. Semi-structured interviews (n=5) with RACF staff and the community pharmacist were conducted to investigate their views of the eMAR system. Data were analysed using a grounded theory approach to identify challenges associated with the design of the eMAR system. Results The current eMAR system does not offer an end-to-end solution for medication management. Many steps, including prescribing by doctors and communication with the community pharmacist, are still performed manually using paper charts and fax machines. Five major challenges associated with the design of eMAR system were identified: limited interactivity; inadequate flexibility; problems related to information layout and semantics; the lack of relevant decision support; and system maintenance issues.We suggest recommendations to improve the design of the eMAR system and to optimize existing workflows. Discussion Immediate value can be achieved by improving the system interactivity, reducing inconsistencies in data entry design and offering dedicated organisational support to minimise connectivity issues. Longer-term benefits can be achieved by adding decision support features and establishing system interoperability requirements with stakeholder groups (e.g. community pharmacies) prior to system roll out. In-practice evaluations of technologies like eMAR system have great value in identifying design weaknesses which inhibit optimal system use.

Location of concentrators in a computer communication network: a stochastic automation search method

The following problem is considered. Given the locations of the Central Processing Unit (ar;the terminals which have to communicate with it, to determine the number and locations of the concentrators and to assign the terminals to the concentrators in such a way that the total cost is minimized. There is alao a fixed cost associated with each concentrator. There is ail upper limit to the number of terminals which can be connected to a concentrator. The terminals can be connected directly to the CPU also In this paper it is assumed that the concentrators can bo located anywhere in the area A containing the CPU and the terminals. Then this becomes a multimodal optimization problem. In the proposed algorithm a stochastic automaton is used as a search device to locate the minimum of the multimodal cost function . The proposed algorithm involves the following. The area A containing the CPU and the terminals is divided into an arbitrary number of regions (say K). An approximate value for the number of concentrators is assumed (say m). The optimum number is determined by iteration later The m concentrators can be assigned to the K regions in (mk) ways (m > K) or (km) ways (K>m).(All possible assignments are feasible, i.e. a region can contain 0,1,…, to concentrators). Each possible assignment is assumed to represent a state of the stochastic variable structure automaton. To start with, all the states are assigned equal probabilities. At each stage of the search the automaton visits a state according to the current probability distribution. At each visit the automaton selects a 'point' inside that state with uniform probability. The cost associated with that point is calculated and the average cost of that state is updated. Then the probabilities of all the states are updated. The probabilities are taken to bo inversely proportional to the average cost of the states After a certain number of searches the search probabilities become stationary and the automaton visits a particular state again and again. Then the automaton is said to have converged to that state Then by conducting a local gradient search within that state the exact locations of the concentrators are determined This algorithm was applied to a set of test problems and the results were compared with those given by Cooper's (1964, 1967) EAC algorithm and on the average it was found that the proposed algorithm performs better.

Positional Consensus in Multi-Agent Systems using a Broadcast Control Mechanism

In this paper a strategy for controlling a group of agents to achieve positional consensus is presented. The proposed technique is based on the constraint that every agents must be given the same control input through a broadcast communication mechanism. Although the control command is computed using state information in a global framework, the control input is implemented by the agents in a local coordinate frame. We propose a novel linear programming formulation that is computationally less intensive than earlier proposed methods. Moreover, we introduce a random perturbation input in the control command that helps us to achieve perfect consensus even for a large number of agents, which was not possible with the existing strategy in the literature. Moreover, we extend the method to achieve positional consensus at a pre-specified location. The effectiveness of the approach is illustrated through simulation results.

Autonomous Line Scanning for SPC Telephone Switching Systems

An Autonomous Line Scanning Unit (ALSU) for completely autonomous detection of call originations in the SPC Telephone Switching System is described. Through its own memories, ALSU maintains an up-to-date record of subscribers' statuses, detects call originations, performs 'hit timing check' and informs the Switching System of the identity of calling subscribers. The ALSU needs minimum interaction with the Central Processor, resulting in increased call handling capacity

Trajectory sensitivity modification in optimal linear systems

A new procedure for reducing trajectory sensitivity for the optimal linear regulator is described. The design is achieved without increase in the order of optimization and without the feedback of trajectory sensitivity. The procedure is also used in the input signal design problem for linear system identification by interpreting it as increasing trajectory sensitivity with respect to parameters to be estimated.

Cochannel Interference in Partially Coherent Communication

Effects of cochannel interference and synchronization error of the carrier phase on the probability of error in binary communications are considered. Several bounds on the probability of error are proposed. The bounds are easy to compute and do not require complete statistical characterization of the errors. They turn out to be simple linear combinations of error probabilities with no cochannel interferences and no phase errors. Several illustrative examples are given which show that the bounds can be tight.

Low ML-Decoding Complexity, Large Coding Gain, Full-Rate, Full-Diversity STBCs for 2 x 2 and 4 x 2 MIMO Systems

This paper deals with low maximum-likelihood (ML)-decoding complexity, full-rate and full-diversity space-time block codes (STBCs), which also offer large coding gain, for the 2 transmit antenna, 2 receive antenna (2 x 2) and the 4 transmit antenna, 2 receive antenna (4 x 2) MIMO systems. Presently, the best known STBC for the 2 2 system is the Golden code and that for the 4 x 2 system is the DjABBA code. Following the approach by Biglieri, Hong, and Viterbo, a new STBC is presented in this paper for the 2 x 2 system. This code matches the Golden code in performance and ML-decoding complexity for square QAM constellations while it has lower ML-decoding complexity with the same performance for non-rectangular QAM constellations. This code is also shown to be information-lossless and diversity-multiplexing gain (DMG) tradeoff optimal. This design procedure is then extended to the 4 x 2 system and a code, which outperforms the DjABBA code for QAM constellations with lower ML-decoding complexity, is presented. So far, the Golden code has been reported to have an ML-decoding complexity of the order of for square QAM of size. In this paper, a scheme that reduces its ML-decoding complexity to M-2 root M is presented.

High-Rate Space-Time Coded Large-MIMO Systems: Low-Complexity Detection and Channel Estimation

In this paper, we present a low-complexity algorithm for detection in high-rate, non-orthogonal space-time block coded (STBC) large-multiple-input multiple-output (MIMO) systems that achieve high spectral efficiencies of the order of tens of bps/Hz. We also present a training-based iterative detection/channel estimation scheme for such large STBC MIMO systems. Our simulation results show that excellent bit error rate and nearness-to-capacity performance are achieved by the proposed multistage likelihood ascent search (M-LAS) detector in conjunction with the proposed iterative detection/channel estimation scheme at low complexities. The fact that we could show such good results for large STBCs like 16 X 16 and 32 X 32 STBCs from Cyclic Division Algebras (CDA) operating at spectral efficiencies in excess of 20 bps/Hz (even after accounting for the overheads meant for pilot based training for channel estimation and turbo coding) establishes the effectiveness of the proposed detector and channel estimator. We decode perfect codes of large dimensions using the proposed detector. With the feasibility of such a low-complexity detection/channel estimation scheme, large-MIMO systems with tens of antennas operating at several tens of bps/Hz spectral efficiencies can become practical, enabling interesting high data rate wireless applications.

A method of fraud & intrusion detection for e-payment systems in mobile

The need for paying with mobile devices has urged the development of payment systems for mobile electronic commerce. In this paper we have considered two important abuses in electronic payments systems for detection. The fraud, which is an intentional deception accomplished to secure an unfair gain, and an intrusion which are any set of actions that attempt to compromise the integrity, confidentiality or availability of a resource. Most of the available fraud and intrusion detection systems for e-payments are specific to the systems where they have been incorporated. This paper proposes a generic model called as Activity-Event-Symptoms(AES) model for detecting fraud and intrusion attacks which appears during payment process in the mobile commerce environment. The AES model is designed to identify the symptoms of fraud and intrusions by observing various events/transactions occurs during mobile commerce activity. The symptoms identification is followed by computing the suspicion factors for event attributes, and the certainty factor for a fraud and intrusion is generated using these suspicion factors. We have tested the proposed system by conducting various case studies, on the in-house established mobile commerce environment over wired and wire-less networks test bed.