• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.8
• /
• pp.5550-5558
• /
• 2015

Recently, fuel cell with high energy efficiency and low CO2 emission is energetically interconnected with power system. Especially, FCGS(Fuel Cell Generation System) which usually operates at high temperature, is being developed and installed in the form of large scale system. However, it is reported that power system disturbances related to surge, harmonic and EMI have caused several problems such as malfunction of protection device and damage of control device in the large scale FCGS. In order to solve these problems, this paper presents a modeling of operation characteristics of FCGS by PSCAD/EMTDC, ETAP, P-SIM software. And also, this paper proposes countermeasure algorithms to prevent power system disturbances. From the simulation results, it is confirmed that the proposed algorithm is useful method for the stable operation of large scale FCGS.

• Journal of KIISE:Software and Applications
• /
• v.34 no.1
• /
• pp.1-10
• /
• 2007

This paper proposes a new indexing mechanism for MPEG-7 visual descriptors, especially Dominant Color and Contour Shape descriptors, that guarantees an efficient similarity search for the multimedia database whose visual meta-data are represented with MPEG-7. Since the similarity metric used in the Dominant Color descriptor is based on Gaussian mixture model, the descriptor itself could be transform into a color histogram in which the distribution of the color values follows the Gauss distribution. Then, the transformed Dominant Color descriptor (i.e., the color histogram) is indexed in the proposed indexing mechanism. For the indexing of Contour Shape descriptor, we have used a two-pass algorithm. That is, in the first pass, since the similarity of two shapes could be roughly measured with the global parameters such as eccentricity and circularity used in Contour shape descriptor, the dissimilar image objects could be excluded with these global parameters first. Then, the similarities between the query and remaining image objects are measured with the peak parameters of Contour Shape descriptor. This two-pass approach helps to reduce the computational resources to measure the similarity of image objects using Contour Shape descriptor. This paper also proposes two integration schemes of visual descriptors for an efficient retrieval of multimedia database. The one is to use the weight of descriptor as a yardstick to determine the number of selected similar image objects with respect to that descriptor, and the other is to use the weight as the degree of importance of the descriptor in the global similarity measurement. Experimental results show that the proposed indexing and integration schemes produce a remarkable speed-up comparing to the exact similarity search, although there are some losses in the accuracy because of the approximated computation in indexing. The proposed schemes could be used to build a multimedia database represented in MPEG-7 that guarantees an efficient retrieval.

• Journal of KIISE:Software and Applications
• /
• v.32 no.12
• /
• pp.1283-1291
• /
• 2005

One of the problems in boosting Java performance using a Just-in-Time (JIT) compiler is removing redundant array bound checks. In conventional static compilers, many powerful algorithms have been developed, yet they are not directly applicable to JIT compilation where the compilation time is part of the whole running time. In the current JIT compilers, we tan use either a naive algorithm that is not powerful enough or an aggressive algorithm which requires the transformation into a static single assignment (SSA) form of programs (and back to the original form after optimization), thus causing too much overhead not appropriate for JIT compilation This paper proposes a new algorithm based on an inequality graph which can eliminate array bounds check codes aggressively without resorting to the SSA form. When we actually perform this type of optimization, there are many constraints in code motion caused by the precise exception rule in Java specification, which would cause the algorithm to miss many opportunities for eliminating away bound checks. We also propose a new method to overcome these constraints.

• KIPS Transactions on Software and Data Engineering
• /
• v.9 no.10
• /
• pp.317-322
• /
• 2020

Due to the development of artificial intelligence, it is used as a disaster response support system in the field of disaster. Disasters can occur anywhere, anytime. In the event of a disaster, there are four types of reports: fire, rescue, emergency, and other call. Disaster response according to the 119 call also responds differently depending on the type and situation. In this paper, 1280 data set of 119 calls were tested with 3 classes of SVM, NB, k-NN, DT, SGD, and RF situation classification algorithms using a training data set. Classification performance showed the highest performance of 92% and minimum of 77%. In the future, it is necessary to secure an effective data set by disaster in various fields to study disaster response.

• Journal of KIISE:Software and Applications
• /
• v.32 no.6
• /
• pp.554-569
• /
• 2005

In the semistructured distributed documents, it is very difficult to formalize and implement the query processing system due to the lack of structure and rule of the data. In order to precisely retrieve and process the heterogeneous semistructured documents, it is required to handle multiple mappings such as 1:1, 1:W and W:1 on an element simultaneously and to generate the schema from the distributed documents. In this paper, we have proposed an query processing algorithm for querying and answering on the heterogeneous semistructured data or documents over distributed systems and implemented with a metadata interface. The algorithm for generating local queries from the global query consists of mapping between g1oba1 and local nodes, data transformation according to the mapping types, path substitution, and resolving the heterogeneity among nodes on a global input query with metadata information. The mapping, transformation, and path substitution algorithms between the global schema and the local schemas have been implemented the metadata interface called DBXMI (for Distributed Documents XML Metadata Interface). The nodes with the same node name and different mapping or meanings is resolved by automatically extracting node identification information from the local schema automatically. The system uses Quilt as its XML query language. An experiment testing is reported over 3 different OEM model semistructured restaurant documents. The prototype system is developed under Windows system with Java and JavaCC compiler.

• KIPS Transactions on Software and Data Engineering
• /
• v.7 no.5
• /
• pp.177-188
• /
• 2018

The scale of graph data has been increased rapidly because of the growth of mobile Internet applications and the proliferation of social network services. This brings upon the imminent necessity of efficient distributed and parallel graph processing approach since the size of these large-scale graphs are easily over a capacity of a single machine. Currently, there are two popular parallel graph processing approaches, vertex-centric graph processing and block centric processing. While a vertex-centric graph processing approach can easily be applied to the parallel processing system, a block-centric graph processing approach is proposed to compensate the drawbacks of the vertex-centric approach. In these systems, the initial quality of graph partition affects to the overall performance significantly. However, it is a very difficult problem to divide the graph into optimal states at the initial phase. Thus, several dynamic load balancing techniques have been studied that suggest the progressive partitioning during the graph processing time. In this paper, we present a load balancing algorithms for the block-centric graph processing approach where most of dynamic load balancing techniques are focused on vertex-centric systems. Our proposed algorithm focus on an improvement of the graph partition quality by dynamically reassigning blocks in runtime, and suggests block split strategy for escaping local optimum solution.

• Journal of KIISE:Software and Applications
• /
• v.33 no.8
• /
• pp.718-729
• /
• 2006

There has been increasing interest in automatic term recognition (ATR), which recognizes technical terms for given domain specific texts. ATR is composed of 'term extraction', which extracts candidates of technical terms and 'term selection' which decides whether terms in a term list derived from 'term extraction' are technical terms or not. 'term selection' is a process to rank a term list depending on features of technical term and to find the boundary between technical term and general term. The previous works just use statistical features of terms for 'term selection'. However, there are limitations on effectively selecting technical terms among a term list using the statistical feature. The objective of this paper is to find effective features for 'term selection' by considering various aspects of technical terms. In order to solve the ranking problem, we derive various features of technical terms and combine the features using machine-learning algorithms. For solving the boundary finding problem, we define it as a binary classification problem which classifies a term in a term list into technical term and general term. Experiments show that our method records 78-86% precision and 87%-90% recall in boundary finding, and 89%-92% 11-point precision in ranking. Moreover, our method shows higher performance than the previous work's about 26% in maximum.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.5 s.305
• /
• pp.173-180
• /
• 2005

In this paper, we proposed the image hiding method which decreases calculation amount by encrypt partial data using discrete wavelet transform(DWT) and linear scale quantization which were adopted as the main technique for frequency transform in JPEG2000 standard. Also we used the chaotic system and cat map which has smaller calculation amount than other encryption algorithms and then dramatically decreased calculation amount. This method operates encryption process between quantization and entropy coding for preserving compression ratio of images and uses the subband selection method. Also, suggested encryption method to JPEG2000 progressive transmission. The experiments have been performed with the Proposed methods implemented in software for about 500 images. Consequently, we are sure that the proposed is efficient image encryption methods to acquire the high encryption effect with small amount of encryption. It has been shown that there exits a relation of trade-off between the execution time and the effect of the encryption. It means that the proposed methods can be selectively used according to the application areas.

• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.3
• /
• pp.145-154
• /
• 2016

Because of the recent interest in the u-Health and development of IT technology, a need of utilizing a medical information data has been increased. Among previous studies that utilize various data mining algorithms for processing medical information data, there are studies of association rule analysis. In the studies, an association between the symptoms with specified diseases is the target to discover, however, infrequent terms which can be important information for a disease diagnosis are not considered in most cases. In this paper, we proposed a new association rule mining system considering the importance of each term using TF-IDF weight to consider infrequent but important items. In addition, the proposed system can predict candidate diagnoses from medical text records using term similarity analysis based on medical ontology.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• v.1
• /
• pp.235-240
• /
• 2006

The paper will give an overview of the mission of GalTeC and then concentrate on two main aspects. The first more detailed aspect, is the analysis of the key performance parameters for the Galileo system services and presenting a technical overview of methods and algorithms used. The second more detailed aspect, is the service volume prediction including service dimensioning using the Prediction tool. In order to monitor and validate the Galileo SIS performance for Open Service (OS) and Safety Of Life services (SOL) regarding the key performance parameters, different analyses in the SIS domain and User domain are considered. In the SIS domain, the validation of Signal-in-Space Accuracy SISA and Signal-in-Space Monitoring Accuracy SISMA is performed. For this purpose first of all an independent OD&TS and Integrity determination and processing software is developed to generate the key reference performance parameters named as SISRE (Signal In Space Reference Errors) and related over-bounding statistical information SISRA (Signal In Space Reference Accuracy) based on raw measurements from independent sites (e.g. IGS), Galileo Ground Sensor Stations (GSS) or an own regional monitoring network. Secondly, the differences of orbits and satellite clock corrections between Galileo broadcast ephemeris and the precise reference ephemeris generated by GalTeC will also be compared to check the SIS accuracy. Thirdly, in the user domain, SIS based navigation solution PVT on reference sites using Galileo broadcast ephemeris and the precise ephemeris generated by GalTeC are also used to check key performance parameters. In order to demonstrate the GalTeC performance and the methods mentioned above, the paper presents an initial test result using GPS raw data and GPS broadcast ephemeris. In the tests, some Galileo typical performance parameters are used for GPS system. For example, the maximum URA for one day for one GPS satellite from GPS broadcast ephemeris is used as substitution of SISA to check GPS ephemeris accuracy. Using GalTeC OD&TS and GPS raw data from IGS reference sites, a 10 cm-level of precise orbit determination can be reached. Based on these precise GPS orbits from GalTeC, monitoring and validation of GPS performance can be achieved with a high confidence level. It can be concluded that one of the GalTeC missions is to provide the capability to assess Galileo and general GNSS performance and prediction methods based on a regional and global monitoring networks. Some capability, of which first results are shown in the paper, will be demonstrated further during the planned Galileo IOV phase, the Full Galileo constellation phase and for the different services particularly the Open Services and the Safety Of Life services based on the Galileo Integrity concept.