• Journal of the Korea Society of Computer and Information
• /
• v.29 no.7
• /
• pp.89-98
• /
• 2024

In this paper, we propose a system for recommending lecture videos at the chapter level, addressing the balance between accuracy and processing speed in chapter-level video recommendations. Specifically, it has been observed that enhancing recommendation accuracy reduces processing speed, while increasing processing speed decreases accuracy. To mitigate this trade-off, a hybrid approach is proposed, utilizing techniques such as TF-IDF, k-means++ clustering, and Graph Neural Networks (GNN). The approach involves pre-constructing clusters based on chapter similarity to reduce computational load during recommendations, thereby improving processing speed, and applying GNN to the graph of clusters as nodes to enhance recommendation accuracy. Experimental results indicate that the use of GNN resulted in an approximate 19.7% increase in recommendation accuracy, as measured by the Mean Reciprocal Rank (MRR) metric, and an approximate 27.7% increase in precision defined by similarities. These findings are expected to contribute to the development of a learning system that recommends more suitable video chapters in response to learners' queries.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.05a
• /
• pp.71-73
• /
• 2017

본 논문에서는 4 방향 윤곽선 추적 기법과 히스토그램 분석 기법을 기반으로 한 개선된 FCM 알고리즘을 적용하여 색조 도플러 초음파 영상에서 상완 동맥의 혈류를 추출하고 분석하는 방법을 제안한다. 제안된 방법에서는 상완 동맥의 혈류를 정확히 추출하기 위해 전처리 과정으로 색조 도플러 초음파 영상 이외의 환자 정보가 있는 영역을 제거한 후, ROI 영역을 추출한다. 추출된 ROI 영역에서 영상의 최대 명암도를 임계치로 설정한 이진화 기법을 적용하여 ROI 영역을 이진화한다. 이진화된 ROI 영역에서 4 방향 윤곽선 추적 기법을 적용하여 상완 동맥이 존재하는 사다리꼴 형태의 영역을 추출한다. 색 정보를 분석한 히스토그램을 이용하여 특징점의 개수를 계산하고 계산된 특징점의 개수를 FCM 알고리즘의 초기 클러스터의 개수로 설정한 후, 추출된 사다리꼴 형태의 영역에 적용하여 양자화 한다. 양자화된 영역 중에서 빨간색으로 분류된 영역을 고혈압 영역으로 추출한다. 제안된 추출 방법을 20개의 색조 도플러 초음파 영상을 대상으로 실험한 결과, 20개의 색조 도플러 초음파 영상에서 18개의 색조 도플러 초음파 영상이 정확히 추출되었다.

• Journal of Broadcast Engineering
• /
• v.13 no.6
• /
• pp.828-837
• /
• 2008

We propose a method to select representative views of single objects and classes of objects for 3D object retrieval and classification. Our method is based on projected 2D shapes, or views, of the 3D objects, where the representative views are selected by applying affinity propagation to cluster uniformly sampled views. Affinity propagation assigns prototypes to each cluster during the clustering process, thereby providing a natural criterion to select views. We recursively apply affinity propagation to the selected views of objects classified as single classes to obtain representative views of classes of objects. By enabling classification as well as retrieval, effective management of large scale databases for retrieval can be enhanced, since we can avoid exhaustive search over all objects by first classifying the object. We demonstrate the effectiveness of the proposed method for both retrieval and classification by experimental results based on the Princeton benchmark database [16].

• Journal of Internet Computing and Services
• /
• v.12 no.1
• /
• pp.99-110
• /
• 2011

Mobile environments rapidly changing and digital convergence widely employed, mobile devices including smart phones have been playing a critical role that changes users' lifestyle in the areas of entertainments, businesses and information services. The various services using mobile devices are developing to meet the personal needs of users in the mobile environments. Especially, an LBS (Location-Based Service) is combined with other services and contents such as augmented reality, mobile SNS (Social Network Service), games, and searching, which can provide convenient and useful services to mobile users. In this paper, we design and implement the prototype of mobile personal assistant (PA) agents. Our personal assistant agent helps users do some tasks by hiding the complexity of difficult tasks, performing tasks on behalf of the users, and reflecting the preferences of users. To identify user's preferences and provide personalized services, clustering and classification algorithms of data mining are applied. The clusters of the log data using clustering algorithms are made by measuring the dissimilarity between two objects based on usage patterns. The classification algorithms produce user profiles within each cluster, which make it possible for PA agents to provide users with personalized services and contents. In the experiment, we measured the classification accuracy of user model clustered using clustering algorithms. It turned out that the classification accuracy using our method was increased by 17.42%, compared with that using other clustering algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.11A
• /
• pp.903-911
• /
• 2011

In this paper we proposed an energy adaptive data aggregation and transmission mechanism to solve the problem of energy limitation in wireless sensor networks (WSNs). Hierarchical structure methods are wildly used in WSNs to improve the energy efficiency. LEACH and TEEN protocols are the typical techniques. In these methods, all nodes, including nodes who have sensed data to transmit and nodes who haven't, are set frame timeslots in every round. MNs (member nodes) without sensed data keep active all the time, too. These strategies caused energy waste. Furthermore, if data collection in MNs is same to the previous transmission, it increases energy consumption. Most hierarchical structure protocols are developed based on LEACH. To solve the above problems, this paper proposed a method in which only MNs with sensed data can obtain allocated frame to transmit data. Moreover, if the MNs have same sensed data with previous, MNs turn to sleep mode. By this way redundant data transmission is avoided and aggregation in CH is lightened, too.

• Journal of the Korea Convergence Society
• /
• v.7 no.5
• /
• pp.1-6
• /
• 2016

Many studies have been carried out for the development of big data utilization and analysis technology recently. There is a tendency that government agencies and companies to introduce a Hadoop of a processing platform for analyzing big data is increasing gradually. Increased interest with respect to the processing and analysis of these big data collection technology of data has become a major issue in parallel to it. However, study of the collection technology as compared to the study of data analysis techniques, it is insignificant situation. Therefore, in this paper, to build on the Hadoop cluster is a big data analysis platform, through the Apache sqoop, stylized from relational databases, to collect the data. In addition, to provide a sensor through the Apache flume, a system to collect on the basis of the data file of the Web application, the non-structured data such as log files to stream. The collection of data through these convergence would be able to utilize as a basic material of big data analysis.

• Journal of the Korea Computer Graphics Society
• /
• v.21 no.3
• /
• pp.36-45
• /
• 2015

It is important subject of research in engineering and natural science field that creating continuing high-definition image from very large volume data. The necessity of software that helps analyze useful information in data has improved by effectively showing visual image information of high resolution data with visualization technique. In this paper, we designed multi-platform visualization system based on client-server to analyze and express earth environment data effectively constructed with observation and prediction. The visualization server comprised of cluster transfers data to clients through parallel/distributed computing, and the client is developed to be operated in various platform and visualize data. In addition, we aim user-friendly program through multi-touch, sensor and have made realistic simulation image with image-based lighting technique.

• Journal of KIISE:Information Networking
• /
• v.32 no.1
• /
• pp.68-79
• /
• 2005

The popularity of Web service is ever increasing. As the number of services and clients continue to increase, the problem of providing a system that scales with this increase is becoming more difficult. A costly and ineffective method is to buy a new system that is more powerful every time the load becomes unbearable. h more cost effective solution is to expand the system as the need arises. This is the approach taken in Web cluster systems. However, providing effective scalability in a Web cluster system is stil1 an open issue. In this study, we implement a Web cluster system based on Layer 7 switching technique on Linux. The implementation is based on a design proposed and implemented by Aron et al., but on the FreeBSD. Though the design li the same, due to the vast difference between the FreeBSD and Linux, the implementation presented in this paper is totally new. We also propose the Dual Scheduling (DS) load distribution algorithm that distributes the requests to the system resources by observing the variations in the request rate. We show through measurement on our implementation that the DS alorithm performs considerably bettor than previous algorithms.

• Journal of Internet Computing and Services
• /
• v.15 no.6
• /
• pp.85-97
• /
• 2014

IoT devices that collect information for end users and provide various services like giving traffic or weather information to them that are located everywhere aim to raise quality of life. Currently, the number of devices has dramatically increased so that there are many companies and laboratories for developing various IoT devices in the world. However, research about IoT computing such as connecting IoT devices or management is at an early stage. A server node that manages lots of IoT device in IoT computing environment is certainly needed. But, it is difficult to manage lots of devices efficiently. However, anyone cannot surly know about how many servers are needed or where they are located in the environment. In this paper, we suggest a method that is a way to dynamic clustering IoT computing environment by logical distance among devices. With our proposed method, we can ensure to manage the quality in large-scale IoT environment efficiently.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.4
• /
• pp.394-400
• /
• 2000

The main goal of synchronization is to guarantee exclusive access to shared data and critical sections, and then it makes parallel programs work correctly and reliably. Exclusive access restricts parallelism of parallel programs, therefor efficient synchronization is essential to achieve high performance in shared-memory parallel programs. Many techniques are devised for efficient synchronization, which utilize features of systems and applications. This paper shows the simulation results that existing synchronization methods have inefficiency under CC-NUMA(Cache Coherent Non-Uniform Memory Access) system, and then compares the performance of Freeze&Melt synchronization that can remove the inefficiency. The simulation results present that Test-and-Test&Set synchronization has inefficiency caused by broadcast operation and the pre-defined order of Queue-On-Lock-Bit (QOLB) synchronization to execute a critical section causes inefficiency. Freeze&Melt synchronization, which removes these inefficiencies, has performance gain by decreasing the waiting time to execute a critical section and the execution time of a critical section, and by reducing the traffic between clusters.