• Journal of KIISE:Software and Applications
• /
• v.28 no.11
• /
• pp.822-832
• /
• 2001

We have implemented an inductive learning system that learns PROSPECTOR-rule-style classification rules from sets of examples. In our a approach, a genetic algorithm is used in which a population consists of rule-sets and rule-sets generate offspring through the exchange of rules relying on genetic operators such as crossover, mutation, and inversion operators. In this paper, we describe our learning environment centering on the syntactic structure and meaning of classification rules, the structure of a population, and the implementation of genetic operators. We also present a method to evaluate the performance of rules and a heuristic approach to generate rules, which are developed to implement mutation operators more efficiently. Moreover, a method to construct a classification system using multiple learned rule-sets to enhance the performance of a classification system is also explained. The performance of our learning system is compared with other learning algorithms, such as neural networks and decision tree algorithms, using various data sets.

• The KIPS Transactions:PartD
• /
• v.10D no.7
• /
• pp.1093-1102
• /
• 2003

As the use of internet is growing, the amount of information is increasing rapidly and XML that is a standard of the web data has the property of flexibility of data representation. Therefore electronic document systems based on web, such as EDMS (Electronic Document Management System), ebXML (e-business extensible Markup Language), have been adopting XML as the method for exchange and standard of documents. So research on the method which can manage and search structural XML documents in an effective wav is required. In this paper we propose the clustering method based on structural similarity among the many XML documents, using typical structures extracted from each document by sequential pattern mining in pre-clustering process. The proposed algorithm improves the accuracy of clustering by computing cost considering cluster cohesion and inter-cluster similarity.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37B no.10
• /
• pp.938-946
• /
• 2012

Interference alignment (IA) is a data transmission technique that achieves the maximum degrees-of-freedom (DoF) in the multiuser interference channel for high signal-to-noise ratios (SNRs). However, most prior works on IA are based on the unrealistic assumption that perfect and global channel-state information (CSI) is available at all transmitters and receivers. In this paper, we propose the efficient design of feedback framework for IA that substantially suppresses the feedback overhead. While the feedback overhead in the conventional IA quadratically increases with K, the proposed feedback scheme supports the sequential exchange of computed IA precoders between transmitters and receivers and reduces the feedback overhead that linearly scales with K. Moreover, we analyze the residual interference due to the quantization error in limited feedback and propose the ordered IA algorithm that selects IA pair to minimize the sum residual interference in given channel realizations.

• Proceedings of the KOSOMBE Conference
• /
• v.1997 no.11
• /
• pp.201-205
• /
• 1997

With the recent advance of Web and its associated technologies, information sharing on distribute computing environments has gained a great amount of attention from many researchers in many application areas, such as medicine, engineering, and business. One basic requirement of distributed medical consultation systems is that geographically dispersed, disparate participants are allowed to exchange information readily with each other. Such software also needs to be supported on a broad range of computer platforms to increase the software's accessibility. In this paper, the development of world-wide-web based medical consultation system or radiology imaging is addressed to provide the platform independence and great accessibility. The system supports sharing of 3-dimensional objects. We use VRML (Virtual Reality Modeling Language), which is the de-facto standard in 3-D modeling on the Web. 3-D objects are reconstructed from CT or MRI volume data using a VRML format, which can be viewed and manipulated easily in Web-browsers with a VRML plug-in. A Marching cubes method is used in the transformation of scanned volume data set to polygonal surfaces of VRML. A decimation algorithm is adopted to reduce the number of meshes in the resulting VRML file. 3-D volume data are often very large-sized, and hence loading the data on PC level computers requires a significant reduction of the size of the data, while minimizing the loss of the original shape information. This is also important to decrease network delays. A prototype system has been implemented (http://netopia.snu.ac.kr/-cyber/). and several sessions of experiments are carried out.

• Journal of Internet Computing and Services
• /
• v.8 no.1
• /
• pp.79-85
• /
• 2007

As the use of the computer and networks generalized, the various tasks which are requested secrets can be processed such os the banking transaction. And because of increasing of data exchange, Internet, and mobile networks, the method which is not connected only but also used with many users has been changed. Especially because of the structural problem of the Internet, a lot of information is leaked out when we use the Internet banking. If we check the Internet banking by using an existing cypher method which is either simple of slow, a credit card number, an account number or password will be leaked out. Because the security of information doesn't meet our expectation, we need more powerful cryptography. But, the wasted space-time which is required shouldn,t be ignored when the whole transferred data are encrypted. So, by using both the Elliptic Curve algorithm which is based on mobile networks and the partial encryption of the DTD of XML in this essay, we will implement more faster cypher method of the partial XML.

• Journal of The Korean Society of Agricultural Engineers
• /
• v.58 no.2
• /
• pp.21-29
• /
• 2016

This study conducted a basic design of system and interface which provide both of spatial and non-spatial data for water hazard information management. This helps to decide directions of the future integrated water hazard information platform and possible technical examinations of the web-based system for the realization of the prototype. For user friendly system, this study did a survey to investigate the data format, service environment, image processing level and visualization type that users prefer. Also, authorization range was set up by type of the user group. In the water hazard information platform, the data and analysis algorithm were classified by the fields. Furthermore, the platform was consisted with six block systems according to the function and the interface and designed to flexibly mount or modify the additional functions. For a basic design of the data exchange method and protocols, a prototype was constructed by using the spatial information web service technology. The portal service system to visualize and provide spatial data was designed by the WMS/WFS type of OGC standard interface and the FTP/HTTP interface type through open source GIS software for server environment.

• International Journal of Aeronautical and Space Sciences
• /
• v.6 no.1
• /
• pp.44-51
• /
• 2005

To provide more accurate and reliable positioning and timing services to Korean nationwide users, the Ministry of Maritime Affairs and Fisheries of Korea is implementing Korean NDGPS (Nationwide DGPS), which is operational partly. And it also has a plan to construct WADGPS (Wide Area Differential GPS) system using sites and equipments of the NDGPS reference stations. For that, Seoul National University GNSS Laboratory is implementing and testing prototypes of WRS (Wide-area Reference Station) and WMS (Wide-area Master Station). Until now, because there are not enough installed WRSs to be used for computing wide area correction information, we cannot test algorithms of WMS with the data processed actually in WRSs. Therefore to evaluate the performance of the algorithms, we made a MATLAB program which can process RINEX (Receiver INdependent Exchange) format data with WADGPS algorithm. Using that program which consists of WRS, WMS and USER modules, we processed the data collected at NDGPS reference stations, which are saved in RINEX format. In WRS module, we eliminate the atmospheric delay error from the pseudorange measurement, smooth the measurement by hatch filter and calculate pseudorange corrections for each satellite. WMS module collects the processed data from each reference stations to generate the wide area correction information including estimated satellite ephemeris errors, ionospheric delays at each grid point, UDRE (User Differential Range Error), GIVE (Grid Ionosphere Vertical Error) and so on. In USER part, we use the measurements of reference stations as those of users and estimate the corrected users' positions and protection levels (HPL, VPL). With the results of estimation, we analyzed the performance of the algorithms. We assured the estimated UDRE /GIVE values and the protection levels bound the corresponding errors effectively. In this research, we can expect the possible performance of WADGPS in Korea, and the developed modules will be useful to implementation and improvement of the algorithms.

• KIISE Transactions on Computing Practices
• /
• v.21 no.3
• /
• pp.183-191
• /
• 2015

Recent developments in IT have made real-time ECG monitoring possible, and this represents a promising application for the emerging HL7 standard for the exchange of clinical information. However, applying the HL7 standard directly to real-time ECG monitoring causes problems, because the partial duplication of data within an HL7 message increases the amount of data to be transmitted, and the time taken to process it. We reduce these overheads by Feature Scaling, by standardizing the range of independent variables or features of data, while nevertheless generating HL7-compliant messages. We also use a De-Duplication algorithm to eliminate the partial repetition of the OBX field in an HL7 ORU message. Our strategy shortens the time required to create messages by 51%, and reduces the size of messages by 1/8, compared to naive HL7 coding.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.10
• /
• pp.1912-1918
• /
• 2016

MPTCP(Multipath Transmission Control Protocol) is able to compose many TCP paths when two hosts connect and the data is able to be transported through these paths simultaneously. When a new path is added, the authentication between both hosts is necessary to check the validity of host. So, MPTCP exchanges a key when initiating an connection and makes a token by using this key for authentication. However the original MPTCP is vulnerable to MITM(Man In The Middle) attacks because the key is transported in clear text. Therefore, we applied a ECDH(Elliptic Curve Diffie-Hellman) key exchange algorithm to original MPTCP and replaced the original key to the ECDH public key. And, by generating the secret key after the public key exchanges, only two hosts is able to make the token using the secret key to add new subflow. Also, we designed and implemented a method supporting encryption and decryption of data using a shared secret key to apply confidentiality to original MPTCP.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.4C
• /
• pp.581-593
• /
• 2004

The interest in wireless LAN security is on the increase owing to a role of high-speed wireless Internet infrastructure of wireless LAN. Wi-Fi has released WPA standard in order to overcome drawbacks of WEP algorithm that is security element of current IEEE 802.11-based wireless LAN system. Pairwise key management and group key management in a mixed-mode which supports both terminals running WPA and terminals running original WEP security are very complicate. In this paper, we analyze flaws in WPA authenticator key management state machine for key distribution and propose the countermeasures to overcome the analyzed problems. Additionally, WPA authenticator key management state machine to which the solutions are applied is described. The reconstructed WPA authenticator key management state machine helps the AP perform efficiently group key exchange and group key update in the mixed-mode.