• Transactions of Materials Processing
• /
• v.7 no.5
• /
• pp.489-495
• /
• 1998

Spinning is a chipless forming method for producing axially symmetric parts by using axial-radial motions of a spinning roller. This process has still some advantages in such a view point that a variety of complex shapes which can not be formed in a press can be easily spun at a low cost although it is one of the oldest forming methods for spinning mainly cookware parts for a long time. This study is to investigate the optimum roller path in order to obtain the maximum spinnability in producing cylindrical cups of Aluminum(A1050-H16) sheet metal. Working conditions applicable to any size of blank were predetermined through preliminary spinning tests. 9 types of roller path were proposed and experiments were carried out. The modified involute curve was shown to give the maximum drawing ration and more uniform quality of spun cups as compared with other results of this study. in addition thickness distribution and dimensional accuracy of spun cups were examined and discussed.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.23 no.59
• /
• pp.1-10
• /
• 2000

The traveling salesman problem is a representative NP-Complete problem. It needs lots of time to get a solution as the number of city increase. So, we need an efficient heuristic algorithm that gets good solution in a short time. Almost edges that participate in optimal path have somewhat low value cost. This paper discusses the property of nearest neighbor and 3-opt. This paper uses nearest neighbor's property to select candidate edge. Candidate edge is a set of edge that has high probability to improve cycle path. We insert edge that is one of candidate edge into intial cycle path. As two cities are connected. It does not satisfy hamiltonian cycle's rule that every city must be visited and departed only one time. This paper uses 3-opt's method to sustain hamiltonian cycle while inserting edge into cycle path. This paper presents a highly efficient heuristic algorithm verified by numerous experiments.

• The KSFM Journal of Fluid Machinery
• /
• v.15 no.5
• /
• pp.32-36
• /
• 2012

The positive displacement pump and the regenerative pump are widely used in the range of low specific speed, $n_s{\leq}100$[rpm, m3/min, m]. The positive displacement pump is not suitable for miniaturization and operation in high rotational speed. The regenerative pump has a problem with large leakage flow and low efficiency. While the centrifugal pump has advantages of high efficiency, miniaturization and high rotational speed, efficiency drops sharply with decrease in specific speed. Therefore the purpose of this study is to design a new type of centrifugal pump that has advantages of centrifugal pumps in operation in low specific speed. The name of this new type of pump was called 'Pipe type centrifugal pump', since the flow path through the impeller is simple circular pipe. Due to the simple shape of impeller, the manufacturing process is simple and cost is low. There is strong jet flow at the outlet of the impeller. This jet induces flow path loss, meridional dynamic pressure loss and mixing loss. Large disk friction makes the efficiency be limitted in the range of low specific speed. Even though the loss and the low efficiency, 'Pipe type centrifugal pump' represents stable performance, affordable pressure ratio and efficiency better than that of other low specific speed pumps.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.05a
• /
• pp.197-200
• /
• 2011

Many routing protocols have been proposed for low-power and ad-hoc networks where energy awareness and reliability are essential design issues. This paper proposes a dynamic routing protocol for low-power and ad-hoc networks. A dynamic path cost function is defined considering the constraints and characteristics of low-power and ad-hoc networks. The cost function can be applied flexibly depending on the characteristics of the networks. The performance of the proposed method is evaluated using a QualNet network simulator.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.9
• /
• pp.2139-2144
• /
• 2013

This paper has analyzed the possibility about implementation of the low-cost, high-efficiency tracking antenna using flat panel antenna. Tracking antenna is consisted of four flat-antenna, comparators, tracking receiver, controller. We analyzed input signal of antenna array about the magnitude and phase of radio wave. In addition, We suggested the available tracking range through the analysis of output signal. We have minimized the error rate that happened on two path through design two path of the azimuth and elevation. Analysis results has a tracking range of ${\pm}3$ degrees, it is possible to implement.

• Journal of IKEEE
• /
• v.17 no.4
• /
• pp.440-445
• /
• 2013

This paper proposes a local estimation system which combines Cell Divide Algorithm with low-cost GPS/INS fused by Extended Kalman Filter(EKF) for localization of Quad-rotor when it returns to the departure point. In the research, the low-cost GPS and INS are fused by EKF to reduce the local error of low-cost GPS and the accumulative error of INS due to continuous integration of sensor error values. When the Quad-rotor returns to the departure point in the fastest path, a moving path can be known because it moves straight, where Cell Divide Algorithm is used to divide moving route into the cells. Then it determines the closest position of data of GPS/INS system fused by EKF to obtain the improved local data. The proposed system was verified through comparing experimental localization results obtained by using GPS, GPS/INS and GPS/INS with Cell Divide Algorithm respectively.

• ETRI Journal
• /
• v.34 no.3
• /
• pp.352-360
• /
• 2012

This paper proposes a low-cost, low-power, and high-capacity optical-electrical-optical-type reach extender that can provide 3R frame regeneration and remote management to increase the reach and split ratio with no change to a legacy time division multiple access passive optical network. To provide remote management, the extender gathers information regarding optical transceivers and link status per port and then transmits to a service provider using a simple network management protocol agent. The extender can also apply to an Ethernet passive optical network (E-PON) or a gigabit-capable PON (G-PON) by remote control. In a G-PON, in particular, it can provide burst mode signal retiming and burst-to-continuous mode conversion at the upstream path through a G-PON transmission convergence frame adaptor. Our proposed reach extender is based on the quad-port architecture for cost-effective design and can accommodate both the physical reach of 60 km and the 512 split ratios in a G-PON and the physical reach of 80 km and the 256 split ratios in an E-PON.

• Information Display
• /
• v.18 no.3
• /
• pp.3-12
• /
• 2017

In the recent years, significant advances have been made in the development of small form-factor, low power, and low cost 3D-sensing devices based on depth-imaging technologies with real-time performance. This has led to the advent of devices and machines that are able to sense and understand the world, navigate in the environment, and interact naturally with their human users. Human-computer interactions based on touch sensing and speech recognition have already become mainstream, and the rapid developments in 3D sensing is paving the path towards the next level of machine intelligence and interactions. This paper discusses the recent developments in real-time 3D sensing technologies and their emerging system application.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.11
• /
• pp.1373-1381
• /
• 1999

이 논문에서는 통신망 설계 응용분야의 문제를 그래프 이론 문제로써 고려해 보았다. 개별 기업체가 서로 떨어진 두 곳을 연결하고자 할 때 공용통신망의 회선을 빌려 통신망을 구축하게 되는데 많은 경우 여러 종류의 회선들이 공급됨으로 어떤 회선을 선택하느냐의 문제가 생긴다. 일반적으로 빠른 회선(low delay)은 느린 회선(high delay)에 비해 비싸다. 그러나 서비스의 질(Quality of Service)이라는 요구사항이 종종 종단지연(end-to-end delay)시간에 의해 결정되므로, 무조건 낮은 가격의 회선만을 사용할 수는 없다. 결국 개별 기업체의 통신망을 위한 통로를 공용 통신망 위에 덮어씌워(overlaying) 구축하는 것의 여부는 두 개의 상반된 인자인 가격과 속도의 조절에 달려 있다. 따라서 일반적인 최소경로 찾기의 변형이라 할 수 있는 다음의 문제가 본 논문의 관심사이다. 두 개의 지점을 연결하는데 종단지연시간의 한계를 만족하면서 최소경비를 갖는 경로에 대한 해결을 위하여, 그래프 채색(coloring) 문제와 최단경로문제를 함께 포함하는 그래프 이론의 문제로 정형화시켜 살펴본다. 배낭문제로의 변환을 통해 이 문제는 {{{{NP-complete임을 증명하였고 {{{{O($\mid$E$\mid$D_0 )시간에 최적값을 주는 의사선형 알고리즘과O($\mid$E$\mid$)시간의 근사 알고리즘을 보였다. 특별한 경우에 대한 {{{{O($\mid$V$\mid$ + $\mid$E$\mid$)시간과 {{{{O($\mid$E$\mid$^2 + $\mid$E$\mid$$\mid$V$\mid$log$\mid$V$\mid$)시간 알고리즘을 보였으며 배낭 문제의 해결책과 유사한 그리디 휴리스틱(greedy heuristic) 알고리즘이 그물 구조(mesh) 그래프 상에서 좋은 결과를 보여주고 있음을 실험을 통해 확인해 보았다.Abstract This paper considers a graph-theoretic problem motivated by a telecommunication network optimization. When a private organization wishes to connect two sites by leasing physical lines from a public telecommunications network, it is often the cases that several categories of lines are available, at different costs. Typically a faster (low delay) lines costs more than a slower (high delay) line. However, low cost lines cannot be used exclusively because the Quality of Service (QoS) requirements often impose a bound on the end-to-end delay. Therefore, overlaying a path on the public network involves two diametrically opposing factors: cost and delay. The following variation of the standard shortest path problem is thus of interest: the shortest route between the two sites that meets a given bound on the end-to-end delay. For this problem we formulate a graph-theoretical problem that has both a shortest path component as well as coloring component. Interestingly, the problem could be formulated as a knapsack problem. We have shown that the general problem is NP-complete. The optimal polynomial-time algorithms for some special cases and one heuristic algorithm for the general problem are described.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.34C no.6
• /
• pp.1-10
• /
• 1997

By considering low power design at higher levels of abstraction rather than at lower levels of abstraction, we can apply various transformation techniques to a system design with wider view and obtain much more effective power reduction with less cost and effort. In this paper, a transformation technique, called power - conscious loop folding is proposed for high level synthesis of a low power system.Our work is focused on reducing the power consumed by functional units in adata path dominated circuit through the decrease of switching activity. Te transformation algorithm has been implemented and integrated into HYPER, a high level synthesis system for experiments. In our experiments, we could achieve a pwoer reduction of up to 50% for data path dominated circuits.