• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.12
• /
• pp.1919-1927
• /
• 1993

A new MAC protocol has been proposed and analysed to relieve the unfairness problems exhibited by the basic version of the DQDB standard. DQDB MAC protocol has the unfairness problems in throughputs. message delay and so or. And when the slots are reused or the file transmissions takes long, the unfairness problems in the system become worse. The new access protocol proposed here, which of called the Balanced DQDB, guarantees a fair bandwidth distribution by using one bit of the dual bus network protocol and keeps up all characteristics of DQDB. the DQDB analysis model introduced by Wen Jing, et al, was considered to analyse a sequential balance distribution of solts. And the probabilities of the empty in operation mode were represented to determine the probabilities for busy bits to generate on each node of the bus using the Markov chain. Through the simulations. the performances of the proposed Balanced DQDB and that of the standard DQDB of the BWB mechanism were compared at the state that the values of the RQ or CD counter on each node varied dynamically. As the results, it is shown that the Balanced DQDB has the decrement of throughputs in upstream, but the numbers of the used empty slots at each node of the Balanced DQDB had more than that of the others because the Balanced DQDB has over 0.9 throughputs in the 70~80% nodes of total node and it has constant throughputs at each node. And there results were analogous to that of the analytical model.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.11 s.353
• /
• pp.149-158
• /
• 2006

We proposed a method for improving a performance of TCP downstream between a desktop PC as a fixed host and a PDA as a mobile host in a wired and wireless network based on IEEE 802.11x wireless LAN. With data transmission between these heterogeneous terminals a receiving time during downstream is slower than that during upstream by 20% at maximum. The reason is that their congestion window size will be oscillated due to a significantly lower packet processing rate at receiver compared to a packet sending rate at sender. Thus it will cause to increase the number of control packets to negotiate their window size. To mitigate these allergies, we proposed two distinct methods. First, by increasing a buffer size of a PDA at application layer an internal processing speed of a socket receive buffer of TCP becomes faster and then the window size is more stable. However, a file access time in a PDA is kept nearly constant as the buffer size increases. With the buffer size of 32,768bytes the receiving time is faster by 32% than with that of 512bytes. Second, a delay between packets to be transmitted at sender should be given. With an inter-packet delay of 5ms at sender a resulting receiving time is faster by 7% than without such a delay.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.17 no.2
• /
• pp.95-106
• /
• 2014

In this study, the applicability of a standard vector model was evaluated using RIMGIS vector data and a portal based river-geospatial information web service system was developed using XML and JSON based data linkage between the server and the client. The RIMGIS vector data including points, lines, and polygons were converted to the Geospatial Data Model(GDM) developed in this study and were validated by layers. After the conversion, it was identified that the attribute data of a shape file remained without loss. The GeoServer GDB(GeoDataBase) that manages a DB in the portal was developed as a management module. The XML-based Geography Markup Language(GML) standards of OGC was used for accessing to and managing vector layers and encoding spatial data. The separation of data content and expression in the GML allowed the different expressions of the same data, convenient data revision and update, and enhancing the expandability. In the future, it is necessary to improve the access, exchange, and storage of river-geospatial information through the user's customized services and Internet accessibility.

• Journal of Environmental Science International
• /
• v.14 no.12
• /
• pp.1119-1127
• /
• 2005

The management of data on biological diversity is presently complex and confusing. This study was initiated to construct a database so that such data could be stored in a data management, and analysis instrument to correct the problems inherent in the current incoherent storage methods. MySQL was used in DBMS(DataBase Management System), and the program was basically produced using Java technology Also, the program was developed so people could adapt to the requirements that are changing every minute. We hope this was accomplished by modifying easily and quickly the advanced programming technology and patterns. To this end, an effective and flexible database schema was devised to store and analyze diversity databases. Even users with no knowledge of databases should be able to access this management instrument and easily manage the database through the World Wide Web. On a basis of databases stored in this manner, it could become routinely used for various databases using this analysis instrument supplied on the World Wide Web. Supplying the derived results by using a simple table and making results visible using simple charts, researchers could easily adapt these methods to various data analyses. As the diversity data was stored in a database, not in a general file, this study makes the precise, error-free and high -quality storage in a consistent manner. The methods proposed here should also minimize the errors that might appear in each data search, data movement, or data conversion by supplying management instrumentation on the Web. Also, this study was to deduce the various results to the level we required and execute the comparative analysis without the lengthy time necessary to supply the analytical instrument with similar results as provided by various other methods of analysis. The results of this research may be summerized as follows: 1)This study suggests methods of storage by giving consistency to diversity data. 2)This study prepared a suggested foundation for comparative analysis of various data. 3)It may suggest further research, which could lead to more and better standardization of diversity data and to better methods for predicting changes in species diversity.

• Journal of Korean Library and Information Science Society
• /
• v.44 no.2
• /
• pp.217-239
• /
• 2013

This research was conducted to analyze the actual condition of subject heading related to Korean border shown in the subject headings of 7 countries: United States, France, Germany, Spain, Russia, China, and Japan. The results are as follows. To begin with, Korean border-related records in most other national libraries are in extremely poor conditions except for some countries like United States. Amnokgang and Dumangang-related records did not search at all in the France. Yellow Sea, Dumangang, and Baekdusan-related records did not search at all in the Spain. Second, even Dokdo we have effective control, the geographical name 'Korea' is not marked with catalog records except the United States and France. The Germany is displayed with the geographical name of 'Korea' and 'Japan'. Third, the East Sea(Donghae) already is marked with 'Sea of Japan' in most of the national library catalogs, and Yellow Sea(Huanghai) is marked with 'Yellow Sea'. Fourth, Amnokgang and Dumangang is marked with Chinese pronunciation in most in most of the national library. Fifth, Baekdusan is marked with Korean pronunciation in most countries. However the United States showed in 'Baekdu Mountain' and 'Changbai Mountain' discrimination. In the case of the Germany, 'Changbai Mountain' are marked with variant access point of 'Baekdusan'.

• Journal of the Korean BIBLIA Society for library and Information Science
• /
• v.25 no.3
• /
• pp.165-189
• /
• 2014

This study examined the current practices of Research Data Management (RDM) services recently built and implemented at research university libraries in the U.S. by analyzing the components of the services and the contents presented in their web sites. The study then analyzed the content of web pages describing the services provided by 31 Research Universities/Very High research activity determined based on the Carnegie Classification. The analysis was based on 9 components of the services suggested by previous studies, including (1) DMP support; (2) File organization; (3) Data description; (4) Data storage; (5) Data sharing and access; (6) Data preservation; (7) Data citation; (8) Data management training; (9) Intellectual property of data. As a result, the vast majority of the universities offered the service of DMP support. More than half of the universities provided the services for describing and preserving data, as well as data management training. Specifically, RDM services focused on offering the guidance to disciplinary metadata and repositories of relevance, or training via individual consulting services. More research and discussion is necessary to better understand an intra- or inter-institutional collaboration for implementing the services and knowledge and competency of librarians in charge of the services.

• Journal of KIISE:Computing Practices and Letters
• /
• v.5 no.4
• /
• pp.416-425
• /
• 1999

복잡한 무결성 제약 조건을 효율적으로 확인하기 위해 제약 조건들을 룰 베이스(rule base)에 저장하고 별도의 룰 관리 시스템과 제약 조건 관리 시스템을 통해 제약 조건을 확인하는 기법이 많은 연구자들에 의해 연구되고 발표되었다. 그러나 제약 조건 관리 시스템이 실행시간에 응용 프로그램을 항상 모니터링하고 있다가 데이타의 수정이 요청될 때마다 개입하여 프로세스를 중단시키고 관련 제약 조건을 확인하는 기존의 방법들은 처리 시간의 지연을 피할 수 없다. 본 논문은 컴파일 시간에 제약 조건 확인 코드를 응용 프로그램에 미리 삽입할 것을 제안한다. 응용 프로그램 자체 내에 제약 조건 확인 코드가 삽입되기 때문에 실행 시간에 다른 시스템의 제어를 받지 않고 직접 제약 조건의 확인 및 데이타베이스의 접근이 가능해져서 처리 시간의 지연을 피할 수 있을 것이다. 이를 위해 어떤 구문이 제약 조건의 확인을 유발하는 지를 추적하였고, 컴파일러가 그러한 구문을 어떻게 전처리 과정에서 검색하는지 그리고 그러한 구문마다 어떻게 해당 제약 조건 확인 코드를 삽입할 수 있는 지를 객체지향1) 데이타베이스 언어인 Objectivity/C++에 대해 gcc의 YACC 코드를 변경함으로써 보여 주었다.Abstract To cope with the complexity of handling integrity constraints, numerous researchers have suggested to use a rule-based system, where integrity constraints are expressed as rules and stored in a rule base. A rule manager and an integrity constraint manager cooperate to check the integrity constraints efficiently. In this approach, however, the integrity constraint manager has to monitor the activity of an application program constantly to catch any database operation. For each database operation, it has to check relevant rules with the help of the rule manager, resulting in considerable delays in database access. We propose to insert the constraints checking code in the application program directly at compile time. With constraints checking code inserted, the application program can check integrity constraints by itself without the intervention of the integrity constraint manager. We investigate what kind of statements require the checking of constraints, show how the compiler can detect those statements, and show how constraints checking code can be inserted into the program, by modifying the GCC YACC file for Objectivity/C++, an object-oriented database programming language.

• Journal of KIISE:Databases
• /
• v.37 no.3
• /
• pp.146-164
• /
• 2010

Due to an increasing volume of XML data, it is considered prudent to store XML data on an industry-strength database system instead of relying on a domain specific application or a file system. For shredded XML data stored in relational tables, however, it may not be straightforward to apply existing algorithms for twig query processing, since most of the algorithms require XML data to be accessed in a form of streams of elements grouped by their tags and sorted in a particular order. In order to support XML query processing within the common framework of relational database systems, we first propose several bitmap indexes and their strategies for supporting holistic twig joining on XML data stored in relational tables. Since bitmap indexes are well supported in most of the commercial and open-source database systems, the proposed bitmapped indexes and twig query processing strategies can be incorporated into relational query processing framework with more ease. The proposed query processing strategies are efficient in terms of both time and space, because the compressed bitmap indexes stay compressed during data access. In addition, we propose a hybrid index which computes twig query solutions with only bit-vectors, without accessing labeled XML elements stored in the relational tables.

• Journal of the Korean BIBLIA Society for library and Information Science
• /
• v.32 no.1
• /
• pp.443-467
• /
• 2021

The purpose of this study was to conduct interviews with librarians who have experience in establishing local authority data by participating in the national authority sharing system of the National Library of Korea and to understand librarians' recognition and support for the joint utilization of national authority data. For this purpose, a total of 10 librarians who participated in the national authority sharing system project were interviewed by telephone using semi-structured questionnaires. Through this, it was possible to investigate the benefits, difficulties, utilization plans, revision plans of headings, and opinions on necessary support. The results of this study showed that the participants recognized that the joint utilization of national authority data provides the basis for the authority work of the local library and brings about the efficiency of the authority work, but they recognized the difficulty of modifying, selecting, creating new data, lacking knowledge, and lacking support system. The necessary support for the joint utilization of national authority data was provided with education and manuals related to authority, provision of rules related to authority that fully consider the position of the institution, budget and manpower support for system development and maintenance, establishment of communication channel and council, system and data advancement, and incentive to participating libraries. Based on the results of the study, the method and direction for the future operation of the joint utilization of national authority data were presented.

• KIPS Transactions on Computer and Communication Systems
• /
• v.11 no.11
• /
• pp.403-410
• /
• 2022

Non-Fungible Tokens (NFTs) created on the basis of blockchain have their own unique value, so they cannot be forged or exchanged with other tokens or coins. Using these characteristics, NFTs can be issued to digital assets such as images, videos, artworks, game characters, and items to claim ownership of digital assets among many users and objects in cyberspace, as well as proving the original. However, interest in NFTs exploded from the beginning of 2020, causing a lot of load on the blockchain network, and as a result, users are experiencing problems such as delays in computational processing or very large fees in the mining process. Additionally, all actions of users are stored in the blockchain, and digital assets are stored in a blockchain-based distributed file storage system, which may unnecessarily expose the personal information of users who do not want to identify themselves on the Internet. In this paper, we propose an NFT platform using cloud computing, access gate, conversion table, and cloud ID to improve usability and privacy problems that occur in existing system. For performance comparison between local and cloud systems, we measured the gas used for smart contract deployment and NFT-issued transaction. As a result, even though the cloud system used the same experimental environment and parameters, it saved about 3.75% of gas for smart contract deployment and about 4.6% for NFT-generated transaction, confirming that the cloud system can handle computations more efficiently than the local system.