• Title/Summary/Keyword: 수학적 성능

Search Result 802, Processing Time 0.031 seconds

Analysis of User Mobility and Traffic Characteristics in In-Building PCS (In-Building PCS의 가입자 이동성 및 트래픽 특성 분석)

  • 이형길;김의묵;구제길;최형진
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.36S no.4
    • /
    • pp.12-22
    • /
    • 1999
  • 본 논문에서는 PCS의 확장개념으로 최근 관심이 높아지고 있는 In-Building PCS에서 가입자 이동성향과 이동 트래픽 특성을 이용해서 시스템의 트래픽 성능을 분석하였다. 이를 위해 빌딩내 적절한 셀 모양을 설정하고 가입자 이동성을 수학적으로 모델링하였으며 모델링된 셀에서의 가입자 이동률을 다양한 이동 파라메터로서 정의하고 이로부터 2차원 Morkov 생성-소멸 상태도를 유도하였다. 마지막으로 모델링된 가입자 이동성과 트랙픽 상태도를 통해 셀 내에서의 트래픽 성능을 분석하고 평가하였다.

  • PDF

Tone Jamming Effect on the Epoch Synchronization (Epoch 동기에 대한 Tone Jamming의 영향 분석)

  • 문장욱;은유창;송홍엽;이광억;최영균
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.26 no.9A
    • /
    • pp.1609-1613
    • /
    • 2001
  • 본 논문에서는 실시간 자기 상관 관계를 이용하여 주파수 도약 시점을 찾아내는 epoch 추정기를 소개하고 이것의 성능을 tone jamming 환경 하에서 분석해 보았다. 주파수 도약 방법을 이용하는 시스템은 주로 군 관련 시스템이므로 jamming 환경 하에서의 성능이 매우 중요하다. Jamming이 있을 경우 epoch 추정기는 실제 값보다 작은 값을 나타내는 것을 알 수 있었다. 분석 과정을 수학적으로 유도하였고, 컴퓨터 실험으로 결과를 확인하였다.

  • PDF

Sampling Set Selection Algorithm for Weighted Graph Signals (가중치를 갖는 그래프신호를 위한 샘플링 집합 선택 알고리즘)

  • Kim, Yoon Hak
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.17 no.1
    • /
    • pp.153-160
    • /
    • 2022
  • A greedy algorithm is proposed to select a subset of nodes of a graph for bandlimited graph signals in which each signal value is generated with its weight. Since graph signals are weighted, we seek to minimize the weighted reconstruction error which is formulated by using the QR factorization and derive an analytic result to find iteratively the node minimizing the weighted reconstruction error, leading to a simplified iterative selection process. Experiments show that the proposed method achieves a significant performance gain for graph signals with weights on various graphs as compared with the previous novel selection techniques.

Modeling and Dynamic Analysis for Electric Vehicle Powertrain Systems (전기 자동차 파워트레인의 모델링 및 동특성 분석)

  • Park, Gwang-Min;Lee, Seong-Hun;Jin, Sung-Ho;Kwak, Sang-Shin
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.48 no.6
    • /
    • pp.71-81
    • /
    • 2011
  • Unlike a typical internal combustion engine vehicle, the powertrain system of the pure electric vehicle, consisting of battery, inverter and motor, has direct effects on the vehicle performance and dynamics. Then, the specific modeling of such complex electro-mechanical components enables the insight into the longitudinal dynamic outputs of the vehicle and analysis of entire powertrain systems. This paper presents the dynamic model of electric vehicle powertrain systems based on theoretical approaches to predict and analyze the final output performance of electric vehicles. Additionally, the correlations between electric input signals and the final output of the mechanical system are mathematically derived. The proposed model for powertrain dynamics of electric vehicle systems are validated with a reference electric vehicle model using generic simulation platform based on Matlab/Simulink software. Consequently, the dynamic analysis results are compared with electric vehicle simulation model in some parameters such as vehicle speed/acceleration, and propulsion forces.

Analysis of Backoff Algorithm for Performance Improvement in WLAN (무선랜에서 성능 향상을 위한 Backoff 알고리즘 분석)

  • Lim, seog-ku
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2008.05a
    • /
    • pp.564-568
    • /
    • 2008
  • In this paper, MAC(Medium Access Control) algorithm for the IEEE 802.11 DCF(Distributed Coordination Function) improving the performance is proposed and analyzed mathematically. The MAC of IEEE 802.11 WLAN to control data transmission uses two control methods called DCF and PCF(Point Coordination Function). The DCF controls the transmission based on CSMA/CA(Carrier Sense Multiple Access with Collision Avoidance). The DCF shows excellent performance relatively in situation that competition station is less but has a problem that performance is fallen from throughput and delay viewpoint in situation that competition station is increased. This paper proposes an enhanced DCF algorithm that increases the CW to maximal CW after collision and decreases the CW smoothly after successful transmission in order to reduce the collision probability by utilizing the current status information of WLAN. To prove efficiency of proposed algorithm, a lots of simulations are conducted and analyzed.

  • PDF

Anti-collision algorithm using Bin slot information for UHF (Bin 슬롯 정보를 이용한 UHF 대역 Anti-collision 알고리즘)

  • Choi Ho-Seung;Kim Jae-Hyun
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.1 s.343
    • /
    • pp.41-48
    • /
    • 2006
  • An anti-collision algorithm is very important in the RFID system because it decides tag identification time and tag identification accuracy. We propose improved anti-collision algorithms using Bin slot in RFID system. In the proposed algorithms, if the reader memorizes the Bin slot information, it can reduce the repetition of unnecessary PingID command and the time to identify tags. If we also use ScrollA11ID command in the proposed algorithm, the reader knows the sequence of collided E bits. Using this sequence, the reader can reduce the repetition of PingID command and tag identification time. We analyze the performance of the proposed anti-collision algorithms and compare the performance of the proposed algorithms with that of the conventional algorithm. We also validate analytic results using simulation. According to the analysis, for the random tag n, comparing the proposed algorithms with the conventional algorithm, the performance of the proposed algorithms is about $130\%$ higher when the number of the tags is 200. And for the sequential tag ID, the performance of the conventional algorithm decreases. On the contrary, the performance of the proposed algerian using ScrollA11ID command is about $16\%$ higher than the case of using random tag ID.

Analyzing Mathematical Performances of ChatGPT: Focusing on the Solution of National Assessment of Educational Achievement and the College Scholastic Ability Test (ChatGPT의 수학적 성능 분석: 국가수준 학업성취도 평가 및 대학수학능력시험 수학 문제 풀이를 중심으로)

  • Kwon, Oh Nam;Oh, Se Jun;Yoon, Jungeun;Lee, Kyungwon;Shin, Byoung Chul;Jung, Won
    • Communications of Mathematical Education
    • /
    • v.37 no.2
    • /
    • pp.233-256
    • /
    • 2023
  • This study conducted foundational research to derive ways to use ChatGPT in mathematics education by analyzing ChatGPT's responses to questions from the National Assessment of Educational Achievement (NAEA) and the College Scholastic Ability Test (CSAT). ChatGPT, a generative artificial intelligence model, has gained attention in various fields, and there is a growing demand for its use in education as the number of users rapidly increases. To the best of our knowledge, there are very few reported cases of educational studies utilizing ChatGPT. In this study, we analyzed ChatGPT 3.5 responses to questions from the three-year National Assessment of Educational Achievement and the College Scholastic Ability Test, categorizing them based on the percentage of correct answers, the accuracy of the solution process, and types of errors. The correct answer rates for ChatGPT in the National Assessment of Educational Achievement and the College Scholastic Ability Test questions were 37.1% and 15.97%, respectively. The accuracy of ChatGPT's solution process was calculated as 3.44 for the National Assessment of Educational Achievement and 2.49 for the College Scholastic Ability Test. Errors in solving math problems with ChatGPT were classified into procedural and functional errors. Procedural errors referred to mistakes in connecting expressions to the next step or in calculations, while functional errors were related to how ChatGPT recognized, judged, and outputted text. This analysis suggests that relying solely on the percentage of correct answers should not be the criterion for assessing ChatGPT's mathematical performance, but rather a combination of the accuracy of the solution process and types of errors should be considered.

Performance Analysis for TR-UWB System Exploiting Complex Frequency-Components (복소 주파수 성분 처리를 통한 TR-UWB 시스템의 성능분석)

  • Jang, Dong-Heon;Yang, Hoon-Gee
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.2
    • /
    • pp.253-260
    • /
    • 2009
  • This paper, mathematically analyzes the performance of newly proposed TR-UWB system which the frequency components of a UWB pulse were processed so that the system could be implemented with ADCs of a few MHz sampling rate, and presents the comparison with an existing frequency-domain based TR-UWB system. The comparison is mainly based on the SNR ratio which depends on the mean and the variance of the frequency components. We also shows that the simulation results to support the theoretical analysis where the comparison is made under the IEEE 802.15.3a channel model as well as AWGN channel.

MOO: A Study on Data Augmentation Method for Korean Math Word Problem Solving (MOO(Mathematical Operation Organizer): 한국어 서술형 수학 문제 자동 풀이를 위한 데이터 증강 기법 연구)

  • An, Jisu;Ki, Kyung Seo;Kim, Jiwon;Gweon, Gahgene
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2022.05a
    • /
    • pp.568-571
    • /
    • 2022
  • 본 논문에서는 서술형 수학 문제의 자동 풀이 기술 개발을 위한 데이터 증강 기법인 MOO 를 제안한다. 서술형 수학 문제는 일상에서의 상황을 수학적으로 기술한 자연어 문제로, 인공지능 모델로 이 문제를 풀이하는 기술은 활용 가능성이 높아 국내외에서 다양하게 연구되고 있으나 데이터의 부족으로 인해 성능 향상에서의 한계가 늘 존재해 왔다. 본 논문은 이를 해결하기 위해 시중의 수학 문제들을 수집하여 템플릿을 구축하고, 템플릿에 적합한 풀이계획을 생성할 수 있는 중간 언어인 MOOLang 을 통해 생성된 문제에 대응하는 Python 코드 형태의 풀이와 정답을 생성할 수 있는 데이터 증강 방법을 고안하였다. 이 기법을 통해 생성된 데이터로 기존의 최고 성능 모델인 KoEPT를 통해 학습을 시도해본 결과, 생성된 데이터셋을 통해 모델이 원활하게 데이터셋의 분포를 학습할 수 있다는 것을 확인하였다.