• Title/Summary/Keyword: generating string

Search Result 18, Processing Time 0.021 seconds

A Method for Generating Robust Key from Face Image and User Intervention (얼굴과 사용자 입력정보를 이용하여 안전한 키를 생성하는 방법)

  • Kim, Hyejin;Choi, JinChun;Jung, Chang-hun;Nyang, DaeHun;Lee, KyungHee
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.27 no.5
    • /
    • pp.1059-1068
    • /
    • 2017
  • Even though BioHashing scheme can effectively extract binary string key from analog biometrics templates, it shows lower performance in stolen-token scenario due to dependency of the token. In this paper, to overcome this limitation, we suggest a new method of generating security key from face image and user intervention. Using BioHashing and GPT schemes, our scheme can adjust dependency of PIN for user authentication and generate robust key with sufficient length. We perform various experiments to show performance of the proposed scheme.

Application of a Loop-Based Genetic Algorithm for Loss Minimization in Distribution Systems (배전 계통의 손실 최소화를 위한 루프 기반의 유전자 알고리즘의 적용)

  • 전영재;김재철;최준호
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.15 no.3
    • /
    • pp.35-44
    • /
    • 2001
  • This paper presents a loop-based genetic algorithm for loss minimization of distribution systems by automatic sectionalizing switch operation in distribution systems. Genetic algorithm can be successfully applied to problem of loss minimization in distribution systems because it is suitable to solve combinatorial optimization problems. New loop-based string structure is proposed for generating the more feasible solutions, and the proposed restoration function converts infeasible solutions into feasible solutions. The loop-based genetic algorithm with sam adaptations have been applied to improve the computation time and convergence property. Numerical examples demonstrate the validity and effectiveness of the proposed methodology using a 32-bus and 69-bus system.

  • PDF

Analysis of hash functions based on cellular automata (셀룰러 오토마타 기반 해쉬 함수 분석)

  • Jeong Kitae;Lee Jesang;Chang Donghoon;Sung Jaechul;Lee Sangjin
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.14 no.6
    • /
    • pp.111-123
    • /
    • 2004
  • A hash function is a function that takes bit strings of arbitrary length to bit string of fixed length. A cellular automata is a finite state machine and has the property of generating pseudorandom numbers efficiently by combinational logics of neighbour cells. In [1] and [7], hash functions based on cellular automata which can be implemented efficiently in hardware were proposed. In this paper, we show that we can find collisions of these hash functions with probability 0.46875 and 0.5 respectively.

Mesh and turbulence model sensitivity analyses of computational fluid dynamic simulations of a 37M CANDU fuel bundle

  • Z. Lu;M.H.A. Piro;M.A. Christon
    • Nuclear Engineering and Technology
    • /
    • v.54 no.11
    • /
    • pp.4296-4309
    • /
    • 2022
  • Mesh and turbulence model sensitivity analyses have been performed on computational fluid dynamics simulations executed with Hydra and ANSYS Fluent for a single CANadian Deuterium Uranium (CANDU) 37M nuclear fuel bundle placed within a standard pressure tube. The goal of this work was to perform a methodical analysis to objectively determine an appropriate mesh and to gauge the sensitivity of different turbulence models for CANDU subchannel flow under isothermal conditions. The boundary conditions and material properties are representative of normal operating conditions in a high-powered channel of the Darlington Nuclear Generating Station. Four meshes were generated with ANSYS Workbench Meshing, ranging from 22 to 84 million cells, and analyzed here to determine an appropriate level of mesh resolution and quality. Five turbulence models were compared in the turbulence model sensitivity analysis: standard k - ε, RNG k - ε, realizable k - ε, SST k - ω, and the Reynolds Stress Model. The intent of this work was to gain confidence in mesh generation and turbulence model selection of a single bundle to inform the decision making of subsequent investigations of an entire fuel channel containing a string of twelve bundles.

A Study on Spatial Application of Digital Modulation Patterns - Focusing on generating digital patterns - (디지털 패턴의 생성과 공간적용방법 연구 - 디지털패턴의 생성을 중심으로 -)

  • Park, Jeong-Joo
    • Korean Institute of Interior Design Journal
    • /
    • v.19 no.6
    • /
    • pp.100-111
    • /
    • 2010
  • 'Pattern' is the term that is frequently used in the aspects of history, society, and science. It always appears in the remains or relics of the age of civilization when recording was started, and its evaluation and value differ by time. Patterns in the ancient civilization were symbolic, social, and spatially crucial. However, after the modernization, they were considered to be immoral and unnecessary, so the range of their significance came to reduce. Due to the development of science, ornament patterns lost the limitation of its range of use along with new interpretation of them. Especially with the advent of new scientific theories such as the evolution theory from the biological aspect, quantum mechanics, and super string theory, morphological possibilities more than the human scale perceived by men came to be discovered. Living organisms maintain their lives through patterns, structures, and processes in order to produce a system alive. Among them, patterns are the organization of relations determining the characteristics of the system. The present patterns may correspond to this meaning. The pattern in a space is the matter of how to relate the components after all. In a space, however, there are numerous components mingled with one another. If these tasks are conducted as analogue work, it will take a lot of time and effort. However, if digital media are utilized to perform the tasks like analysis, generation, or fabrication, it will produce a result with higher precision and efficiency. In this sense, parametric modeling is quite useful media. Opening morphological variation, it realizes more possibilities, connects conveniently the relations between complex components composing a space, and helps produce creative patterns.

Tabu Search-Genetic Process Mining Algorithm for Discovering Stochastic Process Tree (확률적 프로세스 트리 생성을 위한 타부 검색 -유전자 프로세스 마이닝 알고리즘)

  • Joo, Woo-Min;Choi, Jin Young
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.42 no.4
    • /
    • pp.183-193
    • /
    • 2019
  • Process mining is an analytical technique aimed at obtaining useful information about a process by extracting a process model from events log. However, most existing process models are deterministic because they do not include stochastic elements such as the occurrence probabilities or execution times of activities. Therefore, available information is limited, resulting in the limitations on analyzing and understanding the process. Furthermore, it is also important to develop an efficient methodology to discover the process model. Although genetic process mining algorithm is one of the methods that can handle data with noises, it has a limitation of large computation time when it is applied to data with large capacity. To resolve these issues, in this paper, we define a stochastic process tree and propose a tabu search-genetic process mining (TS-GPM) algorithm for a stochastic process tree. Specifically, we define a two-dimensional array as a chromosome to represent a stochastic process tree, fitness function, a procedure for generating stochastic process tree and a model trace as a string of activities generated from the process tree. Furthermore, by storing and comparing model traces with low fitness values in the tabu list, we can prevent duplicated searches for process trees with low fitness value being performed. In order to verify the performance of the proposed algorithm, we performed a numerical experiment by using two kinds of event log data used in the previous research. The results showed that the suggested TS-GPM algorithm outperformed the GPM algorithm in terms of fitness and computation time.

Formant Synthesis of Haegeum Sounds Using Cepstral Envelope (캡스트럼 포락선을 이용한 해금 소리의 포만트 합성)

  • Hong, Yeon-Woo;Cho, Sang-Jin;Kim, Jong-Myon;Chong, Ui-Pil
    • The Journal of the Acoustical Society of Korea
    • /
    • v.28 no.6
    • /
    • pp.526-533
    • /
    • 2009
  • This paper proposes a formant synthesis method of Haegeum sounds using cepstral envelope for spectral modeling. Spectral modeling synthesis (SMS) is a technique that models time-varying spectra as a combination of sinusoids (the "deterministic" part), and a time-varying filtered noise component (the "stochastic" part). SMS is appropriate for synthesizing sounds of string and wind instruments whose harmonics are evenly distributed over whole frequency band. Formants extracted from cepstral envelope are parameterized for synthesis of sinusoids. A resonator by Impulse Invariant Transform (IIT) is applied to synthesize sinusoids and the results are bandpass filtered to adjust magnitude. The noise is calculated by first generating the sinusoids with formant synthesis, subtracting them from the original sound, and then removing some harmonics remained. Linear interpolation is used to model noise. The synthesized sounds are made by summing sinusoids, which are shown to be similar to the original Haegeum sounds.

A Study on Knowledge Entity Extraction Method for Individual Stocks Based on Neural Tensor Network (뉴럴 텐서 네트워크 기반 주식 개별종목 지식개체명 추출 방법에 관한 연구)

  • Yang, Yunseok;Lee, Hyun Jun;Oh, Kyong Joo
    • Journal of Intelligence and Information Systems
    • /
    • v.25 no.2
    • /
    • pp.25-38
    • /
    • 2019
  • Selecting high-quality information that meets the interests and needs of users among the overflowing contents is becoming more important as the generation continues. In the flood of information, efforts to reflect the intention of the user in the search result better are being tried, rather than recognizing the information request as a simple string. Also, large IT companies such as Google and Microsoft focus on developing knowledge-based technologies including search engines which provide users with satisfaction and convenience. Especially, the finance is one of the fields expected to have the usefulness and potential of text data analysis because it's constantly generating new information, and the earlier the information is, the more valuable it is. Automatic knowledge extraction can be effective in areas where information flow is vast, such as financial sector, and new information continues to emerge. However, there are several practical difficulties faced by automatic knowledge extraction. First, there are difficulties in making corpus from different fields with same algorithm, and it is difficult to extract good quality triple. Second, it becomes more difficult to produce labeled text data by people if the extent and scope of knowledge increases and patterns are constantly updated. Third, performance evaluation is difficult due to the characteristics of unsupervised learning. Finally, problem definition for automatic knowledge extraction is not easy because of ambiguous conceptual characteristics of knowledge. So, in order to overcome limits described above and improve the semantic performance of stock-related information searching, this study attempts to extract the knowledge entity by using neural tensor network and evaluate the performance of them. Different from other references, the purpose of this study is to extract knowledge entity which is related to individual stock items. Various but relatively simple data processing methods are applied in the presented model to solve the problems of previous researches and to enhance the effectiveness of the model. From these processes, this study has the following three significances. First, A practical and simple automatic knowledge extraction method that can be applied. Second, the possibility of performance evaluation is presented through simple problem definition. Finally, the expressiveness of the knowledge increased by generating input data on a sentence basis without complex morphological analysis. The results of the empirical analysis and objective performance evaluation method are also presented. The empirical study to confirm the usefulness of the presented model, experts' reports about individual 30 stocks which are top 30 items based on frequency of publication from May 30, 2017 to May 21, 2018 are used. the total number of reports are 5,600, and 3,074 reports, which accounts about 55% of the total, is designated as a training set, and other 45% of reports are designated as a testing set. Before constructing the model, all reports of a training set are classified by stocks, and their entities are extracted using named entity recognition tool which is the KKMA. for each stocks, top 100 entities based on appearance frequency are selected, and become vectorized using one-hot encoding. After that, by using neural tensor network, the same number of score functions as stocks are trained. Thus, if a new entity from a testing set appears, we can try to calculate the score by putting it into every single score function, and the stock of the function with the highest score is predicted as the related item with the entity. To evaluate presented models, we confirm prediction power and determining whether the score functions are well constructed by calculating hit ratio for all reports of testing set. As a result of the empirical study, the presented model shows 69.3% hit accuracy for testing set which consists of 2,526 reports. this hit ratio is meaningfully high despite of some constraints for conducting research. Looking at the prediction performance of the model for each stocks, only 3 stocks, which are LG ELECTRONICS, KiaMtr, and Mando, show extremely low performance than average. this result maybe due to the interference effect with other similar items and generation of new knowledge. In this paper, we propose a methodology to find out key entities or their combinations which are necessary to search related information in accordance with the user's investment intention. Graph data is generated by using only the named entity recognition tool and applied to the neural tensor network without learning corpus or word vectors for the field. From the empirical test, we confirm the effectiveness of the presented model as described above. However, there also exist some limits and things to complement. Representatively, the phenomenon that the model performance is especially bad for only some stocks shows the need for further researches. Finally, through the empirical study, we confirmed that the learning method presented in this study can be used for the purpose of matching the new text information semantically with the related stocks.