• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.26 no.1
• /
• pp.39-46
• /
• 2015

In this paper, a gas sensor using a modified $90^{\circ}$ hybrid coupler structure with conducting polymer which operates at 2.4 GHz is represented. Conducting polymers are used to the gas sensing material in proposed sensors. The conducting polymer varies its electrical property, such as work function and conductivity corresponding to the certain gas. To verify this variation of electrical property of conducting polymer at microwave frequencies, the conducting polymer is incorporated with the $90^{\circ}$ hybrid coupler structure, and this proposed sensor operates as reflection type variable attenuator and variable phase shifter. The conducting polymer is employed as impedence-variable transmission lines that cause a impedance mismatching between the general transmission line and conducting polymer. The experiment was conducted with 100 ppm ethanol gas at temperature of $28^{\circ}C$ and relative humidity of 85 %. As a result, the amplitude deviation of $S_{21}$ is 0.13 dB and the frequency satisfying ${\angle}S_{21}=360^{\circ}$ is shifted about 2.875 MHz.

• 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.

• Fire Science and Engineering
• /
• v.29 no.2
• /
• pp.79-83
• /
• 2015

The fire accident is a representative type of disaster that can largely impact on business. Therefore, precautionary measures and rapid initial response is very important when a disaster occurs. The storage of porous combustibles is inevitable in coal yard, plywood processing industry, and others that are currently operating. Initial fire fighting of fire and identifying the ignition point in such a porous combustible storage space are so difficult that if the initial response is failed, being led to deep-seated fire, surface fire is likely to result in secondary damage. In addition, deep-seated fire can cause personal injuries and property damage due to a large amount of toxic gases and reignition. Therefore damage reduction measures is required around the storage space to handle a porous flammable. Improving the penetration performance of the concentration of the surfactant is carried out as underlying study, which is about an deep-seated fire extinguishing efficiency augmentation when using wetting agents. The porous materials used in the experiments is radiata pine wood flour, which occupies more than 75% of the domestic wood market. Fire fighting water is selected as Butyl Di Glycol (BDG), which is being used for infiltration extinguishing agent, and the experiment was carried out by producing a standard solution. The experiment was carried out on the basis of the Deep-Seated Fire Test of NFPA 18. The amount of watering, porous material to the internal amount of penetration, and runoff measurement out of the porous material was conducted. According to experimental results, as the surface tension is reduced, the surfactant concentration macroscopic penetration rate decreases, but infiltration to a porous material is shown to have growth characteristics.

• The Journal of the Korea Contents Association
• /
• v.14 no.9
• /
• pp.529-537
• /
• 2014

To establish a foundation to objectively interpret Chosun history, we construct people network of the Chosun dynasty. The network shows scale free network properties as if most social networks do. The people network is composed of 1,379 nodes and 3,874 links and its diameter is 14. To analysis of the network dynamics, whole network that is composed of 27 king networks were constructed by adding the first king, Taejo network to the second king, Jeongjong network and then continuously adding the next king networks. Interestingly, betweenness and closeness centralities were gradually decreased but stress centrality was drastically increased. These results indicate that information flow is gradually slowing and hub node position is more centrally oriented as growing the network. To elucidate key persons from the network, k-core and MCODE algorithms that can extract core or module structures from whole network were employed. It is a possible to obtain new insight and hidden information by analyzing network dynamics. Due to lack of the dynamic interacting data, there is a limit for network dynamic research. In spite of using concise data, this research provides us a possibility that annals of the Chosun dynasty are very useful historical data for analyzing network dynamics.

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

Web services on the Internet are not always reliable in terms of service availability and performance. Dynamic service coordination capability of a system or an application invoking Web services is essential to cope with such unreliable situations. In dynamic service coordination, if a Web service does not respond within a specific time constraint, it is replaced with another Web service at run time for reliable invocation of Web services. In this paper, we develop an exception based dynamic service coordination framework for Web services. In the framework, all necessary information for dynamic service coordination is explicitly specified and summarized as a set of attributes. Then classes and workflows, supporting dynamic service coordination and invoking Web services, are automatically created based on these attributes. Developers of Web services client programs can make the invocations of Web services reliable by calling the methods of the classes. Some performance loss has been observed in the indirect invocation of a Web service. However, when we consider the flexibility and reliability gained from the method, the performance loss would be acceptable in many cases.

• Journal of KIISE:Computing Practices and Letters
• /
• v.11 no.3
• /
• pp.209-215
• /
• 2005

Conventional ORDBMS vendors provide extension mechanisms for adding user-defined types and functions to their own DBMSs. Here, the extension mechanisms are implemented using a high-level interface. We call this technique loose-coupling. The advantage of loose-coupling is that it is easy to implement. However, it is not preferable for implementing new data types and operations in large databases when high Performance is required. In this paper, we propose to use the notion of tight-coupling to satisfy this requirement. In tight-coupling, new data types and operations are integrated into the core of the DBMS engine. Thus, they are supported in a consistent manner with high performance. This tight-coupling architecture is being used to incorporate information retrieval(IR) features and spatial database features into the Odysseus/IR ORDBMS that has been under development at KAIST/AITrc. In this paper, we introduce Odysseus/IR and explain its tightly-coupled IR features (U.S. patented). We then demonstrate a web search engine that is capable of managing 20 million web pages in a non-parallel configuration using Odysseus/IR.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.24 no.1
• /
• pp.1-6
• /
• 2014

In this study, we propose optimized RBFNNs based on night vision face recognition simulator with the aid of $(2D)^2$ PCA algorithm. It is difficult to obtain the night image for performing face recognition due to low brightness in case of image acquired through CCD camera at night. For this reason, a night vision camera is used to get images at night. Ada-Boost algorithm is also used for the detection of face images on both face and non-face image area. And the minimization of distortion phenomenon of the images is carried out by using the histogram equalization. These high-dimensional images are reduced to low-dimensional images by using $(2D)^2$ PCA algorithm. Face recognition is performed through polynomial-based RBFNNs classifier, and the essential design parameters of the classifiers are optimized by means of Differential Evolution(DE). The performance evaluation of the optimized RBFNNs based on $(2D)^2$ PCA is carried out with the aid of night vision face recognition system and IC&CI Lab data.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.24 no.1
• /
• pp.46-51
• /
• 2014

The most important process of engineering system optimal design is to identify the relationship between the design variables and system response. In case of the system optimization, Response Surface Method (RSM) is widely used. The optimization process of RSM generates the design space using the typical alternative candidates and finds the optimal design point in the generated design space. By changing the optimal point depending on the configuration of the design space, it is important to generate the design space. Therefor in this study, the design space is generated by using the relationship between design variables and system response based on Neuro-Response Surface Method (NRSM). And I try to construct the framework for optimal shape design based on NRSM that the optimum shape can be predicted using the Non-dominated Sorting Genetic Algorithm-II (NSGA-II) within the generated design space. In order to verify the usefulness of the constructed framework, we applied the nonlinear mathematical function problem. In this study, we can solve the constraints of time in the optimization process for the engineering problem and effective to determine the optimal design was possible. by using the generated framework for optimal shape design based on NRSM. In the future research, we try to apply the optimization problem for Naval Architectural & Ocean Engineering based on the results of this study.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.25 no.5
• /
• pp.515-521
• /
• 2015

The SymMerge algorithm is an efficient merging algorithm for input sequences u and v of sizes $\left|u \right|=m$ and $\left|v \right|=n$, $m{\leq}n$. We consider complexity analysis for SymMerge algorithm regarding to the required number of comparisons. The focus of the previous complexity analysis was on finding the values of upper bounds, i.e. showing the asymptotical optimality. In this paper, in a different way from the previous complexity analysis, we show that the overall required number of comparisons for two representative special cases "symmetric case" and "maximum spanning case" can be calculated exactly i.e. the least upper bounds regarding to the required number of comparisons are calculated. Symmerge requires exactly $m\;log\frac{n}{m}+4m-logm-3$ comparisons for symmetric case of sizes $m=2^k,\;n=2^l,l{\geq}k$ of input sequences and exactly $\frac{1}{2}m^2+(m+1)logm-\frac{3}{2}m+2$ comparisons for maximum spanning case of sizes $m=2^k,n=2^m-m$ of input sequences. Additionally we show that the complexity of the Symmerge algorithm regarding to the overall required number of comparisons for these special cases can be defined by recurrence relations.

• Journal of Digital Convergence
• /
• v.18 no.3
• /
• pp.163-169
• /
• 2020

A smart key has been used in a variety of embedded environments and there also have been attacks from a remote place by amplifying signals at a location of a user. Existing studies on defence techniques suggest multiple sensors and hash functions to improve authentication speed; these, however, increase the electricity usage and the probability of type 1 error. For these reasons, I suggest an embedded security controller based on client authentication and user movement information improving the authentication method between a controller and a host device. I applied encryption algorithm to the suggested model for communication using an Arduino board, GPS, and Bluetooth and performed authentication through path analysis utilizing user movement information for the authentication. I found that the change in usability was nonsignificant when performing actions using the suggested model by evaluating the time to encode and decode. The embedded security controller in the model can be applied to the system of a remote controller for a two-wheeled vehicle or a mobile and stationary host device; in the process of studying, I found that encryption and decryption could take less then 100ms. The later study may deal with protocols to speed up the data communication including encryption and decryption and the path data management.