• 보건행정학회지
• /
• 제17권1호
• /
• pp.1-27
• /
• 2007

This study is designed to estimate an appropriate level of patient's cost-sharing for oriental medical services in the Korean National Health Insurance. The findings of this study can be summarized as follows: 1) The current co-payment system for oriental medical services does not reflect its cost structure in clinical practice due to inconsistency of cost-sharing plan in the NHI. 2) Both oriental medical institutions and their patients, as a result, are at a relative disadvantage in financial burden, compared with other services. 3) The substantial proportion of patients' cost-sharing depends on the amount of co-payment and the range of medical cost that a flat rate is applied to. 4) The extension of the range doesn't make any substantial decrease in patient's cost-sharing. 5) The fixed amount of co-payment is more sensitive than a range to total variations of patient's cost-sharing. Based on the above, the budget impacts of a new co-payment system were estimated for each co-insurance rate, according to given scenarios. The results range from -59 billion Won (-8.5%) to 16 billion Won(2.3%).

• 한국IT서비스학회지
• /
• 제15권4호
• /
• pp.153-174
• /
• 2016

On account of multiple causes, including prolonged global economic crisis, addressing environmental pollution and the advent of hyper-connected society, a new paradigm called 'sharing economy' has rapidly emerged. Many startups have attempted to build promising business model based on the sharing economy concept. Nevertheless, successful cases are still very rare in the global level, except for Uber and Airbnb cases. Therefore, this study analyzes necessary causes and sufficient causes for successful settlements in the market through a comparative case analysis on digital matching firms in the sharing economy businesses. For the case study, we compare five successful cases (Uber, Airbnb, Kickstarter, TaskRabbit and DogVacay), three failure cases (Homejoy, Ridejoy and Tuterspree) and a platform cooperativism case (Juno) in accordance with six value attributes of business model including value proposition, market segment, value chain, cost structure and profit potential, value network and competitive strategy. We apply Boolean method to support controlled comparison and eliminate unnecessary attributes. The Boolean analysis result shows that value proposition, cost structure and profit potential, value network and competitive strategy are the essential attributes. Furthermore, the result indicates that each attribute is a necessary condition, where all four conditions should be met simultaneously in order to be successful. With this result, we discuss essential consideration for those who are planning startup based on the sharing economy business model.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권12호
• /
• pp.4552-4567
• /
• 2014

A (n,t,n) secret sharing scheme is to share a secret among n group members, where each member also plays a role of a dealer,and any t shares can be used to recover the secret. In this paper, we propose a strong (k,t,n) verifiable multi-secret sharing scheme, where any k out of n participants operate as dealers. The scheme realizes both threshold structure and adversary structure simultaneously, and removes a trusted third party. The secret reconstruction phase is performed using an additive homomorphism for decreasing the storage cost. Meanwhile, the scheme achieves the pre-verification property in the sense that any participant doesn't need to reveal any information about real master shares in the verification phase. We compare our proposal with the previous (n,t,n) secret sharing schemes from the perspectives of what kinds of access structures they achieve, what kinds of functionalities they support and whether heavy storage cost for secret share is required. Then it shows that our scheme takes the following advantages: (a) realizing the adversary structure, (b) allowing any k out of n participants to operate as dealers, (c) small sized secret share. Moreover, our proposed scheme is a favorable candidate to be used in many applications, such as secure multi-party computation and privacy preserving data mining, etc.

• 대한예방한의학회지
• /
• 제10권2호
• /
• pp.95-120
• /
• 2006

The purpose of this paper is to investigate the structure of cost-sharing for oriental medical services in the national health insurance. Out-of-pocket payment in ambulatory oriental medical care is a co-payment of KRW3,000 up to total expenses of KRW15,000, and co-insurance rate of 30% thereafetr. The empirical analysis based on medial claims data shows that the frequency of medical claims for outpatient care are mostly concentrated just below a total expenses of KRW15,000, and it decreases beyond a total expense of KRW15,000, while it rebounds between KRW17,000${\sim}$20,000. This means the current co-payment(KRW3,000) in oriental medical services should be applied up to a total payment of KRW17,000${\sim}$20,000, or the level of co-payment should be adjusted upward to KRW45,000 in order to be consistent in cost-sharing, between co-payment and co-insurance.

• 한국정보과학회논문지:정보통신
• /
• 제29권5호
• /
• pp.466-472
• /
• 2002

본 논문에서는 계층적 셀 구조에서 umbrella 셀과 overlaid 셀 사이의 부하 분배 문제를 연구한다. 부하 분배 정책을 제안하고 HSDPA에서 인터넷 트래픽을 전달하는 경우를 시뮬레이션하여 제안된 정책의 성능을 평가한다. 평가 결과, 마이크로 셀이 피코 셀의 부하를 잘 분담해주는 것으로 나타났으며, 특히 특정한 피코 셀 집단에 큰 부하가 가해졌을 경우에 그 효과가 크게 나타났다. 이 정책을 사용할 경우, 비정상적인 큰 부하에 대처하기 위해 필요한 용량을 확보할 필요가 없어지므로 시스템 설치비용을 줄일 수 있게 된다.

• 한국정보디스플레이학회:학술대회논문집
• /
• 한국정보디스플레이학회 2005년도 International Meeting on Information Displayvol.I
• /
• pp.531-534
• /
• 2005

This paper presents a new data line sharing technique for TFT-LCD panels. This technique reduces the number of data driver IC's to half by having two adjacent pixels share the same data line. This in turn doubles the number of gate lines, which are integrated directly on the glass substrate of amorphous silicon for further cost reduction and more compactness. The proposed technique with new pixel array structure was applied to 15.4 inch WXGA TFT-LCD panels and has proven that the number of driver IC's were halved with nearly 41% circuit cost reduction and 5.3% reduction in power consumption without degrading the image quality.

• Journal of information and communication convergence engineering
• /
• 제13권2호
• /
• pp.86-96
• /
• 2015

In mobile communication, mobile services [MSs] (e.g., phone calls, short/multimedia messages, and Internet data) incur a cost to both mobile users (MUs) and mobile service providers (MSPs). The proposed model MobPrice consists of dynamic data pricing schemes for mobile communication in order to achieve optimal usage of MSs at minimal prices. MobPrice inspires MUs to subscribe MSs with flexibility of data sharing and intra-peer exchanges, thereby reducing overall cost. The main contributions of MobPrice are three-fold. First, it proposes a novel k-level data-pricing (kDP) scheme for MSs. Second, it extends the kDP scheme with the notion of service-sharing-based pricing schemes to a collaborative peer-to-peer data-pricing (pDP) scheme and a cluster-based data-pricing (cDP) scheme to incorporate the notion of 'cluster' (made up of two or more MUs) in mobile communication. Third, our performance study shows that the proposed schemes are indeed effective in maximizing MS subscriptions and minimizing MS's price/user.

• 디지털융복합연구
• /
• 제19권7호
• /
• pp.95-111
• /
• 2021

인공지능과 빅데이터의 기술혁신에도 인공지능과 빅데이터가 시장경쟁 영향에 대한 이론연구들은 아직 초기이다. 따라서 본 논문은 인공지능, 빅데이터, 데이터 공유가 신규 진입기업에 미치는 영향을 게임이론을 활용하여 분석하였다. 먼저 기업의 경영환경을 내부와 외부로 구분하였다. 이후 인공지능 알고리즘을 (1) 고객마케팅, (2) 비용 절감, (3) 비용 절감을 위한 자동화 알고리즘으로 구분하였다. 또한 빅데이터를 외부 및 내부 데이터로 구분하였다. 분석 결과 외부 데이터의 공유는 기존 기업의 고객마케팅 알고리즘에는 영향이 없고 신규 기업의 진입장벽을 완화했다. 하지만 기존 기업의 비용 절감 알고리즘들과 내부 빅데이터의 개선은 신규기업의 시장진입 장벽이 될 수 있다. 이러한 시사점들은 (1) 인공지능, 빅데이터, 데이터 공유에 따른 시장구조, 경쟁, 기업행태 영향분석과 (2) 인공지능과 빅데이터 정책수립 시 이바지할 수 있다.

• 한국정보과학회논문지:데이타베이스
• /
• 제33권6호
• /
• pp.563-577
• /
• 2006

스트림 처리기는 다수의 연속질의에서 제한된 자원을 효율적으로 이용하기 위하여 자원공유 기법을 이용한다. 기존의 기법은 계층구조를 유지하여 집계질의를 처리한다. 그래서 삽입연산은 계층구조 재구성 비용이 필요하다. 또한 검색연산은 서로 다른 슬라이딩 윈도우 크기에 속하는 집계정보 검색비용이 필요하다. 그래서 본 논문에서는 보다 빠른 질의 처리를 위해 선형 자료구조를 사용한다. 제안기법은 팬(Pane)크기 결정단계와 팬 생성단계, 팬 삭제단계로 구성된다. 팬 크기 결정단계는 정확한 집계정보를 유지하기 위한 최적 팬 크기를 결정하는 단계이며, 팬 생성단계는 스트림 버퍼로부터 팬 크기만큼의 데이타에 대한 집계정보를 저장하는 단계이다. 팬 삭제단계는 더 이상 연속질의가 사용하지 않는 팬을 삭제하는 단계이다. 제안 기법은 선형 자료 구조를 이용하므로 계층구조를 이용하는 자료 구조에 비해 자원을 적게 사용한다. 또한 스트림 데이타가 입력되어도 팬 크기에 해당하는 집계정보만 계산하면 되므로 집계정보 삽입비용이 감소하고, 서로 다른 슬라이딩 윈도우 크기에 대해서도 선형검색으로 집계정보 검색비용이 감소한다. 성능평가를 통하여 제안기법이 적은 메모리 사용 결과를 보였으며, 질의 처리 속도가 증가하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권2호
• /
• pp.565-586
• /
• 2022

Cloud storage's elastic expansibility not only provides flexible services for data owners to store their data remotely, but also reduces storage operation and management costs of their data sharing. The data outsourced remotely in the storage space of cloud service provider also brings data security concerns about data integrity. Data integrity verification has become an important technology for detecting the integrity of remote shared data. However, users without data access rights to verify the data integrity will cause unnecessary overhead to data owner and cloud service provider. Especially malicious users who constantly launch data integrity verification will greatly waste service resources. Since data owner is a consumer purchasing cloud services, he needs to bear both the cost of data storage and that of data verification. This paper proposes a verification control algorithm in data integrity verification for remotely outsourced data. It designs an attribute-based encryption verification control algorithm for multiple verifiers. Moreover, data owner and cloud service provider construct a common access structure together and generate a verification sentinel to verify the authority of verifiers according to the access structure. Finally, since cloud service provider cannot know the access structure and the sentry generation operation, it can only authenticate verifiers with satisfying access policy to verify the data integrity for the corresponding outsourced data. Theoretical analysis and experimental results show that the proposed algorithm achieves fine-grained access control to multiple verifiers for the data integrity verification.