• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.9 no.1
• /
• pp.33-40
• /
• 1989

In the design of reinforced concrete framed structures, which consist of various design variables, the objective and the constraint functions are formulated in complicated forms. Usually iterative methods have been used to optimize the design variables. In this paper, multilevel formulation is adopted, and design variables are selected in reduced numbers at each level, to reduce the iterative cycle and to accelerate the convergence rate. At level 1, elastic analysis is performed to get the upper and lower bounds of the redistributed design moments due to inelastic behavior of the frame. Then the design moments are taken as design variables and optimized at level 2, and the sizing variables are optimized at level 3. The optimization of redistributed moments is performed using the design sensitivity obtained at the level 2, and force approximation technique is used to reflect the variation of design variables in the lower level to the upper level. The design variables are selected in reduced numbers at each level, and the optimization formulation is simplified effectively. A cost function is taken as the objective function, and the constraints of the stress of the structures are derived from BSI CP 110 following limit state theory. Numerical examples are included to prove the effectiveness of the developed algorithm.

• Journal of the Earthquake Engineering Society of Korea
• /
• v.5 no.6
• /
• pp.37-46
• /
• 2001

In this research, a controller design method based on optimization is proposed that can satisfy constraints on maximum responses of building structures subject to around excitation modeled by partially stochastic process. The class of controllers to be optimized is restricted to LQR. Weighting matrix on controlled outputs is used as design variable. Objective function, constraint functions and their gradients are computed by the parameterization of control gain with Riccati matrix. Full state feedback controllers designed by proposed optimization method satisfy various design objectives and their necessary maximum control forces are computed for the production of actuator. LQG controllers composed of Kalman filter and LQR designed by proposed method perform well with little deterioration. So it is possible to design output feedback controllers satisfying constraints on various maximum responses of structures.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.39 no.1
• /
• pp.98-104
• /
• 2016

With the development of modern science and technology, weapon systems such as tanks, submarines, combat planes, radar are also dramatically advanced. Among these weapon systems, the ballistic missile, one of the asymmetric forces, could be considered as a very economical means to attack the core facilities of the other country in order to achieve the strategic goals of the country during the war. Because of the current ballistic missile threat from the North Korea, establishing a missile defense (MD) system becomes one of the major national defense issues. This study focused on the optimization of air defense artillery units' deployment for effective ballistic missile defense. To optimize the deployment of the units, firstly this study examined the possibility of defense, according to the presence of orbital coordinates of ballistic missiles in the limited defense range of air defense artillery units. This constraint on the defense range is originated from the characteristics of anti-ballistic missiles (ABMs) such as PATRIOT. Secondly, this study proposed the optimized mathematical model considering the total covering problem of binary integer programming, as an optimal deployment of air defense artillery units for defending every core defense facility with the least number of such units. Finally, numerical experiments were conducted to show how the suggested approach works. Assuming the current state of the Korean peninsula, the study arbitrarily set ballistic missile bases of the North Korea and core defense facilities of the South Korea. Under these conditions, numerical experiments were executed by utilizing MATLAB R2010a of the MathWorks, Inc.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.23 no.1
• /
• pp.14-20
• /
• 2012

CoMP(Coordinated Multi-Point transmission and reception) refers to a cooperative transmission strategy to control the interference from adjacent base stations in cellular mobile communication systems, which efficiently enhances the data throughput of the systems. As the number of the base stations participating in cooperative transmission increases, however, a larger amount of information exchange to carry the CSI(Channel State Information) of the mobile terminals is required. In this paper, we propose a partial CoMP transmission method for systems under the constraint of finite feedback information data. This method selects candidates of base stations which can provide high efficiency gain when they participate in the CoMP set. To achieve this, the cooperative base station combination is constructed by considering the preferred base stations of users. The cooperative base station combinations are dynamically applied since the preferred base station combinations of users may be different. We perform computer simulations to compare performance of the non-CoMP, full-CoMP and partial CoMP in terms of the average throughput using finite feedback and demonstrate the performance improvement of the proposed method.

• Journal of Communications and Networks
• /
• v.13 no.3
• /
• pp.232-239
• /
• 2011

This paper investigates the user selection problem of successive zero-forcing precoded multiuser multiple-input multiple-output (MU-MIMO) downlink systems, in which the base station and mobile receivers are equipped with multiple antennas. Assuming full knowledge of the channel state information at the transmitter, dirty paper coding (DPC) is an optimal precoding strategy, but practical implementation is difficult because of its excessive complexity. As a suboptimal DPC solution, successive zero-forcing DPC (SZF-DPC) was recently proposed; it employs partial interference cancellation at the transmitter with dirty paper encoding. Because of a dimensionality constraint, the base station may select a subset of users to serve in order to maximize the total throughput. The exhaustive search algorithm is optimal; however, its computational complexity is prohibitive. In this paper, we develop two low-complexity user scheduling algorithms to maximize the sum rate capacity of MU-MIMO systems with SZF-DPC. Both algorithms add one user at a time. The first algorithm selects the user with the maximum product of the maximum column norm and maximum eigenvalue. The second algorithm selects the user with the maximum product of the minimum column norm and minimum eigenvalue. Simulation results demonstrate that the second algorithm achieves a performance similar to that of a previously proposed capacity-based selection algorithm at a high signal-to-noise (SNR), and the first algorithm achieves performance very similar to that of a capacity-based algorithm at a low SNR, but both do so with much lower complexity.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.9
• /
• pp.4166-4182
• /
• 2018

We consider the Device-to-Device (D2D) communications in cellular networks where each cellular user (CU) shares the same resource with multiple D2D users (DUs). In this paper, we aim to maximize the energy efficiency (EE) of the D2D networks, subject to an interference constraint required by the CU. Since the cellular and D2D communications belong to different networks, we consider to incentivize base station (BS) while assisting the DUs. To this end, we propose a Stackelberg game based interference pricing framework for the considered D2D communications in cellular networks. Unlike most of the existing methods, we use interference pricing framework to jointly address the EE resource allocation problem and the interference management in our networks rather than only improve the EE of the DUs or protect cellular networks. In particular, BS and all the users do not need all channel state information, which is more realistic in practice. In addition, two different pricing strategies are also proposed. Based on the two strategies, we analyze the equilibrium of the game. Moreover, in the first strategy, the upper and lower boundaries of the interference price are obtained. The closed-form expression is gained with a backward induction for the second strategy. Both offer valuable insights to the considered scenarios. Finally, compared with the existing work, the EE of the D2D communications is significantly improved. The advantageous performance of our scheme are demonstrated by the simulation results.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.12 no.1
• /
• pp.7-13
• /
• 2002

Almost applications using fuzzy theory are based on the fuzzy inference. However fuzzy inference needs much time in calculation process for the fuzzy system with many input variables or many fuzzy labels defined on each variable. Inference time is dependent on the number of arithmetic Product in computation Process. Especially, the inference time is a primary constraint to fuzzy control applications using microprocessor or PC-based controller. In this paper, a simple fast fuzzy inference algorithm(FFIA), without loss of information, was proposed to reduce the inference time based on the fuzzy system with triangular membership functions in antecedent part of fuzzy rule. The proposed algorithm was induced by using partition of input state space and simple geometrical analysis. By using this scheme, we can take the same effect of the fuzzy rule reduction.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.21 no.3
• /
• pp.239-245
• /
• 2008

A level set based topological shape optimization using extended B-spline basis functions is developed for steady-state heat conduction problems. The only inside of complicated domain identified by the level set functions is taken into account in computation, so we can remove the effects of domain outside parts in heat conduction problem. The solution of Hamilton-Jacobi equation leads to an optimal shape according to the normal velocity field determined from the sensitivity analysis, minimizing a thermal compliance while satisfying a volume constraint. To obtain exact shape sensitivity, the precise normal and curvature of geometry need to be determined using the level set and B-spline basis functions. Using topological derivative concept, the nucleation of holes for topological changes can be made whenever and wherever necessary during the optimization.

• Journal of Communications and Networks
• /
• v.18 no.3
• /
• pp.375-386
• /
• 2016

Most existing studies on broadcast services in orthogonal frequency division multiplexing (OFDM) systems have focused on how to allocate the transmission power to the subcarriers. However, because a broadcasting system must guarantee quality of service to all users, the performance of the broadcast service dominantly depends on the channel state of the user who has the lowest received signal-to-noise ratio among users. To reduce the effect of the worst user on the system performance, we propose a joint delivery scheme of unicast and broadcast transmissions in OFDM systems with broadcast and unicast best-effort users. In the proposed joint delivery scheme, the BS delivers the broadcast information using both the broadcast and unicast subcarriers at the same time in order to improve the performance of the broadcast service. The object of the proposed scheme is to minimize the outage probability of the broadcast service while maximizing the sum-rate of best-effort users. For the proposed joint delivery scheme, we develop an adaptive power and subcarrier allocation algorithm under the constraint of total transmission power. This paper shows that the optimal power allocation over each subcarrier in the proposed scheme has a multi-level water filling form. Because the power allocation and the subcarrier assignment problems should be jointly solved, we develop an iterative algorithm to find the optimal solution. Numerical results show that the proposed joint delivery scheme with adaptive power and subcarrier allocation outperforms the conventional scheme in terms of the outage probability of the broadcast service and the sum-rate of best-effort users.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.4
• /
• pp.239-246
• /
• 2009

In this study, we analyze the mean waiting time on the nested open queueing network, where the population within each subnetwork is controlled by a semaphore queue. The queueing network can be transformed into a simpler queueing network in terms of customers waiting time. A major characteristic of this model is that the lower layer flow is halted by the state of higher layer. Since this type of queueing network does not have exact solutions for performance measure, the lower bound and upper bound on the mean waiting time are checked by comparing them with the mean waiting time in the transformed nested queueing network. Simulation estimates are obtained assuming Poisson arrivals and other phase-type arrival process, i.e., Erlang and hyper-exponential distributions. The bounds obtained can be applied to get more close approximation using the suitable approach.