• Korean Journal of Food Science and Technology
• /
• v.37 no.2
• /
• pp.304-307
• /
• 2005

Multiresidue method was set up for the simultaneous determination of various residual pesticides in potatoes and carrots, which was analyzed by gas chromatography-electron capture detector/nitrogen phosphorus detector. Method consisted with acetone/acetonitrile (9 : 1) extraction and dichloromethane partition, followed by florisil cartridge purification with hexane/dichloromethane/acetonitrile (50 : 45 ; 5) elution. Among 197 pesticides (194 kinds) spiked to food materials, 143 and 155 pesticides were recovered over 70% on potatoes and carrots, respectively. Nineteen pesticides including bromacil, cyproconazole, were not detected in water and sample matrices. Matrix components may affect the low detections of 25 pesticides such as benfuracarb, bitertanol from potatoes and 16 pesticides such as bitertanol, carbosulfan from Carrots. Some pesticides including dichlobenil, fluoroimide and iprodione were highly detected from one or both matrices even though they were not detected from water.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.13 no.11
• /
• pp.5379-5388
• /
• 2012

In fuzzy modeling for nonlinear process, the fuzzy rules are typically formed by selection of the input variables, the number of space division and membership functions. The Generation of fuzzy rules for nonlinear processes have the problem that the number of fuzzy rules exponentially increases. To solve this problem, complex nonlinear process can be modeled by generating the fuzzy rules by means of fuzzy division of input space. Therefore, in this paper, rules of non-fuzzy inference systems are generated by partitioning the input space in the scatter form using HCM clustering algorithm. The premise parameters of the rules are determined by membership matrix by means of HCM clustering algorithm. The consequence part of the rules is represented in the form of polynomial functions and the consequence parameters of each rule are identified by the standard least-squares method. And lastly, we evaluate the performance and the nonlinear characteristics using the data widely used in nonlinear process. Through this experiment, we showed that high-dimensional nonlinear systems can be modeled by a very small number of rules.

• Journal of the Korean Electrochemical Society
• /
• v.3 no.1
• /
• pp.57-62
• /
• 2000

Sulfonated Polysulfone (SPSF) cation-exchange membranes were synthesized by introducing various ratio of chlorosulfuric acid (CSA) onto the main chain of polysulfone (PSF). Properties such as ion exchange capacity, water content, liked ion concentration, and partition coefficient were measured, respectively. Through the analysis of DSC and TGA, it has been shown that glass transition temperature increased and weight loss decreased as sulfuric acid group concentration increased. Structure of membrane measured by AFM and SEM was seen to be asymmetric. Apparent diffusion coefficient of sodium ions through SPSF membrane by AC impedance was increased as sulfuric acid group concentration increased.

• KIEAE Journal
• /
• v.10 no.3
• /
• pp.89-96
• /
• 2010

In comparison with ordinary or heavy-weight concrete, light-weight air void concrete has the good aspects in optimizing super tall structure systems for the process of design considering wind load and seismic load by lightening total dead load of buildings and reducing natural resources used. Light-weight air void concrete has excellent properties of heat and sound insulating due to its high amount porosity of air voids. So, it has been used as partition walls and the floor of Ondol which is the traditional Korean floor heating system. Under the condition of which the supply of light-weight aggregates are limited, the development of light-weight concrete using air voids is highly required in the aspects of reduced manufacturing prices and mass production. In this study, we investigated the physical properties and thermal behaviors of specimens that applied different mixing ratios of foaming agent to evaluate the possibility of use in the structural elements. We proposed the estimating equation for compressive strength of each mix having different ratio of foaming agent. We also confirmed that the density of cement matrix is decreased as the mixing amount of foaming agent increase up to 0.6% of foaming agent mixing ratio which was observed by SEM. Based on porosity and compressive strength of control mortar without foaming agent, we built the estimating equations of compressive strength for mortars with foaming agent. The upper limit of use in foaming agent is about 0.6% of the binder amount. Each air void is independent, and size of voids range from 50 to $100{\mu}m$.

• Journal of the Korean Society of Clothing and Textiles
• /
• v.10 no.3
• /
• pp.37-48
• /
• 1986

The purpose of this study was to analyze 'the natural groupings' of subjects in order to classify highly similar somatotype for clothing construction. The sample for the study was drawn randomly out of senior high school boys in Seoul urban area. The sample size was 425 boys between age 16 and 18. Cluster analysis was more concerned with finding the hierarchical structure of subjects by three dimensional distance of stature. bust girth and sleeve length. The groups forming a partition can be subdivided into 5 and 6 sets by the hierarchical tree of the given subjects. Ward's Minimum Variance Method was applied after extraction of distance matrix by the Standardized Euclidean Distance. All of the above data was analyzed by the computer installed at Korea Advanced Institute of Science and Technology. The major findings, take for instance, of 16 age group can be summarized as follows. The results of cluster analysis of this study: 1. Cluster 1 (32 persons means $18.29\%$ of the total) is characterized with smaller bust girth than that of cluster 5, but stature and sleeve length of the cluster 1 are the largest group. 2. Cluster 2 (18 Persons means $10.29\%$ of the total) is characterized with the group of the smallest stature and sleeve length, but bust girth larger than that of cluster 3. 3. Cluster 3(35persons means $20\%$ of the total) is classified with the smallest group of all the stature, bust girth and sleeve length. 4. Cluster 4(60 persons means $34.29\%$ of the total) is grouped with the same value of sleeve length with the mean value of 16 age group, but the stature and bust girth is smaller than the mean value of this age group. 5. Cluster 5(30 persons means $17.14\%$ of the total) is characterized with smaller stature than that of cluster 1, and with larger bust girth than that of cluster 1, but with the same value of the sleeve length with the mean value of the 16 age group.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.4
• /
• pp.1712-1731
• /
• 2016

In this paper, we propose a novel saliency detection framework via multiple random walks (MRW) which simulate multiple agents on a graph simultaneously. In the MRW system, two agents, which represent the seeds of background and foreground, traverse the graph according to a transition matrix, and interact with each other to achieve a state of equilibrium. The proposed algorithm is divided into three steps. First, an initial segmentation is performed to partition an input image into homogeneous regions (i.e., superpixels) for saliency computation. Based on the regions of image, we construct a graph that the nodes correspond to the superpixels in the image, and the edges between neighboring nodes represent the similarities of the corresponding superpixels. Second, to generate the seeds of background, we first filter out one of the four boundaries that most unlikely belong to the background. The superpixels on each of the three remaining sides of the image will be labeled as the seeds of background. To generate the seeds of foreground, we utilize the center prior that foreground objects tend to appear near the image center. In last step, the seeds of foreground and background are treated as two different agents in multiple random walkers to complete the process of salient object detection. Experimental results on three benchmark databases demonstrate the proposed method performs well when it against the state-of-the-art methods in terms of accuracy and robustness.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.5 no.4
• /
• pp.224-231
• /
• 2012

In this paper, we introduce a fuzzy inference systems based on fuzzy c-means clustering algorithm for fuzzy modeling of nonlinear process. Typically, the generation of fuzzy rules for nonlinear processes have the problem that the number of fuzzy rules exponentially increases. To solve this problem, the fuzzy rules of fuzzy model are generated by partitioning the input space in the scatter form using FCM clustering algorithm. The premise parameters of the fuzzy rules are determined by membership matrix by means of FCM clustering algorithm. The consequence part of the rules is expressed in the form of polynomial functions and the coefficient parameters of each rule are determined by the standard least-squares method. And lastly, we evaluate the performance and the nonlinear characteristics using the data widely used in nonlinear process.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2
• /
• pp.426-436
• /
• 2000

Given a linear arrangement of n base stations which generate multiple types of traffic among themselves, we consider the problem of finding a set of disjoint clusters to cover n base statons so that a cluster is assigned a location server. Our goal is to minimize the total communication cost for the entire network where the cost of intra-cluster communication is usually lower than that of intercluster communication for each type of traffic. The optimization problem is transformed into an equivavalent problem using the concept of relative cost, which generates the difference of communication costs between intracluster and intercluster communications. Using the relative cost matrix, an efficient algorithm of O($mm^2$), where m is the number of clusters in a partition, is designed by dynamic programming. The algorithm also finds all thevalid partitions in the same polynomial time, given the size constraint on a cluster, and the total allowable communication cost for the entire network.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.3
• /
• pp.640-654
• /
• 1996

This paper presents a synthesis method for multi-level Reed-Muller circuits using BDDs(Binary Decision Diagrams). The existing synthesis tool for Reed circuits, FACTOR, is not appropriate to the synthesis of large circuits because it uses matrix (map-type) to represent given logic functions, resulting in the exponential time and space in number of imput to the circuits. For solving this problems, a syntheisis method based on BDD is presented. Using BDDs, logic functions are represented compactly. Therefor storage spaces and computing time for synthesizing logic functions were greatly decreased, and this technique can be easily applied to large circuits. Using BDD representations, the proposed method extract best patterns to minimize multi-level Reed Muller circuits with good performance in area optimization and testability. Experimental results using the proposed method show better performance than those using previous methods〔2〕. For large circuits of considering the best input partition, synthesis results have been improved.

• KIPS Transactions on Software and Data Engineering
• /
• v.8 no.10
• /
• pp.411-420
• /
• 2019

Camera model identification has been a subject of steady study in the field of digital forensics. Among the increasingly sophisticated crimes, crimes such as illegal filming are taking up a high number of crimes because they are hard to detect as cameras become smaller. Therefore, technology that can specify which camera a particular image was taken on could be used as evidence to prove a criminal's suspicion when a criminal denies his or her criminal behavior. This paper proposes a deep learning model to identify the camera model used to acquire the image. The proposed model consists of four convolution layers and two fully connection layers, and a high pass filter is used as a filter for data pre-processing. To verify the performance of the proposed model, Dresden Image Database was used and the dataset was generated by applying the sequential partition method. To show the performance of the proposed model, it is compared with existing studies using 3 layers model or model with GLCM. The proposed model achieves 98% accuracy which is similar to that of the latest technology.