• Title/Summary/Keyword: 샤니

Search Result 113, Processing Time 0.022 seconds

Prediction of Parabolic Antenna Satellite Drag Force in Low Earth Orbit using Direct Simulation Monte Carlo Method (직접모사법을 이용한 지구 저궤도 파라볼릭 안테나 탑재 위성의 항력 예측)

  • Shin, Somin;Na, Kyung-Su;Lee, Juyoung;Cho, Ki-Dae
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.42 no.7
    • /
    • pp.616-621
    • /
    • 2014
  • Consumption of the fuel on the satellite operating in low earth orbit, is increased due to the air resistance and the amount of increase makes the satellite lifetime decrease or the satellite mass risen. Therefore the prediction of drag force of the satellite is important. In the paper, drag force and drag coefficient analysis of the parabolic antenna satellite in low earth orbit using direct simulation monte carlo method (DSMC) is conducted according to the mission altitude and angle of attack. To verify the DSMC simulated rarefied air movement, Starshine satellite drag coefficient according to the altitude and gas-surface interaction are compared with the flight data. Finally, from the analysis results, it leads to appropriate satellite drag coefficient for orbit lifetime calculation.

A Study on Accuracy of Meteorological Information for Low Altitude Aerospace around the Airport on the West Coast (서해안 인접공항의 저고도 항공기상 정확도 연구)

  • Cho, Young-Jin;Yoo, Kwang Eui
    • Journal of the Korean Society for Aviation and Aeronautics
    • /
    • v.28 no.2
    • /
    • pp.53-62
    • /
    • 2020
  • This study is to evaluate the accuracy of the meteorological information provided for the aircraft operating at low altitude. At first, it is necessary to identify crucial elements of weather information closely related to flight safety during low altitude flights. The study conducted a survey of pilots of low altitude aircraft, divided into pre-flight and in-flight phases, and reached an opinion that wind direction, wind speed, cloud coverage and ceiling and visibility are important items. Related to these items, we compared and calculated the accuracy of TAFs and METARs from Taean Airfield, Seosan Airport and Gunsan Airport because of their high number of domestic low-altitude flights. Accuracy analysis evaluated the accuracy of two numerical variables, Mean Absolute Error(MAE) and Root Mean Square Error(RMSE), and the cloud coverage which is categorical variable was calculated and compared by accuracy. For numeric variables, one-way ANOVA, which is a parameter-test, was approached to identify differences between actual forecast values and observations based on absolute errors for each item derived from the results of MAE and RMSE accuracy analyses. To determine the satisfaction of both normality assumptions and equivalence variability assumptions, the Shapiro-Wilk test was performed to verify that they do not have a normality distribution for numerical variables, and for the non-parametric test, Kruscal-Wallis test was conducted to determine whether or not they are satisfied.

A Parallel I/O System on Workstation Clustering Environment for Irregular Applications (비정형 응용을 위한 워크스테이션 클러스터링 환경에서의 병렬 입출력 시스템)

  • No, Jae-Chun;Park, Sung-Soon;Choudhary, Alok
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.27 no.5
    • /
    • pp.496-505
    • /
    • 2000
  • Clusters of workstations (COW) are becoming an attractive option for parallel scientific computing, a field formerly reserved to the MPPs, because their cost-performance ratio is usuallybetter than that of comparable MPPS, and their hardware and software can be easily enhanced to thelatest generations. In this paper we present the design and implementation of our runtime library forclusters of workstations, called "Collective I/O Clustering". The library provides a friendlyprogramming model for the I/O of irregular applications on clusters of workstations, being completelyintegrated with the underlying communication and I/O system. In the collective I/O clustering, two I/Oconfigurations are possible. In the first I/O configuration, all processors allocated can act as I/Oservers as well as compute nodes. In the second I/O configuration, only a subset of processors canact as I/O servers, The compression and software caching facilities have been incorporated into thecollective 1/0 clustering to optimize the communication and I/O costs. All the performance results wereobtained on the IBM-SP machine, located at Argonne National Labs.

  • PDF

A Training Algorithm for the Transform Trellis Code with Applications to Stationary Gaussian Sources and Speech (정상 가우시안 소오스와 음성 신호용 변환 격자 코드에 대한 훈련 알고리즘 개발)

  • Kim, Dong-Youn;Park, Yong-Seo;Whang, Keum-Chan;Pearlman, William A.
    • The Journal of the Acoustical Society of Korea
    • /
    • v.11 no.1
    • /
    • pp.22-34
    • /
    • 1992
  • There exists a transform trellis code that is optimal for stationary Gaussian sources and the squared-error distortion measure at all rates. In this paper, we train an asymptotically optimal version of such a code to obtain one which is matched better to the statistics of real world data. The training algorithm uses the M algorithm to search the trellis codebook and the LBG algorithm to update the trellis codebook. We investigate the trained transform trellis coding scheme for the first-order AR(autoregressive) Gaussian source whose correlation coefficient is 0.9 and actual speech sentences. For the first-order AR source, the achieved SNR for the test sequence is from 0.6 to 1.4 dB less than the maximum achievable SNR as given by Shannon's rate-distortion function for this source, depending on the rate and surpasses all previous known results for this source. For actual speech data, to achieve improved performance, we use window functions and gain adaptation at rate 1.0 bits/sample.

  • PDF

Energy Efficiency in Wireless Sensor Networks using Linear-Congruence on LDPC codes (LDPC 코드의 Linear-Congruence를 이용한 WSN 에너지 효율)

  • Rhee, Kang-Hyeon
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.44 no.3
    • /
    • pp.68-73
    • /
    • 2007
  • Recently, WSN(wireless sensor networks) consists of several sensor nodes in sensor field. And each sensors have the enforced energy constraint. Therefore, it is important to manage energy efficiently. In WSN application system, FEC(Forward error correction) increases the energy efficiency and data reliability of the data transmission. LDPC(Low density parity check) code is one of the FEC code. It needs more encoding operation than other FEC code by growing codeword length. But this code can approach the Shannon capacity limit and it is also can be used to increase the data reliability and decrease the transmission energy. In this paper, the author adopt Linear-Congruence method at generating parity check matrix of LDPC(Low density parity check) codes to reduce the complexity of encoding process and to enhance the energy efficiency in the WSN. As a result, the proposed algorithm can increase the encoding energy efficiency and the data reliability.

Low Computational Complexity LDPC Decoding Algorithms for DVB-S2 Systems (DVB-S2 시스템을 위한 저복잡도 LDPC 복호 알고리즘)

  • Jung Ji-Won
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.16 no.10 s.101
    • /
    • pp.965-972
    • /
    • 2005
  • In this paper, we first review LDPC codes in general and a belief propagation algorithm that works in logarithm domain. LDPC codes, which is chosen for second generation digital video broadcasting standard, are required a large number of computation due to large size of coded block and iteration. Therefore, we presented two kinds of low computational algorithm for LDPC codes. First, sequential decoding with partial group is proposed. It has same H/W complexity, and fewer number of iteration's are required at same performance in comparison with conventional decoder algerian. Secondly, early detection method for reducing the computational complexity is proposed. Using a confidence criterion, some bit nodes and check node edges are detected early on during decoding. Through the simulation, we knew that the iteration number are reduced by half using subset algorithm and computational complexity of early detected method is about $50\%$ offs in case of check node update, $99\%$ offs in case of check node update compared to conventional scheme.

Experimental Investigation of Creep Groan Noise (크립 그론 소음 특성에 대한 실험적 연구)

  • Kang, Kyung Min;Jeon, Hyun Cheol;Kang, Yeon June;Cho, Min Hyung
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.37 no.5
    • /
    • pp.673-678
    • /
    • 2013
  • Creep groan noise occurs at low frequencies immediately after releasing brake pressure or when a car stops. This noise can be used to predict problems in not only the brake system but also the vehicle system. Because of its complexity, it is difficult to determine its characteristics. Therefore, most improvements are conducted by changing the brake pad, and it still remains difficult to conduct a test using a vehicle. In this study, the characteristics of creep groan noise and the effects from a vehicle system are investigated by using vehicles and an NVH chassis-dynamometer through various tests. A new evaluation method for creep groan noise by using a vehicle is proposed, and the possibility of reduction schemes from the viewpoint of the vehicle system is confirmed from the results mentioned above.

A Meeting of Euler and Shannon (오일러(Euler)와 샤논(Shannon)의 만남)

  • Lee, Moon-Ho
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.17 no.1
    • /
    • pp.59-68
    • /
    • 2017
  • The flower and woman are beautiful but Euler's theorem and the symmetry are the best. Shannon applied his theorem to information and communication based on Euler's theorem. His theorem is the root of wireless communication and information theory and the principle of today smart phone. Their meeting point is $e^{-SNR}$ of MIMO(multiple input and multiple output) multiple antenna diversity. In this paper, Euler, who discovered the most beautiful formula($e^{{\pi}i}+1=0$) in the world, briefly guided Shannon's formula ($C=Blog_2(1+{\frac{S}{N}})$) to discover the origin of wireless communication and information communication, and these two masters prove a meeting at the Shannon limit, It reveals something what this secret. And we find that it is symmetry and element-wise inverse are the hidden secret in algebraic coding theory and triangular function.

Visualization analysis using R Shiny (R의 Shiny를 이용한 시각화 분석 활용 사례)

  • Na, Jonghwa;Hwang, Eunji
    • Journal of the Korean Data and Information Science Society
    • /
    • v.28 no.6
    • /
    • pp.1279-1290
    • /
    • 2017
  • R's {shiny} package provides an environment for creating web applications with only R scripts. Shiny does not require knowledge of a separate web programming language and its development is very easy and straightforward. In addition, Shiny has a variety of extensibility, and its functions are expanding day by day. Therefore, the presentation of high-quality results is an excellent tool for R-based analysts. In this paper, we present actual cases of large data analysis using Shiny. First, geological anomaly zone is extracted by analyzing topographical data expressed in the form of contour lines by analysis related to spatial data. Next, we will construct a model to predict major diseases by 16 cities and provinces nationwide using weather, environment, and social media information. In this process, we want to show that Shiny is very effective for data visualization and analysis.

Low Computational Complexity LDPC Decoding Algorithms for 802.11n Standard (802.11n 규격에서의 저복잡도 LDPC 복호 알고리즘)

  • Kim, Min-Hyuk;Park, Tae-Doo;Jung, Ji-Won;Lee, Seong-Ro;Jung, Min-A
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.2C
    • /
    • pp.148-154
    • /
    • 2010
  • In this paper, we first review LDPC codes in general and a belief propagation algorithm that works in logarithm domain. LDPC codes, which is chosen 802.11n for wireless local access network(WLAN) standard are required a large number of computation due to large size of coded block and iteration. Therefore, we presented three kinds of low computational algorithm for LDPC codes. First, sequential decoding with partial group is proposed. It has same H/W complexity, and fewer number of iteration's are required at same performance in comparison with conventional decoder algorithm. Secondly, we have apply early stop algorithm. This method is reduced number of unnecessary iteration. Third, early detection method for reducing the computational complexity is proposed. Using a confidence criterion, some bit nodes and check node edges are detected early on during decoding. Through the simulation, we knew that the iteration number are reduced by half using subset algorithm and early stop algorithm is reduced more than one iteration and computational complexity of early detected method is about 30% offs in case of check node update, 94% offs in case of check node update compared to conventional scheme.