• International Journal of Internet, Broadcasting and Communication
• /
• v.14 no.3
• /
• pp.285-291
• /
• 2022

The number of people enrolling in universities is rising due to the simplicity of applying and the benefit of earning a bachelor's degree. However, the on-time graduation rate has declined since plenty of students fail to complete their courses and take longer to get their diplomas. Even though there are various reasons leading to the aforementioned problem, it is crucial to emphasize the cause originating from the management and care of learners. In fact, understanding students' difficult situations and offering timely Number of Test data and advice would help prevent college dropouts or graduate delays. In this study, we present a machine learning-based method for early detection at-risk students, using data obtained from graduates of the Faculty of Information Technology, Dainam University, Vietnam. We experiment with several fundamental machine learning methods before implementing the parameter optimization techniques. In comparison to the other strategies, Random Forest and Grid Search (RF&GS) and Random Forest and Random Search (RF&RS) provided more accurate predictions for identifying at-risk students.

• KIPS Transactions on Computer and Communication Systems
• /
• v.7 no.8
• /
• pp.195-202
• /
• 2018

With the development of location-based applications such as smart phones and GPS navigation, active research is being conducted to protect location and trajectory privacy. To receive location-related services, users must disclose their exact location to the server. However, disclosure of users' location exposes not only their locations but also their trajectory to the server, which can lead to concerns of privacy violation. Furthermore, users request from the server not only location information but also multimedia information (photographs, reviews, etc. of the location), and this increases the processing cost of the server and the information to be received by the user. To solve these problems, this study proposes the EGTC (Enhanced Grid-based Trajectory Cloaking) technique. As with the existing GTC (Grid-based Trajectory Cloaking) technique, EGTC method divides the user trajectory into grids at the user privacy level (UPL) and creates a cloaking region in which a random query sequence is determined. In the next step, the necessary information is received as index by considering the sub-grid cell corresponding to the path through which the user wishes to move as c(x,y). The proposed method ensures the trajectory privacy as with the existing GTC method while reducing the amount of information the user must listen to. The excellence of the proposed method has been proven through experimental results.

• Journal of Korea Multimedia Society
• /
• v.21 no.1
• /
• pp.51-60
• /
• 2018

We present a real-time interactive particle-art with human motion based on computer vision techniques. We used computer vision techniques to reduce the number of equipments that required for media art appreciations. We analyze pros and cons of various computer vision methods that can adapted to interactive digital media art. In our system, background subtraction is applied to search an audience. The audience image is changed into particles with grid cells. Optical flow is used to detect the motion of the audience and create particle effects. Also we define a virtual button for interaction. This paper introduces a series of computer vision modules to build the interactive digital media art contents which can be easily configurated with a camera sensor.

• Journal of Integrative Natural Science
• /
• v.12 no.1
• /
• pp.20-23
• /
• 2019

Demand response is usually operated through using the power rates and incentives. Demand management based on power charges is the most rational and efficient demand management method, and such methods include rolling base charges with peak time, sliding scaling charges depending on time, sliding scaling charges depending on seasons, and nighttime power charges. Search for other methods to stimulate resources on demand by actively deriving the demand reaction of loads to increase the energy efficiency of loads. In this paper, ESS algorithm for saving energy based on predicting the amount of solar power generation that can be used for buildings with small loads not under electrical grid.

• Journal of Applied Reliability
• /
• v.17 no.2
• /
• pp.129-135
• /
• 2017

Purpose: This article provides step-stress accelerated degradation test (ADT) plans based on the Wiener process. Method: Step-stress levels and the stress change times are determined based on the D-optimality criteria to develop test plans. Further, a simple grid search method is provided for obtaining the optimal test plan. Results: Based on the solution procedure, ADT plans which include the stress levels and change times are developed for conducting the reliability test. Conclusion: Optimal step-stress ADT plans are provided for the case where the number of measurements is small.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.11a
• /
• pp.877-878
• /
• 2009

본 연구는 국방 소프트웨어 컴포넌트그리드 환경의 자산저장소를 지원하는 시맨틱 검색 시스템을 설계하고 개발하는데 바탕을 두고 있다. 컴포넌트그리드 환경의 자산저장소의 중요한 특성은 재사용성과 상호운용성 그리고 유용성을 보장하는 것이다. 이러한 특성을 만족하는 시맨틱 검색 시스템을 개발하기 위해서는 기반 기술에 대한 심도 있는 기초 연구가 필요하다. 본 논문에서는 이러한 기술들 중 현재 연구 중인 몇 가지를 소개하고 적용 방법을 제안하고자 한다. 이러한 기술로는 사례기반추론을 이용한 소프트웨어 개발 경험재사용 연구, 유사한 컴포넌트들의 추출을 위한 의미기반의 유사도 연구, 그리고 사용자 질의의 추론과 매칭을 위한 추론규칙 연구 등이 있다. 본 연구에서는 다양한 형태의 산출물들의 저장 및 검색을 위한 기술들을 조사하고 이를 연구하여 향후 컴포넌트그리드 환경의 자산저장소의 시맨틱 검색을 제공하기 위한 기초로 활용할 예정이다.

• Journal of computational fluids engineering
• /
• v.4 no.3
• /
• pp.52-62
• /
• 1999

The development of a parallelized aerodynamic simulation process involving moving bodies is presented. The implementation of this process is demonstrated using a fully systemized Chimera methodology for steady and unsteady problems. This methodology consists of a Chimera hole-cutting, a new cut-paste algorithm for optimal mesh interface generation and a two-step search method for donor cell identification. It is fully automated and requires minimal user input. All procedures of the Chimera technique are parallelized on the Cray T3E using the MPI library. Two and three-dimensional examples are chosen to demonstrate the effectiveness and parallel performance of this procedure.

• Journal of Korea Multimedia Society
• /
• v.8 no.10
• /
• pp.1369-1382
• /
• 2005

Vehicle segmentation, which extracts vehicle areas from road scenes, is one of the fundamental opera tions in lots of application areas including Intelligent Transportation Systems, and so on. We present a vehicle segmentation approach for still images captured from outdoor CCD cameras mounted on the supporting poles. We first divided the input image into a set of two-dimensional grids and then calculate the feature values of the edges for each grid. Through analyzing the feature values statistically, we can find the optimal rectangular grid area of the vehicle. Our preprocessing process calculates the statistics values for the feature values from background images captured under various circumstances. For a car image, we compare its feature values to the statistics values of the background images to finally decide whether the grid belongs to the vehicle area or not. We use dynamic programming technique to find the optimal rectangular gird area from these candidate grids. Based on the statistics analysis and global search techniques, our method is more systematic compared to the previous methods which usually rely on a kind of heuristics. Additionally, the statistics analysis achieves high reliability against noises and errors due to brightness changes, camera tremors, etc. Our prototype implementation performs the vehicle segmentation in average 0.150 second for each of $1280\times960$ car images. It shows $97.03\%$ of strictly successful cases from 270 images with various kinds of noises.

• Journal of Distribution Science
• /
• v.11 no.3
• /
• pp.5-11
• /
• 2013

Purpose - Going concern is one of fundamental concepts in accounting and auditing and sometimes the assessment of a company's going concern status that is a tough process. Various going concern prediction models' based on statistical and data mining methods help auditors and stakeholders suggested in the previous literature. Research design - This paper employs a data mining approach to prediction of going concern status of Iranian firms listed in Tehran Stock Exchange using Particle Swarm Optimization. To reach this goal, at the first step, we used the stepwise discriminant analysis it is selected the final variables from among of 42 variables and in the second stage; we applied a grid-search technique using 10-fold cross-validation to find out the optimal model. Results - The empirical tests show that the particle swarm optimization (PSO) model reached 99.92% and 99.28% accuracy rates for training and holdout data. Conclusions - The authors conclude that PSO model is applicable for prediction going concern of Iranian listed companies.

• Korean Journal of Remote Sensing
• /
• v.26 no.6
• /
• pp.693-703
• /
• 2010

High spectral resolution of hyperspectral data enables analysis of complex natural phenomena that is reflected on the data nonlinearly. Although many manifold learning methods have been developed for such problems, most methods do not consider the spatial correlation between samples that is inherent and useful in remote sensing data. We propose a manifold learning method which directly combines the spatial proximity and the spectral similarity through kernel PCA framework. A gain factor caused by spatial proximity is first modelled with a heat kernel, and is added to the original similarity computed from the spectral values of a pair of samples. Parameters are tuned with intelligent grid search (IGS) method for the derived manifold coordinates to achieve optimal classification accuracies. Of particular interest is its performance with small training size, because labelled samples are usually scarce due to its high acquisition cost. The proposed spatial kernel PCA (KPCA) is compared with PCA in terms of classification accuracy with the nearest-neighbourhood classification method.