• Title/Summary/Keyword: Grouping Method

Search Result 611, Processing Time 0.022 seconds

Group Management Structure of Segments for P2P-based On Demand Streaming Services (P2P 기반의 사용자 주문형 스트리밍 서비스를 위한 세그먼트 그룹 관리 구조)

  • Lee, Chong-Deuk;Jeong, Taeg-Won
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.10 no.7
    • /
    • pp.1621-1630
    • /
    • 2009
  • There is a lot of recent research to provide services of dynamic distributed contents in P2P-based distributed environment. Distributed services of contents objects, however, have problems in QoS and dynamic management of segments. This paper proposed a new segment management method for the service of P2P-based distributed contents. The proposed method manages groups by the SGM(Segment Group Manager). The SGM manages streaming efficiently by the grouping of segments to be served in P2P environment. The segments in the same group cooperate for improved QoS using the management structure based on the distance and relationship. The distance-based management structure is for the improvement of retrieval efficiency while the relationship-based management structure is for the improvement of service ratio. The simulation results of the proposed method showed improvements in average transmission efficiency and average service rate. The improvement is 8% - 30% in average transmission efficiency and 10% - 30% in average service rate.

Study on Prescriptions about Monarch(jun)${\cdot}$Minister(chen)${\cdot}$Adjuvant(zou)${\cdot}$Guide(shi) Theory (군신좌사(君臣佐使)에 대한 연구)

  • Lee, Tae-Kyoung;Kang, Jung-Soo;Kim, Byoung-Soo
    • Journal of Physiology & Pathology in Korean Medicine
    • /
    • v.21 no.3
    • /
    • pp.596-604
    • /
    • 2007
  • For countless time, many have been made in our oriental medicine. To understand such prescription and to use, we must study the monarch(jun), minister(chen), adjuvant(zou) and guide(shi) theory that is most of the prescription structure principle's the basis. The monarch is the center of the prescription. Two kind is greatly in the method to select the monarch, in the prescription. One method is that a medicinal herb of the high class of medical herb of the Sinnong's Classic becomes the monarch, and the other method is a medicinal herbs which there is most many qunantity in the prescription becomes the monarch. Additionally, a medicinal herbs name of a prescription name can become the monarch. The minister assist the monarch and this is a criteria of the prescription grouping with the monarch. The minister has close relation with the monarch. The adjuvant helps the monarch and the minister nature of drug or restains. So this makes the prescription effectiveness act accurately. The guide does the activity to help the harmony of the prescription and the activity to help the prescription to act in correct place. If we understand the monarch, minister, adjuvant and guide theory well, we have some advantage. The interpreting of the prescription comes to De easy. and, an application range of the prescription is enhanced. the increase and decrease of the medicinal herbs comes to be easy in the prescription. Finally that theory will be used for the principle to make new prescription.

Least Square Prediction Error Expansion Based Reversible Watermarking for DNA Sequence (최소자승 예측오차 확장 기반 가역성 DNA 워터마킹)

  • Lee, Suk-Hwan;Kwon, Seong-Geun;Kwon, Ki-Ryong
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.52 no.11
    • /
    • pp.66-78
    • /
    • 2015
  • With the development of bio computing technology, DNA watermarking to do as a medium of DNA information has been researched in the latest time. However, DNA information is very important in biologic function unlikely multimedia data. Therefore, the reversible DNA watermarking is required for the host DNA information to be perfectively recovered. This paper presents a reversible DNA watermarking using least square based prediction error expansion for noncodng DNA sequence. Our method has three features. The first thing is to encode the character string (A,T,C,G) of nucleotide bases in noncoding region to integer code values by grouping n nucleotide bases. The second thing is to expand the prediction error based on least square (LS) as much as the expandable bits. The last thing is to prevent the false start codon using the comparison searching of adjacent watermarked code values. Experimental results verified that our method has more high embedding capacity than conventional methods and mean prediction method and also makes the prevention of false start codon and the preservation of amino acids.

A method for automatic EPC code conversion based on ontology methodology (온톨로지 기반 EPC 코드 자동 변환 방법)

  • Noh, Young-Sik;Byun, Yung-Cheol
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.12 no.3
    • /
    • pp.452-460
    • /
    • 2008
  • ALE-complient RFID middleware system receives EPC code data from reader devices and converts the data into URN format data internally. After filtering and grouping, the system sends the resulting URN code to application and(or) users. Meanwhile, not only the types of EPC code are very diverse, but also another new kinds of EPC code can be emerged in the future. Therefore, a method to process all kinds of EPC code effectively is required by RFID middleware. In this paper, a method to process various kinds of EPC code acquired from RFID reader devices in ALE-complient RFID middleware is proposed. Especially, we propose an approach using ontology technology to process not only existing EPC code but also newly defined code in the future. That is, we build an ontology of conversion rules for each EPC data type to effectively convert EPC data into URL format data. In this case, we can easily extend RFID middleware to process a new EPC code data by adding a conversion rule ontology for the code.

A method of event data stream processing for ALE Middleware (ALE 미들웨어를 위한 이벤트 데이터 처리 방법)

  • Noh, Young-Sik;Lee, Dong-Cheol;Byun, Yung-Cheol
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.12 no.9
    • /
    • pp.1554-1563
    • /
    • 2008
  • As the interests on RFID technologies increase, a lot of research activities on RFID middleware systems to handle the data acquired by RFID readers are going on actively. Meanwhile, even though various kinds of RFID middleware methodologies and related techniques have been proposed, the common data type which is dealt with in those systems is an EPC code, mainly. Also, there are few researches of the implementation of collecting the stream data queued from RFID readers endlessly and without blocking, classifying the data into some groups according to usage, and sending the resulting data to specific applications. In this paper, we propose the method of data handling in RFID middleware to efficiently process an EPC event stream data using detail filtering, checking of data modification, creation of data set to transfer, data grouping, and various kinds of RFID data format transform. Our method is based on a de facto international standard interface defined in the ALE middleware specification by EPCglobal, and application and service users can directly set various kinds of conditions to handle the stream data.

A Method of BDD Restructuring for Efficient MCS Extraction in BDD Converted from Fault Tree and A New Approximate Probability Formula (고장수목으로부터 변환된 BDD에서 효율적인 MCS 추출을 위한 BDD 재구성 방법과 새로운 근사확률 공식)

  • Cho, Byeong Ho;Hyun, Wonki;Yi, Woojune;Kim, Sang Ahm
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.23 no.6
    • /
    • pp.711-718
    • /
    • 2019
  • BDD is a well-known alternative to the conventional Boolean logic method in fault tree analysis. As the size of fault tree increases, the calculation time and computer resources for BDD dramatically increase. A new failure path search and path restructure method is proposed for efficient calculation of CS and MCS from BDD. Failure path grouping and bottom-up path search is proved to be efficient in failure path search in BDD and path restructure is also proved to be used in order to reduce the number of CS comparisons for MCS extraction. With these newly proposed methods, the top event probability can be calculated using the probability by ASDMP(Approximate Sum of Disjoint MCS Products), which is shown to be equivalent to the result by the conventional MCUB(Minimal Cut Upper Bound) probability.

A Study on the Analysis of Agricultural R&D Keywords Using Textmining Method (텍스트마이닝을 활용한 농업 R&D 키워드 분석)

  • Kim, Ji-Hoon;Kim, Seong-Sup
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.22 no.2
    • /
    • pp.721-732
    • /
    • 2021
  • This study analyzed keywords for agricultural R&D using the textmining method to examine the trend of agricultural R&D. Data used for the analysis included R&D project information provided by NTIS, and the research and development step by year from 2003 to 2018 were classified and applied. The TF-IDF approach was used as the analysis method, and ranking was derived based on score. Furthermore, we analyzed by grouping for similar keywords. The main analysis results are as follows. First, agricultural R&D trends are changing according to the introduction of new technologies and changes in the external environment. Second, keyword changes appeared with a time lag in the R&D step. The main keywords are changing in the order of basic research - applied research - development research. Third, the main keyword of agricultural R&D was 'rice.' However, the direction and purpose of the research were changing according to changes in the domestic and foreign agricultural environments.

Scheme of Secure IoT based Group communication (확장성과 보안을 보장하는 IoT 디바이스 기반의 그룹통신 기법)

  • Kim, Ki-Young
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.14 no.1
    • /
    • pp.98-103
    • /
    • 2021
  • In this study, we propose a group communication technique that guarantees security and expandability by configuring a network consisting of IoT terminals equipped with security functions. As the number of devices participating in the network increases, network resources are proportionally reduced, and adding a security function to the IoT device increases the delay time due to encryption in the IoT device. If the error rate that occurs in the network increases, network resources are quickly consumed due to retransmission. Therefore, IoT terminals are grouped to ensure scalability while supporting security, reducing the consumption of network resources even when the number of participating nodes increases, thus ensuring scalability. For the future implementation, the encryption method used in IoT terminals considered the standard of IEEE802.5.4, and the standardization trend was investigated and classified. The proposed method applies IoT devices that provide security functions of the IEEE802.5.4 standard to the group communication base to ensure reliability and scalability. In the performance evaluation, the effectiveness of the proposed method was confirmed by comparing the delay times when grouping IoT devices with security functions through simulation.

Low-cost privacy protection integrated monitoring system using interest emphasis method (관심강조 방법을 활용한 저비용 사생활보호 통합관제시스템)

  • Shin, Kwang-Seong;Shin, Seong-Yoon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.25 no.2
    • /
    • pp.234-239
    • /
    • 2021
  • Recently, as the installation of a large number of high-performance CCTVs for crime prevention and traffic control has increased rapidly, the problem of increasing system requirements for response to privacy infringement factors and analysis of high-definition image information transmitted from multiple cameras has been actively emerging. Accordingly, there is a need for a method for responding to privacy infringement and a method for efficiently processing surveillance images input from multiple cameras. In this paper, in order to reduce the processing cost of the input image and improve the processing speed, an integrated image is generated by grouping images input from a plurality of cameras. After analyzing the pre-generated integrated video, it detects a preset privacy event or an event that highlights interest. Depending on whether or not an event is detected, you will perform an editing operation corresponding to the event.

Analysis of deep learning-based deep clustering method (딥러닝 기반의 딥 클러스터링 방법에 대한 분석)

  • Hyun Kwon;Jun Lee
    • Convergence Security Journal
    • /
    • v.23 no.4
    • /
    • pp.61-70
    • /
    • 2023
  • Clustering is an unsupervised learning method that involves grouping data based on features such as distance metrics, using data without known labels or ground truth values. This method has the advantage of being applicable to various types of data, including images, text, and audio, without the need for labeling. Traditional clustering techniques involve applying dimensionality reduction methods or extracting specific features to perform clustering. However, with the advancement of deep learning models, research on deep clustering techniques using techniques such as autoencoders and generative adversarial networks, which represent input data as latent vectors, has emerged. In this study, we propose a deep clustering technique based on deep learning. In this approach, we use an autoencoder to transform the input data into latent vectors, and then construct a vector space according to the cluster structure and perform k-means clustering. We conducted experiments using the MNIST and Fashion-MNIST datasets in the PyTorch machine learning library as the experimental environment. The model used is a convolutional neural network-based autoencoder model. The experimental results show an accuracy of 89.42% for MNIST and 56.64% for Fashion-MNIST when k is set to 10.