• Title/Summary/Keyword: Key-point

Search Result 1,839, Processing Time 0.031 seconds

Calculation of Key Blocks' Safety Ratio based on Discontinuity Analysis (불연속면 분석에 근거한 쐐기블록 안전율 계산)

  • Kim, Eunsung;Noh, Sanghun;Lee, Sang-Soon
    • Journal of the Korean Geotechnical Society
    • /
    • v.40 no.3
    • /
    • pp.101-108
    • /
    • 2024
  • A system with the ability to recognize potential key blocks during tunnel construction by analyzing the rock face was developed in this study. This system predicts the formation of key blocks in advance and evaluates their safety factors. A laser scanner was used to collect a three-dimensional point cloud of the rock face, which was then utilized to model the excavation surface and derive the joint surfaces. Because joint surfaces have specific strikes and dip angles, the key blocks formed by these surfaces are deduced through iterative calculations, and the safety factor of each key block can be calculated accordingly. The model experiments confirmed the accuracy of the system's output in terms of the joint surface characteristics. By inputting the joint surface information, the calculated safety factors were compared with those from the existing commercial software, demonstrating stable calculation results within a 1% error margin.

A Novel Face Recognition Algorithm based on the Deep Convolution Neural Network and Key Points Detection Jointed Local Binary Pattern Methodology

  • Huang, Wen-zhun;Zhang, Shan-wen
    • Journal of Electrical Engineering and Technology
    • /
    • v.12 no.1
    • /
    • pp.363-372
    • /
    • 2017
  • This paper presents a novel face recognition algorithm based on the deep convolution neural network and key point detection jointed local binary pattern methodology to enhance the accuracy of face recognition. We firstly propose the modified face key feature point location detection method to enhance the traditional localization algorithm to better pre-process the original face images. We put forward the grey information and the color information with combination of a composite model of local information. Then, we optimize the multi-layer network structure deep learning algorithm using the Fisher criterion as reference to adjust the network structure more accurately. Furthermore, we modify the local binary pattern texture description operator and combine it with the neural network to overcome drawbacks that deep neural network could not learn to face image and the local characteristics. Simulation results demonstrate that the proposed algorithm obtains stronger robustness and feasibility compared with the other state-of-the-art algorithms. The proposed algorithm also provides the novel paradigm for the application of deep learning in the field of face recognition which sets the milestone for further research.

Simulation Based Method for Mid-and-Long Term Technological Forecasting (중장기 기술예측을 위한 시뮬레이션 기반 방법론)

  • Yu, Sung-Yeol
    • The Journal of the Korea Contents Association
    • /
    • v.10 no.1
    • /
    • pp.372-380
    • /
    • 2010
  • In this study, we consider a mid-and-long term technological forecasting method based on simulation technique. We, first, gather information about a point of appearance time of new technologies which will be developed in the future and influence relationship among those technologies by Delphi survey. And then we propose a simulation-based heuristic approach searching for the key technology among new technologies which will be developed to attain a normative objective using the Delphi data. We also provide the range of occurrence time for individual technology and define key technologies in this study in contrast that a expert's estimate to occurrence time is only one point in traditional Delphi survey. The information for key technologies which are detected by this procedure gives priorities of R&D planning and aids the R&D planner or project manager in resource allocation.

Molecular dynamics simulation of primary irradiation damage in Ti-6Al-4V alloys

  • Tengwu He;Xipeng Li;Yuming Qi;Min Zhao;Miaolin Feng
    • Nuclear Engineering and Technology
    • /
    • v.56 no.4
    • /
    • pp.1480-1489
    • /
    • 2024
  • Displacement cascade behaviors of Ti-6Al-4V alloys are investigated using molecular dynamics (MD) simulation. The embedded atom method (EAM) potential including Ti, Al and V elements is modified by adding Ziegler-Biersack-Littmark (ZBL) potential to describe the short-range interaction among different atoms. The time evolution of displacement cascades at the atomic scale is quantitatively evaluated with the energy of primary knock-on atom (PKA) ranging from 0.5 keV to 15 keV, and that for pure Ti is also computed as a comparison. The effects of temperature and incident direction of PKA are studied in detail. The results show that the temperature reduces the number of surviving Frenkel pairs (FPs), and the incident direction of PKA shows little correlation with them. Furthermore, the increasing temperature promotes the point defects to form clusters but reduces the number of defects due to the accelerated recombination of vacancies and interstitial atoms at relatively high temperature. The cluster fractions of interstitials and vacancies both increase with the PKA energy, whereas the increase of interstitial cluster is slightly larger due to their higher mobility. Compared to pure Ti, the presence of Al and V is beneficial to the formation of interstitial clusters and indirectly hinders the production of vacancy clusters.

A Group Key Management Scheme for WSN Based on Lagrange Interpolation Polynomial Characteristic

  • Wang, Xiaogang;Shi, Weiren;Liu, Dan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.7
    • /
    • pp.3690-3713
    • /
    • 2019
  • According to the main group key management schemes logical key hierarchy (LKH), exclusion basis systems (EBS) and other group key schemes are limited in network structure, collusion attack, high energy consumption, and the single point of failure, this paper presents a group key management scheme for wireless sensor networks based on Lagrange interpolation polynomial characteristic (AGKMS). That Chinese remainder theorem is turned into a Lagrange interpolation polynomial based on the function property of Chinese remainder theorem firstly. And then the base station (BS) generates a Lagrange interpolation polynomial function f(x) and turns it to be a mix-function f(x)' based on the key information m(i) of node i. In the end, node i can obtain the group key K by receiving the message f(m(i))' from the cluster head node j. The analysis results of safety performance show that AGKMS has good network security, key independence, anti-capture, low storage cost, low computation cost, and good scalability.

Efficient End-to-End Key Establishment Scheme in ZigBee Networks (ZigBee 망에서의 효율적인 단대단 키 설정 기술)

  • Kim, Hyun-Jue;Chung, Jong-Moon
    • Proceedings of the IEEK Conference
    • /
    • 2008.06a
    • /
    • pp.169-170
    • /
    • 2008
  • To achieve secure communication in current ZigBee networks, encrypted messages using security keys need to be shared among devices. A link key shared by two devices is used for unicast communications, where the master key is the starting point for establishing a link key. The ZigBee protocol has some limitations in end-to-end key establishment, which are discussed and an improved end-to-end key establishment scheme is presented.

  • PDF

A Combined Random Scalar Multiplication Algorithm Resistant to Power Analysis on Elliptic Curves (전력분석 공격에 대응하는 타원곡선 상의 결합 난수 스칼라 곱셈 알고리즘)

  • Jung, Seok Won
    • Journal of Internet of Things and Convergence
    • /
    • v.6 no.2
    • /
    • pp.25-29
    • /
    • 2020
  • The elliptic curve crypto-algorithm is widely used in authentication for IoT environment, since it has small key size and low communication overhead compare to the RSA public key algorithm. If the scalar multiplication, a core operation of the elliptic curve crypto-algorithm, is not implemented securely, attackers can find the secret key to use simple power analysis or differential power analysis. In this paper, an elliptic curve scalar multiplication algorithm using a randomized scalar and an elliptic curve point blinding is suggested. It is resistant to power analysis but does not significantly reduce efficiency. Given a random r and an elliptic curve random point R, the elliptic scalar multiplication kP = u(P+R)-vR is calculated by using the regular variant Shamir's double ladder algorithm, where l+20-bit u≡rn+k(modn) and v≡rn-k(modn) using 2lP=∓cP for the case of the order n=2l±c.

Public key broadcast encryption scheme using new converting method

  • Jho, Nam-Su;Yoo, Eun-Sun;Rhee, Man-Young
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.18 no.6B
    • /
    • pp.199-206
    • /
    • 2008
  • Broadcast encryption is a cryptographical primitive which is designed for a content provider to distribute contents to only privileged qualifying users through an insecure channel. Anyone who knows public keys can distribute contents by means of public key broadcast encryption whose technique can also be applicable to many other applications. In order to design public key broadcast encryption scheme, it should devise some methods that convert a broadcast encryption scheme based on symmetric key cryptosystem to a public key broadcast encryption. Up to this point, broadcast encryption scheme on trial for converting from symmetric key setting to asymmetric public key setting has been attempted by employing the Hierarchical Identity Based Encryption (HIBE) technique. However, this converting method is not optimal because some of the properties of HIBE are not quite fitting for public key broadcast schemes. In this paper, we proposed new converting method and an efficient public key broadcast encryption scheme Pub-PI which is obtained by adapting the new converting method to the PI scheme [10]. The transmission overhead of the Pub-PI is approximately 3r, where r is the number of revoked users. The storage size of Pub-PI is O($c^2$), where c is a system parameter of PI and the computation cost is 2 pairing computations.

암호학의 발달과 최근 동향

  • 이희정
    • Journal for History of Mathematics
    • /
    • v.11 no.2
    • /
    • pp.8-16
    • /
    • 1998
  • We survey the development of cryptography from the ancient to the present as a mathematical point of view, and recent results of public key cryptosystems.

  • PDF

Automatic 3D Object Digitizing and Its Accuracy Using Point Cloud Data (점군집 데이터에 의한 3차원 객체도화의 자동화와 정확도)

  • Yoo, Eun-Jin;Yun, Seong-Goo;Lee, Dong-Cheon
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.30 no.1
    • /
    • pp.1-10
    • /
    • 2012
  • Recent spatial information technology has brought innovative improvement in both efficiency and accuracy. Especially, airborne LiDAR system(ALS) is one of the practical sensors to obtain 3D spatial information. Constructing reliable 3D spatial data infrastructure is world wide issue and most of the significant tasks involved with modeling manmade objects. This study aims to create a test data set for developing automatic building modeling methods by simulating point cloud data. The data simulates various roof types including gable, pyramid, dome, and combined polyhedron shapes. In this study, a robust bottom-up method to segment surface patches was proposed for generating building models automatically by determining model key points of the objects. The results show that building roofs composed of the segmented patches could be modeled by appropriate mathematical functions and the model key points. Thus, 3D digitizing man made objects could be automated for digital mapping purpose.