• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.6
• /
• pp.1635-1656
• /
• 2023

In Bayesian multi-target tracking, the Poisson multi-Bernoulli mixture (PMBM) filter is a state-of-the-art filter based on the methodology of random finite set which is a conjugate prior composed of Poisson point process (PPP) and multi-Bernoulli mixture (MBM). In order to improve the random finite set-based filter utilized in multi-target tracking of sensor scanning, this paper introduces the Poisson multi-Bernoulli mixture filter into time-matching Bayesian filtering framework and derive a tractable and principled method, namely: the time-matching Poisson multi-Bernoulli mixture (TM-PMBM) filter. We also provide the Gaussian mixture implementation of the TM-PMBM filter for linear-Gaussian dynamic and measurement models. Subsequently, we compare the performance of the TM-PMBM filter with other RFS filters based on time-matching method with different birth models under directional continuous scanning and out-of-order discontinuous scanning. The results of simulation demonstrate that the proposed filter not only can effectively reduce the influence of sampling time diversity, but also improve the estimated accuracy of target state along with cardinality.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.05a
• /
• pp.795-797
• /
• 2014

The visibility polygon of a simple polygon P is the set of points which are visible from a visibility source in P such as a point or an edge. Since a visibility polygon is the set of points, the set operations such as intersection and union can be executed on them. The intersection(resp. union) of two visibility polygons is the set of points which are visible from both (resp. either) of the corresponding two visibility sources. As previous results, there exist O(n) time algorithms for the set operations of two visibility polygons with total n vertices. In this paper, we present $O(log^2n)$ time algorithms for solving the problems on a reconfigurable mesh with size $O(n^2)$.

• Journal of The Korean Society of Grassland and Forage Science
• /
• v.4 no.3
• /
• pp.180-186
• /
• 1984

From June, 1980 to October, 1982, this study was carried out to find an optimal grazing system on the timothy and orchardgrass-dominated pasture. Five different systems consisted of set stocking, modified set stocking, rotational grazing, 'wye college' system and zero grazing have been applied. The results obtained were as follow: 1. Herbage DM yield per ha with 'wye college' system, set stocking, modified set stocking, rotational grazing and zero grazing were 6936.7 kg,6794.3 kg, 6686.9 kg 6675.7 kg and 5083.4 kg respectively. Among treatments were not different in DM yield. 2. In herbage utilization, zero grazing was the highest than other. Zero Grazing, Rotational grazing, 'Wye college' system, Modified set stocking and set stocking was 89.3%, 70.8%, 64.4% and 46.1% respectively. 3. Daily intake per head with 'wye college' system was the highest than others and zero grazing was the lowest than others. 4. Daily gain with 'wye college' system, rotational grazing, modified set stocking, set stocking and zero grazing were 0.60kg, 0.55kg, 0.50kg, 0.43kg and 0.42 respectively. Among treatment, there was no significance. 5. Total weight gain per ha with 'wye college' system, rotational grazing, modified set stocking, zero grazing and set stocking were 339.5kg, 299.1kg, 253.3kg, 226.6kg and 222.2kg respectively. 6. Grazing time among treatments was not significant. 'Wye college' system spent the shortest time, 367.3 minutes and set stocking consumed the longest time, 422.1 minutes. 7. Daily grazing time by seasonal change with June, July, August, September and October was 304.9 min., 359.4 min., 437.9 min., 483.3 min. and 395.8 min., respectively. According to passing the season, grazing time was lengthened. 8. Grazing time for Korean native cow, native cow charolais and native cow holstein were not significant. Native sow charolais consumed the longest time, 457.0 min., whereas Korean native cow consumed the shortest time, 422.4 min..

• Journal of Broadcast Engineering
• /
• v.27 no.2
• /
• pp.185-197
• /
• 2022

Recently, deep learning networks with high performance for object recognition are emerging. In the case of object recognition using deep learning, it is important to build a training data set to improve performance. To build a data set, we need to collect and label the images. This process requires a lot of time and manpower. For this reason, open data sets are used. However, there are objects that do not have large open data sets. One of them is data required for license plate detection and recognition. Therefore, in this paper, we propose an artificial license plate generator system that can create large data sets by minimizing images. In addition, the detection rate according to the artificial license plate arrangement structure was analyzed. As a result of the analysis, the best layout structure was FVC_III and B, and the most suitable network was D2Det. Although the artificial data set performance was 2-3% lower than that of the actual data set, the time to build the artificial data was about 11 times faster than the time to build the actual data set, proving that it is a time-efficient data set building system.

• Journal of Distribution Science
• /
• v.15 no.2
• /
• pp.15-20
• /
• 2017

Purpose - This paper aims to suggest a delivery constrained internet shopping optimization problem (DISOP) which must be solved for online recommendation system to provide a customized service considering cost and delivery conditions at the same time. Research design, data, and methodology - To solve a (DISOP), we propose a multi-objective formulation and a solution approach. By using a commercial optimization software (LINDO), a (DISOP) can be solved iteratively and a pareto optimal set can be calculated for real-sized problem. Results - We propose a new research problem which is different with internet shopping optimization problem since our problem considers not only the purchasing cost but also delivery conditions at the same time. Furthermore, we suggest a multi-objective mathematical formulation for our research problem and provide a solution approach to get a pareto optimal set by using numerical example. Conclusions - This paper proposes a multi-objective optimization problem to solve internet shopping optimization problem with delivery constraint and a solution approach to get a pareto optimal set. The results of research will contribute to develop a customized comparison and recommendation system to help more easy and smart online shopping service.

• Journal of Korea Society of Industrial Information Systems
• /
• v.7 no.4
• /
• pp.59-65
• /
• 2002

Payment systems in EC need confidentiality, integrity, non-repudiation. All transactions between cardholders and merchants must be authorized by a payment gateway in SET protocol. RSA secret key operation which requires heavy computation takes the most part of the time for payment authorization. For the reason, a heavy traffic of payment authorization requests from merchants causes the payment gateway to execute excessive RSA secret key operations, which may cause the bottleneck of the whole system. To resolve this problem, One-Time Password technique is applied to payment authorization step of the SET protocol.

• Journal of Electrical Engineering and Technology
• /
• v.12 no.1
• /
• pp.72-77
• /
• 2017

This paper proposes the explicit tuning rule of multi-loop PID controller for brushless direct current motors to predict the system behaviors in time and frequency domains, using properties of the convex combination method. The convex set of the proposed controllers formulates the envelope to satisfy the performances in time and frequency domains. The final control parameters are determined by solving the convex optimization problem subject to the constraints which are represented as convex set of time domain performances. The effectiveness of the proposed control method is shown in the numerical simulation, in which controller tuning algorithm and dynamics of brushless DC motor are well taken into account.

• Proceedings of the Korea Concrete Institute Conference
• /
• 2005.05b
• /
• pp.413-416
• /
• 2005

The super early hardening cement is widely used for reducing construction period. But there are some problems with handling the cement because the loss of workability is so big to control. In this study, the fluidity properties of super early hardening cement paste was evaluated at early age of hydration by using gel-time determination method. 4 types of set controlling agent were selected and combinations of them were used for gel-time test. As a result, the gel-time of super early hardening cement paste was extended up to 20 minutes by using the combinations of several types set controlling agent.

• Structural Engineering and Mechanics
• /
• v.71 no.2
• /
• pp.139-151
• /
• 2019

In a project schedule, it is possible to reduce the time required to complete a project by allocating extra resources for critical activities. However, accelerating a project causes additional expense. This issue is addressed by finding optimal set of time-cost alternatives and is known as the time-cost trade-off problem in the literature. The aim of this study is to identify the optimal set of time-cost alternatives using a multiobjective teaching-learning-based optimization (TLBO) algorithm integrated with the non-dominated sorting concept and is applied to successfully optimize the projects ranging from a small to medium large projects. Numerical simulations indicate that the utilized model searches and identifies optimal / near optimal trade-offs between project time and cost in construction engineering and management. Therefore, it is concluded that the developed TLBO-based multiobjective approach offers satisfactorily solutions for time-cost trade-off optimization problems.

• The Pure and Applied Mathematics
• /
• v.14 no.3
• /
• pp.191-196
• /
• 2007

The main components in the generalized Mandelbrot sets are under a theoretical investigation for their parametric boundary equations. Using the boundary geometries, a fast construction algorithm is introduced for the generalized Mandelbrot set. This fast algorithm definitely reduces the construction CPU time in comparison with the naive algorithm. Its graphic implementation displays the mysterious and beautiful fractal sets.