• Title/Summary/Keyword: A key technique

Search Result 1,745, Processing Time 0.033 seconds

Covariance-driven wavelet technique for structural damage assessment

  • Sun, Z.;Chang, C.C.
    • Smart Structures and Systems
    • /
    • v.2 no.2
    • /
    • pp.127-140
    • /
    • 2006
  • In this study, a wavelet-based covariance-driven system identification technique is proposed for damage assessment of structures under ambient excitation. Assuming the ambient excitation to be a white-noise process, the covariance computation is shown to be able to separate the effect of random excitation from the response measurement. Wavelet transform (WT) is then used to convert the covariance response in the time domain to the WT magnitude plot in the time-scale plane. The wavelet coefficients along the curves where energy concentrated are extracted and used to estimate the modal properties of the structure. These modal property estimations lead to the calculation of the stiffness matrix when either the spectral density of the random loading or the mass matrix is given. The predicted stiffness matrix hence provides a direct assessment on the possible location and severity of damage which results in stiffness alteration. To demonstrate the proposed wavelet-based damage assessment technique, a numerical example on a 3 degree-of-freedom (DOF) system and an experimental study on a three-story building model, which are all under a broad-band excitation, are presented. Both numerical and experimental results illustrate that the proposed technique can provide an accurate assessment on the damage location. It is however noted that the assessment of damage severity is not as accurate, which might be due to the errors associated with the mode shape estimations as well as the assumption of proportional damping adopted in the formulation.

Advanced discretization of rock slope using block theory within the framework of discontinuous deformation analysis

  • Wang, Shuhong;Huang, Runqiu;Ni, Pengpeng;Jeon, Seokwon
    • Geomechanics and Engineering
    • /
    • v.12 no.4
    • /
    • pp.723-738
    • /
    • 2017
  • Rock is a heterogeneous material, which introduces complexity in the analysis of rock slopes, since both the existing discontinuities within the rock mass and the intact rock contribute to the degradation of strength. Rock failure is often catastrophic due to the brittle nature of the material, involving the sliding along structural planes and the fracturing of rock bridge. This paper proposes an advanced discretization method of rock mass based on block theory. An in-house software, GeoSMA-3D, has been developed to generate the discrete fracture network (DFN) model, considering both measured and artificial joints. Measured joints are obtained from the photogrammetry analysis on the excavation face. Statistical tools then facilitate to derive artificial joints within the rock mass. Key blocks are searched to provide guidance on potential reinforcement measures. The discretized blocky system is subsequently implemented into a discontinuous deformation analysis (DDA) code. Strength reduction technique is employed to analyze the stability of the slope, where the factor of safety can be obtained once excessive deformation of slope profile is observed. The combined analysis approach also provides the failure mode, which can be used to guide the choice of strengthening strategy if needed. Finally, an illustrated example is presented for the analysis of a rock slope of 20 m height inclined at $60^{\circ}$ using combined GeoSMA-3D and DDA calculation.

Effect of Generation Capacity Constraints on a Mixed Strategy Nash Equilibrium in a Multi-Player Game (다자게임에서 발전력제약이 복합전략 내쉬균형에 미치는 영향)

  • Lee, Kwang-Ho
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.57 no.1
    • /
    • pp.34-39
    • /
    • 2008
  • Nash Equilibrium(NE) is essential to investigate a participant's bidding strategy in a competitive electricity market. Congestion on a transmission line makes it difficult to compute the NE due to causing a mixed strategy. In order to compute the NE of a multi-player game, some heuristics are proposed with concepts of a key player and power transfer distribution factor in other studies. However, generation capacity constraints are not considered and make it more difficult to compute the NE in the heuristics approach. This paper addresses an effect of generation capacity limits on the NE, and suggest a solution technique for the mixed strategy NE including generation capacity constraints as two heuristic rules. It is reported in this paper that a role of the key player who controls congestion in a NE can be transferred to other player depending on the generation capacity of the key player. The suggested heuristic rules are verified to compute the mixed strategy NE with a consideration of generation capacity constraints, and the effect of the generation constraints on the mixed strategy NE is analyzed in simulations of IEEE 30 bus systems.

A Study on Efficient Data De-Identification Method for Blockchain DID

  • Min, Youn-A
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.13 no.2
    • /
    • pp.60-66
    • /
    • 2021
  • Blockchain is a technology that enables trust-based consensus and verification based on a decentralized network. Distributed ID (DID) is based on a decentralized structure, and users have the right to manage their own ID. Recently, interest in self-sovereign identity authentication is increasing. In this paper, as a method for transparent and safe sovereignty management of data, among data pseudonymization techniques for blockchain use, various methods for data encryption processing are examined. The public key technique (homomorphic encryption) has high flexibility and security because different algorithms are applied to the entire sentence for encryption and decryption. As a result, the computational efficiency decreases. The hash function method (MD5) can maintain flexibility and is higher than the security-related two-way encryption method, but there is a threat of collision. Zero-knowledge proof is based on public key encryption based on a mutual proof method, and complex formulas are applied to processes such as personal identification, key distribution, and digital signature. It requires consensus and verification process, so the operation efficiency is lowered to the level of O (logeN) ~ O(N2). In this paper, data encryption processing for blockchain DID, based on zero-knowledge proof, was proposed and a one-way encryption method considering data use range and frequency of use was proposed. Based on the content presented in the thesis, it is possible to process corrected zero-knowledge proof and to process data efficiently.

Patient Authentication Protocol for Synchronization between Implantable Medical Device (체내 삽입장치간 동기화를 위한 환자 인증 프로토콜)

  • Jeong, Yoon-Su;Kim, Yong-Tae
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.1
    • /
    • pp.49-56
    • /
    • 2013
  • Among U-healthcare services adapting the latest IT technique and medical technique, a body-injecting device technique providing medical service to a patient who has incurable disease. But the body-injecting device technique can be easily exposed during wireless section to the third person and it can be used illegally. This paper proposes certification protocol which certifies a patient and hospital staff using random number created by certification server and a patient with hospital staff by synchronization. Specially, the proposed protocol uses security information created by information registered in certification server previously by a patient and hospital staff so that in keeps from accessing of third person who didn't get approval. And it gives more stability.

A Study on Defense Technique Against Use-After-Free Attacks Using MTE (MTE 를 활용한 사용 후 해제 공격 방어기법 연구)

  • Yunseong Hwang;Junseung You;Yunheung Paek
    • Annual Conference of KIPS
    • /
    • 2024.05a
    • /
    • pp.279-282
    • /
    • 2024
  • The Use-after-free (UAF) bug is a long-standing temporal memory safety issue. To prevent UAF attacks, two commonly used approaches are lock-and-key and pointer nullification. Recently, ARM architecture supports the Memory Tagging Extension (MTE) that implemented a lock-and-key mechanism using a 4-bit tag during memory access. Previous research proposed a virtual address tagging scheme utilizing MTE to prevent UAF attacks. In this paper, we aimed to measure a simplified version of the previously proposed virtual address tagging scheme on real machines supporting MTE by implementing a simple module and conducting experiments.

An Optimal Random Carrier Pulse Width Modulation Technique Based on a Genetic Algorithm

  • Xu, Jie;Nie, Zi-Ling;Zhu, Jun-Jie
    • Journal of Power Electronics
    • /
    • v.17 no.2
    • /
    • pp.380-388
    • /
    • 2017
  • Since the carrier sequence is not reproducible in a period of the random carrier pulse width modulation (RCPWM) and a higher harmonic spectrum amplitude is likely to affect the quality of the power supply. In addition, electromagnetic interference (EMI) and mechanical vibration will appear. To solve these problems, this paper has proposed an optimal RCPWM based on a genetic algorithm (GA). In the optimal modulation, the range of the random carrier frequency is taken as a constraint and the reciprocal of the maximum harmonic spectrum amplitude is used as a fitness function to decrease the EMI and mechanical vibration caused by the harmonics concentrated at the carrier frequency and its multiples. Since the problems of the hardware make it difficult to use in practical engineering, this paper has presented a hardware system. Simulations and experiments show that the RCPWM is effective. Studies show that the harmonic spectrum is distributed more uniformly in the frequency domain and that there is no obvious peak in the wave spectra. The proposed method is of great value to research on RCPWM and integrated power systems (IPS).

Channel Coding Based Physical Layer Security for Wireless Networks (채널 부호화를 통한 물리계층 무선네트워크 보안기술)

  • Asaduzzaman, Asaduzzaman;Kong, Hyung Yun
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.8 no.3
    • /
    • pp.57-70
    • /
    • 2008
  • This paper introduces a new paradigm of physical layer security through channel coding for wireless networks. The well known spread spectrum based physical layer security in wireless network is applicable when code division multiple access (CDMA) is used as wireless air link interface. In our proposal, we incorporate the proposed security protocol within channel coding as channel coding is an essential part of all kind of wireless communications. Channel coding has a built-in security in the sense of encoding and decoding algorithm. Decoding of a particular codeword is possible only when the encoding procedure is exactly known. This point is the key of our proposed security protocol. The common parameter that required for both encoder and decoder is generally a generator matrix. We proposed a random selection of generators according to a security key to ensure the secrecy of the networks against unauthorized access. Therefore, the conventional channel coding technique is used as a security controller of the network along with its error correcting purpose.

  • PDF

A reversible data hiding scheme in JPEG bitstreams using DCT coefficients truncation

  • Zhang, Mingming;Zhou, Quan;Hu, Yanlang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.1
    • /
    • pp.404-421
    • /
    • 2020
  • A reversible data hiding scheme in JPEG compressed bitstreams is proposed, which could avoid decoding failure and file expansion by means of removing of bitstreams corresponding to high frequency coefficients and embedding of secret data in file header as comment part. We decode original JPEG images to quantified 8×8 DCT blocks, and search for a high frequency as an optimal termination point, beyond which the coefficients are set to zero. These blocks are separated into two parts so that termination point in the latter part is slightly smaller to make the whole blocks available in substitution. Then spare space is reserved to insert secret data after comment marker so that data extraction is independent of recovery in receiver. Marked images can be displayed normally such that it is difficult to distinguish deviation by human eyes. Termination point is adaptive for variation in secret size. A secret size below 500 bits produces a negligible distortion and a PSNR of approximately 50 dB, while PSNR is also mostly larger than 30 dB for a secret size up to 25000 bits. The experimental results show that the proposed technique exhibits significant advantages in computational complexity and preservation of file size for small hiding capacity, compared to previous methods.

On Security Analysis of Generalized Diffie-Hellman Key Distribution Systems (일반화된 Diffie-Hellman 키이분배방식의 안정성 분석)

  • 이필중;임채훈
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.16 no.7
    • /
    • pp.575-597
    • /
    • 1991
  • As an elegant solution of the key management scheme for a conventional cryptosystem. Diffie and Hellman introduced a public key distrbution system, whose security depends on the intractabliity of discrete loganthm problem over a finite field, and since then a lot of vartants of DH KDSS have been proposed. In this paper, we present the systematic approach to analyzing the security of a generalized DH KDS and designing an efficient and secure scheme. We classify vanous attacking methods and point out a possible way to avoid these attacks through the examples of successful attacking methods and point out a possible way to avoid these attacks through the examples of successful attack against those systems proposed so far or designed for this purpose. As security analysis tools, we present the redueiblity test, the information theoretic approach, and the protocol analysis technique, which we apply to variations of DH scheme to examine their security under all possble attacks.

  • PDF