• Journal of The Korean Association For Science Education
• /
• v.38 no.3
• /
• pp.369-378
• /
• 2018

In this study, we investigated the characteristics in the processes of generating analogy for lessons by pre-service science teachers. Eight pre-service teachers at a college of education in Seoul participated in this study. After the workshop of analogy in science education, they generated analogies for lessons. In order to investigate thought processes deeply, we used the think-aloud method and also conducted semi-structured interviews after their activities. Worksheets written by the pre-service teachers were collected. Their activities and interviews were recorded and videotaped. The characteristics in the processes of generating analogy were analyzed in the perspectives of student, analog, and concept. The analyses of the results revealed that they generated analogies to correct students' misconceptions and also considered misconceptions that could be caused by their analogies. They generated analogies using sources with which students are familiar. They also generated concrete and everyday analogies rather than abstract and artificial analogies. There were some cases where they did not clearly grasp the target concepts and expressed the concepts which were not covered in the unit. On the bases of the results, we suggest some educational implications for pre-service science teacher education.

• Bulletin of the Korean Mathematical Society
• /
• v.21 no.2
• /
• pp.67-75
• /
• 1984

Let X be a topological space. We consider a groupoid G over X and the quotient groupoid G/N for any normal subgroupoid N of G. The concept of groupoid (topological groupoid) is a natural generalization of the group(topological group). An useful example of a groupoid over X is the foundamental groupoid .pi.X whose object group at x.mem.X is the fundamental group .pi.(X, x). It is known [5] that if X is locally simply connected, then the topology of X determines a topology on .pi.X so that is becomes a topological groupoid over X, and a covering space of the product space X*X. In this paper the concept of the locally simple connectivity of a topological space X is applied to the groupoid G over X. That concept is defined as a term '1-connected local subgroupoid' of G. Using this concept we topologize the groupoid G so that it becomes a topological groupoid over X. With this topology the connected groupoid G is a covering space of the product space X*X. Further-more, if ob(.overbar.G)=.overbar.X is a covering space of X, then the groupoid .overbar.G is also a covering space of the groupoid G. Since the fundamental groupoid .pi.X of X satisfying a certain condition has an 1-connected local subgroupoid, .pi.X can always be topologized. In this case the topology on .pi.X is the same as that of [5]. In section 4 the results on the groupoid G are generalized to the quotient groupoid G/N. For any topological groupoid G over X and normal subgroupoid N of G, the abstract quotient groupoid G/N can be given the identification topology, but with this topology G/N need not be a topological groupoid over X [4]. However the induced topology (H) on G makes G/N (with the identification topology) a topological groupoid over X. A final section is related to the covering morphism. Let G$_{1}$ and G$_{2}$ be groupoids over the sets X$_{1}$ and X$_{2}$, respectively, and .phi.:G$_{1}$.rarw.G$_{2}$ be a covering spimorphism. If X$_{2}$ is a topological space and G$_{2}$ has an 1-connected local subgroupoid, then we can topologize X$_{1}$ so that ob(.phi.):X$_{1}$.rarw.X$_{2}$ is a covering map and .phi.: G$_{1}$.rarw.G$_{2}$ is a topological covering morphism.

• Journal of KIISE:Software and Applications
• /
• v.26 no.12
• /
• pp.1445-1454
• /
• 1999

광역 조건식의 계산은 분산 프로그램의 수행을 테스트 또는 디버깅하기 위한 방법으로 활 발히 연구되고 있다. 이제까지 주로 연구된 광역조건식은 AND 또는 OR 광역 조건식 등이 있는데, 특히 AND 광역 조건식은 분산 프로그램의 동시적 조건을 표현하는데 유용하여 효율적인 검색 알고리즘이 활발히 연구되었다. 분산프로그램의 수행오류로서 공유자원의 배타적 접근조건은 가장 중요하고 일반적인 경우라 할 수 있다. 본 논문에서는 XOR 연산을 이용하여 공유자원 프로그램의 오류 검색을 위한 광역조건식을 기술하는 방식에 대해 제안하였다. XOR 연산을 이용한 광역 조건식은 연산자 중 많아야 하나의 지역조건식만이 참일 때 전체 조건식이 참이 되는데 이러한 성질은 여러 프로세스 중 한번에 하나만이 공유자원에 배타적으로 접근할 수 있는 조건을 표현하는데 매우 유용하다. n 개의 프로세스로 이루어진 분산프로그램에서 한개의 공유자원에 대한 배타적 접근 조건을 기술하기 위해서 AND로 연결된 광역조건식을 이용하면 O(n2)개의 광역 조건식이 필요한데 반해 XOR 연산으로는 하나의 조건식으로 나타낼 수 있다. 더구나 XOR 연산을 이용한 광역조건식은 최근 소개된 겹치는 구간의 개념을 활용하면 매우 간단하게 검색할 수 있다. 본 논문에서는 겹치는 구간을 찾는 검색 알고리즘을 소개하고 증명하였다.Abstract Detecting global predicates is an useful tool for debugging and testing a distributed program. Past research has considered several restricted forms of predicates, including conjunctive or disjunctive form of predicates. Especially, conjunctive predicates have attracted main attention not only because they are useful to describe simultaneous conditions in a distributed program, but also because it is possible to find algorithms to evaluate them within reasonable time bound. Detecting errors in accessing shared resources are the most popular and important constraints of distributed programs. In this paper, we introduced an exclusive OR predicates as a model of global predicates to describe shared resource conditions in distributed programs. An exclusive OR predicate holds only when at most one operand is true, which is useful to describe mutual exclusion conditions of distributed programs where only one process should be allowed to access the shared resource at a time. One exclusive OR predicate is enough to describe mutual exclusion condition of n processes with one shared resource, while it takes O(n2) conjunctive predicates. Moreover, exclusive OR condition is easily detectable using the concept of overlapping intervals introduced by Venkatesan and Dathan. An off-line algorithm for evaluating exclusive OR global predicates is presented with a correctness proof.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.11
• /
• pp.1318-1332
• /
• 1999

본 논문에서는 입출력 응용을 위해 collective I/O 기법을 기반으로 한 실행시간 시스템의 설계, 구현 그리고 그 성능평가를 기술한다. 여기서는 모든 프로세서가 동시에 I/O 요구에 따라 스케쥴링하며 I/O를 수행하는 collective I/O 방안과 프로세서들이 여러 그룹으로 묶이어, 다음 그룹이 데이터를 재배열하는 통신을 수행하는 동안 오직 한 그룹만이 동시에 I/O를 수행하는 pipelined collective I/O 등의 두 가지 설계방안을 살펴본다. Pipelined collective I/O의 전체 과정은 I/O 노드 충돌을 동적으로 줄이기 위해 파이프라인된다. 이상의 설계 부분에서는 동적으로 충돌 관리를 위한 지원을 제공한다. 본 논문에서는 다른 노드의 메모리 영역에 이미 존재하는 데이터를 재 사용하여 I/O 비용을 줄이기 위해 collective I/O 방안에서의 소프트웨어 캐슁 방안과 두 가지 모형에서의 chunking과 온라인 압축방안을 기술한다. 그리고 이상에서 기술한 방안들이 입출력을 위해 높은 성능을 보임을 기술하는데, 이 성능결과는 Intel Paragon과 ASCI/Red teraflops 기계 상에서 실험한 것이다. 그 결과 응용 레벨에서의 bandwidth는 peak point가 55%까지 측정되었다.Abstract In this paper we present the design, implementation and evaluation of a runtime system based on collective I/O techniques for irregular applications. We present two designs, namely, "Collective I/O" and "Pipelined Collective I/O". In the first scheme, all processors participate in the I/O simultaneously, making scheduling of I/O requests simpler but creating a possibility of contention at the I/O nodes. In the second approach, processors are grouped into several groups, so that only one group performs I/O simultaneously, while the next group performs communication to rearrange data, and this entire process is pipelined to reduce I/O node contention dynamically. In other words, the design provides support for dynamic contention management. Then we present a software caching method using collective I/O to reduce I/O cost by reusing data already present in the memory of other nodes. Finally, chunking and on-line compression mechanisms are included in both models. We demonstrate that we can obtain significantly high-performance for I/O above what has been possible so far. The performance results are presented on an Intel Paragon and on the ASCI/Red teraflops machine. Application level I/O bandwidth up to 55% of the peak is observed.he peak is observed.

• Journal of the Korean Applied Science and Technology
• /
• v.37 no.4
• /
• pp.944-957
• /
• 2020

This study is an integrated literature review of concept analysis research published in the Journal of the Korean Nursing Society and the journal of branch science for the last 10 years from 2009 to 2018. A total of 30 papers were analyzed, including the metaparadigm of nursing, the type of concept, the method of concept analysis, the degree of utilization, etc. As a result, the metaparadgim of nursing was the most common human being, with 23 human beings, 5 nursing, 1 health, and 1 environment, and all kinds of concepts were identified as abstract concepts. As for concept analysis methods, Walker & Avent had the most number of workers and events with 13 workers, 10 hybrids, and 7 evolutionary methods, but all of them were hybrid methods after 2018. The progress toward tool development has not been confirmed. The diversity of nursing paradigm based on research results and the development of tools based on it are also necessary.

• Journal of KIISE
• /
• v.41 no.9
• /
• pp.652-665
• /
• 2014

Many important terminologies in biomedical text are expressed as abbreviations or acronyms. We newly suggest a semantic link topic model based on the concepts of topic and dependency link to disambiguate biomedical abbreviations and cluster long form variants of abbreviations which refer to the same senses. This model is a generative model inspired by the latent Dirichlet allocation (LDA) topic model, in which each document is viewed as a mixture of topics, with each topic characterized by a distribution over words. Thus, words of a document are generated from a hidden topic structure of a document and the topic structure is inferred from observable word sequences of document collections. In this study, we allow two distinct word generation to incorporate semantic dependencies between words, particularly between expansions (long forms) of abbreviations and their sentential co-occurring words. Besides topic information, the semantic dependency between words is defined as a link and a new random parameter for the link presence is assigned to each word. As a result, the most probable expansions with respect to abbreviations of a given abstract are decided by word-topic distribution, document-topic distribution, and word-link distribution estimated from document collection though the semantic dependency link topic model. The abstracts retrieved from the MEDLINE Entrez interface by the query relating 22 abbreviations and their 186 expansions were used as a data set. The link topic model correctly predicted expansions of abbreviations with the accuracy of 98.30%.

• Journal of KIISE:Software and Applications
• /
• v.26 no.9
• /
• pp.1073-1084
• /
• 1999

이동 컴퓨팅 환경에서 이동 호스트는 제한된 대역폭을 효율적으로 사용하고 이동 트랜잭션의 응답 시간을 향상시키기 위하여 캐쉬를 이용한다. 그리고 이동 호스트에 캐슁된 데이타가 이동 지구국에서 갱신되면 이동 호스트의 캐쉬 일관성을 유지하기 위하여 이동 지구국은 무효화 메시지를 방송한다. 그러나 이동 지구국에서 주기적으로 무효화 메시지를 방송하는 방법은 이동 트랜잭션의 빠른 처리를 위하여 이동 지구국으로부터 데이타를 즉시 캐슁하는 경우에 이동 트랜잭션의 직렬가능한 수행을 보장할 수 없는 경우가 발생한다. 본 연구에서는 캐슁된 데이타를 이용하여 이동 트랜잭션을 수행하는 경우에 록을 이용하여 이동 트랜잭션의 직렬가능한 수행을 보장하는 UCL-MT 방법과 록 관리 방법을 제안한다. 제안하는 UCL-MT 방법은 이동 트랜잭션을 완료하기 이전에 이동 트랜잭션이 접근한 데이타 정보를 이용하여 지구국에서 사이클을 탐지함으로써 이동 트랜잭션의 직렬가능한 수행을 보장한다. 또한 제안하는 록 관리 방법은 이용할 수 있는 대역폭의 크기에 따른 무효화 메시지 내용의 변화에 유연하게 적용될 수 있다. Abstract In mobile computing environments, a mobile host caches the data to use the narrow bandwidth efficiently and improve the response time of a mobile transaction. If the cached data in mobile host is updated at a mobile support station, the mobile support station broadcasts an invalidation message for maintaining the cache consistency of a mobile host. But when a mobile transaction accesses the data which is not in cache, if a mobile host caches the data immediately from a mobile support station for processing a mobile transaction rapidly, the method that a mobile support station broadcasts an invalidation message periodically, happens to the case that can not guarantee the serializable execution of a mobile transaction. In this paper, we propose the UCL-MT method and lock management method, as a mobile transaction is executed using cached data. Since, using the data a mobile transaction accessed, the UCL-MT method detects a cycle in a mobile support station before the completion of the mobile transaction, it guarantees the serializable execution of the mobile transaction. Also, proposing lock management method can be adapted flexibly at the change of invalidation message content, according to the available bandwidth.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.8
• /
• pp.918-929
• /
• 1999

동기식 스트림 암호통신 방식을 사용하는 암호통신에서는 암/복호화 과정 수행시 암호통신 과정에서 발생하는 사이클슬립으로 인해 키수열의 동기이탈 현상이 발생되고 이로 인해 오복호된 데이타를 얻게된다. 이러한 위험성을 감소하기 위한 방안으로 현재까지 암호문에 동기신호와 세션키를 주기적으로 삽입하여 동기를 이루는 주기적인 동기암호 통신방식을 사용하여 왔다. 본 논문에서는 CDMA(Cellular Division Multiple Access) 이동망에서 데이타서비스를 제공할 때 사용되는 점대점 프로토콜의 주소영역의 특성을 이용하여 단위 측정시간 동안 측정된 주소비트 정보와 플래그 패턴의 수신률을 이용하여 문턱 값보다 작은경우 동기신호와 세션키를 전송하는 비주기적인 동기방식을 사용하므로써 종래의 주기적인 동기방식으로 인한 전송효율성 저하와 주기적인 상이한 세션키 발생 및 다음 주기까지의 동기이탈 상태의 지속으로 인한 오류확산 등의 단점을 해결하였다. 제안된 알고리즘을 링크계층의 점대점 프로토콜(Point to Point Protocol)을 사용하는 CDMA 이동망에서 동기식 스트림 암호 통신방식에 적용시 동기이탈율 10-7의 환경에서 주기가 1sec인 주기적인 동기방식에서 요구되는 6.45x107비트에 비해 3.84x105비트가 소요됨으로써 전송율측면에서의 성능향상과 오복호율과 오복호 데이타 비트측면에서 성능향상을 얻었다. Abstract In the cipher system using the synchronous stream cipher system, encryption / decryption cause the synchronization loss (of key arrangement) by cycle slip, then it makes incorrect decrypted data. To lessen the risk, we have used a periodic synchronous cipher system which achieve synchronization at fixed timesteps by inserting synchronization signal and session key. In this paper, we solved the problem(fault) like the transfer efficiency drops by a periodic synchronous method, the periodic generations of different session key, and the incorrectness increases by continuing synchronization loss in next time step. They are achieved by the transfer of a non-periodic synchronous signal which carries synchronous signal and session key when it is less than the threshold value, analyzing the address field of point-to-point protocol, using the receiving rate of address bits information and flag patterns in the decision duration, in providing data services by CDMA mobile network. When the proposed algorithm is applied to the synchronous stream cipher system using point-to-point protocol, which is used data link level in CDMA mobile network, it has advanced the result in Rerror and Derror and in transmission rate, by the use of 3.84$\times$105bits, not 6.45$\times$107bits required in periodic synchronous method, having lsec time step, in slip rate 10-7.

• Journal of the Korean earth science society
• /
• v.22 no.2
• /
• pp.96-104
• /
• 2001

To approach science education for all which has been required in STS program, it is indispensable to develop variously differentiated education courses that are suitable for various students. In order to do that, we have to abstract essential items that are dealt with in common from science textbook which is regarded as the kernel of science education. Then, these items are developed by fitting for each level-STS science study models. The purpose of this study is to improve the level-based investigation competence by applying these models to various level learning. We obtained some results as the following: First, there has been a positive change for attitude to study science in part. Second, we find the materials in our life and this study is relating to science, technique and society. So we find out the fact that there is close connection between science technique and our life. And also it helps encourage to learn. Third, in the process of searching for and producing STS materials, students have a chance to study for themselves by working out self-leading research activity. Finally, students can reduce a preconception that science is difficult by encouraging attitudes to search for and make our problems in our life scientifically and the habits thinking of and understanding our daily life itself in the scientific sight.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.9
• /
• pp.1177-1184
• /
• 1999

본 논문에서는 스캔플립프롭 선택 시간이 짧고 높은 고장 검출률(fault coverage)을 얻을 수 있는 새로운 부분스캔 설계 기술을 제안한다. 순차회로에서 테스트패턴 생성을 용이하게 하기 위하여 완전스캔 및 부분스캔 설계 기술이 널리 이용되고 있다. 스캔 설계로 인한 추가영역을 최소화 하고 최대의 고장 검출률을 목표로 하는 부분스캔 기술은 크게 구조분석과 테스트 가능도(testability)에 의한 설계 기술로 나누어 볼 수 있다. 구조분석에 의한 부분스캔은 짧은 시간에 스캔플립프롭을 선택할 수 있지만 고장 검출률은 낮다. 반면 테스트 가능도에 의한 부분스캔은 구조분석에 의한 부분스캔보다 스캔플립프롭의 선택 시간이 많이 걸리는 단점이 있지만 높은 고장 검출률을 나타낸다. 본 논문에서는 구조분석에 의한 부분스캔과 테스트 가능도에 의한 부분스캔 설계 기술의 장단점을 비교.분석하여 통합함으로써 스캔플립프롭 선택 시간을 단축하고 고장 검출률을 높일 수 있는 새로운 부분스캔 설계 기술을 제안한다. 실험결과 대부분의 ISCAS89 벤치마크 회로에서 스캔플립프롭 선택 시간은 현격히 감소하였고 비교적 높은 고장 검출률을 나타내었다.Abstract This paper provides a new partial scan design technique which not only reduces the time for selecting scan flip-flops but also improves fault coverage. To simplify the problem of the test pattern generation in the sequential circuits, full scan and partial scan design techniques have been widely adopted. The partial scan techniques which aim at minimizing the area overhead while maximizing the fault coverage, can be classified into the techniques based on structural analysis and testabilities. In case of the partial scan by structural analysis, it does not take much time to select scan flip-flops, but fault coverage is low. On the other hand, although the partial scan by testabilities generally results in high fault coverage, it requires more time to select scan flip-flops than the former method. In this paper, we analyzed and unified the strengths of the techniques by structural analysis and by testabilities. The new partial scan design technique not only reduces the time for selecting scan flip-flops but also improves fault coverage. Test results demonstrate the remarkable reduction of the time to select the scan flip-flops and high fault coverage in most ISCAS89 benchmark circuits.