• Journal of Korean Society of Transportation
• /
• v.35 no.6
• /
• pp.525-544
• /
• 2017

With the advent of the big data era, the interest in the development of land using traffic data has increased significantly. However, the current research on traffic big data lingers around organizing or calibrating the data only. In this research, a novel method for discovering the hidden values within the traffic data through data mining is proposed. Considering the fact that traffic data and network structures have similarities, network analysis algorithms are used to find valuable information in the actual traffic volume data. The PageRank and HITS algorithms are then employed to find the centralities. While conventional methods present centralities based on uncomplicated traffic volume data, the proposed method provides more reasonable centrality locations through network analysis. Since the centrality locations that we have found carry detailed spatiotemporal characteristics, such information can be used as an objective basis for making policy decisions.

• Earthquakes and Structures
• /
• v.8 no.3
• /
• pp.639-663
• /
• 2015

Time history dynamic structural analysis is a time consuming procedure when used for large-scale structures or iterative analysis in structural optimization. This article proposes a new methodology for approximate prediction of extremum point of the response history via wavelets. The method changes original record into a reduced record, decreasing the computational time of the analysis. This reduced record can be utilized in iterative structural dynamic analysis of optimization and hence significantly reduces the overall computational effort. Design examples are included to demonstrate the capability and efficiency of the Reduced Record Method (RRM) when utilized in optimal design of frame structures using meta-heuristic algorithms.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.59 no.5
• /
• pp.972-980
• /
• 2010

In this study, we introduce the design methodology of an optimized type-2 fuzzy cascade controller with the aid of hierarchical fair competition-based genetic algorithm(HFCGA) for ball & beam system. The ball & beam system consists of servo motor, beam and ball, and remains mutually connected in line in itself. The ball & beam system determines the position of ball through the control of a servo motor. Consequently the displacement change of the position of the moving ball and its ensuing change of the angle of the beam results in the change of the position angle of a servo motor. The type-2 fuzzy cascade controller scheme consists of the outer controller and the inner controller as two cascaded fuzzy controllers. In type-2 fuzzy logic controller(FLC) as the expanded type of type-1 fuzzy logic controller(FLC), we can effectively improve the control characteristic by using the footprint of uncertainty(FOU) of membership function. The control parameters(scaling factors) of each fuzzy controller using HFCGA which is a kind of parallel genetic algorithms(PGAs). HFCGA helps alleviate the premature convergence being generated in conventional genetic algorithms(GAs). We estimated controller characteristic parameters of optimized type-2 fuzzy cascade controller applied ball & beam system such as maximum overshoot, delay time, rise time, settling time and steady-state error. For a detailed comparative analysis from the viewpoint of the performance results and the design methodology, the proposed method for the ball & beam system which is realized by the fuzzy cascade controller based on HFCGA, is presented in comparison with the conventional PD cascade controller based on serial genetic algorithms.

• Structural Engineering and Mechanics
• /
• v.60 no.6
• /
• pp.1093-1117
• /
• 2016

Global sensitivity analysis (GSA) has been widely used to investigate the sensitivity of the model output with respect to its input parameters. In this paper a new single-solution search optimization algorithm is developed based on the GSA, and applied to the size optimization of truss structures. In this method the search space of the optimization is determined using the sensitivity indicator of variables. Unlike the common meta-heuristic algorithms, where all the variables are simultaneously changed in the optimization process, in this approach the sensitive variables of solution are iteratively changed more rapidly than the less sensitive ones in the search space. Comparisons of the present results with those of some previous population-based meta-heuristic algorithms demonstrate its capability, especially for decreasing the number of fitness functions evaluations, in solving the presented benchmark problems.

• Structural Engineering and Mechanics
• /
• v.54 no.4
• /
• pp.665-691
• /
• 2015

This study aims at comparing the optimum design of two common types open web expanded beams: with hexagonal openings, also called castellated beams and beams with circular openings referred to as cellular beams. The minimum weights of both beams are taken as the objective functions while the design constraints are respectively implemented from The Steel Construction Institute Publication Numbers 5 and 100. The design methods adopted in these publications are consistent with BS5950 parts. The formulation of the design problem considering the limitations of the above mentioned turns out to be a discrete programming problem. Improved harmony search algorithm is suggested to compare the optimum design of mentioned web-expanded beams to analysis the performance of both beams. The design algorithms based on the technique select the optimum Universal Beam sections, dimensional properties of hexagonal and circular holes and total number of openings along the beam as design variables.

• Computers and Concrete
• /
• v.22 no.5
• /
• pp.493-500
• /
• 2018

Due to the fact that the ratio of their height to their openings is very large compared to normal beams, there are difficulties in the design and analysis of deep beams, which differ in behavior. In this study, the optimum horizontal and vertical reinforcement diameters of 5 different beams were determined by using genetic algorithms (GA) due to the openness/height ratio (L/h), loading condition and the presence of spaces in the body. In this study, the effect of different mutation operators and improved double times sensitive mutation (DTM) operator on GA's performance was investigated. In the study following random mutation (RM), boundary mutation (BM), non-uniform random mutation (NRM), Makinen, Periaux and Toivanen (MPT) mutation, power mutation (PM), polynomial mutation (PNM), and developed DTM mutation operators were applied to five deep beam problems were used to determine the minimum reinforcement diameter. The fitness values obtained using developed DTM mutation operator was higher than obtained from existing mutation operators. Moreover; obtained reinforcement weight of the deep beams using the developed DTM mutation operator lower than obtained from the existing mutation operators. As a result of the analyzes, the highest fitness value was obtained from the applied double times sensitive mutation (DTM) operator. In addition, it was found that this study, which was carried out using GAs, contributed to the solution of the problems experienced in the design of deep beams.

• Korean Journal of Computational Design and Engineering
• /
• v.4 no.4
• /
• pp.312-317
• /
• 1999

An inflection point on a curve is a point where the curvature vanishes. An inflection point is useful for various geometric operations such as the approximation of curves and intersection points between curves or curve approximations. An inflection point on planar Bezier curves can be easily detected using a hodograph and a derivative of hodograph, since the closed from of hodograph is known. In the case of rational Bezier curves, for the detection of inflection point, it is needed to use the first and the second derivatives have higher degree and are more complex than those of non-rational Bezier curvet. This paper presents three methods to detect inflection points of rational Bezier curves. Since the algorithms avoid explicit derivations of the first and the second derivatives of rational Bezier curve to generate polynomial of relatively lower degree, they turn out to be rather efficient. Presented also in this paper is the theoretical analysis of the performances of the algorithms as well as the experimental result.

• Korean Journal of Computational Design and Engineering
• /
• v.3 no.1
• /
• pp.1-14
• /
• 1998

This paper introduces non-manifold offsetting operations, which add or remove a uniform thickness from a given non-manifold model. Since these operations can be applied to not only solids but also wireframe or sheet objects, they are potentially useful for pipeline modeling, sheet metal and plastic part modeling, tolerance analysis, clearance checking, constant-radius rounding and filleting of solids, converting of abstracted models to solids, HC too1 path generation and so on. This paper describes mathematical properties and algorithms for non-manifold offsetting. In this algorithm, a sufficient set of tentative faces are generated first by offsetting all or a subset of the vertices, edges and faces of the non-manifold model. And then they are merged into a model using the Boolean operations. Finally topological entities which are within offset distance are removed. The partially modified offsetting algorithms for wireframes or sheets are also discussed in order to provide more practical offset models.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.7
• /
• pp.1219-1225
• /
• 2001

In this Paper we describe the design of synchronization algorithms for burst QPSK receiver, which are applicable to BWLL uplink. The demodulator consists of digital down converter, matched filter and synchronization circuits. For symbol timing recovery we ufo Gardner algorithm. And we use forth power method and decision directed method for carrier frequency recovery and phase recovery, respectively. For the sake of performance analysis, we compare simulation results with the board implemented by FPGA which is APEX20KE series chip for Alter. The performance results show it works quite well up to the condition that a frequency offset equal to 4.7% of symbol rate.

• Journal of Institute of Control, Robotics and Systems
• /
• v.17 no.6
• /
• pp.596-601
• /
• 2011

Autonomous navigating algorithms for mobile robots have been proved to be a difficult task. Based on the excellent homing performance shown by many insects, bio-inspired navigation algorithms for robotic experiments have been widely researched and applied to the design of navigational strategies for mobile robots. In this paper, among them, we analyze two simple landmark navigation methods their strengths and limits. We investigate the effect of the occlusion problem mainly, which is an important yet tough problem in many landmark navigation algorithms. In the point of view of the error of homing vector and the performance of the homing paths in the environment with artificial occlusions, we investigate the effect of occlusion problem in both methods in order to further study on solutions.