• The KIPS Transactions:PartA
• /
• v.9A no.1
• /
• pp.37-44
• /
• 2002

Most researches of transforming sequential programs into parallel programs have been based on the loop structure transformation method. However, most programs have implicit interprocedure parallelism. This paper suggests a way of extracting parallelism from the loops with procedure calls using the data dependency elimination method. Most parallelization of the loop with procedure calls have been conducted for extracting parallelism from the uniform code. In this paper, we propose interprocedural transformation, which can be apply to both uniform and nonuniform code. We show the examples of uniform, nonuniform, and complex code parallelization. We then evaluated the performance of the various transformation methods using the CRAY-T3E system. The comparison results show that the proposed algorithm out-performs other conventional methods.

• Journal of Internet Computing and Services
• /
• v.19 no.3
• /
• pp.15-23
• /
• 2018

A code reuse attack is an attack technique that can execute arbitrary code without injecting code directly into the stack by combining executable code fragments existing in program memory and executing them continuously. ROP(Return-Oriented Programming) attack is typical type of code reuse attack and serveral defense techniques have been proposed to deal with this. However, since existing methods use Rule-based method to detect attacks based on specific rules, there is a limitation that ROP attacks that do not correspond to previously defined rules can not be detected. In this paper, we introduce a method to detect ROP attack by learning command pattern used in ROP attack code using RNN(Recurrent Neural Network). We also show that the proposed method effectively detects ROP attacks by measuring False Positive Ratio, False Negative Ratio, and Accuracy for normal code and ROP attack code discrimination.

• Clinical and Experimental Pediatrics
• /
• v.64 no.2
• /
• pp.80-85
• /
• 2021

Background: Although identifying cases in large administrative databases may aid future research studies, previous reports demonstrated that the use of the International Classification of Diseases, Tenth Revision (ICD-10) code alone for diagnosis leads to disease misclassification. Purpose: We aimed to assess the value of the ICD-10 diagnostic code for identifying potential children with biliary atresia. Methods: Patients aged <18 years assigned the ICD-10 code of biliary atresia (Q44.2) between January 1996 and December 2016 at a quaternary care teaching hospital were identified. We also reviewed patients with other diagnoses of code-defined cirrhosis to identify more potential cases of biliary atresia. A proposed diagnostic algorithm was used to define ICD-10 code accuracy, sensitivity, and specificity. Results: We reviewed the medical records of 155 patients with ICD-10 code Q44.2 and 69 patients with other codes for biliary cirrhosis (K74.4, K74.5, K74.6). The accuracy for identifying definite/probable/possible biliary atresia cases was 80%, while the sensitivity was 88% (95% confidence interval [CI], 82%-93%). Three independent predictors were associated with algorithm-defined definite/probable/possible cases of biliary atresia: ICD-10 code Q44.2 (odds ratio [OR], 2.90; 95% CI, 1.09-7.71), history of pale stool (OR, 2.78; 95% CI, 1.18-6.60), and a presumed diagnosis of biliary atresia prior to referral to our hospital (OR, 17.49; 95% CI, 7.01-43.64). A significant interaction was noted between ICD-10 code Q44.2 and a history of pale stool (P<0.05). The area under the curve was 0.87 (95% CI, 0.84-0.89). Conclusion: ICD-10 code Q44.2 has an acceptable value for diagnosing biliary atresia. Incorporating clinical data improves the case identification. The use of this proposed diagnostic algorithm to examine data from administrative databases may facilitate appropriate health care allocation and aid future research investigations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.9
• /
• pp.4560-4575
• /
• 2018

Since smartphone contains various personal data, security is one of the important aspects in smartphone technologies. Up to now, various authentication techniques have been proposed to protect smartphones. The pattern lock on the Android system is one of the most widely used authentication methods for low-cost devices but it is known to be vulnerable to smudge attack or shoulder surfing attack. LG's smartphone uses its own technique, which is called "Knock Code." The knock code completes the authentication by touching the user defined area in turn on the screen. In this paper, we propose the new, enhanced version of knock code by adding the sliding operation and by using flexible area recognition. We conducted security analysis, which shows that under the same password size, the search space is overwhelmingly larger than the original algorithm. Also, by using the sliding operation, the proposed scheme shows resilience against smudge attacks. We implemented the prototype of our scheme. Experimental results show that compared with the original Knock Code and Android pattern lock, our scheme is more convenient while providing better security.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.2
• /
• pp.471-485
• /
• 2023

As data sharing increases explosively, such information encoded in QR code is completely public as private messages are not securely protected. This paper proposes a new 'PROMISE' framework for hiding information based on the QR code projection matrix by using image segmentation without modifying the essential QR code characteristics. Projection matrix mapping, matrix scrambling, fusion image segmentation and steganography with SEL(secret embedding logic) are part of the PROMISE framework. The QR code could be mapped to determine the segmentation site of the fusion image as a binary information matrix. To further protect the site information, matrix scrambling could be adopted after the mapping phase. Image segmentation is then performed on the fusion image and the SEL module is applied to embed the secret message into the fusion image. Matrix transformation and SEL parameters should be uploaded to the server as the secret key for authorized users to decode the private message. And it was possible to further obtain the private message hidden by the framework we proposed. Experimental findings show that when compared to some traditional information hiding methods, better anti-detection performance, greater secret key space and lower complexity could be obtained in our work.

• Journal of Advanced Marine Engineering and Technology
• /
• v.25 no.2
• /
• pp.375-382
• /
• 2001

In this study, an adapted Turbo Coding Algorithm for reducing communication error of a fire detection system for marine vessels, especially image transmission via power lone. Because it is necessary that this system communicate larger and faster than previous method, this study carried out enhancement a decoding speed by adaptation CRC with Turbo Code Algorithm, improvement of metric method, and reduction of decoding delay by using of Center-to-Top method. And the results are as follows: (1) Confirmed that a Turbo Code is so useful methods for reducing communication error in lots of noise environments. (2)Proposed technology in this study speed increasing method of Turbo Coding Algorithm proves 2 times faster than normal Turbo Code and communication error reducing as well in the board made by VHDL software & chips ALTERA company.

• Proceedings of the Korea Committee for Ocean Resources and Engineering Conference
• /
• 2001.10a
• /
• pp.68-72
• /
• 2001

Two different methods of free span analysis of offshore pipelines by DnV codes were introduced and compared in order to calculate the allowable free span lengths of the offshore pipelines. The allowable span lengths of the offshore pipelines for installation, hydrotest and operation conditions by static and dynamic span analysis were determined. Static analysis was performed by ASME codes and dynamic span analysis was performed by both 1981 DnV code. Comparison of two codes were carried out. A new design procedure to calculate the allowable span lengths was developed with new DnV code.

• Journal of Information Technology Services
• /
• v.10 no.3
• /
• pp.167-177
• /
• 2011

Code obfuscation is a technique that protects the abstract data contained in a program from malicious reverse engineering and various obfuscation methods have been proposed for obfuscating intention. As the abstract data of control flow about programs is important to clearly understand whole program, many control flow obfuscation transformations have been introduced. Generally, inlining is a compiler optimization which improves the performance of programs by reducing the overhead of calling invocation. In code obfuscation, inlining is used to protect the abstract data of control flow. In this paper, we define new control flow complexity metric based on entropy theory and N-Scope metric, and then apply genetic algorithm to obtain optimal inlining results, based on the defined metric.

• Journal of the Korean Society for Nondestructive Testing
• /
• v.8 no.1
• /
• pp.6-11
• /
• 1988

The comparison and analysis of flaw detectability, flaw sizing methods and allowable criteria in accordance with the applicable codes, ASME and RCC-M Code, in ultrasonic examination of pressure vessel in nuclear power plants were studied. Accordding to the codes, calibration blocks were made. The artificial flaws such as disc and band types in test specimens were machined. They were detected and evaluated with etch code requirements and measured values were compared with the actual flaws.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.10 no.1
• /
• pp.101-106
• /
• 2007

In this paper, we propose chain code based decision technique of edge orientation. Edge Information is one of the most important information for handling image signals, and is applied to various civilian and military area, such as image surveillance for military reconnaissance, restoration of noised image signal, fingerprint recognition, and so on. The conventional methods to find edge orientations exploit a certain size of mask which weights for a certain direction, so they showed limitations in the case of diagonal edges except 45 degrees. We find edge orientations using chain code. According to the experiments, the proposed method shows better performance than the conventional approaches. The exact edge orientations including diagonal directions are well found.