• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권5호
• /
• pp.1069-1084
• /
• 2011

This paper considers an optimal base station clustering problem for designing a mobile (wireless) communication network. For a given network with a set of nodes (base stations), the problem is to optimally partition the set of nodes into subsets (each called a cluster) such that the associated inter-cluster traffic is minimized under certain topological constraints and cluster capacity constraints. In the problem analysis, the problem is formulated as an integer programming problem. The integer programming problem is then transformed into a binary integer programming problem, for which the associated linear programming relaxation is solved in a column generation approach assisted by a branch-and-bound procedure. For the column generation, both a heuristic algorithm and a valid inequality approach are exploited. Various numerical examples are solved to evaluate the effectiveness of the LP (Linear Programming) based branch-and-bound algorithm.

• 수산해양기술연구
• /
• 제49권2호
• /
• pp.153-160
• /
• 2013

Control allocation is an important part of a system. It implements the function that map the desired command forces from the controller into the commands of the different actuators. In this paper, the authors present an approach for solving constrained control allocation problem in vessel system by using multi-parametric quadratic programming (mp-QP) algorithm. The goal of mp-QP algorithm applied in this study is to compute a solution to minimize a quadratic performance index subject to linear equality and inequality constraints. The solution can be pre-computed off-line in the explicit form of a piecewise linear (PWL) function of the generalized forces and constrains. The efficiency of mp-QP approach is evaluated through a dynamic positioning simulation for a vessel by using four tugboats with constraints about limited pushing forces and found to work well.

• 대한전기학회논문지:전력기술부문A
• /
• 제55권12호
• /
• pp.549-554
• /
• 2006

Available transfer capability(ATC) is an important indicator of the usable amount of transmission capacity accessible by several parties for commercial trading in power transaction activities. This paper deals with an application of optimization technique for available transfer capability(ATC) calculation and analyzes the results of ATC by considering several constraints. Especially several optimization techniques are used to solve the ATC problem with state-steady security constraints. The results are compared with that of repeat power flow(RPF), sequential quadratic programming(SQP) and linear programming(LP). The proposed method is applied to 10 machines 39 buses model systems to show its effectiveness.

• ETRI Journal
• /
• 제38권6호
• /
• pp.1104-1113
• /
• 2016

Non-linear document navigation refers to the process of repeatedly reading a document at different levels to provide an overview, including selective reading to search for useful information within a document under time constraints. Currently, this function is not supported well by small-screen tablets. In this study, we propose the concept of structure-aware touch-based scrolling (SATS), which allows structural document navigation using region-dependent touch gestures for non-sequential navigation within tablets or tablet-sized e-book readers. In SATS, the screen is divided into four vertical sections representing the different structural levels of a document, where dragging into the different sections allows navigating from the macro to micro levels. The implementation of a prototype is presented, as well as details of a comparative evaluation using typical non-sequential navigation tasks performed under time constraints. The results showed that SATS obtained better performance, higher user satisfaction, and a lower usability workload compared with a conventional structural overview interface.

• 제어로봇시스템학회논문지
• /
• 제12권5호
• /
• pp.497-504
• /
• 2006

This paper presents a new technique that derives the dynamic acceleration bounds of multiple cooperating robot systems from given individual torque limits of robots. A set of linear algebraic homogeneous equation is derived from the dynamic equations of multiple robots with friction contacts. The mobility of the robot system is analyzed by the decomposition of the null space of the linear algebraic equation. The acceleration bounds of multiple robot systems are obtained from the joint torque constraints of robots by the medium of the decomposed null space. As the joint constraints of the robots are given in the infinite norm sense, the resultant acceleration bounds of the systems are described as polytopes. Several case studies are presented to validate the proposed method in this paper.

• 한국지능시스템학회논문지
• /
• 제19권6호
• /
• pp.840-847
• /
• 2009

This paper deals with an $H_{\infty}$ output feedback controller design for uncertain singularly perturbed T-S fuzzy systems. Integral quadratic constraints are used to describe various kinds of uncertainties of the plant. It is shown that the $H_{\infty}$ norm of the uncertain singularly perturbed fuzzy system is less than $\gamma$ for a sufficiently small $\varepsilon$ > 0 if the $H_{\infty}$ norms of both the slow and fast subsystem are less than $\gamma$. Using this fact, we develop a linear matrix inequality based design method which is independent of the singular perturbation parameter $\varepsilon$. A numerical example is provided to demonstrate the efficacy of the proposed design method.

• 한국시뮬레이션학회논문지
• /
• 제13권1호
• /
• pp.11-23
• /
• 2004

The decomposition of a structuring element for a morphological operation reduces the amount of the computation required for executing the operation. In this paper, we present a new technique for the decomposition of convex structuring elements for morphological operations. We formulated the linear constraints for the decomposition of a convex polygon in discrete space, then the constraints are applied to the decomposition of a convex structuring element. Also, a cost function is introduced to represent the optimal criteria for decomposition. We use linear integer programming technique to find the combination of basis structuring elements which minimizes the amount of the computation required for executing the morphological operation. Formulating different cost functions for different implementation methods and computer architectures, we can determine the optimal decompositions which guarantee the minimal amounts of computation on different computing environment.

• 한국컴퓨터그래픽스학회논문지
• /
• 제10권1호
• /
• pp.15-21
• /
• 2004

This paper proposes a real-time technique for simulating large rotational deformations. Modal analysis based on a linear strain tensor has been shown to be suitable for real-time simulation, but is accurate only for moderately small deformations. In the present work, we identify the rotational component of an infinitesimal deformation, and extend linear modal analysis to track that component. We then develop a procedure to integrate the small rotations occurring al the nodal points. An interesting feature of our formulation is that it can implement both position and orientation constraints in a straightforward manner. These constraints can be used to interactively manipulate the shape of a deformable solid by dragging/twisting a set of nodes, Experiments show that the proposed technique runs in real-time even for a complex model, and that it can simulate large bending and/or twisting deformations with acceptable realism.

• Steel and Composite Structures
• /
• 제14권5호
• /
• pp.431-451
• /
• 2013

The Big Bang-Big Crunch (BB-BC) optimization algorithm is developed for optimal design of non-linear steel frames with semi-rigid beam-to-column connections. The design algorithm obtains the minimum total cost which comprises total member plus connection costs by selecting suitable sections. Displacement and stress constraints together with the geometry constraints are imposed on the frame in the optimum design procedure. In addition, non-linear analyses considering the P-${\Delta}$ effects of beam-column members are performed during the optimization process. Three design examples with various types of connections are presented and the results show the efficiency of using semi-rigid connection models in comparing to rigid connections. The obtained optimum semi-rigid frames are more economical solutions and lead to more realistic predictions of response and strength of the structure.

• 대한전기학회논문지:전력기술부문A
• /
• 제54권12호
• /
• pp.586-591
• /
• 2005

This paper presents a method of minimizing of generation cost on individual electrical power utility. The method is based on the Economic Dispatch (ED) and linear Available Transfer Capability (ATC). The economic dispatch redistributes the total load to individual units to minimize the generation cost without transmission network constraints. The proposed method is implemented using ATC calculated from Power Transfer Distribution Factor (PTDF) for the transmission network constraints. The performance of the proposed method has been tested for the IEEE-30 bus system. It has also been observed that the results of the proposed method is compared with that of optimal power flow.