• Nuclear Engineering and Technology
• /
• v.55 no.10
• /
• pp.3639-3647
• /
• 2023

This paper defines a 3D full core neutronics benchmark which is based on the NuScale small modular reactor (SMR) concept. The paper provides a detailed description of the NuScale-like core, a list of expected outputs, and a reference solution to the benchmark exercises obtained with the Monte Carlo code Serpent. The benchmark was developed in the framework of the Euratom McSAFER project and can be used for verification of computational chains dedicated to 3D full-core neutronics simulations of water cooled SMRs. The paper is supplemented with a digital data set to ease the modeling process.

• Journal of muscle and joint health
• /
• v.19 no.2
• /
• pp.107-119
• /
• 2012

Purpose: This study was conducted to extract international classification of functioning, disability, and health (ICF) core sets for measuring functional status in acute stroke patients, and to evaluate clinical applicability of the core sets. Methods: A set of 22 ICF items on functional status in acute stroke patients were extracted from the Korean general ICF core sets and ICF core sets for stroke patients. The extracted ICF functional items were assessed at the time of admission and discharge among 100 stroke patients who were admitted in a university hospital. Results: Comparing to functional status at admission of acute stroke patients, the overall functional status at discharge was improved. However, functions on defecation, skin protection, and relationship with immediate family at the time of discharge were not significantly changed. Conclusion: The set of ICF functional items identified in this study may be reliable and valid to assess acute stoke patients' body functions, activities and participation and environmental factors in the holistic and comprehensive nursing context. Nursing interventions on bowel elimination and skin protection for acute stroke patients need to be developed.

• Proceedings of the Korean Society of Crop Science Conference
• /
• 2020.06a
• /
• pp.120-120
• /
• 2020

Based on the simple sequence repeat (SSR) marker, a Korean wheat core collection were established with 616 wheat accessions. Among them, the SNP genotyping for the entire genome was performed using DNA chip array to clarify the whole genome SNP profiles. Consequently, a total of 35,143 SNPs were found and we re-established a mini-core collection with 247 accessions. Population diversity and phylogenetic analysis revealed genetic diversity and relationships from the mini core set. In addition, genome-wide association study (GWAS) was performed on 19 phenotypic traits; ear type, awn length, culm length, ear length, awn color, seed coat color, culm color, ear color, loading, leaf length, leaf width, seeding stand, cold damage, weight, auricle, plant type, heading stage, maturation period, upright habit, and degree of flag leaf. The GWAS was performed using the fixed and random model circulating probability unification (FarmCPU), which identified 14 to 258 SNP loci related to 19 phenotypic traits. Our study indicates that this Korean wheat mini-core collection is a set of germplasm useful for basic and applied research with the aim of understanding and exploiting the genetic diversity of Korean wheat varieties.

• IEIE Transactions on Smart Processing and Computing
• /
• v.4 no.2
• /
• pp.83-88
• /
• 2015

Core-A is 32-bit synthesizable processor core with a unique instruction set architecture (ISA). In this paper, the Core-A ISA is introduced with discussion of useful features and the development environment, including the software tool chain and hardware on-chip debugger. Core-A is described using Verilog-HDL and can be customized for a given application and synthesized for an application-specific integrated circuit or field-programmable gate array target. Also, the GNU Compiler Collection has been ported to support Core-A, and various predesigned platforms are well equipped with the established design flow to speed up the hardware/software co-design for a Core-A-based system.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.2
• /
• pp.453-461
• /
• 2010

This paper presents a branch prediction algorithm and a 4-way set-associative cache for performance improvement of embedded RISC core and a clock-gating algorithm using ODC (Observability Don't Care) operation to improve the power consumption of the core. The branch prediction algorithm has a structure using BTB(Branch Target Buffer) and 4-way set associative cache has lower miss rate than direct-mapped cache. Pseudo-LRU Policy, which is one of the Line Replacement Policies, is used for decreasing the number of bits that store LRU value. The clock gating algorithm reduces dynamic power consumption. As a result of estimation of performance and dynamic power, the performance of the OpenRISC core applied the proposed architecture is improved about 29% and dynamic power of the core using Chartered $0.18{\mu}m$ technology library is reduced by 16%.

• Journal of Korean Physical Therapy Science
• /
• v.24 no.2
• /
• pp.17-26
• /
• 2017

Purpose: The importance of core exercise on muscle activation of the lower extremity has been studied. This study investigated the effects of core exercise using pressure biofeedback unit on muscle strength of lower extremity. Method: Fourteen healthy young adults (7 males and 7 females) were recruited. They were randomly separated two groups and performed core exercise using pressure biofeedback unit of one set for three minutes, 10sets per day for three weeks. Result: The mean of muscle strength of lower extremity, maximum power of muscle and peak TQ/BW in core exercise group significantly increased after core exercise using bio feedback unit (p<.05). Conclusion: These findings suggest that core exercise using pressure biofeed-back unit may help improving of muscle strength of lower extremity in young adults.

• 전기의세계
• /
• v.13 no.2
• /
• pp.1-4
• /
• 1964

Phase transformation is used to change some phase from phase in A.C. system. We have been used Scott or Fork connection in phase transformation the otherwise phase transformation was constructed from M-G set. From this M-G set, we could make phase shift facilities by mannual. Now, I can derive more easy phase transformation from taking another method. I believe this new phase transformation method in the first thing in the world. And so, I am going to explain about phase transformer construction process. The first, we could devide into equal part of core around the iron core as to be same size. The second, you will make primary and secondary winding on the core. The third, when you will supplied three phase A.C. at the terminal of primary winding you can get e.m.f. inducing of some phase at secondary. And so, we could make phase change from some phase A.C. We can apply this principle in many fields, i.e., freequency changer, phase leader of no use condenser, voltage regulator in keeping balance, and D.C. generator. And more, I will introduce in details concerning main pinciple and theory through following chapter.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.6
• /
• pp.2979-2995
• /
• 2017

In recent years, there has been an increasing number of studies focused on identifying a set of spreaders to maximize the influence of spreading in complex networks. Although the k-core decomposition can effectively identify the single most influential spreader, selecting a group of nodes that has the largest k-core value as the seeds cannot increase the performance of the influence maximization because the propagation sphere of this group of nodes is overlapped. To overcome this limitation, we propose a neighborhood coreness cover and discount heuristic algorithm named "NCCDH" to identify a set of influential and decentralized seeds. Using this method, a node in the high-order shell with the largest neighborhood coreness and an uncovered status will be selected as the seed in each turn. In addition, the neighbors within the same shell layer of this seed will be covered, and the neighborhood coreness of the neighbors outside the shell layer will be discounted in the subsequent round. The experimental results show that with increases in the spreading probability, the NCCDH outperforms other algorithms in terms of the affected scale and spreading speed under the Susceptible-Infected-Recovered (SIR) and Susceptible-Infected (SI) models. Furthermore, this approach has a superior running time.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.46 no.1
• /
• pp.68-75
• /
• 2009

As the recent performance of microprocessor is improving quickly, the necessity of cache is growing because of the increase of the access time of main memory. Every block of direct-mapped cache maps to one cache line. Although the mapping rule is simple, if different blocks map to one cache line, the miss ratio will be higher than the set-associative cache due to conflicts. In this paper, for the improvement of the direct-mapped cache of OpenRISC, 4-way set-associative cache is proposed. Four blocks of the main memory of the proposed cache map to one cache line so that the miss ratio is less than the direct-mapped cache. Pseudo-LRU Policy, which is one of the Line Replacement Policies, is used for decreasing the number of bits that store LRU value. The OpenRISC core including the 4-way set-associative cache was verified with FPGA emulation. As the result of performance measurement using test program, the performance of the OpenRISC core including the 4-way set-associative cache is higher than the previous one by 50% and the decrease of miss ratio is more than 15%.

• Journal of Korean Institute of Industrial Engineers
• /
• v.33 no.2
• /
• pp.183-190
• /
• 2007

We present a new decision tree classification algorithm using rough set theory that can induce classification rules, the construction of which is based on core attributes and relationship between objects. Although decision trees have been widely used in machine learning and artificial intelligence, little research has focused on improving classification quality. We propose a new decision tree construction algorithm that can be simplified and provides an improved classification quality. We also compare the new algorithm with the ID3 algorithm in terms of the number of rules.