• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.1
• /
• pp.77-84
• /
• 2015

Most of the existing methods make the index key with every 6 words in every sentence in a document in order to identify copyright infringement between two documents. However, these methods has the disadvantage to take a long time to inspect the copyright infringement because of the long indexing time for the large-scale document. In this paper, we propose a method to select the longest word (called a feature bock) as an index key in the predetermined-sized window which scans a document character by character. This method can be characterized by removing duplicate blocks in the process of scanning a document, dramatically reducing the number of the index keys. The system with this method can find the copyright infringement positions of two documents very accurately and quickly since relatively small number of blocks are compared.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.9 no.2
• /
• pp.30-41
• /
• 2006

This paper proposes an e-logistics system supporting efficient vehicle moving trajectory management. Recent advances in wireless communications have given rise to a number of location-based services including logistics vehicle tracking, cellular phone user's location finding, and location-based commerce. Logistics systems typically entail tracking vehicles for purposes of the logistics center knowing the whereabouts of the vehicles and/or consignments. Moreover, storing and managing location trajectory of continuously moving vehicles and consignments is necessary for supporting efficient logistics plan and consignment. The proposed system is able to manage spatial objects in GIS as well as logistic information in the mobile environment. And for the efficiently managing and retrieving of transporting trajectory of logistics, we extend previous moving object indexing method, TB-Tree, to use multi-version framework and evaluate data updating performance. It is able to apply the proposed method to develop mobile contents services based on continuously changing location of moving object in the mobile environment.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.38 no.5
• /
• pp.58-64
• /
• 2001

Recently many informations are transmitted ,md stored as video data, and they are on the rapid increase because of popularization of high performance computer and internet. In this paper, to retrieve video data, shots are found through analysis of video stream and the method of detection of key frame is studied. Finally users can retrieve the video efficiently. This Paper suggests a new feature that is robust to object movement in a shot and is not sensitive to change of color in boundary detection of shots, and proposes the characterizing value that reflects the characteristic of kind of video (movie, drama, news, music video etc,). The key frames are pulled out from many frames by using the local minima and maxima of differential of the value. After original frame(not de image) are reconstructed for key frame, indexing process is performed through computing parameters. Key frames that arc similar to user's query image arc retrieved through computing parameters. It is proved that the proposed methods are better than conventional method from experiments. The retrieval accuracy rate is so high in experiments.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.6
• /
• pp.139-144
• /
• 2019

For recent decades, Non-volatile Memory (NVM) technologies have been drawing a high attention both in industry and academia due to its high density and short latency comparable to that of DRAM. However, NVM devices has write endurance problem and thus the current data structures that have been built around DRAM-specific features including unlimited program cycles is inadequate for NVM, reducing the device lifetime significantly. In this paper, we revisit a red-black tree extensively adopted for data indexing across a wide range of applications, and make it to better fit for NVM. Specifically, we observe that the conventional red-black tree wears out the specific location of memory because of its rebalancing operation to ensure fast access time over a whole dataset. However, this rebalancing operation frequently updates the long-lived nodes, which leads to the skewed wear out across the NVM cells. To resolve this problem, we present a new swapping wear-leveling red-black tree that periodically moves data in the worn-out node into the young node. The performance study with real-world traces demonstrates the proposed red-black tree reduces the standard deviation of the write count across nodes by up to 12.5%.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.18 no.6A
• /
• pp.129-137
• /
• 2008

As the use of the internet increases, the distribution of spam mail has also vastly increased. The email's main use was for the exchange of information, however, currently it is being more frequently used for advertisement and malware distribution. This is a serious problem because it consumes a large amount of the limited internet resources. Furthermore, an extensive amount of computer, network and human resources are consumed to prevent it. As a result much research is being done to prevent and filter spam. Currently, research is being done on readable sentences which do not use proper grammar. This type of spam can not be classified by previous vocabulary analysis or document classification methods. This paper proposes a method to filter spam by using the subject of the mail and N-GRAM for indexing and Bayesian, SVM algorithms for classification.

• International Journal of Computer Science & Network Security
• /
• v.21 no.2
• /
• pp.212-220
• /
• 2021

The objectives of this research were to identify the digital competencies required for information science specialists at Saudi universities and to examine whether there existed conspicuous differences in the standpoint of these specialists due to years of work experience with regard to the importance of these competencies. A descriptive analytical method was used to accomplish these objectives while extracting the required digital competency list and ascertaining its importance. The research sample comprised 24 experts in the field of information science from several universities in the Kingdom of Saudi Arabia. The participants in the sample were asked to complete a questionnaire prepared to acquire the pertinent data in the period between January 5, 2021 and January 20, 2021. The results reveal that the digital competencies required for information science specialists at Saudi universities encompass general features such as the ability to use computer, Internet, Web2, Web3, and smartphone applications, digital learning resource development, data processing (big data) and its sharing via the Internet, system analysis, dealing with multiple electronic indexing applications and learning management systems and its features, using electronic bibliographic control tools, artificial intelligence tools, cybersecurity system maintenance, ability to comprehend and use different programming languages, simulation, and augmented reality applications, and knowledge and skills for 3D printing. Furthermore, no statistically significant differences were observed between the mean ranks of scores of specialists with less than 10 years of practical experience and those with practical experience of 10 years or more with regard to conferring importance to digital competencies.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10a
• /
• pp.210-212
• /
• 2000

In this paper, we present a comcurrency control scheme over the index structure in main memory databases using multiversion mechanism, and implement it on T-tree. As a well-known idea for comcurrency control, multiversion allows multiple transactions to reat and write different versions of the same data item, each transaction sees a consistent set of versions for all the data items it accesses[1]. Logical versioning and physical versioning techniques are used to keep versions of data item and versions of index node respectively. The main features of this multiversion indexing approach are (1)update operations and rotations on T-tree can take place concurrently, (2)the number of locking and latching requirement is sharply reduced because read-only transactions do not obtain any locks or latches and update transactions obtain latches only when actually performing the update, (3)it reduces storage overhead for tracking version and reclaims storage in time, and (4)it provides complete isolation of read-only transactions from update transactions, so the read-only transactions can get response information without any block.

• Journal of the Korean Society for information Management
• /
• v.25 no.4
• /
• pp.131-148
• /
• 2008

The purposes of the study are to design a key-frame extraction algorithm for constructing the virtual storyboard surrogates and to evaluate the efficiency of the proposed algorithm. To do this, first, the theoretical framework was built by conducting two tasks. One is to investigate the previous studies on relevance and image recognition and classification. Second is to conduct an experiment in order to identify their frames recognition pattern of 20 participants. As a result, the key-frame extraction algorithm was constructed. Then the efficiency of proposed algorithm(hybrid method) was evaluated by conducting an experiment using 42 participants. In the experiment, the proposed algorithm was compared to the random method where key-frames were extracted simply at an interval of few seconds(or minutes) in terms of accuracy in summarizing or indexing a video. Finally, ways to utilize the proposed algorithm in digital libraries and Internet environment were suggested.

• Journal of the Korean Society for Library and Information Science
• /
• v.31 no.1
• /
• pp.153-184
• /
• 1997

The importance of WWW search services is increasing as Internet information resources explode. An evaluation of current 9 search services was first conducted by comparing descriptively the features concerning indexing, searching, and ranking of search results. Secondly, a couple of search queries were used to evaluate search performance of those services by the measures of retrieval effectiveness. the degree of overlap in searching sites, and the degree of similarity between services. In this experiment, Alta Vista, HotBot and Open Text Index showed better results for the retrieval effectiveness. The level of similarity among the 9 search services was extremely low.

• Journal of Information Management
• /
• v.33 no.2
• /
• pp.19-32
• /
• 2002

With the growth of the digital library and the use of Internet, the amount of online text information has increased rapidly. The need for efficient data management and retrieval techniques has also become greater. An automatic text categorization system assigns text documents to predefined categories. The system allows to reduce the manual labor for text categorization. In order to classify text documents, the good features from the documents should be selected and the documents are indexed with the features. In this paper, each steps of text categorization and several techniques used in each step are introduced.