• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 1999.05a
• /
• pp.53-57
• /
• 1999

본 논문에서는 입출력간의 연관관계가 트리구조로 표현되는 DTG(Directed tree graph)에 의한 고속병렬다치논리회로를 설계하는 알고리즘과 DTG의 각 절점에 코드를 할당하는 알고리즘을 제안한다. 임의의 절점을 갖는 DTG에 대하여 본 논문에서는 절점들이 매개변수에 의하여 표현될 때 양의 정수로 표현되도록 논리레벨 P를 할당하고 각 레벨에 각기 다른 잉여절점을 추가하여 회로를 설계한다. 또한, 절점들의 입출력 관계를 단지 하나의 매개변수 m$_{i}$를 이용하여 전달행렬 A를 구하기 때문에 더 빠르고 간단하게 회로를 설계할 수 있다. 본 논문에서 제안한 알고리즘은 Nakajima 등에 의해 제안된 알고리즘으로는 설계가 가능하지 않았던 임의의 절점을 가지는 DTG에 대해서도 회로를 설계할 수 있는 장점이 있다. 또한, 자연수 내에서 선형성, 정규성, 및 가시적인 장점을 가지며 절점수의 감소를 통한 처리속도의 향상, 회로 구성의 간략화 및 비용절감등의 장점등이 있다.

• Journal of Sensor Science and Technology
• /
• v.26 no.6
• /
• pp.397-401
• /
• 2017

A DC resistance type humidity sensor using conductive carbon ink was fabricated and its performance was evaluated. The humidity sensor was fabricated using a screen printing technique and have a structure that does not require additional metal electrodes to measure resistance change. To evaluate the performance of the humidity sensor, we measured the DC resistance change under various relative humidity levels. The fabricated humidity sensor showed a resistance change of about $2.5{\sim}50k{\Omega}$ in 11 ~ 95% RH environment. It also shows a linear relationship in the relative humidity versus log DC resistance graph. In comparison with commercial humidity sensor under real environment, it can be confirmed that the resistance of the humidity sensor changes to almost the same level as the measured humidity. These results show that the resistance type humidity sensor can be operated stably in actual environment.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.20 no.1
• /
• pp.7-14
• /
• 1983

Linear feature such as lines and curves are one of important features in image processing. In this paper, new method of linear feature detection is suggested. Also, we have studied approximation technique which transforms detected linear feature into data structure for the practical. This method is based on graph theory and principle of this method is based on minimal spanning tree concept which is widely used in edge linking process. By postprocessing, Hairs and inconsistent line segments are removed. To approximate and describe traced linear feature, piecewise linear approximation is adapted. The algorithm is demonstrated through computer simulations.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.8 no.3
• /
• pp.210-216
• /
• 1984

An investigation of the effects of the size of mixing region determined by changing the position of fuel injection has been carried out. Measurements were made: the distribution of temperature and concentration profiles of the stable gas species, nitrogen oxide and total hydrocarbon in the flames. The results of this investigation show that variations of the size of mixing region produce major changes to the three type flow fields which significantly influence pollutant (NO, CO and THC) formation and energy release.

• Proceedings of the KSME Conference
• /
• 2008.11a
• /
• pp.625-630
• /
• 2008

In the manufacturing industries, viewing CAE analysis results is frequently required during the product development process for design verification. CAE data which include all related information of an analysis is, however, not efficiently shared among designers because CAE data size is in general large to deal with. In order to increase collaboration among designers this paper introduces the development of a CAE visualization system based on JT format exploiting for a large model visualization with a scene graph-based toolkit. Since CAE analysis results and JT format have different structure we developed a translator to convert the CAE result in binary format to the JT format. To show the effectiveness of JT format in showing the CAE result we also developed a prototype viewer offering basic functions provided by commercial systems. By using JT format we are able not only to reduce the size of analysis results, but to store a series of analysis results with several LOD in a data file.

• Journal of the Korean Mathematical Society
• /
• v.50 no.6
• /
• pp.1199-1211
• /
• 2013

We introduce a new class of graphs, called quasi $m$-Cayley graphs, having good symmetry properties, in the sense that they admit a group of automorphisms G that fixes a vertex of the graph and acts semiregularly on the other vertices. We determine when these graphs are strongly regular, and this leads us to define a new algebro-combinatorial structure, called quasi-partial difference family, or QPDF for short. We give several infinite families and sporadic examples of QPDFs. We also study several properties of QPDFs and determine, under several conditions, the form of the parameters of QPDFs when the group G is cyclic.

• Journal of Contemporary Eastern Asia
• /
• v.14 no.2
• /
• pp.87-96
• /
• 2015

Social media comprises a vast and consequential landscape that has been poorly mapped and understood. Hundreds of millions of people have eagerly moved many of the conversations and discussions that compose civil society into these services and platforms. There is a need to document and analyze these social spaces for many academic and commercial purposes. The Social Media Research Foundation has engaged a strategy to cultivate better research into the structure and dynamics of social media. The foundation is dedicated to the creation of open tools, open data, and open scholarship related to social media. It has implemented a free and open network collection, analysis, and visualization tool called NodeXL to facilitate social media network research. Using NodeXL a group of researchers has collectively authored a publicly available archive, called the NodeXL Graph Gallery, composed of network data sets and visualizations from users around the world. This site has enabled the aggregation of tens of thousands of network datasets and images. Use of the archive has led to scholarly research results that are based on the wide range and scope of social media data sets available.

• Journal of Power System Engineering
• /
• v.9 no.4
• /
• pp.202-208
• /
• 2005

The genetic algorithm (GA) which is one of the popular optimum algorithm has been used to solve a variety of optimum problems. Because it need not require the gradient of objective function and is easier to find global solution than gradient-based optimum algorithm using the gradient of objective function. However optimum method using the GA and the finite element method (FEM) takes many computational time to solve the optimum structural design problem which has a great number of design variables, constraints, and system with many degrees of freedom. In order to overcome the drawback of the optimum structural design using the GA and the FEM, the author developed a computer program which can optimize frame structures by using the GA and the generalized transfer stiffness coefficient method. In order to confirm the effectiveness of the developed program, it is applied to optimum design of plane frame structures. The computational results by the developed program were compared with those of iterative design.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 1997.04a
• /
• pp.211-216
• /
• 1997

The mode localization phenomenon in non-periodic multispan beam is theoretically investigated. When localization occurs, the free vibration amplitude of a normal mode becomes confined to a local region of the structure. It is well known that the weakly coupled periodic structures are sensitive to certain types of periodicity-breaking disorder, resulting in the mode localization. The results of this study indicate that the mode localization occurs also in nonperiodic structures and the degrees of mode localization of some modes are very sensitive to system parameters. Free vibration analysis of simply supported two-span beams of arbitrary span lengths is performed. Degrees of mode localization and their sensitivities to system parameters are appraised by considering the characteristic graph and the structural line defined in this study first.

• Journal of Internet Computing and Services
• /
• v.2 no.4
• /
• pp.55-67
• /
• 2001

Commercial machine translation systems have been announcing recently, However, there are problems that the systems have shown mistranslations, yet. Among these mistranslations, this paper is interested in the mistakes of tense processing. The paper compares Korean tenses with 12 English ones: present. past, future, present perfect. past perfect, future perfect. present progressive, past progressive, future progressive, present perfect progressive, past perfect progressive. future perfect progressive. Next, we perform the meaning analysis of Korean tenses. Then we describe the structure of the tenses based on Conceptual Graph(CG). In the experiment. the paper implements the program that translates sentences included in the tenses into CG.