• Journal of Korean Physical Therapy Science
• /
• v.8 no.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.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.1
• /
• pp.99-102
• /
• 2002

Pinholes on the thermally grown oxide, which is called gate oxide, on silicon substrate under polysilicon layer are found and its mechanism is analyzed in this paper. The oxide under a polysilicon layer is broken during the plasma etching process of other polysilicon layer. Both polysilicon layers are separated with 0.8${\mu}{\textrm}{m}$ thick oxide deposited by CVD (Chemical Vapor Deposition). Since broken oxide points are found scattered around an arc occurrence point, it is assumed that an extremely high electric field generated near the arc occurrence point makes the gate oxide broken. 1'he arc occurrence point has been observed on the alignment key and is the mark of low yield. It is found that any arc occurrence can cause chips to fail by breaking the gate oxide, even if are occurrence points are found on scribeline.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.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.

• Journal of Sensor Science and Technology
• /
• v.30 no.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
• /
• v.23 no.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.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.9
• /
• pp.1235-1244
• /
• 2002

This paper proposes a group key management protocol for a secure of all the multicast user in PIM-SM multicast group communication. With prosed architect, subgroups for multicast secure group management will be divided by RP (Rendezvous-Point) unit and each RP has a subgroup manager. Each subgroup manager gives a secure key to it's own transmitter md the transmitter compress the data with it's own secure key from the subgroup manager. Before the transmitter send the data to receiver, the transmitter prepare to encrypt a user's service by sending a encryption key to the receiver though the secure channel, after choking the user's validity through the secure channel. As the transmitter sending a data after then, the architecture is designed that the receiver will decode the received data with the transmitter's group key. As a result, the transmitting time is shortened because there is no need to data translation by group key on data sending and the data transmition is possible without new key distribution at path change to SPT (Shortest Path Tree) of the router characteristic. Additionally, the whole architecture size is samller than the other multicast secure architecture by using the conventional PIM-SIM routing structure without any additional equipment.

• Journal of applied mathematics & informatics
• /
• v.30 no.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.

• Journal of the Microelectronics and Packaging Society
• /
• v.21 no.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)
• /
• v.15 no.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.

• The KIPS Transactions:PartC
• /
• v.10C no.6
• /
• pp.809-814
• /
• 2003

The multicast transmitting the real-time data to groups may easily have many attacks from abnormal attacks because it has many links as compared to the unicast. The existing group key management architectures for preventing these problems are designed for protocols suitable for a large scale. Thus these architectures applied to a small scale routing protocols may have many overheads with key distribution and a constant core tree. Therefore this paper proposes a groups key management protocol for a secure multicast in PIM-SM multicast group communication. The proposed method divide multicast groups with RO(Rendezvous-Point), and subgroup key managers are established in each RP and can be transmitted groups keys between senders and receivers, so the security cannel is set up for secure data transfer, And this does not have needs of the data translation for group keys and the new key distribution for path change. As a result of this, the data transmission time can be reduced.