• 한국인터넷방송통신학회논문지
• /
• 제22권6호
• /
• pp.91-97
• /
• 2022

사이클 검출 문제에 대해, 단일 출발(SS)을 갖는 단일 연결 리스트(SLL)에 한해 O(n) 복잡도의 거북이와 토끼 경주법(HTA)이 제안되었으며, 다중 출발지-다중 종착지, 다중 분기(MSMDMB)를 갖는 일반 그래프에 대해서는 빠른 방법이 알려져 있지 않고 있다. 본 논문에서는 MSMDMB를 갖는 주어진 무 방향과 방향 그래프의 최대 사이클을 선형시간 복잡도로 검출할 수 있는 방법을 제안하였다. 제안된 방법은 주어진 원 그래프 G에는 사이클 형성 조건을 충족시키지 못하는 다수의 정점(또는 노드)가 존재한다는 사실에 기반하여 이들 정점(또는 노드)들을 제거한 축소된 그래프 G'를 얻었다. 이 축소된 그래프에 대해 선형시간 복잡도인 선형탐색으로 사이클 집합 C와 사이클 길이 λ를 찾았다. 제안된 알고리즘을 실험 데이터에 적용한 결과 모든 데이터들에 대해 최대 사이클을 찾을 수 있음을 보였다.

• International Journal of Control, Automation, and Systems
• /
• 제1권3호
• /
• pp.289-300
• /
• 2003

In this paper, we introduce an identification method in Fuzzy Relation-based Fuzzy Neural Networks (FRFNN) through a hybrid identification algorithm. The proposed FRFNN modeling implement system structure and parameter identification in the efficient form of "If...., then... " statements, and exploit the theory of system optimization and fuzzy rules. The FRFNN modeling and identification environment realizes parameter identification through a synergistic usage of genetic optimization and complex search method. The hybrid identification algorithm is carried out by combining both genetic optimization and the improved complex method in order to guarantee both global optimization and local convergence. An aggregate objective function with a weighting factor is introduced to achieve a sound balance between approximation and generalization of the model. The proposed model is experimented with using two nonlinear data. The obtained experimental results reveal that the proposed networks exhibit high accuracy and generalization capabilities in comparison to other models.er models.

• 한국통신학회논문지
• /
• 제21권1호
• /
• pp.59-66
• /
• 1996

In this paper, we present a new effective algorithm for element failure compensation of Generalized Sidelobe Canceller (GSC). While the GSC is well formulated, little works have been done on array element compensation in the presence of faulty elements. Element failure changes the problem of a linearly equally spaced array into that of an unequally spaced array. Typical research approaches have been directed at using search techniques to optimize unequally spaced arrays. The proposed algorithm matches the linear constraint conditions and the general shape of the desired beam pattern at the expense of an increase of beam-width in the overall main lobe. Numerical results are included to demonstrate the capability of compensation for various situations.

• ETRI Journal
• /
• 제35권3호
• /
• pp.469-479
• /
• 2013

This paper proposes an efficient computation-aware mode decision and search point (SP) allocation algorithm for spatial and quality scalabilities in Scalable Video Coding. In our proposal, a linear model is derived to allocate the computation for macroblocks in enhancement layers by using the rate distortion costs of the base layer. In addition, an adaptive SP decision algorithm is proposed to decide the number of SPs for motion estimation under the constraint of the allocated computation. Experiment results demonstrate that the proposed algorithm allocates the computation resource efficiently and outperforms other works in rate distortion performance under the same computational availability constraint.

• Computers and Concrete
• /
• 제22권4호
• /
• pp.355-363
• /
• 2018

In the following paper, a socio-political heuristic search approach, named the imperialist competitive algorithm (ICA) has been used to improve the efficiency of the multi-layer perceptron artificial neural network (ANN) for predicting the compressive strength of concrete. 173 concrete samples have been investigated. For this purpose the values of slump flow, the weight of aggregate and cement, the maximum size of aggregate and the water-cement ratio have been used as the inputs. The compressive strength of concrete has been used as the output in the hybrid ICA-ANN model. Results have been compared with the multiple-linear regression model (MLR), the genetic algorithm (GA) and particle swarm optimization (PSO). The results indicate the superiority and high accuracy of the hybrid ICA-ANN model in predicting the compressive strength of concrete when compared to the other methods.

• Journal of applied mathematics & informatics
• /
• 제29권5_6호
• /
• pp.1511-1523
• /
• 2011

In this paper, we consider the smoothing Newton method for the nonlinear complementarity problems with $P_0$-function. The proposed algorithm is based on a new smoothing function and it needs only to solve one linear system of equations and perform one line search per iteration. Under the condition that the solution set is nonempty and bounded, the proposed algorithm is proved to be convergent globally. Furthermore, the local superlinearly(quadratic) convergence is established under suitable conditions. Preliminary numerical results show that the proposed algorithm is very promising.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1996년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
• /
• pp.1-4
• /
• 1996

It is difficult that a non-translational motion in a block is estimated by the block matching algorithm (BMA). In this paper, a nodal-displacement-based deformation model is used for this reason. This model assumes that a selected number of control nodes move freely in a block and that displacement of any interior point can be interpolated from nodal displacements. As a special case with a single node this model is equivalent to a translational model. And this model can represent more complex deformation using more nodes. We used an iterative gradient based search algorithm to estimate nodal displacement. Each iteration involves the solution of a simple linear equation. This method is called the deformable block matching algorithm (DBMA).

• Journal of Electrical Engineering and Technology
• /
• 제9권1호
• /
• pp.344-351
• /
• 2014

In order to accomplish complex navigational commands, humanoid robot should be able to modify its walking period, step length and direction independently. In this paper, a novel walking pattern generation algorithm is proposed to satisfy these requirements. Modification of the walking pattern can be considered as a transition between two periodic walking patterns, which follows each navigational command. By assuming the robot as a linear inverted pendulum, the equations of motion between ZMP(Zero Moment Point) and CM(Center of Mass) state is easily derived and analyzed. After navigational command is translated into the desired CM state, corresponding CM motion is generated to achieve the desired state by using simple ZMP functions. Moreover, when the command is not feasible, feasible command is alternated by using binary search algorithm. Subsequently, corresponding CM motion is generated. The effectiveness of the proposed algorithm is verified by computer simulation.

• 한국산업정보학회논문지
• /
• 제1권1호
• /
• pp.29-62
• /
• 1996

In this paper, the problem of determining cyclic schedules for a material handling hoist in the printed-circuit-board(PCB) electroplating line is considered. The objective of this research is to determine an optimal simple-cycle schedule of the hoist which in turn maximizes the line throughput rate. Previous approaches to the cyclic hoist scheduling problem are all mathematical programming-based approaches to develop cyclic schedules(Mixed Integer Programming, Linear Programming based Branch and Bound, Branch and Bound Search Method and so on). In this paper, a genetic algorithm-based approach for a single hoist scheduling in the PCB electroplating line is described. Through some experiments for the well known example data and randomly generated data, the proposed algorithm is shown to be more efficient than the previous mathematical programming-based algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권6호
• /
• pp.2422-2443
• /
• 2020

This paper studies a single-user Mobile Edge Computing (MEC) system where mobile device (MD) includes an application consisting of multiple computation components or tasks with dependencies. MD can offload part of each computation-intensive latency-sensitive task to the AP integrated with MEC server. In order to accomplish the application faultlessly, we calculate out the optimal task offloading strategy in a time-division manner for a predetermined execution order under the constraints of limited computation and communication resources. The problem is formulated as an optimization problem that can minimize the energy consumption of mobile device while satisfying the constraints of computation tasks and mobile device resources. The optimization problem is equivalently transformed into solving a nonlinear equation with a linear inequality constraint by leveraging the Lagrange Multiplier method. And the proposed dual Bi-Section Search algorithm Bi-JOTD can efficiently solve the nonlinear equation. In the outer Bi-Section Search, the proposed algorithm searches for the optimal Lagrangian multiplier variable between the lower and upper boundaries. The inner Bi-Section Search achieves the Lagrangian multiplier vector corresponding to a given variable receiving from the outer layer. Numerical results demonstrate that the proposed algorithm has significant performance improvement than other baselines. The novel scheme not only reduces the difficulty of problem solving, but also obtains less energy consumption and better performance.