• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.446-449
• /
• 2002

This paper represents a improved data compression algorithm of mixed text file by 2 byte completion Hangout and 1 byte alphabet from. Original LZW algorithm efficiently compress a alphabet text file but inefficiently compress a 2 byte completion Hangout text file. To solve this problem, data compression algorithm using 2 byte prefix field and 2 byte suffix field for compression table have developed. But it have a another problem that is compression ratio of alphabet text file decreased. In this paper, we proposes improved LZW algorithm, that is, compression table in the Extended LZW(ELZW) algorithm uses 2 byte prefix field for pointer of a table and 1 byte suffix field for repeat counter. where, a prefix field uses a pointer(index) of compression table and a suffix field uses a counter of overlapping or recursion text data in compression table. To increase compression ratio, after construction of compression table, table data are properly packed as different bit string in accordance with a alphabet, Hangout, and pointer respectively. Therefore, proposed ELZW algorithm is superior to 1 byte LZW algorithm as 7.0125 percent and superior to 2 byte LZW algorithm as 11.725 percent. This paper represents a improved data Compression algorithm of mixed text file by 2 byte completion Hangout and 1 byte alphabet form. This document is an example of what your camera-ready manuscript to ITC-CSCC 2002 should look like. Authors are asked to conform to the directions reported in this document.

• Journal of the Korea Computer Graphics Society
• /
• v.6 no.1
• /
• pp.29-36
• /
• 2000

In this work, we propose ZF-buffer algorithm in order to accelerate the intersection test of ray-tracing algorithm. ZF-buffer is used in the preprocessing of ray-tracing and records the pointer that points to a parent face of a depth value(z value) of an object determined in Z-buffer. As a result, the face which intersects with the first ray can be determined easily by using the pointer stored in F-buffer. Though ZF-buffer and vista-buffer resemble each other, the difference between the two methods is that what ZF-buffer records is not bounding volume but the pointer of a displayable face. We applied the ZF-buffer algorithm for the first ray to Utah teapot which consists of 9216 polygons. By comparing the elapse time of our method with vista-buffer algorithm, we can acquire improvement in speed that it is 3 times faster than vista-buffer algorithm. We expanded our algorithm to the second ray.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.6
• /
• pp.69-76
• /
• 2007

The main stream of presentation is interrupted because of the direct manipulation of their PC frequently so as to control the screen and file open and so on. A variety of products have been developed to solve these inconveniences of the conventional laser beam pointer [LBP] by simply adding a mouse function to the previous LBP. However. the LBPs fully supporting a mouse function are not yet appeared. In this paper. we developed the LBP fully fulfilling a mouse function using mono-camera as well as a robust image processing and analyzed the position detection accuracy. Finally we verified the developed LBP does not only fulfill a mouse function but also solve the defects of the current laser pointer such as inconvenient installation and Position detection errors due to the illumination and viewing direction changes.

• Journal of Korean Institute of Industrial Engineers
• /
• v.35 no.2
• /
• pp.141-149
• /
• 2009

As the number of personal computers installed in vehicles increases, a touchpad often used in a labtop computer can be used for the control of an in-vehicle information system (IVIS). Using a touchpad to control the system allows the user to select among large amount of information with a single touch of dragging. For safety and convenience of a driver, the touchpad could be placed on a steering wheel. This research is designed to calculate the most efficient Control-Response Ratio (C/R ratio) for the menu interaction of a touchpad on a steering wheel. Since the menu pointer's rate of movement and proper C/R ratio is determined by the amount of selected information, the amount of displayed information and the movement of a menu pointer was chosen to be independent variables. The dependent variables are a user's preference and task completion time. Two factor full factorial within subject design was used 16 subjects. The investigation revealed that the amount of selected information increased with increasing C/R ratio. The movement of the pointer became slower as the amount of information increased. The best C/R ratio was calculated for each amount of information and preference regression of the user's preference was drawn accordingly. Through this research, the automobile interior designer can benefit from the guidelines suggested for the touchpad control.

• Journal of Veterinary Clinics
• /
• v.29 no.1
• /
• pp.78-81
• /
• 2012

A 5-year-old male Pointer dog weighing 24 kg was referred because of a chronic cough. The dog was routinely vaccinated and treated monthly with medications to prevent heartworm and endoparasites. Blood analyses revealed no abnormalities. Chest radiographs showed interstitial and bronchial patterns in the caudal lung fields. Bronchoscopic imaging identified a collapse of the left bronchus with a mucopurulent discharge, indicating the onset of bronchomalacia. Computed tomography also showed bronchial collapse and a tapering angle in the left caudal bronchus. This case study describes the diagnosis of bronchomalacia in a Pointer dog with a chronic cough, and suggests that bronchoscopic examination is a valuable tool for identifying of the onset of bronchomalacia in dogs presenting with an uncontrolled cough.

• The Journal of the Korea Contents Association
• /
• v.10 no.12
• /
• pp.70-76
• /
• 2010

This paper Extended ELZW(EBCDIC Lempel Ziv Welch) algorithm uses 2 byte prefix field for pointer of a table and 1 byte suffix field for repeat counter. where, a prefix field uses a pointer(index) of compression table and a suffix field uses a counter of overlapping or recursion text data in compression table. To increase compression ratio, after construction of compression table, table data are properly packed as different bit string in accordance with a alphabet, Hangeul, and pointer respectively. Therefore, proposed ELZW algorithm is superior to 1byte LZW algorithm as 5.22 percent and superior to 2byte LZW algorithm as 8.96 percent.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.12
• /
• pp.111-120
• /
• 2012

As the P2P System is a distributed system that shares resources of nodes that participate in the system, all the nodes serve as a role of server and client. Currently, although systematic, structured P2P systems such as Chord, Pastry, and Tapestry were suggested based on the distributed hash table, these systems are limited to $log_2N$ for performance efficiency. For this enhanced performance efficiency limited, the article herein suggests group routing algorithm. The suggested algorithm is a node-to-group routing algorithm which divides circular address space into groups and uses a concept of pointer representing each group, which is an algorithm where routing is performed based on pointer. To evaluate algorithm performance, a comparative analysis was conducted on average hops, routing table size, and delayed transmission for chord and routing, a signature algorithm in P2P systems. Therefore, enhanced performance is verified for comparative items from the simulation results.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.29 no.2
• /
• pp.365-375
• /
• 2019

A PLC (Programmable Logic Controller) is a highly-reliable industrial digital computer which supports real-time embedded control applications for safety-critical control systems. Real-time operating systems such as uC/OS have been used for PLCs and must meet real-time constraints. As PLCs have been widely used for industrial control systems and connected to the Internet, they have been becoming a main target of cyberattacks. In this paper, we propose an execution code sanitizer to enhance the security of PLC systems. The proposed sanitizer analyzes PLC programs developed by an IDE before downloading the program to a target PLC, and mitigates security vulnerabilities of the program. Our sanitizer can detect vulnerable function calls and illegal memory accesses in development of PLC programs using a database of vulnerable functions as well as the other database of code patterns related to pointer misuses. Based on these DBs, it detects and removes abnormal use patterns of pointer variables and existence of vulnerable functions shown in the call graph of the target executable code. We have implemented the proposed technique and verified its effectiveness through experiments.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.4B
• /
• pp.323-338
• /
• 2003

The main memory database systems (MMDBMS) efficiently supports various database applications that require high performance since it employs main memory rather than disk as a primary storage. Recently, it has been increased needs that have the fast data processing as well as the efficient modeling of application requiring for a complicated structure, and conformity to applications that need the strict dta consistency. In MMDBMS, because all the data is located in the main memory, it can support the usable expression methods of data satisfying their needs without performance overhead. The method has the operation to manipulate the data and the constraint such as referential integrity in more detail. The data model consists of this methods is an essential component to decide the expression power of DBMS. In this paper, we discuss about various requests to provide the communication services and propose the data model that support it. The mainly discussed issues are 1) definition of the relationship between tables using the pointer, 2) navigation of the data using the relationship, 3) support of the referential integrity for pointer, 4) support of the uniform processing time for the join, 5) support of the object-oriented concepts, and 6) sharing of an index on multi-tables. We discuss the pointer-based data model that designed to include these issues to efficiently support complication environments.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.1116-1120
• /
• 2004

In the nuclear power plant, there are several cylindrical vessels such as reactor vessel, pressuriser and so on. The vessels are usually constructed by welding large rolled plates, forged sections or nozzle pipes together. In order to assure the integrity of the vessel, these welds should be periodically inspected using sensors such as ultrasonic transducer or visual cameras. This inspection is usually conducted under water to minimize exposure to the radioactively contaminated vessel walls. The inspections have been performed by using a conventional inspection machine with a big structural sturdy column, however, it is so huge and heavy that maintenance and handling of the machine are extremely difficult. It requires much effort to transport the system to the site and also requires continuous use of the utility's polar crane to move the manipulator into the building and then onto the vessel. Setup beside the vessel requires a large volume of work preparation area and several shifts to complete. In order to resolve these problems, we have developed an underwater mobile robot guided by the laser pointer, and performed a series of experiments both in the mockup and in the real reactor vessel. This paper introduces our robotic inspection system and the laser guidance of the mobile robot as well as the results of the functional test.