• 펄프종이기술
• /
• 제37권1호
• /
• pp.67-72
• /
• 2005

In the grade change operations inputs and outputs are highly correlated and application of conventional linear feedback control methods such as PID schemes might lead to poor control performance. In this study the neural networks model for the grade change operation is trained by using bilinear terms which can represent non-linear characteristics of grade change operations. The inverse model of the grade change operation is obtained from training and the optimal input variables are computed from the trained neural networks as well. The proposed bilinear inverse model predictive control scheme was found out to showlittle discrepancy between simulated outputs and setpoints.

• Management Science and Financial Engineering
• /
• 제19권1호
• /
• pp.25-28
• /
• 2013

Consider the inverse bin-packing number problem. Given a set of items and a prescribed number K of bins, the inverse bin-packing number problem, IBPN for short, is concerned with determining the minimum perturbation to the item-size vector so that all the items can be packed into K bins or less. It is known that this problem is NP-hard (Chung, 2012). In this paper, we investigate some special cases of IBPN that can be solved in polynomial time. We propose an optimal algorithm for solving the IBPN instances with two distinct item sizes and the instances with large items.

• 한국경영과학회지
• /
• 제39권2호
• /
• pp.131-140
• /
• 2014

Customer networks go through constant changes. They may expand or shrink once they are formed. In dynamic environments, it is a critical corporate challenge to identify and manage influential customer groups in a cost effective way. In this context, we apply inverse optimization theory to suggest an efficient method to manage customer networks. In this paper, we assume that there exists a subset of nodes that might have a large effect on the network and that the network can be modified via some strategic actions. Rather than making efforts to find influential nodes whenever the network changes, we focus on a subset of selective nodes and perturb as little as possible the interaction between nodes in order to make the selected nodes influential in the given network. We define the following problem based on the inverse optimization. Given a graph and a prescribed node subset, the objective is to modify the structure of the given graph so that the fixed subset of nodes becomes a minimum dominating set in the modified graph and the cost for modification is minimum under a fixed norm. We call this problem the inverse dominating set problem and investigate its computational complexity.

• ETRI Journal
• /
• 제31권6호
• /
• pp.709-716
• /
• 2009

In this paper, we propose a novel reconfigurable processor using dynamically partitioned single-instruction multiple-data (DP-SIMD) which is able to process multimedia data. The SIMD processor and parallel SIMD (P-SIMD) processor, which is composed of a number of SIMD processors, are usually used these days. But these processors are inefficient because all processing units (PUs) should process the same operations all the time. Moreover, the PUs can process different operations only when every SIMD group operation is predefined. We propose a processor control method which can partition parallel processors into multiple SIMD-based processors dynamically to enhance efficiency. For performance evaluation of the proposed method, we carried out the inverse transform, inverse quantization, and motion compensation operations of H.264 using processors based on SIMD, P-SIMD, and DP-SIMD. Experimental results show that the DP-SIMD control method is more efficient than SIMD and P-SIMD control methods by about 15% and 14%, respectively.

• 한국통신학회논문지
• /
• 제34권1C호
• /
• pp.63-71
• /
• 2009

본 논문에서는 H.264 부호화기의 율-왜곡 최적화를 위한 저 복잡도의 왜곡치 예측 방식을 제안한다. H.264에서 사용하는 복원 왜곡치를 계산하기 위해서는 DCT, 양자화, 역 양자화, IDCT, 그리고 복원 과정을 거쳐야 한다. 제안 방식은 양자화에서 계산되는 정수 계수들을 사용하여 정수 연산만으로 왜곡치를 예측한다. 따라서 제안 방식을 사용함으로써 왜곡치 계산에 사용되었던 역 양자화, IDCT, 그리고 복원 과정이 생략된다. 실험 결과는 QP $24{\sim}36$에서 율-왜곡 최적화된 모드 결정 시간의 감소량이 평균 29 %와 최대 약 42 % 이고, 율-왜곡 성능 저하는 무시할 수 있을 정도로 작음을 보여준다.

• Management Science and Financial Engineering
• /
• 제20권1호
• /
• pp.17-19
• /
• 2014

In this paper, we consider an interesting variant of the inverse minimum traveling salesman problem. Given an instance (G, w) of the minimum traveling salesman problem defined on a metric space, we fix a specified Hamiltonian cycle $HC_0$. The task is then to adjust the edge cost vector w to w' so that the new cost vector w' satisfies the triangle inequality condition and $HC_0$ can be returned by the minimum spanning tree algorithm in the TSP-instance defined with w'. The objective is to minimize the total deviation between the original and the new cost vectors with respect to the $L_1$-norm. We call this problem the inverse metric traveling salesman problem against the minimum spanning tree algorithm and show that it is closely related to the inverse metric spanning tree problem.

• 한국정밀공학회지
• /
• 제29권10호
• /
• pp.1119-1127
• /
• 2012

In this paper, we present an inverse kinematics of a 7-dof Anthropomorphic robot arm using conformal geometric algebra. The inverse kinematics of a 7-dof Anthropomorphic robot arm using CGA can be computed in an easy way. The geometrically intuitive operations of CGA make it easy to compute the joint angles of a 7-dof Anthropomorphic robot arm which need to be set in order for the robot to reach its goal or the positions of a redundant robot arm's end-effector. In order to choose the best solution of the elbow position at an inverse kinematics, optimization techniques have been proposed to minimize an objective function while satisfying the euler-lagrange equation.

• 대한임베디드공학회논문지
• /
• 제12권1호
• /
• pp.11-18
• /
• 2017

Finite field arithmetic has been extensively used in error correcting codes and cryptography. Low-complexity and high-speed designs for finite field arithmetic are needed to meet the demands of wider bandwidth, better security and higher portability for personal communication device. In particular, cryptosystems in GF($2^m$) usually require computing exponentiation, division, and multiplicative inverse, which are very costly operations. These operations can be performed by computing modular AB multiplications or modular $AB^2$ multiplications. To compute these time-consuming operations, using $AB^2$ multiplications is more efficient than AB multiplications. Thus, there are needs for an efficient $AB^2$ multiplier architecture. In this paper, we propose a low latency Montgomery $AB^2$ multiplier using redundant representation over GF($2^m$). The proposed $AB^2$ multiplier has less space and time complexities compared to related multipliers. As compared to the corresponding existing structures, the proposed $AB^2$ multiplier saves at least 18% area, 50% time, and 59% area-time (AT) complexity. Accordingly, it is well suited for VLSI implementation and can be easily applied as a basic component for computing complex operations over finite field, such as exponentiation, division, and multiplicative inverse.

• 한국정보통신학회논문지
• /
• 제17권4호
• /
• pp.953-958
• /
• 2013

본 논문에서는 고성능 HEVC 복호기를 위한 효율적인 $32{\times}32$ 역변환기 하드웨어 구조를 제안한다. HEVC는 4k, 8k 이미지와 같이 기존의 이미지코덱에 비해 훨씬 더 큰 크기의 이미지를 처리할 수 있는 새로운 영상 압축 표준이다. 큰 이미지의 데이터를 효과적으로 처리하기 위해 다양한 새 블록 구조를 채택하였으며, 이 블록들은 $4{\times}4$, $8{\times}8$, $16{\times}16$, $32{\times}32$으로 구성되었다. 이 논문에서는 $32{\times}32$ 역변환기의 효과적인 구조를 제안하며, 역변환기의 구조는 $32{\times}32$ 행렬을 $16{\times}16$ 행렬로 재구성하고 쉬프트와 덧셈기로 구성된 곱셈기를 사용하여 연산을 단순화 하였으며 멀티 사이클 패스를 구현하여 낮은 주파수에서도 동작이 가능하도록 설계하였다. 또한 HEVC 코덱의 다양한 크기의 변환이나 순방향 변환 블록에 쉽게 적용할 수 있다.

• 대한기계학회논문집
• /
• 제17권8호
• /
• pp.2043-2050
• /
• 1993

This paper presents a three dimensional modeling and dynamic analysis of a hydraulic excavator. An excavator composed of a boom, a bucket, two boom cylinders, an arm cylinder, and a bucket cylinder is used for the analysis. Each cylinder is modeled to two separate bodies linked by a translational joint. Judging from the actual degrees of freedom of the excavator, proper kinematic joints are selected to exclude redundant constraints in the modeling. In order to find the reaction forces at kinematic joints during operations, inverse dynamic analysis is carried out. Dynamic analysis is also carried out to verify the results from inverse dynamic analysis. The DADS program is used for analysis, with proper modification of the DADS user routine according to various motions.