• The Journal of the Korea Contents Association
• /
• v.10 no.10
• /
• pp.267-273
• /
• 2010

The present study examined factors for current conditions of dental office manager in Korean dental clinic. 108 randomly selected members of Korean dental office manager responded to a questionnaire. A survey was conducted for a month from 1, June 2008, and the chi-square test and ANOVA were used in the statistical analysis. The findings of the study were as follows: The number of members depending on the type of occupation dental hospital was the highest number of members, members of the dental hygienist at the dental hospital number significantly higher. The career of dental office manager followed by 1-5 year in dental hospital, 5-10 year in dental network, 1-5 year in dental clinic accounting for 48%, 52.9%, 69.4%. The difficulty during duty performance are high expectation of owner in dental hospital, learning of dental office manager duty in dental clinic. The duty of dental office manager followed by customer service, appointment scheduling, telephone etiquette, treatment plan. Henceforth, it needs to standardize the Korean name of dental office manager and duty. Also, it have to an official certification system.

• Journal of Astronomy and Space Sciences
• /
• v.23 no.3
• /
• pp.245-258
• /
• 2006

In this paper, an automation algorithm of analyzing and scheduling the station-keeping maneuver is presented for Communication, Ocean and Meteorological Satellite (COMS). The perturbation analysis for keeping the position of the geostationary satellite is performed by analytic methods. The east/west and north/south station-keeping maneuvers we simulated for COMS. Weekly east/west and biweekly north/south station-keeping maneuvers are investigated for a period of one year. Various station-keeping orbital parameters are analyzed. As the position of COMS is not yet decided at either $128.2^{\circ}E\;or\;116.0^{\circ}E$, both cases are simulated. For the case of $128.2^{\circ}E$, east/west station-keeping requires ${\Delta}V$ of 3.50m/s and north/south station-keeping requires ${\Delta}V$ of 52.71m/s for the year 2009. For the case of $116.0^{\circ}E,\;{\Delta}V$ of 3.86m/s and ${\Delta}V$ of 52.71m/s are required for east/west and north/south station-keeping, respectively. The results show that the station-keeping maneuver of COMS is more effective at $128.2^{\circ}E$.

• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.2
• /
• pp.174-182
• /
• 2002

The object-oriented design methods and their CASE tools are widely used in practice by many real-time software developers. However, object-oriented CASE tools require an additional step of identifying tasks from a given design model. Unfortunately, it is difficult to automate this step for a couple of reasons: (1) there are inherent discrepancies between objects and tasks; and (2) it is hard to derive tasks while maximizing real-time schedulability since this problem makes a non-trivial optimization problem. As a result, in practical object-oriented CASE tools, task identification is usually performed in an ad-hoc manner using hints provided by human designers. In this paper, we present a systematic, schedulability-aware approach that can help mapping real-time object-oriented models to multi-threaded implementations. In our approach, a task contains a group of mutually exclusive transactions that may possess different periods and deadline. For this new task model, we provide a new schedulability analysis algorithm. We also show how the run-time system is implemented and how executable code is generated in our frame work. We have performed a case study. It shows the difficulty of task derivation problem and the utility of the automated synthesis of implementations as well as the Inappropriateness of the single-threaded implementations.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.19 no.4
• /
• pp.85-92
• /
• 2018

Reductions of the electricity charge are achieved by demand management of the load. The demand management method of the load using ESS involves peak shifting, which shifts from a high demand time to low demand time. By shifting the load, the peak load can be lowered and the energy charge can be saved. Electricity charges consist of the energy charge and the basic charge per contracted capacity. The energy charge and peak load are minimized by Linear Programming (LP) and Quadratic Programming (QP), respectively. On the other hand, each optimization method has its advantages and disadvantages. First, the LP cannot separate the efficiency of the ESS. To solve these problems, the charge and discharge efficiency of the ESS was separated by Mixed Integer Linear Programming (MILP). Nevertheless, both methods have the disadvantages that they must assume the reduction ratio of peak load. Therefore, QP was used to solve this problem. The next step was to optimize the formula combination of QP and LP to minimize the electricity charge. On the other hand, these two methods have disadvantages in that the charge and discharge efficiency of the ESS cannot be separated. This paper proposes an optimization method according to the situation by analyzing quantitatively the advantages and disadvantages of each optimization method.

• The Journal of Information Technology
• /
• v.4 no.3
• /
• pp.87-100
• /
• 2001

IETF has proposed integrated services model(Int-Serv) and differentiated service(Diff-Serv) to supply IP QoS in Internet[1][2]. Int-Serv model uses state information of each IP flow, so satisfies QoS according to traffic characteristics, but increases the amount of flow state information with increasing flow number. Diff-Serv uses PHP(Per Hop Behaviour) and there are well-defined classes to provide differentiated traffics with different services according to delay and loss sensitivity. Diff-Serv model can provide diverse services in Internet because of having no the state and signal information of each flow. As MPLS uses the packet forwarding technology based on label, it implements the forwarding engine of high performance easily. The MPLS can set up the path having different and variable bandwidth and assign each path to particular CoS (Class of Service). Therefore it is possible to support the Diff-Serv model of well- defined classes that can provide the differentiated traffic with different services according to delay and loss sensitivity in IP QoS models of IETF. In this paper we propose a scheme that can accommodate Diff-Serv model to provide QoS. The system performance has been estimated by scheduling plan according to traffic classes.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.2
• /
• pp.40-46
• /
• 2010

Multi-user MIMO (Multiple-Input Multiple-Output) systems require collaborative PF schedulers to improve the performance of the log sum of average transmission rates. While the performance of single cell based conventional PF schedulers has been evaluated over various channel conditions, scheduling algorithms by multiple base stations which select multiple users over a given time frame and their performance require further investigations. In this paper, we apply a collaborative PF scheduler to the distributed multi-user MIMO system, which assigns radio resources to multiple users by exchanging user channel information from base stations located in three adjacent sectors. We further evaluate its performance in terms of the log sum of average transmission rates. The performance is compared to that of the full-search collaborative PF scheduler which searches over all possible combinations of user groups, and that of a parallel PF scheduler that determines users without channel information exchange among base stations. We show the log sum of average transmission rates of the collaborative PF scheduler outperforms that of the parallel PF scheduler in low percentile region. In addition, the collaborative PF scheduler exhibits a negligible performance degradation when compared to the full-search collaborative PF scheduler while a significant reduction of the computational complexity is achievable at the same time.

• The Journal of Society for e-Business Studies
• /
• v.24 no.4
• /
• pp.119-133
• /
• 2019

Recently, the importance prediction of photovoltaic power (PV) is considered as an essential function for scheduling adjustments, deciding on storage size, and overall planning for stable operation of PV facility systems. In particular, since most of PV power is generated in peak time, PV power prediction in a peak time is required for the PV system operators that enable to maximize revenue and sustainable electricity quantity. Moreover, Prediction of the PV power output in peak time without meteorological information such as solar radiation, cloudiness, the temperature is considered a challenging problem because it has limitations that the PV power was predicted by using predicted uncertain meteorological information in a wide range of areas in previous studies. Therefore, this paper proposes the LSTM (Long-Short Term Memory) based the PV power prediction model only using the meteorological, seasonal, and the before the obtained PV power before peak time. In this paper, the experiment results based on the proposed model using the real-world data shows the superior performance, which showed a positive impact on improving the PV power in a peak time forecast performance targeted in this study.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.36 no.8
• /
• pp.803-809
• /
• 2012

It is necessary to predict the heating load in order to determine the optimal scheduling control of district heating systems. Heating loads are affected by many complex parameters, and therefore, it is necessary to develop an efficient, flexible, and easy to use prediction method for the heating load. In this study, simple specifications included in a building design document and the estimated temperature and humidity are used to predict the heating load on the next day. To validate the performance of the proposed method, heating load data measured from a benchmark district heating system are compared with the predicted results. The predicted outdoor temperature and humidity show a variation trend that agrees with the measured data. The predicted heating loads show good agreement with the measured hourly, daily, and monthly loads. During the heating period, the monthly load error was estimated to be 4.68%.

• KIISE Transactions on Computing Practices
• /
• v.21 no.2
• /
• pp.154-159
• /
• 2015

Over the past few years, user needs in the smartphone application market have been shifted from diversity toward intelligence. Here, we propose a novel cognitive agent that plans the daily routines of users using the lifelog data collected by the smart phones of individuals. The proposed method first employs DPGMM (Dirichlet Process Gaussian Mixture Model) to automatically extract the users' POI (Point of Interest) from the lifelog data. After extraction, the POI and other meaningful features such as GPS, the user's activity label extracted from the log data is then used to learn the patterns of the user's daily routine by POMDP (Partially Observable Markov Decision Process). To determine the significant patterns within the user's time dependent patterns, collaboration was made with the SNS application Foursquare to record the locations visited by the user and the activities that the user had performed. The method was evaluated by predicting the daily routine of seven users with 3300 feedback data. Experimental results showed that daily routine scheduling can be established after seven days of lifelogged data and feedback data have been collected, demonstrating the potential of the new method of place-time-activity coupled daily routine planning systems in the intelligence application market.

• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.2
• /
• pp.113-118
• /
• 2013

The current GPU virtualization techniques incur large overheads when executing application programs mainly due to the fine-grain time-sharing scheduling of the GPU among multiple Virtual Machines (VMs). Besides, the current techniques lack of portability, because they include the APIs for the GPU computations in the VM monitor. In this paper, we propose a low overhead and high performance GPU virtualization approach on a heterogeneous HPC system based on the open-source Xen. Our proposed techniques are tailored to the bio applications. In our virtualization framework, we allow a VM to solely occupy a GPU once the VM is assigned a GPU instead of relying on the time-sharing the GPU. This improves the performance of the applications and the utilization of the GPUs. Our techniques also allow a direct pass-through to the GPU by using the IOMMU virtualization features embedded in the hardware for the high portability. Experimental studies using microbiology genome analysis applications show that our proposed techniques based on the direct pass-through significantly reduce the overheads compared with the previous Domain0 based approaches. Furthermore, our approach closely matches the performance for the applications to the bare machine or rather improves the performance.