• Proceedings of the KIEE Conference
• /
• 1988.07a
• /
• pp.315-318
• /
• 1988

THE STUDY ABOUT CHARACTERISTICS OF PHOTO RESIST ITSELF (MINIMUM RESOLUTION, DEPTH OF FOCUS MARGIN AND CRITICAL DIMENSION CONTROL LATITUDE) WAS DONE AND REPORTED. THREE TYPES OF PHOTO RESISTS WERE TESTED. THE FIRST IS THE LOW MOLECULAR WEIGHT PHOTO-RESIST SHOWING THE NARROW DISTRIBUTION OF MOLECULAR WEIGHT (LOW MOLECULAR WEIGHT CONTROL TYPE), THE SECOND IS A PHOTO-RESIST CONTAINING THE INNER CONTRAST ENCHANCEMENT MATERIAL (INNER CEM TYPE) AND THE THIRD IS A NORMAL PHOTO-RESIST (HIGH MOLECULAR WEIGHT TYPE). THE INNER CEM TYPE AND THE LOW MOLECULAR WEIGHT CONTROL TYPE PHOTO-RESIST ARE MORE IMPROVED PHOTO-RESISTS. IT PROVED THAT THE MINIMUM RESOLUTION WAS IMPROVED BY 0.2 - 0.3 um, THE DEPTH OF FOCUS MARGIN WAS IMPROVED BY 0.8 - 1.2 um AND THE C.D. CONTROL LATITUIDE WAS IMPROVED.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.6
• /
• pp.165-173
• /
• 2012

Given a connected, weighted, and undirected graph, the Minimum Spanning Tree (MST) should have minimum sum of weights, connected all vertices, and without any cycle taking place. Borůvka Algorithm is firstly suggested as an algorithm to evaluate the MST, but it is not widely used rather than Prim and Kruskal algorithms. Borůvka algorithm selects the Minimum Weight Edge (MWE) from each vertex with distinct weights in $1^{st}$ stage, and selects the MWE from each MSF (Minimum Spanning Forest) in $2^{nd}$ stage. But the cycle check and the number of MSF in $1^{st}$ stage and $2^{nd}$ stage are difficult to implication by computer program even if it is easy to verify visually. This paper suggests the generalized Borůvka Algorithm, This algorithm selects all of the same MWEs for each vertex, then checks the cycle and constructs MSF for ascending sorted MWEs. Kruskal method bring into this process. if the number of MSF greats then 1, this algorithm selects MWE from ascending sorted inter-MSF edges. The generalized Borůvka algorithm is verified its application by being applied to the 7 graphs with the many minimum weights or distinct weight edges for any vertex. As a result, the generalized Borůvka algorithm is less required for cycle verification then the Kruskal algorithm. Therefore, the generalized Borůvka algorithm is more fast to obtain MST then Kruskal algorithm.

• Korean Journal of Mathematics
• /
• v.17 no.4
• /
• pp.385-397
• /
• 2009

We study codes over the polynomial ring ${\mathbb{F}}_q[D]$ and their projections to the finite rings ${\mathbb{F}}_q[D]/(D^m)$ and the weight enumerators of self-dual codes over these rings. We also give the formula for the number of codewords of minimum weight in the projections.

• The KIPS Transactions:PartA
• /
• v.18A no.5
• /
• pp.215-224
• /
• 2011

In this paper, a mechanism connecting all weighted migration routes with minimum cost with EGOSST is proposed. Weighted migration routes may be converted to weighted input edges considered as not only traces but also traffics or trip frequencies of moving object on communication lines, roads or railroads. Proposed mechanism can be used in more wide and practical area than mechanisms considering only moving object traces. In our experiments, edge number, maximum weight for input edges, and detail level for grid are used as input parameters. The mechanism made connection cost decrease average 1.07% and 0.43% comparing with the method using weight minimum spanning tree and weight steiner minimum tree respectively. When grid detail level is 0.1 and 0.001, while each execution time for a connecting solution increases average 97.02% and 2843.87% comparing with the method using weight minimum spanning tree, connecting cost decreases 0.86% and 1.13% respectively. This shows that by adjusting grid detail level, proposed mechanism might be well applied to the applications where designer must grant priority to reducing connecting cost or shortening execution time as well as that it can provide good solutions of connecting migration routes with weights.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.2
• /
• pp.35-42
• /
• 2014

This paper suggests a method that obtains the minimum spanning tree (MST) far more easily and rapidly than the present ones. The suggested algorithm, firstly, simplifies a graph by means of reducing the number of edges of the graph. To achieve this, it applies a method of eliminating the maximum weight edge if the valency of vertices of the graph is equal to or more than 3. As a result of this step, we can obtain the reduced edge population. Next, it applies a method in which the maximum weight edge is eliminated within the cycle. On applying the suggested population minimizing and maximum weight edge deletion algorithms to 9 various graphs, as many as the number of cycles of the graph is executed and MST is easily obtained. It turns out to lessen 66% of the number of cycles and obtain the MST in at least 2 and at most 8 cycles by only deleting the maximum weight edges.

• Journal of Korea Game Society
• /
• v.20 no.1
• /
• pp.13-22
• /
• 2020

This study is about the VR controller that can provide an enhanced experience in VR by augmenting the sense of weight. In this study, the method of changing the center of gravity of the controller was used as a means of transmitting the sense of weight. The experiment was carried out with a device that could change the center of gravity to find the minimum distance at which people can perceive the difference in weight. The results showed that the weight difference between the two stimuli can be perceived at a distance of about 5 cm regardless of the position of the starting stimulus.

• Journal of the Korean Society for Precision Engineering
• /
• v.22 no.3 s.168
• /
• pp.146-153
• /
• 2005

In this paper, a multi-step optimization using genetic algorithm with variable penalty function is introduced to the structural design optimization of a grinding machine. The design problem, in this study, is to find out the optimum configuration and dimensions of structural members which minimize the static compliance, the dynamic compliance, and the weight of the machine structure simultaneously under several design constraints such as dimensional constraints, maximum deflection limit, safety criterion, and maximum vibration amplitude limit. The first step is shape optimization, in which the best structural configuration is found by getting rid of structural members that have no contributions to the design objectives from the given initial design configuration. The second and third steps are sizing optimization. The second design step gives a set of good design solutions having higher fitness for lightweight and minimum static compliance. Finally the best solution, which has minimum dynamic compliance and weight, is extracted from the good solution set. The proposed design optimization method was successfully applied to the structural design optimization of a grinding machine. After optimization, both static and dynamic compliances are reduced more than 58.4% compared with the initial design, which was designed empirically by experienced engineers. Moreover the weight of the optimized structure are also slightly reduced than before.

• Journal of the Society of Naval Architects of Korea
• /
• v.47 no.4
• /
• pp.598-605
• /
• 2010

The structural design of oil tankers and bulk carriers should be performed based on the Common Structural Rules(CSR) which were recently established by the International Association Classification Societies(IACS). At first, in the structural design viewpoint, the scantling and hullweight based on the CSR should be compared with those of existing rules, and then a minimum weight/cost design should be performed by considering the variation of the number of web and the material property. In this study, the optimum web space and material property will be proposed by performing a minimum weight/cost design of a large oil tanker, and the results will be compared with those of existing ship. The longitudinal members are determined by SeaTrust-Holdan developed by the Korean Register of Shipping(KR), and the transverse members are determined by NASTRAN and PULS.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.45 no.4
• /
• pp.100-106
• /
• 2008

In this paper we apply a discriminative weight training employing power spectral flatness measure (PSFM) to a statistical model-based voice activity detection (VAD) in various noise environments. In our approach, the VAD decision rule is expressed as the geometric mean of optimally weighted likelihood ratio test (LRT) based on a minimum classification error (MCE) method which is different from the previous works in th at different weights are assigned to each frequency bin and noise environments depending on PSFM. According to the experimental results, the proposed approach is found to be effective for the statistical model-based VAD using the LRT.

• The Journal of the Acoustical Society of Korea
• /
• v.26 no.5
• /
• pp.194-198
• /
• 2007

In this paper, we apply a discriminative weight training to a statistical model-based voice activity detection(VAD). In our approach, the VAD decision rule is expressed as the geometric mean of optimally weighted likelihood ratios(LRs) based on a minimum classification error(MCE) method which is different from the previous works in that different weights are assigned to each frequency bin which is considered more realistic. According to the experimental results, the proposed approach is found to be effective for the statistical model-based VAD using the LR test.