• 한국과학교육학회지
• /
• 제33권7호
• /
• pp.1259-1272
• /
• 2013

본 연구는 탐구적 과학 글쓰기 실험수업이 중학생들의 창의적 사고와 비판적 사고에 미치는 효과를 알아보기 위한 것으로 이를 위해 Keys 등(1999)이 개발한 SWH 전략에 기초하여 탐구적 과학 글쓰기 프로그램을 개발하였다. 연구의 대상은 2개 학급 63명은 비교집단으로, 2개 학급은 실험집단으로 선정하였고, 소집단의 구성은 인지수준이 비슷한 동질집단으로 구성하였다. 프로그램의 처치는 2011년 3월부터 7월까지 9개의 활동 주제로 총 18차시를 투입하였다. 사후검사는 사전검사와 동일한 검사지를 사용하였으며, 검사 결과는 SPSS 20.0 프로그램을 사용하여 창의적 사고와 비판적 사고의 사전검사를 공변인으로 하는 공변량 분석(ANCOVA)으로 통계 처리하였다. 또한 설문지를 이용하여 학생들의 탐구적 과학 글쓰기 실험수업에 대한 인식을 알아보았다. 이러한 연구결과를 살펴보면, 탐구적 과학 글쓰기 실험수업이 창의적 문제해결력 향상에 효과적이므로, 지속적인 탐구적 과학 글쓰기 수업전략의 제시와 다양한 실험 주제 개발이 필요하다고 여겨진다.

• 전자공학회논문지CI
• /
• 제41권3호
• /
• pp.11-16
• /
• 2004

최근 이질적인 분산 컴퓨팅 환경 상에서의 공동 작업들이 나날이 늘어나고 있다. 고속의 원거리 네트워크의 유용성 (availability)은 화상 회의, 분산된 대화식의 시뮬레이션, 그리고 공동의 시각화(collaborative visualization)와 같은 공동의 멀티미디어 응용들을 가능하게 하였다. 이와 같은 응용들과 분산된 고성능 컴퓨팅에서의, 효율적인 그룹 통신은 매우 중요하다. 일반적인 그룹 통신으로는 브로드캐스트, 멀티캐스트 등이 있다. 기존의 FEF, ECEF, look-ahead 와 같은 휴리스틱 알고리즘들은 이러한 이질적 분산 시스템에서의 브로드캐스트와 멀티캐스트를 위한 메시지 전송 트리를 구성하여 준다. 하지만 이러한 알고리즘들은 각 단계에서의 최적의 해를 선택하기 때문에 지역적 최적해(local optimum)에 빠질 수 있는 단점이 있다. 본 논문에서는 노드와 네트워크 모두가 이질적인 기존의 통신 모델 상에서 보다 효율적인 집합적 연산을 위한 트리를 구성해주는 개선된 브로드캐스트 알고리즘을 제안한다. 기존의 휴리스틱 알고리즘들이 지역적 최적해에 빠질 수 있는 점을 감안하여, 보다 합리적이고, 유용성 있는 edge 선택 기준을 제시하였다. 여러 가지 통신비용에 대한 성능 평가를 통하여, 개선된 휴리스틱 알고리즘은 기존의 알고리즘보다 적은 완료 시간을 가지며, 특히 look-ahead 알고리즘보다 낮은 계산 복잡도를 가지는 장점을 가짐을 알 수 있다.

• ETRI Journal
• /
• 제36권5호
• /
• pp.714-720
• /
• 2014

In this paper, we propose the use of data-driven probabilistic utterance-level decision logic to improve Weighted Finite State Transducer (WFST)-based endpoint detection. In general, endpoint detection is dealt with using two cascaded decision processes. The first process is frame-level speech/non-speech classification based on statistical hypothesis testing, and the second process is a heuristic-knowledge-based utterance-level speech boundary decision. To handle these two processes within a unified framework, we propose a WFST-based approach. However, a WFST-based approach has the same limitations as conventional approaches in that the utterance-level decision is based on heuristic knowledge and the decision parameters are tuned sequentially. Therefore, to obtain decision knowledge from a speech corpus and optimize the parameters at the same time, we propose the use of data-driven probabilistic utterance-level decision logic. The proposed method reduces the average detection failure rate by about 14% for various noisy-speech corpora collected for an endpoint detection evaluation.

• Journal of Communications and Networks
• /
• 제8권1호
• /
• pp.123-131
• /
• 2006

Several distributed architectures, incorporating mobile agent technology, have been recently proposed to answer the scalability limitations of their centralized counterparts. However, these architectures fail to address scalability problems, when distributed tasks requiring the employment of itinerant agents is considered. This is because they lack mechanisms that guarantee optimization of agents' itineraries so as to minimize the total migration cost in terms of the round-trip latency and the incurred traffic. This is of particular importance when MAs itineraries span multiple subnets. The work presented herein aspires to address these issues. To that end, we have designed and implemented an algorithm that adapts methods usually applied for addressing network design problems in the specific area of mobile agent itinerary planning. The algorithm not only suggests the optimal number of mobile agents that minimize the overall cost but also constructs optimal itineraries for each of them. The algorithm implementation has been integrated into our mobile agent framework research prototype and tested in real network environments, demonstrating significant cost savings.

• 한국항해항만학회:학술대회논문집
• /
• 한국항해항만학회 1998년도 추계학술대회논문집:21세기에 대비한 지능형 통합항만관리
• /
• pp.309-313
• /
• 1998

Delay time of receiving and delivery is one of important factors that should be considered in the evaluation of the customer service level of a container terminal. In this study, dispatching rules are tested with the objective of minimizing the service delay time for arriving outside trucks. A dynamic programming model is suggested for a static dispatching problem in which all the truck arrivals are known in advance. In order to overcome the excessive computational time of the dynamic programming technique, several heuristic rules are suggested that can be applied in practices. A simulation study is carried out to test the performances of the heuristic rules.

• 대한기계학회논문집A
• /
• 제21권5호
• /
• pp.769-779
• /
• 1997

This paper presents an approach to multiple objective scheduling of flexible manufacturing systems(FMS). The approach is an extension of the scheduling method that formulates scheduling problems using Petrinets, and applies heuristic search to find optimal or near-optimal schedules with a single objective. New evaluation functions are developed to optimize simultaneously the makespan and the total operating cost. A scheduling example is used to demonstrate the effectiveness of the proposed approach.

• Advances in Computational Design
• /
• 제5권3호
• /
• pp.209-231
• /
• 2020

In order to evaluate the performance of three heuristic optimization algorithms, namely, simulated annealing (SA), genetic algorithm (GA) and particle swarm optimization (PSO) for optimal stacking sequence of laminated composite plates with respect to critical buckling load and non-dimensional natural frequencies, a multi-objective optimization procedure is developed using the weighted summation method. Classical lamination theory and first order shear deformation theory are employed for critical buckling load and natural frequency computations respectively. The analytical critical buckling load and finite element calculation schemes for natural frequencies are validated through the results obtained from literature. The comparative study takes into consideration solution and computational time parameters of the three algorithms in the statistical evaluation scheme. The results indicate that particle swarm optimization (PSO) considerably outperforms the remaining two methods for the special problem considered in the study.

• 산업경영시스템학회지
• /
• 제26권4호
• /
• pp.63-71
• /
• 2003

This paper analyses a deterministic scheduling problem concerned with manufacturing multiple types of components at a pre-assembly stage composed of parallel fabrication machines. Each component part is machined on a fabrication machine specified in advance. The manufactured components are subsequently assembled into products. The completion time of a job(product) is measured by the latest completion time of its all components at the pre-assembly stage. The problem has the objective measure of minimizing the total weighted completion time of a finite number of jobs. Two lower bounds are derived and tested in a branch-and-bound scheme. Also, three constructive heuristic algorithms are developed based on the machine aggregation and greedy strategies. Some empirical evaluation of the performance of the proposed branch-and-bound and heuristic algorithms are also performed.

• 대한산업공학회지
• /
• 제29권1호
• /
• pp.90-99
• /
• 2003

Object clustering, which makes classification for a set of objects into a number of groups such that objects included in a group have similar characteristic and objects in different groups have dissimilar characteristic each other, has been exploited in diverse area such as information retrieval, data mining, group technology, etc. In this study, an object-clustering problem with similarity coefficients between objects is considered. At first, an evaluation function for the optimization problem is defined. Then, a genetic algorithm and local optimization technique based on heuristic method are proposed and used in order to obtain near optimal solutions. Solutions from the genetic algorithm are improved by local optimization techniques based on object relocation and cluster merging. Throughout extensive experiments, the validity and effectiveness of the proposed algorithms are tested.

• International Journal of Computer Science & Network Security
• /
• 제21권1호
• /
• pp.55-63
• /
• 2021

The design functionality put forward by mapping the interactiveness of information. The presentation of such information with the user interface model indicates that the guidelines, concepts, and workflows form the deliverables and milestones for achieving a visualized design, therefore forming the right trend is significant to ensure compliance in terms of changing consideration and applying evaluation in the early stages. It is evidenced that prototype design is guided by improvement specifications, includes modes, and variables that increase improvements. The study presents five user interface testing methods. The testing methods are heuristic evaluation, perspective-based user interface testing, cognitive walkthrough, pluralistic walkthrough, and formal usability inspection. It appears that the five testing methods can be combined and matched to produce reasonable results. At last, the study presents different mobile application designs for student projects besides the evaluation of mobile application designs to consider the user needs and usability.