• Journal of dental hygiene science
• /
• v.6 no.3
• /
• pp.163-167
• /
• 2006

The purpose of this study is to position the Korean Dental Hygienists Association(KDHA) for reserve dental hygienists as undergraduates, and thereby suggest KDHA's future potential businesses and its promising directions from comprehensive perspectives. To meet this goal, total 430 undergraduates in dental hygienics were asked to join questionnaire survey dating from November 28 to December 9, 2005. Then, the resulting data collected were analyzed using SPSS WIN 12.0. The results of data analysis can be outlined as follows: 1. Almost all of respondents(95.1%) recognized KDHA mainly via departmental faculty(37.7%), Internet(26.7%) and more. 2. It was found that KDHA's future potential businesses should be devoted primarily to promoting the right and benefit of dental hygienists, and secondly to business for their capability development. 3. In terms of joining the membership of KDHA, 73.0% of respondents showed desires to join KDHA certainly if they get relevant qualifications and 81.2% of respondents answered that it is necessary to pay membership fee to KDHA, if they join it. 4. A test about any possible associations with KDHA's positioning according to general characteristics showed that there were more or less significant differences in KDHA membership experience depending upon age(P = .022), and so was in the intention to join KDHA depending upon grade(P = .000), and in the membership fee payment depending upon both age(P = .000) and grade(P = .000) on statistical level.

• The Journal of the Korea Contents Association
• /
• v.8 no.10
• /
• pp.20-26
• /
• 2008

The quality of stream remaking is decided the load of a server and Jitter through the traffic of the transmission path between end to end. In order to improve these problems in this paper, I propose tree construction method of low-delay-level-multicast. In this case which the network congestion will be occurred by streaming quality, I also propose the technique which dynamically changes the transmission path. This technique first constructs the overlay structure for relaxing the overload of server. Secondly, in order to decrease Jitter of client, it makes upload bandwidth and low latency balanced. In the evaluation of the performance, this paper showed better enhancement of about $15%{\sim}24%$ than P2CAST[4] in the simulation about node average join count, average bandwidth, service request refusal ratio, RTT measurement of nodes, and node average join count by defect ratio.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.12
• /
• pp.74-82
• /
• 2008

In this paper, we propose a P2P based IPTV system using a multiple chain architecture. Proposed system is robust to the peer churn. As opposed to the internet the IPTV network managed by a single ISP has fewer bandwidth constraints and end-to-end connectivity. So, we emphasize preferentially robustness of a P2P network in IPTV environment. A single chain structure which was proposed previously emphasizes simplicity, however there exists considerable delay time at the end part of peers as the number of peers increasing. As a solution to the problem, we propose the scheme which seperates the chain into several levels and again divides each level into spans to diminish a delay time. Though the chain is separated into level and span, basic structure of proposed scheme is still a chain structure. So the scheme simplifies the recovery procedure caused by join or departure of peers. We will show the improved performance of proposed scheme rather than single chain structure with respect to the delay time and reliability.

• Journal of KIISE
• /
• v.42 no.9
• /
• pp.1109-1116
• /
• 2015

In this paper, we propose a query processing approach that uses the Spark functional programming and distributed memory system to solve the computational overhead of SPARQL. In the semantic web, RDF ontology data is produced at large scale, and the main challenge for the semantic web is to query and manipulate such a large ontology with a high throughput. The most existing studies on SPARQL have focused on deploying the Hadoop MapReduce framework, and although approaches based on Hadoop MapReduce have shown promising results, they achieve a low level of throughput due to the underlying distributed file processes. Therefore, in order to speed up the query processes, we suggest query- processing methods that are based on memory caching in distributed memory system. Our approach is also integrated with a clause unification method for propagating between the clauses that exploits Spark join, map and filter methods along with caching. In our experiments, we have achieved a high level of performance relative to other approaches. In particular, our performance was nearly similar to that of Sempala, which has been considered to be the fastest query processing system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.1A
• /
• pp.90-95
• /
• 2000

In the Ordered Core Based Tree(OCBT) protocol, a core location is the most important feature to affect the performance. In this paper, the location placement of multiple level cores is studied. The proposed algorithm isthat each node in the network evaluates a sum of shortest path costs from all the other nodes and the entirenetwork is divided into a hierarchy region to have 3-logical level(Small, Medium, Large). The node to have thelowest cost in each S-Region is decided to be a core node. Then, the core nodes in the each S-Region evaluatea sum of shortest path costs from all the other core nodes in the same M-Region. The core node to have thelowest cost is decided to be the upper level core node. Similarly the highest level core node is decided in theL-Region. The proposed algoritthm is compared with conventional two methods to put the core nodes in thenetwork One is the random method to put the core nodes randomly. The other is the center method to locatethe core node at the nearest node from the center of each S-Region and then to locate the highest level corenode at the nearest core node from the center of the entire network. Extensive simulations are performed in theview of mean tree cost and join latency. Simulation results show that the proposed algorithm has betterperformance than random method or center method.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.9
• /
• pp.1-8
• /
• 1993

In this paper, a new approach to the minimization of two-level Reed-Muller circuits is presented. In contrast to the previous method of using Xlinking operations to join two cubes for minimization. Cube selection method tries to select cubes one at a time until they cover the ON-set of the given function. A simple heuristic for selecting appropriate cubes is presented. In this heuristic, simply all cubes from the largest to the smallest are tried and whenever they decrease the number of remaining terms they are accepted. Since cubes once selected are not considered for a new selection, our method takes less time than other methods that need repetitive optimization process. The experimental results turned out to be improved in many cases compared to the best results in the literature.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.11a
• /
• pp.312-315
• /
• 2006

Overlay Multicast is a promising approach to overcome the implementation problem of IP multicast. Real time services like internet broadcasting are provided by overlay multicast technology due to the complex nature of IP multicast and the high cost to support multicast function. Since multicast members can dynamically join or leave their multicast group, it is necessary to keep a reliable overlay multicast tree to support real time service without delay. In this paper, we consider path level reliability that connects each member node. The problem is formulated as a binary integer programming which maximizes the reliability of multicast tree. Tabu search based algorithm is presented to solve the NP-hard problem.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.32A no.6
• /
• pp.104-110
• /
• 1995

In this paper, an effective method for the minimization of two-level Reed-muller expressions by cube selection whcih considers functional complexity is presented. In contrast to the previous methods which use Xlinking operations to join two cubes for minimizatio, the cube selection method tries to select cubes one at a time until they cover the ON-set of the given function. This method works for most benchmark circuits, but for parity-type functions it shows power performance. To solve this problem, a cost function which computes the functional complexity instead of only the size of ON-set of the function is used. Therefore the optimization is performed considering how the trun minterms are grouped together so that they can be realized by only a small number of cubes. In other words, it considers how the function is changed and how the change affects the next optimization step. Experimental results shows better performance in many cases including parity-type functions compared to pervious results.

• Journal of Preventive Medicine and Public Health
• /
• v.45 no.3
• /
• pp.127-136
• /
• 2012

The challenge facing the Korean National Health Insurance includes what to spend money on in order to elevate the 'value for money.' This article reviewed the changing issues associated with quality of care in the Korean health insurance system and envisioned a picture of an effective pay-for-performance (P4P) system in Korea taking into consideration quality of care and P4P systems in other countries. A review was made of existing systematic reviews and a recent Organization for Economic Cooperation and Development survey. An effective P4P in Korea was envisioned as containing three features: measures, basis for reward, and reward. The first priority is to develop proper measures for both efficiency and quality. For further improvement of quality indicators, an electronic system for patient history records should be built in the near future. A change in the level or the relative ranking seems more desirable than using absolute level alone for incentives. To stimulate medium- and small-scale hospitals to join the program in the next phase, it is suggested that the scope of application be expanded and the level of incentives adjusted. High-quality indicators of clinical care quality should be mapped out by combining information from medical claims and information from patient registries.

• Korean Journal of Occupational Health Nursing
• /
• v.24 no.4
• /
• pp.259-269
• /
• 2015

Purpose: The study is to identify a correlation among hospital nurses' emotional labor, social support and organizational commitment and to analyze the effects on organizational commitment. Methods: The participants are 300 nurses working at two general hospitals located in Gyeonggi-do, who agreed to join the study. Data collection were done from July to September in 2014. The collected data are analyzed a descriptive statistic, t-test, ANOVA, $Scheff{\acute{e}}$ test, Pearson's correlation coefficient, and multiple regression and SPSS/WIN 15.0 Program was used in the process. Results: Organizational commitment was negatively correlated with emotional works but it was positively correlated with social support. The factors affecting organizational commitment were informational support and evaluative support which were sub-domain of social support as well as level of emotional expression which was a sub-domain of emotional works, their positions and level of education. Conclusion: To increase the level of an organizational commitment, a method of coping in difficult situations and information relating to private assessments is recommended. Also, the organization should prepare a plan that members can properly manage their emotions face-to-face with clients.