• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권11호
• /
• pp.5717-5730
• /
• 2019

LBlock-s is the core block cipher of authentication encryption algorithm LAC, which uses the same structure of LBlock and an improved key schedule algorithm with better diffusion property. Using the differential properties of the key schedule algorithm and the cryptanalytic technique which combines impossible boomerang attacks with related-key attacks, a 15-round related-key impossible boomerang distinguisher is constructed for the first time. Based on the distinguisher, an attack on 22-round LBlock-s is proposed by adding 4 rounds on the top and 3 rounds at the bottom. The time complexity is about only 2^68.76 22-round encryptions and the data complexity is about 2⁵⁸ chosen plaintexts. Compared with published cryptanalysis results on LBlock-s, there has been a sharp decrease in time complexity and an ideal data complexity.

• ETRI Journal
• /
• 제39권2호
• /
• pp.255-263
• /
• 2017

This paper proposes a graph-theatrical approach to optimize spatial reuse by adopting a technique that quantizes the channel information into single bit sub-messages. First, we introduce an interference graph to model the network topology. Based on the interference graph, the computational requirements of the algorithm that computes the optimal spatial reuse factor of each user are reduced to quasilinear time complexity, ideal for practical implementation. We perform a resource allocation procedure that can maximize the efficiency of spatial reuse. The proposed spatial reuse scheme provides advantages in beamforming systems, where in the interference with neighbor nodes can be mitigated by using directional beams. Based on results of system level measurements performed to illustrate the physical interference from practical millimeter wave wireless links, we conclude that the potential of the proposed algorithm is both feasible and promising.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1999년도 하계종합학술대회 논문집
• /
• pp.69-72
• /
• 1999

In this paper, an efficient time domain equalization algorithm for discrete wavelet multitone(DWMT) data transmission is developed. In this algorithm, the time domain equalizer(TEQ) consists of two stages, i.e., the channel impulse response shortening equalizer(TEQ-S) in the first stage and the channel frequency flattening equalizer(TEQ-F) in the second stage. TEQ-S reduces the length of transmission channel impulse response to decrease intersymbol interference(ISI) followed by TEQ-F that enhances the channel frequency response characteristics to the level of an ideal channel, hence diminishes the bit error rate. TEQ-S is implemented using the least-squares(LS) method, while TEQ-F is designed by using the least mean-square(LMS) algorithm. Since DWMT system also requires of the frequency domain equalizer in order to further reduce ICI and ISI the hardware complexity is an another concern. However, by adopting an well designed and trained TEQ, the hardware complexity of the whole DWMT system can be greatly reduced.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1990년도 한국자동제어학술회의논문집(국내학술편); KOEX, Seoul; 26-27 Oct. 1990
• /
• pp.816-820
• /
• 1990

This paper is pre-stage for getting EGI which can be used for modeling of an object. It discusses the construction of the vision processing system and its algorithm for getting needle diagram from tie object image. We realize the algorithm with monocular camera system, using Reflectance Map theory and photometric stereo method. We can calculate the surface normal at any point in the image if we take multiple images at the different lighting conditions. From the 3 images taken from different lighting conditions through the experiment, we get the needle diagrams of the sphere and the object. We confirm the validness of the surface, normal acquisition algorithm comparing the experimental needle diagram with the ideal one obtained from the surface normal of the known object.

• 한국멀티미디어학회논문지
• /
• 제21권9호
• /
• pp.1052-1061
• /
• 2018

In this paper, we propose a new algorithm that is robust against the effects of objects that are relatively unaffected by camera motion and can accurately detect camera motion even in high resolution images. First, for more accurate camera motion detection, a global motion filter based on entropy of a motion vector is used to distinguish the background and the object. A block matching algorithm is used to find exact motion vectors. In addition, a matched filter with the angle of the ideal motion vector of each block is used. Motion vectors including 4 kinds of diagonal direction, zoom in, and zoom out are added additionally. The experiment shows that the precision, recall, and accuracy of camera motion detection compared to the recent results is improved by 12.5%, 8.6% and 9.5%, respectively.

• Journal of Information Processing Systems
• /
• 제16권5호
• /
• pp.1129-1144
• /
• 2020

The thangka image inpainting method based on wavelet transform is not ideal for contour curves when the high frequency information is repaired. In order to solve the problem, a new image inpainting algorithm is proposed based on edge structural constraints and wavelet transform coefficients. Firstly, a damaged thangka image is decomposed into low frequency subgraphs and high frequency subgraphs with different resolutions using wavelet transform. Then, the improved fast marching method is used to repair the low frequency subgraphs which represent structural information of the image. At the same time, for the high frequency subgraphs which represent textural information of the image, the extracted and repaired edge contour information is used to constrain structure inpainting in the proposed algorithm. Finally, the texture part is repaired using texture synthesis based on the wavelet coefficient characteristic of each subgraph. In this paper, the improved method is compared with the existing three methods. It is found that the improved method is superior to them in inpainting accuracy, especially in the case of contour curve. The experimental results show that the hierarchical method combined with structural constraints has a good effect on the edge damage of thangka images.

• 대한전기학회논문지:전력기술부문A
• /
• 제52권11호
• /
• pp.639-646
• /
• 2003

Nowadays traction motors in the urban rail transit vehicle are controlled by VVVF inverter and have capability of regenerative braking. The algorithms to deal with the regenerating vehicle in simulation for the DC traction power supply is introduced in this paper. Substations have to be separated from the system to represent reverse biased rectifiers in substations. The model of the trains in regenerative braking has to be changed from the ideal current source to the constant voltage source since the train input voltage has to be controlled below the certain train maximum voltage. Some mismatches are unevitable because the constraint of the regenerated power can not be imposed with the constant voltage source. The mismatches represent the unused regenerated power. A computer program is developed to verify the validity of the algorithm. The test run result shows the program behaves as it is expected and proves the algorithm's validity.

• Smart Structures and Systems
• /
• 제25권1호
• /
• pp.47-56
• /
• 2020

This paper proposes a model-based approach for structural damage identification and quantification. Using pseudo modal strain energy and mode shape vectors, a damage-sensitive objective function is introduced which is suitable for damage estimation and quantification in shear frames. Whale optimization algorithm (WOA) is used to solve the problem and report the optimal solution as damage detection results. To illustrate the capability of the proposed method, a numerical example of a shear frame under different damage patterns is studied in both ideal and noisy cases. Furthermore, the performance of the WOA is compared with particle swarm optimization algorithm, as one the widely-used optimization techniques. The applicability of the method is also experimentally investigated by studying a six-story shear frame tested on a shake table. Based on the obtained results, the proposed method is able to assess the health of the shear building structures with high level of accuracy.

• 한국군사과학기술학회지
• /
• 제13권4호
• /
• pp.642-649
• /
• 2010

LOS analysis is used for optimal deployment of mid-range guided weapon system or system engagement effectiveness simulation. Comparing to real-world, LOS analysis includes error sources such as coarse terrain data resolution, refraction of radio waves, and several ideal assumptions. In this research, exact LOS algorithm under assumption of constant earth curvature and error analysis of that is investigated. It proved that LOS algorithm under assumption of constant earth curvature has negligible error in mid-range guidance weapon system's scope.

• 한국IT서비스학회지
• /
• 제7권4호
• /
• pp.221-230
• /
• 2008

Green's relations are five equivalence relations that characterize the elements of a semigroup in terms of the principal ideals. The J relation is one of Green's relations. Although there are known algorithms that can compute Green relations, they are not useful for finding all J relations in the semigroup of all $n{\times}n$ Boolean matrices. Its computation requires multiplication of three Boolean matrices for each of all possible triples of $n{\times}n$ Boolean matrices. The size of the semigroup of all $n{\times}n$ Boolean matrices grows exponentially as n increases. It is easy to see that it involves exponential time complexity. The computation of J relations over the $5{\times}5$ Boolean matrix is left an unsolved problem. The paper shows theorems that can reduce the computation time, discusses an algorithm for efficient J relation computation whose design reflects those theorems and gives its execution results.