• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.13 no.1
• /
• pp.19-26
• /
• 2003

Recently, the number of internet service companies is increasing and so is the number of malicious attackers. Damage such as distrust about credit and instability of the service by these attacks may influence us fatally as it makes companies image failing down. One of the frequent and fatal attacks is DoS(Denial-of-Service). Because the attacker performs IP spoofing for hiding his location in DoS attack it is hard to get an exact location of the attacker from source IP address only. and even if the system recovers from the attack successfully, if attack origin has not been identified, we have to consider the possibility that there may be another attack again in near future by the same attacker. This study suggests to find the attack origin through MAC address marking of the attack origin. It is based on an IP trace algorithm, called Marking Algorithm. It modifies the Martins Algorithm so that we can convey the MAC address of the intervening routers, and as a result it can trace the exact IP address of the original attacker. To improve the detection time, our algorithm also contains a technique to improve the packet arrival rate. By adjusting marking probability according to the distance from the packet origin we were able to decrease the number of needed packets to traceback the IP address.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.9
• /
• pp.1266-1271
• /
• 2022

Cats have strong wildness so they have a characteristic of hiding diseases well. The disease may have already worsened when the guardian finds out that the cat has a disease. It will be of great help in treating the cat's disease if the owner can recognize the cat's polydipsia, polyuria, and frequent urination more quickly. In this paper, 1) Efficient version of DeepLabCut for pose estimation, 2) YOLO v4 for object detection, 3) LSTM is used for behavior prediction, and 4) BoT-SORT is used for object tracking running on an artificial intelligence device. Using artificial intelligence technology, it predicts the cat's next, polyuria and frequency of urination through the analysis of the cat's behavior pattern from the home CCTV video and the weight sensor of the water bowl. And, through analysis of cat behavior patterns, we propose an application that reports disease prediction and abnormal behavior to the guardian and delivers it to the guardian's mobile and the server system.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.05a
• /
• pp.165-167
• /
• 2022

The proportion of cat cats among companion animals has been increasing at an average annual rate of 25.4% since 2012. Cats have strong wildness compared to dogs, so they have a characteristic of hiding diseases well. Therefore, when the guardian finds out that the cat has a disease, the disease may have already worsened. Symptoms such as anorexia (eating avoidance), vomiting, diarrhea, polydipsia, and polyuria in cats are some of the symptoms that appear in cat diseases such as diabetes, hyperthyroidism, renal failure, and panleukopenia. It will be of great help in treating the cat's disease if the owner can recognize the cat's polydipsia (drinking a lot of water), polyuria (a large amount of urine), and frequent urination (urinating frequently) more quickly. In this paper, 1) Efficient version of DeepLabCut for posture prediction running on an artificial intelligence server, 2) yolov4 for object detection, and 3) LSTM are used for behavior prediction. Using artificial intelligence technology, it predicts the cat's next, polyuria and frequency of urination through the analysis of the cat's behavior pattern from the home CCTV video and the weight sensor of the water bowl. And, through analysis of cat behavior patterns, we propose an application that reports disease prediction and abnormal behavior to the guardian and delivers it to the guardian's mobile and the main server system.

• Journal of KIISE
• /
• v.43 no.12
• /
• pp.1437-1457
• /
• 2016

In outsourced databases, the cloud provides an authorized user with querying services on the outsourced database. However, sensitive data, such as financial or medical records, should be encrypted before being outsourced to the cloud. Meanwhile, k-Nearest Neighbor (kNN) query is the typical query type which is widely used in many fields and the result of the kNN query is closely related to the interest and preference of the user. Therefore, studies on secure kNN query processing algorithms that preserve both the data privacy and the query privacy have been proposed. However, existing algorithms either suffer from high computation cost or leak data access patterns because retrieved index nodes and query results are disclosed. To solve these problems, in this paper we propose a new kNN query processing algorithm on the encrypted database. Our algorithm preserves both data privacy and query privacy. It also hides data access patterns while supporting efficient query processing. To achieve this, we devise an encrypted index search scheme which can perform data filtering without revealing data access patterns. Through the performance analysis, we verify that our proposed algorithm shows better performance than the existing algorithms in terms of query processing times.

• Journal of Korea Multimedia Society
• /
• v.16 no.5
• /
• pp.577-590
• /
• 2013

Shamir's (k,n)-threshold secret sharing scheme is not secure against cheating by attacker because the signature of participants is omitted. To prevent cheating, many schemes have been proposed, and a proactive secret sharing is one of those. The proactive secret sharing is a method to update shares in the secret sharing scheme at irregular intervals. In this paper, a proactive image secret sharing scheme over $GF(2^8)$ is proposed for the first time. For the past 30 years, Galois field operation is widely used in order to perform the efficient and secure bit operation in cryptography, and the proposed scheme with update phase of shadow image over $GF(2^8)$) at irregular intervals provides the lossless and non-compromising of secret image. To evaluate security and efficiency of images (i.e. cover and shadow images) distortion between the proposed scheme and the previous schemes, embedding capacity and PSNR are compared in experiments. The experimental results show that the performances of the embedding capacity and image distortion ratio of the proposed scheme are superior to the previous schemes.

• KIPS Transactions on Computer and Communication Systems
• /
• v.6 no.5
• /
• pp.219-230
• /
• 2017

General-Purpose Graphics Processing Units (GPGPUs) build massively parallel architecture and apply multithreading technology to explore parallelism. By using programming models like CUDA, and OpenCL, GPGPUs are becoming the best in exploiting plentiful thread-level parallelism caused by parallel applications. Unfortunately, modern GPGPU cannot efficiently utilize its available hardware resources for numerous general-purpose applications. One of the primary reasons is the inefficiency of existing warp/thread block schedulers in hiding long latency instructions, resulting in lost opportunity to improve the performance. This paper studies the effects of hardware thread scheduling policy on GPGPU performance. We propose a novel warp scheduling policy that can alleviate the drawbacks of the traditional round-robin policy. The proposed warp scheduler first classifies the warps of a thread block into two groups, warps with long latency and warps with short latency and then schedules the warps with long latency before the warps with short latency. Furthermore, to support the proposed warp scheduler, we also propose a supplemental technique that can dynamically reduce the number of streaming multiprocessors to which will be assigned thread blocks when encountering a high contention degree at the memory and interconnection network. Based on our experiments on a 15-streaming multiprocessor GPGPU platform, the proposed warp scheduling policy provides an average IPC improvement of 7.5% over the baseline round-robin warp scheduling policy. This paper also shows that the GPGPU performance can be improved by approximately 8.9% on average when the two proposed techniques are combined.

• The Journal of Korean Institute of Next Generation Computing
• /
• v.13 no.3
• /
• pp.72-83
• /
• 2017

GPUs can provide high throughput with latency hiding by executing many warps in parallel. MSHR(Miss Status Holding Registers) for L1 data cache tracks cache miss requests until required data is serviced from lower level memory. In recent GPUs, excessive requests for cache resources cause underutilization problem of GPU resources due to cache resource reservation fails. In this paper, we propose a new warp scheduling technique to reduce stall cycles under MSHR resource shortage. Cache miss rates for each warp is predicted based on the observation that each warp shows similar cache miss rates for long period. The warps showing low miss rates or computation-intensive warps are given high priority to be issued when MSHR is full status. Our proposal improves GPU performance by utilizing cache resource more efficiently based on cache miss rate prediction and monitoring the MSHR entries. According to our experimental results, reservation fail cycles can be reduced by 25.7% and IPC is increased by 6.2% with the proposed scheduling technique compared to loose round robin scheduler.

• Journal of the Korean Society of School Health
• /
• v.9 no.1
• /
• pp.77-98
• /
• 1996

This studies designed to work out a theoretical framework on the experience of sexual abuse from the perspective of grounded theory in an effort to provide more practical and efficient nursing intervention for female victims. The subcategories identified were "sexual abuse", "threatening", "absent mindness", "embarrassment", "horripilation", "dizziness", "wondrousness", "filthiness", "sexual curiosity", "violence level", "victim's age", "neighbors response", "victims personality", "common experience", "sexual abuse information", "family relations", "level of familiarity", "hiding", "suppression", "self-torture", "self-protection", "avoidance", "asking aid", "withdrawal", "hatred", "confusion", "dodging, "remmant", and "pursuing". The 29 subcategories given above were further integrated into 16 categories such as "victimizedness", "being astounded", "filthiness", "degree", "developmental stage", "response pattern", "personality", "rarity", "information availability", "family support", "cover-up", "escaping", "informing", "negative internalization", and "positive pursuit of change". The core categories linked to all the other categories turned out to be "being taken aback" and "filthiness" incorporating the relevant subcategories. A total of 23 theoretical hypothesis emerged in the process of analyzing data. 1. the grater sexual curiosity, the weaker the senses of being taken aback and filthiness. 2. The weaker sexual curiosity, the stronger the senses of being taken aback and filthiness. 3. The stronger the level of violence, The more violent the senses of being taken aback and filthiness. 4. The lower the level of violence, the weaker the senses of being taken aback and filthiness. 5. The younger the victims, the stronger the senses of being taken aback and filthiness. 6. The older the victims, The weaker the senses of being taken aback and filthiness. 7. 'Escaping' will transpire regardless of the given circumstances. 8. The weaker the senses of being taken aback and filthiness, the more probable 'informing' and 'escaping' transpire. 9. The stronger the senses of being taken aback and filthiness, the more probable 'informing' and 'escaping' transpire. 10. The more protective the response from 'informing' and 'escaping' transpire around, the more likely the response to being taken aback' and 'filthiness' will be 'informing' and 'escaping'. 11. The more repelling the response from around, the more likely the response to 'being taken aback' and 'filthiness' will be 'covering-up' and 'escaping'. 12. The more open minded the personality of the subject, the more likely the response to 'being taken aback' and 'filthiness' will be 'informing' and 'escaping'. 13. The more closed the personality of tile subject, the more likely the response to 'being taken aback' and 'filthiness' will be 'covering-up' and 'escaping'. 14. The more frequent the experience of sexual abuse, the more likely the response to 'being taken aback' and 'filthiness' will be 'informing' and 'escaping'. 15. The less frequent the experience of sexual abuse, the more lilely the response to 'being taken aback' and 'filthiness' will be 'covering-up' and 'escaping'. 16. The more available information concerning sexual abuses, the more likely response to 'being taken aback' and 'filthiness' will be 'informing' and 'escaping. 17. The less available information concerning sexual abuses, the more likely the response to 'being taken aback' and 'filthiness' will be 'covering-up' and 'escaping'. 18. The more cohesive the family of the subject, the more likely the response to 'being taken aback' and 'filthiness' will be 'informing' and 'escaping'. 19. The less cohesive the family of the subject, the more likely the response to 'being taken aback' and 'filthiness' will be 'covering-up' and 'escaping'. 20. The less familiar the subject is with the abuser, the more likely the response to 'being taken aback' and 'filthiness' will be 'informing' and 'escaping'. 21. The less familiar the subject is with the abuser, the more likely the response to 'being taken aback' and 'filthiness' will be 'covering-up' and 'escaping. 22. The more likely the response to 'being taken aback' and 'filthiness' is 'informing and 'escaping', the more positive changes the subject will pursue. 23. The more likely the response to 'being taken aback' and 'filthiness' is 'covering-up' and 'escaping', the more negative changes the subject will pursue. The following four hypotheses were conformed in the process of data analysis. 1) In case the level of violence is strong but 'being taken aback' and 'filthiness' in weak because of strong sexual curiosity and also if information concerning sexual abuse is not readily available and the frequency is low, negative internationalization marked by 'covering-up' and 'escaping' will take place despite the fact the subject is open-minded, the family is cohesive and the abuser is unfamiliar. 2) In case the level of violence is weak but 'being taken aback' and 'filthiness' is weak combined with weak sexual curiosity and also if information concerning sexual abuse is readily available and the response from around is protective and the frequency is high, the subject will pursue positive changes to 'being taken aback' and 'filthiness', further aided by the fact that the subject is open-minded, the family is cohesive and the abuser is unfamiliar. 3) In case the level of violence is strong and 'being taken abuse' and 'filthiness' is strong because of weak sexual curiosity and also if information concerning sexual abuse is reading available and the response from around is readily available and the response from around is protective and the frequency is low, the subject will persue positive changes marked by 'informing' and 'escaping' despite the fact that the family cohesion is weak and the abuser is familiar. 4) In case the level of violence is strong and 'being taken aback' and 'filthiness' is strong because of weak sexual curiosity and also if information concerning sexual abuse is not readily available and the response from around is respelling and the frequency is low negative internalization like 'covering-up' and 'escaping' will take place, further aggravated by the fact that the subject's personality is closed, family cohesion is weak, and subject is familiar. On the basis of the above finding, it is recommended that nursing intervention should focus on promoting the milieu conductive to the victims pursuing positive changes along with the adequate aids from protection facilities as well as from the people around them.

• The Korean Journal of Air & Space Law and Policy
• /
• v.33 no.1
• /
• pp.81-120
• /
• 2018

To promote the aviation safety reporting system that is operated to enhance aviation safety and to utilize related information, it should first be preceded by standards for non-punishment and data protection. It is because the purpose of collection and analysis of aviation safety related data through the aviation safety reporting system is to prevent recurrence of accidents by investigating their causes through collection and analysis of diverse types of information related to aviation safety. Both mandatory and voluntary reporting systems are in operation for aviation safety under the current Aviation Safety Act. It is said that they were introduced to survey causes for accidents and to prevent recurrences. In fact, however, it is hard to expect active implementation of the reporting system for aviation safety unless the reporters are firstly exempted from punishment. Therefore, the system should be improved so that it can satisfy its purpose and the purposes of data collection concerning aviation safety through examination of the purposes of the reporting system. One of the matters that needs to be considered to promote the reporting system should be the scope of aviation safety hindrances presupposed under the current institution. The voluntary aviation safety reporting system differs from the systems of ICAO or the key advanced countries, including the USA and the UK as it limits the target accidents subject to reporting to minor aviation safety hindrances only. That being said, improvements should be made by requiring mandatory reporting of aviation safety hindrances based on their severity while recognizing a greater variety of aviation safety concerns like international standards. Safety actions and sharing of information based on collection and analysis of diverse data related to aviation safety will greatly contribute to enhance aviation safety as the purposes of the reporting system are to explore causes for accidents and to prevent their recurrences. What is most important in this regard is strict data protection and non-punishment principles; compliance with them should be secured. We can hardly expect the successful operation of the system unless the reporter is exempted from punishment and the relevant data is protected as promotion of voluntary reporting is an essential factor for enhancing the safety culture. Otherwise, the current system may induce hiding of relevant facts or data to evade punishment. It is true that the regulation for enhancing safety tends to have limitations or blind spots; nevertheless, it should still be enforced strictly and completely. Technological progresses and mistakes of operators appear in different forms based on individual cases. The consequential damages may amount to a truly severe level. Therefore, we have studied and suggested to the methods of activiation and amendments on the aviation safety reporting system, which is referred for one of the proactive safety management systems. The proposed improvement of the reporting system and introduction of non-punishment for collection of aviation safety data for deploying a preemptive prevention system would serve as the backbone for enhancing aviation safety in Korea.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.12C
• /
• pp.1288-1298
• /
• 2002

To implement elliptic curve cryptosystem in GF(2$\^$m/) at high speed, a fast divider is required. Although bit-parallel architecture is well suited for high speed division operations, elliptic curve cryptosystem requires large m(at least 163) to support a sufficient security. In other words, since the bit-parallel architecture has an area complexity of 0(m$\^$m/), it is not suited for this application. In this paper, we propose a new serial-in serial-out systolic array for computing division operations in GF(2$\^$m/) using the standard basis representation. Based on a modified version of tile binary extended greatest common divisor algorithm, we obtain a new data dependence graph and design an efficient bit-serial systolic divider. The proposed divider has 0(m) time complexity and 0(m) area complexity. If input data come in continuously, the proposed divider can produce division results at a rate of one per m clock cycles, after an initial delay of 5m-2 cycles. Analysis shows that the proposed divider provides a significant reduction in both chip area and computational delay time compared to previously proposed systolic dividers with the same I/O format. Since the proposed divider can perform division operations at high speed with the reduced chip area, it is well suited for division circuit of elliptic curve cryptosystem. Furthermore, since the proposed architecture does not restrict the choice of irreducible polynomial, and has a unidirectional data flow and regularity, it provides a high flexibility and scalability with respect to the field size m.