• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.7
• /
• pp.87-97
• /
• 1992

Fuzzy controllers have been successfully applied to many cases to which conventional control algorithms are difficult to be applied. Even though the representations and the processings of data and information in the fuzzy controller are quite different from those in other control algorithms, the information processing operation that it caries out is basically a function ∫: $A{\subset}R^n{\to}R^m$, from a bounded subset A of an n-dimensional Euclidean space to a bounded subset f[A] of an m-dimensional Euclidean space, where n and m are the number of measured states and the number of control inputs of the controlled system, respectively. Under the assumptions of Mamdani's direct reasoning method and C.O.G.(center of gravity) defuzzification method, the fuzzy controllers are proven to perform the mapping of any given functions f with appropriately defined fuzzy sets. The mapping capabilities of fuzzy controllers are analyzed in detail for two cases, ∫: $R^{1}{\to}R^{1}$ and g: $R^{2}{\to}R^{1}$. Also, it will be shown that the results can be extended to multiple dimensional cases.

• International Journal of Highway Engineering
• /
• v.19 no.2
• /
• pp.35-44
• /
• 2017

PURPOSES: This study suggests a specific methodology for the prediction of road surface temperature using vehicular ambient temperature sensors. In addition, four kind of models is developed based on machine learning algorithms. METHODS : Thermal Mapping System is employed to collect road surface and vehicular ambient temperature data on the defined survey route in 2015 and 2016 year, respectively. For modelling, all types of collected temperature data should be classified into response and predictor before applying a machine learning tool such as MATLAB. In this study, collected road surface temperature are considered as response while vehicular ambient temperatures defied as predictor. Through data learning using machine learning tool, models were developed and finally compared predicted and actual temperature based on average absolute error. RESULTS : According to comparison results, model enables to estimate actual road surface temperature variation pattern along the roads very well. Model III is slightly better than the rest of models in terms of estimation performance. CONCLUSIONS : When correlation between response and predictor is high, when plenty of historical data exists, and when a lot of predictors are available, estimation performance of would be much better.

• Proceedings of the KIEE Conference
• /
• 1997.11a
• /
• pp.576-580
• /
• 1997

This paper presents a path planning algorithm for biped walking robot in 3-D workspace. Since the biped walking robot can generate path on some 3-D obstacles that cannot generate path in case of mobile robot, we have to make a new path planning algorithms. A 3-D-to-2-D mapping algorithm is proposed and two kinds of path planning algorithms are also proposed. They make it easier to generate an efficient path for biped walking robot under given environment. Some simulation results are shown to prove the effectiveness of proposed algorithms.

• Journal of Ship and Ocean Technology
• /
• v.5 no.3
• /
• pp.27-35
• /
• 2001

In this research, hybrid method with case-based reasoning and rule-based reasoning is applied. Using case-based reasoning, design experts'experience and know-how are effectively represented in order to obtain a proper configuration of midship section in the initial ship design stage. Since there is not sufficient domain knowledge available to us, traditional case-adaptation algorithms cannot be applied to our problem, i.e., creating the configuration of midship section. Thus, new case-adaptation algorithms not requiring any domain knowledge are developed antral applied to our problem. Using the knowledge representation of DnV rules, rule-based reasoning can perform deductive inference in order to obtain the scantling of midship section efficiently. The results from the case-based reasoning and the rule-based reasoning are examined by comparing the results with various conventional methods. And the reasonability of our results is verified by comparing the results wish actual values from parent ship.

• Journal of Communications and Networks
• /
• v.6 no.1
• /
• pp.46-59
• /
• 2004

In this paper, we present two algorithms for efficiently aggregating link state information needed for quality-of-service (QoS) routing. In these algorithms, each edge node in a group is mapped onto a node of a shufflenet or a node of a de Bruijn graph. By this mapping, the number of links for which state information is maintained becomes aN (a is an integer, N is the number of edge nodes) which is significantly smaller than N2 in the full-mesh approach. Our algorithms also can support asymmetric link state parameters which are common in practice, while many previous algorithms such as the spanning tree approach can be applied only to networks with symmetric link state parameters. Experimental results show that the performance of our shufflenet algorithm is close to that of the full-mesh approach in terms of the accuracy of bandwidth and delay information, with only a much smaller amount of information. On the other hand, although it is not as good as the shufflenet approach, the de Bruijn algorithm also performs far better than the star approach which is one of the most widely accepted schemes. The de Bruijn algorithm needs smaller computational complexity than most previous algorithms for asymmetric networks, including the shufflenet algorithm.

• International Journal of Computer Science & Network Security
• /
• v.22 no.4
• /
• pp.147-158
• /
• 2022

Cloud Computing offers flexible, on demand, ubiquitous resources for cloud users. Cloud users are provided computing resources in a virtualized environment. In order to meet the growing demands for computing resources, data centres contain a large number of physical machines accommodating multiple virtual machines. However, cloud data centres cannot utilize their computing resources to their total capacity. Several policies have been proposed for improving energy proficiency and computing resource utilization in cloud data centres. Virtual machine placement is an effective method involving efficient mapping of virtual machines to physical machines. However, the availability of many physical machines accommodating multiple virtual machines in a data centre has made the virtual machine placement problem a non deterministic polynomial time hard (NP hard) problem. Metaheuristic algorithms have been widely used to solve the NP hard problems of multiple and conflicting objectives, such as the virtual machine placement problem. In this context, we presented essential concepts regarding virtual machine placement and objective functions for optimizing different parameters. This paper provides a taxonomy of metaheuristic algorithms for the virtual machine placement method. It is followed by a review of prominent research of virtual machine placement methods using meta heuristic algorithms and comparing them. Finally, this paper provides a conclusion and future research directions in virtual machine placement of cloud computing.

• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.5
• /
• pp.257-271
• /
• 2010

As the end of photolithographic integration era is approaching fast, numerous nanoscale devices and systems based on novel nanoscale materials and assembly techniques are recently emerging. Notably, various reconfigurable architectures with considerable promise have been proposed based on nanowire crossbar structure as the primitive building block. Unfortunately, high-density sys-tems consisting of nanometer-scale elements are likely to have numerous physical imperfections and variations. Therefore, defect-tolerance is considered as one of the most exigent challenges in nanowire crossbar systems. In this work, three different defect-avoidant logic mapping algorithms to circumvent defective crosspoints in nanowire reconfigurable crossbar systems are evaluated in terms of various performance metrics. Then, a novel method to find the most cost-effective repair solution is demonstrated by considering all major repair parameters and quantitatively estimating the performance and cost-effectiveness of each algorithm. Extensive parametric simulation results are reported to compare overall repair costs of the repair algorithms under consideration and to validate the cost-driven repair optimization technique.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.2
• /
• pp.186-200
• /
• 2010

In order to render global illumination realistically, we need to accurately compute the direct and indirect illumination that represents the light information incoming through complex light paths. In this process, the indirect illumination at given point is greatly affected by surrounding geometries. Harmonic mean distance is a mathematical tool which is often used as a metric indicating the distance from a surface point to its visible objects in 3D space, and plays a key role in such advanced global illumination algorithms as irradiance/radiance caching and ambient occlusion. In this paper, we analyze the accuracy of harmonic mean distance estimated against various environments in the final gathering and photon mapping methods. Based on the experimental results, we discuss our experiences and future directions that may help develop an effective harmonic mean distance computation method in the future.

• Proceedings of the Korean Institute Of Construction Engineering and Management
• /
• 2004.11a
• /
• pp.561-564
• /
• 2004

Crack sealing automation machines' have been continually developed since the early 1990's because of the effectiveness of crack sealing that would be able to improve safety, quality and productivity. It has been considered challenging problem to detect crack network in pavement which includes noise (oil marks, skid marks, previously sealed cracks and inherent noise). It is required to develop crack network mapping and modeling algorithm in order to accurately inject sealant along to the middle of cut crack network. The primary objective of this study is to propose a crack network mapping and modeling algorithm using neural network for improving the accuracy of the algorithm used in the APCS. It is anticipated that the effective use of the proposed algorithms would be able to reduce error rate in image processing for detecting, mapping and modeling crack network as well as improving quality and productivity compared to existing vision algorithms.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.20 no.4
• /
• pp.463-468
• /
• 2010

The mobile robot which accomplishes a work in explored region does not know location information of surroundings. Traditionally, simultaneous localization and mapping(SLAM) algorithms solve the localization and mapping problem in explored regions. Among the several SLAM algorithms, the EKF (Extended Kalman Filter) based SLAM is the scheme most widely used. The EKF is the optimal sensor fusion method which has been used for a long time. The odometeric error caused by an encoder can be compensated by an EKF, which fuses different types of sensor data with weights proportional to the uncertainty of each sensor. In many cases the EKF based SLAM requires artificially installed features, which causes difficulty in actual implementation. Moreover, the computational complexity involved in an EKF increases as the number of features increases. And SLAM is a weak point of long operation time. Therefore, this paper presents a symmetrical model based SLAM algorithm(called M-SLAM).