• The Journal of Korean Institute for Practical Engineering Education
• /
• v.3 no.1
• /
• pp.69-75
• /
• 2011

This paper presents a model of e-learning based on ubiquitous computing configuration. First of all, we survey the advanced e-learning systems for foreign and domestic universities. Next we propose the optimal e-learning model based on ubiquitous computing configuration. The proposed e-learning model as following. we propose the e-learning system's hardware and software configurations, that are server and networking systems. Also, we construct the proposed e-learning systems's services. There are attendance and absence service, class management service, common knowledge service, score processing service, facilities management service, personal management service, personal authorization issue management service, campus guide service, lecture-hall management service. Then we propose the laboratory equipment management service, experimental materials management service etc. The proposed model of e-learning based on ubiquitous computing configuration will be able to contribute to the next generation university educational paradigm.

• Korean Journal of Cognitive Science
• /
• v.14 no.2
• /
• pp.15-25
• /
• 2003

The Monkey and Banana Problem is an example commonly used for illustrating simple problem solving. It can be solved by conventional approaches, but this requires a procedural aspect when inferences are processed, and this fact works as a limitation condition in solving complex problems. However, if we use DNA computing methods which are naturally able to realize massive parallel processing. the Monkey and Banana Problem can be solved effectively without weakening the fundamental aims above. In this paper, we design a method of representing the problem using DNA molecules, and show that various solutions are generated through computer-simulations based on the design. The simulation results are obviously interesting in that these are contrary to the fact that the Prolog program for the Monkey and Banana Problem, which was implemented from the conventional point of view, gives us only one optimal solution. That is, DNA computing overcomes the limitations of conventional approaches.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.11a
• /
• pp.131-134
• /
• 2013

최근 클라우드 컴퓨팅의 발전과 상업적인 성공과 함께 클라우드 자원의 이용률을 최대로 유지하면서 에너지를 효율적으로 사용하기 위한 연구에 대한 관심이 커지고 있다. 자원의 사용률이 최대로 높아지게 되면 에너지 소비량이 급격하게 증가하여 많은 에너지를 사용하게 되므로 자원의 사용율과 에너지 사용은 트레이드오프 관계를 가지게 된다. 따라서 본 논문에서는 자원의 최대 사용 및 효율적인 에너지 사용을 위해 에너지 소비가 최적이 되는 자원 이용률의 임계값을 찾기 위한 연구를 수행하였다. 실험을 위해 자원 중 가장 많은 에너지를 소비하는 CPU를 이용하였고, 전력 측정을 위해 KEM2500 전력계와 ThrottleStop_500 프로그램을 사용하였다. 실험 결과 CPU 사용률이 약 90%일 때 에너지 사용량이 급격하게 증가하였으며, 기존의 평균 자원 이용률과 비교했을 때 12.3% 정도의 전기량이 더 소모됨을 확인하였다. 따라서 클라우드 컴퓨팅에서 CPU 자원의 이용률이 90%일 때 에너지가 최적이라고 할 수 있다.

• International Journal of Computer Science & Network Security
• /
• v.21 no.6
• /
• pp.286-293
• /
• 2021

Recently, the quick development rate of apps in the Android platform has led to an accelerated increment in creating malware applications by cyber attackers. Numerous Android malware detection tools have utilized conventional signature-based approaches to detect malware apps. However, these conventional strategies can't identify the latest apps on whether applications are malware or not. Many new malware apps are periodically discovered but not all malware Apps can be accurately detected. Hence, there is a need to propose intelligent approaches that are able to detect the newly developed Android malware applications. In this study, Radial Basis Function (RBF) networks are trained using known Android applications and then used to detect the latest and new Android malware applications. Initially, the optimal permission features of Android apps are selected using Information Gain Ratio (IGR). Appropriately, the features selected by IGR are utilized to train the RBF networks in order to detect effectively the new Android malware apps. The empirical results showed that RBF achieved the best detection accuracy (97.20%) among other common machine learning techniques. Furthermore, RBF accomplished the best detection results in most of the other measures.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.11
• /
• pp.3523-3543
• /
• 2022

Autonomous vehicles are gradually being regarded as the mainstream trend of future development of the automobile industry. Autonomous driving networks generate many intensive and delay-sensitive computing tasks. The storage space, computing power, and battery capacity of autonomous vehicle terminals cannot meet the resource requirements of the tasks. In this paper, we focus on the task scheduling problem of autonomous driving in software-defined edge networks. By analyzing the intensive and delay-sensitive computing tasks of autonomous vehicles, we propose an emotion model that is related to task urgency and changes with execution time and propose an optimal base station (BS) task scheduling (OBSTS) algorithm. Task sentiment is an important factor that changes with the length of time that computing tasks with different urgency levels remain in the queue. The algorithm uses task sentiment as a performance indicator to measure task scheduling. Experimental results show that the OBSTS algorithm can more effectively meet the intensive and delay-sensitive requirements of vehicle terminals for network resources and improve user service experience.

• Proceedings of the IEEK Conference
• /
• 2004.08c
• /
• pp.897-899
• /
• 2004

There is scientific work containing the recurrence method of synthesis the new class of orthogonal circle m-invariant signals: designed effective algorithms of fast-direct computing m-convolution in time domain: engineer methods of design economic scheme of decoders for optimal receiving in aggregate of suggested signal.

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10b
• /
• pp.79-84
• /
• 1992

Path planning is an important task for optimal motion of a robot in structured or unstructured environment. The goal of this paper is to plan the optimal collision-free path in 3D, when a robot is navigated to pick up some tools or to repair some parts from various locations. To accomplish the goal, the Path Coordinator is proposed to have the capabilities of an obstacle avoidance strategy and a traveling salesman problem strategy (TSP). The obstacle avoidance strategy is to plan the shortest collision-free path between each pair of n locations in 2D or in 3D. The TSP strategy is to compute a minimal system cost of a tour that is defined as a closed path navigating each location exactly once. The TSP strategy can be implemented by the Hopfield Network. The obstacle avoidance strategy in 2D can be implemented by the VGraph Algorithm. However, the VGraph Algorithm is not useful in 3D, because it can't compute the global optimality in 3D. Thus, the Path Coordinator is used to solve this problem, having the capabilities of selecting the optimal edges by the modified Genetic Algorithm and computing the optimal nodes along the optimal edges by the Recursive Compensation Algorithm.

• Journal of KIISE:Computing Practices and Letters
• /
• v.9 no.2
• /
• pp.158-165
• /
• 2003

Image similarity is often decided by computing the distance between two feature vectors. Unfortunately, the feature vector cannot always reflect the notion of similarity in human perception. Therefore, most current image retrieval systems use weights measuring the importance of each feature. In this paper new initial weight selection and update rules are proposed for image retrieval purpose. In order to obtain the purpose, database images are first divided into groups based on human perception and, inner and outer query are performed, and, then, optimal feature weights for each database images are computed through searching the group where the result images among retrieved images are belong. Experimental results on 2000 images show the performance of proposed algorithm.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.4
• /
• pp.455-460
• /
• 2003

A new cluster validity index is proposed that determines the optimal partition and optimal number of clusters for fuzzy partitions obtained from the fuzzy c-means algorithm. The proposed validity index exploits an overlap measure and a separation measure between clusters. The overlap measure is obtained by computing an inter-cluster overlap. The separation measure is obtained by computing a distance between fuzzy clusters. A good fuzzy partition is expected to have a low degree of overlap and a larger separation distance. Testing of the proposed index and nine previously formulated indexes on well-known data sets showed the superior effectiveness and reliability of the proposed index in comparison to other indexes.

• Proceedings of the Korean Society For Composite Materials Conference
• /
• 2005.04a
• /
• pp.5-8
• /
• 2005

In this paper, the electromechanical displacements of curved piezoelectric actuators composed of PZT ceramic and laminated composite materials are calculated based on high performance computing technology and the optimal configuration of composite curved actuator is examined. To accurately predict the local pre-stress in the device due to the mismatch in coefficients of thermal expansion, carbon-epoxy and glass-epoxy as well as PZT ceramic are numerically modeled by using hexahedral solid elements. Because the modeling of these thin layers increases the number of degrees of freedom, large-scale structural analyses are performed through the PEGASUS supercomputer, which is installed in our laboratory. In the first stage, the curved shape of the actuator and the internal stress in each layer are obtained by the cured curvature analysis. Subsequently, the displacement due to the piezoelectric force (which is resulted from applied voltage) is also calculated. The performance of composite curved actuator is investigated by comparing the displacements obtained by the variation of thickness and elastic modulus of laminated composite layers. In order to consider the finite deformation in the first analysis stage and include the pre-stress due to curing process in the second stage, nonlinear finite element analyses are carried out.