• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1999.10a
• /
• pp.333-342
• /
• 1999

An improved optimization algorithm for multi-objective and multi-level (MO/ML) optimum design of steel frames is proposed in this paper. In order to optimize the steel frames under seismic load, two main objective functions need to be considered for minimizing the structural weight and maximizing the strain energy. For the efficiency of the proposed method, well known multi-level optimization techniques using decomposition method that separately utilizes both system-level and element-level optimizations and an artificial constraint deletion technique are incorporated in the algorithm. And also dynamic analysis is executed to evaluate the implicit function of structural strain energy at each iteration step. To save the numerical efforts, an efficient reanalysis technique through sensitivity analysis of dynamic properties is unposed in the paper. The efficiency and robustness of the improved MOML algorithm, compared with a plain MOML algorithm, is successfully demonstrated in the numerical examples.

• Korean Journal of Computational Design and Engineering
• /
• v.14 no.4
• /
• pp.217-224
• /
• 2009

Most divide-and-conquer implementations for Delaunay triangulation utilize quad-edge or winged-edge data structure since triangles are frequently deleted and created during the merge process. How-ever, the proposed divide-and-conquer algorithm utilizes the array based data structure that is much simpler than the quad-edge data structure and requires less memory allocation. The proposed algorithm has two important features. Firstly, the information of space partitioning is represented as a permutation vector sequence in a vertices array, thus no additional data is required for the space partitioning. The permutation vector represents adaptively divided regions in two dimensions. The two-dimensional partitioning of the space is more efficient than one-dimensional partitioning in the merge process. Secondly, there is no deletion of edge in merge process and thus no bookkeeping of complex intermediate state for topology change is necessary. The algorithm is described in a compact manner with the proposed data structures and operators so that it can be easily implemented with computational efficiency.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.4
• /
• pp.572-584
• /
• 1993

In this paper, we propose an efficient method to allocate carrier frequencies so as to minimize intermodulation products in two-level SCPC systems in which Hub station and many Remote stations communicate each other through the satellite transponder. Also we present a very efficient method to evaluate intermodulation products with highly reduced CPU time in two-level SCPC systems. We study and analyze the performance of some possible methods to extend the Deletion and Insertion operation, which is proposed by Okinaka and applied to only one-level SCPC systems, to two-level SCPC systems. The proposed algorithm is carefully selected out of these methods and is optimized, which shows superior performance to any other published strategies, especially in that it has very excellent characteristics in terms of generality for practical application. Considering the fact that most published strategies are seldom applicable to actual two-level SCPC systems, we can say that the proposed algorithm in this paper is quite meaningful.

• The KIPS Transactions:PartA
• /
• v.10A no.6
• /
• pp.665-670
• /
• 2003

In the applications like automatic masks generation for semiconductor production, a drawing consists of lots of polygons that are partitioned into trapezoids. The addition/deletion of a polygon to/from the drawing is performed through geometric operations such as insertion, deletion, and search of trapezoids. Depending on partitioning algorithm being used, a polygon can be partitioned differently in terms of shape, size, and so on. So, It's necessary to invent some comparison algorithm of sets of trapezoids in which each set represents interested parts of a drawing. This comparison algorithm, for example, may be used to verify a software program handling geometric objects consisted of trapezoids. In this paper, given k sets of trapezoids in which each set forms the regions of interest of each drawing, we present how to compare the k sets to see if all k sets represent the same geometric scene. When each input set has the same number n of trapezoids, the algorithm proposed has O(2$^{k-2}$ $n^2$(log n＋k)) time complexity. It is also shown that the algorithm suggested has the same time complexity O( $n^2$ log n) as the sweeping-based algorithm when the number k(<< n) of input sets is small. Furthermore, the proposed algorithm can be kn times faster than the sweeping-based algorithm when all the trapezoids in the k input sets are almost the same.

• Journal of KIISE:Databases
• /
• v.31 no.2
• /
• pp.83-90
• /
• 2004

In this paper, we study the CCD(Clustering with Circular Distance) and the COD(Clustering with Obstructed Distance) problems to be considered when objects are being clustered in a circularly search space and a search space with the presence of obstacles. We also propose a now clustering algorithm for clustering efficiently objects that the insertion or the deletion is occurring frequently in multi-dimensional search space. The distance function for solving the CCD and COD Problems is defined in the Proposed clustering algorithm. This algorithm is included a clustering method to create clusters that have a high spatial locality by minimum computation time.

• Journal of the Korean Statistical Society
• /
• v.21 no.1
• /
• pp.35-46
• /
• 1992

On Box-Cox transformation, one or few responses are influential on transformation parameter estimator. To detect influential observatins, several diagnostics (Cook and Wang 1983, Hinkley and Wang 1988, Lawrance 1988, Tsai and Wu 1990) have been suggested. We compare these diagnostics and denote the necessity of multiple cases deletion which is important especially when the masking effect is present. Also, analytic expression of Tsai and Wu's diagnostic is given. We suggest a computationally feasible and useful algorithm based on the basic building blocks, and present descriptive examples using artificial data.

• Journal of Broadcast Engineering
• /
• v.23 no.6
• /
• pp.886-895
• /
• 2018

In this paper, we introduce a technique to detect the video forgery by using the regularity that occurs in the video compression process. The proposed method uses the hierarchical regularity lost by the video double compression and the frame deletion. In order to extract such irregularities, the depth information of CU and TU, which are basic units of HEVC, is used. For improving performance, we make a depth map of CU and TU using local information, and then create input data by grouping them in GoP units. We made a decision whether or not the video is double-compressed and forged by using a general three-dimensional convolutional neural network. Experimental results show that it is more effective to detect whether or not the video is forged compared with the results using the existing machine learning algorithm.

• Transactions of the Korean Society of Machine Tool Engineers
• /
• v.13 no.6
• /
• pp.87-93
• /
• 2004

An experimental is carried out to investigate the characteristics of blanking for nickel alloy Alloy42 (t=0.203mm), a kind of IC lead frame material. By varying clearance between die and punch the shapes of shear profile are examined. Finite element analysis with element deletion algorithm for ductile fracture mode is also carried out to study the effect of clearance theoretically and to compare with experimental results. The rectangular shape specimen with four different comer radius is used to study the characteristics of blanking for straight side and comer region simultaneously. As the result the ratios measured k(m experiment of roll over, burnish and fracture zone based on initial blank thickness are compared with those of FE analysis. Both experiment and FE analysis show that the amount of mil over and fracture is increased as the clearance increases. When the radius of comer is less than thickness of blank it has been found that larger clearance is required than that of straight region in order to maintain same quality of shear profile at the comer region.

• Journal of the Korean Society for Precision Engineering
• /
• v.18 no.3
• /
• pp.182-188
• /
• 2001

An experiment is carried out to investigate the characteristics of blanking for copper alloy C194 (t=0.254mm), a kind of IC lead frame material. By varying clearance between die and punch, the shapes of shear profile are examined. Finite element analysis with element deletion algorithm for ductile fracture mode is also carried out to study the effect of clearance theoretically and to compare with experimental results. The rectangular shape specimen with four different corner radius is used to study the characteristics of blanking for straight side and corner region simultaneously. As the result, the ratios measured from the experiment of roll over, burnish, and fracture zone based on intial blank thickness are compared with those of FE analysis. Both experiment and FE analysis show that the amount of roll over and fracture is increased as the clearance increases. It has been found that larger clearance is required than that of straight region when the radius of corner is less than thickness of blank, in order to maintain same quality of shear profile at the corner region.

• International Journal of Computer Science & Network Security
• /
• v.23 no.9
• /
• pp.134-140
• /
• 2023

The distributed system is playing a vital role in storing and processing big data and data generation is speedily increasing from various sources every second. Hadoop has a scalable, and efficient distributed system supporting commodity hardware by combining different networks in the topographical locality. Node support in the Hadoop cluster is rapidly increasing in different versions which are facing difficulty to manage clusters. Hadoop does not provide Node management, adding and deletion node futures. Node identification in a cluster completely depends on DHCP servers which managing IP addresses, hostname based on the physical address (MAC) address of each Node. There is a scope to the hacker to theft the data using IP or Hostname and creating a disturbance in a distributed system by adding a malicious node, assigning duplicate IP. This paper proposing novel node management for the distributed system using DNA hiding and generating a unique key using a unique physical address (MAC) of each node and hostname. The proposed mechanism is providing better node management for the Hadoop cluster providing adding and deletion node mechanism by using limited computations and providing better node security from hackers. The main target of this paper is to propose an algorithm to implement Node information hiding in DNA sequences to increase and provide security to the node from hackers.