• 제목/요약/키워드: Key task

검색결과 520건 처리시간 0.033초

장기이식 코디네이터의 직무분석 (Task Performance and Analysis of Organ Transplantation Coordinators in Korea)

  • 김형숙;유양숙;조옥희
    • 임상간호연구
    • /
    • 제20권2호
    • /
    • pp.246-255
    • /
    • 2014
  • Purpose: Along the process of organ transplantation, coordinators perform complex professional roles, playing as a key person among recipients, donors, family members and medical staffs. The purpose was to analyze the tasks of organ transplantation coordinators using DACUM method and to establish the basis for standardizing them in accordance with relevant laws and systems. Methods: Participants were consisted of 78 transplantation coordinators working at the medical centers in Korea. The questionnaire was administered to analyze the criticality, difficulty and frequency of task elements. Results: The job of organ transplantation was classified into five duties, 13 tasks, and 84 task elements. The five duties were recipient management, donor management, organ donation activation management, organ transplantation administration, and professional capability development. On the four-point scale: donor management was the duty with the highest criticality (3.68), organ donation activation management was the duty of highest difficulty (2.96), and recipient management was the duty of the highest frequency (3.32). Conclusion: This study will be useful for developing an educational program and as a reference of nurse practitioner qualifying examination. It is necessary to develop a comprehensive educational program for transplantation coordinators in order to support them to take their complex roles successfully.

실시간 시스템에서 성능 향상 기법 (Enhanced Technique for Performance in Real Time Systems)

  • 김명준
    • 한국IT서비스학회지
    • /
    • 제16권3호
    • /
    • pp.103-111
    • /
    • 2017
  • The real time scheduling is a key research area in high performance computing and has been a source of challenging problems. A periodic task is an infinite sequence of task instance where each job of a task comes in a regular period. The RMS (Rate Monotonic Scheduling) algorithm has the advantage of a strong theoretical foundation and holds out the promise of reducing the need for exhaustive testing of the scheduling. Many real-time systems built in the past based their scheduling on the Cyclic Executive Model because it produces predictable schedules which facilitate exhaustive testing. In this work we propose hybrid scheduling method which combines features of both of these scheduling algorithms. The original rate monotonic scheduling algorithm didn't consider the uniform sampling tasks in the real time systems. We have enumerated some issues when the RMS is applied to our hybrid scheduling method. We found the scheduling bound for the hard real-time systems which include the uniform sampling tasks. The suggested hybrid scheduling algorithm turns out to have some advantages from the point of view of the real time system designer, and is particularly useful in the context of large critical systems. Our algorithm can be useful for real time system designer who must guarantee the hard real time tasks.

다중 신경망 레이어에서 특징점을 선택하기 위한 전이 학습 기반의 AdaBoost 기법 (Transfer Learning based on Adaboost for Feature Selection from Multiple ConvNet Layer Features)

  • 주마벡;가명현;고승현;조근식
    • 한국정보처리학회:학술대회논문집
    • /
    • 한국정보처리학회 2016년도 춘계학술발표대회
    • /
    • pp.633-635
    • /
    • 2016
  • Convolutional Networks (ConvNets) are powerful models that learn hierarchies of visual features, which could also be used to obtain image representations for transfer learning. The basic pipeline for transfer learning is to first train a ConvNet on a large dataset (source task) and then use feed-forward units activation of the trained ConvNet as image representation for smaller datasets (target task). Our key contribution is to demonstrate superior performance of multiple ConvNet layer features over single ConvNet layer features. Combining multiple ConvNet layer features will result in more complex feature space with some features being repetitive. This requires some form of feature selection. We use AdaBoost with single stumps to implicitly select only distinct features that are useful towards classification from concatenated ConvNet features. Experimental results show that using multiple ConvNet layer activation features instead of single ConvNet layer features consistently will produce superior performance. Improvements becomes significant as we increase the distance between source task and the target task.

'구기록물' 재편철 방안의 모색 (A Study on the Device of 'Archival Refiling')

  • 조영삼
    • 기록학연구
    • /
    • 제5호
    • /
    • pp.87-109
    • /
    • 2002
  • The issue of how to manage the existing records at an archives is very important from the aspects of principle and practicality in record management since it is deeply related with the system of managing new records. Although there are a few studies on filing and criteria on organizing records, they do not often help in the actual site of record and archives management. Therefore, we need to raise the issues that could develop in actual sites and find the ways or resolving these issues, other than the general criteria proposed. Refiling is a very important task for recovering the original order and needs to be a task that should be done according to the overall system and process of record management at an archives. Furthermore, it is very important to objectify and regulate the contents and methods of the task of refiling through the refiling criteria with the content of criteria being specific. From the arguments presented until now, we could tell that refiling falls in the area of record management at an archive directly related with the department of reproducing records at public organizations. Moreover, the role of archivists relates with the task of refiling is critical. Especially, distinguishing job according to chief object is a critical issue in the status and role of archivists at record and archives institutions. This process is important not only at the level of simple job makeup but also in record management. Archivists should be responsible for preparing refiling criteria, reviewing of problems developed in job process, classifying records for refiling, reviewing and refiling of catalogs and key words, selecting equipment and tools, and establishing various forms.

An Exploration of a Performer's Organic Action

  • BongHee, Son
    • International Journal of Advanced Culture Technology
    • /
    • 제10권4호
    • /
    • pp.383-388
    • /
    • 2022
  • This thesis explores the principle of a performer's organic action by means of his/her bodily responses on stage. This research has been developed to define the nature of a performer's central task in order to constitute empirical understanding of acting and the purpose of training in addressing the question of what sort of qualitative bodily training is necessary to be in a state of the full body involvement. This study investigates to articulate a performer's fundamental task at the most rudimentary level by utilizing those theatre artists' concepts with practical assumptions. In particular, the key terms, happen and change signifies the quality of a performer's body that has to fit into the given environment in which the performer's body can be subordinated through the moment on stage. Here, we argue that a performer's essential task parallel to make the following moment to happen and change by means of progressing a set of the next moment. In this manner, we also argue that a moment of displaying the performer's conscious effort, forceful and externalizing the visible elements under the use of erroneous language leads his/her body not to function on stage, a state of disengagement from his/her body. Finally, we provide a way to facilitate a performer's organic action by focused on his/her lived experience to create the functional moment which is opposite to the predominance of a representation, maintaining the performer's intellectual sense.

Parallelization and application of SACOS for whole core thermal-hydraulic analysis

  • Gui, Minyang;Tian, Wenxi;Wu, Di;Chen, Ronghua;Wang, Mingjun;Su, G.H.
    • Nuclear Engineering and Technology
    • /
    • 제53권12호
    • /
    • pp.3902-3909
    • /
    • 2021
  • SACOS series of subchannel analysis codes have been developed by XJTU-NuTheL for many years and are being used for the thermal-hydraulic safety analysis of various reactor cores. To achieve fine whole core pin-level analysis, the input preprocessing and parallel capabilities of the code have been developed in this study. Preprocessing is suitable for modeling rectangular and hexagonal assemblies with less error-prone input; parallelization is established based on the domain decomposition method with the hybrid of MPI and OpenMP. For domain decomposition, a more flexible method has been proposed which can determine the appropriate task division of the core domain according to the number of processors of the server. By performing the calculation time evaluation for the several PWR assembly problems, the code parallelization has been successfully verified with different number of processors. Subsequent analysis results for rectangular- and hexagonal-assembly core imply that the code can be used to model and perform pin-level core safety analysis with acceptable computational efficiency.

Provably Secure Length-Saving Public-Key Encryption Scheme under the Computational Diffie-Hellman Assumption

  • Baek, Joon-Sang;Lee, Byoung-Cheon;Kim, Kwang-Jo
    • ETRI Journal
    • /
    • 제22권4호
    • /
    • pp.25-31
    • /
    • 2000
  • Design of secure and efficient public-key encryption schemes under weaker computational assumptions has been regarded as an important and challenging task. As far as ElGamal-type encryption schemes are concerned, some variants of the original ElGamal encryption scheme based on weaker computational assumption have been proposed: Although security of the ElGamal variant of Fujisaki-Okamoto public -key encryption scheme and Cramer and Shoup's encryption scheme is based on the Decisional Diffie-Hellman Assumption (DDH-A), security of the recent Pointcheval's ElGamal encryption variant is based on the Computational Diffie-Hellman Assumption (CDH-A), which is known to be weaker than DDH-A. In this paper, we propose new ElGamal encryption variants whose security is based on CDH-A and the Elliptic Curve Computational Diffie-Hellman Assumption (EC-CDH-A). Also, we show that the proposed variants are secure against the adaptive chosen-ciphertext attack in the random oracle model. An important feature of the proposed variants is length-efficiency which provides shorter ciphertexts than those of other schemes.

  • PDF

제품 특성과 B2C 차별화 전략의 실증 분석 (Empirical Analysis on Product Based Differentiation Strategies in B2C industry)

  • 정석인;박우성;한현수
    • 한국경영정보학회:학술대회논문집
    • /
    • 한국경영정보학회 2007년도 추계학술대회
    • /
    • pp.527-532
    • /
    • 2007
  • Differentiation strategies have been suggested as the critical sources of competitive advantage in B2C industry where customers can switch internet shopping mall with one click with virtually no transaction cost. Indeed, competition on low pricing cannot be a viable strategy in B2C industry. Moreover, cultivating customer loyalty to attain profitability is still a challenging task for most internet shopping mall. In this study, we provide empirical analysis results on key managerial variables that indicate the difference between the product categories in terms of customer perception on relative value importance. We first identified comprehensive managerial variables and organized them in terms of customer decision stage. Next, with reference to extant literatures on product characteristics based e-commerce strategy, hypotheses are developed to formalize the customer value differences on the key managerial variables. Empirical testing results indicated that there are significant differences on customer perceived value of the key managerial variables between the product groups. The findings provide useful insight for further study on e-commerce differentiation strategy.

  • PDF

Efficient Resource Allocation with Multiple Practical Constraints in OFDM-based Cooperative Cognitive Radio Networks

  • Yang, Xuezhou;Tang, Wei;Guo, Wei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제8권7호
    • /
    • pp.2350-2364
    • /
    • 2014
  • This paper addresses the problem of resource allocation in amplify-and-forward (AF) relayed OFDM based cognitive radio networks (CRNs). The purpose of resource allocation is to maximize the overall throughput, while satisfying the constraints on the individual power and the interference induced to the primary users (PUs). Additionally, different from the conventional resource allocation problem, the rate-guarantee constraints of the subcarriers are considered. We formulate the problem as a mixed integer programming task and adopt the dual decomposition technique to obtain an asymptotically optimal power allocation, subcarrier pairing and relay selection. Moreover, we further design a suboptimal algorithm that sacrifices little on performance but could significantly reduce computational complexity. Numerical simulation results confirm the optimality of the proposed algorithms and demonstrate the impact of the different constraints.

A Classification-Based Virtual Machine Placement Algorithm in Mobile Cloud Computing

  • Tang, Yuli;Hu, Yao;Zhang, Lianming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권5호
    • /
    • pp.1998-2014
    • /
    • 2016
  • In recent years, cloud computing services based on smart phones and other mobile terminals have been a rapid development. Cloud computing has the advantages of mass storage capacity and high-speed computing power, and it can meet the needs of different types of users, and under the background, mobile cloud computing (MCC) is now booming. In this paper, we have put forward a new classification-based virtual machine placement (CBVMP) algorithm for MCC, and it aims at improving the efficiency of virtual machine (VM) allocation and the disequilibrium utilization of underlying physical resources in large cloud data center. By simulation experiments based on CloudSim cloud platform, the experimental results show that the new algorithm can improve the efficiency of the VM placement and the utilization rate of underlying physical resources.