• 대한물리치료과학회지
• /
• 제8권2호
• /
• pp.1059-1064
• /
• 2001

This study is aimed at diagnosing transmutation aspect with the respective of hemiplegia patient's static adaptation of posture which is influenced by anti-gravity excercise, center of gravity shifting movement and segmental movement adaption of the legs and arms by key-point control in the process of Bobatli's treatment approach. The patients for the investigation of this study were selected as a total 17 patients who were doing the physical-therapy in Tae-gu Rehabilitation Center, and diagnosed as hemiplegia patients by Rehabilitation Medicine department in Kyung-buk University hospital. And also, there investigated into temporal transition that keep the attitude with one-leg standing on the ground concerning static attitude adaption on the basis of the before of anti-gravity movement and the after of 4-weeks movement. The findings of this study were as follows: With the respective the time to keep standing pose by one-leg at static attitude transmutation, affected side showed meaningful differences as a l.86/sec, 2.62/sec at 4 weeks later considering the before and after of this experiment.(p<0.01), non-affected side at the aspect of attitude keeping time, but there didn't showed meaningful differences statistically.

• 한국정보통신학회논문지
• /
• 제6권1호
• /
• pp.99-102
• /
• 2002

다결정 실리콘층 아래의, 게이트 산화막이라고 불리는 높은 온도에서 형성된 산화막에서 핀홀이 관찰되었으며 그 메카니즘이 분석되었다. 다결정 실리콘층 아래의 산화막은 다른 다결정 실리콘층의 플라즈마 에칭 과정 동안에 파괴되어진다. 두 개의 다결정 실리콘층은 CVD증착에 의해 만들어진 0.8$\mu\textrm{m}$의 두꺼운 산화막에 의해 분리되어 있다. 파괴된 산화막들이 아크가 발생한 부분을 중심으로 흩어져 있으며 아크가 발생한 부분에서 생성된 극도로 강한 전계가 게이트 산화막을 파괴 시켰다고 가정된다. 아크가 발생한 부분은 Alignment key에서 관찰되었고 그리고 이것이 발견된 웨이퍼는 낮은 수율을 보여주었다. 아크가 발생한 부분이 칩의 내부가 아니더라도 게이트 산화막의 파괴에 의해 칩이 정상적으로 동작하지 않았다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권5호
• /
• pp.1951-1972
• /
• 2018

Wi-Fi Access Point (AP) optimization approaches are used in indoor positioning systems for signal coverage enhancement, as well as positioning precision improvement. Although the huge power consumption of the AP optimization forms a serious problem due to the signal coverage requirement for large-scale indoor environment, the conventional approaches treat the problem of power consumption independent from the design of indoor positioning systems. This paper proposes a new Fast Water-filling algorithm Group Power Constraint (FWA-GPC) based Wi-Fi AP optimization approach for indoor positioning in which the power consumed by the AP optimization is significantly considered. This paper has three contributions. First, it is not restricted to conventional concept of one AP for one candidate AP location, but considered spare APs once the active APs break off. Second, it utilizes the concept of water-filling model from adaptive channel power allocation to calculate the number of APs for each candidate AP location by maximizing the location fingerprint discrimination. Third, it uses a fast version, namely Fast Water-filling algorithm, to search for the optimal solution efficiently. The experimental results conducted in two typical indoor Wi-Fi environments prove that the proposed FWA-GPC performs better than the conventional AP optimization approaches.

• 센서학회지
• /
• 제30권5호
• /
• pp.349-356
• /
• 2021

The Korea Research Institute of Standards and Science (KRISS), a National Metrology Institute of Korea, participated in the second-round of the international key comparison CCT-K7.2021 of triple point of water (TPW) cells. For the key comparison, three TPW cells, one of which had been used in the old CCT-K7 comparison, were assigned as the national standard of the TPW. The temperature difference (ΔT) between the average of the new and old national standards and ΔT between the new national standard and the transfer standard were measured. The comparison between the new and old national standards indicated a temperature increase of 69.5 µK after both the standards were corrected for the isotopic composition. The uncertainty of the national standard of the TPW temperature was 28 µK, and the uncertainty of ΔT was 14 µK. Three aspects of improvements in the new comparison compared to the old one were noted: (1) inclusion of two quartz cells in the national standard strengthens its long-term stability; (2) the standard deviation associated with the measurement of ΔT was reduced from 21 µK to 9.6 µK; (3) and the measured immersion profile of the TPW cells was much closer to the theoretically predicted dependence.

• International Journal of Computer Science & Network Security
• /
• 제23권9호
• /
• pp.141-149
• /
• 2023

Repacked mobile apps constitute about 78% of all malware of Android, and it greatly affects the technical ecosystem of Android. Although many methods exist for repacked app detection, most of them suffer from performance issues. In this manuscript, a novel method using the Constant Key Point Selection and Limited Binary Pattern (CKPS: LBP) Feature extraction-based Hashing is proposed for the identification of repacked android applications through the visual similarity, which is a notable feature of repacked applications. The results from the experiment prove that the proposed method can effectively detect the apps that are similar visually even that are even under the double fold content manipulations. From the experimental analysis, it proved that the proposed CKPS: LBP method has a better efficiency of detecting 1354 similar applications from a repository of 95124 applications and also the computational time was 0.91 seconds within which a user could get the decision of whether the app repacked. The overall efficiency of the proposed algorithm is 41% greater than the average of other methods, and the time complexity is found to have been reduced by 31%. The collision probability of the Hashes was 41% better than the average value of the other state of the art methods.

• 한국컴퓨터산업학회논문지
• /
• 제3권9호
• /
• pp.1235-1244
• /
• 2002

본 논문에서는 PIM-SM 멀티캐스트 그룹 통신에서 사용자의 서비스보호를 위한 그룹 키 관리 프로토콜을 제안한다. 멀티캐스트 보안의 관리 기준이 되는 서브그룹을 RP(Rendezvous-Point) 단위로 나누고, 각 RP에는 하나의 서브그룹 관리자를 두며, 각각의 서브그룹 관리자는 송신자들에게 그룹 키를 부여한다. 송신자는 자신의 그룹 키로 데이터를 RP에 전송하고, RP는 수신자를 미리 설정하여 놓은 보호채널을 통하여 확인한 후, 수신자가 원하는 서비스 송신자의 복호화 키를 보호채널을 통하여 미리 전송하여 복호화할 준비를 한다. 이후 데이터를 전송하여 수신자는 전송받은 송신자의 그룹 키를 갖고 수신된 데이터의 복호화 하는 구조를 갖는다. 그 결과, 그룹 키에 의한 데이터 변환 작업이 불필요하여 데이터 전송 시간이 단축되며, SPT로의 경로 변화에도 새로운 키 분배 없이 데이터 전송이 가능하다. 또한 PIM-SM 라우팅 구조를 다른 추가 요소 없이 그대로 사용할 수 있다는 장점을 갖게 된다.

• Journal of applied mathematics & informatics
• /
• 제30권3_4호
• /
• pp.365-380
• /
• 2012

Non-negative matrix factorization (NMF) is a very efficient method to explain the relationship between functions for finding basis information of multivariate nonnegative data. The multiplicative update (MU) algorithm is a popular approach to solve the NMF problem, but it fails to approach a stationary point and has inner iteration and zero divisor. So the elementwisely alternating projected gradient (eAPG) algorithm was proposed to overcome the defects. In this paper, we use the fact that the equilibrium point is stable to prove the convergence of the eAPG algorithm. By using a classic model, the equilibrium point is obtained and the invariant sets are constructed to guarantee the integrity of the stability. Finally, the convergence conditions of the eAPG algorithm are obtained, which can accelerate the convergence. In addition, the conditions, which satisfy that the non-zero equilibrium point exists and is stable, can cause that the algorithm converges to different values. Both of them are confirmed in the experiments. And we give the mathematical proof that the eAPG algorithm can reach the appointed precision at the least iterations compared to the MU algorithm. Thus, we theoretically illustrate the advantages of the eAPG algorithm.

• 마이크로전자및패키징학회지
• /
• 제21권4호
• /
• pp.33-39
• /
• 2014

To establish the reliability of a packaging structures, adhesion testing of key interfaces is a critical task. Due to the material mismatch, the interface may be prone to delamination failure due to conditions during the manufacturing of the product or just from the day-to-day use. To assess the reliability of the interface adhesion strength testing can be performed during the design phase of the product. One test method of interest is the four-point bending (4PB) adhesion strength test method. This test method has been implemented in a variety of situations to evaluate the adhesion strength of interfaces in bimaterial structures to the interfaces within thin film multilayer stacks. This article presents a review of the 4PB adhesion strength testing method and key implementations of the technique in regards to semiconductor packaging.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권7호
• /
• pp.2610-2630
• /
• 2021

The aim of this paper is to propose the alternative algorithm to finish the process in public key cryptography. In general, the proposed method can be selected to finish both of modular exponentiation and point multiplication. Although this method is not the best method in all cases, it may be the most efficient method when the condition responds well to this approach. Assuming that the binary system of the exponent or the multiplier is considered and it is divided into groups, the binary system is in excellent condition when the number of groups is small. Each group is generated from a number of 0 that is adjacent to each other. The main idea behind the proposed method is to convert the exponent or the multiplier as the subtraction between two integers. For these integers, it is impossible that the bit which is equal to 1 will be assigned in the same position. The experiment is split into two sections. The first section is an experiment to examine the modular exponentiation. The results demonstrate that the cost of completing the modular multiplication is decreased if the number of groups is very small. In tables 7 - 9, four modular multiplications are required when there is one group, although number of bits which are equal to 0 in each table is different. The second component is the experiment to examine the point multiplication process in Elliptic Curves Cryptography. The findings demonstrate that if the number of groups is small, the costs to compute point additions are low. In tables 10 - 12, assigning one group is appeared, number of point addition is one when the multiplier of a point is an even number. However, three-point additions are required when the multiplier is an odd number. As a result, the proposed method is an alternative way that should be used when the number of groups is minimal in order to save the costs.

• Journal of Electrical Engineering and Technology
• /
• 제12권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.