• Progress in Medical Physics
• /
• 제14권1호
• /
• pp.43-50
• /
• 2003

PACS mostly has been used in large scaled hospital due to expensive initial cost to set up the system. The network of PACS is independent of the others: network. The user's PC has to be connected physically to the network of PACS as well as the image viewer has to be installed. The web based mini-PACS can store, manage and search inexpensively a large quantity of radiologic image acquired in a hospital. The certificated user can search and diagnose the radiologic image using web browser anywhere Internet connected. The implemented Image viewer is a viewer to diagnose the radiologic image. Which support the DICOM standard and was implemented to use JAVA programming technology. The JAVA program language is cross-platform which makes easier upgrade the system than others. The image filter was added to the viewer so as to diagnose the radiologic image in detail. In order to access to the database, the user activates his web browser to specify the URL of the web based PACS. Thus, The invoked PERL script generates an HTML file, which displays a query form with two fields: Patient name and Patient ID. The user fills out the form and submits his request via the PERL script that enters the search into the relational database to determine the patient who is corresponding to the input criteria. The user selects a patient and obtains a display list of the patient's personal study and images.

• Journal of Korea Spatial Information System Society
• /
• 제11권1호
• /
• pp.105-114
• /
• 2009

Recently, location-based services which provides k nearest POIs, e.g., gas stations, restaurants and banks, are essential such applications as telematics, ITS(Intelligent Transport Systems) and kiosk. For this, the Voronoi Diagram k-NN(Nearest Neighbor) search algorithm has been proposed. It retrieves k-NNs by using a file storing pre-computed network distances of POIs in Voronoi diagram. However, this algorithm causes the cost problem when expanding a Voronoi diagram. Therefore, in this paper, we propose an algorithm which generates a matrix of the shortest distance between border points of a Voronoi diagram. The shortest distance is measured each border point to all of the rest border points of a Voronoi Diagram. To retrieve desired k nearest POIs, we also propose a k-NN search algorithm using the matrix of the shortest distance. The proposed algorithms can m inim ize the cost of expanding the Voronoi diagram by accessing the pre-computed matrix of the shortest distances between border points. In addition, we show that the proposed algorithm has better performance in terms of retrieval time, compared with existing works.

• Journal of Korea Multimedia Society
• /
• 제12권11호
• /
• pp.1581-1592
• /
• 2009

Recently, we can hear various kinds of music in everywhere and anytime. If a user wants to find the music which was heard before in a street or cafe, but he does not know the title of the music, it is difficult to find it. That is the limitation of previous retrieval system of music data. To overcome these problems, we research a method of content-based retrieval of music data based on the recorded humming, the part of recorded music and the played musical instrument. In this paper, we investigated previous content-based retrieval methods of papers, systems and patents. Based on that, we research a method of content-based retrieval of music data. That is, in case of using the recorded humming and music for query, we extract the frequency information from the recorded humming/music and the stored music data by using FFT. We use a MIDI file in case of query by the played musical instrument. And by using dynamic programming matching, the error caused by the disparity of length between the input source with the stored music data could be reduced.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• 제23권4호
• /
• pp.757-766
• /
• 2013

The Malicious code that targets Android is growing dramatically as the number of Android users are increasing. Most of the malicious code have an intention of leaking personal information. Recently in Korea, a malicious code 'chest' has appeared and generated monetary damages by using malicious code to leak personal information and try to make small purchases. A variety of techniques to detect personal information leaks have been proposed on Android platform. However, the existing techniques are hard to apply to the user's smart-phone due to the characteristics of Android security model. This paper proposed a technique that detects and blocks file approaches and internet connections that are not allowed access to personal information by using the system call hooking in the kernel and white-list based approach policy. In addition, this paper proved the possibility of a real application on smart-phone through the implementation.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• 제23권4호
• /
• pp.709-720
• /
• 2013

Virtualization obfuscation makes hard to analyze the code by applying virtualization to code section. Protected code by common used virtualization obfuscation technique has become known that it doesn't have restored point and also it is hard to analyze. However, it is abused to protect malware recently. So, It is been hard to analyze and take action for malware. Therefore, this paper's purpose is analyze and take action for protected malware by virtualization obfuscation technique through implement tool which can extract virtualization structure automatically and trace execution process. Hence, basic structure and operation process of virtualization obfuscation technique will be handled and analysis result of protected malware by virtualization obfuscation utilized Equation Reasoning System, one kind of program analysis. Also, we implement automatic analysis tool, extract virtualization structure from protected executable file by virtualization obfuscation technique and deduct program's execution sequence.

• The Journal of the Korea Contents Association
• /
• 제14권11호
• /
• pp.370-377
• /
• 2014

At present trend 3D Printing technology has been using more efficiently than conventional subtractive manufacturing method in various medical fields, in particular this technology superior in saving production time, cost and process than conventional. Especially in orthopedics, an attractive attention has been paid by adopting this technology because of improving operation, operation accuracy, and reducing the patient's pain. Though 3D printing technology has enormous applications still in some hospitals have not been using due to having the problem of technical utilization of hardware, software & chiefly financial availability and etc. In order to solve these problems by reducing the cost and time, we have used CT images in pre-operative planning by directly making the pelvic fracture model with open source DICOM viewer and STL file conversion program, assembly 3D printer of FDM wire additive manufacturing. After having the customized bone model of six patients who underwent unstable pelvic fracture surgery, we have operated our system in orthopedic section of University Hospital through the clinician. Later, we have received better reviews and comments on utilization availability, results, and precision and now our system considered to be useful in surgical planning.

• Journal of Astronomy and Space Sciences
• /
• 제31권3호
• /
• pp.235-240
• /
• 2014

The communications link in a space program is a crucial point for upgrading its performance by handling data between spacecraft bus and payloads, because spacecraft's missions are related to the data handling mechanism using communications ports such as a controlled area network bus (CAN Bus) and a universal asynchronous receiver and transmitter (UART). The NEXTSat-1 has a lot of communications ports for performing science and technology missions. However, the top level system requirements for the NEXTSat-1 are mass and volume limitations. Normally, the communications for units shall be conducted by using point to point link which require more mass and volume to interconnect. Thus, our approach for the novel communications link in the NEXTSat-1 program is to use CAN and serializer and deserializer low voltage differential signal (SerDesLVDS) to meet the system requirements of mass and volume. The CAN Bus and SerDesLVDS were confirmed by using already defined communications link for our missions in the NEXTSat-1 program and the analysis results were reported in this study in view of data flow and size analysis.

• Journal of Korea Multimedia Society
• /
• 제5권6호
• /
• pp.625-637
• /
• 2002

The Internet had been taken properties which were both a slow speed and low-bandwidth of the first time. It was impossible to transmit large multimedia data because of a Internet properties. After tens of Year Passed, many people began to transmit multimedia data in the Internet which had fast-speed and high-bandwidth. Some people want to team classes to be taught in school through the Internet. And, educators wish to use multimedia data in the educational field. Due to previous reasons, many parts in the educational field had tried to join real-time objects to multimedia objects. But, real-time data didn’t appear easily due to many faults like network errors and system bugs if we want to control data in order to teach and learn classes. Then, this paper separates real-time and unreal-time data and controls these data that aye made a time scheduler to have time information in the extended SMIL-file for deceasing these faults.

• Journal of KIISE:Computer Systems and Theory
• /
• 제37권1호
• /
• pp.8-18
• /
• 2010

Traditional storage server suffers from duplicated data blocks which cause an waste of storage space and network bandwidth. To address this problem, various de-duplication mechanisms are proposed. Especially, lots of works are limited to backup server that exploits Contents-Defined Chunking (CDC). In backup server, duplicated blocks can be easily traced by using Anchor, therefore CDC scheme is widely used for backup server. In this paper, we propose a new de-duplication mechanism for improving a storage system. We focus on efficient algorithm for supporting general purpose de-duplication server including backup server, P2P server, and FTP server. The key idea is to adapt stride scheme on traditional fixed block duplication checking mechanism. Experimental result shows that the proposed mechanism can minimize computation time for detecting duplicated region of blocks and efficiently manage storage systems.

• Journal of KIISE:Computing Practices and Letters
• /
• 제14권6호
• /
• pp.589-593
• /
• 2008

These days, as a side effect of the growth of the mobile devices, malwares for the mobile devices also tend to increase and become more dangerous. Because embedded Linux is one of the advanced OSes on mobile devices, a solution to preventing malwares from infecting and destroying embedded Linux will be needed. We present a scheme using signature verification for embedded Linux that prevents executallle-Infecting malwares. The proposed scheme works under collaboration between mobile devices and a server. Malware detection is delegated to the server. In a mobile device, only integrity of all executables and dynamic libraries is checked at kernel level every time by kernel modules using LSM hooks just prior to loading of executables and dynamic libraries. All procedures in the mobile devices are performed only at kernel level. In experiments with a mobile embedded device, we confirmed that the scheme is able to prevent all executable-Infecting malwares while minimizing damage caused by execution of malwares or infected files, power consumption and performance overheads caused by malware check routines.