• Journal of Communications and Networks
• /
• 제9권3호
• /
• pp.312-318
• /
• 2007

In this paper, we propose the optimal offset-time decision (OOD) algorithm which can effectively reduce the pre-transmission delay compared to the perfect isolation model, and can also be extended to general n priority classes while the target loss probability of each class is guaranteed for the variable offered load. In order to drive the OOD algorithm, we first analyze the loss probability of each priority class through class aggregation and iteration method; the analytic results obtained through the proposed algorithm are then validated with results garnered from extensive simulation tests.

• Journal of Power Electronics
• /
• 제18권4호
• /
• pp.1027-1036
• /
• 2018

In this paper a new generalized space vector pulse width modulation scheme is proposed based on the principle of reverse mapping to drive the switches of multilevel inverters. This projected scheme is developed based on the middle vector of the subhexagon which holds the tip of the reference vector, which plays a major role in mapping the reference vector. A new approach is offered to produce middle vector of the subhexagon which holds tip of the reference vector in the multilevel space vector plane. By using middle vector of the subhexagon, reference vector is linked towards the inner two level sub-hexagon. Then switching vectors, switching sequence and dwell times corresponding to a particular sector of a two-level inverter are determined. After that, by using the two level stage findings, the switching vectors related to exact position of the reference vector are directly generated based on principle of the reverse mapping approach and do not need to be found at n level stage. In the reverse mapping principle, the middle vector of subhexagon is added to the formerly found two level switching vectors. The proposed generalized algorithm is efficient and it can be applied to an inverter of any level. In this paper, the proposed scheme is explained for a five-level inverter and the performance is analyzed for five level and three level inverters through MATLAB. The simulation results are validated by implementing the propose scheme on a V/f controlled three-level inverter fed induction motor using dSPACE control desk.

• 한국정보과학회논문지:시스템및이론
• /
• 제29권3호
• /
• pp.117-124
• /
• 2002

본 논문은 다수의 고장 스위칭 소자를 갖는 다단계 상호연결망(MIN)에서 영역 부호화 방식을 적용하는 고장 허용 멀티캐스팅 알고리즘을 제안한다. 제안된 알고리즘은 MIN의 전체 스위칭 소자들을 같은 크기를 갖는 두 개의 부분집합으로 구분하고, 모든 고장이 동일한 부분집합에 속한 고장 유형을 허용한다. 제안된 알고리즘은 고장을 우회하여 멀티캐스트 메시지를 목적지까지 보내기 위해, MIN을 통해 메시지를 순환시키는 기법을 사용한다. 본 알고리즘은 고장난 MIN에서 임의의 멀티캐스트 메시지를 두 번 순환시켜 라우팅 할 수 있음을 증명한다.

• 대한산업공학회지
• /
• 제37권1호
• /
• pp.19-29
• /
• 2011

Cellular network is comprised of several base stations which serve cellular shaped service area and each base station (BS) is connected to the mobile switching center (MSC). In this paper, the configuration modeling and algorithm of a cellular mobile network with the aim of minimizing the overall cost of operation (handover) and network installation cost (cabling cost and installing cost of mobile switching center) are considered. Handover and cabling cost is one of the key considerations in designing cellular telecommunication networks. For real-world applications, this configuration study covers in an integrated framework for two major decisions: locating MSC and assigning BS to MSC. The problem is expressed in an integer programming model and a heuristic algorithm based on Lagrangian relaxation is proposed to resolve the problem. Searching for the optimum solution through exact algorithm to this problem appears to be unrealistic considering the large scale nature and NP-Completeness of the problem. The suggested algorithm computes both the bound for the objective value of the problem and the feasible solution for the problem. A Lagrangian heuristics is developed to find the feasible solution. Numerical tests are performed for the effectiveness and efficiency of the proposed heuristic algorithm. Computational experiments show that the performance of the proposed heuristics is satisfactory in the quality of the generated solution.

• 한국경영과학회지
• /
• 제24권3호
• /
• pp.93-107
• /
• 1999

We consider the development of an integer programming model and algorithm for the ATM switching node location problem. There are two kinds of facilities, hub facilities and remote facilities, with different capacities and installation costs. Each customer needs to be connected to one or more hub facilities via remote facilities, where the hub(remote) facilities need to be installed at the same candidate installation site of hub(remote) facility. We are given a set of customers with each demand requirements, a set of candidate installation sites of facilities, and connection costs between facilities, We need to determine the locations to place facilities, the number of facilities for each selected location, the set of customers who are connected to each installed hub facilities via installed remote facilities with minimum costs, while satisfying demand requirements of each customer. We formulate this problem as a general integer programming problem and solve it to optimality. In this paper, we develop a branch-and-cut algorithm with path variables. In the algorithm, we consider the integer knapsack polytope and derive valid inequalities. Computational experiments show that the algorithm works well in the real world situation. The results of this research can be used to develop optimization algorithms to solve capacitated facility location problems.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권1호
• /
• pp.78-101
• /
• 2017

High-quality industrial control is critical to ensuring production quality, reducing production costs, improving management levels and stabilizing equipment and long-term operations. WiFi-based Long Distance (WiLD) networks have been used as remote industrial control networks. Real-time performance is essential to industrial control. However, the original mechanism of WiLD networks does not minimize end-to-end delay and restricts improvement of real-time performance. In this paper, we propose two algorithms to obtain the transmitting/receiving phase cycle length for each node such that real time constraints can be satisfied and phase switching overhead can be minimized. The first algorithm is based on the branch and bound method, which identifies an optimal solution. The second is a fast heuristic algorithm. The experimental results show that the execution time of the algorithm based on branch and bound is less than that of the heuristic algorithm when the network is complex and that the performance of the heuristic algorithm is close to the optimal solution.

• 제어로봇시스템학회논문지
• /
• 제14권2호
• /
• pp.133-140
• /
• 2008

In this paper, a small and effective attitude estimation system for a humanoid robot was developed. Four small inertial sensors were packed and used for inertial measurements(3D accelerometer and three 1D gyroscopes.) An effective 3D pose estimation algorithm for low cost DSP using an extended Kalman filter was developed and evaluated. The 3D pose estimation algorithm has a very simple structure composed by 3 modules of a linear acceleration estimator, an external acceleration detector and an pseudo-accelerometer output estimator. The algorithm also has an effective switching structure based on probability and simple feedback loop for the extended Kalman filter. A special test equipment using linear motor for the testing of the 3D pose sensor was developed and the experimental results showed its very fast convergence to real values and effective responses. Popular DSP of TMS320F2812 was used to calculate robot's 3D attitude and translated acceleration, and the whole system were packed in a small size for humanoids robots. The output of the 3D sensors(pitch, roll, 3D linear acceleration, and 3D angular rate) can be transmitted to a humanoid robot at 200Hz frequency.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2021년도 추계학술대회
• /
• pp.121-123
• /
• 2021

영상처리는 인공지능과 스마트팩토리, IoT 산업 등 4차 산업혁명의 중요한 분야에서 다양한 형태로 사용되고 있다. 특히 물체 추적, 의료 영상, 객체 인식과 같은 데이터 처리가 필요한 시스템에서는 전처리 단계로 잡음 제거를 사용하고 있으나, 기존 알고리즘은 필터링 과정에서 블러링 현상이 나타나는 단점을 가지고 있다. 따라서 본 논문에서는 스위칭 퍼지 가중치를 사용한 필터 알고리즘을 제안한다. 제안한 알고리즘은 필터링 마스크의 표준편차에 저주파 영역과 고주파 영역을 구분하여 퍼지 함수를 스위칭하였으며, 퍼지 가중치에 따라 최종출력을 구한다. 제안한 알고리즘은 기존 방법에 비해 개선된 결과를 보였으며, 고주파 성분이 강하게 나타나는 영역에서 우수한 특성을 나타내었다.

• 산업기술연구
• /
• 제24권A호
• /
• pp.119-126
• /
• 2004

BLDC Motor is one of the widely utilizable motors in servo system. The accurate calculation of the power loss for the IGBT and Inverse diode with Bipolar and Unipolar switching modes the driving modes is important for the design of drives for their heat treatment. If it were not for temperature-sensors in devices, it is difficult to get direct power loss, so. Power losses may be modeled by computer modeling to obtain the Calculation of the Power loss for Inverter in BLDC Motor with switching modes which is presented in this paper. The computer modeling is carried out by Matlab simulation. The power loss consists of conduction losses Conduction losses are the source of occurrence due to The IGBT and Inverse diode currents. Switching losses are the source of occurrence due to switching on/off in the devices, and gives the dominant influence to the loss. As a result, the unipolar I mode is best in reducing the heat losses.

• Journal of Communications and Networks
• /
• 제13권5호
• /
• pp.536-543
• /
• 2011

The heterogeneous postal delivery model assumes that each intermediate node in the multicasting tree incurs a constant switching time for each message that is sent. We have proposed a new model where we assume a more generalized switching time at intermediate nodes. In our model, a child node v of a parent u has a switching delay vector, where the ith element of the vector indicates the switching delay incurred by u for sending the message to v after sending the message to i-1 other children of u. Given a multicast tree and switching delay vectors at each non-root node 5 in the tree, we provide an O(n$^{\frac{5}{2}}$) optimal algorithm that will decide the order in which the internal (non-leaf) nodes have to send the multicast message to its children in order to minimize the maximum end-to-end delay due to multicasting. We also show an important lower bound result that optimal multicast switching delay problem is as hard as min-max matching problem on weighted bipartite graphs and hence O(n$^{\frac{5}{2}}$) running time is tight.