Carleton University

About: Carleton University is a education organization based out in Ottawa, Ontario, Canada. It is known for research contribution in the topics: Population & Large Hadron Collider. The organization has 15852 authors who have published 39650 publications receiving 1106610 citations.

A Nitrogen-Fixing Endophyte of Sugarcane Stems (A New Role for the Apoplast).

Abstract: The intercellular spaces of sugarcane (Saccharum officinarum L.) stem parenchyma are filled with solution (determined by cryoscanning microscopy), which can be removed aseptically by centrifugation. It contained 12% sucrose (Suc; pH 5.5.) and yielded pure cultures of an acid-producing bacterium (approximately 104 bacteria/mL extracted fluid) on N-poor medium containing 10% Suc (pH 5.5). This bacterium was identical with the type culture of Acetobacter diazotrophicus, a recently discovered N2-fixing bacterium specific to sugarcane, with respect to nine biochemical and morphological characteristics, including acetylene reduction in air. Similar bacteria were observed in situ in the intercellular spaces. This demonstrates the presence of an N2-fixing endophyte living in apoplastic fluid of plant tissue and also that the fluid approximates the composition of the endophytes9s optimal culture medium. The apoplastic fluid occupied 3% of the stem volume; this approximates 3 tons of fluid/ha of the crop. This endogenous culture broth consisting of substrate and N2-fixing bacteria may be enough volume to account for earlier reports that some cultivars of sugarcane are independent of N fertilizers. It is suggested that genetic manipulation of apoplastic fluid composition may facilitate the establishment of similar symbioses with endophytic bacteria in other crop plants.

An overview of pricing concepts for broadband IP networks

Abstract: In this article we provide an overview of pricing concepts for broadband multiservice networks. We review the notions of flat pricing, priority pricing, Paris-Metro pricing, smart-market pricing, responsive pricing, expected capacity pricing, edge pricing, and effective bandwidth pricing. We use numerous evaluation criteria, including network, economic, and social efficiency, as well as their suitability in using pricing as a means for congestion control. Some of the schemes are based on best-effort networks, and are thus unable to provide the user with quality of service (QoS) guarantees. Others build on networks with connection admission control functions and are thus able to provide individual QoS guarantees. We particularly investigate the relevant time frame over which pricing schemes are assumed to operate. The majority of the schemes work on short time frames (on the order of minutes), which makes them applicable to use pricing as an additional means for controlling congestion. We also consider technical aspects such as compliance with existing networking technologies or computational overheads associated with billing and accounting.

A Survey of Rate-Optimal Power Domain NOMA With Enabling Technologies of Future Wireless Networks

Abstract: The ambitious high data-rate applications in the envisioned future beyond fifth-generation (B5G) wireless networks require new solutions, including the advent of more advanced architectures than the ones already used in 5G networks, and the coalition of different communications schemes and technologies to enable these applications requirements. Among the candidate communications schemes for future wireless networks are non-orthogonal multiple access (NOMA) schemes that allow serving more than one user in the same resource block by multiplexing users in other domains than frequency or time. In this way, NOMA schemes tend to offer several advantages over orthogonal multiple access (OMA) schemes such as improved user fairness and spectral efficiency, higher cell-edge throughput, massive connectivity support, and low transmission latency. With these merits, NOMA-enabled transmission schemes are being increasingly looked at as promising multiple access schemes for future wireless networks. When the power domain is used to multiplex the users, it is referred to as the power domain NOMA (PD-NOMA). In this paper, we survey the integration of PD-NOMA with the enabling communications schemes and technologies that are expected to meet the various requirements of B5G networks. In particular, this paper surveys the different rate optimization scenarios studied in the literature when PD-NOMA is combined with one or more of the candidate schemes and technologies for B5G networks including multiple-input-single-output (MISO), multiple-input-multiple-output (MIMO), massive-MIMO (mMIMO), advanced antenna architectures, higher frequency millimeter-wave (mmWave) and terahertz (THz) communications, advanced coordinated multi-point (CoMP) transmission and reception schemes, cooperative communications, cognitive radio (CR), visible light communications (VLC), unmanned aerial vehicle (UAV) assisted communications and others. The considered system models, the optimization methods utilized to maximize the achievable rates, and the main lessons learnt on the optimization and the performance of these NOMA-enabled schemes and technologies are discussed in detail along with the future research directions for these combined schemes. Moreover, the role of machine learning in optimizing these NOMA-enabled technologies is addressed.

Time-Varying Graphs and Dynamic Networks

Abstract: The past few years have seen intensive research efforts carried out in some apparently unrelated areas of dynamic systems -- delay-tolerant networks, opportunistic-mobility networks, social networks -- obtaining closely related insights. Indeed, the concepts discovered in these investigations can be viewed as parts of the same conceptual universe; and the formal models proposed so far to express some specific concepts are components of a larger formal description of this universe. The main contribution of this paper is to integrate the vast collection of concepts, formalisms, and results found in the literature into a unified framework, which we call TVG (for time-varying graphs). Using this framework, it is possible to express directly in the same formalism not only the concepts common to all those different areas, but also those specific to each. Based on this definitional work, employing both existing results and original observations, we present a hierarchical classification of TVGs; each class corresponds to a significant property examined in the distributed computing literature. We then examine how TVGs can be used to study the evolution of network properties, and propose different techniques, depending on whether the indicators for these properties are a-temporal (as in the majority of existing studies) or temporal. Finally, we briefly discuss the introduction of randomness in TVGs.