• Title/Summary/Keyword: 수학문제해결

Search Result 1,332, Processing Time 0.029 seconds

Design and Implementation of Meta-data Schema for General purpose Simulation Framework (시뮬레이션 프레임워크 구성을 위한 메타정보 스키마 설계 및 구현)

  • Jin, Du-Seok;Jeong, Jae-You;Jung, Hoe-Kyung
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2012.10a
    • /
    • pp.378-381
    • /
    • 2012
  • Increasingly the frequency of use of mathematical modeling and computer simulation, in order to solve complex engineering problems in the field of Applied Science, the researchers need a simulation framework that can make their simulation-based research easier and more convenient. computer simulation framework is composed of various components such as preprocessor, solver, visualization program, computational resources and job scheduler. However until now, no standardized schema for the components of the simulation framework exist, so it is difficult to config that make a general-purpose simulation framework. In other words, most of the existing simulation framework is a structure that provides only limited functionality is dependent on the particular solver code. In this paper, we designed the meta-information schema that can be contained of a various solver code to be used for the simulation framework and we implemented the Web-based simulation environment using our meta-information schema.

  • PDF

Performance Evaluation of a Switch Router with Output-Buffer (출력 버퍼를 장착한 스위치 라우터의 성능 분석)

  • Shin Tae-zi;Yang Myung-kook
    • Journal of KIISE:Information Networking
    • /
    • v.32 no.2
    • /
    • pp.244-253
    • /
    • 2005
  • In this paper, a performance evaluation model of the switch router with the multiple-buffered crossbar switches is proposed and examined. Buffered switch technique is well known to solve the data collision problem of the crossbar switch. The proposed evaluation model is developed by investigating the transfer patterns of data packets in a switch with output-buffers. The performance of the multiple-buffered crossbar switch is analyzed. Steady state probability concept is used to simplify the analyzing processes. Two important parameters of the network performance, throughput and delay, are then evaluated. To validate the proposed analysis model, the simulation is carried out on a network that uses the multiple buffered crossbar switches. Less than $2\%$ differences between analysis and simulation results are observed. It is also shown that the network performance is significantly improved when the small number of buffer spaces is given. However, the throughput elevation is getting reduced and network delay becomes increasing as more buffer spaces are added in a switch.

A Study on Scattered Wave Amplitude Closed-Form Solution Calculation of Torsional Wave Mode by Reciprocity Theorem (배관에서 상반 정리를 활용한 비틀림 파의 산란 신호 진폭의 닫힘 해 계산 연구)

  • Lee, Jaesun;Cho, Younho;Achenbach, Jan D.
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.40 no.7
    • /
    • pp.647-652
    • /
    • 2016
  • Guided waves can be used for the inspection of long range pipelines. Surface corrosion is often found as a major defect type in pipelines. The reciprocity relation is a well-established theorem by which one can simplify complicated mathematical expressions. The approach has been already applied to plate and half-space structures to obtain the closed-form solutions of scattered amplitude. However, results for the case of cylindrical structures have not been reported yet. In this paper, the scattering of torsional waves, which is widely used in commercial applications, is explored by the reciprocity theorem approach. Obtaining closed-form solutions of the amplitudes of propagating waves is much simplified by using the reciprocal relation. The scattered amplitudes for elliptical and rectangular defect shapes are calculated with respect to defect depth and width, at frequencies between 0 and 500 kHz. The amplitude shows the periodic result as a function of frequency. The derived closed-form solutions can play a significant role in quantitative signal interpretation.

Performance Evaluation of a Multistage Interconnection Network with Output-Buffered ${\alpha}{\times}{\alpha}$ Switches (출력 버퍼형${\alpha}{\times}{\alpha}$스위치로 구성된 다단 연결망의 성능 분석)

  • 신태지;양명국
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.6
    • /
    • pp.738-748
    • /
    • 2002
  • In this paper, a performance evaluation model of the Multistage Interconnection Network(MIN) with the multiple-buffered crossbar switches is Proposed and examined. Buffered switch technique is well known to solve the data collision problem of the MIN. The proposed evaluation model is developed by investigating the transfer patterns of data packets in a switch with output-buffers. The performance of the multiple-buffered${\alpha}{\times}{\alpha}$ crossbar switch is analyzed. Steady state probability concept is used to simplify the analyzing processes, Two important parameters of the network performance, throughput and delay, are then evaluated, To validate the proposed analysis model, the simulation is carried out on a Baseline network that uses the multiple buffered crossbar switches. Less than 2% differences between analysis and simulation results are observed. It is also shown that the network performance is significantly improved when the small number of buffer spaces is given. However, the throughput elevation is getting reduced and network delay becomes increasing as more buffer spaces are added in a switch.

Cellular-Automata Based Node Scheduling Scheme for Wireless Sensor Networks (무선 센서 네트워크를 위한 셀룰러 오토마타 기반의 노드 스케줄링 제어)

  • Byun, Heejung;Shon, Sugook
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39B no.10
    • /
    • pp.708-714
    • /
    • 2014
  • Wireless sensor networks (WSNs) generally consist of densely deployed sensor nodes that depend on batteries for energy. Having a large number of densely deployed sensor nodes causes energy waste and high redundancy in sensor data transmissions. The problems of power limitation and high redundancy in sensing coverage can be solved by appropriate scheduling of node activity among sensor nodes. In this paper, we propose a cellular automata based node scheduling algorithm for prolonging network lifetime with a balance of energy savings among nodes while achieving high coverage quality. Based on a cellular automata framework, we propose a new mathematical model for the node scheduling algorithm. The proposed algorithm uses local interaction based on environmental state signaling for making scheduling decisions. We analyze the system behavior and derive steady states of the proposed system. Simulation results show that the proposed algorithm outperforms existing protocols by providing energy balance with significant energy savings while maintaining sensing coverage quality.

A Weight based GTS Allocation Scheme for Fair Queuing in IEEE 802.15.4 LR-WPAN (IEEE 802.15.4 LR-WPAN 환경에서 공정 큐잉을 위한 가중치 기반 GTS 할당 기법)

  • Lee, Kyoung-Hwa;Lee, Hyeop-Geon;Shin, Yong-Tae
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.47 no.9
    • /
    • pp.19-28
    • /
    • 2010
  • The GTS(Guaranteed Time Slot) of the IEEE 802.15.4 standard, which is the contention free access mechanism, is used for low-latency applications or applications requiring specific data bandwidth. But it has some problems such as delay of service due to FIFS(First In First Service) scheduling. In this paper, we proposes a weight based GTS allocation scheme for fair queuing in IEEE 802.15.4 LR-WPAN. The proposed scheme uses a weight that formed by how much more weight we give to the recent history than to the older history for a new GTS allocation. This scheme reduces service delay time and also guarantees transmission simultaneously within a limited time. The results of the performance analysis shows that our approach improves the performance as compared to the native explicit allocation mechanism defined in the IEEE 802.15.4 standard.

The Security analysis of Self-certified public key based Key agreement protocols against Active Attacks (능동적 공격자 환경에서의 자체인증 공개키에 기반한 키 분배 프로토콜의 안전성 분석)

  • Yang HyungKyu
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.1C
    • /
    • pp.25-34
    • /
    • 2005
  • Girault proposed a key agreement protocol based on his new idea of self-certified public key. Later Rueppel and Oorschot showed variants of the Girault scheme. All of these key agreement protocols inherit positive features of self-certified public key so that they can provide higher security and smaller communication overhead than key agreement protocols not based on self-certified public key. Even with such novel features, rigorous security analysis of these protocols has not been made clear yet. In this paper, we give rigorous security analysis of key agreement protocols based on self-certified public key. We use reduction among functions for security analysis and consider several kinds of active attacker models such as active impersonation attack, key-compromise impersonation attack, forward secrecy and known key security.

Integrated Hybrid Modeling Methodology and Simulation Engine Design Based on HDEVS Formalism (HDEVS 형식론에 기반한 통합 하이브리드 모델링 방법론 및 시뮬레이션 엔진 설계)

  • Kwon, Se Jung;Sung, Changho;Song, Hae-Sang;Kim, Tag Gon
    • Journal of the Korea Society for Simulation
    • /
    • v.22 no.1
    • /
    • pp.21-30
    • /
    • 2013
  • A hybrid system is a combination of sub systems which have different types of state and time: a typical example is a combination of discrete event and continuous systems. A HDEVS(Hybrid DEVS) formalism was proposed for modeling and analyzing a hybrid system. The HDEVS formalism allows modelers to construct a hierarchical and modular model based on the mathematical set theory. Because the HDEVS formalism was applied to the distributed and interoperated simulators, modelers should make several heterogenous models dividing a target system. Hence, this paper proposes an extended hybrid coupled model of HDEVS formalism and an integrated hybrid modeling methodology in contrast to the existing simulation framework on interoperable simulators. By applying the proposed modeling method, a target system can be translated to a hybrid model in a similar form as the target system. This paper also contains a simulation engine design for the proposed modeling methodlogy and a case study which simulates water tank control systems.

Optimal Neighbor Scope-Based Location Registration Scheme in Mobile IP Networks (이동 IP 망에서의 최적 이웃 스코프 값 기반의 위치 등록 방법)

  • Suh, Bong-Sue
    • Journal of the Korea Society of Computer and Information
    • /
    • v.12 no.5
    • /
    • pp.139-144
    • /
    • 2007
  • The mobile terminal's frequent changes to the access point introduce significant network overhead in mobile IP networks. To solve this problem, we introduce a hierarchical structure with consideration given to the dynamic value of neighbor scope in IP regional registration[1]. When a mobile terminal moves within the neighbor given by the scope value, it makes registration locally without registration with its home agent. We analyze the algorithm mathematically and show the numerical results. As a result, optimization of the scope value for the localized registration under the hierarchical structure makes the proposed scheme outperform the standard mobile IP protocol[2]. This can be explained from the fact that there is only local registration for terminal's movement within the scope region. Moreover, as the signaling cost for home agent increases, the proposed scheme becomes more advantageous.

  • PDF

A RLS-based Convergent Algorithm for Driving Characteristic Classification for Personalized Autonomous Driving (자율주행 개인화를 위한 순환 최소자승 기반 융합형 주행특성 구분 알고리즘)

  • Oh, Kwang-Seok
    • Journal of the Korea Convergence Society
    • /
    • v.8 no.9
    • /
    • pp.285-292
    • /
    • 2017
  • This paper describes a recursive least-squares based convergent algorithm for driving characteristic classification for personalized autonomous driving. Recently, various researches on autonomous driving technology have been conducted for level 4 fully autonomous driving. In order for commercialization of the autonomous vehicle, personalized autonomous driving is required to minimize passenger's insecureness to the autonomous vehicle. To address this problem. this study proposes mathematical model that represents driving characteristics and recursive least-squares based algorithm that can estimate the defined characteristics. The actual data of two drivers has been used to derive driving characteristics and the hypothesis testing method has been used to classify two drivers. It is shown that the proposed algorithms can derive driving characteristics and classify two drivers reasonably.