• Journal of Industrial Technology
• /
• v.15
• /
• pp.23-32
• /
• 1995

The methodology of automatic generation of tool path for rough cutting of a sculptured surface is proposed with the improved contouring method, unequal level line machining. Considering the surface shape and the diameter of the endmill, the distance between level lines is obtained. To improve MMR, initial rough cutting is processed with the large diameter endmill and the remained material is removed by the relatively small diameter endmill. Tool path is generated from the offset curve of respective level line and the interferences between the tool and workpiece are automatically avoided. After generating NC part program, the sculptured surface is machined at the vertical machining center. From the experimental results, total cutting length and machining time are reduced more effectively than conventional contouring methods.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.32 no.4
• /
• pp.192-202
• /
• 2009

Disassembly of products at their end-of-life (EOL) is a prerequisite for recycling or remanufacturing, since most products should be disassembled before being recycled or remanufactured as secondary parts or materials. In disassembly sequence planning of EOL products, considered are the uncertainty issues, i.e., defective parts or joints in an incoming product, disassembly damage, and imprecise net profits and costs. The paper deals with the problem of determining the disassembly level and corresponding sequence, with the objective of maximizing the overall profit under uncertainties in disassembly cost and/or revenue. The solution is represented as the longest path on a directed acyclic graph where parameter (arc length) uncertainties are modeled in the form of intervals. And, a heuristic algorithm is developed to find a path with the minimum worst case regret, since the problem is NP-hard. Computational experiments are carried out to show the performance of the proposed algorithm compared with the mixed integer programming model and Conde's heuristic algorithm.

• Smart Media Journal
• /
• v.7 no.2
• /
• pp.9-14
• /
• 2018

The k-ary n-cube $Q^k_n$ is widely used in the design and implementation of parallel and distributed processing architectures. It consists of $k^n$ identical nodes, each node having degree 2n is connected through bidirectional, point-to-point communication channels to different neighbors. On $Q^k_n$ we would like to transmit packets from a source node to 2n destination nodes simultaneously along paths on this network, the $i^{th}$ packet will be transmitted along the $i^{th}$ path, where $0{\leq}i{\leq}2n-1$. In order for all packets to arrive at a destination node quickly and securely, we present an $O(n^3)$ routing algorithm on $Q^k_n$ for generating a set of one-to-many node-disjoint and nearly shortest paths, where each path is either shortest or nearly shortest and the total length of these paths is nearly minimum since the path is mainly determined by employing the Hungarian method.

• Nuclear Engineering and Technology
• /
• v.53 no.11
• /
• pp.3764-3771
• /
• 2021

Based on the convolutional neural network (CNN), a novel technique is investigated for lost gamma source detection in a room. The CNN is trained with the result of a GEANT4 simulation containing a gamma source inside a meshed room. The dataset for the training process is the deposited energy in the meshes of different n-step paths. The neural network is optimized with parameters such as the number of input data and path length. Based on the proposed method, the place of the gamma source can be recognized with reasonable accuracy without human intervention. The results show that only by 5 measurements of the energy deposited in a 5-step path, (5 sequential points 50 cm apart within 1600 meshes), the gamma source location can be estimated with 94% accuracy. Also, the method is tested for the room geometry containing the interior walls. The results show 90% accuracy with the energy deposition measurement in the meshes of a 5-step path.

• Current Optics and Photonics
• /
• v.5 no.6
• /
• pp.617-626
• /
• 2021

A parallel Monte Carlo photon migration algorithm for graphics processing units that implements an improved load-balancing strategy is presented. Conventional parallel Monte Carlo photon migration algorithms suffer from a computational bottleneck due to their reliance on a simple load-balancing strategy that does not take into account the different length of the mean free paths of the photons. In this paper, path-partition load balancing is proposed to eliminate this computational bottleneck based on a mathematical formula that parallelizes the photon path tracing process, which has previously been considered non-parallelizable. The performance of the proposed algorithm is tested using three-dimensional photon migration simulations of a human skin model.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.6C
• /
• pp.614-622
• /
• 2006

In this paper, we propose an efficient packetization method to reduce the packetization overhead. For the purpose, we firstly verify the relationship between packet length and packet loss rate. The empirical results show that as the packet length is larger than the path MTU, the packet loss rate is drastically increased, producing poor visual quality at the receiver side. However, as the length of the packet is reduced, we should transmit more packets per frame and the packetization overhead will be increased. This increase in the packetization overhead reduces the number of bits allocated to the video data, resulting in the low visual quality. Therefore, each packet should be packetized to have the packet length close to the path MTU. In this paper, we show that the this process of the packetization with the constraint on the packet length is very similar to the dynamic storage allocation in the operating system. We had thoroughly surveyed the dynamic storage allocation methods used in the recent operating systems and propose to use the allocation methods for the video packetization. We empirically show that the proposed method can reduce the packetization overhead upto 28.3%, compared with the conventional sequential packetization method which have been widely used in Internet video transmission.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.29 no.9
• /
• pp.65-70
• /
• 2015

Minimal line length enables low-cost construction of the transmission lines and low-loss transportation of electric power. This paper presents a derivation to determine the coordinate and length of the straight line that minimally connects two perpendicular lines x-axis and y-axis via a specific point, using the optimization technique. The author shows a formula to obtain the minimal length, which is represented by the cube root of the coordinate given by the specific point. Case studies have been also discussed to prove the optimal solutions derived by the proposed formula.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1996.04a
• /
• pp.264-270
• /
• 1996

In this paper, a computer automated system has been developed for measuring the focal length of camera lens using the MTF(Modurar Transfer Function) based on the signal processing around a line CCD and autocollimator. An optical Path for the focal length measurement system has been designed around thelight sourec, collimator, camera, mirror and the line CCD. The eyepiece of the collimator is replaced byline CCD, and the mirror is moved along the focal axis by a PC driven step motor. An efficient method has been designed for finding the optimum MTF value for the focal length based on the least squares approach. The developed system is fullycomputer automated: signal transmission to and from the camera, MTF evaluation based on the line CCD, step motor contorl, etc. The developed system has been applied to a practical camera manufacturing process and demonstrated its performance

• Proceedings of the Optical Society of Korea Conference
• /
• 1989.02a
• /
• pp.113-118
• /
• 1989

By using the single mode optical fiber, we fabricated Fiber-optic Fabry-Perot interferometer (FFPI). The change over a wide range in the optical path length of a FFPI is observed. The temporal movement of the interference fringes by external condition to P.Z. T) is converted to circular motion on an oscilloscope display and then recorded with a micro-computer. The two output voltages of the D/A converters are applied to X and Y terminals of oscilloscope to display circular motion on oscilloscope. Thus the direction of phase shift can be determined with observing the direction of circular motion. The variation of the optical length can be measured by calculating the angle of spot of circle with an accuracy of λ/90 wave length due to variation of temperature in this system 2.7x10-4$^{\circ}C$.

• Journal of the Korean Society for Precision Engineering
• /
• v.21 no.4
• /
• pp.39-47
• /
• 2004

In mold machining, there are many concave machining regions where chatter and tool deflection occur since MRR(material removal rate) increases as curvature increases even though cutting speed and depth of cut are constant. Boolean operation between stock and tool model is widely used to compute MRR in NC milling simulation. In finish cutting, the side step is reduced to about 0.3mm and tool path length is sometimes over loom, so Boolean operation takes long computation time and includes much error if the resolution of stock and tool model is larger than the side step. In this paper, curvature of CL (cutter location) surface and side step of tool path is used to compute the feedrate for constant MRR machining. The data structure of CL surface is Z-map generated from NC tool path. The algorithm to get local curvature from discrete data was developed and applied to compute local curvature of CL surface. The side step of tool path was computed by point density map which includes cutter location point density at each grid element. The feedrate computed from curvature and side step is inserted to new tool path to regulate MRR. The resultants were applied to feedrate optimization system which generates new tool path with feedrate from NC codes for finish cutting. The system was applied to the machining of speaker and cellular phone mold. The finishing time was reduced to 12.6%, tool wear was reduced from 2mm to 1.1mm and chatter marks and over cut on corner were reduced, compared to the machining by constant feedrate. The machining time was shorter to 17% and surface quality and tool was also better than the conventional federate regulation using curvature of the tool path.