• Journal of the Korean Society of Industry Convergence
• /
• v.27 no.3
• /
• pp.555-561
• /
• 2024

This paper derives material properties of steel bars that simulate the distribution of stress and strain of prestressed tendons used in Prestressed concrete(PSC) girders and presents an optimal material model. ABAQUS software was used to establish the 3D solid model of the PSC girder and strand wire rope for a PS(Prestressed) tendon. Then the model of steel wire rope was imported into the Isight interface plugin directly through the ABAQUS and the Data Matching. In ABAQUS, the contact pairs were established, the models were meshed, the constraints were applied to solve the finite element model and an axial tension of 0.5m/s was loaded to analyze the stress and deformation distributions in the normal working range of the PS strand wire rope. In Data Matching, classical experimental data is fitted to the optimal material properties through finite element analysis and multi-objective optimization. The results show that the steel bar with optimal material properties presents a similar linear area and stress distribution with the PS tendon.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.3B
• /
• pp.183-198
• /
• 2006

We define the incomplete medium sharing system as a multi-channel shared medium communication system where constraints are imposed to the set of channels that may be allocated to some transmitter-receiver node pairs. To derive a centralized MAC scheme of a incomplete medium sharing system, we address the problem of optimal channel allocation The optimal channel allocation problem is then translated into a max-flow problem in a multi-commodity flow graph, and it is shown that the optimal solution can then be obtained by solving a linear programming problem. In addition, two suboptimal channel allocation schemes are proposed to bring down the computational complexity to a practical/feasible level; (1) one is a modified iSLIP channel allocation scheme, (2) the other is sequential channel allocation scheme. From the results of a extensive set of numerical experiments, it is found that the suboptimal schemes evaluate channel utilization close to that of the optimal schemes while requiring much less amount of computation than the optimal scheme. In particular, the sequential channel allocation scheme is shown to achieve higher channel utilization with less computational complexity than . the modified iSLIP channel allocation scheme.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• pp.83-86
• /
• 1996

In this paper we study the problem of augmenting a physical network to improve the topology for new survivable network architectures. We are given a graph G=(V,E,F), where V is a set of nodes that represents transmission systems which be interconnected by physical links, and E is a collection of edges that represent the possible pairs of nodes between which a direct transmission link can be placed. F, a subset of E is defined as a set of the existing direct links, and E/F is defined as a set of edges for the possible new connection. The cost of establishing network $N_{H}$=(V,H,F) is defined by the sum of the costs of the individual links contained in new link set H. We call that $N_{H}$=(V,H,F) is feasible if certain connectivity constrints can be satisfied in $N_{H}$=(V,H,F). The computational goal for the suggested model is to find a minimum cost network among the feasible solutions. For a k edge (node) connected component S .subeq. F, we charactrize some optimality conditions with respect to S. By this characterization we can find part of the network that formed by only F-edges. We do not need to augment E/F edges for these components in an optimal solution. Hence we shrink the related component into a node. We study some good primal heuristics by considering construction and exchange ideas. For the construction heuristics, we use some greedy methods and relaxation methods. For the improvement heuristics we generalize known exchange heuristics such as two-optimal cycle, three-optimal cycle, pretzel, quezel and one-optimal heuristics. Some computational experiments show that our heuristic is more efficient than some well known heuristics.stics.

• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.47-51
• /
• 2005

Using satellite images, an optimal solution to water motion has been presented in this study. Since temperature patterns are suitable tracers in water motion, Sea Surface Temperature (SST) images of Caspian Sea taken by MODIS sensor on board Terra satellite have been used in this study. Two daily SST images with 24 hours time interval are used as input data. Computation of templates correspondence between pairs of images is crucial within motion algorithms using non-rigid body objects. Image matching methods have been applied to estimate water body motion within the two SST images. The least squares matching technique, as a flexible technique for most data matching problems, offers an optimal spatial solution for the motion estimation. The algorithm allows for simultaneous local radiometric correction and local geometrical image orientation estimation. Actually, the correspondence between the two image templates is modeled both geometrically and radiometrically. Geometric component of the model includes six geometric transformation parameters and radiometric component of the model includes two radiometric transformation parameters. Using the algorithm, the parameters are automatically corrected, optimized and assessed iteratively by the least squares algorithm. The method used in this study, has presented more efficient and robust solution compared to the traditional motion estimation schemes.

• Proceedings of the KIEE Conference
• /
• 1992.07a
• /
• pp.214-217
• /
• 1992

This paper introduces a new methodology to apply the interpolation technique wi th optimum pattern to voltage-reactive power control of power system. The conventional tool for the optimal operation of power system is Optimal Power Flow(OPF) by standard optimization techniques. The achievement of solution through OPF programs has a defect of computation time, so that it is impossible to apply the OPF programs to the real-time control area. The proposed method presents a solution in a short period of time and an output with a good accuracy. The optimum pattern is a set of input-output pairs, where an input is a load level and a type of outage and an output is the result of OPF program corresponding to the input. The output in the OPF represents control variables of voltage-reactive power control. The interpolation technique is used to obtain the solution for an arbitrary input. As a result, the new technique helps operators in the process of the real-time voltage-reactive power control in both normal and emergency operating states.

• Journal of Institute of Control, Robotics and Systems
• /
• v.2 no.3
• /
• pp.181-187
• /
• 1996

A frictionless positioning device using cone-shaped active magnetic bearings(AMBs) is developed, which is driven by a brushless DC motor equipped with resolver. The cone-shaped AMB feature that the structure is simple and yet the five d.o.f. rotor motion is controlled by four magnet pairs. A linearized dynamic model, which accounts for the relationship between input voltage and output current in the cone-shaped magnet, is developed and the azimuth motion of the frictionless positioning device is modeled as the second order system. The feedback controller is designed by using linear quadratic regulator with integral action optimal control law so that the cone-shaped AMB system is stabilized and the frictionless positioning device gets the zero steady state. It is observed that the linearized dynamic model is adequate and the frictionless positioning device can achieve the tracking accuracy within the sensor resolution.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.34 no.2
• /
• pp.133-142
• /
• 2016

KOMPSAT-3A (KOrea Multi-Purpose SATellite-3A) was launched in March 25 2015 with specification of 0.5 meters resolution panchromatic and four 2.2 meters resolution multi spectral sensors in 12km swath width at nadir. To better understand KOMPSAT-3A positional accuracy, this paper reports a test result on the accuracy of recently released KOMPSAT-3A beta test images. A number of ground points were acquired from 1:1,000 digital topographic maps over the target area for the accuracy validation. First, the original RPCs (Rational Polynomial Coefficients) were validated without any GCPs (Ground Control Points). Then we continued the test by modeling the errors in the image space using shift-only, shift and drift, and the affine model. Ground restitution accuracy was also analyzed even though the across track image pairs do not have optimal convergence angle. The experimental results showed that the shift and drift-based RPCs correction was optimal showing comparable accuracy of less than 1.5 pixels with less GCPs compared to the affine model.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.5
• /
• pp.2177-2193
• /
• 2018

This paper studies resource allocation schemes for the relay-aided cooperative system consisting of multiple source-destination pairs and decode-forward (DF) relays. Specially, relaying selection, multisubcarrier pairing and assignment, and power allocation are investigated jointly. We consider a combinatorial optimization problem on quality of experience (QoE) and energy consumption based on relay-aided cooperative system. For providing better QoE and lower energy consumption we formulate a multi-objective optimization problem to maximize the total mean opinion score (MOS) value and minimize the total power consumption. To this end, we employ the nondominated sorting genetic algorithm version II (NSGA-II) and obtain sets of Pareto optimal solutions. Specially, two formulas are devised for the optimal solutions of the multi-objective optimization problems with and without a service priority constraint. Moreover, simulation results show that the proposed schemes are superior to the existing ones.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.3
• /
• pp.111-117
• /
• 2021

The delivery problem on a graph is that of minimizing the object delivery time from one vertex to another vertex on a graph with m vertices using n various speed robot agents. In this paper, we propose two optimal solution algorithms for the delivery problem on a graph with time complexity of O(㎥n) and O(㎥). After preprocessing to obtain the shortest path for all pairs of the graph, our algorithm processed by obtaining the shortest delivery path in the order of the vertices with the least delivery time. Assuming that the graph reflects the terrain on which to solve the problem, our O(㎥) algorithm actually has a time complexity of O(㎡n) as only one preprocessing is required for the various deployment of n robot agents.

• ETRI Journal
• /
• v.36 no.5
• /
• pp.808-818
• /
• 2014

To deal with the major challenges of embedded sensor networks, we consider the use of magnetic fields as a means of reliably transferring both information and power to embedded sensors. We focus on a power allocation strategy for an orthogonal frequency-division multiplexing system to maximize the transferred power under the required information capacity and total available power constraints. First, we consider the case of a co-receiver, where information and power can be extracted from the same signal. In this case, we find an optimal power allocation (OPA) and provide the upper bound of achievable transferred power and capacity pairs. However, the exact calculation of the OPA is computationally complex. Thus, we propose a low-complexity power reallocation algorithm. For practical consideration, we consider the case of a separated receiver (where information and power are transferred separately through different resources) and propose two heuristic power allocation algorithms. Through simulations using the Agilent Advanced Design System and Ansoft High Frequency Structure Simulator, we validate the magnetic-inductive channel characteristic. In addition, we show the performances of the proposed algorithms by providing achievable ${\eta}$-C regions.