• Title/Summary/Keyword: 갱신 성능

Search Result 785, Processing Time 0.028 seconds

An Efficient Knowledge Base Management Using Hybrid SOM (하이브리드 SOM을 이용한 효율적인 지식 베이스 관리)

  • Yoon, Kyung-Bae;Choi, Jun-Hyeog;Wang, Chang-Jong
    • The KIPS Transactions:PartB
    • /
    • v.9B no.5
    • /
    • pp.635-642
    • /
    • 2002
  • There is a rapidly growing demand for the intellectualization of information technology. Especially, in the area of KDD (Knowledge Discovery in Database) which should make an optimal decision of finding knowledge from a large amount of data, the demand is enormous. A large volume of Knowledge Base should be efficiently managed for a more intellectual choice. This study is proposing a Hybrid SOM for an efficient search and renewal of knowledge base, which combines a self-study nerve network, Self-Organization Map with a probable distribution theory in order to get knowledge needed for decision-making management from the Knowledge Base. The efficient knowledge base management through this proposed method is carried out by a stimulation test. This test confirmed that the proposed Hybrid SOM can manage with efficiency Knowledge Base.

A Dynamic Event Filtering Technique using Multi-Level Path Sampling in a Shared Virtual Environment (공유가상공간에서 다중경로샘플링을 이용한 동적 이벤트 필터링 기법)

  • Yu, Seok-Jong;Choe, Yun-Cheol;Go, Gyeon
    • Journal of KIISE:Software and Applications
    • /
    • v.26 no.11
    • /
    • pp.1306-1313
    • /
    • 1999
  • 본 연구는 인터넷 기반 공유가상공간에서 시스템의 확장성을 유지하기 위하여 이동객체를 대상으로 하는 이벤트 필터링 기법을 제안하고자 한다. 제안된 다중격자 모델 기법은 이동객체의 경로 상에서 대표적인 이벤트를 샘플링하는 방식을 사용한다. 이 방식은 메시지 트래픽의 양을 동적으로 조절하기 위하여 이동객체 간의 관심정도 정보를 수치적으로 변환하여 이벤트 갱신빈도에 반영한다. 대량의 이동객체를 생성하여 제안된 기법을 적용한 성능평가 실험에서 기존의 방식에 비하여 평균 메시지 전송량이 50%이상 감소하는 것으로 확인할 수 있었다. 다중격자 모델은 참여자의 수와 메시지 트래픽 상황에 따라 가상환경의 공유 QoS를 동적으로 조절할 수 있으며, 인터넷 상에서 다수 사용자를 위한 3차원 가상사회 구축 및 온라인 네트워크 게임 개발 등에 활용될 수 있을 것이다.Abstract This paper proposes an event filtering technique that can dynamically control a large amount of event messages produced by moving objects like avatars or autonomous objects in a distributed virtual environment. The proposed multi-level grid model technique uses the method that extracts the representative events from the paths of moving objects. For dynamic control of message traffics, this technique digitizes the DOIs of the avatars and reflects the interest information controlling the frequency of message transmission. For the performance evaluation, a large number of moving objects were created and the model was applied to these avatar groups. In the experiments, more than 50% of messages have been reduced in comparison with the existing AOI-based filtering techniques. The proposed technique can dynamically control the QoS in proportion to the number of users and the amount of messages where a large number of users share a virtual space. This model can be applied to the development of 3D collaborative virtual societies and multi-user online games in the Internet.

A Self-Description File System for NAND Flash Memory (낸드 플래시 메모리를 위한 자기-서술 파일 시스템)

  • Han, Jun-Yeong;Park, Sang-Oh;Kim, Sung-Jo
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.15 no.2
    • /
    • pp.98-113
    • /
    • 2009
  • Conventional file systems for harddisk drive cannot be applied to NAND flash memory, because the physical characteristics of NAND flash memory differs from those of harddisk drive. To address this problem, various file systems with better reliability and efficiency have also been developed recently. However, those file systems have inherent overheads for updating the file's metadata pages, because those file systems save file's meta-data and data separately. Furthermore, those file systems have a critical reliability problem: file systems fail when either a page in meta-data of a file system or a file itself fails. In this paper, we propose a self-description page technique and In Memory Core File System technique to address these efficiency and reliability problems, and develop SDFS(Self-Description File System) newly. SDFS can be safely recovered, although some pages fail, and improves write and read performance by 36% and 15%, respectively, and reduces mounting time by 1/20 compared with YAFFS2.

An Improvement of Hospital Reception System using Web Socket (웹소켓을 이용한 병원 접수시스템 개선에 관한 연구)

  • Son, Man-Geun;Park, Ki-Seong;Kong, Yong-Hae
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.1
    • /
    • pp.185-195
    • /
    • 2015
  • During hospital peak times of outpatients, an effective mechanism that informs the newly receipted patient information to corresponding medical departments is lacking in current hospital reception systems. Since every department repeatedly searches entire patient reception database in sequential manner to acquire its reception information, this is a significant performance degradation factor in hospital information system. To improve hospital reception system efficiency, we developed two web socket based systems, a primary key transmitting batch system and a reception information transmitting real time system. The former reduced database access time compared to sequential search system as well as kept search time low regardless of receipted patient number. The latter effectively reduced waiting list updating time in request/response patient reception system by eliminating database access.

Design of Web Content Update Algorithm to Reduce Communication Data Consumption using Service Worker and Hash (서비스워커와 해시를 이용한 통신 데이터 소모 감소를 위한 웹 콘텐츠 갱신 알고리즘 설계)

  • Kim, Hyun-gook;Park, Jin-tae;Choi, Moon-Hyuk;Moon, Il-young
    • Journal of Advanced Navigation Technology
    • /
    • v.23 no.2
    • /
    • pp.158-165
    • /
    • 2019
  • The existing web page was downloaded and provided to the user every time the user requested the page. Therefore, if the same page is repeatedly requested by the user, only the download for the same resource is repeated. This is a factor that causes unnecessary consumption of data. We focus on reducing data consumption caused by unnecessary requests between users and servers, and improving content delivery speed. Therefore, in this paper, we propose a caching system and an algorithm that can reduce the data consumption while maintaining the latest cache by comparing the hash value using the hash function that can detect the change of the file requested by the user.

Authentication Protocol Using Hamming Distance for Mobile Ad-hoc Network (모바일 Ad-hoc 네트워크에서 Hamming Distance를 이용한 인증프로토콜)

  • Lee, Seok-Lae;Song, Joo-Seok
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.16 no.5
    • /
    • pp.47-57
    • /
    • 2006
  • Mobile Ad-hoc networks have various implementation constraints such as infrastructure-free, no trusted authority, node mobility, and the limited power and small memory of mobile device. And just like wired networks, various security issues such as authentication, confidentiality, integrity, non-repudiation, access control, availability and so on have been arisen in mobile Ad-hoc networks. But we focus on authentication of these security issues because it is quitely affected by the characteristics of networks. In this paper, we propose the authentication protocol that can limit the size of certificate repository as $log_2N$ and assures to make a trusted certificate path from one node to another, adopting the concept of Hamming distance. Particularly, our protocol can construct a trusted certificate path in spite of decreasing or increasing the number of nodes in mobile Ad-hoc network.

A Message Communication for Secure Data Communication in Smart Home Environment Based Cloud Service (클라우드 서비스 기반 스마트 홈 환경에서 안전한 데이터 통신을 위한 메시지 통신 프로토콜 설계)

  • Park, Jung-Oh
    • Journal of Convergence for Information Technology
    • /
    • v.11 no.7
    • /
    • pp.21-30
    • /
    • 2021
  • With the development of IoT technology, various cloud computing-based services such as smart cars, smart healthcare, smart homes, and smart farms are expanding. With the advent of a new environment, various problems continue to occur, such as the possibility of exposure of important information such as personal information or company secrets, financial damage cases due to hacking, and human casualties due to malicious attack techniques. In this paper, we propose a message communication protocol for smart home-based secure communication and user data protection. As a detailed process, secure device registration, message authentication protocol, and renewal protocol were newly designed in the smart home environment. By referring to the security requirements related to the smart home service, the stability of the representative attack technique was verified, and as a result of performing a comparative analysis of the performance, the efficiency of about 50% in the communication aspect and 25% in the signature verification aspect was confirmed.

User Influence Determination using k-shell Decomposition in Social Networks (소셜 네트워크에서 k-쉘 분해를 이용한 사용자 영향력 판별)

  • Choi, Jaeyong;Lim, Jongtae;Bok, Kyoungsoo;Yoo, Jaesoo
    • The Journal of the Korea Contents Association
    • /
    • v.22 no.7
    • /
    • pp.46-54
    • /
    • 2022
  • The existing methods for determining influence in social networks do not accurately determine the influence of users because they do not delete or update existing relationships before they stop in the face of an increasing number of inactive users on social networks. In this paper, we propose a user influence detremination method using the temporal k-shell decomposition technique based on the creation date of users of social networks. To solve the problem of increasing influence of old users in social networks, we apply k-shell decomposition and age-specific order centrality as attenuation coefficients due to aging in neighbors. The age-decaying k-shell decomposition and age-specific order centrality are searched for influential users at the present time by applying the attenuation coefficient and age-dependent weights. Various performance evaluations are performed to show the superiority of the proposed method.

Blind Noise Separation Method of Convolutive Mixed Signals (컨볼루션 혼합신호의 암묵 잡음분리방법)

  • Lee, Haeng-Woo
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.17 no.3
    • /
    • pp.409-416
    • /
    • 2022
  • This paper relates to the blind noise separation method of time-delayed convolutive mixed signals. Since the mixed model of acoustic signals in a closed space is multi-channel, a convolutive blind signal separation method is applied and time-delayed data samples of the two microphone input signals is used. For signal separation, the mixing coefficient is calculated using an inverse model rather than directly calculating the separation coefficient, and the coefficient update is performed by repeated calculations based on secondary statistical properties to estimate the speech signal. Many simulations were performed to verify the performance of the proposed blind signal separation. As a result of the simulation, noise separation using this method operates safely regardless of convolutive mixing, and PESQ is improved by 0.3 points compared to the general adaptive FIR filter structure.

Modeling Framework for Continuous Dynamic Systems Using Machine Learning of Hypothetical Model (가설적 모델의 기계학습을 이용한 연속시간 동적시스템 모델링 프레임워크)

  • Hae Sang Song;Tag Gon Kim
    • Journal of the Korea Society for Simulation
    • /
    • v.32 no.1
    • /
    • pp.13-21
    • /
    • 2023
  • This paper proposes a method of automatically generating a model through a machine learning technique by setting a hypothetical model in the form of a gray box or black box with unknown parameters, when the big data of the actual system is given. We implements the proposed framework and conducts experiments to find an appropriate model among various hypothesis models and compares the cost and fitness of them. As a result we find that the proposed framework works well with continuous systems that could be modeled with ordinary differential equation. This technique is expected to be used well for the purpose of automatically updating the consistency of the digital twin model or predicting the output for new inputs using recently generated big data.