跳至主要内容

Classification of Synoptic Circulation Patterns for Fog in the Urumqi Airport

According to the Glossary of Meteorology from the American Meteorological Society, fog is a collection of water droplets suspended in the atmosphere in the vicinity of the earth's surface that affects visibility. Specifically, fog reduces visibility below 1 kilometer (or 0.62 miles). It is the biggest cause of aviation accidents, severe fog can lead to poor visibility, affecting the aircraft’s normal taking-off and landing, increasing the aircraft’s ice, bumps, etc., in the clouds. A long-time continuing fog causes airport closures, flights canceled, resulting in a large number of passengers stranded, affecting the flight safety and normal operating order.

In this study, the authors aimed to investigate the Classification of Synoptic Circulation Patterns for Fog in the Urumqi Airport in Xinjiang, China. By using relevant climate statistical method, the hourly ground observation data and four times per day and NCEP/NCAR reanalysis data (1° × 1°) from 1985 to 2014 were analyzed. The results showed that: 1) The occurrence of fog significantly increased during 1985 and 2014; There were two stages of the airport fog in the 30 years: less-fog period (1985-2002) and more-fog period (2002-2014), the fog focused occurred in November to March of the following year, most in December and least in March; 2) Based on Lamb-Jenkinson method, the dominant types of fog in Urumqi Airport were C, E, SE, W, A types (Among them, A, C, E, W, SE are the circulation types. C is Cyclone, A is Anti-cyclone, E is East, W is West, SE is Southeast), and the international distribution of each type was also different; 3) The dominant types of persistence fog were A, C, E, SE types, A type appeared in the afternoon to the nighttime, in the morning less frequent, on the other hand, C type was just the opposite; 4) Atmospheric circulation characteristics for persistence fog profile can be divided into four series: A, C, E, SE series, and climatic characteristics in different series were different.


Article by Nan Wang, et al, from Urumqi, China.

Full access: http://mrw.so/1fcTts
Image by Henrique Junior, from Flickr-cc.



评论

  1. Good guidance for the people who want establish their business in dubai...i really like your efforts
    PlusUAE is a business consultancy, helps in setting up new business ventures for local and international business investors in Abu Dhabi, United Arab Emirates.

    回复删除

发表评论

此博客中的热门博文

Electron Spin and Proton Spin in the Hydrogen and Hydrogen-Like Atomic Systems

Read full paper at: http://www.scirp.org/journal/PaperInformation.aspx?PaperID=52202#.VIj7tMnQrzE Author(s) Stanisław Olszewski * Affiliation(s) Institute of Physical Chemistry, Polish Academy of Sciences, Warsaw, Poland . ABSTRACT The mechanical angular momentum and magnetic moment of the electron and proton spin have been calculated semiclassically with the aid of the uncertainty principle for energy and time. The spin effects of both kinds of the elementary particles can be expressed in terms of similar formulae. The quantization of the spin motion has been done on the basis of the old quantum theory. It gives a quantum number n = 1/2 as the index of the spin state acceptable for both the electron and proton ...

Remarks on the Complexity of Signed k-Domination on Graphs

Read  full  paper  at: http://www.scirp.org/journal/PaperInformation.aspx?PaperID=53574#.VMnXsCzQrzE Author(s)    Chuan-Min Lee 1 , Cheng-Chien Lo 1 , Rui-Xin Ye 2 , Xun Xu 2 , Xiao-Han Shi 2 , Jia-Ying Li 2 Affiliation(s) 1 Department of Computer and Communication Engineering, Ming Chuan University, The First American University in Asia, Taoyuan, Taiwan, Chinese Taipei . 2 Department of Electronic Information Engineering, Fuzhou University, Fuzhou, China . ABSTRACT This paper is motivated by the concept of the signed k-domination problem and dedicated to the complexity of the problem on graphs. For any fixed nonnegative integer k, we show that the signed k-domination problem is NP-complete for doubly chordal graphs. For strongly chordal graphs and distance-hereditary graphs, we show that the signed k-domination problem can be solved in polynomial time. We also show that the problem is linear-time solvable for trees, interval graphs, and chord...

A Review of Technical Requirements for High Penetration of Wind Power Systems

Read full paper at: http://www.scirp.org/journal/PaperInformation.aspx?PaperID=52361#.VJN8VcCAM4 Author(s)    Yuan-Kang Wu 1 , Tung-Ching Lee 2 , Ting-Yen Hsieh 2 , Wei-Min Lin 2 Affiliation(s) 1 Department of Electrical Engineering, National Chung-Cheng University, Chiayi, Taiwan . 2 Green Energy and Environment Research Laboratories, Industrial Technology Research Institute, Hsinchu, Taiwan . ABSTRACT Renewable portfolio targets have been established in many regions around the world. Regional targets such as 20% renewable energy by year 2020 are not uncommon. As the levels of wind power penetration increase, there are many power system impacts. This work investigated possible challenges and technic...