• Title/Summary/Keyword: Knowlegde Management

Search Result 3, Processing Time 0.018 seconds

A Theoretical Review on Knowledge Management and Its Model (지식경영과 그 모델에 관한 이론적 고찰)

  • 윤구호
    • Journal of Korean Library and Information Science Society
    • /
    • v.33 no.1
    • /
    • pp.169-192
    • /
    • 2002
  • Knowledge management(KM) is a concept that has emerged explosively in the business community as a major issue of the 1990s. In this paper, the background and definition of KM and some major issues such as central groups and themes dominating the field of KM are outlined In brief. In particular, a descriptive model is proposed integrating explicit knowledge, tacit knowlegde and the infrastructure, and its key characteristics are examined in detail. Also a few methods to build efficient KM systems(KMS) as well as some conventional practices in KMS, and the librarian's role in KMS realization are briefly introduced.

  • PDF

The Validation of Occupational Basic Competencies of Fisheries and Maritime High School (수산·해운계 고등학교 직업기초능력 척도의 타당화)

  • Lee, Sang-Cheol;Won, Hyo-Heon
    • Journal of Fisheries and Marine Sciences Education
    • /
    • v.27 no.1
    • /
    • pp.115-124
    • /
    • 2015
  • The aims of this study were to validate the Occupational Basic Competencies of Fisheries and Maritime High school. Fisheries & Maritime key competencies were defined as the abilities that include the essential knowledge, skills, attitude, and experiences required for the workforce on the fisheries and maritime job condition. This research collected preliminary data from 1,113 fisheries & maritime high school students. Data were analyzed to obtain reliability and validity analysis. The results of the study were as follows; First, fisheries & maritime key competencies were divided into 6 elements. Second, fisheries & maritime key competencies were consisted of marine vocational ethics, marine information capacity, marine elementary knowlegde, marine safety management skill, management & utilization of marine life and marine consciousness. Third, Cronbach-${\alpha}$ proves that the scale developed in the study is reliable. In consequence, the results of this study help to reconceptualize fisheries & maritime and apply the scale to measure students in high school settings.

Practical Password-Authenticated Three-Party Key Exchange

  • Kwon, Jeong-Ok;Jeong, Ik-Rae;Lee, Dong-Hoon
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.2 no.6
    • /
    • pp.312-332
    • /
    • 2008
  • Password-based authentication key exchange (PAKE) protocols in the literature typically assume a password that is shared between a client and a server. PAKE has been applied in various environments, especially in the “client-server” applications of remotely accessed systems, such as e-banking. With the rapid developments in modern communication environments, such as ad-hoc networks and ubiquitous computing, it is customary to construct a secure peer-to-peer channel, which is quite a different paradigm from existing paradigms. In such a peer-to-peer channel, it would be much more common for users to not share a password with others. In this paper, we consider password-based authentication key exchange in the three-party setting, where two users do not share a password between themselves but only with one server. The users make a session-key by using their different passwords with the help of the server. We propose an efficient password-based authentication key exchange protocol with different passwords that achieves forward secrecy in the standard model. The protocol requires parties to only memorize human-memorable passwords; all other information that is necessary to run the protocol is made public. The protocol is also light-weighted, i.e., it requires only three rounds and four modular exponentiations per user. In fact, this amount of computation and the number of rounds are comparable to the most efficient password-based authentication key exchange protocol in the random-oracle model. The dispensation of random oracles in the protocol does not require the security of any expensive signature schemes or zero-knowlegde proofs.