• Journal of Korean Institute of Industrial Engineers
• /
• v.20 no.3
• /
• pp.3-14
• /
• 1994

In this study, two reliability computational algorithms which respectively utilize a factoring method are proposed for a system represented by reliability block diagram. First, vertex factoring algorithm is proposed. In this algorithm, a reliability block diagram is considered as a network graph with vertex reliabilities. Second algorithm is mainly concerned with conversion of a reliabilities block diagram into a network graph with edge reliabilities. In this algorithm, the independence of edges is preserved by eliminating replicated edges, and in computing the reliability of a converted network graph, existing edge factoring algorithm is applied. The efficiency of two algorithms are compared for example systems with respect to computing times. The results shows that the second algorithm is shown to be more efficient than the first algorithm.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.49 no.6
• /
• pp.316-321
• /
• 2000

In this paper, we proposed MBDD(Modified Binary Decision Diagram) as a multi-level logic synthesis method and a vertex of MBDD to NMOS transistors matching. A vertex in MBDD is matched to a set of NMOS transistors. MBDD structure can be achieved through transformation steps from BDD structure. MBDD can represent the same function with less vertices less number of NMOS transistors, consequently capacitance of the circuit can be reduced. Thus the power dissipation can be reduced. We applied MBDD to a full odder and a 4-2compressor. Comparing the 4-2compressor block with other synthesis logic, 31.2% reduction and 19.9% reduction was achieved in numbers of transistors and power dissipation respectively. In this simulation we used 0.8 ${\mu}{\textrm}{m}$ fabrication parameters.

• Journal of the Korean Society for Precision Engineering
• /
• v.25 no.1
• /
• pp.160-170
• /
• 2008

Shape morphing is the process of transforming a source shape, through intermediate shapes, into a target shape. Two main problems to be considered in three dimensional shape morphing are vertex correspondence and path interpolation. In this paper, an approach which uses the linear interpolation of the Laplacian coordinates of the source and target meshes is introduced for the determination of more plausible path when two topologically identical shapes are morphed. When two shapes to be morphed are different in shape and topology, a new method which combines shape deformation theory based on Laplacian coordinate and mean value coordinate with distance field theory is proposed for the efficient treatment of vertex correspondence and path interpolation problems. The validity and effectiveness of the suggested method was demonstrated by using it to morph large and complex polygon models including male and female whole body models.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.9B
• /
• pp.1775-1784
• /
• 1999

This paper proposes a method of removing unnecessary hidden nodes by a new cost function that evaluates the variance and the mean of hidden node outputs during training. The proposed cost function makes necessary hidden nodes be activated and unnecessary hidden nodes be constants. We can remove the constant hidden nodes without performance degradation. Using the CEDAR handwritten digit recognition, we have shown that the proposed method can remove the number of hidden nodes up to 37.2%, with higher recognition rate and shorter learning time.

• Journal of Industrial Convergence
• /
• v.20 no.12
• /
• pp.195-202
• /
• 2022

Underground Geospatial Information Map Management System(UGIMMS) integrates various underground facilities in the underground space into 3D mesh data, and supports to check the 3D image and location of the underground facilities in the mobile app. However, there is a problem that it takes a long time to run in the app because various underground facilities can exist in some areas executed by the app and can be seen layer by layer. In this paper, we propose a deep learning-based K-means vertex clustering algorithm as a method to reduce the execution time in the app by reducing the size of the data by reducing the number of vertices in the 3D mesh data within the range that does not cause a problem in visibility. First, our proposed method obtains refined vertex feature information through a deep learning encoder-decoder based model. And second, the method was simplified by grouping similar vertices through K-means vertex clustering using feature information. As a result of the experiment, when the vertices of various underground facilities were reduced by 30% with the proposed method, the 3D image model was slightly deformed, but there was no missing part, so there was no problem in checking it in the app.

• The Journal of Korean Academy of Prosthodontics
• /
• v.42 no.2
• /
• pp.167-174
• /
• 2004

Statement of problem: Removable partial denture and complete denture often require denture base relines to improve the fit against the tissue-bearing mucosa because of gradual changes in edentulous ridge contours and resorption of underlying bone structure. Purpose: This study was performed to investigate the effect of surface design on bond strength of relining denture base resins to denture base acrylic resin. Materials and method: Heat curing resin(Lucitone 199, Dentsply U.S.A. and Vertex, Dentimex, Holland), self curing resin(Tokuso rebase, Tokuyama, Japan), and visible light curing resin(Triad, Dentsply, U.S.A.) were used in this study. The surface designs were classified as butt, bevel and rabbet joint and the bond strengths were measured by Universial Testing Machine (Zwick 2020, Zwick Co., Germany). Results and Conclusion: The obtained results from this study were as follows ; 1. The bond strength of Vertex resin was higher than those of Tokuso rebase and Triad. 2. The bond strength of rabbet and bevel joint was higher than that of butt joint. 3. The failure mode of Triad and Tokuso rebase was mainly adhesive, but cohesive failure was shown mainly in vertex.

• Journal of Korea Multimedia Society
• /
• v.18 no.12
• /
• pp.1562-1568
• /
• 2015

The 3D contents are getting more attentions in various areas, such as in movies, advertising, games and exhibition contents. There are many authoring tools for making 3D Models and contents. However, those authoring tools take considerable amount of time to learn and to make 3D contents. In this paper, we propose the 3D model conversion algorithm to make 3D models from 2D pictures drawn on the touch screens or papers. The vertex animation method also proposed for the interactive 3D aquarium. The proposed vertex animation algorithm was tested for virtual 3D water creatures and compared with human-made animation. An Interactive 3D aquarium was implemented by using those proposed algorithms. Thus the simplicity and effectiveness of the algorithms can be applied to diverse industries.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.6
• /
• pp.141-148
• /
• 2005

Simplification of 3D models is becoming necessary with popularity of 3D graphics over mobile or the internet channels with limited channel capacity. Surfaces of a 3D model are usually approximated by a series of triangular meshes, and vertex contraction method is employed widely to minimize the deviation from the original model. Determination of the best position after contraction depends on the calculation of simplification error. We propose a new measure for computing the error so that the simplified model represents the original faithfully. We demonstrate the improved results with real 3D models.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.15 no.2
• /
• pp.112-123
• /
• 1990

This paper presents a vertex-detecting of Hanguel patterns using nested contour shape. Inputed binary character patterns are transformed by distance transformation method and make a new file of transferred data by analysis of charactersitcs. A new vertex-detecting algorithm for recognizing Hanguel patterns using the two data files is proposed. This algorithm is able to reduce the projecting parts of Hanguel pattern, separate the connecting parts between different strokes, set the code number by transformed value of coorked features. It makes the output of results in order to apply the Hanguel recognition.

• Nuclear Engineering and Technology
• /
• v.54 no.3
• /
• pp.1016-1023
• /
• 2022

In proton therapy, a highly conformal proton dose can be delivered to the tumor by means of the steep distal dose penumbra at the end of the beam range. The proton beam range, however, is highly sensitive to range uncertainty, which makes accurately locating the proton range in the patient difficult. In-vivo range verification is a method to manage range uncertainty, one of the promising techniques being prompt gamma imaging (PGI). In earlier studies, we proposed gamma electron vertex imaging (GEVI), and constructed a proof-of-principle system. The system successfully demonstrated the GEVI imaging principle for therapeutic proton pencil beams without scanning, but showed some limitations under clinical conditions, particularly for pencil beam scanning proton therapy. In the present study, we upgraded the GEVI system in several aspects and tested the performance improvements such as for range-shift verification in the context of line scanning proton treatment. Specifically, the system showed better performance in obtaining accurate prompt gamma (PG) distributions in the clinical environment. Furthermore, high shift-detection sensitivity and accuracy were shown under various range-shift conditions using line scanning proton beams.