• Journal of the Korean BIBLIA Society for library and Information Science
• /
• v.27 no.3
• /
• pp.51-73
• /
• 2016

This study analyzes on the perception of public librarians about lifelong education tasks in public library using Mann Whitney U-test, Spearman rank-order correlation coefficient, Multiple regression analysis. At the same time, analysis about re-education needs using Analytic Hierarchy Process is conducted. As result, at first, 87% of respondents feel moderate or difficult about lifelong education tasks, especially on planning task. At second, librarians who have qualification about lifelong educator feel easier (P=0.04) than others, in detail, task about lecturer liaison (P=0.04) and planning (P=0.05). Adding that, the career experience and the job difficulty of librarians has negative relationship (R=-0.217). Especially scheduling (R=-0.33) and progressing (R=-0.22) tasks show statistically meaningful. At third, as the result of Multiple regression analysis, tasks about planning (P=0.04) and library marketing (P=0.05) are selected as meaningful elements which effect overall difficulty of life long education job. As final, 91% of librarian need retraining for life long education function, as result of spearman (R=-0.210), the more librarians feels difficult about life long education jobs, the more they need retraining. Anyway, as the result of priority of retraining subjects through AHP technique, user communication (CU P=0.310), planning (PL P=0.246), library marketing (LM P=0.173) are in weight order. CR ratio shows 0.146 with permissible degree.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.7
• /
• pp.370-379
• /
• 2006

Computational grid provides the environment which integrates v 따 ious computing resources. Grid environment is more complex and various than traditional computing environment, and consists of various resources where various software packages are installed in different platforms. For more efficient usage of computational grid, therefore, some kind of integration is required to manage grid resources more effectively. In this paper, a global scheduler is suggested, which integrates grid resources at meta level with applying various scheduling policies. The global scheduler consists of a mechanical part and three policies. The mechanical part mainly search user queues and resource queues to select appropriate job and computing resource. An algorithm for the mechanical part is defined and optimized. Three policies are user selecting policy, resource selecting policy, and executing policy. These can be defined newly and replaced with new one freely while operation of computational grid is temporarily holding. User selecting policy, for example, can be defined to select a certain user with higher priority than other users, resource selecting policy is for selecting the computing resource which is matched well with user's requirements, and executing policy is to overcome communication overheads on grid middleware. Finally, various algorithms for user selecting policy are defined only in terms of user fairness, and their performances are compared.

• Journal of the Korea Society for Simulation
• /
• v.29 no.1
• /
• pp.57-69
• /
• 2020

Many researchers have recommended that DBR scheduling would be an efficient method to maintain the balance of their workload among many processes in the general flow shop. However, as product variety has increased in recent years, the process has become more complex and requires the re-entrance of raw materials and work in process. The re-entrant line has known for the complex manufacturing process that raw materials are repeatedly processed on the same machine. This study reviews the applicability of DBR against the re-entrant manufacturing line due to the distinguishing characteristics and the higher complexity caused by multiple visits of a job into the identical process. In order to apply the DBR method to the re-entrant process, the main idea is to reconstruct re-entrant process into a virtual flow process(loop) that has a single bottleneck. This study discusses the following two questions. First, DBR is also superior to traditional scheduling methods against re-entrant manufacturing line. And how we structure and detect the system bottleneck (or sub-bottleneck) through drum-buffer-rope concepts. To answer the above questions, we experimented and analyzed the effects of the applicability of DBR under the general re-entrant process model(TRC, Technology Research Center). As a result, we have identified a balance between loops for cycle time and work in process.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2000.11a
• /
• pp.247-256
• /
• 2000

오늘날의 기업은 상품을 판매하는 것 뿐만 아니라 기업의 신용과 이미지를 위해 그 상품에 대한 사후처리(After Service) 업무에 많은 투자를 하고 있다. 이러한 양질의 사후서비스를 고객에게 공급하기 위해서는 많은 인력을 합리적으로 관리해야 하고 요청되는 고장수리 서비스 업무를 빠르게 해결하기 위해서는 업무를 인력들에게 합리적으로 배정을 하고 회사의 비용을 최소화하면서 정해진 시간에 요청된 작업을 처리하기 위해서는 인력들에게 작업을 배정하고 스케줄링하는 문제가 발생된다. 본 논문에서는 이러한 문제를 해결하기 위해 화학계기의 A/S 작업을 인력에게 합리적으로 배정하는 스케줄링 시스템에 관한 연구이다. 먼저 스케줄링 모델을 HP 사의 화학분석 및 시스템을 판매, 유지보수 해 주는 "영진과학(주)"회사의 작업 스케줄을 분석하여 필요한 도메인과 고객서비스전략과 인력관리전략에서 제약조건을 추출하였고 여기에 스케줄링 문제를 해결하기 위한 방법으로 제약만족문제(CSP) 해결기법인 도메인 여과기법을 적용하였다. 도메인 여과기법은 제약조건에 의해 변수가 갖는 도메인의 불필요한 부분을 여과하는 것으로 제약조건과 관련되어 있는 변수의 도메인이 축소되는 것이다. 또한, 스케줄링을 하는데에 있어서 비용적인 측면에서의 스케줄링방법과 고객 만족도에서의 스케줄링 방법을 비교하여 가장 이상적인 해를 찾는데 트래이드오프(Trade-off)를 이용하여 최적의 해를 구했으며 실험을 통해 인력에게 더욱 효율적으로 작업들을 배정 할 수 있었고 또한, 정해진 시간에 많은 작업을 처리 할 수 있었으며 작업을 처리하는데 있어 소요되는 비용을 감소하는 결과를 얻을 수 있었다. 검증하였다.를, 지지도(support), 신뢰도(confidence), 리프트(lift), 컨빅션(conviction)등의 관계를 통해 다양한 방법으로 모색해본다. 이 연구에서 제안하는 이러한 개념계층상의 흥미로운 부분의 탐색은, 전자 상거래에서의 CRM(Customer Relationship Management)나 틈새시장(niche market) 마케팅 등에 적용가능하리라 여겨진다.선의 효과가 나타났다. 표본기업들을 훈련과 시험용으로 구분하여 분석한 결과는 전체적으로 재무/비재무적 지표를 고려한 인공신경망기법의 예측적중률이 높은 것으로 나타났다. 즉, 로지스틱회귀 분석의 재무적 지표모형은 훈련, 시험용이 84.45%, 85.10%인 반면, 재무/비재무적 지표모형은 84.45%, 85.08%로서 거의 동일한 예측적중률을 가졌으나 인공신경망기법 분석에서는 재무적 지표모형이 92.23%, 85.10%인 반면, 재무/비재무적 지표모형에서는 91.12%, 88.06%로서 향상된 예측적중률을 나타내었다.ting LMS according to increasing the step-size parameter $\mu$ in the experimentally computed. learning curve. Also we find that convergence speed of proposed algorithm is increased by (B+1) time proportional to B which B is the number of recycled data buffer without complexity

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.11
• /
• pp.9-15
• /
• 2014

In this paper, We propose a block reallocation algorithm for reducing network traffic in Hadoop cluster. The scheduler of Hadoop cluster receives a job from users. And the job is divided into multiple tasks assigned to nodes. At this time, the scheduler allocates the task to the node that satisfied data locality. If a task is assigned to the node that does not have the data(block) to be processed, the task is processed after the data transmission from another node. There is difference of workload among nodes because blocks in cluster have different access frequency. Therefore, the proposed algorithm relocates blocks according to the task allocation pattern of Hadoop scheduler. Eventually, workload of nodes are leveled, and the case of the task processing in a node that does not have the block to be processing is reduced. Thus, the network traffic of the cluster is also reduced. We evaluate the proposed block reallocation algorithm by a simulation. The simulation result shows maximum 23.3% reduction of network consumption than default delay scheduling for jobs processing.

• Asian Pacific Journal of Cancer Prevention
• /
• v.17 no.10
• /
• pp.4791-4796
• /
• 2016

Objectives: The purpose of this investigation was to examine the association between endometrial cancer and possible etiological agents. Methods: A case-control study was conducted in Iran between March 2012 and May 2016. The demographic and reproductive factors of 205 women with endometrial cancer were compared, and 590 healthy cases were participated in the control group. For each endometrial cancer case, there were three controls, who were matched in terms of age and residence. The data were considered significant at $p{\leq}0.05$. Results: After adjusting the variables, the nulliparity (OR 6.23, 95% CI 2.86-13.59), the nulligravidity (OR 5.94, 95% CI 2.51-14.06), the positive family history of reproductive cancer (OR 4.97, 95% CI 2.33-10.59), the infertility history (OR 2.38, 95%CI 1.32-4.31), the obesity ($BMI{\geq}25$) (OR 1.71, 95% CI 1.16-2.52), the early menarche age (<12 years) (OR 2.10, 95% CI 1.17-3.75), and the hormonal contraception use (OR 1.69, 95% CI 1.15-2.49) were found to be associated with an increased risk of endometrial cancer. Nevertheless, the education level, the job of women, the marital age, the leisure activities, and the breast feeding were not found to be associated with the endometrial cancer after adjusting the variables. Conclusion: Scheduling of the screening program is vitally indispensable to identify endometrial cancer in women with nulliparity, nulligravidity and the positive family history of cancer. In addition, women with early menarche, those with the history of infertility, the obese ones, and those who use contraception pills need to be particularly aware of the potential risks.

• The Journal of the Korea Contents Association
• /
• v.16 no.2
• /
• pp.163-173
• /
• 2016

Recently, massive amounts of stream data have been studied for distributed processing. In this paper, we propose an incremental stream data processing method based on in-memory in big data environments. The proposed method stores input data in a temporary queue and compare them with data in a master node. If the data is in the master node, the proposed method reuses the previous processing results located in the node chosen by the master node. If there are no previous results of data in the node, the proposed method processes the data and stores the result in a separate node. We also propose a job scheduling technique considering the load and performance of a node. In order to show the superiority of the proposed method, we compare it with the existing method in terms of query processing time. Our experimental results show that our method outperforms the existing method in terms of query processing time.

• The Journal of Korean Association of Computer Education
• /
• v.11 no.3
• /
• pp.81-89
• /
• 2008

The failure occurrence of resources in the grid computing is higher than in a tradition parallel computing. Since the failure of resources affects job execution fatally, fault tolerance service is essential in computational grids. And grid services are often expected to meet some minimum levels of quality of service (QoS) for desirable operation. However Globus toolkit does not provide fault tolerance service that supports fault detection service and management service and satisfies QoS requirement. Thus this paper proposes fault tolerance service to satisfy QoS requirement in computational grids. In order to provide fault tolerance service and satisfy QoS requirements, we expand the definition of failure, such as process failure, processor failure, and network failure. And we propose resource scheduling service, fault detection service and fault management service and show implement and experiment results.

• The KIPS Transactions:PartA
• /
• v.13A no.5 s.102
• /
• pp.405-412
• /
• 2006

Real-time operating systems have been used in various computing environments, where a job must be completed in its deadline, with various conditions, such as effective scheduling policies, the minimum of an interrupt delay, and the solutions of priority inversion problems, that should be perfectly satisfied to design and develop optimal real-time operating systems. Up to now, in order to solve priority inversion problems among several those conditions. There have been two representative protocols: basic priority inheritance protocol and priority ceiling emulation protocol. However, these protocols cannot solve complicated priority inversion problems. In this paper, we design a protocol, called recursive priority inheritance (RPI), protocol that effectively solves the complicated priority inversion problems. Our proposed protocol is also implemented in the Linux kernel and is compared with other existing protocols in the aspect of qualitative analysis.

• KIPS Transactions on Computer and Communication Systems
• /
• v.3 no.7
• /
• pp.231-240
• /
• 2014

Video transcoding techniques provide an efficient mechanism to make a video content adaptive to the capabilities of a variety of clients. However, it is hard to provide an appropriate quality-of-service(QoS) to the clients owing to heavy workload on transcoding operations. In light of this fact, this paper presents the dual transcoding method in order to guarantee QoS in streaming services by maximizing resource usage in a transcoding server equipped with both CPU and GPU computing units. The CPU and GPU computing units have different architectural features. The proposed method speculates workload of incoming transcoding requests and then schedules the requests either to the CPU or GPU accordingly. From performance evaluation, the proposed dual transcoding method achieved a speedup of 1.84 compared with traditional transcoding approach.