• Journal of the Korea Computer Graphics Society
• /
• v.21 no.4
• /
• pp.19-26
• /
• 2015

This paper presents a method for optimizing a carrying pose of human body for a given object. The inputs are articulated human body model and and arbitrary-shaped object. We assume that the object is big and heavy, so that both arms should be used to carry it. Unlike small and light objects, big and heaby objects can be hold by only a small range of body poses while keeping a physical statbility. We first introduce an algorithm that evaluates a physical stability of a given human body pose and object state (position and orientation). Then, we define a configuration space and search the space for the most stable carrying pose by using the evaluation algorithm. Finally, to demonstrate the usability of our method, we present the results which each is experimented with different shaped objects and additional user conditions.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.16 no.2
• /
• pp.138-143
• /
• 2006

This paper presents intelligent digital redesign method for hybrid state space fuzzy-model-based controllers. For effectiveness and stabilization of continuous-time uncertain nonlinear systems under discrete-time controller, Takagi-Sugeno(TS) fuzzy model is used to represent the complex system. And global approach design problems viewed as a convex optimization problem that we minimize the error of the norm bounds between nonlinearly interpolated linear operators to be matched. Also, by using the bilinear and inverse bilinear approximation method, we analyzed nonlinear system's uncertain parts more precisely. When a sampling period is sufficiently small, the conversion of a continuous-time structured uncertain nonlinear system to an equivalent discrete-time system have proper reason. Sufficiently conditions for the global state-matching of the digitally controlled system are formulated in terms of linear matrix inequalities (LMIs). Finally, a TS fuzzy model for the chaotic Lorentz system is used as an . example to guarantee the stability and effectiveness of the proposed method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.11 no.2
• /
• pp.108-121
• /
• 1986

In this paper, the development of a simulator for the performance estimation and parameter optimization of an integrates voice/data packet communication network is described. The simulator implemented is capable of simulating the integrated voice/data network that handles packet voice terminals as well as data terminals and hosts operating under standard CCITT protocols. Of the three descrete event simulation approaches presently known, the process interaction method has been chose. With this approach one can implement a simulator that is related most Closely with the real system. The simulator has been implemented in PL/I and GPSS simulation languages, resulting in a software package of about 4,000 lines. To reduce the computer run time of the simulator, we have used a method of reducing conditional events based on a GPSS LINK block. We describe various aspects of the simulation model developed. We then investigate the performance of a 7-node network using the simulator, and present the results. For validation of the simulator developed, we construct a simulation model for a simple voice/ data multiplexer, and compare the results of simulation with those of an analytical model.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.1A
• /
• pp.76-83
• /
• 2009

In this paper, we provide opportunistic scheduling schemes for elastic services in OFDMA systems with fairness constraints for each user. We adopt the network utility maximization framework in which a utility function is defined for each user to represent its level of satisfaction to the service. Since we consider elastic services whose degree of satisfaction depends on its average data rate, we define the utility function of each user as a function of its average data rate. In addition, for fair resource allocation among users, we define fairness requirements of each user by using utility functions. We first formulate an optimization problem for each fairness requirement that aim at maximizing network utility, which is defined as the sum of utilities of users. We then develop an opportunistic scheduling scheme for each fairness requirement by solving the problem using a dual approach and a stochastic sub-gradient algorithm.

• Steel and Composite Structures
• /
• v.25 no.1
• /
• pp.117-126
• /
• 2017

The component method is an analytical approach for investigating the moment-rotation relationship of steel connections. In this study, the component method was improved from two aspects: (i) load analysis of mechanical model; and (ii) combination of spring elements. An optimized component method with more reasonable component models, spring arrangement position, and boundary conditions was developed using finite element analysis. An experimental testing program in two major-axis and two minor-axis connections under symmetrically loading was carried out to verify this method. The initial rotational stiffness obtained from the optimized component method was consistent with the experimental results. It can be concluded that (i) The coupling stiffness between column and beam flanges significantly affects the effective height of the tensile-column web. (ii) The mechanical properties of the bending components were obtained using an equivalent t-stub model considering the bending capacity of bolts. (iii) Using the optimized mechanical components, the initial rotational stiffness was accurately calculated using the spring system. (iv) The characteristics of moment-rotation relationship for beam to column connections were effectively expressed by the SPRING element analysis model using ABAQUS. The calculations are simpler, and the results are accurate.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.2
• /
• pp.287-295
• /
• 2010

In this paper, we introduce a novel approach to optimization algorithm which is a distributed Mean field Genetic algorithm (MGA) implemented in MPI(Message Passing Interface) environments. Distributed MGA is a hybrid algorithm of Mean Field Annealing(MFA) and Simulated annealing-like Genetic Algorithm(SGA). The proposed distributed MGA combines the benefit of rapid convergence property of MFA and the effective genetic operations of SGA. The proposed distributed MGA is applied to the channel routing problem, which is an important issue in the automatic layout design of VLSI circuits. Our experimental results show that the composition of heuristic methods improves the performance over GA alone in terms of mean execution time. It is also proved that the proposed distributed algorithm maintains the convergence properties of sequential algorithm while it achieves almost linear speedup as the problem size increases.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.7
• /
• pp.943-948
• /
• 2018

In this paper, we propose a hybrid approach of combining $A^*$ and Genetic algorithm in the path search problem. In $A^*$, the cost from a start node to the intermediate node is optimized in principle but the path from that intermediate node to the goal node is generated and tested based on the cumulated cost and the next node in a priority queue is chosen to be tested. In that process, we adopt the genetic algorithm principle in that the group of nodes to generate the next node from an intermediate node is tested by its fitness function. Top two nodes are selected to use crossover or mutation operation to generate the next generation. If generated nodes are qualified, those nodes are inserted to the priority queue. The proposed method is compared with the original sequential selection and the random selection of the next searching path in $A^*$ algorithm and the result verifies the superiority of the proposed method.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.10
• /
• pp.595-602
• /
• 2003

This Paper presents an efficient hybrid techniques for a standard cell placement. The prototype tool adopts a middle-down methodology in which an n${\times}$m grid is imposed over the layout area and cells are assigned to bins forming a global placement. The optimization technique applied in this phase is based on the Relaxation-Based Local Search (RBLS) framework [12］in which a combinatorial search mechanism is driven by an analytical engine. This enables a more global view of the problem and results in complex modifications of the placement in a single search“move.”Details of this approach including a novel placement legalization procedure are presented. When a global placement converges, a detailed placement is formed and further optimized by the optimal interleaving technique[13］. Experimental results on MCNC benchmarking circuits are presented and compared with the Feng Shui's results in［14］. Solution Qualifies are almost the same as the Feng Shui's results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.8B
• /
• pp.1586-1592
• /
• 1999

In DWMT, CMFB is employed in the synthesis/analysis part. The CMFB uses filters of greater length than the DFT, resulting in reduced interference between the carriers. In addition, the CMFB system is computationally efficient and fast algorithms are available for their implementation. Traditional designs for the prototype filters of CMFB usually involve nonlinear optimizations. Thus the required design time is considerably large even for small filter orders. In this paper, a prototype filter design method for CMFB is presented using optimal window method. The design process is reduced to the optimization of a single parameter and consequently the required design time is much less than those of the existing methods. It is shown that the stopband performance of the proposed method is better than that of the Kaiser window method.

• Transactions on Electrical and Electronic Materials
• /
• v.5 no.1
• /
• pp.1-6
• /
• 2004

Zinc sulfide is a semiconductor with wide band gap and high refractive index and hence promising material to be used as ARC on commercial silicon solar cells. Uniform deposition of zinc sulfide (ZnS) by using chemical bath deposition (CBD) method over a large area of silicon surface is an emerging field of research because ZnS film can be used as a low cost antireflection coating (ARC). The main problem of the CBD bath process is the huge amount of precipitation that occurs during heterogeneous reaction leading to hamper the rate of deposition as well as uniformity and chemical stoichiometry of deposited film. Molar concentration of thiorea plays an important role in varying the percentage of reflectance and refractive index of as-deposited CBD ZnS film. Desirable rate of film deposition (19.6 ${\AA}$ / min), film uniformity (Std. dev. < 1.8), high value of refractive index (2.35), low reflectance (0.655) have been achieved with proper optimization of ZnS bath. Decrease in refractive index of CBD ZnS film due to high temperature treatment in air ambiance has been pointed out in this paper. Solar cells of conversion efficiency 13.8 ％ have been successfully achieved with a large area (103 mm ${\times}$ 103 mm) mono-crystalline silicon wafers by using CBD ZnS antireflection coating in this modified approach.