跳至主要内容

Why do we yawn?



The biomedical hypothesis proposed here is that the immediate trigger for a yawn is a restricted collapse of a few alveoli in the lungs. The extent of this alveolar collapse may be too small for it to be detected by current X-ray technology, but this technology is continually improving and may soon be good enough to test the hypothesis. In support of the hypothesis, it is shown that yawnyawning can be inhibited by deep breaths of air, nitrogen or carbogen, thus showing that yawning is not triggered by lack of oxygen or by excess carbon dioxide, leaving alveolar collapse as the most likely possibility. A more extensive form of alveolar collapse is termed atelectasis and this involves a serious state of hypoxia which, if deepened or prolonged, can be fatal. Therefore, if the hypothesis is correct, yawning may prevent the development of atelectasis and save lives. The paper which published in Health,  Vol.5 No.10, October 2013  by Scientific Research Publishing is not concerned with other indirect ways in which yawning may be induced, nor with the mechanism and neural circuitry of the yawn, nor with social aspects of yawning, only with the immediate trigger. It aim is to get better evidence for the hypothesis put forward here and also to study the behaviour of the pulmonary alveoli in normal respiration.

评论

此博客中的热门博文

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 ...

Incorporation of High-Altitude Balloon Experiment in High School Science Classrooms

High-altitude balloon is a balloon, filled usually with helium or hydrogen that ascends into an area called “near space” or stratosphere. The most common type of high-altitude balloons are weather balloons. Other purposes include use as a platform for experiments in the upper atmosphere. Modern balloons generally contain electronic equipment such as radio transmitters, cameras, or satellite navigation systems, such as GPS receivers. The mission of the High-Altitude Balloon Experiment (HABE) is to acquire supporting data, validate enabling technologies, and resolve critical acquisition, tracking, and pointing (ATP) and fire control issues in support of future space-based precision pointing experiments. The use of high-altitude balloons offers a relatively low-cost, low-vibration test platform, a recoverable and reusable payload, worldwide launch capability, and a 'near- space' emulation of the future space systems operational scenarios. More recently, several university...

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...