Phylogenetics and biogeography of a spectacular Old World radiation of butterflies: the subtribe Mycalesina (Lepidoptera: Nymphalidae: Satyrini)

Background: Butterflies of the subtribe Mycalesina (Nymphalidae: Satyrinae) are important model organisms in ecology and evolution. This group has radiated spectacularly in the Old World tropics and presents an exciting opportunity to better understand processes of invertebrate rapid radiations. However, the generic-level taxonomy of the subtribe has been in a constant state of flux, and relationships among genera are unknown. There are six currently recognized genera in the group. Mycalesis, Lohora and Nirvanopsis are found in the Oriental region, the first of which is the most speciose genus among mycalesines, and extends into the Australasian region. Hallelesis and Bicyclus are found in mainland Africa, while Heteropsis is primarily Madagascan, with a few species in Africa. We infer the phylogeny of the group with data from three genes (total of 3139 bp) and use these data to reconstruct events in the biogeographic history of the group.,Results: The results indicate that the group Mycalesina radiated rapidly around the Oligocene-Miocene boundary. Basal relationships are unresolved, but we recover six well-supported clades. Some species of Mycalesis are nested within a primarily Madagascan clade of Heteropsis,while Nirvanopsis is nested within Lohora. The phylogeny suggests that the group had its origin either in Asia or Africa, and diversified through dispersals between the two regions, during the late Oligocene and early Miocene. The current dataset tentatively suggests that the Madagascan fauna comprises two independent radiations. The Australasian radiation shares a common ancestor derived from Asia. We discuss factors that are likely to have played a key role in the diversification of the group. Conclusions: We propose a significantly revised classification scheme for Mycalesina. We conclude that the group originated and radiated from an ancestor that was found either in Asia or Africa, with dispersals between the two regions and to Australasia. Our phylogeny paves the way for further comparative studies on this group that will help us understand the processes underlying diversification in rapid radiations of invertebrates.

Comparative Analyses of Age- and Sex-Specific Patterns of Vocal Behaviour in Four Species of Old World Monkeys

Sound recordings and behavioural data were collected from four primate species of two genera (Macaca, Presbytis). Comparative analyses of structural and behavioural aspects of vocal communication revealed a high degree of intrageneric similarity but striking intergeneric differences. In the two macaque species (Macaca silenus, Macaca radiata), males and females shared the major part of the repertoire. In contrast, in the two langurs (Presbytis johnii, Presbytis entellus), many calls were exclusive to adult males. Striking differences between both species groups occurred with respect to age-specific patterns of vocal behaviour. The diversity of vocal behaviour was assessed from the number of different calls used and the proportion of each call in relation to total vocal output for a given age/sex class. In Macaca, diversity decreases with the age of the vocalizer, whereas in Presbytis the age of the vocalizer and the diversity of vocal behaviour are positively correlated. A comparison of the data of the two genera does not suggest any causal relationship between group composition (e.g. multi-male vs. one-male group) and communication system. Within each genus, interspecific differences in vocal behaviour can be explained by differences in social behaviour (e.g. group cohesion, intergroup relation, mating behaviour) and functional disparities. Possible factors responsible for the pronounced intergeneric differences in vocal behaviour between Macaca and Presbytis are discussed.

Energy for the Developing World

Described are methods which can be used by developing countries to affordably obtain the energy without ruining the environment. The approaches mix efficient end-use technologies with modest increases in generating capacity. (CW).

A Shapley Value-Based Approach to Discover Influential Nodes in Social Networks

Our study concerns an important current problem, that of diffusion of information in social networks. This problem has received significant attention from the Internet research community in the recent times, driven by many potential applications such as viral marketing and sales promotions. In this paper, we focus on the target set selection problem, which involves discovering a small subset of influential players in a given social network, to perform a certain task of information diffusion. The target set selection problem manifests in two forms: 1) top-k nodes problem and 2) lambda-coverage problem. In the top-k nodes problem, we are required to find a set of k key nodes that would maximize the number of nodes being influenced in the network. The lambda-coverage problem is concerned with finding a set of k key nodes having minimal size that can influence a given percentage lambda of the nodes in the entire network. We propose a new way of solving these problems using the concept of Shapley value which is a well known solution concept in cooperative game theory. Our approach leads to algorithms which we call the ShaPley value-based Influential Nodes (SPINs) algorithms for solving the top-k nodes problem and the lambda-coverage problem. We compare the performance of the proposed SPIN algorithms with well known algorithms in the literature. Through extensive experimentation on four synthetically generated random graphs and six real-world data sets (Celegans, Jazz, NIPS coauthorship data set, Netscience data set, High-Energy Physics data set, and Political Books data set), we show that the proposed SPIN approach is more powerful and computationally efficient. Note to Practitioners-In recent times, social networks have received a high level of attention due to their proven ability in improving the performance of web search, recommendations in collaborative filtering systems, spreading a technology in the market using viral marketing techniques, etc. It is well known that the interpersonal relationships (or ties or links) between individuals cause change or improvement in the social system because the decisions made by individuals are influenced heavily by the behavior of their neighbors. An interesting and key problem in social networks is to discover the most influential nodes in the social network which can influence other nodes in the social network in a strong and deep way. This problem is called the target set selection problem and has two variants: 1) the top-k nodes problem, where we are required to identify a set of k influential nodes that maximize the number of nodes being influenced in the network and 2) the lambda-coverage problem which involves finding a set of influential nodes having minimum size that can influence a given percentage lambda of the nodes in the entire network. There are many existing algorithms in the literature for solving these problems. In this paper, we propose a new algorithm which is based on a novel interpretation of information diffusion in a social network as a cooperative game. Using this analogy, we develop an algorithm based on the Shapley value of the underlying cooperative game. The proposed algorithm outperforms the existing algorithms in terms of generality or computational complexity or both. Our results are validated through extensive experimentation on both synthetically generated and real-world data sets.

A non-cooperative game-theoretic approach to channel assignment in multi-channel multi-radio wireless networks

Channel assignment in multi-channel multi-radio wireless networks poses a significant challenge due to scarcity of number of channels available in the wireless spectrum. Further, additional care has to be taken to consider the interference characteristics of the nodes in the network especially when nodes are in different collision domains. This work views the problem of channel assignment in multi-channel multi-radio networks with multiple collision domains as a non-cooperative game where the objective of the players is to maximize their individual utility by minimizing its interference. Necessary and sufficient conditions are derived for the channel assignment to be a Nash Equilibrium (NE) and efficiency of the NE is analyzed by deriving the lower bound of the price of anarchy of this game. A new fairness measure in multiple collision domain context is proposed and necessary and sufficient conditions for NE outcomes to be fair are derived. The equilibrium conditions are then applied to solve the channel assignment problem by proposing three algorithms, based on perfect/imperfect information, which rely on explicit communication between the players for arriving at an NE. A no-regret learning algorithm known as Freund and Schapire Informed algorithm, which has an additional advantage of low overhead in terms of information exchange, is proposed and its convergence to the stabilizing outcomes is studied. New performance metrics are proposed and extensive simulations are done using Matlab to obtain a thorough understanding of the performance of these algorithms on various topologies with respect to these metrics. It was observed that the algorithms proposed were able to achieve good convergence to NE resulting in efficient channel assignment strategies.

Si, Si-Ge and the new heterostructure world

Semiconductor heterostructures based on AlAs/GaAs and other III-V compounds have been the focus of active research for some time now. Ih the last decade, a new heterostructure material, the strained Si/SiGe system, has emerged. This heterojunction technology can potentially be integrated into the current VLSI environment with large-scale impact in the growing microelectronics market. Si/SiGe heterojunction bipolar transistors with cut-off frequencies exceeding 100 GHz and other electronic and optical devices with superior properties compared to all-Si technology have been demonstrated in laboratories worldwide.

A game theoretical multiple resource interaction approach to resource allocation in an air campaign

In this paper we propose a multiple resource interaction model in a game-theoretical framework to solve resource allocation problems in theater level military campaigns. An air raid campaign using SEAD aircraft and bombers against an enemy target defended by air defense units is considered as the basic platform. Conditions for the existence of saddle point in pure strategies is proved and explicit feedback strategies are obtained for a simplified model with linear attrition function limited by resource availability. An illustrative example demonstrates the key features.

A Tutorial on Integrating CDS/ISIS Databases with the World Wide Web

With the emergence of Internet, the global connectivity of computers has become a reality. Internet has progressed to provide many user-friendly tools like Gopher, WAIS, WWW etc. for information publishing and access. The WWW, which integrates all other access tools, also provides a very convenient means for publishing and accessing multimedia and hypertext linked documents stored in computers spread across the world. With the emergence of WWW technology, most of the information activities are becoming Web-centric. Once the information is published on the Web, a user can access this information from any part of the world. A Web browser like Netscape or Internet Explorer is used as a common user interface for accessing information/databases. This will greatly relieve a user from learning the search syntax of individual information systems. Libraries are taking advantage of these developments to provide access to their resources on the Web. CDS/ISIS is a very popular bibliographic information management software used in India. In this tutorial we present details of integrating CDS/ISIS with the WWW. A number of tools are now available for making CDS/ISIS database accessible on the Internet/Web. Some of these are 1) the WAIS_ISIS Server. 2) the WWWISIS Server 3) the IQUERY Server. In this tutorial, we have explained in detail the steps involved in providing Web access to an existing CDS/ISIS database using the freely available software, WWWISIS. This software is developed, maintained and distributed by BIREME, the Latin American & Caribbean Centre on Health Sciences Information. WWWISIS acts as a server for CDS/ISIS databases in a WWW client/server environment. It supports functions for searching, formatting and data entry operations over CDS/ISIS databases. WWWISIS is available for various operating systems. We have tested this software on Windows '95, Windows NT and Red Hat Linux release 5.2 (Appolo) Kernel 2. 0. 36 on an i686. The testing was carried out using IISc's main library's OPAC containing more than 80,000 records and Current Contents issues (bibliographic data) containing more than 25,000 records. WWWISIS is fully compatible with CDS/ISIS 3.07 file structure. However, on a system running Unix or its variant, there is no guarantee of this compatibility. It is therefore safe to recreate the master and the inverted files, using utilities provided by BIREME, under Unix environment.

A Coalitional Game Framework for Cooperative Secondary Spectrum Access

We consider a framework in which several service providers offer downlink wireless data access service in a certain area. Each provider serves its end-users through opportunistic secondary spectrum access of licensed spectrum, and needs to pay primary license holders of the spectrum usage based and membership based charges for such secondary spectrum access. In these circumstances, if providers pool their resources and allow end-users to be served by any of the cooperating providers, the total user satisfaction as well as the aggregate revenue earned by providers may increase. We use coalitional game theory to investigate such cooperation among providers, and show that the optimal cooperation schemes can be obtained as solutions of convex optimizations. We next show that under usage based charging scheme, if all providers cooperate, there always exists an operating point that maximizes the aggregate revenue of providers, while presenting each provider a share of the revenue such that no subset of providers has an incentive to leave the coalition. Furthermore, such an operating point can be computed in polynomial time. Finally, we show that when the charging scheme involves membership based charges, the above result holds in important special cases.

A Coalition game model for spectrum pooling in wireless data access networks

We consider a setting in which several operators offer downlink wireless data access services in a certain geographical region. Each operator deploys several base stations or access points, and registers some subscribers. In such a situation, if operators pool their infrastructure, and permit the possibility of subscribers being served by any of the cooperating operators, then there can be overall better user satisfaction, and increased operator revenue. We use coalitional game theory to investigate such resource pooling and cooperation between operators.We use utility functions to model user satisfaction, and show that the resulting coalitional game has the property that if all operators cooperate (i.e., form a grand coalition) then there is an operating point that maximizes the sum utility over the operators while providing the operators revenues such that no subset of operators has an incentive to break away from the coalition. We investigate whether such operating points can result in utility unfairness between users of the various operators. We also study other revenue sharing concepts, namely, the nucleolus and the Shapely value. Such investigations throw light on criteria for operators to accept or reject subscribers, based on the service level agreements proposed by them. We also investigate the situation in which only certain subsets of operators may be willing to cooperate.

A resource based game theoretical model for military conflicts

A resource interaction based game theoretical model for military conflicts is presented in this paper. The model includes both the spatial decision capability of adversaries (decision regarding movement and subsequent distribution of resources) as well as their temporal decision capability (decision regarding level of allocation of resources for conflict with adversary’s resources). Attrition is decided at present by simple deterministic models. An additional feature of this model is the inclusion of the possibility of a given resource interacting with several resources of the adversary.The decisions of the adversaries is determined by solving for the equilibrium Nash strategies given that the objectives of the adversaries may not be in direct conflict. Examples are given to show the applicability of these models and solution concepts.