• Title/Summary/Keyword: Particular

Search Result 26,534, Processing Time 0.045 seconds

Adverse Effect of Exposure to Ambient Particular Matter on Neuropsychiatric Disorder (미세먼지노출이 신경정신장애에 미치는 영향)

  • Lim, Myung Ho;Kim, Jong-Hun;Kwon, Ho Jang;Cheong, Hae-Kwan
    • Anxiety and mood
    • /
    • v.16 no.2
    • /
    • pp.57-75
    • /
    • 2020
  • Particular matter is steadily increasing due to environmental factors at domestic and abroad such as industry and economy. Recently, the exposure particular matters has been reported to increase the risk not only for morbidity and mortality, but also for diseases of the respiratory system, cardiovascular system and central nervous system/neuropsychiatric disorder. Although the causes of neuropsychiatric diseases are genetic and environmental factors, it is necessary to pay more attention to environmental factors in terms of prevention. We mainly describe environmental factors that affect neuropsychiatric disorders, mainly on particular matter, which is one of harmful environmental substances. In the current study, we reviewed evidence for the presence of particular matter or particular matter related harmful air pollutants-O3, SO2, NO2/NOx, traffic related air pollution, that may represent risk factors for the development of neuropsychiatric disorder.

인터넷 신문 이용자의 상호작용성: 사설과 Online Poll의 관계를 중심으로

  • 장건춘;형시영
    • Proceedings of the Korean Association for Survey Research Conference
    • /
    • 2003.06a
    • /
    • pp.105-124
    • /
    • 2003
  • What could be the relation between newspapers' tendency and readers' attitude on a particular affair\ulcorner That is, does newspapers' tendency on a particular affair influence readers' attitude on that matter or vice versa\ulcorner Or do they both influence each other\ulcorner These questions deserve to be answered. Owing to Internet Poll introduced in Korean newspapers from the mid-1990s and popular with newspaper readers (particularly with so called netizens), it becomes possible to grip the readers' attitude on a particular affair. And it is well known that newspapers' tendency on a particular affair is well reflected in the editorials. By analyzing and comparing the relation between newspapers' tendency and readers' attitude through internet poll on a particular affair, we understand whether there is a correlation between them or not.

  • PDF

Analysis on the Effects of Particular Matter Distribution on the Number of Outpatient Visits for Allergic Rhinitis (지역별 미세먼지 농도의 알레르기비염 외래이용에 대한 영향 분석)

  • Park, Ju Hyun;Park, Young Yong;Lee, Eunjoo;Lee, Kwang-Soo
    • Health Policy and Management
    • /
    • v.30 no.1
    • /
    • pp.50-61
    • /
    • 2020
  • Background: This study aims to analyze the effects of air pollutants, such as particular matter, to the number of outpatient visits for allergic rhinitis in eup, myeon, and dong administrative boundaries. Methods: Dependent variable was the number of outpatient visits for allergic rhinitis per 10,000 people by region. Independent variables were air pollutants such as PM10, PM2.5, SO2, O3, CO2, NO2, and temperature that estimated by using Kriging analysis in all eup, myeon, and dong boundaries. Panel analysis was applied for the analysis to prove the relation between outpatient visits and the concentration of air pollutants. Results: Analysis results showed that particular matter concentration varied by regions and season. Panel analysis showed that outpatient visits for allergic rhinitis had positive relationships with PM10, PM2.5, SO2, O3, and CO2 in all panel models. Conclusion: Regional variation of particular matter concentration should be considered in establishing regional policies for allergic rhinitis.

Estimation of Hip's Particular Using the RADAR (레이더를 이용한 선박제원의 추정)

  • 문성배;정은석;전승환
    • Journal of the Korean Society of Marine Environment & Safety
    • /
    • v.3 no.1
    • /
    • pp.93-98
    • /
    • 1997
  • When navigating at sea, informations like other ship's particular are very important to navigator who should make a safe maneuvering. Most of all is obtained through the optical observation and/or the radiotelephone communication, but it is not easy to perceive them when the visibility is restricted or there is some hardness in communication. In this study, we suggest the algorithm that measures the ship's length and speed on the radar screen and estimates the ship's particular such as gross tonnage, breath and type on the base of above two factors.

  • PDF

Improved stress recovery for elements at boundaries

  • Stephen, D.B.;Steven, G.P.
    • Structural Engineering and Mechanics
    • /
    • v.5 no.2
    • /
    • pp.127-135
    • /
    • 1997
  • Patch recovery attempts to derive a more accurate stress filed over a particular element than the finite element shape function used for that particular element. Elements that have a free edge being the boundary to the structure have particular stress relationship that can be incorporated to the stress field to improve the accuracy of the approximation.

Transient Elastodynamic Analysis By BEM Using DDM (DDM과 경계요쇼법을 이용한 동탄성 해석)

  • Shin, Dong-Hoon;Owatsiriwong, Adisorn;Park, Han-Gyu;Park, Kyung-Ho
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2009.04a
    • /
    • pp.534-535
    • /
    • 2009
  • This paper deals with BEM analysis of transient elastodynamic problems using domain decomposition method and particular integrals. The particular method is used to approximate the acceleration term in the governing equation. The domain decomposition method is examined to consider multi-region problems. The domain of the original problem is subdivided into sub-regions, which are modeled by the particular integral BEM. The iterative coupling employing Schwarz algorithm is used for the successive update of the interface boundary conditions until convergence is achieved. The numerical results, compared with those by ABAQUS, demonstrate the validity of the present formulation.

  • PDF

A Study on the Cognitive Learning of Meaning through Frame Semantics (틀 의미론을 통한 인지적 의미학습에 관한 연구)

  • Oh, Ju-Young
    • Cross-Cultural Studies
    • /
    • v.19
    • /
    • pp.295-311
    • /
    • 2010
  • The concept of frame in semantics has implications for our understanding of such problematic terms as "meaning" and "concept". It is conventional to say that a particular word corresponds to a particular "concept" and to assume that concepts are essentially identical across speakers. In contrast, the notion of frame accepts that the frame for a particular word can vary across speakers as a function of their particular life experience. To say, instead of thinking in terms of words as expressing "concepts", we should think of them as tools, like frames, that cause listeners to activate certain areas of their knowledge base, with different areas activated to different degrees in different contexts of use. This notion is Fillmore's most crucial contribution to current cognitive linguistic theories, and his frame semantics is built on such a notion. This paper discusses the basic assumptions and goals of frame semantics, and examines the notion of frame and illustrates various framing words of English and Korean under such a notion.

SOME GEOMETRIC RESULTS ON A PARTICULAR SOLUTION OF EINSTEIN'S EQUATION

  • Lee, Jong Woo
    • Korean Journal of Mathematics
    • /
    • v.18 no.1
    • /
    • pp.21-28
    • /
    • 2010
  • In the unified field theory(UFT), many works on the solutions of Einstein's equation have been published. The main goal in the present paper is to obtain some geometric results on a particular solution of Einstein's equation under some condition in even-dimensional UFT $X_n$.

Upper Bounds for the Performance of Turbo-Like Codes and Low Density Parity Check Codes

  • Chung, Kyu-Hyuk;Heo, Jun
    • Journal of Communications and Networks
    • /
    • v.10 no.1
    • /
    • pp.5-9
    • /
    • 2008
  • Researchers have investigated many upper bound techniques applicable to error probabilities on the maximum likelihood (ML) decoding performance of turbo-like codes and low density parity check (LDPC) codes in recent years for a long codeword block size. This is because it is trivial for a short codeword block size. Previous research efforts, such as the simple bound technique [20] recently proposed, developed upper bounds for LDPC codes and turbo-like codes using ensemble codes or the uniformly interleaved assumption. This assumption bounds the performance averaged over all ensemble codes or all interleavers. Another previous research effort [21] obtained the upper bound of turbo-like code with a particular interleaver using a truncated union bound which requires information of the minimum Hamming distance and the number of codewords with the minimum Hamming distance. However, it gives the reliable bound only in the region of the error floor where the minimum Hamming distance is dominant, i.e., in the region of high signal-to-noise ratios. Therefore, currently an upper bound on ML decoding performance for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix cannot be calculated because of heavy complexity so that only average bounds for ensemble codes can be obtained using a uniform interleaver assumption. In this paper, we propose a new bound technique on ML decoding performance for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix using ML estimated weight distributions and we also show that the practical iterative decoding performance is approximately suboptimal in ML sense because the simulation performance of iterative decoding is worse than the proposed upper bound and no wonder, even worse than ML decoding performance. In order to show this point, we compare the simulation results with the proposed upper bound and previous bounds. The proposed bound technique is based on the simple bound with an approximate weight distribution including several exact smallest distance terms, not with the ensemble distribution or the uniform interleaver assumption. This technique also shows a tighter upper bound than any other previous bound techniques for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix.