This paper attempts to provide some new understanding of the mechanical as well as thermal effects of the Tibetan Plateau (TP) on the circulation and climate in Asia through diagnosis and numerical experiments. The air column over the TP descends in winter and ascends in summer and regulates the surface Asian monsoon flow. Sensible heating on the sloping lateral surfaces appears from the authors’ experiments to be the major driving source. The retarding and deflecting effects of the TP in winter generate an asymmetric dipole zonal-deviation circulation, with a large anticyclone gyre to the north and a cyclonic gyre to the south. Such a dipole deviation circulation enhances the cold outbreaks from the north over East Asia, results in a dry climate in south Asia and a moist climate over the Indochina peninsula and south China, and forms the persistent rainfall in early spring (PRES) in south China. In summer the TP heating generates a cyclonic spiral zonal-deviation circulation in the lower troposphere, which converges toward and rises over the TP. It is shown that because the TP is located east of the Eurasian continent, in summertime the meridional winds and vertical motions forced by the Eurasian continental-scale heating and the TP local heating are in phase over the eastern and central parts of the continent. The monsoon in East Asia and the dry climate in middle Asia are therefore intensified.

No abstract

Dual basis sets are employed as an economical way to approximate self-consistent field (SCF) calculations, such as Kohn-Sham density functional theory (DFT), in large basis sets. First, an SCF calculation is performed in a small subset of the full set of basis functions. The density matrix in this small basis is used to construct the effective Hamiltonian operator in the large basis, from which a correction for basis set extension is obtained for the energy. This correction is equivalent to a single Roothaan step (diagonalization) in the large basis. We present second order nonlinear equations that permit this step to be obtained without explicit diagonalization. Numerical tests on part of the Gaussian-2 dataset, using the B3LYP density functional, show that large-basis results can be accurately approximated with this procedure, subject to some limitations on the smallness of the small basis. Computational savings are approximately an order of magnitude relative to a self-consistent DFT calculation in the large basis. † Part of the special issue "Fritz Schaefer Festschrift".

Abstract-Capacity of vehicular networks with infrastructure support is both an interesting and challenging problem as the capacity is determined by the inter-play of multiple factors including vehicle-to-infrastructure (V2I) communications, vehicle-to-vehicle (V2V) communications, density and mobility of vehicles, and cooperation among vehicles and infrastructure. In this paper, we consider a typical delay-tolerant application scenario with a subset of vehicles, termed Vehicles of Interest (VoIs), having download requests. Each VoI downloads a distinct large-size file from the Internet and other vehicles without download requests assist the delivery of the files to the VoIs. A cooperative communication strategy is proposed that explores the combined use of V2I communications, V2V communications, mobility of vehicles and cooperation among vehicles and infrastructure to improve the capacity of vehicular networks. An analytical framework is developed to model the data dissemination process using this strategy, and a closed form expression of the achievable capacity is obtained, which reveals the relationship between the capacity and its major performanceimpacting parameters such as inter-infrastructure distance, radio ranges of infrastructure and vehicles, sensing range of vehicles, transmission rates of V2I and V2V communications, vehicular density and proportion of VoIs. Numerical result shows that the proposed cooperative communication strategy significantly boosts the capacity of vehicular networks, especially when the proportion of VoIs is low. Our results provide guidance on the optimum deployment of vehicular network infrastructure and the design of cooperative communication strategy to maximize the capacity.

Efficiently computing k-edge connected components in a large graph, G = (V, E), where V is the vertex set and E is the edge set, is a long standing research problem. It is not only fundamental in graph analysis but also crucial in graph search optimization algorithms. Consider existing techniques for computing k-edge connected components are quite time consuming and are unlikely to be scalable for large scale graphs, in this paper we firstly propose a novel graph decomposition paradigm to iteratively decompose a graph G for computing its k-edge connected components such that the number of drilling-down iterations h is bounded by the "depth" of the k-edge connected components nested together to form G, where h usually is a small integer in practice. Secondly, we devise a novel, efficient threshold-based graph decomposition algorithm, with time complexity O(l × |E|), to decompose a graph G at each iteration, where l usually is a small integer with l ≪ |V|. As a result, our algorithm for computing k-edge connected components significantly improves the time complexity of an existing state-of-the-art technique from O(|V| 2 |E| + |V| 3 log |V|) to O(h × l × |E|). Finally, we conduct extensive performance studies on large real and synthetic graphs. The performance studies demonstrate that our techniques significantly outperform the state-of-the-art solution by several orders of magnitude.