• 컴퓨터교육학회논문지
• /
• 제9권3호
• /
• pp.109-119
• /
• 2006

알고리즘은 컴퓨터와 관련된 모든 이론들의 기반이 되는 개념으로 매우 중요하다. 응용문제를 해결하기 위한 컴퓨터 알고리즘에 대한 연구는 많이 있지만 컴퓨터 알고리즘 개념을 어떻게 가르칠 것인가에 대한 효과적인 교수방법에 대한 연구물들은 매우 드물다. 본 논문에서는 초등학교 4학년 수학문제를 이용하여 문제를 해결하는 과정을 통하여 컴퓨터 알고리즘 개념을 학습하는 교수방법을 설계하였다. 설계한 교수방법을 현장에 적용하였으며, 결과 분석을 통하여 제안한 교수방법이 전통적인 교수방법보다 효과가 있음을 보인다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1988년도 전기.전자공학 학술대회 논문집
• /
• pp.647-650
• /
• 1988

This paper proposes and sketches out a new parallel architecture of transputer-based pyramidal parallel array computer (TPPAC) used to process computationally intensive problems for geometric processing applications such as computer vision, image processing etc. It explores how efficiently the pyramid computer architecture is designed using transputer chips, and poses a new interconnection scheme for TPPAC without using additional transputers.

• International Journal of Computer Science & Network Security
• /
• 제21권5호
• /
• pp.35-38
• /
• 2021

The article discusses approaches to the definition and understanding of artificial intelligence, research directions in the field of artificial intelligence; artificial intelligence in the anthropological dimension; the importance of the systems approach as a methodological basis for the design of intelligent systems; structural and functional components of intelligent systems; intelligent systems in the technological aspect; problems and prospects of relations in the system "man - intellectual system".

• 한국산학기술학회논문지
• /
• 제19권6호
• /
• pp.683-688
• /
• 2018

21세기에 교사는 물리적 수업 외에 가상 수업에서 최상의 학습을 보장하기 위해 어떤 새로운 기술에도 환영해야 한다. 구글 크레스룸은 브랜디드 학습과 전문 개발을 촉진하기 위한 중요한 기회를 제공한다. 본 연구는 브랜디드 문제중심학습을 위한 문제 설계를 제시하는 데 그 목적이 있다. BPBL의 기본적인 특징은 학습자들이 흥미를 갖게 하는 실생활의 문제들을 포즈를 취하고 해결함으로써 학습이 가장 효과적으로 시작되고 촉진된다는 것이다. 비구조된 PBL(문제중심 학습 )문제는 충분한 도메인 지식을 획득하는 학생들에게 영향을 미칠 수 있고, 적절한 사전 지식을 활성화하고, 그들 자신의 학습을 적절하게 지도할 수 있다. 좋은 문제를 설계하는 절차는 교육적 콘텐츠의 선택, 학습자의 특성 파악, 문제 발견, 역할과 상황설정, 문제 기록으로 구성된다. 이러한 절차를 사용하여, 관리 과목의 내용을 포괄하는 5가지 통합 문제를 설계하였다. 몽골대학의 BPBL에 기반하여 계획된 관리 과목 문제를 해결하는 과정에 시점을 두었다.

• ETRI Journal
• /
• 제43권5호
• /
• pp.835-855
• /
• 2021

With the recent increase in data disclosure, the Comprehensive Knowledge Archive Network (CKAN), which is an open-source data distribution platform, is drawing much attention. CKAN is used together with additional extensions, such as Datastore and Datapusher for data management and Harvest and DCAT for data collection. This study derives the problems of CKAN itself and Harvest Extension. First, CKAN causes two problems of data inconsistency and storage space waste for data deletion. Second, Harvest Extension causes three additional problems, namely source deletion that deletes only sources without deleting data themselves, job stop that cannot delete job during data collection, and service interruption that cannot provide service, even if data exist. Based on these observations, we propose herein an improved CKAN that provides a new deletion function solving data inconsistency and storage space waste problems. In addition, we present an improved Harvest Extension solving three problems of the legacy Harvest Extension. We verify the correctness and the usefulness of the improved CKAN and Harvest Extension functions through actual implementation and extensive experiments.

• 품질경영학회지
• /
• 제18권2호
• /
• pp.127-133
• /
• 1990

In this article, several problems inherent in histogram estimate of unknown probability density function are discussed. Those include so called sharp comers and bin edge effect. A resolution for these problems occurred with histogram is discussed. The resulting estimate is called kernel density estimate which is most widely used by data analysts. One of the most recent and reliable data-based choices of scale factor (bandwidth) of the estimate, which has been known to be most crucial, is also discussed.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2000년도 봄 학술발표논문집 Vol.27 No.1 (A)
• /
• pp.394-396
• /
• 2000

Currently, lots of research s going on in the field of the load distribution within HTTP. RR-DNS and SWEB are the most representative load distribution research. But, there are still many problems: unbalancing of load, load increase of web server and cost increase. Also, clients that require lots of data like multimedia happens to increase network load. To solve these, research about client/agent/server architecture is going on. But, the clients must know the agent's address and there are complexity and migration problems for design of such as protocol. This paper proposes TBSMS that is capable of choosing the optimal server considering the service capacity of the server as well as the network load. This paper demonstrates that TBSMS uses the web to solve the problem that client must know the agent's address and uses SNMP to solve the complexity and migration problem.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 ITC-CSCC -1
• /
• pp.200-203
• /
• 2002

We suggest a novel approach to the tracking of multiple moving objects in image sequence. The tracking of multiple moving objects include some complex problems(crossing (occluding), entering, disappearing, joining, and dividing) for objects identifying. Our method can settle these problems by optimization of a penalty function and movement prediction. It is executable in .eat time processing (more than 30 ㎐) because it is computed by only location data.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2005년도 추계종합학술대회
• /
• pp.1165-1168
• /
• 2005

The video device is used to gain lots of informations in indoor environment. The one of informations is the information to identify the moving object. The methods to identify the moving object are to recognize the face, the gait and to analyze the hue histogram of the clothes. The hue data is effective at the environment of multi-video. In this paper, we describe the existing research about to identify the moving object in the environment of multi-video and find its problems. finally, we present the enhanced methods to solve its problems. In the future, the method will be use for recognizing the location of object in ubiquitous home.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1993년도 한국자동제어학술회의논문집(국제학술편); Seoul National University, Seoul; 20-22 Oct. 1993
• /
• pp.391-394
• /
• 1993

A new approach using a Hopfield type neural network to solve line balancing problems for manufacturing planning is proposed. The energy function of the network to evaluate solutions is composed of three terms;(a) an operation should be processed at one and only one workstation, (b) the precedence-relationship between two operations shoud be satisfied, and (c) the cycle-time of operations should be minimized. It is shown that the network can solve the line balancing problems but not always because of the difficulty to keep the precedence-relationship. Therefore, a method to keep the precedence-relationship by software logic is proposed and it is verified that the line-balancing prblems can be solved with high probability.