• Journal of Digital Convergence
• /
• v.18 no.5
• /
• pp.105-114
• /
• 2020

This study explored the factors affecting the willingness to pay of OTT service users. The main results are as follows. First, the perceived usefulness of OTT service users has a positive effect on use satisfaction. Second, perceived playfulness of OTT service users has a positive effect on use satisfaction. Third, the perceived cost of OTT service users has a positive effect on use satisfaction. Fourth, the perceived usefulness of OTT service users has a positive effect on willingness to pay. Fifth, use satisfaction with OTT service has a positive effect on willingness to pay. In summary, the perceived usefulness, perceived playfulness, and perceived cost of OTT service users increase the satisfaction of use, and the perceived usefulness and satisfaction are the key factors for predicting the willingness to pay. This will be meaningful in that it has revealed a path to predict and explain the intention of paid users of OTT service users.

• Journal of Global Scholars of Marketing Science
• /
• v.2
• /
• pp.133-158
• /
• 1998

최근의 많은 연구에서 정보기술에 대한 서비스제공 및 서비스 질(qualiy)에 대한 평가와 측정도구의 개발이 활발하게 이르어져 왔다(Pitt et al 1998) 또한 서비스 주체가 인적 요인에서 무형의 매체로 전환되고 있으며, 이러한 원인은 정보기술의 응용성에서 찾을 수 있다. 따라서 본 연구에서는 기존의 서비스 관점을 정보기술의 응용분야의 한 핵심이 될 수 있는 정보통신분야의 이동 휴대통신을 중심으로 서비스 질을 평가하여 문제점과 대안을 탐색하고자 하였다. 정보통신분야는 기간산업으로서의 역할과 그 중요성이 더욱 증대되고 있으며, 개별 기업차원에서도 정보기술 인프라는 중요한 경쟁요인이 될 수 있다. 그러나 이 분야에 대한 연구가 미흡하고 단순한 지표를 통한 비교 등의 연구 방법론에 있어서도 미비하다고 볼 수 있다. 따라서 본 연구에서는 정보통신분야의 중요성을 인식하고 초기 단계의 이동 휴대통신 분야의 핵심역량을 규명하고 향후 서비스 전략의 성공요인을 찾아내고자 하였다. 이러한 연구를 수행하기 위해 서비스만족 변수를 대리 측정도구로 이용하여 정보통신 기술 부분, 정보제공 부분, 비용우위 및 차별화 부분을 통해 계층적으로 접근하였다. 본 연구의 결과는 크게 세부분으로 요약된다. 첫째, 정보통신기술 부분에 대해 혁신적이고 안정적일 때 서비스만족도는 우수한 것으로 분석되었다. 또한 통신장비 및 부가장비의 우수성도 서비스부분에 미치는 영향력이 큰 것으로 나타났다. 둘째, 정보제공과 서비스만족과의 관계에서는 필요정보에 대한 서비스 밀착도가 높으면 서비스만족도는 높은 것으로 분석되었다. 또한 정보제공 분야의 서비스 개발력은 서비스만족도에 미치는 영향정도도 크게 작용하는 것으로 나타났다. 셋째, 차별화 및 비용우위와 서비스만족과의 관계도 매우 유의한 것으로 분석되었다. 특히, 비용 및 요금은 서비스만족도에 결정적 영향변수로 나타났으며, 광고 및 홍보부분도 만족도의 영향변수로 분석되었다. 이러한 연구결과는 향후 서비스전략에 응용될 수 있으며, 이동 휴대통신분야의 성공요인을 가시적으로 분석할 수 있다. 본 연구의 한계점은 첫째, 실제 서비스를 제공하는 서비스 주체의 객관적인 평가가 부족하였고 이러한 상횡에서 정보통신 기술 서비스 능력이 잘 반영되지 못했다는 점을 들 수 있다. 둘째, 이동 통신의 분야별 연구를 통해 비교 평가가 세부적으로 이루어지지 못했으며 연구방법상 샘플조사의 한계와 객관적인 응답자료를 확보하기가 어려웠던 점을 들 수 있다. 마지막으로 분석결과에서는 변수간의 유의성이 있는 것으로 볼 수 있지만 측정도구가 미약하며, 향후 지속적인 연구와 측정도구의 개발이 필요하다고 볼 수 있다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11b
• /
• pp.853-856
• /
• 2003

바이오 텍스트 마이닝을 위한 정보 추출의 첫 단계는 생물학적 문헌으로부터의 유전자, 단백질, 세포조직 등과 같은 생물학적 개체명의 인식이다. 생물학적 개체명의 명명법상 특징이 매우 다양하고 저자의 개성에 의해 쉽게 좌우되어 단순히 규칙이나 학습 방법 만으로는 쉽게 개체명들을 인식할 수 없다. 또한, 생물학 관련 문헌에 나오는 가능한 모든 개체명과 이들의 모든 변형을 수록하는 것은 현실적으로 불가능하므로 이를 해결하기 위해 이미 알려진 개체명에 대해서 기본적으로 사전을 탐색하고 알려지지 않은 용어들을 규칙과 통계 기반 방법을 통하여 인식하는 것이 효과적이다. 그러나 만족할 만한 수준의 양질의 사전을 구축하는 것은 쉽지 않을 뿐만 아니라 많은 비용이 소요되며, 어느 순간 만족할 만한 성능을 낼 수 있는 사전을 구축했다. 할지라도 유지 관리 하는 것이 결코 쉬운 일이 아니며 마찬가지로 많은 비용을 필요로 하게 된다. 따라서, 잘 구축된 자원으로부터 필요한 정보를 추출하여 적절한 사전을 자동으로 구축하여 활용하는 방법을 사용할 경우, 사전 구축 및 관리에 드는 많은 비용을 줄이면서도 상당히 효과적인 성능을 얻을 수 있을 것이다. 본 연구에서는 바이오 텍스트 마이닝 엔진을 위한 생물학적 개체명 사전을 자동으로 구축하고 이를 쉽게 관리하도록 하는 도구를 개발하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.1A
• /
• pp.51-56
• /
• 2012

In order to reduce the complexity of HEVC, we propose a fast mode decision algorithm in depth videos. Since almost CU mode is decided as SKIP mode in depth-continuity regions, we design the algorithm using the property of depth videos. If cost of SKIP is smaller than the multiplication between the threshold for EarlySKIP and average cost of SKIP, EarlySKIP is performed. Otherwise, we calculate Inter $2N{\times}2N$. Then, if motion vector of Inter $2N{\times}2N$ is 0 and variance of CU is smaller than threshold for inter, we skip Inter $2N{\times}N$, Inter $N{\times}2N$. Experimental results show that our proposed algorithm reduces the encoding time from 39% to 82% with negligible PSNR loss and bitrate increase.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.10B
• /
• pp.973-980
• /
• 2009

Many studies which have been done for efficient installation and management of wireless sensor networks (WSN) include energy savings, key managements and sensor deployments. Sensor deployment problem is one of the most important and fundamental issues among them in that the topic is directly related with the system cost and performance. In this paper, we suggest a sensor deployment scheme that reduces the system cost of WSN while satisfying the fundamental system requirements of connectivity between sensor nodes and sensing coverage. Using graphical information system(GIS) which contains region-dependent information related with connectivity condition, the initial positions of sensors in the procedure simulated annealing (SA) are determined. The GIS information helps in reducing system cost reduction not only at the initial deployment of SA but also at the final deployment of SA which is shown by computer simulations.

• Information Systems Review
• /
• v.5 no.2
• /
• pp.169-182
• /
• 2003

The growth of electronic commerce make business to business electronic commerce market grow dramatically due to dramatic decrease of transaction cost and increase of productivity. It also influences the way of building transaction relationship between buyers and suppliers. This study tends to prove electronic market theory for Internet based 13213 commerce. We observe and analyze the implementation and usage patterns of procurement system of I company. The result shows that even through Internet enable many buyers and suppliers to participate and transact each other, the transaction pattern is different according to asset specificity and uncertainty as follows. First, with adoption of internet, the product with the higher asset specificity rather than lower asset specificity can be easily purchased. Second, Internet doesn't make any significant influence on the transaction of the product with higher uncertainty. But, organization's pre-audit process can indirectly influence on the decrease of the transaction uncertainty.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.10a
• /
• pp.131-134
• /
• 2014

The Internet allows firms to serve customers more effectively than ever before. In the B2C context, we examine the interrelationships among information privacy concerns, e-trust, and e-loyalty. The authors extend prior research by incorporating constructs of information privacy concerns into a more holistic conceptual framework. This study answers three research questions: Will the three components of information privacy concerns have a significant effect on e-loyalty through e-trust?, Does e-trust mediate e-loyalty?, Finally, do switching costs have a moderation effect between e-trust and e-loyalty?, The authors examine data from customers who have booked hotel accommodations online. The results support our hypotheses and confirm both the mediation role of e-trust and the moderation role of switching costs. Conceptually, this study provides an empirical validation of information privacy concerns, e-trust, and loyalty linkage. On the managerial level, this research provides insights into critical drivers of loyalty in the emerging online marketplace.

• The Korean Journal of Franchise Management
• /
• v.13 no.3
• /
• pp.45-55
• /
• 2022

Purpose: Consumers' experience of functional attributes is remembered, and the experience lowers the cost of consumers' input from their point of view and reduces uncertainty. It also plays an important role in consumers' positive emotions and responses. Accordingly, if information search costs are reduced in terms of the costs perceived by consumers about restaurants, a strategy differentiated from other companies can be established. Therefore, this study investigated the effect of functional congruence of restaurant stores on information search cost reduction, positive/negative emotions, and loyalty. Research Design, Data, and Methodology: This study investigated functional congruence, information search cost reduction, and positive/negative emotions. The structural relationship between loyalty was analyzed. To verify this, a research hypothesis was established based on previous studies and a research model was constructed. The questionnaire items were modified and used according to the current study, based on previous studies. The data were collected using the questionnaire method from 187 people who had dining out experience. Frequency analysis was performed to confirm demographic characteristics. Reliability, convergent validity, and discriminant validity of the collected data were verified. The research model was analyzed with a structural equation modeling (SmartPLS 4). Results: The findings show that functional congruence had significant positive effects on information search cost reduction and positive emotion, but no significant effect on negative emotion. Information search cost reduction had significant positive effects on positive emotion/negative emotion but did not significantly affect loyalty. Lastly, both positive and negative emotions had significant positive effects on loyalty. Conclusion: Based on transaction cost theory, this study found how functional congruence and information search cost reduction influence consumers' emotions. The functional attributes of restaurants were perceived by customers as information, thus uncertainty was decreased. Finally, appropriate management strategies and implications of functional congruence and information search cost in the restaurant were suggested.

• The Journal of Information Systems
• /
• v.25 no.4
• /
• pp.105-119
• /
• 2016

Purpose The conventional solution methods for production scheduling problems typically focus on the active schedules, which result in short makespans. However, the active schedules are more difficult to generate than the semi active schedules. In other words, semi active schedule based search strategy may help to reduce the computational costs associated with production scheduling. In this context, this paper aims to compare the performances of active schedule based and semi active schedule based search methods for production scheduling problems. Design/methodology/approach Two decoding approaches, active schedule decoding and semi active schedule decoding, are introduced in this paper, and they are used to implement genetic algorithms for classical job shop scheduling problem. The permutation representation is adopted by the genetic algorithms, and the decoding approaches are used to obtain a feasible schedule from a sequence of given operations. Findings The semi active schedule based genetic algorithm requires slightly more iterations in order to find the optimal schedule, while its execution time is quite shorter than active schedule based genetic algorithm. Moreover, the operations of semi active schedule decoding is easy to understand and implement. Consequently, this paper concludes that semi active schedule based search methods also can be useful if effective search strategies are given.

• KIPS Transactions on Computer and Communication Systems
• /
• v.10 no.9
• /
• pp.243-250
• /
• 2021

Recently, with the development of cloud computing, interest in database outsourcing is increasing. However, when the database is outsourced, there is a problem in that the information of the data owner is exposed to internal and external attackers. Therefore, in this paper, we propose a parallel range query processing algorithm that supports privacy protection. The proposed algorithm uses the Paillier encryption system to support data protection, query protection, and access pattern protection. To reduce the operation cost of a checking protocol (SRO) for overlapping regions in the existing algorithm, the efficiency of the SRO protocol is improved through a garbled circuit. The proposed parallel range query processing algorithm is largely composed of two steps. It consists of a parallel kd-tree search step that searches the kd-tree in parallel and safely extracts the data of the leaf node including the query, and a parallel data search step through multiple threads for retrieving the data included in the query area. On the other hand, the proposed algorithm provides high query processing performance through parallelization of secure protocols and index search. We show that the performance of the proposed parallel range query processing algorithm increases in proportion to the number of threads and the proposed algorithm shows performance improvement by about 5 times compared with the existing algorithm.