• Journal of information and communication convergence engineering
• /
• v.20 no.2
• /
• pp.90-95
• /
• 2022

This paper proposes a method to find a tree with the maximum number of terminals that can be connected by a given length when numerous terminals distributed in a cluster form are given to the Euclidean plane R2 with several constraints. First constraint is that a given terminal is distributed in a cluster form, second is that a given length cannot connect all terminals in the tree, and third is that there is no curved connection between each terminal. This paper proposes a method to establish more efficient interconnections within terminals distributed in a cluster form by improving a randomly distributed memetic genetic algorithm. The construction of interconnections has been extensively used in design-related fields, from networking to architecture. Additionally, in real life, the construction of interconnections is mostly distributed in the form of clusters. Therefore, the heuristic algorithm proposed in this paper can be effectively utilized in real life and is expected to provide various cost savings.

• Annual Conference of KIPS
• /
• 2010.11a
• /
• pp.613-616
• /
• 2010

본 논문에서는 새로운 움직임 추정(motion estimation, ME) 방식을 사용한 프레임 비율 변환(frame rate conversion, FRC) 기법에 대해 제안한다. 기존의 프레임 비율 변환을 위한 움직임 추정 방식은 영상 압축에서 사용되고 있는 SAD를 사용하여 블록(block) 단위로 움직임 벡터를 추정하는 방식에 기초를 두고 있다. 그러나 잔여 신호(residual signal)를 저장하는 영상 압축과 달리, 잘못된 움직임 추정은 합성된 출력 영상에서 심각한 품질 저하를 가져올 수 있다. 이를 보완하기 위해 움직임 개선(motion refinement, MR)이 사용되고 있지만, 근본적인 해결을 위해서는 정확한 움직임 추정 알고리즘 사용이 필요하다. 특히 SAD를 통한 움직임 추정은 고르지 못한 움직임 벡터장(motion vector field, MVF)을 형성할 수 있으며, 종래의 연구에서 이를 해결하기 위해 SAD(sum of absolute difference)에 벡터의 공간제약(spatial constraint) 항목을 추가하여 비교적 고른 움직임 벡터장을 형성하는 방식이 제시되었다. SAD와 공간 제약 항목의 반영 비율에 따라 움직임 벡터의 중요성과 움직임 벡터장의 일관성이 서로 상충하는데, 기존의 방식은 이 비율을 일정한 상수(constant)값을 사용하고 있으며, 이러한 방식은 이미지의 특성에 따라 결과가 달라진다. 본 논문에서는 SAD와 공간 제약 항목 사이의 반영 비율을 이미지의 특성에 적응하는 방식을 사용하는 움직임 예측을 제시하고, 수행한 결과를 기존의 방식에 의한 결과와 비교하였다.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.7
• /
• pp.1-8
• /
• 2009

In this paper, make a study decision problem called an optimal release policies after testing a software system in development phase and transfer it to the user. The optimal software release policies which minimize a total average software cost of development and maintenance under the constraint of satisfying a software reliability requirement is generally accepted. The Bayesian parametric inference of model using log Poisson execution time employ tool of Markov chain(Gibbs sampling and Metropolis algorithm). In a numerical example by T1 data was illustrated. make out estimating software optimal release time from the maximum likelihood estimation and Bayesian parametric estimation.

• Journal of Distribution Science
• /
• v.22 no.9
• /
• pp.85-95
• /
• 2024

Purpose: Online food delivery platforms face challenges to operational efficiency due to increasing demand, a shortage of drivers, and the constraint of a one-order-at-a-time delivery policy. It is imperative to find solutions to address the inefficiencies in the food delivery industry. Bundling multiple orders can help resolve these issues, but it requires complex computations due to the exponential increase in possible order combinations. Research design, data and methodology: This study proposes three bundle delivery systems-static, dynamic, and hybrid-utilizing a machine learning-based classification model to reduce the number of order combinations for efficient bundle computation. The proposed systems are analyzed through simulations using market data from South Korea's online food delivery platforms. Results: Our findings indicate that implementing bundle systems extends service coverage to more customers, increases average driver earnings, and maintains lead times comparable to standalone deliveries. Additionally, the platform experiences higher service completion rates and increased profitability. Conclusions: This suggests that bundle systems are cost-effective and beneficial for all stakeholders in online food delivery platforms, effectively addressing the inefficiencies in the industry.

• Journal of Distribution Science
• /
• v.10 no.10
• /
• pp.25-33
• /
• 2012

Purpose - The Garak agricultural wholesale market ('Garak Market') plays a central role in the distribution of agricultural products in Korea and is important in connecting consumers with producers. However, problems regarding inefficiencies and the high-cost structure of the wholesale market's distribution/logistical system are being raised in relation to severe competition among retailers. Furthermore, the service needs of retailers and market users are not being fulfilled due to the inconsistency of the wholesale market's functions and facilities, thus reducing the competitiveness of the market. In this regard, innovative changes are being requested of the agricultural wholesale market according to changes in the agricultural product distribution environment. In particular, the lack of unloading facilities and the outdated unloading system of the wholesale market must be improved to enhance system efficiency. Research design, data, and methodology - This study observed the problems of the unloading system of the agricultural wholesale market in order to present relevant measures for improvement. The need for unloading auctions was also researched in this study. The survey of 70 forwarders belonging to the producing district distributor association of the Garak market was conducted by post. Additionally, 20 auction dealers and 59 shippers and transporters were individually interviewed. The survey on the need for unloading auctions used five-point Likert Scales. The statistical analysis was conducted with SPSS WIN 12.0 software. Results - First, the wholesale market must employ members of the unloading labor union to allow these employees to directly manage the unloading process. Second, it is crucial to revise regulations to ensure that the principal agent pays the unloading cost according to the standard unloading cost system. Third, the vehicle auction carried out for certain vegetable products must be converted to the unloaded auction system. According to the related interviews with the wholesale market's distribution agents, whereas shippers and transporters recognized the need for unloaded auctions, auction dealers tend to have a negative view of this system. Furthermore, the stated reasons in favor of unloaded cabbage, radish, and other vegetable auctions were prevention of constraint, creation of transparent trade conditions, and reduction of corrected seller tickets. Many of the respondents answered that the transport cost reduction rate in unloaded auctions must be below 20%. Fourth, the unloading system must be mechanized and a detailed, reasonable plan must be provided to settle the existing conflict with the unloading labor union. Conclusions - The proposals in this study are expected to play an important role in improving the cargo handling system of the wholesale agricultural product market in the future. Improving the system is expected to help shore up the competitiveness of the industry. If all the related bodies closely cooperate with each other and work harder, taking advantage of the synergies created by the facility modernization project, the Garak market will play a pivotal role in the distribution of agricultural products.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.13 no.2
• /
• pp.73-84
• /
• 1993

In this research, configuration design optimization of plane truss structure has been tested by using decomposition technique. In the first level, the problem of transferring the nonlinear programming problem to linear programming problem has been effectively solved and the number of the structural analysis necessary for doing the sensitivity analysis can be decreased by developing stress constraint into member stress approximation according to the design space approach which has been proved to be efficient to the sensitivity analysis. And the weight function has been adopted as cost function in order to minimize structures. For the design constraint, allowable stress, buckling stress, displacement constraint under multi-condition and upper and lower constraints of the design variable are considered. In the second level, the nodal point coordinates of the truss structure are used as coordinating variable and the objective function has been taken as the weight function. By treating the nodal point coordinates as design variable, unconstrained optimal design problems are easy to solve. The decomposition method which optimize the section areas in the first level and optimize configuration variables in the second level was applied to the plane truss structures. The numerical comparisons with results which are obtained from numerical test for several truss structures with various shapes and any design criteria show that convergence rate is very fast regardless of constraint types and configuration of truss structures. And the optimal configuration of the truss structures obtained in this study is almost the identical one from other results. The total weight couldbe decreased by 5.4% - 15.4% when optimal configuration was accomplished, though there is some difference.

• KIPS Transactions on Software and Data Engineering
• /
• v.7 no.3
• /
• pp.77-90
• /
• 2018

Software Defect Prediction (SDP) is a field of study that identifies defective modules. With insufficient local data, a company can exploit Cross-Project Defect Prediction (CPDP), a way to build a classifier using dataset collected from other companies. Most machine learning algorithms for SDP have used more than one parameter that significantly affects prediction performance depending on different values. The objective of this study is to propose a parameter selection technique to enhance the performance of CPDP. Using a Harmony Search algorithm (HS), our approach tunes parameters of cost-sensitive boosting, a method to tackle class imbalance causing the difficulty of prediction. According to distributional characteristics, parameter ranges and constraint rules between parameters are defined and applied to HS. The proposed approach is compared with three CPDP methods and a Within-Project Defect Prediction (WPDP) method over fifteen target projects. The experimental results indicate that the proposed model outperforms the other CPDP methods in the context of class imbalance. Unlike the previous researches showing high probability of false alarm or low probability of detection, our approach provides acceptable high PD and low PF while providing high overall performance. It also provides similar performance compared with WPDP.

• Journal of Astronomy and Space Sciences
• /
• v.22 no.1
• /
• pp.21-34
• /
• 2005

The initial conditions that generate bounded motion in eccentric reference orbit are determined for satellite formation flying. Because Hill's equations cannot describe the relative motion between two satellites in eccentric orbit, a new relative dynamics utilizing the nonlinearity and eccentricity correction for Hill's initial conditions is implemented. The constraint that matches angular rates of chief and deputy satellites is used to obtain the bounded motion between them. The constraint can be applied to satellite formation motions in eccentric orbit, since it implicates J2 perturbation due to the central body's aspherical gravitational forces. The periodic bounded motions are analyzed for the orbit with the eccentricity of less than 0.05 and about 0.5 km relative distance between chief and deputy satellites. It is mainly illustrated that the satellite formations in small eccentric orbits can have hounded motions; consequently, the formation can be kept by matching angular rates of the satellites. These results demonstrate an useful method that reduces the cost for operating satellites by providing effective initial conditions for satellite formation flying in eccentric orbit.

• Journal of the Korean Institute of Telematics and Electronics T
• /
• v.36T no.4
• /
• pp.71-81
• /
• 1999

We propose a new CPLD(Complexity Programmable Logic Device) technology mapping algorithm improving run-time under time constraint. In our technology mapping algorithm, a given logic equation is constructed as the DAG(Directed Acyclic Graph) type, then the DAG is reconstructed by replicating the node that outdegree is more than or equal to 2. As a result, it makes delay time and the number of CLBs, run-time to be minimized. Also, after the number of multi-level is defined and cost of each nodes is calculated, the graph is partitioned in order to fit to k that is the number of OR term within CLB. The partitioned nodes are merged through collapsing and bin packing is performed in order to fit to the number of OR term within CLB(Configurable Logic Block). In the results of experiments to MCNC circuits for logic synthesis benchmark, we can shows that proposed technology mapping algorithm reduces run-time and the number of CLBs much more than the TEMPLA.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.29 no.6
• /
• pp.555-562
• /
• 2016

Seismic design of braced frames that simultaneously considers economic issues and structural performance represents a rather complicated engineering problem, and therefore, a systematic and well-established methodology is needed. This study proposes a multi-objective seismic design method for an inverted V-braced frame with suspended zipper struts that uses the non-dominated sorting genetic algorithm-II(NSGA-II). The structural weight and the maximum inter-story drift ratio as the objective functions are simultaneously minimized to optimize the cost and seismic performance of the structure. To investigate which of strength- and performance-based design criteria for braced frames is the critical design condition, the constraint conditions on the two design methods are simultaneously considered (i.e. the constraint conditions based on the strength and plastic deformation of members). The linear static analysis method and the nonlinear static analysis method are adopted to check the strength- and plastic deformation-based design constraints, respectively. The proposed optimal method are applied to three- and six-story steel frame examples, and the solutions improved for the considered objective functions were found.