• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.24 no.6
• /
• pp.1079-1090
• /
• 2014

Data mining is a technique to get the useful information that can be utilized for marketing and pattern analysis by processing the data that we have. However, when we use this technique, data provider's personal data can be leaked by accident. To protect these data from leakage, there were several techniques have been studied to preserve privacy. Vertically partitioned data is a state called that the data is separately provided to various number of user. On these vertically partitioned data, there was some methods developed to distinguishing kth element and (k+1) th element by using score. However, in previous method, we can only use on two-party case, so in this paper, we propose the extended technique by using paillier cryptosystem which can use on multi-party case.

• Journal of KIISE:Databases
• /
• v.32 no.6
• /
• pp.567-584
• /
• 2005

Temporal data mining, the incorporation of temporal semantics to existing data mining techniques, refers to a set of techniques for discovering implicit and useful temporal knowledge from temporal data. Association rules and classification are applied to various applications which are the typical data mining problems. However, these approaches do not consider temporal attribute and have been pursued for discovering knowledge from static data although a large proportion of data contains temporal dimension. Also, data mining researches from temporal data treat problems for discovering knowledge from data stamped with time point and adding time constraint. Therefore, these do not consider temporal semantics and temporal relationships containing data. This paper suggests that temporal associative classification technique based on temporal class association rules. This temporal classification applies rules discovered by temporal class association rules which extends existing associative classification by containing temporal dimension for generating temporal classification rules. Therefore, this technique can discover more useful knowledge in compared with typical classification techniques.

• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.4
• /
• pp.227-238
• /
• 2013

The business based existing BPMN model is a lack of service oriented modeling techniques. Therefore, it requires a layered technique of service oriented business modeling so that can meet the design for a complex application system, developing a system based on SOA. In order to enhance reusability and modularity of BPMN business model, this paper proposes a metamodel and business modeling process based on this metamodel that can hierarchically build a BPMN model. Towards this end, the XL-BPMN metamodel hierarchically established based on MDA and MVS styles are first defined. Then a BPMN service modeling process is constructed based on modeling elements of this metamodel according to the modeling phases. Finally, the result of a case study in which the proposed method is applied to an online shopping mall system is discussed. With the use of well-defined metamodel and modeling process, it is hoped that it can be shown that a service dominated and layered BPMN business model can be established, and that the modularity and reusability of the constructed BPMN business model can be maximized.

• KIPS Transactions on Software and Data Engineering
• /
• v.7 no.1
• /
• pp.19-24
• /
• 2018

This paper presents an IoT platform of common interfaces that are flexible IoT applications and Connect the smart devices. The IoT platform includes automatic collaboration discovery the smart Device. It is different things case with connection each device through IoT Platforms are each device and application service. Due to these heterogeneities, it is quite advantages to develop applications working with derived IoT services. This circumstance needs the generic interface and results in a range of IoT architectures by not only the environments settings and discovery resource but also varied uniqe to implementation services working with IoT applications. Therefore, this suggestion of solve the problems and make it possible independent platforms always alive to connection with each devices based on the generic interface. The generic interface is heterogeneity-driven solve the problems and effectively contributions a platform that could be operated in diverse IoT Platforms.

• The KIPS Transactions:PartA
• /
• v.8A no.4
• /
• pp.447-454
• /
• 2001

Various caching and prefetching algorithms have been investigated to identify and effective method for improving the performance of I/O devices. A prefetching algorithm decreases the processing time of a system by reducing the number of disk accesses when an I/O is needed. This paper proposes an AMBA prefetching method that is an extended version of the OBA prefetching method. The AMBA prefetching method will prefetching blocks continuously as long as disk bandwidth is enough. In this method, though there were excessive data request rate, we would expect efficient prefetching. And in the AMBA prefetching method, to prevent the cache pollution, it limits the number of data blocks to be prefetched within the cache area. It can be implemented in a user-level File System based on a Linux Operating System. In particular, the proposed prefetching policy improves the system performance by about 30∼40% for large files that are accessed sequentially.

• KIISE Transactions on Computing Practices
• /
• v.21 no.4
• /
• pp.290-298
• /
• 2015

This paper suggests a multi-agent message transport architecture based on the message-oriented middleware ZeroMQ. Compared with the other middlewares such as CORBA, Ice, and Thrift, ZeroMQ receives a good score in the evaluation of performance, QoS (Quality of Service), patterns, user friendliness, and resources. The suggested message transfer architecture borrowed many basic concepts like agent platform, AMS (Agent Management System), and MTS (Message Transfer System) from FIPA (Foundation for Intelligent Physical Agents) standard multi-agent specifications, and the architecture inherited the strength of the architecture from the multi-agent framework SMAF (Smart Multi-Agent Framework). The architecture suggested in this paper is a novel peer-to-peer architecture which is not known to the ZeroMQ community. In the suggested architecture, every MTS agent uses only one ZeroMQ router socket to support peer-to-peer communication among MTS agents. The suggested architecture can support closely collaborating software areas such as intelligent robots as well as the traditional application areas of multi-agent architecture. The suggested architecture has interoperability and scalability with the ZeroMQ devices and patterns.

• Journal of Korea Multimedia Society
• /
• v.11 no.7
• /
• pp.1035-1042
• /
• 2008

The support vector machine, as a binary classifier, is known to surpass the other classifiers only in binary classification problems through the various experiments. Even though its theory is based on the maximal margin classifier, the support vector machine approach cannot be easily extended to the multi-classification problems. In this paper, we review the extension techniques of the support vector machine toward the multi-classification and do the performance comparison. Depending on the data decomposition of the training data, the support vector machine is easily adapted for a multi-classification problem without modifying the intrinsic characteristics of the binary classifier. The performance is evaluated on a collection of the benchmark data sets and compared according to the selected teaming strategies, the training time, and the results of the neural network with the backpropagation teaming. The experiments suggest that the support vector machine is applicable and effective in the general multi-class classification problems when compared to the results of the neural network.

• Journal of Navigation and Port Research
• /
• v.32 no.10
• /
• pp.793-798
• /
• 2008

This paper presents a design of RFID(Radio Frequency Identification} tag antenna which has high sensitivity for car side mirror. A proposed tag antenna ($154\;mm{\times}66\;mm{\times}1;mm$) resonants at 900 MHz and has a wide bandwidth of 690 MHz($490\;MHz{\sim}1180\;MHz$). The measured gain and readable range of tag antenna are 5.8 dBd and 10 m, respectively. Radiation pattern and readable range of proposed tag antenna located on inside of a side mirror including a car body are measured at anechoic chamber. It has been confirmed that the readable range in the vicinity of $90^{\circ}$ has been expanded about 1.5 m by comparison with one of proposed tag antenna without of car body. Good performance of the proposed tag antenna was observed and proved by comparison of measured results of commercial tag antenna.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2011.05a
• /
• pp.258-258
• /
• 2011

지구 온난화에 따른 기후변화는 예측하기 힘든 패턴으로 특정지역의 강우빈도와 강수량을 증가시키고, 과거 관측되지 않았던 홍수 수위를 기록하는 등의 이상기후 현상으로 나타나고 있다. 기후변화의 눈으로 봤을 때 2010년은 전 세계적으로 많은 홍수, 지진, 산사태 등의 자연재해를 야기 시켰고, 이는 수자원의 활용과 관리 측면 뿐만 아니라 사회, 경제적 영향 및 자연재해로 확장되어 인류의 생활에 큰 영향으로 다가왔다. 이처럼 예기치 못한 기후변화에 대응하기 위해서는 수자원 정책이나, 장기발전계획 뿐만 아니라 발생된 기후 상황을 검토하고, 그 지역에서 발생된 강수량, 수위, 유량 등에 대한 기초 자료에 대한 분석이 선행되어야 할 것으로 판단된다. 본 연구에서는 2010년에 섬진강 유역의 최상류에서 하류에 이르는 덕치 외 12개 수위관측소를 대상 지점으로 선정하여 각 지점에 대한 현장조사를 실시하고, 수위모니터링을 비롯한 강수량, 방류량 등의 기본 자료를 수집하여 과거 자료와 비교검토 하였다. 그리고 저 평수기와 홍수기에 하천의 수위 및 유량을 현장에서 직접 실측하여 섬진강 상류에서 하류에 이르는 유출특성을 분석하였다. 그 결과 2010년 섬진강 유역에서는 지점에 따라 관측 개시일이 다르지만 1990년부터 관측이 개시된 구례와 송정 지점을 비롯하여 관측 이래 최고수위에 해당하는 호우가 발생되었음을 확인 할 수 있었다. 또한 2010년에 발생한 섬진강 유역의 지점별 상류에서 하류까지의 첨두유량을 분석 및 제시하였다. 이는 기존에 추정에 의해서 제시되었던 고수위 부분의 유량을 실측함으로써 고수위에 대한 수위-유량관계곡선식을 새롭게 제시하고, 홍수 주의보와 경보수위를 검토할 수 있는 기회가 되었다. 아울러 본 자료는 추후 발생 가능한 홍수에 좀 더 신속하게 대응할 수 있는 기초가 될 수 있을 것으로 기대한다.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.1
• /
• pp.43-50
• /
• 2010

Fuzzy c-means (FCM) and possibilistic c-means (PCM) are the two most well-known clustering algorithms in fuzzy clustering area, and have been applied in many applications in their original or modified forms. However, FCM's noise sensitivity problem and PCM's overlapping cluster problem are also well known. Recently there have been several attempts to combine both of them to mitigate the problems and possibilistic fuzzy c-means (PFCM) showed promising results. In this paper, we proposed a modified PFCM using regularization to reduce noise sensitivity in PFCM further. Regularization is a well-known technique to make a solution space smooth and an algorithm noise insensitive. The proposed algorithm, PFCM with regularization (PFCM-R), can take advantage of regularization and further reduce the effect of noise. Experimental results are given and show that the proposed method is better than the existing methods in noisy conditions.