939 resultados para cooperative relaying
Resumo:
This phase III trial compared the efficacy and safety of gemcitabine (Gem) plus capecitabine (GemCap) versus single-agent Gem in advanced/metastatic pancreatic cancer.
Resumo:
Abstract Xyleborini are a species-rich tribe of ambrosia beetles, which are haplodiploid and typically mate among siblings within their natal brood chamber. Several characteristics of this tribe would predict the evolution of higher levels of sociality: high genetic relatedness within galleries due to inbreeding, high costs of dispersal and the potential benefit of cooperation in brood care within the natal gallery (e.g. by fungus gardening, gallery extension, offspring feeding and cleaning). However, information on the social system of these beetles is very limited. We examined the potential for cooperative breeding in Xyleborinus saxeseni by monitoring dispersal in relation to brood size and composition. Results show that adult female offspring delay dispersal despite dispersal opportunities, and apparently some females never disperse. The femalesâ?? decision to stay seems to depend on the presence of eggs and dependent siblings. We found no indication that female offspring reproduce in their natal gallery, as colonies with many mature daughters do not contain more eggs than those with few or no daughters. There is a significant positive relationship between the number of females present and the number of dependent siblings (but not eggs), which suggests that cooperative brood care of female offspring raises colony productivity by improving survival rates of immatures. Our results suggest that cooperative breeding is likely to occur in X. saxeseni and possibly other xyleborine species. We argue that a closer look at sociality within this tribe may yield important information on the factors determining the evolution of cooperative breeding and advanced social organization.
Resumo:
This dissertation investigates high performance cooperative localization in wireless environments based on multi-node time-of-arrival (TOA) and direction-of-arrival (DOA) estimations in line-of-sight (LOS) and non-LOS (NLOS) scenarios. Here, two categories of nodes are assumed: base nodes (BNs) and target nodes (TNs). BNs are equipped with antenna arrays and capable of estimating TOA (range) and DOA (angle). TNs are equipped with Omni-directional antennas and communicate with BNs to allow BNs to localize TNs; thus, the proposed localization is maintained by BNs and TNs cooperation. First, a LOS localization method is proposed, which is based on semi-distributed multi-node TOA-DOA fusion. The proposed technique is applicable to mobile ad-hoc networks (MANETs). We assume LOS is available between BNs and TNs. One BN is selected as the reference BN, and other nodes are localized in the coordinates of the reference BN. Each BN can localize TNs located in its coverage area independently. In addition, a TN might be localized by multiple BNs. High performance localization is attainable via multi-node TOA-DOA fusion. The complexity of the semi-distributed multi-node TOA-DOA fusion is low because the total computational load is distributed across all BNs. To evaluate the localization accuracy of the proposed method, we compare the proposed method with global positioning system (GPS) aided TOA (DOA) fusion, which are applicable to MANETs. The comparison criterion is the localization circular error probability (CEP). The results confirm that the proposed method is suitable for moderate scale MANETs, while GPS-aided TOA fusion is suitable for large scale MANETs. Usually, TOA and DOA of TNs are periodically estimated by BNs. Thus, Kalman filter (KF) is integrated with multi-node TOA-DOA fusion to further improve its performance. The integration of KF and multi-node TOA-DOA fusion is compared with extended-KF (EKF) when it is applied to multiple TOA-DOA estimations made by multiple BNs. The comparison depicts that it is stable (no divergence takes place) and its accuracy is slightly lower than that of the EKF, if the EKF converges. However, the EKF may diverge while the integration of KF and multi-node TOA-DOA fusion does not; thus, the reliability of the proposed method is higher. In addition, the computational complexity of the integration of KF and multi-node TOA-DOA fusion is much lower than that of EKF. In wireless environments, LOS might be obstructed. This degrades the localization reliability. Antenna arrays installed at each BN is incorporated to allow each BN to identify NLOS scenarios independently. Here, a single BN measures the phase difference across two antenna elements using a synchronized bi-receiver system, and maps it into wireless channel’s K-factor. The larger K is, the more likely the channel would be a LOS one. Next, the K-factor is incorporated to identify NLOS scenarios. The performance of this system is characterized in terms of probability of LOS and NLOS identification. The latency of the method is small. Finally, a multi-node NLOS identification and localization method is proposed to improve localization reliability. In this case, multiple BNs engage in the process of NLOS identification, shared reflectors determination and localization, and NLOS TN localization. In NLOS scenarios, when there are three or more shared reflectors, those reflectors are localized via DOA fusion, and then a TN is localized via TOA fusion based on the localization of shared reflectors.
Resumo:
Tracking or target localization is used in a wide range of important tasks from knowing when your flight will arrive to ensuring your mail is received on time. Tracking provides the location of resources enabling solutions to complex logistical problems. Wireless Sensor Networks (WSN) create new opportunities when applied to tracking, such as more flexible deployment and real-time information. When radar is used as the sensing element in a tracking WSN better results can be obtained; because radar has a comparatively larger range both in distance and angle to other sensors commonly used in WSNs. This allows for less nodes deployed covering larger areas, saving money. In this report I implement a tracking WSN platform similar to what was developed by Lim, Wang, and Terzis. This consists of several sensor nodes each with a radar, a sink node connected to a host PC, and a Matlab© program to fuse sensor data. I have re-implemented their experiment with my WSN platform for tracking a non-cooperative target to verify their results and also run simulations to compare. The results of these tests are discussed and some future improvements are proposed.
Resumo:
The reported research project involved studying how teaching science using demonstrations, inquiry-based cooperative learning groups, or a combination of the two methods affected sixth grade students’ understanding of air pressure and density. Three different groups of students were each taught the two units using different teaching methods. Group one learned about the topics through both demonstrations and inquirybased cooperative learning, whereas group two only viewed demonstrations, and group three only participated in inquiry-based learning in cooperative learning groups. The study was designed to answer the following two questions: 1. Which teaching strategy works best for supporting student understanding of air pressure and density: demonstrations, inquirybased labs in cooperative learning groups, or a combination of the two? 2. And what effect does the time spent engaging in a particular learning experience (demonstrations or labs) have on student learning? Overall, the data did not provide sufficient evidence that one method of learning was more effective than the others. The results also suggested that spending more time on a unit does not necessarily equate to a better understanding of the concepts by the students. Implications for science instruction are discussed.
Resumo:
In this paper we propose two cooperation schemes to compose new parallel variants of the Variable Neighborhood Search (VNS). On the one hand, a coarse-grained cooperation scheme is introduced which is well suited for being enhanced with a solution warehouse to store and manage the so far best found solutions and a self-adapting mechanism for the most important search parameters. This makes an a priori parameter tuning obsolete. On the other hand, a fine-grained scheme was designed to reproduce the successful properties of the sequential VNS. In combination with the use of parallel exploration threads all of the best solutions and 11 out of 20 new best solutions for the Multi Depot Vehicle Routing Problem with Time Windows were found.
Resumo:
Recently, Branzei, Dimitrov, and Tijs (2003) introduced cooperative interval-valued games. Among other insights, the notion of an interval core has been coined and proposed as a solution concept for interval-valued games. In this paper we will present a general mathematical programming algorithm which can be applied to find an element in the interval core. As an example, we discuss lot sizing with uncertain demand to provide an application for interval-valued games and to demonstrate how interval core elements can be computed. Also, we reveal that pitfalls exist if interval core elements are computed in a straightforward manner by considering the interval borders separately.