• Title/Summary/Keyword: 온라인 실험

Search Result 902, Processing Time 0.026 seconds

A Study on User Experience of the Security in Online Trading of used goods -Focused on Danggeun Market and Bungae Jangter- (중고거래 온라인 플랫폼의 보안을 위한 사용자 경험 연구 -당근마켓, 번개장터 중심으로-)

  • Park, Ga-Young;Kim, Seung-In
    • Journal of Digital Convergence
    • /
    • v.19 no.7
    • /
    • pp.313-318
    • /
    • 2021
  • The purpose is to measure user experience in security-related services, focusing on Danggeun Market and Bungae Jangter, which are representative services in Korea among online trading of used goods. Using mobile applications, qualitative and quantitative research by conducting task experiments and surveys and in-depth interviews. As a result of the study, active interfaces are needed to make it easier for users to recognize safety and security services within current used trading platforms, a secure settlement method that benefits sellers, and services being provided to enhance security also need to consider graphical elements. This study is expected to help the continued development of safe used trading platforms considering security aspects on C2C-type platforms where buyers become sellers.

Online Signature Verification Method using General Handwriting Data and 1-class SVM (일반 필기 데이터와 단일 클래스 SVM을 이용한 온라인 서명 검증 기법)

  • Choi, Hun;Heo, Gyeongyong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.22 no.11
    • /
    • pp.1435-1441
    • /
    • 2018
  • Online signature verification is one of the simple and efficient methods of identity verification and has less resistance than other biometric technologies. To handle signature verification as a classification problem, it is necessary to gather forgery signatures, which is not easy in most practical applications. It is not easy to obtain a large number of genuine signatures either. In this paper, one class SVM is used to tackle the forgery signature problem and someone else's signatures are used as general handwriting data to solve the genuine signature problem. Someone else's signature does not share shape-based features with the signature to be verified, but it contains the general characteristics of a signature and useful in verification. Verification rate can be improved by using the general handwriting data, which can be confirmed through the experimental results.

Adaptive Load Balancing Algorithm of Ethereum Shard Using Bargaining Solution (협상 해법을 이용한 이더리움 샤드 부하 균형 알고리즘)

  • Baek, Dong Hwan;Kim, Sung Wook
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.10 no.4
    • /
    • pp.93-100
    • /
    • 2021
  • The Ethereum shard system for solving the scalability problem of the blockchain has a load balancing issue, which is modeled as a graph partitioning problem. In this paper, we propose an adaptive online weighted graph partitioning algorithm that can negotiate between two utility of the shard system using the game theory's bargaining solution. The bargaining solution is an axiomatic solution that can fairly determine the points of conflict of utility. The proposed algorithm was improved to apply the existing online graph partitioning algorithm to the weighted graph, and load balancing was performed efficiently through the design considering the situation of the sharding system using the extension of Nash bargaining solution, which is extended to apply solution to non-convex feasible set of bargaining problem. As a result of the experiment, it showed up to 37% better performance than typical load balancing algorithm of shard system.

Fault Detection Method for Multivariate Process using ICA (독립성분분석을 이용한 다변량 공정에서의 고장탐지 방법)

  • Jung, Seunghwan;Kim, Minseok;Lee, Hansoo;Kim, Jonggeun;Kim, Sungshin
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.24 no.2
    • /
    • pp.192-197
    • /
    • 2020
  • Multivariate processes, such as large scale power plants or chemical processes are operated in very hazardous environment, which can lead to significant human and material losses if a fault occurs. On-line monitoring technology, therefore, is essential to detect system faults. In this paper, the ICA-based fault detection method is conducted using three different multivariate process data. Fault detection procedure based on ICA is divided into off-line and on-line processes. The off-line process determines a threshold for fault detection by using the obtained dataset when the system is normal. And the on-line process computes statistics of query vectors measured in real-time. The fault is detected by comparing computed statistics and previously defined threshold. For comparison, the PCA-based fault detection method is also implemented in this paper. Experimental results show that the ICA-based fault detection method detects the system faults earlier and better than the PCA-based method.

Policy-based performance comparison study of Real-time Simultaneous Translation (실시간 동시통번역의 정책기반 성능 비교 연구)

  • Lee, Jungseob;Moon, Hyeonseok;Park, Chanjun;Seo, Jaehyung;Eo, Sugyeong;Lee, Seungjun;Koo, Seonmin;Lim, Heuiseok
    • Journal of the Korea Convergence Society
    • /
    • v.13 no.3
    • /
    • pp.43-54
    • /
    • 2022
  • Simultaneous translation is online decoding to translates with only subsentence. The goal of simultaneous translation research is to improve translation performance against delay. For this reason, most studies find trade-off performance between delays. We studied the experiments of the fixed policy-based simultaneous translation in Korean. Our experiments suggest that Korean tokenization causes many fragments, resulting in delay compared to other languages. We suggest follow-up studies such as n-gram tokenization to solve the problems.

An Analysis for the Student's Needs of non-face-to-face based Software Lecture in General Education using Text Mining (텍스트 마이닝을 이용한 비대면 소프트웨어 교양과목의 요구사항 분석)

  • Jeong, Hwa-Young
    • The Journal of the Korea Contents Association
    • /
    • v.22 no.3
    • /
    • pp.105-111
    • /
    • 2022
  • Multiple-choice survey types have been mainly performed to analyze students' needs for online classes. However, in order to analyze the exact needs of students, unstructured data analysis by answer for essay question is required. Big data is applied in various fields because it is possible to analyze unstructured data. This study aims to investigate and analyze what students want subjects or topics for software lecture in general education that process on non-face-to-face online teaching methods. As for the experimental method, keyword analysis and association analysis of big data were performed with unstructured data by giving a subjective questionnaire to students. By the result, we are able to know the keyword what the students want for software lecture, so it will be an important data for planning and designing software lecture of liberal arts in the future as students can grasp the topics they want to learn.

Dynamic Subspace Clustering for Online Data Streams (온라인 데이터 스트림에서의 동적 부분 공간 클러스터링 기법)

  • Park, Nam Hun
    • Journal of Digital Convergence
    • /
    • v.20 no.2
    • /
    • pp.217-223
    • /
    • 2022
  • Subspace clustering for online data streams requires a large amount of memory resources as all subsets of data dimensions must be examined. In order to track the continuous change of clusters for a data stream in a finite memory space, in this paper, we propose a grid-based subspace clustering algorithm that effectively uses memory resources. Given an n-dimensional data stream, the distribution information of data items in data space is monitored by a grid-cell list. When the frequency of data items in the grid-cell list of the first level is high and it becomes a unit grid-cell, the grid-cell list of the next level is created as a child node in order to find clusters of all possible subspaces from the grid-cell. In this way, a maximum n-level grid-cell subspace tree is constructed, and a k-dimensional subspace cluster can be found at the kth level of the subspace grid-cell tree. Through experiments, it was confirmed that the proposed method uses computing resources more efficiently by expanding only the dense space while maintaining the same accuracy as the existing method.

Can Generative AI Replace Human Managers? The Effects of Auto-generated Manager Responses on Customers (생성형 AI는 인간 관리자를 대체할 수 있는가? 자동 생성된 관리자 응답이 고객에 미치는 영향)

  • Yeeun Park;Hyunchul Ahn
    • Knowledge Management Research
    • /
    • v.24 no.4
    • /
    • pp.153-176
    • /
    • 2023
  • Generative AI, especially conversational AI like ChatGPT, has recently gained traction as a technological alternative for automating customer service. However, there is still a lack of research on whether current generative AI technologies can effectively replace traditional human managers in customer service automation, and whether they are advantageous in some situations and disadvantageous in others, depending on the conditions and environment. To answer the question, "Can generative AI replace human managers in customer service activities?", this study conducted experiments and surveys on customer online reviews of a food delivery platform. We applied the perspective of the elaboration likelihood model to generate hypotheses about whether there is a difference between positive and negative online reviews, and analyzed whether the hypotheses were supported. The analysis results indicate that for positive reviews, generative AI can effectively replace human managers. However, for negative reviews, complete replacement is challenging, and human managerial intervention is considered more desirable. The results of this study can provide valuable practical insights for organizations looking to automate customer service using generative AI.

Recommendation System Based on Correlation Analysis of User Behavior Data in Online Shopping Mall Environment (온라인 쇼핑몰 환경에서 사용자 행동 데이터의 상관관계 분석 기반 추천 시스템)

  • Yo Han Park;Jong Hyeok Mun;Jong Sun Choi;Jae Young Choi
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.13 no.1
    • /
    • pp.10-20
    • /
    • 2024
  • As the online commerce market continues to expand with an increase of diverse products and content, users find it challenging in navigating and in the selection process. Thereafter both platforms and shopping malls are actively working in conducting continuous research on recommendations system to select and present products that align with user preferences. Most existing recommendation studies have relied on user data which is relatively easy to obtain. However, these studies only use a single type of event and their reliance on time dependent data results in issues with reliability and complexity. To address these challenges, this paper proposes a recommendation system that analysis user preferences in consideration of the relationship between various types of event data. The proposed recommendation system analyzes the correlation of multiple events, extracts weights, learns the recommendation model, and provides recommendation services through it. Through extensive experiments the performance of our system was compared with the previously studied algorithms. The results confirmed an improvement in both complexity and performance.

Generative AI parameter tuning for online self-directed learning

  • Jin-Young Jun;Youn-A Min
    • Journal of the Korea Society of Computer and Information
    • /
    • v.29 no.4
    • /
    • pp.31-38
    • /
    • 2024
  • This study proposes hyper-parameter settings for developing a generative AI-based learning support tool to facilitate programming education in online distance learning. We implemented an experimental tool that can set research hyper-parameters according to three different learning contexts, and evaluated the quality of responses from the generative AI using the tool. The experiment with the default hyper-parameter settings of the generative AI was used as the control group, and the experiment with the research hyper-parameters was used as the experimental group. The experiment results showed no significant difference between the two groups in the "Learning Support" context. However, in other two contexts ("Code Generation" and "Comment Generation"), it showed the average evaluation scores of the experimental group were found to be 11.6% points and 23% points higher than those of the control group respectively. Lastly, this study also observed that when the expected influence of response on learning motivation was presented in the 'system content', responses containing emotional support considering learning emotions were generated.