Cooperative Mapping and Exploration using Counter-rotational Potential Fields

This paper presents a novel technique for mapping and exploration using cooperating autonomous underwater vehicles. Rather than using the typical lawnmower sweep pattern to search an entire area, the proposed navigational plan involves guiding the formation directly towards each object of interest in turn, before arriving at a final goal position. This is achieved by the use of traditional artificial potential fields alongside counter-rotational potential fields. These clockwise and counter-clockwise fields are employed simultaneously by vehicles to ensure that the entire object is scanned rather than simply avoided as is the case with traditional collision avoidance techniques. The proposed methodology allows a formation to have fluid-like motion whilst a separation distance between cooperating agents (free of angular constraints) is maintained with a greater degree of flexibility than traditional formation control approaches. Owing to its nature, this technique is suited for applications such as exploration, mapping and underwater inspection to name a few. Simulation results demonstrate the efficacy of the proposed approach.

Secure Transmission in Cooperative Relaying Networks with Multiple Antennas

We investigate the secrecy performance of dualhop amplify-and-forward (AF) multi-antenna relaying systems over Rayleigh fading channels, by taking into account the direct link between the source and destination. In order to exploit the available direct link and the multiple antennas for secrecy improvement, different linear processing schemes at the relay and different diversity combining techniques at the destination are proposed, namely, 1) Zero-forcing/Maximal ratio combining (ZF/MRC), 2) ZF/Selection combining (ZF/SC), 3) Maximal ratio transmission/MRC (MRT/MRC) and 4) MRT/Selection combining (MRT/SC). For all these schemes, we present new closed-form approximations for the secrecy outage probability. Moreover, we investigate a benchmark scheme, i.e., cooperative jamming/ZF (CJ/ZF), where the secrecy outage probability is obtained in exact closed-form. In addition, we present asymptotic secrecy outage expressions for all the proposed schemes in the high signal-to-noise ratio (SNR) regime, in order to characterize key design parameters, such as secrecy diversity order and secrecy array gain. The outcomes of this paper can be summarized as follows: a) MRT/MRC and MRT/SC achieve a full diversity order of M + 1, ZF/MRC and ZF/SC achieve a diversity order of M, while CJ/ZF only achieves unit diversity order, where M is the number of antennas at the relay. b) ZF/MRC (ZF/SC) outperforms the corresponding MRT/MRC (MRT/SC) in the low SNR regime, while becomes inferior to the corresponding MRT/MRC (MRT/SC) in the high SNR. c) All of the proposed schemes tend to outperform the CJ/ZF with moderate number of antennas, and linear processing schemes with MRC attain better performance than those with SC.

Knowledge Workers and Associative Activity: An Examination of Knowledge Work Systems and Settings

Thesis (Ph.D.)--University of Washington, 2016-08

'Cooperative Automated worm Response and Detection ImmuNe ALgorithm (CARDINAL) inspired by T-cell Immunity and Tolerance'

The role of T-cells within the immune system is to confirm and assess anomalous situations and then either respond to or tolerate the source of the effect. To illustrate how these mechanisms can be harnessed to solve real-world problems, we present the blueprint of a T-cell inspired algorithm for computer security worm detection. We show how the three central T-cell processes, namely T-cell maturation, differentiation and proliferation, naturally map into this domain and further illustrate how such an algorithm fits into a complete immune inspired computer security system and framework.

'Cooperative Automated worm Response and Detection ImmuNe ALgorithm (CARDINAL) inspired by T-cell Immunity and Tolerance'

The role of T-cells within the immune system is to confirm and assess anomalous situations and then either respond to or tolerate the source of the effect. To illustrate how these mechanisms can be harnessed to solve real-world problems, we present the blueprint of a T-cell inspired algorithm for computer security worm detection. We show how the three central T-cell processes, namely T-cell maturation, differentiation and proliferation, naturally map into this domain and further illustrate how such an algorithm fits into a complete immune inspired computer security system and framework.

Energy Cooperation in Energy Harvesting Communication Systems

In energy harvesting communications, users transmit messages using energy harvested from nature. In such systems, transmission policies of the users need to be carefully designed according to the energy arrival profiles. When the energy management policies are optimized, the resulting performance of the system depends only on the energy arrival profiles. In this dissertation, we introduce and analyze the notion of energy cooperation in energy harvesting communications where users can share a portion of their harvested energy with the other users via wireless energy transfer. This energy cooperation enables us to control and optimize the energy arrivals at users to the extent possible. In the classical setting of cooperation, users help each other in the transmission of their data by exploiting the broadcast nature of wireless communications and the resulting overheard information. In contrast to the usual notion of cooperation, which is at the signal level, energy cooperation we introduce here is at the battery energy level. In a multi-user setting, energy may be abundant in one user in which case the loss incurred by transferring it to another user may be less than the gain it yields for the other user. It is this cooperation that we explore in this dissertation for several multi-user scenarios, where energy can be transferred from one user to another through a separate wireless energy transfer unit. We first consider the offline optimal energy management problem for several basic multi-user network structures with energy harvesting transmitters and one-way wireless energy transfer. In energy harvesting transmitters, energy arrivals in time impose energy causality constraints on the transmission policies of the users. In the presence of wireless energy transfer, energy causality constraints take a new form: energy can flow in time from the past to the future for each user, and from one user to the other at each time. This requires a careful joint management of energy flow in two separate dimensions, and different management policies are required depending on how users share the common wireless medium and interact over it. In this context, we analyze several basic multi-user energy harvesting network structures with wireless energy transfer. To capture the main trade-offs and insights that arise due to wireless energy transfer, we focus our attention on simple two- and three-user communication systems, such as the relay channel, multiple access channel and the two-way channel. Next, we focus on the delay minimization problem for networks. We consider a general network topology of energy harvesting and energy cooperating nodes. Each node harvests energy from nature and all nodes may share a portion of their harvested energies with neighboring nodes through energy cooperation. We consider the joint data routing and capacity assignment problem for this setting under fixed data and energy routing topologies. We determine the joint routing of energy and data in a general multi-user scenario with data and energy transfer. Next, we consider the cooperative energy harvesting diamond channel, where the source and two relays harvest energy from nature and the physical layer is modeled as a concatenation of a broadcast and a multiple access channel. Since the broadcast channel is degraded, one of the relays has the message of the other relay. Therefore, the multiple access channel is an extended multiple access channel with common data. We determine the optimum power and rate allocation policies of the users in order to maximize the end-to-end throughput of this system. Finally, we consider the two-user cooperative multiple access channel with energy harvesting users. The users cooperate at the physical layer (data cooperation) by establishing common messages through overheard signals and then cooperatively sending them. For this channel model, we investigate the effect of intermittent data arrivals to the users. We find the optimal offline transmit power and rate allocation policy that maximize the departure region. When the users can further cooperate at the battery level (energy cooperation), we find the jointly optimal offline transmit power and rate allocation policy together with the energy transfer policy that maximize the departure region.

Equilibrium Assignments in Competitive and Cooperative Traffic Flow Routing

Part 18: Optimization in Collaborative Networks

Carrier Selection for Multi-commodity Flow Optimization in Cooperative Environments

Part 18: Optimization in Collaborative Networks

Turkish Security Policymaking on Nuclear Issues: Conceptualizing Advanced Cooperative Security Strategies

Turkey is a non-nuclear member of a nuclear alliance in a region where nuclear proliferation is of particular concern. As the only North Atlantic Treaty Organization (NATO) member that has a border with the Middle East, Turkish officials argue that Turkey cannot solely rely on NATO guarantees in addressing the regional security challenges. However, Turkey has not been able to formulate a security policy that reconciles its quest for independence, its NATO membership, the bilateral relationship with the United States, and regional engagement in the Middle East. This dissertation assesses the strategic implications of Turkey’s perceptions of the U.S./NATO nuclear and conventional deterrence on nuclear issues. It explores three case studies by the process tracing of Turkish policymakers’ nuclear-related decisions on U.S. tactical nuclear weapons deployed in Europe, national air and missile defense, and Iran’s nuclear program. The study finds that the principles of Turkish security policymaking do not incorporate a fundamentally different reasoning on nuclear issues than conventional deterrence. Nuclear weapons and their delivery systems do not have a defining role in Turkish security and defense strategy. The decisions are mainly guided by non-nuclear considerations such as Alliance politics, modernization of the domestic defense industry, and regional influence. The dissertation argues that Turkey could formulate more effective and less risky security policies on nuclear issues by emphasizing the cooperative security approaches within the NATO Alliance over confrontational measures. The findings of this dissertation reveal that a major transformation of Turkish security policymaking is required to end the crisis of confidence with NATO, redefinition of the strategic partnership with the US, and a more cautious approach toward the Middle East. The dissertation argues that Turkey should promote proactive measures to reduce, contain, and counter risks before they develop into real threats, as well as contribute to developing consensual confidence-building measures to reduce uncertainty.

Query routing in cooperative semi-structured peer-to-peer information retrieval networks

Conventional web search engines are centralised in that a single entity crawls and indexes the documents selected for future retrieval, and the relevance models used to determine which documents are relevant to a given user query. As a result, these search engines suffer from several technical drawbacks such as handling scale, timeliness and reliability, in addition to ethical concerns such as commercial manipulation and information censorship. Alleviating the need to rely entirely on a single entity, Peer-to-Peer (P2P) Information Retrieval (IR) has been proposed as a solution, as it distributes the functional components of a web search engine – from crawling and indexing documents, to query processing – across the network of users (or, peers) who use the search engine. This strategy for constructing an IR system poses several efficiency and effectiveness challenges which have been identified in past work. Accordingly, this thesis makes several contributions towards advancing the state of the art in P2P-IR effectiveness by improving the query processing and relevance scoring aspects of a P2P web search. Federated search systems are a form of distributed information retrieval model that route the user’s information need, formulated as a query, to distributed resources and merge the retrieved result lists into a final list. P2P-IR networks are one form of federated search in routing queries and merging result among participating peers. The query is propagated through disseminated nodes to hit the peers that are most likely to contain relevant documents, then the retrieved result lists are merged at different points along the path from the relevant peers to the query initializer (or namely, customer). However, query routing in P2P-IR networks is considered as one of the major challenges and critical part in P2P-IR networks; as the relevant peers might be lost in low-quality peer selection while executing the query routing, and inevitably lead to less effective retrieval results. This motivates this thesis to study and propose query routing techniques to improve retrieval quality in such networks. Cluster-based semi-structured P2P-IR networks exploit the cluster hypothesis to organise the peers into similar semantic clusters where each such semantic cluster is managed by super-peers. In this thesis, I construct three semi-structured P2P-IR models and examine their retrieval effectiveness. I also leverage the cluster centroids at the super-peer level as content representations gathered from cooperative peers to propose a query routing approach called Inverted PeerCluster Index (IPI) that simulates the conventional inverted index of the centralised corpus to organise the statistics of peers’ terms. The results show a competitive retrieval quality in comparison to baseline approaches. Furthermore, I study the applicability of using the conventional Information Retrieval models as peer selection approaches where each peer can be considered as a big document of documents. The experimental evaluation shows comparative and significant results and explains that document retrieval methods are very effective for peer selection that brings back the analogy between documents and peers. Additionally, Learning to Rank (LtR) algorithms are exploited to build a learned classifier for peer ranking at the super-peer level. The experiments show significant results with state-of-the-art resource selection methods and competitive results to corresponding classification-based approaches. Finally, I propose reputation-based query routing approaches that exploit the idea of providing feedback on a specific item in the social community networks and manage it for future decision-making. The system monitors users’ behaviours when they click or download documents from the final ranked list as implicit feedback and mines the given information to build a reputation-based data structure. The data structure is used to score peers and then rank them for query routing. I conduct a set of experiments to cover various scenarios including noisy feedback information (i.e, providing positive feedback on non-relevant documents) to examine the robustness of reputation-based approaches. The empirical evaluation shows significant results in almost all measurement metrics with approximate improvement more than 56% compared to baseline approaches. Thus, based on the results, if one were to choose one technique, reputation-based approaches are clearly the natural choices which also can be deployed on any P2P network.

Identification of endophytic bactéria from micropropagated yacon (Smallanthus sonchifolius) crowing under autotrophic and Heterotrophic systems.

Yacon, Smallanthus sonchifolius, an Andean species. is a rich source of dictetíc oligofructans with low glucose content. proteins and phenolic compounds. These constituents have shown efficacy in the prevention of diet-related ehronic diseases, including gastroin-testinal disorders and diabetes |1,2|. Yacon is part of a research program at the National Center for Natural Products Research (NCNPR) and University of Mississippi Field Station to develop new alternative root crops for Mississippi while attempting to im-prove the diet of low incorne families. Yacon can be easily propa-gated by cultings. Virus and nematode infections have been re-ported on plants propagated by cuttings in Brazil. a country that hás adopted Yacon as specialty crop [3|. We have developed two culture systems. autotrophic and heterotrophic, to produce healthy plants. Herem we describe the presence of endophytic bactéria m micropropagated Yacon. In auxin free media, new roots were induced. Overa 15day period. the average root mduction per expiam was 5.45 to 8.75 under autotrophic and heterotrophic cul-tures, respectively. Root lenglh vaned between 3 and 60mrn. The presence of root hairs and lateral roots was noticed only in auto-trophic condilions. These beneficiai bactéria were identified and chemically ctiaracterized. Acknowledgement: This research work was partially supported by the USDA/ARS Cooperative Research Agreement No. 58-6408-2-009. Referentes; |1) Terada S. et ai. (2006] Yakugaku Zasshi 126(8): 665-669. (2| Valentová K. Ulri-chová j. (2003) Biomedical Papers 147: 119-130. [3| Mogor C. et ai, (2003) Acta Horticulturea 597: 311 -313.

On the zeros of the Abelian integrals for a class of Liénard systems

A planar polynomial differential system has a finite number of limit cycles. However, finding the upper bound of the number of limit cycles is an open problem for the general nonlinear dynamical systems. In this paper, we investigated a class of Liénard systems of the form x'=y, y'=f(x)+y g(x) with deg f=5 and deg g=4. We proved that the related elliptic integrals of the Liénard systems have at most three zeros including multiple zeros, which implies that the number of limit cycles bifurcated from the periodic orbits of the unperturbed system is less than or equal to 3.