• Health Policy and Management
• /
• v.17 no.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%).

• Journal of Information Technology Services
• /
• v.15 no.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)
• /
• v.8 no.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.

• Journal of Society of Preventive Korean Medicine
• /
• v.10 no.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.

• Journal of KIISE:Information Networking
• /
• v.29 no.5
• /
• pp.466-472
• /
• 2002

We investigate the load sharing problem between the umbrella cell and the overlaid tells in hierarchical cell structure. A load sharing strategy is proposed and its performance is evaluated by simulation when it is used for transmission of the mobile Internet traffic using the High Speed Downlink Packet Access scheme. The results show that, with the proposed strategy, the microcell backs well the overlaid picocells up, especially when a specific picocell cluster suffers unusual heavy load condition. By using the strategy, we can reduce the installation cost, otherwise needed for increasing the system capacity of every picocell cluster to cope with the unusual heavy load.

• 한국정보디스플레이학회:학술대회논문집
• /
• 2005.07a
• /
• 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
• /
• v.13 no.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.

• Journal of Digital Convergence
• /
• v.19 no.7
• /
• pp.95-111
• /
• 2021

Despite the innovation of AI and Big Data, theoretical research bout the effect of AI and Big Data on market competition is still in early stages; therefore, this paper analyzes the effect of AI, Big Data, and data sharing on an entry firm by using game theory. In detail, the firms' business environments are divided into internal and external ones. Then, AI algorithms are divided into algorithms for (1) customer marketing, (2) cost reduction without automation, and (3) cost reduction with automation. Big Data is also divided into external and internal data. this study shows that the sharing of external data does not affect the incumbent firm's algorithms for consumer marketing while lessening the entry firm's entry barrier. Improving the incumbent firm's algorithms for cost reduction (with and without automation) and external data can be an entry barrier for the entry firm. These findings can be helpful (1) to analyze the effect of AI, Big Data, and data sharing on market structure, market competition, and firm behaviors and (2) to design policy for AI and Big Data.

• Journal of KIISE:Databases
• /
• v.33 no.6
• /
• pp.563-577
• /
• 2006

A stream processor uses resource sharing method for efficient of limited resource in multiple continuous queries. The previous methods process aggregate queries to consist the level structure. So insert operation needs to reconstruct cost of the level structure. Also a search operation needs to search cost of aggregation information in each size of sliding windows. Therefore this paper uses linear structure for optimization of sliding window aggregations. The method comprises of making decision, generation and deletion of panes in sequence. The decision phase determines optimum pane size for holding accurate aggregate information. The generation phase stores aggregate information of data per pane from stream buffer. At the deletion phase, panes are deleted that are no longer used. The proposed method uses resources less than the method where level structures were used as data structures as it uses linear data format. The input cost of aggregate information is saved by calculating only pane size of data though numerous stream data is arrived, and the search cost of aggregate information is also saved by linear searching though those sliding window size is different each other. In experiment, the proposed method has low usage of memory and the speed of query processing is increased.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.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.