• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2003.06a
• /
• pp.1643-1646
• /
• 2003

Drawing is a mechanical operation that attenuates thick material to an appropriate thickness for the next processing or end usage. When the input material has the form of a bundle or bundles made of very thin and long shaped wire or fibers, this attenuation operation is called "bundle drawing" or "drafting" Drafting is being used widely in manufacturing staple yarns. which is indispensable for the textile industry. However, the bundle processed by this operation undertake more or less defects in the evenness of linear density. Such irregularities cause many problems not only for the product quality but also for the efficiency of the next successive processes. Since long there have been many researches tying to find out factors affecting the irregularity of linear desity, to obtain optimal drafting conditions, to develop efficient measuring and analysis methods of linear density of bundle, etc., but there exists yet no fundamental equation describing the dynamic behavior of the flowing bundle during processing. In this research a mathematical model for the dynamic behavior of the bundle fluid is to be set up on the basis of general physical lows representing physical variables, i.e. linear density and velocity as the dynamic state of bundle. The conservation of mass and momentum balance was applied to the fluid field of bundle. while the movement of′ individual material was taken into account. The constitutive model relating the surface force and the deformation of bundle was introduced by considering a representative prodedure that stands for the bundle movement. Then a fundamental equations system could be simplified considering a steady state of the process. On the basis of the simplified model, the simulation was performed and the results could be confirmed by the experiments under various conditions.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.4
• /
• pp.27-33
• /
• 2019

The min-cut problem that decides the maximum flow in a complex network flows from source(s) to sink(t) is known as a hard problem. The augmenting path algorithm divides into single path and decides the bottleneck point(edge), but the min-cut section to be decide additionally. This paper suggests O(n) time complexity heuristic greedy algorithm for the number of vertices n that applies free agent system in a pro-sports field. The free agent method assumes $N_G(S),N_G(T)$vertices among $v{\in}V{\backslash}\{s,t\}$to free agent players, and this players transfer into the team that suggest more annual income. As a result of various networks, this algorithm can be finds all of min-cut sections and min-cut value for whole cases.