• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.10a
• /
• pp.560-567
• /
• 1998

This paper concerned about a imputed color printed material image in camera to decrease noise and distortion by processing median filtering with input image to identical condition. Also this paper proposed the way of compares a normal printed material with an abnormal printed material color tone with trained a learning of the error back-propagation to block classification by extracting five place from identical block(3${\times}$3) of color printed material R, G, B value. As a representative algorithm of multi-layer perceptron the error Back-propagation technique used to solve complex problems. However, the Error Back-propagation is algorithm which basically used a gradient descent method which can be converged to local minimum and the Back Propagation train include problems, and that may converge in a local minimum rather than get a global minimum. The network structure appropriate for a given problem. In this paper, a good result is obtained by improve initial condition and adjust th number of hidden layer to solve the problem of real time process, learning and train.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.2331-2336
• /
• 2005

This paper proposes a new haptic device using a parallel mechanism with gimbal type actuators. This device has three legs actuated by 2-DOF gimbal mechanisms, which make the device simple and light by fixing all the actuators to the base. Three extra sensors are placed at passive joints to obtain a unique solution of the forward kinematics problem. The proposed haptic device is developed for an operator to use it on a desktop in due consideration of the size of an average Korean. The proposed haptic device has a small workspace for on operator to use it on a desktop and more sensitivity than a serial type haptic device. Therefore, the motors of the proposed haptic device are fixed at the base plate so that the proposed haptic device has a better dynamic bandwidth due to a low moving inertia. With this conceptual design, optimization of the design parameters is carried out. The objective function is defined by the fuzzy minimum of the global design indices, global force/moment isotropy index, global force/moment payload index, and workspace. Each global index is calculated by a SVD (singular value decomposition) of the force and moment parts of the jacobian matrix. Division of the jacobian matrix assures a consistency of the units in the matrix. Due to the nonlinearity of this objective function, Genetic algorithms are adopted for a global optimization.

• Toxicological Research
• /
• v.17
• /
• pp.193-196
• /
• 2001

Issuance of certification and licensing for toxicologists authorized by the Japanese Society of Thxicology (JST) became effective on July 24, 1997. The certification system consists of examination, eligibility requirements for the applicants, authorization/license by the board of trustees of JST, and the re-certification of previously authorized qualification. In the last 2-3 years, about 30-40% of candidates for the examination have succeeded. The Committee has estimated that the level of the examination would be sufficient to determine qualified toxicologists. This updated status and a detailed explanation are to be presented at the workshop. In global terms, the JST special committee agrees that "harmonization of certification/registration procedure for qualified toxicologists means to ensure/set the minimum requirement for the global authorization of qualified toxicologists". The following items in global authorization are ad-dressed for further discussion: (1) What's the benefit\ulcorner (2) Toxicological safety assessment standards, and (3) the JST position for authorization.orization.

• Journal of the Korean Society for Precision Engineering
• /
• v.17 no.11
• /
• pp.101-107
• /
• 2000

A design of the global optimal sliding mode control is presented to control the second order uncertain time varying system with torque limit. With specified ranges of parametric uncertainties and torque limit, the minimum arrival time to reference inputs can be calculated. The proposed control scheme is applied to the motor system carrying loads. The merit of the proposed control scheme is that the arriving time at the reference input, which is the revolution angle, and the maximum allowable acceleration are expressed in a closed form solution. The superior performance of the proposed control scheme is validated by the computer simulation and experiments comparing with other sliding mode controllers.

• International Journal of Computer Science & Network Security
• /
• v.21 no.12spc
• /
• pp.443-450
• /
• 2021

The study is devoted to the formation of a economic principles cargo delivery management in global supply chains. Mathematical model of delivering special categories of goods by road is a key element of these principles. The article analyzes the existing studies on solving the problem of cargo delivery in various aspects. It was noted that the greatest attention is paid to legal regulation, last mile delivery, optimization of routes and delivery schemes, information support, technological innovations, cluster routing, etc. In the developed mathematical model a minimum of total costs of forming loading units and freight shipments was defined as the criterion of optimality of organizing delivery by motor transport. The authors propose the creation of logistics clusters allowing the integration of urban transport flows and global supply chains.

• Journal of Positioning, Navigation, and Timing
• /
• v.5 no.2
• /
• pp.87-96
• /
• 2016

The ionospheric error, which is one of many error elements considered during the Global Navigation Satellite System (GNSS) positioning, is hard to be predicted due to the influence of geomagnetic activity and irregular solar activities. Thus, the present study analyzed a change pattern in the ionosphere through Global Ionosphere Map (GIM) data for 12 years from 2003 to 2014 and a variation in the Slant Total Electron Content (STEC) between Sinuiju and Busan which was the longest range in the southeastern direction of the Korean Peninsula. The variation in the STEC verified the diurnal, annual, and solar cycle variations due to the influence of solar activity. The diurnal variation was characterized that the variation in the STEC started to increase from 6-7 am and reached the maximum at 13-14 pm followed by being decreased. The seasonal variation was characterized that the variation in the STEC was high in spring and autumn whereas it was low in summer and winter. The solar cycle variation revealed that the variation in the STEC increased during solar maximum and decreased during solar minimum. The variation in the STEC was up to 20 Total Electron Content Unit (TECU) during the solar minimum and up to 60 TECU during solar maximum.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.1054-1059
• /
• 2005

The artificial potential method uses a potential field to guide a robot from a start to a goal configuration respectively. The potential field consists of attractive potential used to pull a robot toward a goal and repulsive potential to keep it away from obstacles. However, there are two problems concerning local minimum and computational cost to be resolved in conventional artificial potential methods. This study proposes a method utilizing a spline surface that interpolates arbitrary boundaries and a domain reduction method that reduces the unnecessary area. The proposed spline surface interpolates arbitrary shaped boundaries and is used as an artificial potential to guide a robot for global motion planning of a mobile robot. A reduced domain process reduces the unnecessary domain. We apply a distance-weighted function as such a function, which blends distances from each boundary with a reduction in computational time compared with other analytical methods. As a result, this paper shows that an arbitrary boundary spline surface provides global planning and a domain reduction method reduces local minimum with quick operation.

• Journal of Environmental Science International
• /
• v.26 no.9
• /
• pp.1023-1029
• /
• 2017

We studied the distribution of air temperature using the high density urban climate observation network data of Daegu. The observation system was established in February 2013. We used a total of 38 air temperature observation points (23 thermometers and 18 AWSs). From the distribution of monthly averaged air temperatures, air temperatures at the center of Daegu were higher than in the suburbs. The daily minimum air temperature was more than or equal to $25^{\circ}C$ and the daily maximum air temperature was more than or equal to $35^{\circ}C$ at the elementary school near the center of Daegu. Also, we compared the time elements, which are characterized by the diurnal variation of surface air temperature. The warming and cooling rates in rural areas were faster than in urban areas. This is mainly due to the difference in surface heat capacity. These results indicate the influence of urbanization on the formation of the daily minimum temperature in Daegu.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.44 no.7
• /
• pp.620-628
• /
• 2016

The homotopy algorithm provides a robust method for determining optimal control, in some cases the global minimum solution, as a continuation parameter is varied gradually to regulate the contributions of the nonlinear terms. In this paper, the Successive Backward Sweep (SBS) method, which is insensitive to initial guess, augmented with a homotopy algorithm is suggested. This approach is effective for highly nonlinear problems such as low-thrust trajectory optimization. Often, these highly nonlinear problems have multiple local minima. In this case, the SBS-homotopy method enables one to steadily seek a global minimum.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.7
• /
• pp.41-47
• /
• 2015

The bandwidth minimization problem (BMP) has been classified as NP-complete because the polynomial time algorithm to find the optimal solution has been unknown yet. This paper suggests polynomial time heuristic algorithm is to find the solution of bandwidth minimization problem. To find the minimum bandwidth ${\phi}^*=_{min}{\phi}(G)$, ${\phi}(G)=_{max}\{{\mid}f(v_i)-f(v_j):v_i,v_j{\in}E\}$ for given graph G=(V,E), m=|V|,n=|E|, the proposed algorithm sets the maximum degree vertex $v_i$ in graph G into global central point (GCP), and labels the median value ${\lceil}m+1/2{\rceil}$ between [1,m] range. The graph G is partitioned into subgroup, the maximum degree vertex in each subgroup is set to local central point (LCP), and we adjust the label of LCP per each subgroup as possible as minimum distance from GCP. The proposed algorithm requires O(mn) time complexity for label to all of vertices. For various twelve graph, the proposed algorithm can be obtains the same result as known optimal solution. For one graph, the proposed algorithm can be improve on known solution.