• The Transactions of the Korea Information Processing Society
• /
• v.3 no.7
• /
• pp.1680-1686
• /
• 1996

The deterministic update method of intensional predicates in a parallel deductive database that deductive database is distributed in a parallel computer architecture in needed. Using updated data from the deterministic update method, a strategy for parallel evaluation of intensional predicates is required. The paper is concerned with an approach to updating parallel deductive database in which very insertion or deletion can be performed in a deterministic way, and an extended parallel semi-naive evaluation algorithm in a parallel computer architecture. After presenting an approach to updating intensional predicates and strategy for parallel evaluation, its implementation is discussed. A parallel deductive database consists of the set of facts being the extensional database and the set of rules being the intensional database. We assume that these sets are distributed in each processor, research how to update intensional predicates and evaluate using the update method. The parallel architecture for the deductive database consists of a set of processors and a message passing network to interconnect these processors.

• Survey Research
• /
• v.9 no.1
• /
• pp.43-68
• /
• 2008

This study compares two instruments for time use study: The time diary and the Experience Sampling Method (ESM), While previous studies show that the ESM and the full-diary are similar with respect to aggregate estimates, No previous study has examined the concordance rates of individual records from both instruments. Based on the subsamples who completed both instruments during the same time period from 500 family studies conducted by the Alfred P. Sloan Center on Parents, Children, and Work at the University of Chicago, we systematically compares the two instruments and evaluates their relative strengths. The results suggest that time diaries provide less biased time use estimates. and that compared to the time diary, the ESM provides a more detailed description of everyday life. The implications of further researches are discussed.

• Korean Journal of Cognitive Science
• /
• v.25 no.2
• /
• pp.159-187
• /
• 2014

Approximate number sense(hereafter, ANS) is the ability to compare and operate upon numerosity information. The numerosity comparison task is used to measure ANS. However, there is considerable variance among previous reports of ANS acuity which may be related to different task formats used. Here, we aim to investigate whether the format of the numerosity comparison task influences measurements of ANS acuity. We compared two task formats; 1) an intermixed format presenting two intermixed arrays of black and white dots, and 2) a side-by-side format showing two arrays of dots side by side. The intermixed format likely makes additional demands on general cognitive resources for inhibitory control, selective attention, or visuospatial working memory. The performance on the intermixed format was significantly lower than that of the side-by-side format resulting in an underestimation of ANS acuity compared to the expected trajectory of ANS development. In addition, the ANS acuity measured from only the side-by-side format was correlated with children's mathematical achievement and age. Our results demonstrate that measurement of ANS from the side-by-side format has higher construct and predictive validity compared to that of the intermixed format.

• Korean Journal of Heritage: History & Science
• /
• v.53 no.4
• /
• pp.60-77
• /
• 2020

An assumption can be made that, as a start point for the recognition and utilization of cultural heritage, the "choice" of such would reflect the cultural ideology of the ruling power at that time. This has finally been proved by the case of Korea in the 20th century. First, in the late Korean Empire (1901-1910), the prevailing cultural ideology had been inherited from the Joseon Dynasty. The main objects that the Joseon Dynasty tried to protect were royal tombs and archives. During this time, an investigation by the Japanese into Korean historic sites began in earnest. Stung by this, enlightened intellectuals attempted to recognize them as constituting independent cultural heritage, but these attempts failed to be institutionalized. During the 1910-1945 Japanese occupation, the Japanese led investigations to institutionalize Korean cultural heritage, which formed the beginning of the current cultural heritage management system. At that time, the historical investigation, designation, protection, and enhancement activities led by the Japanese Government-General of Korea not only rationalized their colonial occupation of Korea but also illustrated their colonial perspective. Korean nationalists processed the campaign for the love of historical remains on an enlightening level, but they had their limits in that the campaign had been based on the outcome of research planned by the Japanese. During the 1945-2000 period following liberation from Japan, cultural heritage restoration projects took places that were based on nationalist ideology. People intended to consolidate the regime's legitimacy through these projects, and the enactment of the 'Cultural Heritage Charter' in 1997 represented an ideology in itself that stretched beyond a means of promoting nationalist ideology. During the past 20 centuries, cultural heritage content changed depending on the whims of those with political power. Such choices reflected the cultural ideology that the powers at any given time held with regard to cultural heritage. In the background of this cultural heritage choice mechanism, there have been working trade-off relationships formed between terminology and society, as well as the ideological characteristics of collective memories. The ruling party has tried to implant their ideology on their subjects, and we could consider that it wanted to achieve this by being involved in collective memories related to traditional culture, so called-choice, and utilization of cultural heritage.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.14 no.1
• /
• pp.59-69
• /
• 2004

Password-based authenticated group key exchange protocols provide a group of user, communicating over a public(insecure) channel and holding a common human-memorable password, with a session key to be used to construct secure multicast sessions for data integrity and confidentiality. In this paper, we present a password-based authenticated group key exchange protocol and prove the security in the random oracle model and the ideal cipher model under the intractability of the decisional Diffie-Hellman(DH) problem and computational DH problem. The protocol is scalable, i.e. constant round and with O(1) exponentiations per user, and provides forward secrecy.

• Proceedings of the Korean Information Science Society Conference
• /
• 2010.11a
• /
• pp.27-31
• /
• 2010

본 논문에서는 하이퍼그래프의 고유벡터를 척도로 하여 fMRI기반 Brain Network를 분석하여 중요한 허브노드를 찾는 방법론을 제시한다. 이 방법을 비디오게임을 수행하면서 촬영한 기능적 자기뇌영상(fMRI) 데이터인 PBAIC 2007 데이터셋에 대하여 그 유용성을 검증하였다. 이 데이터는 각 20분씩 세 세션을 촬영한 것이며 처음 두 세션에는 13가지의 감정 항목의 평가치가 각 스캔마다 주어진다. 한 피험자의 첫번째 세션 데이터로부터 13가지 감정 항목에 대하여 상관관계가 높은 각각의 복셀(voxel)들을 추출하였다. 이 13가지의 복셀들의 집합들을 각각 하이퍼에지로 보고 하이퍼그래프를 구성하였다. 하이퍼그래프로부 터 인접 행렬(adjacency matrix)를 구성한 후 고유치(eigenvalue)와 고유벡터(eigenvector)를 구하였다. 여기서 고유치가 가장 큰 고유벡터의 원소들은 각 복셀들의 중앙성(centrality), 즉 중요성을 나타내며 이로부터 감정과 관련된 중요한 허브 복셀들과 그들의 국소적 집합인 모듈을 찾았다. 모듈들은 감정 및 작업기억(working memory)과 관련된 뇌 영역들의 클러스터(cluster)로 추정된다.

• The Journal of the Acoustical Society of Korea
• /
• v.14 no.1E
• /
• pp.14-21
• /
• 1995

This paper presents a parallel sorting algorithm suitable for the SIMD multiprocessor. The algorithm finds pivots for partitioning the data into ordered subsets. The data can be evenly distributed to be sorted since it uses the probability theory. For n data elements to be sorted on p processors, when $n{\geq}p^2$, the algorithm is shown to be asymptotically optimal. In practice, sorting 8 million data items on 64 processors achieved a 48.43-fold speedup, while the PSRS required a 44.4-fold speedup. On a variety of shared and distributed memory machines, the algorithm achieved better than half-linear speedups.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06c
• /
• pp.289-294
• /
• 2008

어떤 자연언어 문서가 전달하려는 의미는 그 텍스트의 성격에 따라 아주 명확할 수도(예: 뉴스 문서), 아주 불분명할 수도 있다(예: 시). 이 연구는 이러한 '의미의 명확성(semantic transparency)'을 정량적으로 측정할 수 있다고 가정하고, 이 의미의 명확성을 판단하는 데에 단어들의 연쇄(word association)의 확률통계적 성질들이 어떻게 기능하는지에 대해 논한다. 이를 위해 특정 단어가 연쇄체를 형성하면서 발생하는 neighboring frequency와 degeneracy를 중심으로 Markov chain Monte Carlo scheme을 적용하여 의미망('Semantic Hypernetwork')으로 학습시킨 후 문서의 구성 단어들과 그 집합들 간의 연결 상태를 파악하였다. 우리는 의미적으로 그 표상이 분명하게 나뉘는 문서들(뉴스와 시)을 대상으로 이 모델이 어떻게 이들의 의미적 명확성을 분류하는지 분석하였다. Neighboring frequency와 degeneracy, 이 두 속성이 언어구조에서의 의미망 기억과 학습 탐색 기제에 유의한 기질로서 제안될 수 있다. 본 연구의 주요 결과로 1) 텍스트의 의미론적 투명성을 구별하는 통계적 증거와, 2) 문서의 의미구조에 대한 새로운 기질 발견, 3) 기존의 문서의 카테고리 별 분류와는 다른 방식의 분류 방식 제안을 들 수 있다.

• Journal of KIISE:Software and Applications
• /
• v.27 no.1
• /
• pp.41-49
• /
• 2000

This paper describes a method of generating MPHFs(Minimal Perfect Hash Functions) for large static search key sets. The MOS(Mapping-Ordering-Searching) approach is widely used presently in MPHF generation. In this research, the MOS approach is improved and a SOMS(Selecting-Ordering-Mapping-Searching) approach is proposed, where the Selecting step is newly introduced and the Orderng step is performed before the Mapping step to generate MPHFs more effectively. The MPHF generation algorithm proposed in this research is probabilistic and the expected processing time is linear to the number of keys. Experimental results show that MPHFs are generated fast and the space needed to represent the hash functions is small.

• Geophysics and Geophysical Exploration
• /
• v.16 no.1
• /
• pp.27-35
• /
• 2013

In this study, we developed the trial product on 3D magnetic inversion tentatively named 'KMag3D'. Also, we briefly introduced its own function and graphic user interface on which especially focused through the development in the form of user manual. KMag3D is consisted of two fundamental frame for the 3D magnetic inversion. First, algebraic reconstruction technique was selected as a 3D inversion algorithm instead of least square method conventionally used in various magnetic inversion. By comparison, it was turned out that algebraic reconstruction algorithm was more effective and economic than that of least squares in aspect of both computation time and memory. Second, for the effective determination of the 3D initial and a-priori information model required in the execution of our algorithm, we proposed the practical technique based on the assemblage of 2D forward modeling and inversion results for individual user-selected 2D profiles. And in succession, initial and a-priori information model were constructed by appropriate interpolation along the strke direction. From this, we concluded that our technique is both suitable and very practical for the application of 3D magentic inversion problem.