• Journal of the Korea Society of Computer and Information
• /
• v.8 no.2
• /
• pp.51-56
• /
• 2003

The structuring of Web information supports a strong user side viewpoint that a user wants his/her own needs on snooping a specific Web site. Not only the depth first algorithm or the breadth-first algorithm, but also the Web information is abstracted to a hierarchical structure. A prototype system is suggested in order to visualize and to represent a semantic significance. As a motivating example, the Web test site is suggested and analyzed with respect to several keywords. As a future research, the Web site model should be extended to the whole WWW and an accurate assessment function needs to be devised by which several suggested models should be evaluated.

• Journal of the Korean Society for Library and Information Science
• /
• v.40 no.1
• /
• pp.263-292
• /
• 2006

The purpose of this study is to analyze the characteristics of OPAC displays of the National Library of Korea and the Library of Congress. based on the 'OPAC Display Guidelines(Draft)' published by IFLA. Discussed are such topics as a basic search process and the headings list, a brief display and the arrangement of bibliographic records, a brief record and a full record, use of terms and labels. link between records, and organization of screens for the OPAC display. It is strongly suggested that when compared with the LC's OPAC, the OPAC display of the National Library of Korea should be much improved by following the recommendations of the 'OPAC Display Guidelines(Draft)'.

• The KIPS Transactions:PartB
• /
• v.15B no.5
• /
• pp.487-492
• /
• 2008

Most Web search engines use ranking methods that take both the relevancy and the importance of documents into consideration. The importance of a document denotes the degree of usefulness of the document to general users. One of the most successful methods for estimating the importance of a document has been Page-Rank algorithm which uses the hyperlink structure of the Web for the estimation. In this paper, we propose a new importance estimation algorithm for the blog environment. The proposed method, first, calculates the importance of each document using user's bookmark and click count. Then, the Guru point of a blogger is computed as the sum of all importance points of documents which he/she wrote. Finally, the guru points are reflected in document ranking again. Our experiments show that the proposed method has higher correlation coefficient than the traditional methods with respect to correct answers.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.10
• /
• pp.2171-2180
• /
• 1997

In this paper, we proposed a MAC protocol called P/S-DCA that using dynamci channel allocation scheme for supports the multimedia traffic in wireless ATM, and analysis theoretically the throughput and delay of up/down link according to varying the down traffic load. To evaluate and the dynamic channel allocation scheme, simulations are executed with varying down traffic load. The results are proved that system capacity is improved better than PRMA and C-PRAM. The system capacity, denoting by $M_{0.01}$, is defined as the maximum number of conversations which can be supported under constraint of packet dropping probability no more than 1%. It is shown that the values of $M_{0.01}$ for ${\lambda}_{d}=0.5,\;{\lambda}_{d}=0.2\;{\lambda}_{d}=0.1\;{\lambda}_{d}=0.001$ are about 43, 69, 77 and 83, respectively. This indicates that P/S-DCA protocol achieves a significant improvement in system capacity relative to PRMA and C-PRMA protocol.

• Proceedings of the KSR Conference
• /
• 2007.11a
• /
• pp.179-186
• /
• 2007

KTX control systems mutually control OBCS, ATC, MBU, TECA, MDT, ABU, HVAC, TRAE, PID and FDTR, KTX OBCS as master, and controls other sub-control devices as slave, using various serial lines. In order to analyze physical structure of various serial link lines and mutual data transmission structure, serial line analyzer is used in many ways. To use serial line analyzer, prior and professional technics about High Speed Train and experience of using device are necessary. In spite of difficult situation of space and environment where we work for maintenance of High Speed Train, in presenting basic structure about physical connection method aquired by sub-device serial line data collection and about communication data analysis, I hope that this research will be helpful for the person who work for similar area. Also, I hope that this research will help diagnostic work of High Speed Train, which is necessary for test run of independently developed High Speed Train.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.2
• /
• pp.132-139
• /
• 1989

We have designed a real-time Cardiac digital substraction angiography system (C-DSA) and tested the system for the diagnosis of Cardiac patients. The system was developed by interfacing a radiographic angiography system to a computerized motional image analysis system. This new cardiac DSA can perform the real time processing of averaging and subtraction of the 32 image frames to measure the volume changes of the left ventricle after elimination of motional artrifacts, caused by the heart contraction of beats per minute in average. Each frame has a resolution of 512 x 512 pixels and 256 gray levels. Two image data with maximal and minimal volume were moved to the interfaced IBM PC computer system by high speed computer link line for computation of the heart's contraction parameters. First, the boundary of the left ventricule was detected using a dynamic programming of the gray levels, and its volume was computered to determine the parameters, such as the maximal volume of end-diastolic volume (EDV), the minimal volume of end systolic volume (ESV), and ejection fraction (EF).

• Journal of the Korean Institute of Navigation
• /
• v.22 no.2
• /
• pp.13-22
• /
• 1998

Shipbome Automatic Identification System (AIS) will be an important manne equipment used for identification, surveillance and communication in the 21st century, which is currently being researched in developed countries. A technical scheme of AlS is proposed in this paper. The main component of the AlS is a broadcast transponder, and the core technology is a VHF radio data link with high capacity, named STDMA (Self-organized Time Division Multiple Access). The ships installed the AlS, which will automatically and periodically broadcast their positions and identities in the marine VHF channels, can be displayed on a screen of an ECDIS on board or in VTS centers. The AlS is able to support not only broadcast service but also point-to-point communication service. This paper presents the configuration, operation principle and functionality of the AlS as well as the scenario of STDMA. In addition, the standardization work of AlS in IMO is introduced in this pauer, too.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.22 no.4
• /
• pp.819-825
• /
• 2012

Nowadays many phishing sites contain HTTP links to victim web-site's contents such as images, bulletin board etc. to make the phishing sites look more real and similar to the victim web-site. We introduce a real-time phishing site detection system which makes use of the characteristic that the phishing sites' URLs flow into the victim web-site via the HTTP referer header field when the phishing site is visited. The detection system is designed to adopt an out-of-path network configuration to minimize effect on the running system, and a phishing site source code analysis technique to alert administrators in real-time when phishing site is detected. The detection system was installed on a company's web-site which had been targeted for phishing. As result, the detection system detected 40 phishing sites in 6 days of test period.

• Journal of Intelligence and Information Systems
• /
• v.18 no.1
• /
• pp.1-21
• /
• 2012

In recent years, mobile phone has experienced an extremely fast evolution. It is equipped with high-quality color displays, high resolution cameras, and real-time accelerated 3D graphics. In addition, some other features are includes GPS sensor and Digital Compass, etc. This evolution advent significantly helps the application developers to use the power of smart-phones, to create a rich environment that offers a wide range of services and exciting possibilities. To date mobile AR in outdoor research there are many popular location-based AR services, such Layar and Wikitude. These systems have big limitation the AR contents hardly overlaid on the real target. Another research is context-based AR services using image recognition and tracking. The AR contents are precisely overlaid on the real target. But the real-time performance is restricted by the retrieval time and hardly implement in large scale area. In our work, we exploit to combine advantages of location-based AR with context-based AR. The system can easily find out surrounding landmarks first and then do the recognition and tracking with them. The proposed system mainly consists of two major parts-landmark browsing module and annotation module. In landmark browsing module, user can view an augmented virtual information (information media), such as text, picture and video on their smart-phone viewfinder, when they pointing out their smart-phone to a certain building or landmark. For this, landmark recognition technique is applied in this work. SURF point-based features are used in the matching process due to their robustness. To ensure the image retrieval and matching processes is fast enough for real time tracking, we exploit the contextual device (GPS and digital compass) information. This is necessary to select the nearest and pointed orientation landmarks from the database. The queried image is only matched with this selected data. Therefore, the speed for matching will be significantly increased. Secondly is the annotation module. Instead of viewing only the augmented information media, user can create virtual annotation based on linked data. Having to know a full knowledge about the landmark, are not necessary required. They can simply look for the appropriate topic by searching it with a keyword in linked data. With this, it helps the system to find out target URI in order to generate correct AR contents. On the other hand, in order to recognize target landmarks, images of selected building or landmark are captured from different angle and distance. This procedure looks like a similar processing of building a connection between the real building and the virtual information existed in the Linked Open Data. In our experiments, search range in the database is reduced by clustering images into groups according to their coordinates. A Grid-base clustering method and user location information are used to restrict the retrieval range. Comparing the existed research using cluster and GPS information the retrieval time is around 70~80ms. Experiment results show our approach the retrieval time reduces to around 18~20ms in average. Therefore the totally processing time is reduced from 490~540ms to 438~480ms. The performance improvement will be more obvious when the database growing. It demonstrates the proposed system is efficient and robust in many cases.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.12
• /
• pp.2243-2251
• /
• 2016

In this paper, we propose a theoretical model for characterization and upper bounds of [1,2]-domination set of network which has tree structure. In detail, we propose a theoretic model for upper bounds on [1,2]-domination set of a tree network which has some typical constrains. To that purpose, we introduce a graph theory to model and analyze the characteristics of tree structure networks. We assume a node subset D of a graph G=(V,E). We define that D is a [1,2]-dominant set if for any node v in set V which is not an element of a set D is adjacent to a node or two nodes of an element in a set D (that is, $1{\leq}{\mid}N({\upsilon}){\bigcap}D{\mid}{\leq}2$ for every node $v{\in}V-D$). The minimum cardinality of a [1,2]-dominating set of G, which is denoted by ${\gamma}_{[1,2]}(G)$, is called the [1,2]-domination number of G. In this paper, we show new upper bounds and characteristics about the [1,2]-domination number of tree.