• Communications for Statistical Applications and Methods
• /
• 제9권3호
• /
• pp.845-851
• /
• 2002

An efficient method is developed to obtain the maximum flow for a network when its simple paths are known. Most of the existing techniques need to convert simple paths into minimal cuts, or to determine the order of simple paths to be applied in the process to reach the correct result. In this paper, we propose a method based on the concepts of signed simple path and signed flow defined in the text. Our method involves a fewer number of arithmetic operations at each iteration, and requires fewer iterations in the whole process than the existing methods. Our method can be easily extended to a mixed network with a slight modification. Furthermore, the correctness of our method does not depend on the order of simple paths to be applied in the process.

• International Journal of Ocean System Engineering
• /
• 제2권3호
• /
• pp.139-150
• /
• 2012

This paper presents an improved guidance algorithm for autonomous underwater vehicles (AUV) in 3D space for generating smoother vehicle turn during the course change at the way-points. The way-point guidance by the line-of-sight (LOS) method has been modified for correcting the reference angles to achieve minimal calculation and smoother transition at the way-points. The algorithm has two phases in which the first phase brings the vehicle to converge to a distance threshold point on the line segment connecting the first two way-points and the next phase generates an angular path with smoother transition at the way-points. Then the desired angles are calculated from the reference and correction angles. The path points are regularly parameterized in the spherical coordinates and mapped to the Cartesian coordinates. The proposed algorithm is found to be simple and can be used for real time implementation. The details of the algorithm and simulation results are presented.

• 한국신뢰성학회:학술대회논문집
• /
• 한국신뢰성학회 2002년도 정기학술대회
• /
• pp.297-302
• /
• 2002

An efficient method is developed to obtain the maximum capacity flow for a network when its simple paths are known. Most of the existing techniques need to convert simple paths into minimal cuts, or to determine the order of simple paths to be applied in the process to reach the correct result. In this paper, we propose a method based on the concepts of signed simple path and signed flow defined in the text. Our method involves a fewer number of arithmetic operations at each iteration, and requires fewer iterations in the whole process than the existing methods. Our method can be easily extended to a mixed network with a slight modification. Furthermore, the correctness of our method does not depend on the order of simple paths to be applied in the process.

• 대한기계학회논문집
• /
• 제18권10호
• /
• pp.2606-2615
• /
• 1994

Sorting time is one of the most important issues for auto IC test handling systems. In actual system, because of too much path, reducing the computing time for finding a sorting path is the key way to enhancing the system performance. The exhaustive path search technique can not be used for real systems. This paper proposes heuristic sorting algorithm to find the minimal sorting time. The suggested algorithm is basically based on the best-first search technique and multi-level search technique. The results are close to the optimal solutions and computing time is greately reduced also. Therefore the proposed algorthm can be effectively used for real-time sorting process in auto IC test handling systems.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권4호
• /
• pp.1249-1265
• /
• 2022

Video streaming has become one of the most popular applications for mobile devices. The network bandwidth required for video streaming continues to exponentially increase as video quality increases and the user base grows. Multi-Path TCP (MPTCP), which allows devices to communicate simultaneously through multiple network interfaces, is one of the solutions for providing robust and reliable streaming of such high-definition video. However, mobile video streaming over MPTCP raises new concerns, e.g., power consumption and cellular data usage, since mobile device resources are constrained, and users prefer to minimize such costs. In this work, we propose a mobile video streaming framework over MPTCP (mDASH) to reduce the costs of energy and cellular data usage while preserving feasible streaming quality. Our evaluation results show that by utilizing knowledge about video behavior, mDASH can reduce energy consumption by up to around 20%, and cellular usage by 15% points, with minimal quality degradation.

• 대한기계학회논문집
• /
• 제17권5호
• /
• pp.1183-1192
• /
• 1993

본 연구에서는 다음과 같은 두가지 관점에서 공구경로 최적화를 위한 기존 방 법의 문제점을 검토하고 이의 개선 방안을 제시하였다. 첫째, 기존의 공구경로 산출 방법에서는 고려되지 않는 공구대의 공구 장착 현황(turret configuration)이 최적화 과정에서 고려되어야 한다. 둘째로, 제작과 관련한 구속조건(manufacturing con- straints)이 최적화 과정에 직접 반영되어야 한다.

• 한국통신학회논문지
• /
• 제25권7A호
• /
• pp.951-958
• /
• 2000

파장분할다중화방식 전광통신망에서는 신호가 먼 거리를 진행할 경우, ASE(Amplified Spontaneous Emission) 잡음이나 누화(Crosstalk)와 같은 물리적 제약으로 인해 신호가 손상된다. 소낫ㅇ된 신호를 회복시키기 위해서는 광신호를 중간 노드에서 재생(signal regeneration)해야 하지만, 신호 재생은 추가의 네트워크 자원을 필요로 하기 때문에 재생 노드(Signal Regeneration Node, SRN)는 다른 광경로의 블록킹을 최소화하도록 신중히 선택해야 한다. 이 논문에서는 물리적인 제약 하에서 다중홉 방식으로 광경로를 설정하는 문제에 대해 최소비용 알고리즘(Minimal-Cost Placement Algorithm, MCPA)과 휴리스틱 알고리즘들을 제안하다. 최소비용 위치선정 알고리즘은 다이내믹 프로그래밍을 이용하여 송수신기나 파장의 부족으로 인한 다른 광경로들의 블록킹을 최소화하도록 공식화하였다.

• 소음진동
• /
• 제11권3호
• /
• pp.401-409
• /
• 2001

Passive type mufflers installed on every car haute inherent problem of lowering engine power and fuel efficiency caused by backpressure which is byproduct of complex internal structure. Recent improvements like installing a calve to change exhaust gas path depending on power requirement and rpm have only marginally improved performance. Tremendous amount of recent research works on active exhaust noise control have failed to commercialize because of numerous physical and economical reasons. In this paper, a unique seal-active muffler using difference of transmission paths is presented. In this system exhaust pipe is divided into two and joined again downstream. Exhaust noise is reduced by destructive interference when two-divided noise join again with transmission paths'difference which is half of the wavelength of a main noise frequency. One divided path has a sliding mechanism to change length thereby transmission path length difference is adjusted to entwine rpm change. The proposed system has minimal backpressure and does not need a secondary sound source like a speaker so it can overcome many problems of failed active noise control methods. We have verified proposed system's superior performance by simulation and comparison experiment with passive mufflers.

• 로봇학회논문지
• /
• 제7권2호
• /
• pp.150-159
• /
• 2012

In this paper, we propose a cost-aware Rapidly-exploring Random Tree (RRT) path planning algorithm for mobile robots. A mobile robot is presented with a cost map of the field of interest and assigned to move from one location to another. As a robot moves, the robot is penalized by the cost at its current location according to the cost map. The overall cost of the robot is determined by the trajectory of the robot. The goal of the proposed cost-aware RRT algorithm is to find a trajectory with the minimal cost. The cost map of the field can represent environmental parameters, such as temperature, humidity, chemical concentration, wireless signal strength, and stealthiness. For example, if the cost map represents packet drop rates at different locations, the minimum cost path between two locations is the path with the best possible communication, which is desirable when a robot operates under the environment with weak wireless signals. The proposed cost-aware RRT algorithm extends the basic RRT algorithm by considering the cost map when extending a motion segment. We show that the proposed algorithm gives an outstanding performance compared to the basic RRT method. We also demonstrate that the use of rejection sampling can give better results through extensive simulation.

• Journal of Information Processing Systems
• /
• 제14권6호
• /
• pp.1347-1360
• /
• 2018

Owing to limited energy in wireless devices power saving is very critical to prolong the lifetime of the networks. In this regard, we designed a cross-layer optimization mechanism based on power control in which source node broadcasts a Route Request Packet (RREQ) containing information such as node id, image size, end to end bit error rate (BER) and residual battery energy to its neighbor nodes to initiate a multimedia session. Each intermediate node appends its remaining battery energy, link gain, node id and average noise power to the RREQ packet. Upon receiving the RREQ packets, the sink node finds node disjoint paths and calculates the optimal power vectors for each disjoint path using cross layer optimization algorithm. Sink based cross-layer maximal minimal residual energy (MMRE) algorithm finds the number of image packets that can be sent on each path and sends the Route Reply Packet (RREP) to the source on each disjoint path which contains the information such as optimal power vector, remaining battery energy vector and number of packets that can be sent on the path by the source. Simulation results indicate that considerable energy saving can be accomplished with the proposed cross layer power control algorithm.