• Title/Summary/Keyword: 비트

Search Result 5,535, Processing Time 0.028 seconds

Optimized Implementation of Block Cipher PIPO in Parallel-Way on 64-bit ARM Processors (64-bit ARM 프로세서 상에서의 블록암호 PIPO 병렬 최적 구현)

  • Eum, Si Woo;Kwon, Hyeok Dong;Kim, Hyun Jun;Jang, Kyoung Bae;Kim, Hyun Ji;Park, Jae Hoon;Song, Gyeung Ju;Sim, Min Joo;Seo, Hwa Jeong
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.10 no.8
    • /
    • pp.223-230
    • /
    • 2021
  • The lightweight block cipher PIPO announced at ICISC'20 has been effectively implemented by applying the bit slice technique. In this paper, we propose a parallel optimal implementation of PIPO for ARM processors. The proposed implementation enables parallel encryption of 8-plaintexts and 16-plaintexts. The implementation targets the A10x fusion processor. On the target processor, the existing reference PIPO code has performance of 34.6 cpb and 44.7 cpb in 64/128 and 64/256 standards. Among the proposed methods, the general implementation has a performance of 12.0 cpb and 15.6 cpb in the 8-plaintexts 64/128 and 64/256 standards, and 6.3 cpb and 8.1 cpb in the 16-plaintexts 64/128 and 64/256 standards. Compared to the existing reference code implementation, the 8-plaintexts parallel implementation for each standard has about 65.3%, 66.4%, and the 16-plaintexts parallel implementation, about 81.8%, and 82.1% better performance. The register minimum alignment implementation shows performance of 8.2 cpb and 10.2 cpb in the 8-plaintexts 64/128 and 64/256 specifications, and 3.9 cpb and 4.8 cpb in the 16-plaintexts 64/128 and 64/256 specifications. Compared to the existing reference code implementation, the 8-plaintexts parallel implementation has improved performance by about 76.3% and 77.2%, and the 16-plaintext parallel implementation is about 88.7% and 89.3% higher for each standard.

Exploring Changes in Science PCK Characteristics through a Family Resemblance Approach (가족유사성 접근을 통한 과학 PCK 변화 탐색)

  • Kwak, Youngsun
    • Journal of the Korean Society of Earth Science Education
    • /
    • v.15 no.2
    • /
    • pp.235-248
    • /
    • 2022
  • With the changes in the future educational environment, such as the rapid decline of the school-age population and the expansion of students' choice of curriculum, changes are also required in PCK, the expertise of science teachers. In other words, the categories constituting the existing 'consensus-PCK' and the characteristics of 'science PCK' are not fixed, so more categories and characteristics can be added. The purpose of this study is to explore the potential area of science PCK required to cope with changes in the future educational environment in the form of 'Family Resemblance Science PCK (Family Resemblance-PCK, hereafter)' through Wittgenstein's family resemblance approach. For this purpose, in-depth interviews were conducted with three focus groups. In the focus group in-depth interview, participants discussed how the science PCK required for science teachers in future schools in 2030-2045 will change due to changes in the future society and educational environment. Qualitative analysis was performed based on the in-depth interview, and semantic network analysis was performed on the in-depth interview text to analyze the characteristics of 'Family Resemblance-PCK' differentiated from the existing 'consensus-PCK'. In results, the characteristics of Family Resemblance-PCK, which are newly requested along with changes in role expectations of science teachers, were examined by PCK area. As a result of semantic network analysis of Family Resemblance-PCK, it was found that Family Resemblance-PCK expands its boundaries from the existing consensus-PCK, which is the starting point, and new PCK elements were added. Looking at the aspects of Family Resemblance-PCK, [AI-Convergence Knowledge-Contents-Digital], [Community-Network-Human Resources-Relationships], [Technology-Exploration-Virtual Reality-Research], [Self-Directed Learning-Collaboration-Community], etc., form a distinct network cluster, and it is expected that future science teacher expertise will be formed and strengthened around these PCK areas. Based on the research results, changes in the professionalism of science teachers in future schools and countermeasures were proposed as a conclusion.

Cultural Characteristics and Artificial Cultivation of Edible Mushroom, Clitocybe maxima (흰깔대기버섯의 배양적 특성 및 인공재배에 관한 연구)

  • Kim, M.K.;Kim, D.U.;Kang, H.W.;Seo, G.S.
    • Journal of Practical Agriculture & Fisheries Research
    • /
    • v.20 no.1
    • /
    • pp.35-47
    • /
    • 2018
  • A edible mushroom, Clitocybe maxima (Lentinus giganteusis) commercially cultivated in China and Taiwan. However, the researches of cultivation and cultural characteristics were not reported in Korea. In this study, we conducted on cultural characteristics and artificial cultivation of C. maxima. Six isolates were collected from China(3 isolates, commercial strain), Taiwan(1 isolate, commercial strain) and Korea(2 isolates, wild type). C. maxima and L. giganteus collected in China and Taiwan, respectively, are the same in China and are estimated to be of the same species as cultured characteristics. The mycelial growth of the collected strains was not significantly different in agar medium but it showed the best growth in YPMG in liquid culture. Optimum temperature for mycelial growth and induction of fruit body were 25℃ and 30℃, respectively. In order to artificial cultivation of C. maxima, cultural characteristics and artificial cultivation were carried out using agricultural by-products and forestry by-products materials. Mycelial growth was suitable in rice straw, cottonwood sawdust, corncob and rice seed medium, and it was selected as a cultivation medium. The suitable medium for artificial cultivation of C. maxima was selected to mixed medium 2(compounding ratio(v/v): 55% of hardwood sawdust, 5% of cottonseed pellets, 10% of cottonseed, 15% of beet pulp, 15% of swollen rice husks). It took about 30 days to be able to harvest, it was faster than oyster mushrooms. The cultivation period was about 30days. A isolate, CMA-002 was not initiation to fruit body primordiuma on the used cultivation substrate. Other 5 isolates were initiate and development to fruit body on the substrate used in this study. The strain CMA-003 was initiated to be fruiting body by 8~10 days after induction of fruiting body in all of the substrates. Isolate CMA-003 was generate to a bundle fruit body. Other isolates, however, were form fruit body individually. The CMA-003 strain was likely highly recommendable strains for farming. The optimum conditions for the induction and growth of C. maxima fruit body were 25~30℃, 8 hr illumination per day with white fluorescent lamp, 90~95% relative humidity, and 1,500 ppm of CO2 concentration in a cultivation room.

Development of New Device for the Rapid Measurement of the freshness of Wet Fish by Using Micro Computer (마이크로 컴퓨터를 이용한 어육의 신선도 측정장치의 개발)

  • CHO Young-Je;LEE Nam-Geoul;KIM Sang-Bong;CHOI Young-Joon;LEE Keun-Woo;KIM Geon-Bae
    • Korean Journal of Fisheries and Aquatic Sciences
    • /
    • v.28 no.3
    • /
    • pp.253-262
    • /
    • 1995
  • To develop a device for measuring fish freshness which could be move accurate and reliable than used freshness measuring systems. A new device based on digital circuit was designed using a microcomputer. The device was composed of a sensor part, 8096 microprocessor and a segment display. The effectiveness of device has been evaluated by the coefficient of correlation among the measured freshness stores such as electrical Q-value, K-value and amount of volatile basic nitrogen (VBN) of plaice, Paralichthys Olivaceus, during storage at $-3^{\circ}C,\;0^{\circ}C,\;5^{\circ}C,\;10^{\circ}C,\;and\;25^{\circ}C$. Q-values measured by a new device were more closely correlated with K-value (r=-0.978-\;-0.962,\;p<0.05) and VBN (r=-0.888-\;-0.988,\;p<0.05) in case of plaice meat. If more data would achieve using various fishes, this new designed device could be a valuable kit in fish market by its compact portability.

  • PDF

Evaluating Reverse Logistics Networks with Centralized Centers : Hybrid Genetic Algorithm Approach (집중형센터를 가진 역물류네트워크 평가 : 혼합형 유전알고리즘 접근법)

  • Yun, YoungSu
    • Journal of Intelligence and Information Systems
    • /
    • v.19 no.4
    • /
    • pp.55-79
    • /
    • 2013
  • In this paper, we propose a hybrid genetic algorithm (HGA) approach to effectively solve the reverse logistics network with centralized centers (RLNCC). For the proposed HGA approach, genetic algorithm (GA) is used as a main algorithm. For implementing GA, a new bit-string representation scheme using 0 and 1 values is suggested, which can easily make initial population of GA. As genetic operators, the elitist strategy in enlarged sampling space developed by Gen and Chang (1997), a new two-point crossover operator, and a new random mutation operator are used for selection, crossover and mutation, respectively. For hybrid concept of GA, an iterative hill climbing method (IHCM) developed by Michalewicz (1994) is inserted into HGA search loop. The IHCM is one of local search techniques and precisely explores the space converged by GA search. The RLNCC is composed of collection centers, remanufacturing centers, redistribution centers, and secondary markets in reverse logistics networks. Of the centers and secondary markets, only one collection center, remanufacturing center, redistribution center, and secondary market should be opened in reverse logistics networks. Some assumptions are considered for effectively implementing the RLNCC The RLNCC is represented by a mixed integer programming (MIP) model using indexes, parameters and decision variables. The objective function of the MIP model is to minimize the total cost which is consisted of transportation cost, fixed cost, and handling cost. The transportation cost is obtained by transporting the returned products between each centers and secondary markets. The fixed cost is calculated by opening or closing decision at each center and secondary markets. That is, if there are three collection centers (the opening costs of collection center 1 2, and 3 are 10.5, 12.1, 8.9, respectively), and the collection center 1 is opened and the remainders are all closed, then the fixed cost is 10.5. The handling cost means the cost of treating the products returned from customers at each center and secondary markets which are opened at each RLNCC stage. The RLNCC is solved by the proposed HGA approach. In numerical experiment, the proposed HGA and a conventional competing approach is compared with each other using various measures of performance. For the conventional competing approach, the GA approach by Yun (2013) is used. The GA approach has not any local search technique such as the IHCM proposed the HGA approach. As measures of performance, CPU time, optimal solution, and optimal setting are used. Two types of the RLNCC with different numbers of customers, collection centers, remanufacturing centers, redistribution centers and secondary markets are presented for comparing the performances of the HGA and GA approaches. The MIP models using the two types of the RLNCC are programmed by Visual Basic Version 6.0, and the computer implementing environment is the IBM compatible PC with 3.06Ghz CPU speed and 1GB RAM on Windows XP. The parameters used in the HGA and GA approaches are that the total number of generations is 10,000, population size 20, crossover rate 0.5, mutation rate 0.1, and the search range for the IHCM is 2.0. Total 20 iterations are made for eliminating the randomness of the searches of the HGA and GA approaches. With performance comparisons, network representations by opening/closing decision, and convergence processes using two types of the RLNCCs, the experimental result shows that the HGA has significantly better performance in terms of the optimal solution than the GA, though the GA is slightly quicker than the HGA in terms of the CPU time. Finally, it has been proved that the proposed HGA approach is more efficient than conventional GA approach in two types of the RLNCC since the former has a GA search process as well as a local search process for additional search scheme, while the latter has a GA search process alone. For a future study, much more large-sized RLNCCs will be tested for robustness of our approach.