A robotic platform for precision agriculture and applications

Agricultural techniques have been improved over the centuries to match with the growing demand of an increase in global population. Farming applications are facing new challenges to satisfy global needs and the recent technology advancements in terms of robotic platforms can be exploited. As the orchard management is one of the most challenging applications because of its tree structure and the required interaction with the environment, it was targeted also by the University of Bologna research group to provide a customized solution addressing new concept for agricultural vehicles. The result of this research has blossomed into a new lightweight tracked vehicle capable of performing autonomous navigation both in the open-filed scenario and while travelling inside orchards for what has been called in-row navigation. The mechanical design concept, together with customized software implementation has been detailed to highlight the strengths of the platform and some further improvements envisioned to improve the overall performances. Static stability testing has proved that the vehicle can withstand steep slopes scenarios. Some improvements have also been investigated to refine the estimation of the slippage that occurs during turning maneuvers and that is typical of skid-steering tracked vehicles. The software architecture has been implemented using the Robot Operating System (ROS) framework, so to exploit community available packages related to common and basic functions, such as sensor interfaces, while allowing dedicated custom implementation of the navigation algorithm developed. Real-world testing inside the university’s experimental orchards have proven the robustness and stability of the solution with more than 800 hours of fieldwork. The vehicle has also enabled a wide range of autonomous tasks such as spraying, mowing, and on-the-field data collection capabilities. The latter can be exploited to automatically estimate relevant orchard properties such as fruit counting and sizing, canopy properties estimation, and autonomous fruit harvesting with post-harvesting estimations.

An algorithmic Friedman-Pippenger theorem on tree embeddings and applications

An (n, d)-expander is a graph G = (V, E) such that for every X subset of V with vertical bar X vertical bar <= 2n - 2 we have vertical bar Gamma(G)(X) vertical bar >= (d + 1) vertical bar X vertical bar. A tree T is small if it has at most n vertices and has maximum degree at most d. Friedman and Pippenger (1987) proved that any ( n; d)- expander contains every small tree. However, their elegant proof does not seem to yield an efficient algorithm for obtaining the tree. In this paper, we give an alternative result that does admit a polynomial time algorithm for finding the immersion of any small tree in subgraphs G of (N, D, lambda)-graphs Lambda, as long as G contains a positive fraction of the edges of Lambda and lambda/D is small enough. In several applications of the Friedman-Pippenger theorem, including the ones in the original paper of those authors, the (n, d)-expander G is a subgraph of an (N, D, lambda)-graph as above. Therefore, our result suffices to provide efficient algorithms for such previously non-constructive applications. As an example, we discuss a recent result of Alon, Krivelevich, and Sudakov (2007) concerning embedding nearly spanning bounded degree trees, the proof of which makes use of the Friedman-Pippenger theorem. We shall also show a construction inspired on Wigderson-Zuckerman expander graphs for which any sufficiently dense subgraph contains all trees of sizes and maximum degrees achieving essentially optimal parameters. Our algorithmic approach is based on a reduction of the tree embedding problem to a certain on-line matching problem for bipartite graphs, solved by Aggarwal et al. (1996).

TESTING STATISTICAL HYPOTHESIS ON RANDOM TREES AND APPLICATIONS TO THE PROTEIN CLASSIFICATION PROBLEM

Efficient automatic protein classification is of central importance in genomic annotation. As an independent way to check the reliability of the classification, we propose a statistical approach to test if two sets of protein domain sequences coming from two families of the Pfam database are significantly different. We model protein sequences as realizations of Variable Length Markov Chains (VLMC) and we use the context trees as a signature of each protein family. Our approach is based on a Kolmogorov-Smirnov-type goodness-of-fit test proposed by Balding et at. [Limit theorems for sequences of random trees (2008), DOI: 10.1007/s11749-008-0092-z]. The test statistic is a supremum over the space of trees of a function of the two samples; its computation grows, in principle, exponentially fast with the maximal number of nodes of the potential trees. We show how to transform this problem into a max-flow over a related graph which can be solved using a Ford-Fulkerson algorithm in polynomial time on that number. We apply the test to 10 randomly chosen protein domain families from the seed of Pfam-A database (high quality, manually curated families). The test shows that the distributions of context trees coming from different families are significantly different. We emphasize that this is a novel mathematical approach to validate the automatic clustering of sequences in any context. We also study the performance of the test via simulations on Galton-Watson related processes.

THE LOWER CENTRAL AND DERIVED SERIES OF THE BRAID GROUPS OF THE SPHERE

In this paper, we determine the lower central and derived series for the braid groups of the sphere. We are motivated in part by the study of Fadell-Neuwirth short exact sequences, but the problem is important in its own right. The braid groups of the 2-sphere S(2) were studied by Fadell, Van Buskirk and Gillette during the 1960s, and are of particular interest due to the fact that they have torsion elements (which were characterised by Murasugi). We first prove that for all n epsilon N, the lower central series of the n-string braid group B(n)(S(2)) is constant from the commutator subgroup onwards. We obtain a presentation of Gamma(2)(Bn(S(2))), from which we observe that Gamma(2)(B(4)(S(2))) is a semi-direct product of the quaternion group Q(8) of order 8 by a free group F(2) of rank 2. As for the derived series of Bn(S(2)), we show that for all n >= 5, it is constant from the derived subgroup onwards. The group Bn(S(2)) being finite and soluble for n <= 3, the critical case is n = 4 for which the derived subgroup is the above semi-direct product Q(8) (sic) F(2). By proving a general result concerning the structure of the derived subgroup of a semi-direct product, we are able to determine completely the derived series of B(4)(S(2)) which from (B(4)(S(2)))(4) onwards coincides with that of the free group of rank 2, as well as its successive derived series quotients.

Implementation of a Control Loop Experiment in a Network-Based Control System With LonWorks Technology and IP Networks

Considering the increasing popularity of network-based control systems and the huge adoption of IP networks (such as the Internet), this paper studies the influence of network quality of service (QoS) parameters over quality of control parameters. An example of a control loop is implemented using two LonWorks networks (CEA-709.1) interconnected by an emulated IP network, in which important QoS parameters such as delay and delay jitter can be completely controlled. Mathematical definitions are provided according to the literature, and the results of the network-based control loop experiment are presented and discussed.

On S-asymptotically omega-periodic functions on Banach spaces and applications

This paper is devoted to the study of the class of continuous and bounded functions f : [0, infinity] -> X for which exists omega > 0 such that lim(t ->infinity) (f (t + omega) - f (t)) = 0 (in the sequel called S-asymptotically omega-periodic functions). We discuss qualitative properties and establish some relationships between this type of functions and the class of asymptotically omega-periodic functions. We also study the existence of S-asymptotically omega-periodic mild solutions of the first-order abstract Cauchy problem in Banach spaces. (C) 2008 Elsevier Inc. All rights reserved.

Computational methods for prediction of T-cell epitopes - a framework for modelling, testing, and applications

Computational models complement laboratory experimentation for efficient identification of MHC-binding peptides and T-cell epitopes. Methods for prediction of MHC-binding peptides include binding motifs, quantitative matrices, artificial neural networks, hidden Markov models, and molecular modelling. Models derived by these methods have been successfully used for prediction of T-cell epitopes in cancer, autoimmunity, infectious disease, and allergy. For maximum benefit, the use of computer models must be treated as experiments analogous to standard laboratory procedures and performed according to strict standards. This requires careful selection of data for model building, and adequate testing and validation. A range of web-based databases and MHC-binding prediction programs are available. Although some available prediction programs for particular MHC alleles have reasonable accuracy, there is no guarantee that all models produce good quality predictions. In this article, we present and discuss a framework for modelling, testing, and applications of computational methods used in predictions of T-cell epitopes. (C) 2004 Elsevier Inc. All rights reserved.

Almost automorphic mild solutions to some partial neutral functional-differential equations and applications

The paper considers the existence and uniqueness of almost automorphic mild solutions to some classes of first-order partial neutral functional-differential equations. Sufficient conditions for the existence and uniqueness of almost automorphic mild solutions to the above-mentioned equations are obtained. As an application, a first-order boundary value problem arising in control systems is considered. (C) 2007 Elsevier Ltd. All fights reserved.

Relationship between use of technology and employment rates for people with physical disabilities in Australia: Implications for education and training programmes

This study examined the impact of computer and assistive device use on the employment status and vocational modes of people with physical disabilities in Australia. A survey was distributed to people over 15 years in age with physical disabilities living in the Brisbane area. Responses were received from 82 people, including those with spinal cord injuries, cerebral palsy and muscular dystrophy. Of respondents 46 were employed, 22 were unemployed, and 12 were either students or undertaking voluntary work. Three-quarters of respondents used a computer in their occupations, while 15 used assistive devices. Using logistic regression analysis it was found that gender, education, level of computer skill and computer training were significant predictors of employment outcomes. Neither the age of respondent nor use of assistive software were significant predictors. From information obtained in this study guidelines for a training programme designed to maximize the employability of people with physical disabilities were developed.

Homeopathic practice in Intensive Care Units: objective semiology, symptom selection and a series of sepsis cases

Homeopathy has been used for more than two hundred years to treat chronic disease using various approaches in a wide range of diseases. However, for acute disease and critical illness, application has been limited by inadequate training of homeopathic physicians and the small number of pertinent clinical studies. In view of the difficulty of practising homeopathy in Intensive Care Units (ICU), a protocol was developed to facilitate description of objective homeopathic symptoms with a ranking of symptoms appropriate for these situations (Protocol for Objective Homeopathic Semiology). Examples of favorable results with individualized homeopathic treatments for a series of cases of Systemic Inflammatory Response Syndrome (sepsis) are described. Homeopathy (2008) 97, 206-213.