• Title/Summary/Keyword: 링

Search Result 27,112, Processing Time 0.05 seconds

An Analysis on Mentor Teacher's Difficulties during Collaborative Mentoring Program (협력적 멘토링 과정에서 나타난 멘토의 어려움 분석)

  • Choi, So Jung;Kwon, Jeongin;Nam, Jeonghee
    • Journal of the Korean Chemical Society
    • /
    • v.58 no.6
    • /
    • pp.638-648
    • /
    • 2014
  • The purpose of this study was to examine mentor teachers' difficulties during their collaborative mentoring process to improve beginning science teachers' teaching practice. Participants were fourteen science teachers. This study collected questionnaires for mentor teachers' perception of the mentoring program, questionnaires for mentor teachers' efficacy, a record and transcript of interview, a record and transcript of mentoring conversation, and mentor teachers' journals for the study. The result showed that mentor teachers were having difficulties with mentee teachers when they have different major or work in different levels of school, and they found it hard to set aside time for mentoring due to heavy amount of school work. Also, they had low self-confidence experiencing a lack of expertise as a mentor teacher, and some mentor teachers were having difficulties in building a rapport with mentee teachers. Mentor teachers had difficulties as well when they have different point of view with mentee teachers about mentoring.

Torus Ring : Improving Performance of Interconnection Networks by Modifying Hierarchical Ring (Torus Ring : 계층 링 구조의 변형을 통한 상호 연결망의 성능 개선)

  • Kwak, Jong-Wook;Ban, Hyong-Jin;Jhon, Chu-Shik
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.32 no.5
    • /
    • pp.196-208
    • /
    • 2005
  • In multiprocessor systems, interconnection network design is critical for overall system performance. Popular interconnection networks, which are generally considered, are meshes, rings, and hierarchical rings. In this paper, we propose (')Torus Ring('), which is a modified version of hierarchical ring. Torus Ring has the same complexity as the hierarchical rings, but the only difference is the way it connects the local rings. It has an advantage over the hierarchical rings when the destination of a packet is the neighbor local ring in the reverse direction. Though the average number of hops in Torus Ring is equal to that of the hierarchical rings when assuming the uniform distribution of each transaction, the benefits of the number of hops are expected to be larger because of the spatial locality in the real environment of parallel programming. In the simulation results, latencies in the interconnection network are reduced by up to 19$\%$, and the execution times are reduced by up to 10$\%$.

Enhanced Methods of Path Finding Based on An Abstract Graph with Extension of Search Space (탐색 영역 확장 기법들을 활용한 추상 그래프 기반의 탐색 알고리즘 성능 개선)

  • Cho, Dae-Soo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.1
    • /
    • pp.157-162
    • /
    • 2011
  • In this paper, we propose enhanced methods of path finding based on an abstract graph with extension of search space to improve the quality of path. The proposed methods that are called simple buffering method, velocity constrained method and distance constrained method are to extract buffering-cells for using search space with valid-cells. The simple buffering method is to extract adjacent cells of valid-cells as buffering-cells. velocity constrained method and distance constrained method are based on simple buffering method, these eliminate buffering-cells through each of threshold. In experiment, proposed methods can improve the quality of path. The proposed methods are applicable to develop various kinds of telematics application, such as path finding and logistics.

Efficient Grid Resource Scheduling Model with Resource Reliability Measurement (자원 신뢰성 측정을 통한 효율적인 그리드 자원 스케줄링 모델)

  • Park, Da-Hye;Lee, Jong-Sik
    • Journal of the Korea Society for Simulation
    • /
    • v.15 no.4
    • /
    • pp.129-136
    • /
    • 2006
  • Grid computing has been appeared for solving large-scaled data which are not solved by a single computer. Grid computing is a new generation platform which connects geographically distributed heterogeneous resources. However, gathering heterogeneous distributed resources produces many difficult problems. Especially. to assure resource reliability is one of the most critical problems. So, we propose a grid resource scheduling model using grid resource reliability measurement. We evaluate resource reliability based on resource status data and apply it to the grid scheduling model in DEVSJAVA modeling and simulation. This paper evaluates parameters such as resource utilization, job loss and average turn-around time and estimates experiment results of our model in comparison with those of existing scheduling models such as a random scheduling model and a round-robin scheduling model. These experiment results showed that the resource reliability measurement scheduling model provides efficient resource allocation and stable Job processing in comparison with a random scheduling model and a round-robin scheduling model.

  • PDF

A Study on Improvement of 2-Dim Filtering Efficiency for Image (2차원 영상 필터링 효율 향상을 위한 기술연구)

  • Jeon, Joon-Hyeon
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.42 no.6
    • /
    • pp.99-110
    • /
    • 2005
  • These days, many image processing techniques have been studied for effective image compression. Among those, The 2D image filtering is widely used for 2D image processing. The 2D image filtering can be implemented by performing the 1D linear filter separately in the horizontal and vertical direction. Efficiency of image compression depends on what filtering method is used. Generally, circular convolution is widely used in 2D image filtering for image processing. However it doesn't consider correlations at the boundary region of image, therefore effective filtering can not be performed. To solve this problem. I proposed new convolution technique using loop convolution which satisfies the 'alias-free' and 'error-free' requirement in the reconstructed image. This method could provide more effective compression performance than former methods because it used highly-correlated data when performed at the boundary region. In this paper, Sub-band Coding(SBC) was adopted to analyze efficiency of proposed filtering technique, and the simulator developed by Java-based language was used to examine the performance of proposed method.

Hydraulic Cleaning Effect on Fouling Mechanisms in Pressurized Membrane Water Treatment (가압식 멤브레인 수처리에서 수리학적 세정이 파울링 기작에 미치는 영향)

  • Charfi, Amine;Jang, Hoseok;Kim, Jeonghwan
    • Membrane Journal
    • /
    • v.27 no.6
    • /
    • pp.519-527
    • /
    • 2017
  • Membrane fouling is the main issue hindering the expansion of low pressure membrane processes for surface water treatment. Therefore, applying periodic hydraulic cleaning for fouling control should be well optimized. Better understanding of membrane fouling associated with periodic hydraulic cleaning would be useful to optimize membrane cleaning strategies. By comparing experimental permeability data with the classical Hermia blocking laws, this study aims at analyzing membrane fouling and understanding dominant fouling mechanisms occurring when filtering a synthetic surface water solution with a pressurized membrane process during six filtration cycles of 30 min each, separated with cyclic cleaning of 1 min by backwashing and forward flushing separately and combined. When applying single cleaning technique, membrane fouling during the first cycles was controlled by complete blocking mechanism while the last cycles were dominated by cake formation. Nevertheless, when combining cleaning technique better membrane regeneration was obtained and fouling was mainly due to cake formation.

Ring Operator Threaded-Scheduling for Improving Continuous Query Processing over Data Streams (데이터 스트림 환경에서 질의 처리 성능 향상을 위한 링 연산자 쓰레드 스케줄링 기법)

  • Young-Ki Kim;Soong-Sun Shin;Weon-Il Chung;Sung-Ha Baek;Dong-Wook Lee;Hae-Young Bae
    • Annual Conference of KIPS
    • /
    • 2008.11a
    • /
    • pp.296-299
    • /
    • 2008
  • 최근 데이터 스트림을 관리하기 위해 DSMS(Data Stream Management System)가 계속적으로 연구 되고 있다. 하지만 데이터 스트림은 방대한 양의 데이터를 처리하기 위하여 실시간성을 갖는 빠른 데이터 처리가 요구되며, 이러한 특성 때문에 데이터 처리의 효율성 증대를 위하여 메모리 관리가 중요하다. 기존 메모리 관리에 대한 연구는 쓰레드 스케줄링을 통한 관리 기법이 연구되었다. 하지만 기존의 연산자 쓰레드 스케줄링과 그래프 쓰레드 스케줄링은 쓰레드 관리의 유연성이 떨어지기 때문에 불규칙적인 데이터 스트림 환경에서는 부적합하다. 또한 하이브리드 멀티 쓰레드 스케줄링 기법은 두 가지 기법의 장점을 결합하였으나 가상 연산자의 일회성 사용으로 쓰레드 관리의 어려움 이 있다. 따라서 본 논문은 공유와 재사용이 가능한 링 연산자를 이용한 링 연산자 쓰레드 스케줄 링 기법을 제안한다. 본 기법은 링 연산자를 통해 새로 입력된 질의의 동일한 연산자 구성은 생성 되어 있는 링 연산자를 공유하거나 재사용하여 불필요한 자원 소모와 자원 할당의 과부하를 줄임으로써 기존 기법에 비해 쓰레드 할당의 수를 감소 시켜 대량의 질의 처리 시 속도를 증가 시켰다.

Comparison and Application of Dynamic and Static Crawling for Extracting Product Data from Web Pages (웹페이지에서의 상품 데이터 추출을 위한 동적, 정적 크롤링 비교 및 활용)

  • Sang-Hyuk Kim;Jeong-Hoon Kim;Seung-Dae Lee
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.18 no.6
    • /
    • pp.1277-1284
    • /
    • 2023
  • In this paper, a web page that is easy for consumers to access event products in progress at convenience stores was created. In the production process, static crawling and dynamic crawling, two crawling methods for extracting data from event products, were compared and used. Static crawling is an extraction method of collecting static data from a homepage, and dynamic crawling is a method of collecting data from pages dynamically generated from a web page. Through the comparison of the two crawlings, we studied which crawl method is more effective in extracting event product data. Among them, a web page was created using effective static crawling, and 1+1 and 2+1 products were categorized and a search function was added to create a web page.

The object-based reservation scheduling technique for improving customer's satisfaction (고객의 만족도를 높이는 객체에 근거한 예약 스케줄링 기법)

  • 김진봉;백청호
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2004.10b
    • /
    • pp.550-552
    • /
    • 2004
  • 예약 스케줄링 문제는 여러 가지 제약조건이 많고 탐색공간이 방대하기 때문에 백트래킹 방법이나 단순스케줄링을 통한 방법으로는 예약 스케줄링에서 가장 중요한 고객의 만족도를 향상시키기 어렵다. 본 논문에서 제시한 예약스케줄링 기법은 제약만족문제(CSP)와 객체지향개념을 예약 스케줄링 문제에 적용하여 온라인(On-line) 예약 시에 일어날 수 있는 문제점들을 해결하고자 하였다. 객체 지향 개념을 기반으로 고객(객체)들이 갖고 있는 사건들을 주어진 제약들에 만족하도록 목표인 보드에 배정한다. 특히 고객들의 만족도를 높이기 위해서 고객의 선호도 보드를 참조하여 객체들의 우선순위에 따라서 자원을 배정하고, 자원에 대한 객체의 선호도 차이를 가질 수 있게 하였다. 보드에 대한 정의와 모든 사건들에 대한 정보를 전역제약으로 사용하고, 고객이 가지는 보드의 슬롯들에 대한 선호도를 지역 제약으로 사용한다. 고객의 선호도보드를 참조하여 예약스케줄링을 수행한 결과의 고객 만족도가 많이 향상되었음을 알 수 있었다.

  • PDF

Hybrid Monitoring using Wireless Sensor Nodes of Steel Plate-Girder Railroad Bridges (무선센서노드를 이용한 강판형 철도교량의 하이브리드 모니터링)

  • Hong, Dong-Soo;Park, Jae-Hyung;Kim, Jeong-Tae
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2009.04a
    • /
    • pp.110-113
    • /
    • 2009
  • 본 연구에서는 무선센서노드을 이용하여 강판형 철도교량의 전형적인 손상유형인 거더부의 휨강성 저하와 지점부의 볼트풀림을 효과적으로 모니터링할 수 있는 하이브리드 모니터링 기법을 제안하였다. 이를 위해 다음과 같은 연구가 수행되었다. 첫째, 본 연구진에 의해 개발된 가속도 및 임피던스기반 무선센서노드를 간략하게 소개하였다. 둘째, 가속도 및 임피던스 신호를 이용하여 효과적인 손상모니터링이 가능한 기법들을 선정하였다. 마지막으로, 개발된 가속도 및 임피던스기반 무선센서노드를 모형 강판형 철도교에 설치하고, 일련의 손상 시나리오에 따른 하이브리드 모니터링을 수행하여 무선센서노드 및 모니터링 기법의 성능을 평가하였다.

  • PDF