• Structural Engineering and Mechanics
• /
• v.70 no.3
• /
• pp.367-380
• /
• 2019

The paper concerns topology and geometry optimization of statically determinate beams with arbitrary number of supports. The optimization problem is treated as a bi-criteria one, with the objectives of minimizing the absolute maximum bending moment and the maximum deflection for a uniform gravity load. The problem is formulated and solved using the Pareto optimality concept and the lexicographic ordering of the objectives. The non-dominated sorting genetic algorithm NSGA-II and the local search method are used for the optimization in the Pareto sense, whereas the genetic algorithm and the exhaustive search method for the lexicographic optimization. Trade-offs between objectives are examined and sets of Pareto-optimal solutions are provided for different topologies. Lexicographically optimal beams are found assuming that the maximum moment is a more important criterion. Exact formulas for locations and values of the maximum deflection are given for all lexicographically optimal beams of any topology and any number of supports. Topologies with lexicographically optimal geometries are classified into equivalence classes, and specific features of these classes are discussed. A qualitative principle of the division of topologies equivalent in terms of the maximum moment into topologies better and worse in terms of the maximum deflection is found.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.6 no.1
• /
• pp.47-52
• /
• 2002

In this paper we propose a simple decoding algorithm for the 4-ary lexicographic codes (or lexicodes) of length 10 with minimum distance 4, write $S_{10,4}$. It is based on the syndrome decoding method. That is, using a syndrome vector we detect an error and it will be corrected an error from the four parity check equations.

• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.1
• /
• pp.27-34
• /
• 2010

Web crawlers are fundamental programs which iteratively download web pages by following links of web pages starting from a small set of initial URLs. Previously several web crawling orderings have been proposed to crawl popular web pages in preference to other pages, but some graph search techniques whose characteristics and efficient implementations had been studied in graph theory community have not been applied yet for web crawling orderings. In this paper we consider various graph search techniques including lexicographic breadth-first search, lexicographic depth-first search and maximum cardinality search as well as well-known breadth-first search and depth-first search, and then choose effective web crawling orderings which have linear time complexity and crawl popular pages early. Especially, for maximum cardinality search and lexicographic breadth-first search whose implementations are non-trivial, we propose linear-time web crawling orderings by applying the partition refinement method. Experimental results show that maximum cardinality search has desirable properties in both time complexity and the quality of crawled pages.

• Journal of Environmental Impact Assessment
• /
• v.7 no.2
• /
• pp.89-102
• /
• 1998

The purpose of this study is to seek AEI(Air Environmental Indices), PSI(Pollutant Standard Index) and the urban air quality control goal(the best available alternative energy program) by assessing the best ratio of energy types used in urban enterprises, based on harmful health effect and air quality standard and costs. This study is focused on an urban area(Puchun), where area sourcees are associated with heavy traffic, large population, and its industrial sources with large emissions. In the first step, air modeling, estimation of AEI and PSI, and benefit-cost analysis were carried out. In the second step, we assessed that 660 scenarios about the ratio of B-C oil, light oil and LNG used in urban enterprises with regard to air quality and cost. In the third step, the best available alternative energy program was selected for the ratio of energy species(B-C oil, light oil and LNG) by using the lexicographic method. From the emission analysis, main source of $NO_2$ is identified as industries and air quality is evaluated according to the ratio of B-C oil, light oil and LNG used in urban enterprise. The modeling data of TSP, $SO_2$, $NO_2$, CO, $O_3$, by ISC3 and PBM are respectively $118{\mu}g/m^3$, 0.027ppm, 0.025ppm, 2.0ppm, 0.55ppm in indurstrial area. That data are close to Environmental Air Quality Standard. By means of sensitivity analysis, we obtained the difference in concentration between the areas(Nae-dong, Joong-dong) according to the ratio of B-C oil, light oil and LNG used in the industries. From the result of alternatives assessment the lowest AEI value and cost, the ratio of B-C oil, light oil and LNG are 2.5%, 20%, 77.5%, respectively.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.20 no.44
• /
• pp.135-151
• /
• 1997

In this paper, we propose a simple and relatively efficient heuristic method to determine job sequencing in the flow-shop considering multiple criteria such as processing time, due date and cost. The proposed method is applicable to the flow- shop where the jobs are released simultaneously and their processing sequence is predetermined and not changed until the whole jobs are processed. To develop this method, we mixed and modified some well-known multi-attribute decision heuristics such as the simple linear weighting scheme, the lexicographic rule and the 'elimination by aspect' rule. Some computer simulations were conducted to test the efficiency of the proposed method and it has been compared with the SWPT (Shortest Working Processing Time) rule and EDD (Earliest Due Date) rule. The results show that our method is as effective as the traditional ones in terms of mean flow time, tardiness, makespan, cycle time, machine utilization, etc., and proved to be much simpler and more flexible to be used in real situations.

• The Journal of the Korea Contents Association
• /
• v.11 no.5
• /
• pp.67-74
• /
• 2011

Collaborative recommendation is one of the most widely used methods of automated product recommendation in e-Commerce. For analyzing the customer's preference, traditional explicit ratings are less desirable than implicit ratings because it may impose an additional burden to the customers of e-commerce companies which deals with a number of products. Cardinal scales generally used for representing the preference intensity also ineffective owing to its increasing estimation errors. In this paper, we propose a new way of constructing the ordinal scale-based customer profile for collaborative recommendation. A Web usage mining technique and lexicographic consensus are employed. An experiment shows that the proposed method performs better than existing CF methodologies.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1993.06a
• /
• pp.1350-1353
• /
• 1993

A fuzzy control system typically requires“tuning,”or adjuctment of the parameters defining its linguistic variables. Automating this process amounts to applying a second“metacontrol”layer to drive the controller and plant to desired performance levels. Current methods of automated tuning rely on a single crisp numeric functional to evaluate control system performance. A generalization of Box's complex algorithm allows more realistic tuning based on lexicographic aggregation of multiple ordinal scales of performance, such as effectiveness and efficiency. The method is presented and illustrated using a simple inverted pendulum control system.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.23 no.6
• /
• pp.1103-1110
• /
• 2013

This paper proposes a method of identifying ownership of personal information in Social Network Service. In detail, the proposed method automatically decides whether any location information mentioned in twitter indicates the publisher's residence area. Identifying ownership of personal information is necessary part of evaluating risk of opened personal information online. The proposed method uses a set of decision rules that considers 13 features that are lexicographic and syntactic characteristics of the tweet sentences. In an experiment using real twitter data, the proposed method shows better performance (f1-score: 0.876) than the conventional document classification models such as naive bayesian that uses n-gram as a feature set.

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

Trying to deal with the problem of low robustness of Copy-Move Forgery Detection (CMFD) under various transformation and degradation attacks, a novel CMFD method is proposed in this paper. The main advantages of proposed work include: (1) Discrete Analytical Fourier-Mellin Transform (DAFMT) and Locality Sensitive Hashing (LSH) are combined to extract the block features and detect the potential copy-move pairs; (2) The Euclidian distance is incorporated in the pixel variance to filter out the false potential copy-move pairs in the post-verification step. In addition to extracting the effective features of an image block, the DAMFT has the properties of rotation and scale invariance. Unlike the traditional lexicographic sorting method, LSH is robust to the degradations of Gaussian noise and JEPG compression. Because most of the false copy-move pairs locate closely to each other in the spatial domain or are in the homogeneous regions, the Euclidian distance and pixel variance are employed in the post-verification step. After evaluating the proposed method by the precision-recall-$F_1$ model quantitatively based on the Image Manipulation Dataset (IMD) and Copy-Move Hard Dataset (CMHD), our method outperforms Emam et al.'s and Li et al.'s works in the recall and $F_1$ aspects.

• Journal of Navigation and Port Research
• /
• v.36 no.5
• /
• pp.387-394
• /
• 2012

In an automated container terminal, automated stacking cranes(ASCs) take charge of handling of containers in a block of the stacking yard. This paper proposes a multi-criteria strategy to solve the problem of job dispatching of twin ASCs which are identical to each another in size and specification. To consider terminal situation from different angles, the proposed method evaluates candidate jobs through various factors and it dispatches the best score job to a crane by doing a weighted sum of the evaluated values. In this paper, we derive the criteria for job dispatching strategy, and we propose a genetic algorithm to optimize weights for aggregating evaluated results. Experimental results are shown that it is suitable for real time terminal with lower computational cost and the strategy using various criteria improves the efficiency of the container terminal.