• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1994.10a
• /
• pp.217-222
• /
• 1994

This paper describes the determination of optimal initial billet size for axisymmetric cold forging products using neural networks. The determination of optimal initial billet size is very important in forging design and forming sequence design, because the result of such designs and forming load can be different by variable initial billet sizes. The forming difficulty has been defined as the degree of difficulty in forming by 3 process ' forward extrusion, backward extrusion and upsetting. By neural networks a forming difficulty can be determined with the ratio of shape and forming process. From the graph of maximum, minimum, and average forming difficulties by variable billet sizes, the optimal billet size can be determined. The initial billets of a solid part and a hollow part whichwas determined by this study are compared with the sequence drawing generated by the one of forming sequence design system.

• Kyungpook Mathematical Journal
• /
• v.55 no.2
• /
• pp.279-287
• /
• 2015

A subset S of V (G), where G is a graph without isolated vertices, is a double dominating set of G if for each $x{{\in}}V(G)$, ${\mid}N_G[x]{\cap}S{\mid}{\geq}2$. This paper, shows that any positive integers a, b and n with $2{\leq}a<b$, $b{\geq}2a$ and $n{\geq}b+2a-2$, can be realized as domination number, double domination number and order, respectively. It also characterize the double dominating sets in the Cartesian and tensor products of two graphs and determine sharp bounds for the double domination numbers of these graphs. In particular, it show that if G and H are any connected non-trivial graphs of orders n and m respectively, then ${\gamma}_{{\times}2}(G{\square}H){\leq}min\{m{\gamma}_2(G),n{\gamma}_2(H)\}$, where ${\gamma}_2$, is the 2-domination parameter.

• Proceedings of the KIEE Conference
• /
• 1988.07a
• /
• pp.591-594
• /
• 1988

A three-step heuristic algorithm for PLA column folding and row folding of column-folded PLA is presented, which is significantly faster than the earlier works and provides nearly optimal results. The three steps are i) min-cut partition of vertices in the column (or row) intersection graph, ii) determination of products' order using Fiduccia's min-net cut algorithm, and iii) head-tail pairing for column folding, while some heuristics are proposed for deciding row folding pairs. The time complexity of this algorithm is O($n^{2}$log n) compared to the O($n^{3}$) - O($n^{4}$) of the earlier works.$^[2][3][9]$ For a test PLA with 23 inputs, 19 outputs and 52 products, the number of column folding pairs obtained using this algorithm is 20 which is optimal, as compared to 17 in a previous work.

• Korean Journal of Mathematics
• /
• v.25 no.2
• /
• pp.279-301
• /
• 2017

An L(3, 2, 1)-labeling for the graph G = (V, E) is an assignment f of a label to each vertices of G such that ${\mid}f(u)-f({\upsilon}){\mid}{\geq}4-k$ when $dist(u,{\upsilon})=k{\leq}3$. The L(3, 2, 1)-labeling number, denoted by ${\lambda}_{3,2,1}(G)$, for G is the smallest number N such that there is an L(3, 2, 1)-labeling for G with span N. In this paper, we compute the L(3, 2, 1)-labeling number ${\lambda}_{3,2,1}(G)$ when G is a cylindrical grid, which is the cartesian product $P_m{\Box}C_n$ of the path and the cycle, when $m{\geq}4$ and $n{\geq}138$. Especially when n is a multiple of 4, or m = 4 and n is a multiple of 6, then we have ${\lambda}_{3,2,1}(G)=11$. Otherwise ${\lambda}_{3,2,1}(G)=12$.

• Journal of Internet of Things and Convergence
• /
• v.8 no.2
• /
• pp.55-59
• /
• 2022

Recently, IoT technology has great attention and plays a key role in 4^th industrial revolution in order to design customized products and services. Additive Manufacturing (AM) is applied to fabricate IoT sensor directly or IoT sensor embedded structure. Also, design methods for AM are developing to consolidate various parts of IoT devices. Part consolidation leads to assembly time and cost reduction, reliability improvement, and lightweight. Therefore, a design method was proposed to guide designers to consolidate parts. The design method helps designers to define product architecture that consists of functions and function-part relations. The product architecture is converted to a network graph and then Girvan Newman algorithm is applied to cluster the graph network. Parts in clusters are candidates for part consolidation. To demonstrate the usefulness of the proposed design method, a case study was performed with e-bike fabricated by additive manufacturing.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.18 no.6
• /
• pp.1269-1276
• /
• 2023

Crop estimation is essential for the multinational meal and powerful demand due to its numerous aspects like soil, rain, climate, atmosphere, and their relations. The consequence of climate shift impacts the farming yield products. We operate the dataset with temperature, rainfall, humidity, etc. The current research focuses on feature selection with multifarious classifiers to assist farmers and agriculturalists. The crop yield estimation utilizing the feature selection approach is 96% accuracy. Feature selection affects a machine learning model's performance. Additionally, the performance of the current graph classifier accepts 81.5%. Eventually, the random forest regressor without feature selections owns 78% accuracy and the decision tree regressor without feature selections retains 67% accuracy. Our research merit is to reveal the experimental results of with and without feature selection significance for the proposed ten algorithms. These findings support learners and students in choosing the appropriate models for crop classification studies.

• Journal of the Korean Wood Science and Technology
• /
• v.8 no.1
• /
• pp.22-27
• /
• 1980

Quantitative assessment of edge blunting of saw-teeth was carried out by TALYSURF. 1. Using the following equation, the real shape of a saw-tooth can be traced on the graph of TALYSURF. ${\frac{{\Delta}h}{h}}={\frac{V{\Delta}_x}{V_x}}$ {${\Delta}h$: vertical distance of stylus h: vertical distance in chart $V{\Delta}_x$: Velocity of stylus $V_x$: velocity of chart} 2. As shown on Fig 2, the error from stylus itself can be calculated by following equation. i) 13.8${\mu}{\leqq}$x<20.4${\mu}$ y=-0.2246x+4.59${\mu}$ ii) 0${\leqq}$x<13.8${\mu}$ y=${\sqrt{(-18{\mu})^2-x^2}}-1.42x+32.7{\mu}}$ 3. The relationship between profile of saw-tooth and error from stylus itself can be calculated by following equation. $E(%)=\frac{f(r){\times}{\frac{4}{18{\mu}}}}{f(R){\times}{\frac{R}{18.5{\mu}}}-f(r){\times}{\frac{r}{18{\mu}}}}{\times}100$ {E(%)${\frac{error\;of\;stylus}{dullness\;of\;saw\;tooth}}{\times}100$ r: radius of stylus tip R: radius of tip which is drawn in graph of talysurf f(r) : error of stylus f(R) : dullness of tip which is drawn in graph of talysurf} 4. The graph of maximum error and profile of saw-tooth was parabola.

• Journal of the Korean Data and Information Science Society
• /
• v.21 no.4
• /
• pp.621-628
• /
• 2010

Quality assurance data is used to develop the strategy of the product since it is valuable for reliability assessment of the product. However, manufacturers don't take into account the life of the product but just produce WCR (Warranty Call Rate) which is monthly or quarterly claims per 1000 products in terms of table or graph. In this study we will consider how they analyse that kind of data and suggest an appropriate type of analysis which incorporates the life time of the product. Finally we emphasize that the appropriate type of analysis has to be merged into the.

• Journal of the Korean Data and Information Science Society
• /
• v.25 no.4
• /
• pp.893-901
• /
• 2014

A certain number of products are sold each month and some of them are returned for repair. In this study both return rate and cumulative return rate are shown on the graph to show the general trend of how many products are returned as time goes by. Next this type of summary data can be considered as a conglomeration of both left and right censored data. So reliability analysis is attempted for this type of summary data. Lastly, left censored data can be traced to find the exact time period during which the product has been claimed. In that case the left censored data can be taken as failure data. So similar type of reliability analysis is attempted for the resulting right censored data.

• Korean Journal of Computational Design and Engineering
• /
• v.5 no.3
• /
• pp.276-284
• /
• 2000

Usual practice of the transformation of a B-spline curve into a set of piecewise polynomial curves in a power form is done by either a knot refinement followed by basis conversions or applying a Taylor expansion on the B-spline curve for each knot span. Presented in this paper is a new algorithm, called a direct expansion algorithm, for the problem. The algorithm first locates the coefficients of all the linear terms that make up the basis functions in a knot span, and then the algorithm directly obtains the power form representation of basis functions by expanding the summation of products of appropriate linear terms. Then, a polynomial segment of a knot span can be easily obtained by the summation of products of the basis functions within the knot span with corresponding control points. Repeating this operation for each knot span, all of the polynomials of the B-spline curve can be transformed into a power form. The algorithm has been applied to both static and dynamic curves. It turns out that the proposed algorithm outperforms the existing algorithms for the conversion for both types of curves. Especially, the proposed algorithm shows significantly fast performance for the dynamic curves.