• Title/Summary/Keyword: 분할노트

Search Result 9, Processing Time 0.028 seconds

A Case analysis on the treatment of mathematics anxiety utilizing a program to change students' thought of mathematics ('생각 바꾸기 프로그램'을 적용한 수학불안 치유 사례분석)

  • Park, Hae Soung;Cho, Wan Young
    • Communications of Mathematical Education
    • /
    • v.31 no.1
    • /
    • pp.17-48
    • /
    • 2017
  • This case study examined mathematics anxiety of a public high school sophomore who was unable to perform well in mathematics but later overcame his fear of mathematics. In this study, he showed high levels of mathematics anxiety in the assessment tools that evaluate mathematical anxiety factors. Cognitive and behavior treatments were carried out to alleviate his anxiety. First, cognitive treatments that were implemented include: understanding his own problems, writing down his thoughts on a record sheet, and changing intermediate and core beliefs. This paper explored cognitive and affective changes and reactions during the treatment process. Second, behavioral treatments that were conducted include: the divided-page method and peer tutoring. The divided-page technique involves the test subject to write down and solve his problems on a note to see what kind of cognitive and affective changes occur during the process. This paper also explored how Su-chul, an overly competitive student, changed and reacted cognitively and affectively through peer tutoring. The results revealed that Su-chul's exam anxiety, as well as other factors, has decreased. Moreover, he regained his self-confidence by solving math problems that he had felt difficult. His competitive attitude also has turned into a cooperative and thoughtful one.

A Efficient Delivery of Broadcast Packet in Bluetooth Network (블루투스 네트워크에서의 효율적인 브로드캐스트 패킷 전송 기법 연구)

  • Park, Mi-Seon;Kim, Gil-Yong
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2002.11b
    • /
    • pp.1411-1414
    • /
    • 2002
  • 블루투스는 본래 이동전화 핸드셋, 헤드셋, 그리고 휴대형 컴퓨터와 같은 장치를 연결하는 케이블을 제거하기 위해 개발된 것으로 저가, 저 전력, 단거리의 무선 기술이다. 그러나 전자 제품간에 표준화된 무선 통신이 가능하게 됨으로 인하여 블루투스는 휴대전화나 PDA, 노트북 PC 와 같은 모바일 기기에 부착되어 무선 ad-hoc 네트워크를 구성할 수 있게 되었다. 블루투스는 시분할 다중화 시스템(TDM) 방식으로 최대 8 개의 블루투스 기기가 모여 하나의 채널을 공유하는 '피코넷(piconet)' 을 형성할 수 있고 여러 개의 피코넷을 연결하여 '스캐터넷(scatternet)' 이라는 더 큰 네트워크를 구성할 수 있다. 이러한 블루투스 네트워크에서 기존의 브로드캐스트 서비스는 단순한 재전송 방식으로 인해 신뢰성과 효율성에 있어서 많은 문제점을 안고 있으며 블루투스의 특징을 고려하지 못하고 있다. 따라서 본 논문에서는 블루투스 네트워크에서 브로드캐스트 패킷의 수신을 보장하면서 대역폭을 효율적으로 사용하는 브로드캐스트 패킷 전송 기법을 제시하고자 한다.

  • PDF

Synchronous Reservation Protocol for Variable-sized Messages in a WDM-based Local Network (WDM 망에서 가변 길이의 메시지 전송을 위한 동기 예약 프로토콜)

  • Lee, Jae-Hwoon;Rim, Min-Joong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.38 no.6
    • /
    • pp.1-10
    • /
    • 2001
  • In this paper, we propose a synchronous reservation protocol that is efficient for supporting variable sized messages in a wavelength division multiplexing (WDM) based local network using a passive star topology. A. control channel is used to coordinate transmission on data channels. Time is slotted with fixed-sized slots. The network can accommodate a variable number of nodes, and can operate independently of the change of the number of nodes. So, any 'new' node can join the network anytime without network re-initialization. Moreover, with the protocol, we can avoid data channel and destination conflicts. We analyze the performance by using EPA method according to the variation of the end to end propagation delay with respect to one slot time, and validate the results by simulation.

  • PDF

Parallel Paths in Folded Hyper-Star Graph (Folded 하이퍼-스타 그래프의 병렬 경로)

  • Lee, Hyeong-Ok;Choi, Jung;Park, Seung-Bae;Cho, Chung-Ho;Lim, Hyeong-Seok
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.7
    • /
    • pp.1756-1769
    • /
    • 1999
  • Parallel paths in an interconnection network have some significance in that message transmission time can be reduced because message is divided into packets and transmitted in parallel through several paths, and also an whose nodes has 2n binary bit string, is an interconnection network which has a lower network cost than hypercube and its variation. In this paper, we analyze node disjoint parallel path in Folded Hyper-Star graph FHS(2n,n) proposed as the topology of parallel computers and, using the result, prove that the fault diameter of a Folded Hyper-Star graph FHS(2n,n) is 2n-1.

  • PDF

Design and Implementation of a Main-Memory Database System for Real-time Mobile GIS Application (실시간 모바일 GIS 응용 구축을 위한 주기억장치 데이터베이스 시스템 설계 및 구현)

  • Kang, Eun-Ho;Yun, Suk-Woo;Kim, Kyung-Chang
    • The KIPS Transactions:PartD
    • /
    • v.11D no.1
    • /
    • pp.11-22
    • /
    • 2004
  • As random access memory chip gets cheaper, it becomes affordable to realize main memory-based database systems. Consequently, reducing cache misses emerges as the most important issue in current main memory databases, in which CPU speeds have been increasing at 60% per year, compared to the memory speeds at 10% per you. In this paper, we design and implement a main-memory database system for real-time mobile GIS. Our system is composed of 5 modules: the interface manager provides the interface for PDA users; the memory data manager controls spatial and non-spatial data in main-memory using virtual memory techniques; the query manager processes spatial and non-spatial query : the index manager manages the MR-tree index for spatial data and the T-tree index for non-spatial index : the GIS server interface provides the interface with disk-based GIS. The MR-tree proposed propagates node splits upward only if one of the internal nodes on the insertion path has empty space. Thus, the internal nodes of the MR-tree are almost 100% full. Our experimental study shows that the two-dimensional MR-tree performs search up to 2.4 times faster than the ordinary R-tree. To use virtual memory techniques, the memory data manager uses page tables for spatial data, non- spatial data, T-tree and MR-tree. And, it uses indirect addressing techniques for fast reloading from disk.

Development of Fault Prediction System Using Peak-code Method in Power Plants (피크코드 기법을 이용한 발전설비 고장예측 시스템 개발)

  • Roh, Chang-Su;Do, Sung-Chan;Chong, Ui-Pil
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.9 no.4
    • /
    • pp.329-336
    • /
    • 2008
  • The facilities with new technologies in the recent power plants become larger and need a lot of high cost for maintenance due to stop operations and accidents from the operating machines. Therefore, it claims new systems to monitor the operating status and predict the faults of the machines. This research classifies the normal/abnormal status of the machines into 5 levels which are normal-level/abnormal-level/care-level/dangerous-level/fault and develops the new system that predicts faults without stop operation in power plants. We propose the regional segmentation technique in the frequency domain from the data of the operating machines and generate the Peak-codes similar to the Bar-codes, The high efficient and economic operations of the power plants will be achieved by carrying out the pre-maintenance at the care level of 5 levels in the plants. In order to be utilized easily at power plants, we developed the algorithm appling to a notebook computer from signal acquisition to the discrimination.

  • PDF

An Efficient Index Buffer Management Scheme for a B+ tree on Flash Memory (플래시 메모리상에 B+트리를 위한 효율적인 색인 버퍼 관리 정책)

  • Lee, Hyun-Seob;Joo, Young-Do;Lee, Dong-Ho
    • The KIPS Transactions:PartD
    • /
    • v.14D no.7
    • /
    • pp.719-726
    • /
    • 2007
  • Recently, NAND flash memory has been used for a storage device in various mobile computing devices such as MP3 players, mobile phones and laptops because of its shock-resistant, low-power consumption, and none-volatile properties. However, due to the very distinct characteristics of flash memory, disk based systems and applications may result in severe performance degradation when directly adopting them on flash memory storage systems. Especially, when a B-tree is constructed, intensive overwrite operations may be caused by record inserting, deleting, and its reorganizing, This could result in severe performance degradation on NAND flash memory. In this paper, we propose an efficient buffer management scheme, called IBSF, which eliminates redundant index units in the index buffer and then delays the time that the index buffer is filled up. Consequently, IBSF significantly reduces the number of write operations to a flash memory when constructing a B-tree. We also show that IBSF yields a better performance on a flash memory by comparing it to the related technique called BFTL through various experiments.

Isogeometric Analysis of Mindlin Plate Structures Using Commercial CAD Codes (상용 CAD와 연계한 후판 구조의 아이소-지오메트릭 해석)

  • Lee, Seung-Wook;Koo, Bon-Yong;Yoon, Min-Ho;Lee, Jae-Ok;Cho, Seon-Ho
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.24 no.3
    • /
    • pp.329-335
    • /
    • 2011
  • The finite element method (FEM) has been used for various fields like mathematics and engineering. However, the FEM has a difficulty in describing the geometric shape exactly due to its property of piecewise linear discretization. Recently, however, a so-called isogeometric analysis method that uses the non-uniform rational B-spline(NURBS) basis function has been developed. The NURBS can be used to describe the geometry exactly and play a role of basis functions for the response analysis. Nevertheless, constructing the NURBS basis functions in analysis is as costly as a meshing process in the FEM. Since the isogeometric method shares geometric data with CAD, it is possible to intactly import the model data from commercial CAD tools. In this paper, we use the Rhinoceros 3D software to create CAD models and export in the form of STEP file. The information of knot vectors and control points in the NURBS is utilized in the isogeometric analysis. Through some numerical examples, the accuracy of isogeometric method is compared with that of FEM. Also, the efficiency of the isogeometric method that includes the CAD and CAE in a unified framework is verified.

A Key Management Scheme without Re-encryption for Home-domain Contents Distribution in Open IPTV Environments (Open IPTV 환경에서 재암호화 과정 없는 댁내 컨텐츠 분배를 위한 키관리 기법)

  • Jung, Seo-Hyun;Roh, Hyo-Sun;Lee, Hyun-Woo;Yi, Jeong-Hyun;Jung, Sou-Hwan
    • Journal of the Korea Society of Computer and Information
    • /
    • v.15 no.7
    • /
    • pp.57-66
    • /
    • 2010
  • Due to the advancement of IPTV technologies, open IPTV services are a step closer to becoming reality. In such service environment, users are able to enjoy IPTV services using a variety of devices available at their home domain. However, it is impossible to get such flexible services at their convenience unless each of devices is individually connected to Set-Top-Box (STB) because of Conditional Access System (CAS) or service providers otherwise allow STB to freely distribute decoded contents to every user devices attached to STB. In this paper, we propose a key management scheme for securely distributing contents from STB to multiple user devices at home domain. The proposed scheme also makes the service providers be able to control the access rights to each of user devices without installing individual STBs. It is achieved by computationally dividing a private key of RSA signature scheme into three parts and thus makes possible to distribute the contents scrambled through a underlying CAS mechanism without re-encrypting them that the existing scheme should employ. It improves significantly computation and communication complexities, maintaining it as secure as the existing schemes. Additionally, it prevents misbehaving users from illegally distributing the contents from STB to their devices available at home domain.