• Title/Summary/Keyword: software updates

Search Result 70, Processing Time 0.024 seconds

Global Ocean Data Assimilation and Prediction System 2 in KMA: Operational System and Improvements (기상청 전지구 해양자료동화시스템 2(GODAPS2): 운영체계 및 개선사항)

  • Hyeong-Sik Park;Johan Lee;Sang-Min Lee;Seung-On Hwang;Kyung-On Boo
    • Atmosphere
    • /
    • v.33 no.4
    • /
    • pp.423-440
    • /
    • 2023
  • The updated version of Global Ocean Data Assimilation and Prediction System (GODAPS) in the NIMS/KMA (National Institute of Meteorological Sciences/Korea Meteorological Administration), which has been in operation since December 2021, is being introduced. This technical note on GODAPS2 describes main progress and updates to the previous version of GODAPS, a software tool for the operating system, and its improvements. GODAPS2 is based on Forecasting Ocean Assimilation Model (FOAM) vn14.1, instead of previous version, FOAM vn13. The southern limit of the model domain has been extended from 77°S to 85°S, allowing the modelling of the circulation under ice shelves in Antarctica. The adoption of non-linear free surface and variable volume layers, the update of vertical mixing parameterization, and the adjustment of isopycnal diffusion coefficient for the ocean model decrease the model biases. For the sea-ice model, four vertical ice layers and an additional snow layer on top of the ice layers are being used instead of previous single ice and snow layers. The changes for data assimilation include the updated treatment for background error covariance, a newly added bias scheme combined with observation bias, the application of a new bias correction for sea level anomaly, an extension of the assimilation window from 1 day to 2 days, and separate assimilations for ocean and sea-ice. For comparison, we present the difference between GODAPS and GODAPS2. The verification results show that GODAPS2 yields an overall improved simulation compared to GODAPS.

A Brake Pad Wear Compensation Method and Performance Evaluation for ElectroMechanical Brake (전기기계식 제동장치의 제동패드 마모보상방법 및 성능평가)

  • Baek, Seung-Koo;Oh, Hyuck-Keun;Park, Choon-Soo;Kim, Seog-Won
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.21 no.10
    • /
    • pp.581-588
    • /
    • 2020
  • This study examined a brake pad wear compensation method for an Electro-Mechanical Brake (EMB) using the braking test device. A three-phase Interior Permanent Magnet Synchronous Motor (IPMSM) was applied to drive the actuator of an EMB. Current control, speed control, and position control were used to control the clamping force of the EMB. The wear compensation method was performed using a software algorithm that updates the motor model equation by comparing the motor output torque current with a reference current. In addition, a simple first-order motor model equation was applied to estimate the output clamping force. The operation time to the maximum clamping force increased within 0.1 seconds compared to the brake pad in its initial condition. The experiment verified that the reference operating time was within 0.5 seconds, and the maximum value of the clamping force was satisfied under the wear condition. The wear compensation method based on the software algorithm in this paper can be performed in the pre-departure test of rolling stock.

A Property-Based Data Sealing using the Weakest Precondition Concept (최소 전제조건 개념을 이용한 성질 기반 데이터 실링)

  • Park, Tae-Jin;Park, Jun-Cheol
    • Journal of Internet Computing and Services
    • /
    • v.9 no.6
    • /
    • pp.1-13
    • /
    • 2008
  • Trusted Computing is a hardware-based technology that aims to guarantee security for machines beyond their users' control by providing security on computing hardware and software. TPM(Trusted Platform Module), the trusted platform specified by the Trusted Computing Group, acts as the roots for the trusted data storage and the trusted reporting of platform configuration. Data sealing encrypts secret data with a key and the platform's configuration at the time of encryption. In contrast to the traditional data sealing based on binary hash values of the platform configuration, a new approach called property-based data sealing was recently suggested. In this paper, we propose and analyze a new property-based data sealing protocol using the weakest precondition concept by Dijkstra. The proposed protocol resolves the problem of system updates by allowing sealed data to be unsealed at any configuration providing the required property. It assumes practically implementable trusted third parties only and protects platform's privacy when communicating. We demonstrate the proposed protocol's operability with any TPM chip by implementing and running the protocol on a software TPM emulator by Strasser. The proposed scheme can be deployed in PDAs and smart phones over wireless mobile networks as well as desktop PCs.

  • PDF

A Reconfigurable Scheduler Model for Supporting Various Real-Time Scheduling Algorithms (다양한 실시간 스케줄링 알고리즘들을 지원하기 위한 재구성 가능한 스케줄러 모델)

  • Shim, Jae-Hong;Song, Jae-Shin;Choi, Kyung-Hee;Park, Seung-Kyu;Jung, Gi-Hyun
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.29 no.4
    • /
    • pp.201-212
    • /
    • 2002
  • This paper proposes a reconfigurable scheduler model that can support various real-time scheduling algorithms. The proposed model consists of two hierarchical upper and lower components, task scheduler and scheduling framework, respectively. The scheduling framework provides a job dispatcher and software timers. The task scheduler implements an appropriate scheduling algorithm, which supports a specific real-time application, based on the scheduling framework. If system developers observe internal kernel interfaces to communicate between two hierarchical components, they can implement a new scheduling algorithm independent of complex low kernel mechanism. Once a task scheduler is developed, it can be reused in a new real-time system in future. In Real-Time Linux (5), we implemented the proposed scheduling framework and several representative real-time scheduling algorithms. Throughout these implementations, we confirmed that a new scheduling algorithm could be developed independently without updates of complex low kernel modules. In order to confirm efficiency of the proposed model, we measured the performance of representative task schedulers. The results showed that the scheduling overhead of proposed model, which has two separated components, is similar to that of a classic monolithic kernel scheduler.

A Study on the Development items of Korean Marine GIS Software Based on S-100 Universal Hydrographic Standard (S-100 표준 기반 해양 GIS 소프트웨어 국산화 개발 방향에 관한 연구)

  • LEE, Sang-Min;CHOI, Tae-Seok;KIM, Jae-Myung;CHOI, Yun-Soo
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.25 no.3
    • /
    • pp.17-28
    • /
    • 2022
  • This study is to develop the direction of the development of the next-generation mapping of marine information required to develop a base of the utilization localization of maritime production tools. The GIS data-processing products and technologies currently used in the Korea's marine sector depend on external applications which is renewal costs, technical updates, and unreflected characteristics. Meanwhile, the S-100 standard, the next generation hydrographic data model that complements S-57's problems in marine GIS data processing, was adopted as a new marine data standard. This study aims to present the current status and problems of marine GIS technology in Korea and to suggest the development direction of GIS software based on the next generation hydrogrphic data model S-100 standard of IHO(International Hydrographic Organization). S-100-based marine GIS localization technology development and industrial ecosystem development research is expected to scientific decision-making on policy issues that occur with other countries such as marine territory management and development and use of marine resources.

Models of Database Assets Valuation and their Life-cycle Determination (데이터베이스 자산 가치평가 모형과 수명주기 결정)

  • Sung, Tae-Eung;Byun, Jeongeun;Park, Hyun-Woo
    • The Journal of the Korea Contents Association
    • /
    • v.16 no.3
    • /
    • pp.676-693
    • /
    • 2016
  • Although the methodology and models to assess the economic value of technology assets such as patents are being presented in various ways, there does not exist a structured assessment model which enables to objectively assess a database property's value, and thus there is a need to enhance the application feasibility of practical purposes such as licensing of DB assets, commercialization transfer, security, etc., through the establishment of the valuation model and the life-cycle decision logic. In this study, during the valuation process of DB assets, the size of customer demand group expected and the amount of demand, the size and importance of data sets, the approximate degree of database' contribution to the sales performance of a company, the life-cycle of database assets, etc. will be analyzed whether they are appropriate as input variables or not. As for most of DB assets, due to irregular updates there are hardly cases their life-cycle expires, and thus software package's persisting period, ie. 5 years, is often considered the standard. We herein propose the life-cycle estimation logic and valuation models of DB assets based on the concept of half life for DB usage frequency under the condition that DB assets' value decays and there occurs no data update over time.

Development of Update Methods for Configuration Data of NETCONF Protocol considering Multiple Network Administrators (다수 네트워크 관리자를 고려한 NETCONF 프로토콜의 설정 데이터 갱신 기법 개발)

  • Lee, Yang-Min;Cha, Mi-Yang;Lee, Jae-Kee
    • Journal of Internet Computing and Services
    • /
    • v.14 no.5
    • /
    • pp.27-38
    • /
    • 2013
  • Currently a number of managers exist to manage heterogeneous networks, in this situation, the NETCONF protocol for efficient network management has been proposed as a new protocol. However, the standard NETCONF protocol stack continuous improvement since the establishment but in four layers still have some problems. Especially in situations where there are multiple administrators, problems are more highlighted in operation layer. In this paper, we focus on these issues and the Operation layer has improved the efficiency and flexibility of operations among NETCONF four layers. Additionally, for the inefficiency of updates improved the device settings based on improved operation techniques. In addition, standard protocol NETCONF did not proposed content layer data structure and we propose standard technique of content layer that can generate configuration structure of devices. Improved the three techniques are applied appropriately to the NETCONF, the proposed method and the existing NETCONF was performed experiment to compare with experimental four factors. Compare key factor are four kind as maintaining the probability of network function, the reaction performance about command, the number of control packets, performance of data creation in content layer. Such factors after performing the experiment, the proposed method in this paper is superior to the existing NETCONF and there was confirmed by analysis Experimental results.

A System for Change Management of Sensor Network Applications based on Version Synchronization (버전동기화 기반의 센서 네트워크 응용 소프트웨어 변경 관리 시스템의 구축 사례)

  • Kim, Jae-Cheol;Kim, Ju-Il;Chong, Ki-Won;Lee, Woo-Jin
    • The KIPS Transactions:PartA
    • /
    • v.16A no.2
    • /
    • pp.125-134
    • /
    • 2009
  • This paper proposes a change management system of sensor network applications based on version synchronization that supports to effectively manage defect correction of applications, change of functions for applications or improvement of applications without suspending the sensor network. The proposed change management system consists of the NADE which is an application development environment, the Node Management Server, and the Node Agent. NADE is an Eclipse-based development environment for developing applications which are installed into nodes. NADE is also connected with CVSNT which is a version management tool and performs application version management using the CVSNT. Node Management Server manages nodes to maintain latest versions of applications by synchronizing versions of applications which are performed on the nodes with the versions of applications which are developed in the NADE. Node Agent which is loaded into the node periodically sends the version information of the application to the server, and stores and updates the version information of the application. Through the proposed change management system, applications of nodes are automatically updated when versions of applications are changed by correcting defects, changing functions or improving applications. Therefore, the user can effectively manage the execution of sensor network system without suspending or delaying the sensor network. Also, visibility of change management for sensor network applications will be improved.

An Approach Using LSTM Model to Forecasting Customer Congestion Based on Indoor Human Tracking (실내 사람 위치 추적 기반 LSTM 모델을 이용한 고객 혼잡 예측 연구)

  • Hee-ju Chae;Kyeong-heon Kwak;Da-yeon Lee;Eunkyung Kim
    • Journal of the Korea Society for Simulation
    • /
    • v.32 no.3
    • /
    • pp.43-53
    • /
    • 2023
  • In this detailed and comprehensive study, our primary focus has been placed on accurately gauging the number of visitors and their real-time locations in commercial spaces. Particularly, in a real cafe, using security cameras, we have developed a system that can offer live updates on available seating and predict future congestion levels. By employing YOLO, a real-time object detection and tracking algorithm, the number of visitors and their respective locations in real-time are also monitored. This information is then used to update a cafe's indoor map, thereby enabling users to easily identify available seating. Moreover, we developed a model that predicts the congestion of a cafe in real time. The sophisticated model, designed to learn visitor count and movement patterns over diverse time intervals, is based on Long Short Term Memory (LSTM) to address the vanishing gradient problem and Sequence-to-Sequence (Seq2Seq) for processing data with temporal relationships. This innovative system has the potential to significantly improve cafe management efficiency and customer satisfaction by delivering reliable predictions of cafe congestion to all users. Our groundbreaking research not only demonstrates the effectiveness and utility of indoor location tracking technology implemented through security cameras but also proposes potential applications in other commercial spaces.

Estimate Customer Churn Rate with the Review-Feedback Process: Empirical Study with Text Mining, Econometrics, and Quai-Experiment Methodologies (리뷰-피드백 프로세스를 통한 고객 이탈률 추정: 텍스트 마이닝, 계량경제학, 준실험설계 방법론을 활용한 실증적 연구)

  • Choi Kim;Jaemin Kim;Gahyung Jeong;Jaehong Park
    • Information Systems Review
    • /
    • v.23 no.3
    • /
    • pp.159-176
    • /
    • 2021
  • Obviating user churn is a prominent strategy to capitalize on online games, eluding the initial investments required for the development of another. Extant literature has examined factors that may induce user churn, mainly from perspectives of motives to play and game as a virtual society. However, such works largely dismiss the service aspects of online games. Dissatisfaction of user needs constitutes a crucial aspect for user churn, especially with online services where users expect a continuous improvement in service quality via software updates. Hence, we examine the relationship between a game's quality management and its user base. With text mining and survival analysis, we identify complaint factors that act as key predictors of user churn. Additionally, we find that enjoyment-related factors are greater threats to user base than usability-related ones. Furthermore, subsequent quasi-experiment shows that improvements in the complaint factors (i.e., via game patches) curb churn and foster user retention. Our results shed light on the responsive role of developers in retaining the user base of online games. Moreover, we provide practical insights for game operators, i.e., to identify and prioritize more perilous complaint factors in planning successive game patches.