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

Search Result 901, Processing Time 0.029 seconds

The Effects of Live Commerce and Show Host Features on Consumers' Likelihood of Impulse Buying: A Scenario-Based Experiment (라이브 커머스 및 쇼호스트 특성이 소비자의 충동구매가능성에 미치는 영향: 시나리오 기반 실험연구)

  • Nakyeong Kim;Sung-Byung Yang;Sang-Hyeak Yoon
    • Information Systems Review
    • /
    • v.24 no.4
    • /
    • pp.77-96
    • /
    • 2022
  • Live commerce has recently received substantial attention due to the spread of the non-face-to-face consumption culture driven by the COVID-19 pandemic. Live commerce has a higher purchase conversion rate than other forms of commerce. Accordingly, the likelihood of impulse buying in a live commerce environment is expected to be high. However, there is a shortage of research on consumer impulse buying in the live commerce environment. This study designs a scenario-based experiment using the integrated model of consumption impulse formation and enactment. Through this method, this study validates the influence of the characteristics of live commerce (i.e., vicarious experience and real-time interaction) on consumers' likelihood of impulse buying and further examines the moderating role of a live commerce host feature (i.e., professionalism) in these relationships. The results of this study confirm that both vicarious experience and real-time interaction have a positive effect on consumers' likelihood of impulse buying and that professionalism strengthens the impact of vicarious experience on the likelihood of impulse buying. This study's scenario-based experimental design is meaningful because it analyzes the likelihood of impulse buying in the context of live commerce shopping. Additionally, it provides live commerce service and platform providers with practical insights into how to maximize profits and operate services more efficiently.

A research on improving client based detection feature by using server log analysis in FPS games (FPS 게임 서버 로그 분석을 통한 클라이언트 단 치팅 탐지 기능 개선에 관한 연구)

  • Kim, Seon Min;Kim, Huy Kang
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.25 no.6
    • /
    • pp.1465-1475
    • /
    • 2015
  • Cheating detection models in the online games can be divided into two parts. The one is on client based model, which is designed to detect malicious programs not to be run while playing the games. The other one is server based model, which distinguishes the difference between benign users and cheaters by the server log analysis. The client based model provides various features to prevent games from cheating, For instance, Anti-reversing, memory manipulation and so on. However, being deployed and operated on the client side is a huge weak point as cheaters can analyze and bypass the detection features. That Is why the server based model is an emerging way to detect cheating users in online games. But the simple log data such as FPS's one can be hard to find validate difference between two of them. In this paper, In order to compensate for the disadvantages of the two detection model above, We use the existing game security solution log as well as the server one to bring high performance as well as detection ratio compared to the existing detection models in the market.

An Analysis of the Properties of Affective Achievement in Science Based on TIMSS and Science Teachers' Perception (TIMSS 결과에 기초한 과학의 정의적 성취 특성 및 과학 교사의 인식 분석)

  • Kim, Miyoung;Cho, Jimin
    • Journal of The Korean Association For Science Education
    • /
    • v.33 no.1
    • /
    • pp.46-62
    • /
    • 2013
  • In this study, nations with high academic achievement but disparate affective achievement in science according to the results of the TIMSS 2007 were selected and students' responses in the main survey for affective properties from those nations were analyzed. In addition, Korean science teachers' perception of affective achievement and the properties of teaching and learning science was explored by an online survey. According to the results of the analysis of students' responses in the main survey, the percentage of those with high levels of confidence in, pleasure in, and value perception of science was large for Hong Kong, Singapore, and England but small for Korea, Taiwan, and Japan. When the properties of teaching and learning in actual science classes were observed in Korea, actual classes focused little on experimentation, research activities, and the context of everyday life. According to the results of surveys conducted on science teachers, students' low confidence in science was due to difficult and uninteresting curricula and the absolute lack of time to study science and their low interest in the subject was due to difficult curricula and the view that science was unrelated to their future academic or professional careers. In addition, according to the teachers, students' low value perception of science curricula was due to the fact that there was no need to excel in science for academic or professional careers and the idea that the subject was of no help to daily life.

A Nobel Video Quality Degradation Monitoring Schemes Over an IPTV Service with Packet Loss (IPTV 서비스에서 패킷손실에 의한 비디오품질 열화 모니터링 방법)

  • Kwon, Jae-Cheol;Oh, Seoung-Jun;Suh, Chang-Ryul;Chin, Young-Min
    • Journal of Broadcast Engineering
    • /
    • v.14 no.5
    • /
    • pp.573-588
    • /
    • 2009
  • In this paper, we propose a novel video quality degradation monitoring scheme titled VR-VQMS(Visual Rhythm based Video Quality Monitoring Scheme) over an IPTV service prone to packet losses during network transmission. Proposed scheme quantifies the amount of quality degradation due to packet losses, and can be classified into a RR(reduced-reference) based quality measurement scheme exploiting visual rhythm data of H.264-encoded video frames at a media server and reconstructed ones at an Set-top Box as feature information. Two scenarios, On-line and Off-line VR-VQMS, are proposed as the practical solutions. We define the NPSNR(Networked Peak-to-peak Signal-to-Noise Ratio) modified by the well-known PSNR as a new objective quality metric, and several additional objective and subjective metrics based on it to obtain the statistics on timing, duration, occurrence, and amount of quality degradation. Simulation results show that the proposed method closely approximates the results from 2D video frames and gives good estimation of subjective quality(i.e.,MOS(mean opinion score)) performed by 10 test observers. We expect that the proposed scheme can play a role as a practical solution to monitor the video quality experienced by individual customers in a commercial IPTV service, and be implemented as a small and light agent program running on a resource-limited set-top box.

The Growth of School Mathematics: Korean Secondary Gifted Students' Collaborative Problem Solving Using The Wiki (학교수학적 지식의 성장: 고등학교 영재 학생들의 위키(Wiki) 기반 협력 문제해결 활동을 중심으로)

  • Lee, Seoung Woo
    • Journal of Educational Research in Mathematics
    • /
    • v.25 no.4
    • /
    • pp.717-754
    • /
    • 2015
  • As a design research, this study aims to identify students' collaborative problems solving patterns using the Wiki and design factors triggering MKB(mathematical knowledge building) in virtual environment. For 70 days, 14 Korean secondary gifted students, who enrolled in calculus II courses in one of gifted institutions in Korea, solved 10 math problems together using the Wiki. In this study, I considered five design factors; motivation, practice of LaTeX, norms of participation, epistemic agency, and two types of educational settings. The primary pattern emergent in students' collaborative problem solving process is identified as 'solutions and refutations' along the double helix consisting of the constructive line and the critical line, which is very similar to the pattern of 'Conjectures and Refutations'(Lakatos, 1976). Despite that most participants had difficulty in using LaTeX for mathematical expressions, this study shows that Wikis are valuable tools for providing Korean secondary students opportunities to learn social virtue such as humility and courage (Lampert, 1990), which is considered to be have been neglected in Korean educational environment but is emphasized as precious for doing mathematics in the field of mathematics education.

The Press Coverage of the Cyber Defamation Laws: Framing Effects of Core Values and Attributional Patterns (사이버모욕죄 보도의 프레이밍 효과: 핵심 가치와 귀인 양식을 중심으로)

  • Hur, Suk-Jae;Min, Young
    • Korean journal of communication and information
    • /
    • v.52
    • /
    • pp.48-68
    • /
    • 2010
  • In covering the controversies surrounding the so-called cyber defamation laws, the Korean press offered competitive frames in terms of values (security vs. freedom of speech) and attributional patterns (episodic vs. thematic attribution). By attending to core values and attributional patterns as two essential components of news frames, this study explored the cognitive and affective processes of value and attributional framing and their effects on issue opinion. According to a 3-group online experiment, first, it was found that core values increased the perceived importance of relevant beliefs, which further affected individuals' attitudes toward the laws. The affective effects of core values were also found marginally significant. The value of security increased the intensity of anger toward deviant netizens (so-called defamatory repliers), and it further increased individuals' support for the laws. It was not substantiated, however, that individualistic attribution, than social attribution, would provoke stronger anger toward defamatory repliers. Instead, episodic frames appeared to be more effective in driving issue opinion as indicated by the value frame.

  • PDF

Efficient and Privacy-Preserving Near-Duplicate Detection in Cloud Computing (클라우드 환경에서 검색 효율성 개선과 프라이버시를 보장하는 유사 중복 검출 기법)

  • Hahn, Changhee;Shin, Hyung June;Hur, Junbeom
    • Journal of KIISE
    • /
    • v.44 no.10
    • /
    • pp.1112-1123
    • /
    • 2017
  • As content providers further offload content-centric services to the cloud, data retrieval over the cloud typically results in many redundant items because there is a prevalent near-duplication of content on the Internet. Simply fetching all data from the cloud severely degrades efficiency in terms of resource utilization and bandwidth, and data can be encrypted by multiple content providers under different keys to preserve privacy. Thus, locating near-duplicate data in a privacy-preserving way is highly dependent on the ability to deduplicate redundant search results and returns best matches without decrypting data. To this end, we propose an efficient near-duplicate detection scheme for encrypted data in the cloud. Our scheme has the following benefits. First, a single query is enough to locate near-duplicate data even if they are encrypted under different keys of multiple content providers. Second, storage, computation and communication costs are alleviated compared to existing schemes, while achieving the same level of search accuracy. Third, scalability is significantly improved as a result of a novel and efficient two-round detection to locate near-duplicate candidates over large quantities of data in the cloud. An experimental analysis with real-world data demonstrates the applicability of the proposed scheme to a practical cloud system. Last, the proposed scheme is an average of 70.6% faster than an existing scheme.

An Efficient Algorithm for Betweenness Centrality Estimation in Social Networks (사회관계망에서 매개 중심도 추정을 위한 효율적인 알고리즘)

  • Shin, Soo-Jin;Kim, Yong-Hwan;Kim, Chan-Myung;Han, Youn-Hee
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.4 no.1
    • /
    • pp.37-44
    • /
    • 2015
  • In traditional social network analysis, the betweenness centrality measure has been heavily used to identify the relative importance of nodes. Since the time complexity to calculate the betweenness centrality is very high, however, it is difficult to get it of each node in large-scale social network where there are so many nodes and edges. In our past study, we defined a new type of network, called the expanded ego network, which is built only with each node's local information, i.e., neighbor information of the node's neighbor nodes, and also defined a new measure, called the expanded ego betweenness centrality. In this paper, We propose algorithm that quickly computes expanded ego betweenness centrality by exploiting structural properties of expanded ego network. Through the experiment with virtual network used Barab$\acute{a}$si-Albert network model to represent the generic social network and facebook network to represent actual social network, We show that the node's importance rank based on the expanded ego betweenness centrality has high similarity with that the node's importance rank based on the existing betweenness centrality. We also show that the proposed algorithm computes the expanded ego betweenness centrality quickly than existing algorithm.

A Systematic Review of Non-pharmacological Intervention for Depression in Korean Middle-aged Women (한국 중년여성의 비약물적 우울중재연구: 체계적 문헌고찰)

  • Chae, Myung-Ock;Jeon, Hae Ok;Kim, Ahrin
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.17 no.3
    • /
    • pp.638-651
    • /
    • 2016
  • The purpose of this study was to review the literature and examine the effects on non-pharmacological depression intervention for middle-aged women in Korea. This systematic review analyzed the literature from 2006 to September, 2015. The existing literature was searched in the electronic databases in RISS, KISS and DBPia using the following key words: middle-aged women and depression, menopause and depression, climacterium and depression. Two hundred eighty studies were found through the database. According to PICOTS-SD, twelve studies were included for analysis. Among the twelve studies, four studies were conducted in the nursing field. Six studies were randomized controlled trials. Aerobic exercise, laughter therapy, meditation, aroma massage, counseling and art therapy were performed as non-pharmacological interventions for depression in Korean middle-aged women. The length of each session ranged from 20 to 120 minutes. The intervention period varied from 2 to 24 weeks, and the total number of the interventions ranged from 8 to 72 times. They influenced not only depression, but also physical aspects that are associated with obesity and psychosocial variables, such as anxiety, quality of life, life satisfaction, etc.

Design and Implementation of An I/O System for Irregular Application under Parallel System Environments (병렬 시스템 환경하에서 비정형 응용 프로그램을 위한 입출력 시스템의 설계 및 구현)

  • No, Jae-Chun;Park, Seong-Sun;;Gwon, O-Yeong
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.26 no.11
    • /
    • pp.1318-1332
    • /
    • 1999
  • 본 논문에서는 입출력 응용을 위해 collective I/O 기법을 기반으로 한 실행시간 시스템의 설계, 구현 그리고 그 성능평가를 기술한다. 여기서는 모든 프로세서가 동시에 I/O 요구에 따라 스케쥴링하며 I/O를 수행하는 collective I/O 방안과 프로세서들이 여러 그룹으로 묶이어, 다음 그룹이 데이터를 재배열하는 통신을 수행하는 동안 오직 한 그룹만이 동시에 I/O를 수행하는 pipelined collective I/O 등의 두 가지 설계방안을 살펴본다. Pipelined collective I/O의 전체 과정은 I/O 노드 충돌을 동적으로 줄이기 위해 파이프라인된다. 이상의 설계 부분에서는 동적으로 충돌 관리를 위한 지원을 제공한다. 본 논문에서는 다른 노드의 메모리 영역에 이미 존재하는 데이터를 재 사용하여 I/O 비용을 줄이기 위해 collective I/O 방안에서의 소프트웨어 캐슁 방안과 두 가지 모형에서의 chunking과 온라인 압축방안을 기술한다. 그리고 이상에서 기술한 방안들이 입출력을 위해 높은 성능을 보임을 기술하는데, 이 성능결과는 Intel Paragon과 ASCI/Red teraflops 기계 상에서 실험한 것이다. 그 결과 응용 레벨에서의 bandwidth는 peak point가 55%까지 측정되었다.Abstract In this paper we present the design, implementation and evaluation of a runtime system based on collective I/O techniques for irregular applications. We present two designs, namely, "Collective I/O" and "Pipelined Collective I/O". In the first scheme, all processors participate in the I/O simultaneously, making scheduling of I/O requests simpler but creating a possibility of contention at the I/O nodes. In the second approach, processors are grouped into several groups, so that only one group performs I/O simultaneously, while the next group performs communication to rearrange data, and this entire process is pipelined to reduce I/O node contention dynamically. In other words, the design provides support for dynamic contention management. Then we present a software caching method using collective I/O to reduce I/O cost by reusing data already present in the memory of other nodes. Finally, chunking and on-line compression mechanisms are included in both models. We demonstrate that we can obtain significantly high-performance for I/O above what has been possible so far. The performance results are presented on an Intel Paragon and on the ASCI/Red teraflops machine. Application level I/O bandwidth up to 55% of the peak is observed.he peak is observed.