• Journal of Korean Library and Information Science Society
• /
• v.42 no.2
• /
• pp.171-191
• /
• 2011

This study analyzed how the field study has been done in the aspects of the quantity of the research works, research subjects, researchers, the organizations which supported the research expenses and so on by going through the 2,165 research papers of the leading scholarly journals in the field of Library and Information Science published in the recent 10 years. The study shows that the number of the field studies is 691 and it comprises 31.9% of the total research papers. Classifying the field studies by the types of the subject libraries, the ones about the public libraries comprise the largest proportion(35.6%) of the total papers by the number of 246. Classifying the field works by the topics, the studies on the library administration comprise the largest proportion(47.5%) of the total field studies by the number of 328. They are followed by the research on the information services, information systems and digital libraries, and finally the reading education in the listed order. Classifying the field works by the authors, the professors have written the most papers whose number is 329 and which comprise 47.6% of the total research papers. When it comes to supporting the research expenses, 145 studies were supported by the universities. and they comprise the definitely largest proportion(74.4%) of the total 195 articles supported from some organizations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.1C
• /
• pp.1-10
• /
• 2002

With the explosive growth of the number of Internet users and Internet-related services, the research on construction of broadband Optical Internet by using WDM technologies is actively is actively progressed. In this paper, we design the offset time decision (OTD) algorithm for supporting the QoS in optical networks based on optical burst switching (OBS), which is the new switching paradigm, and evaluate the performance of it. The proposed algorithm determines a reasonable offset time considering traffic load of network and the number of wavelengths to guarantee the burst loss rate (BLR) of high priority Internet traffic as a QoS parameter. In order to design the proposed OTD algorithm, firstly we make the new burst loss formula, which includes the effect of offset time. The decision of offset time corresponding to the requested BLR, however, should use the reverse formula of proposed one, thus we are not able to use it without any changes. In this paper, we define the heuristic loss formula (HLF) that can be changed into reversed formula by using the proposed formula and proportional equation considering its characteristics. Finally we show the OTD algorithm to decide the offset time by using HLF. We show that the requested BLR is guaranteed under various traffic load with the determinded offset time by using the proposed OTD algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.4B
• /
• pp.677-686
• /
• 2010

In this paper, we propose the virtual interface management scheme on the multi-mode mobile node for supporting multiple connections to various access networks in fixed mobile convergence (FMC) networks. The proposed scheme supports the virtualization of multiple physical network interfaces by presenting only the virtual interface to beyond IP layers and hiding physical network interfaces from them. In the proposed scheme, only one IP address is allocated to virtual interface without any IP allocations to physical network interfaces. Therefore, the proposed scheme does not change its IP address and keep it during the vertical handover, so that it can support the seamless handover of real-time multimedia services among heterogeneous access networks. The proposed scheme is implemented on the multi-mode mobile node with multiple network interfaces by using NDIS (Network Driver Interface Specifications) libraries. Through the mobility test-bed and the test application of virtual interface, we evaluate and analyze the performance of the proposed scheme.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.6
• /
• pp.237-247
• /
• 2008

A virtual screening is the process of reducing an unmanageable number of compounds to a limited number of compounds for the target of interest by means of computational techniques such as molecular docking. And it is one of a large-scale scientific application that requires large computing power and data storage capability. Previous applications or softwares for molecular docking such as AutoDock, FlexX, Glide, DOCK, LigandFit, ViSION were developed to be run on a supercomputer, a workstation, or a cluster-computer. However the virtual screening using a supercomputer has a problem that a supercomputer is very expensive and the virtual screening using a workstation or a cluster-computer requires a long execution time. Thus we propose a service-based virtual screening system using Grid computing technology which supports a large data intensive operation. We constructed 3-dimensional chemical molecular database for virtual screening. And we designed a resource broker and a data broker for supporting efficient molecular docking service and proposed various services for virtual screening. We implemented service based virtual screening system with DOCK 5.0 and Globus 3.2 toolkit. Our system can reduce a timeline and cost of drug or new material design.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.21 no.3
• /
• pp.522-528
• /
• 2020

The purpose of this study is to improve the reemployment rate of unemployed job seekers aged 50 to 59 by supporting the foundation of our society and enhancing their value of life. We analyzed the impact of resilience, a psychological factor, on job seeking of unemployed people in their fifties. Subjects were visited and provided employment services in the Employment Welfare Plus Center in the Seoul Metropolitan Area. We devised a questionnaire consisting of three variables of general characteristics, resilience, and job search. Also, the resilience variables comprised sub-variables of control, positiveness, and sociality, and the job search variables involved sub-variables of job preparation, attitude, and willness. Study results the resilience of unemployed persons aged 50 to 59 is above average, and sub-variables of positiveness are highest compared to other sub-variables. Second, there is no significant gender difference in resilience for job search activities. Third, resilience and its sub-variables, such as control and affirmation, affect job-seeking activities. Therefore, this study suggests strengthening the resilience of job seekers in their fifties as well as providing psychological counseling and job training for job-seeking activities.

• Journal of Korea Spatial Information System Society
• /
• v.7 no.3 s.15
• /
• pp.119-130
• /
• 2005

A spatial data warehouse is a system that stores geographical information as a subject oriented, integrated, time-variant, non-volatile collection for efficiently supporting decision. This system consists of a builder and a spatial data warehouse server. A spatial data warehouse server suspends user services, stores transferred data in the data repository and constructs index using stored data for short response time. Existing methods that construct index are bulk-insertion and index transfer methods. The Bulk-insertion method has high clustering cost for constructing index and searching cost. The Index transfer method has improper for the index reconstruction method of a spatial data warehouse where periodic source data are inserted. In this paper, the efficient index reconstruction method using a partial index in a spatial data warehouse is proposed. This method is an efficient reconstruction method that transfers a partial index and stores a partial index with expecting physical location. This method clusters a spatial data making it suitable to construct index and change treated clusters to a partial index and transfers pages that store a partial index. A spatial data warehouse server reserves sequent physical space of a disk and stores a partial index in the reserved space. Through inserting a partial index into constructed index in a spatial data warehouse server, searching, splitting, remodifing costs are reduced to the minimum.

• Journal of the Korean Society for Library and Information Science
• /
• v.48 no.1
• /
• pp.27-52
• /
• 2014

The employment prospects of graduates in the Library and Information academic has largely concentrated in the field of librarianship as well as the curriculum of the academic itself. Since there are limitations in increasing the number of libraries and the available posts in the librarianship, the full-time jobs in the field are also limited. Even for the available posts in the field of librarianship, the majority is in contract based posts which does not guarantee a good working environment. The purpose of this research is to make policy implications to improve the employment rates of librarians. The main research methods include literature review of the previous studies and available statistical data, and a questionnaire targeting students and librarians. The targeting policy implications can be categorized into 4 factors, including, as supply side, improvements in the qualification of librarian certificate, in training for librarians, and as demand side, laws on library employment, and improvement of library services for co-operatives. There are 15 detailed strategies to support the 4 factors. For the improvement of strategies in library related laws, the following elements will be considered; supporting system for temporary jobs, the title of librarian post and the library itself, and librarian placement criteria in terms of its realization and mandatory, and obligations in library evaluation. The Council discussions propose the expansion of librarian award system, provision of information systems for librarian jobs, and developments in promotional materials and their deployment for librarians.

• Journal of Internet Computing and Services
• /
• v.2 no.2
• /
• pp.71-93
• /
• 2001

Commonly to design a database system. a conceptual database has to be designed and then it is transformed into a logical database schema prior to building a target database system. This paper proposes a method which transforms a Temporal Entity-Relationship Model(TERM) into a Temporal Object-Oriented Model(TOOM) to build an efficient database schema. I formalize the time concept in view of object versioning and specify the constraints required during transformation procedure. The proposed transformation method contributes to getting the logical temporal data from the conceptual temporal events Without any loss of semantics, Compared to other approaches of supporting various properties, this approach is more general and efficient because it is the semantically seamless transformation method by using the orthogonality of types of objects, semantics of relationships and constraints over roles.

• Journal of Internet Computing and Services
• /
• v.11 no.4
• /
• pp.11-22
• /
• 2010

In case that group communication protocols assume every process is interested in all events occurring in a large scale group, the events multicasting to a subset of a large process group, such as a sensor network, potentially varying for every event based on their interests might lead to very high communication overhead on each individual process. Moreover, despite the importance of both guaranteeing message delivery order and supporting overlapped group using gossip based group communication for multicasting in sensor or P2P networks, there exist little research works on development of gossip-based protocols to satisfy all these requirements. In this paper, we present a new gossip-based causal message order guaranteeing multicast protocol based on local views and delegates representing subgroups and fully utilizing multi-group features to improve scalability. In the proposed protocol, the message delivery order in overlapped groups has been guaranteed consistently by all corresponding members of the groups including delegates. Therefore, these features of the proposed protocol might be significantly scalable rather than those of the protocols guaranteeing atomic order dependencies between multicast messages by hierarchical membership list of dedicated groups like traditional committee protocols and much stronger rather than fully decentralized protocols guaranteeing dependencies between multicast messages based on only local views. And the proposed protocol is a hybrid approach improving the inherent scalability of multicast nature by gossip-based technique in all communications.

• Korean Journal of Social Welfare
• /
• v.58 no.2
• /
• pp.167-195
• /
• 2006

The purpose of this study is to suggest the revision direction of the Korean Child Welfare Law based on the results of the comparative analysis on the Korean Child Welfare Law and the Japanese Child Welfare Law. The main results are: Both laws have only two provisions about children's participation right. The child protective system in Japan secures the swiftness of within-two-months period of temporary protection through the child consulting center, the investigation right by the child welfare worker, publicity, enforcement on the parents' rights, and the network with the nearest child supporting center. Furthermore, those provisions with the notifying obligation by a finder of the child who needs protection and the limit of protection period are guaranteed in order to ensure the effectiveness of law enforcement. However, Korean child protective system functions only as pre-substitutive service. While the provisions for the disability children account for 21.2% of the total Japanese law, there is no provision on that in the Korean law. The Japanese law is substantially different from the Korean law in a sense that it obligates the minimum quality criteria of child service and national financial burden on the child welfare. While the Japanese law clearly stipulates the national responsibility in relation to the degree of the rights, the Korean law does not directly touch upon it. Furthermore, the Japan's law guarantees that not only children but also protectors retain the right to choose and apply for services.