• Title/Summary/Keyword: mapping space

Search Result 1,044, Processing Time 0.03 seconds

Difficulties of Elementary School Students in the Role-playing Analogy Activity for Concept Learning of Heat Transfer (열전달에 대한 역할놀이 비유활동 구성 및 수행과정에서 초등학생이 겪는 어려움)

  • Chang, Jaechul;Na, Jiyeon
    • Journal of The Korean Association For Science Education
    • /
    • v.37 no.6
    • /
    • pp.1063-1073
    • /
    • 2017
  • This study analyzed the difficulties elementary school students have in role-playing analogy activities for concept learning of heat transfer. Eleven fifth graders were given an orientation class on role-playing analogy activity, a class for concept learning of heat transfer as presented in a textbook, and then they performed the role-playing analogy activity with concepts of heat transfer. After the classes, researchers investigated the difficulties students encountered through questionnaires and interviews. The following are results of the research: Difficulties that students faced in role-playing analogy activity can be classified into five types. First, students encountered difficulties in expressing the analogy. The students who had difficulties in expressing the analogy focused on expressions outside the science concepts or lacked understanding of the science concepts. They also had difficulties in expressing the analogy because they lacked the expressiveness of analogy or abilities in mapping errors. They had difficulties in expressing the planned role-playing analogy in a narrow space. Second, students also experienced difficulties in performing activities due to lack of understanding on activities or lack of experience. Third, students experienced difficulties in selecting roles because they preferred the specific role or unwanted the specific roles. Fourth, the members of group experienced difficulties in group activities because they did not concentrate on activities, failed to perform roles, or showed attitudes of an onlooker. Fifth, they experienced difficulties in communications due to unilateral communication, conflicts of opinions, and lack of opinions.

Evaluation Toolkit for K-FPGA Fabric Architectures (K-FPGA 패브릭 구조의 평가 툴킷)

  • Kim, Kyo-Sun
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.49 no.4
    • /
    • pp.15-25
    • /
    • 2012
  • The research on the FPGA CAD tools in academia has been lacking practicality due to the underlying FPGA fabric architecture which is too simple and inefficient to be applied for commercial FPGAs. Recently, the database of placement positions and routing graphs on commercial FPGA architectures has been built, and provided for enabling the academic development of placement and routing tools. To extend the limit of academic CAD tools even further, we have developed the evaluation toolkit for the K-FPGA architecture which is under development. By providing interface for exchanging data with a commercial FPGA toolkit at every step of mapping, packing, placement and routing in the tool chain, the toolkit enables individual tools to be developed without waiting for the results of the preceding step, and with no dependency on the quality of the results, and compared in detail with commercial tools at any step. Also, the fabric primitive library is developed by extracting the prototype from a reporting file of a commercial FPGA, restructuring it, and modeling the behavior of basic gates. This library can be used as the benchmarking target, and a reference design for new FPGA architectures. Since the architecture is described in a standard HDL which is familiar with hardware designers, and read in the tools rather than hard coded, the tools are "data-driven", and tolerable with the architectural changes due to the design space exploration. The experiments confirm that the developed library is correct, and the functional correctness of applications implemented on the FPGA fabric can be validated by simulation. The placement and routing tools are under development. The completion of the toolkit will enable the development of practical FPGA architectures which, in return, will synergically animate the research on optimization CAD tools.

Effective Volume Rendering and Virtual Staining Framework for Visualizing 3D Cell Image Data (3차원 세포 영상 데이터의 효과적인 볼륨 렌더링 및 가상 염색 프레임워크)

  • Kim, Taeho;Park, Jinah
    • Journal of the Korea Computer Graphics Society
    • /
    • v.24 no.1
    • /
    • pp.9-16
    • /
    • 2018
  • In this paper, we introduce a visualization framework for cell image data obtained from optical diffraction tomography (ODT), including a method for representing cell morphology in 3D virtual environment and a color mapping protocol. Unlike commonly known volume data sets, such as CT images of human organ or industrial machinery, that have solid structural information, the cell image data have rather vague information with much morphological variations on the boundaries. Therefore, it is difficult to come up with consistent representation of cell structure for visualization results. To obtain desired visual representation of cellular structures, we propose an interactive visualization technique for the ODT data. In visualization of 3D shape of the cell, we adopt a volume rendering technique which is generally applied to volume data visualization and improve the quality of volume rendering result by using empty space jittering method. Furthermore, we provide a layer-based independent rendering method for multiple transfer functions to represent two or more cellular structures in unified render window. In the experiment, we examined effectiveness of proposed method by visualizing various type of the cell obtained from the microscope which can capture ODT image and fluorescence image together.

Soil Particle Shape Analysis Using Fourier Descriptor Analysis (퓨리에 기술자 분석을 이용한 단일 흙 입자의 형상 분석)

  • Koo, Bonwhee;Kim, Taesik
    • Journal of the Korean GEO-environmental Society
    • /
    • v.17 no.3
    • /
    • pp.21-26
    • /
    • 2016
  • Soil particle shape analysis was conducted with sands from Jumujun, Korea and Ras Al Khair, Saudi Arabia. Two hundred times enlarged digital images of the particles of those two sands were obtained with an optical microscope. The resolution of the digital images was $640{\times}320$. By conducting digital image processing, the coordinates of the soil particle boundary were extracted. After mapping those coordinates to the complex space, Fourier transformation was performed and the coefficients of each trigonometry term were computed. The coefficients reflect the shape characteristics of the sand grains and are invariant to translation. To evaluate the shape itself excluding the size of the soil particle, the coefficient was normalized by the equivalent radius of soil particle; this is called Fourier descriptor. After analyzing the Fourier descriptors, it was found that the major characteristics of Jumunjin and Ras Al Khair sands were elongation and asymmetry. Furthermore, it was found that the particle shapes reflect the self-similar, fractal nature of the textural features. The effects of resolution on soil particle shape analysis was also studied. Regarding this, it was found that the significant Fourier descriptors were not significantly affected by the image resolution investigated in this study, but the descriptors associated with textural features were affected.

Boolean Query Formulation From Korean Natural Language Queries using Syntactic Analysis (구문분석에 기반한 한글 자연어 질의로부터의 불리언 질의 생성)

  • Park, Mi-Hwa;Won, Hyeong-Seok;Lee, Geun-Bae
    • Journal of KIISE:Software and Applications
    • /
    • v.26 no.10
    • /
    • pp.1219-1229
    • /
    • 1999
  • 일반적으로 AND, OR, NOT과 같은 연산자를 사용하는 불리언 질의는 사용자의 검색의도를 정확하게 표현할 수 있기 때문에 검색 전문가들은 불리언 질의를 사용하여 높은 검색성능을 얻는다고 알려져 있지만, 일반 사용자는 자신이 원하는 정보를 불리언 형태로 표현하는데 익숙하지 않다. 본 논문에서는 검색성능의 향상과 사용자 편의성을 동시에 만족하기 위하여 사용자의 자연어 질의를 확장 불리언 질의로 자동 변환하는 방법론을 제안한다. 먼저 자연어 질의를 범주문법에 기반한 구문분석을 수행하여 구문트리를 생성하고 연산자 및 키워드 정보를 추출하여 구문트리를 간략화한다. 다음으로 간략화된 구문트리로부터 명사구를 합성하고 키워드들에 대한 가중치를 부여한 후 불리언 질의를 생성하여 검색을 수행한다. 또한 구문분석의 오류로 인한 검색성능 저하를 최소화하기 위하여 상위 N개 구문트리에 대해 각각 불리언 질의를 생성하여 검색하는 N-BEST average 방법을 제안하였다. 정보검색 실험용 데이타 모음인 KTSET2.0으로 실험한 결과 제안된 방법은 수동으로 추출한 불리언 질의보다 8% 더 우수한 성능을 보였고, 기존의 벡터공간 모델에 기반한 자연어질의 시스템에 비해 23% 성능향상을 보였다. Abstract There have been a considerable evidence that trained users can achieve a good search effectiveness through a boolean query because a structural boolean query containing operators such as AND, OR, and NOT can make a more accurate representation of user's information need. However, it is not easy for ordinary users to construct a boolean query using appropriate boolean operators. In this paper, we propose a boolean query formulation method that automatically transforms a user's natural language query into a extended boolean query for both effectiveness and user convenience. First, a user's natural language query is syntactically analyzed using KCCG(Korean Combinatory Categorial Grammar) parser and resulting syntactic trees are structurally simplified using a tree-simplifying mechanism in order to catch the logical relationships between keywords. Next, in a simplified tree, plausible noun phrases are identified and added into the same tree as new additional keywords. Finally, a simplified syntactic tree is automatically converted into a boolean query using some mapping rules and linguistic heuristics. We also propose an N-BEST average method that uses top N syntactic trees to compensate for bad effects of single incorrect top syntactic tree. In experiments using KTSET2.0, we showed that a proposed method outperformed a traditional vector space model by 23%, and surprisingly manually constructed boolean queries by 8%.

Buffer Cache Management for Low Power Consumption (저전력을 위한 버퍼 캐쉬 관리 기법)

  • Lee, Min;Seo, Eui-Seong;Lee, Joon-Won
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.35 no.6
    • /
    • pp.293-303
    • /
    • 2008
  • As the computing environment moves to the wireless and handheld system, the power efficiency is getting more important. That is the case especially in the embedded hand-held system and the power consumed by the memory system takes the second largest portion in overall. To save energy consumed in the memory system we can utilize low power mode of SDRAM. In the case of RDRAM, nap mode consumes less than 5% of the power consumed in active or standby mode. However hardware controller itself can't use this facility efficiently unless the operating system cooperates. In this paper we focus on how to minimize the number of active units of SDRAM. The operating system allocates its physical pages so that only a few units of SDRAM need to be activated and the unnecessary SDRAM can be put into nap mode. This work can be considered as a generalized and system-wide version of PAVM(Power-Aware Virtual Memory) research. We take all the physical memory into account, especially buffer cache, which takes an half of total memory usage on average. Because of the portion of buffer cache and its importance, PAVM approach cannot be robust without taking the buffer cache into account. In this paper, we analyze the RAM usage and propose power-aware page allocation policy. Especially the pages mapped into the process' address space and the buffer cache pages are considered. The relationship and interactions of these two kinds of pages are analyzed and exploited for energy saving.

SOM-Based $R^{*}-Tree$ for Similarity Retrieval (자기 조직화 맵 기반 유사 검색 시스템)

  • O, Chang-Yun;Im, Dong-Ju;O, Gun-Seok;Bae, Sang-Hyeon
    • The KIPS Transactions:PartD
    • /
    • v.8D no.5
    • /
    • pp.507-512
    • /
    • 2001
  • Feature-based similarity has become an important research issue in multimedia database systems. The features of multimedia data are useful for discriminating between multimedia objects. the performance of conventional multidimensional data structures tends to deteriorate as the number of dimensions of feature vectors increase. The $R^{*}-Tree$ is the most successful variant of the R-Tree. In this paper, we propose a SOM-based $R^{*}-Tree$ as a new indexing method for high-dimensional feature vectors. The SOM-based $R^{*}-Tree$ combines SOM and $R^{*}-Tree$ to achieve search performance more scalable to high-dimensionalties. Self-Organizingf Maps (SOMs) provide mapping from high-dimensional feature vectors onto a two-dimensional space. The map is called a topological feature map, and preserves the mutual relationships (similarity) in the feature spaces of input data, clustering mutually similar feature vectors in neighboring nodes. Each node of the topological feature map holds a codebook vector. We experimentally compare the retrieval time cost of a SOM-based $R^{*}-Tree$ with of an SOM and $R^{*}-Tree$ using color feature vectors extracted from 40,000 images. The results show that the SOM-based $R^{*}-Tree$ outperform both the SOM and $R^{*}-Tree$ due to reduction of the number of nodes to build $R^{*}-Tree$ and retrieval time cost.

  • PDF

Digital Modulation Types Recognition using HOS and WT in Multipath Fading Environments (다중경로 페이딩 환경에서 HOS와 WT을 이용한 디지털 변조형태 인식)

  • Park, Cheol-Sun
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.45 no.5
    • /
    • pp.102-109
    • /
    • 2008
  • In this paper, the robust hybrid modulation type classifier which use both HOS and WT key features and can recognize 10 digitally modulated signals without a priori information in multipath fading channel conditions is proposed. The proposed classifier developed using data taken field measurements in various propagation model (i,e., rural area, small town and urban area) for real world scenarios. The 9 channel data are used for supervised training and the 6 channel data are used for testing among total 15 channel data(i.e., holdout-like method). The Proposed classifier is based on HOS key features because they are relatively robust to signal distortion in AWGN and multipath environments, and combined WT key features for classifying MQAM(M=16, 64, 256) signals which are difficult to classify without equalization scheme such as AMA(Alphabet Matched Algorithm) or MMA(Multi-modulus Algorithm. To investigate the performance of proposed classifier, these selected key features are applied in SVM(Support Vector Machine) which is known to having good capability of classifying because of mapping input space to hyperspace for margin maximization. The Pcc(Probability of correct classification) of the proposed classifier shows higher than those of classifiers using only HOS or WT key features in both training channels and testing channels. Especially, the Pccs of MQAM 3re almost perfect in various SNR levels.

Mapping Intellectual Space of Technology Innovation Management in Korea (한국 기술혁신연구의 지적생태계 구조)

  • Seol, Sung-Soo;Namn, Su-Hyeon;Park, Jung-Min
    • Journal of Korea Technology Innovation Society
    • /
    • v.12 no.1
    • /
    • pp.165-188
    • /
    • 2009
  • The major purposes of the research are to see the underlying disciplines of technology innovation management which contribute to Korean research. To do that, we employed author cocitation analysis which has been proved to be robust. We compiled all the citations of two major Korean journals between 1993 and 2006. We also included up to 3rd author, which makes a cocitation analysis more comprehensive, compared with the previous analysis for the first author only. We identified 239 authors who have more than 10 citations. From the cocitation combinations based on the 239 authors, we selected and analyzed 100 most cocited authors. Out of 100 authors a group of 23 authors who command both higher citations and cocitations were chosen for detailed analysis. The results show that the average number of publications is 22.2, the average number of citations to them is 58.5, and the average number of citations to a publication is 2.6. Also, the average number of cocitations is around 10 times that of citations. The results indicate that there are six major disciplines: Technology/Innovation, Management of Technology, Economics of Technology, Development, Valuation of Technology, and Growth. Noteworthy points are the following. 1) Most of the members of the technology management group are management scholars, and the groups of economics of technology and growth are economists, while the groups of technology innovation and development group are not represented by specific disciplines. 2) Considering the groups overall from the traditional academic disciplines, the main branches are management and economics. 3) The valuation of technology group consists mostly of Korean researchers.

  • PDF

Mobile Cloud Context-Awareness System based on Jess Inference and Semantic Web RL for Inference Cost Decline (추론 비용 감소를 위한 Jess 추론과 시멘틱 웹 RL기반의 모바일 클라우드 상황인식 시스템)

  • Jung, Se-Hoon;Sim, Chun-Bo
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.1 no.1
    • /
    • pp.19-30
    • /
    • 2012
  • The context aware service is the service to provide useful information to the users by recognizing surroundings around people who receive the service via computer based on computing and communication, and by conducting self-decision. But CAS(Context Awareness System) shows the weak point of small-scale context awareness processing capacity due to restricted mobile function under the current mobile environment, memory space, and inference cost increment. In this paper, we propose a mobile cloud context system with using Google App Engine based on PaaS(Platform as a Service) in order to get context service in various mobile devices without any subordination to any specific platform. Inference design method of the proposed system makes use of knowledge-based framework with semantic inference that is presented by SWRL rule and OWL ontology and Jess with rule-based inference engine. As well as, it is intended to shorten the context service reasoning time with mapping the regular reasoning of SWRL to Jess reasoning engine by connecting the values such as Class, Property and Individual which are regular information in the form of SWRL to Jess reasoning engine via JessTab plug-in in order to overcome the demerit of queries reasoning method of SparQL in semantic search which is a previous reasoning method.