Phylogenetic analysis of the Monocotylidae (Monogenea) inferred from 28S rDNA sequences

The current classification of the Monocotylidae (Monogenea) is based on a phylogeny generated from morphological characters. The present study tests the morphological phylogenetic hypothesis using molecular methods. Sequences from domains C2 and D1 and the partial domains C1 and D2 from the 28S rDNA gene for 26 species of monocotylids from six of the seven subfamilies were used. Trees were generated using maximum parsimony, neighbour joining and maximum likelihood algorithms. The maximum parsimony tree, with branches showing less than 70% bootstrap support collapsed, had a topology identical to that obtained using the maximum likelihood analysis. The neighbour joining tree, with branches showing less than 70% support collapsed. differed only in its placement of Heterocotyle capricornensis as the sister group to the Decacotylinae clade. The molecular tree largely supports the subfamilies established using morphological characters. Differences are primarily how the subfamilies are related to each other. The monophyly of the Calicotylinae and Merizocotylinae and their sister group relationship is supported by high bootstrap values in all three methods, but relationships within the Merizocotylinae are unclear. Merizocotyle is paraphyletic and our data suggest that Mycteronastes and Thaumatocotyle, which were synonymized with Merizocotyle after the morphological cladistic analysis, should perhaps be resurrected as valid genera. The monophyly of the Monocotylinae and Decacotylinae is also supported by high bootstrap values. The Decacotylinae, which was considered previously to be the sister group to the Calicotylinae plus Merizocotylinae, is grouped in an unresolved polychotomy with the Monocotylinae and members of the Heterocotylinae. According to our molecular data, the Heterocotylinae is paraphyletic. Molecular data support a sister group relationship between Troglocephalus rhinobatidis and Neoheterocotyle rhinobatidis to the exclusion of the other species of Neoheterocotyle and recognition of Troglocephalus renders Neoheterocotyle,le paraphyletic. We propose Troglocephalus incertae sedis. An updated classification and full species list of the Monocotylidae is provided. (C) 2001 Australian Society for Parasitology Inc. Published by Elsevier Science Ltd. All rights reserved.

Influence of fungal pathogens and environmental conditions on disease severity, flower fall and desiccation of harvested Geraldton waxflower - 2. Studies with commercial packages

Relationships were examined between environmental conditions mediated by packaging and handling and the deterioration of harvested Geraldton waxflower cv. 'Fortune Cookie'. Disease severity plus flower and leaf drop caused by inoculation with Botrytis cinerea were reduced by lowering handling temperatures to 0, 5 or 5/20 degreesC alternated daily, versus 20 degreesC. They were also reduced by inhibition of ethylene action with a silver thiosulfate pulse pretreatment. Additionally, treatments that enhanced water loss, such as packing dry, keeping forced air-cooling holes open and strategic placement of extra ventilation holes may also reduce disease severity and flower plus leaf fall. Inclusion of KMnO4-based Bloomfresh ethylene scrubbing sachets in packages did not reduce disease severity or lessen flower plus leaf fall. Thus, deterioration of waxflower packaged in commercial cartons can be minimised by keeping temperatures low, packing plant material dry, use of cartons with strategically placed ventilation holes and/or pretreatment with silver thiosulfate.

Synonymy of Perkinsus olseni Lester & Davis, 1981 and Perkinsus atlanticus Azevedo, 1989 and an update on the phylogenetic position of the genus Perkinsus

Sequences of the rRNA nontranscribed spacer (NTS) were determined for six isolates of Perkinsus olseni, seven isolates of Perkinsus sp. from Anadara trapezia and one isolate of Perkinsus sp. from Austrovenus stutchburyi. These sequences were compared with previously published NTS sequences for R atlanticus, P. marinus and P. andrewsi. Consensus sequences for Perkinsus olseni, the Perkinsus isolates and P. atlanticus were approximately 98-99% similar to each other but only 65-79% similar to P. marinus and P. andrewsi sequences. Some individual P. olseni sequences were less similar to each other (97.4%) than they were to P. atlanticus sequences (97.8-98.2%), therefore NTS provides further evidence that P. atlanticus, P. olseni, Perkinsus sp. from Anadara trapezia and Perkinsus sp. from Austrovenus stutchburyi are conspecific. We propose that P. atlanticus be synonymised with P. olseni Lester & Davis, 1981 which has taxonomic priority, and that Perkinsus sp. from Anadara trapezia and Perkinsus sp. from Austrovenus stutchburyi belong to R olseni sensu lato as well. A phylogenetic analysis of SSU rDNA, incorporating recently published Perkinsus sequences, supports the placement of the Perkinsus species with Parvilucifera infectans within the Dinoflagellata.

Towards the design of efficient nonbeacon-enabled ZigBee networks

This paper presents experimental results of the communication performance evaluation of a prototype ZigBee-based patient monitoring system commissioned in an in-patient floor of a Portuguese hospital (HPG – Hospital Privado de Guimar~aes). Besides, it revisits relevant problems that affect the performance of nonbeacon-enabled ZigBee networks. Initially, the presence of hidden-nodes and the impact of sensor node mobility are discussed. It was observed, for instance, that the message delivery ratio in a star network consisting of six wireless electrocardiogram sensor devices may decrease from 100% when no hidden-nodes are present to 83.96% when half of the sensor devices are unable to detect the transmissions made by the other half. An additional aspect which affects the communication reliability is a deadlock condition that can occur if routers are unable to process incoming packets during the backoff part of the CSMA-CA mechanism. A simple approach to increase the message delivery ratio in this case is proposed and its effectiveness is verified. The discussion and results presented in this paper aim to contribute to the design of efficient networks,and are valid to other scenarios and environments rather than hospitals.

Thoracic wall reconstruction using ultrasound images to model/bend the thoracic prosthesis for correction of pectus excavatum

Pectus excavatum is the most common congenital deformity of the anterior thoracic wall. The surgical correction of such deformity, using Nuss procedure, consists in the placement of a personalized convex prosthesis into sub-sternal position to correct the deformity. The aim of this work is the CT-scan substitution by ultrasound imaging for the pre-operative diagnosis and pre-modeling of the prosthesis, in order to avoid patient radiation exposure. To accomplish this, ultrasound images are acquired along an axial plane, followed by a rigid registration method to obtain the spatial transformation between subsequent images. These images are overlapped to reconstruct an axial plane equivalent to a CT-slice. A phantom was used to conduct preliminary experiments and the achieved results were compared with the corresponding CT-data, showing that the proposed methodology can be capable to create a valid approximation of the anterior thoracic wall, which can be used to model/bend the prosthesis

Cycle time properties of the PROFIBUS timed-token protocol

A recent trend in distributed computer-controlled systems (DCCS) is to interconnect the distributed computing elements by means of multi-point broadcast networks. Since the network medium is shared between a number of network nodes, access contention exists and must be solved by a medium access control (MAC) protocol. Usually, DCCS impose real-time constraints. In essence, by real-time constraints we mean that traffic must be sent and received within a bounded interval, otherwise a timing fault is said to occur. This motivates the use of communication networks with a MAC protocol that guarantees bounded access and response times to message requests. PROFIBUS is a communication network in which the MAC protocol is based on a simplified version of the timed-token protocol. In this paper we address the cycle time properties of the PROFIBUS MAC protocol, since the knowledge of these properties is of paramount importance for guaranteeing the real-time behaviour of a distributed computer-controlled system which is supported by this type of network.

Timing analysis of a multiple logical ring wired/wireless PROFIBUS network

Recently, there have been a few research efforts towards extending the capabilities of fieldbus networks to encompass wireless support. In previous works we have proposed a hybrid wired/wireless PROFIBUS network solution where the interconnection between the heterogeneous communication media was accomplished through bridge-like interconnecting devices. The resulting networking architecture embraced a multiple logical ring (MLR) approach, thus with multiple independent tokens, to which a specific bridging protocol extension, the inter-domain protocol (IDP), was proposed. The IDP offers compatibility with standard PROFIBUS, and includes mechanisms to support inter-cell mobility of wireless nodes. We advance that work by proposing a worst-case response timing analysis of the IDP.

Improving quality-of-service in wireless sensor networks by mitigating “Hidden-Node Collisions”

Wireless sensor networks (WSNs) emerge as underlying infrastructures for new classes of large-scale networked embedded systems. However, WSNs system designers must fulfill the quality-of-service (QoS) requirements imposed by the applications (and users). Very harsh and dynamic physical environments and extremely limited energy/computing/memory/communication node resources are major obstacles for satisfying QoS metrics such as reliability, timeliness, and system lifetime. The limited communication range of WSN nodes, link asymmetry, and the characteristics of the physical environment lead to a major source of QoS degradation in WSNs-the ldquohidden node problem.rdquo In wireless contention-based medium access control (MAC) protocols, when two nodes that are not visible to each other transmit to a third node that is visible to the former, there will be a collision-called hidden-node or blind collision. This problem greatly impacts network throughput, energy-efficiency and message transfer delays, and the problem dramatically increases with the number of nodes. This paper proposes H-NAMe, a very simple yet extremely efficient hidden-node avoidance mechanism for WSNs. H-NAMe relies on a grouping strategy that splits each cluster of a WSN into disjoint groups of non-hidden nodes that scales to multiple clusters via a cluster grouping strategy that guarantees no interference between overlapping clusters. Importantly, H-NAMe is instantiated in IEEE 802.15.4/ZigBee, which currently are the most widespread communication technologies for WSNs, with only minor add-ons and ensuring backward compatibility with their protocols standards. H-NAMe was implemented and exhaustively tested using an experimental test-bed based on ldquooff-the-shelfrdquo technology, showing that it increases network throughput and transmission success probability up to twice the values obtained without H-NAMe. H-NAMe effectiveness was also demonstrated in a target tracking application with mobile robots - over a WSN deployment.

Efficient computation of min and max sensor values in multihop networks

Consider a wireless sensor network (WSN) where a broadcast from a sensor node does not reach all sensor nodes in the network; such networks are often called multihop networks. Sensor nodes take individual sensor readings, however, in many cases, it is relevant to compute aggregated quantities of these readings. In fact, the minimum and maximum of all sensor readings at an instant are often interesting because they indicate abnormal behavior, for example if the maximum temperature is very high then it may be that a fire has broken out. In this context, we propose an algorithm for computing the min or max of sensor readings in a multihop network. This algorithm has the particularly interesting property of having a time complexity that does not depend on the number of sensor nodes; only the network diameter and the range of the value domain of sensor readings matter.

Simulation study of energy efficient scheduling for IEEE 802.15.4/ZigBee cluster-treeWireless Sensor Networks with time-bounded data flows

The simulation analysis is important approach to developing and evaluating the systems in terms of development time and cost. This paper demonstrates the application of Time Division Cluster Scheduling (TDCS) tool for the configuration of IEEE 802.15.4/ZigBee beaconenabled cluster-tree WSNs using the simulation analysis, as an illustrative example that confirms the practical applicability of the tool. The simulation study analyses how the number of retransmissions impacts the reliability of data transmission, the energy consumption of the nodes and the end-to-end communication delay, based on the simulation model that was implemented in the Opnet Modeler. The configuration parameters of the network are obtained directly from the TDCS tool. The simulation results show that the number of retransmissions impacts the reliability, the energy consumption and the end-to-end delay, in a way that improving the one may degrade the others.

Exact analysis of TDMA with slot skipping

Consider a communication medium shared among a set of computer nodes; these computer nodes issue messages that are requested to be transmitted and they must finish their transmission before their respective deadlines. TDMA/SS is a protocol that solves this problem; it is a specific type of Time Division Multiple Access (TDMA) where a computer node is allowed to skip its time slot and then this time slot can be used by another computer node. We present an algorithm that computes exact queuing times for TDMA/SS in conjunction with Rate-Monotonic (RM) or Earliest- Deadline-First (EDF).

Collision-free prioritized medium access control in wireless networks with hidden nodes

We propose a collision-free medium access control (MAC) protocol, which implements static-priority scheduling and works in the presence of hidden nodes. The MAC protocol allows multiple masters and is fully distributed; it is an adaptation to a wireless channel of the dominance protocol used in the CAN bus. But unlike that protocol, our protocol does not require a node having the ability to sense the channel while transmitting to the channel. Our protocol is collision-free even in the presence of hidden nodes and it achieves this without synchronized clocks or out-of-band busy tones. In addition, the protocol is designed to ensure that many non-interfering nodes can transmit in parallel and it functions for both broadcast and unicast transmissions.

Node adaptation for global collocation with radial basis functions using direct multisearch for multiobjective optimization

Meshless methods are used for their capability of producing excellent solutions without requiring a mesh, avoiding mesh related problems encountered in other numerical methods, such as finite elements. However, node placement is still an open question, specially in strong form collocation meshless methods. The number of used nodes can have a big influence on matrix size and therefore produce ill-conditioned matrices. In order to optimize node position and number, a direct multisearch technique for multiobjective optimization is used to optimize node distribution in the global collocation method using radial basis functions. The optimization method is applied to the bending of isotropic simply supported plates. Using as a starting condition a uniformly distributed grid, results show that the method is capable of reducing the number of nodes in the grid without compromising the accuracy of the solution. (C) 2013 Elsevier Ltd. All rights reserved.

Suppression of humoral immunity and lymphocyte responsiveness during experimental trypanosoma cruzi infections

C3H/He and C57B1/6 mice were inoculated with 500 Trypanosoma cruzi trypomastigotes (Strain Y). During the acute phase infected mice presented parasitemia and enlargement of lymph nodes and spleens and intracellular parasites were observed in the heart. Examinations of cells derived from spleen and lymph nodes showed increased numbers of IgM and IgG-bearing cells. During the peak of splenomegaly, about day 17 post-infections, splenic lymphocytes showed a marked decrease in responsiveness to T and B-cell mitogens, parasite antigens and plaque forming cells (PFC) to sheep red blood cells (SRBC). Unfractionated or plastic adherent splenic cells from mice, obtained during the acute phase were able to suppress the response to mitogens by lymphocytes from uninfected mice. During the chronic phase. Disappearance of parasitemia and intracellular parasites in the hearts as well as a decrease in spleen size, was observed. These changes preceded the complete recovery of responsiveness to mitogens and T. cruzi antigens by C57B1/6 splenic lymphocytes. However, this recovery was only partial in the C3H/He mice, known to be more sensitive to T. cruzi infection. Partial recovery of humoral immune response also occurred in both strains of mice during the chronic phase.

Performance evaluation of a cooperative reputation system for vehicular delay-tolerant networks

In the last decade, both scientific community and automotive industry enabled communications among vehicles in different kinds of scenarios proposing different vehicular architectures. Vehicular delay-tolerant networks (VDTNs) were proposed as a solution to overcome some of the issues found in other vehicular architectures, namely, in dispersed regions and emergency scenarios. Most of these issues arise from the unique characteristics of vehicular networks. Contrary to delay-tolerant networks (DTNs), VDTNs place the bundle layer under the network layer in order to simplify the layered architecture and enable communications in sparse regions characterized by long propagation delays, high error rates, and short contact durations. However, such characteristics turn contacts very important in order to exchange as much information as possible between nodes at every contact opportunity. One way to accomplish this goal is to enforce cooperation between network nodes. To promote cooperation among nodes, it is important that nodes share their own resources to deliver messages from others. This can be a very difficult task, if selfish nodes affect the performance of cooperative nodes. This paper studies the performance of a cooperative reputation system that detects, identify, and avoid communications with selfish nodes. Two scenarios were considered across all the experiments enforcing three different routing protocols (First Contact, Spray and Wait, and GeoSpray). For both scenarios, it was shown that reputation mechanisms that punish aggressively selfish nodes contribute to increase the overall network performance.