• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권11호
• /
• pp.3008-3025
• /
• 2012

In this paper, the downlink resource allocation of OFDMA system with decode-and-forward (DF) relaying is investigated. A non-convex optimization problem maximizing system throughput with users' satisfaction constraints is formulated with joint relay selection, subcarrier assignment and power allocation. We first transform it to a standard convex problem and then solve it by dual decomposition. In particular, an Optimal resource allocation scheme With Time-sharing (OWT) is proposed with combination of relay selection, subcarrier allocation and power control. Due to its poor adaption to the fast-varying environment, an improved version with subcarrier Monopolization (OWM) is put forward, whose performance promotes about 20% compared with that of OWT in the fast-varying vehicular environment. In fact, OWM is the special case of OWT with binary time-sharing factor and OWT can be seen as the tight upper bound of the OWM. To the best of our knowledge, such algorithms and their relation have not been accurately investigated in cooperative OFDMA networks in the literature. Simulation results show that both the system throughput and the users' satisfaction of the proposed algorithms outperform the traditional ones.

• Journal of the Korean Wood Science and Technology
• /
• 제44권2호
• /
• pp.204-217
• /
• 2016

Modified poplar has emerged as a potential raw material for furniture production. Lack of specific modified poplar strength information; however, restricts applications in the furniture industry especially as related to strength in corner-joints. Optimization of strength in L-shaped corner dowel modified poplar joints under compression loads utilizing finite element analysis (FEA) by Taguchi method with the focus of this study. Four experiment factors (i.e., Structure Style, Tenon Length, Tenon Diameter, and Tenon Gap), each at three levels, were conducted by adopting a $L_9-3^4$ Taguchi orthodoxy array (OA) to determine the optimal combination of factors and levels for the von Mises stress utilizing ANSYS software. Results of Signal-to-Noise ratio (S/N) analysis and the analysis of variance (ANOVA) revealed the optimal L-shaped corner dowel joint in modified poplar is $45^{\circ}$ Bevel Butt in structure style, 24 mm in tenon length, 6 mm in tenon diameter, and 20 mm in tenon gap. Tenon length and tenon gap are determined to be significant design factors for affecting von Mises Stress. Confirmation tests with optimal levels and experimental test indicated the predicted optimal condition is comparable to the actual experimental optimal condition.

• 한국정밀공학회지
• /
• 제23권4호
• /
• pp.75-82
• /
• 2006

In this paper, we propose an optimal trajectory for biped robots to move up-and-down stairs using a genetic algorithm and a computed-torque control for biped robots to be dynamically stable. First, a Real-Coded Genetic Algorithm (RCGA) which of operators are composed of reproduction, crossover and mutation is used to minimize the total energy. Constraints are divided into equalities and inequalities: Equality constraints consist of a position condition at the start and end of a step period and repeatability conditions related to each joint angle and angular velocity. Inequality constraints include collision avoidance conditions of a swing leg at the face and edge of a stair, knee joint conditions with respect to the avoidance of the kinematic singularity, and the zero moment point condition with respect to the stability into the going direction. In order to approximate a gait, each joint angle trajectory is defined as a 4-th order polynomial of which coefficients are chromosomes. The effectiveness of the proposed optimal trajectory is shown in computer simulations with a 6-dof biped robot that consists of seven links in the sagittal plane. The trajectory is more efficient than that generated by the modified GCIPM. And various trajectories generated by the proposed GA method are analyzed in a viewpoint of the consumption energy: walking on even ground, ascending stairs, and descending stairs.

• 한국통신학회논문지
• /
• 제28권6C호
• /
• pp.580-593
• /
• 2003

이 논문은 양자화 오류와 채널왜곡을 고려한 양극왜곡을 최소화시키기 위해 변조신호의 좌표와 소스 인코더를 동시에 최적화하는 방법을 제안한다. 제안된 최적화 과정은 먼저 주어진 변조 신호에 대해서, VQ 부호책을 최적화한다. 그리고 나서 앞 단계에서 얻어진 VQ 부호책에 대해, 변조 신호를 최적화한다. 이 두 과정들은 국소 최적점에 도달할 때까지 반복 시행된다. 또한 본 논문에서는 코드 벡터와 변조 신호들간의 대응 관계를 효율적으로 설정함으로써 전체 시스템의 성능이 개선됨을 보인다. 컴퓨터 실험을 통하여 제안된 시스템이 잡음 없는 채널에서 설계된 VQ 부호책과 기존의 직교 진폭 변조(QAM) 신호를 기반으로 하는 종래의 시스템보다 우수한 성능을 갖음을 보여준다.

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

In this paper, we study the problem of network utility maximization in a CSMA based multi-hop wireless network. Existing work in this aspect typically adopted continuous time Markov model for performance modelling, which fails to consider the channel conflict impact in actual CSMA networks. To maximize the utility of a CSMA based wireless network with channel conflict, in this paper, we first model its weighted network capacity (i.e., network capacity weighted by link queue length) and then propose a distributed link scheduling algorithm, called CSMA based Maximal-Weight Scheduling (C-MWS), to maximize the weighted network capacity. We derive the upper and lower bounds of network utility based on C-MWS. The derived bounds can help us to tune the C-MWS parameters for C-MWS to work in a distributed wireless network. Simulation results show that the joint optimization based on C-MWS can achieve near-optimal network utility when appropriate algorithm parameters are chosen and also show that the derived utility upper bound is very tight.

• 대한인간공학회지
• /
• 제28권3호
• /
• pp.1-6
• /
• 2009

Recently, importance of the rehabilitation of hand pathologies as well as the development of high-technology hand robot has been increased. The biomechanical model of hand is indispensable due to the difficulty of direct measurement of muscle forces and joint forces in hands. In this study, a three-dimensional biomechanical model of four fingers including three joints and ten muscles in each finger was developed and a mathematical relationship between neural commands and finger forces which represents the enslaving effect and the force deficit effect was proposed. When pressing a plate under the flexed posture, the muscle forces and the joint forces were predicted by the optimization technique. The results showed that the major activated muscles were flexion muscles (flexor digitorum profundus, radial interosseous, and ulnar interosseous). In addition, it was found that the antagonistic muscles were also activated rather than the previous models, which is more realistic phenomenon. The present model has considered the interaction among fingers, thus can be more powerful while developing a robot hand that can totally control the multiple fingers like human.

• ETRI Journal
• /
• 제33권2호
• /
• pp.155-162
• /
• 2011

The scalable extension of the H.264/AVC video coding standard (SVC) demonstrates superb adaptability in video communications. Joint source and channel coding (JSCC) has been shown to be very effective for such scalable video consisting of parts of different significance. In this paper, a new JSCC scheme for SVC transmission over packet loss channels is proposed which performs two-dimensional optimization on the quality layers of each frame in a rate-distortion (R-D) sense as well as on the temporal hierarchical structure of frames under dependency constraints. To compute the end-to-end R-D points of a frame, a novel reduced trellis algorithm is developed with a significant reduction of complexity from the existing Viterbi-based algorithm. The R-D points of frames are sorted under the hierarchical dependency constraints and optimal JSCC solution is obtained in terms of the best R-D performance. Experimental results show that our scheme outperforms the existing scheme of [13] with average quality gains of 0.26 dB and 0.22 dB for progressive and non-progressive modes respectively.

• ETRI Journal
• /
• 제34권6호
• /
• pp.879-884
• /
• 2012

When the number of users is finite, the performance improvement of the orthogonal random beamforming (ORBF) scheme is limited in high signal-to-noise ratio regions. In this paper, to improve the performance of the ORBF scheme, the user set and transmit power allocation are jointly determined to maximize sum rate under the total transmit power constraint. First, the transmit power allocation problem is expressed as a function of a given user set. Based on this expression, the optimal user set with the maximum sum rate is determined. The suboptimal procedure is also presented to reduce the computational complexity, which separates the user set selection procedure and transmit power allocation procedure.

• 대한기계학회논문집
• /
• 제18권8호
• /
• pp.2016-2025
• /
• 1994

A hierarchical planning strategy for dextrous manipulation of multifingered hands with soft finger contact model is proposed. Dextrous manipulation planning can be divided into a high-level stage which specifies the position/orientation trajectories of the fingertips on the object and a low-level stage which determines the contact forces and joint trajectories for the fingers. In the low-level stage, various nonlinear optimization problems are formulated according to the contact modes and integrated into a manipulation planning algorithm to find contact forces and joint velocities at each time step. Montana's contact equations are used for the high-level planning. Quasi-static simulation results are presented and illustrated by employing a three-fingered hand manipulating a sphere to demonstrate the validity of the proposed low-level planning strategy.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2012년도 한국컴퓨터종합학술대회논문집 Vol.39 No.1(D)
• /
• pp.297-299
• /
• 2012

In this paper, we introduce a joint flow control and scheduling algorithm for multi-hop cognitive radio networks with spectrum underlay. Our proposed algorithm maximizes the total utility of secondary users while stabilizing the cognitive radio network and still satisfies the total interference from secondary users to primary network is less than an accepted level. Based on Lyapunov optimization technique, we show that our scheme is arbitrarily close to the optimal.