• 한국수학교육학회지시리즈D:수학교육연구
• /
• 제16권2호
• /
• pp.137-154
• /
• 2012

Comparative studies on mathematical modeling cognition feature were carried out between 15 excellent high school third-grade science students (excellent students for short) and 15 normal ones (normal students for short) in China by utilizing protocol analysis and expert-novice comparison methods and our conclusions have been drawn as below. 1. In the style, span and method of mathematical modeling problem representation, both excellent and normal students adopted symbolic and methodological representation style. However, excellent students use mechanical representation style more often. Excellent students tend to utilize multiple-representation while normal students tend to utilize simplicity representation. Excellent students incline to make use of circular representation while normal students incline to make use of one-way representation. 2. In mathematical modeling strategy use, excellent students tend to tend to use equilibrium assumption strategy while normal students tend to use accurate assumption strategy. Excellent students tend to use sample analog construction strategy while normal students tend to use real-time generation construction strategy. Excellent students tend to use immediate self-monitoring strategy while normal students tend to use review-monitoring strategy. Excellent students tend to use theoretical deduction and intuitive judgment testing strategy while normal students tend to use data testing strategy. Excellent students tend to use assumption adjustment and modeling adjustment strategy while normal students tend to use model solving adjustment strategy. 3. In the thinking, result and efficiency of mathematical modeling, excellent students give brief oral presentations of mathematical modeling, express themselves more logically, analyze problems deeply and thoroughly, have multiple, quick and flexible thinking and the utilization of mathematical modeling method is shown by inspiring inquiry, more correct results and high thinking efficiency while normal students give complicated protocol material, express themselves illogically, analyze problems superficially and obscurely, have simple, slow and rigid thinking and the utilization of mathematical modeling method is shown by blind inquiry, more fixed and inaccurate thinking and low thinking efficiency.

• 한국조경학회지
• /
• 제27권4호
• /
• pp.73-79
• /
• 1999

This study is on the production and the classification of a new appreciation methods of seascape through materials in the words of Korean popular songs. In advance, it is necessary to understand the popular songs as collective representation and the songs are analytic data. In this study, some essential elements of seascape in popular songs are analyzed and classified. They are; 1. visible elements-weather, time, season and object. 2. all senses-vision, audition, olfaction, tactile sense, and spatial sense. 3. the line of vision-static line of vision and dynamic line of vision. In this way data is produced, and then the result of this study makes appreciation methods of seascape developed. In this way, this study results in developed appreciation of seascape. This study on new understanding of appreciation methods of seascape is on the basis of a design method of water-front that is considered a visible scene, not a design of construction elements.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권8호
• /
• pp.3873-3887
• /
• 2018

In this paper, we propose a novel method to recover images corrupted by impulse noise. The proposed method uses two stages: noise detection and filtering. In the first stage, we use pixel values, rank-ordered logarithmic difference values, and median values to train a neural-network-based impulse noise detector. After training, we apply the network to detect noisy pixels in images. In the next stage, we use group-based weighted couple sparse representation to filter the noisy pixels. During this second stage, conventional methods generally use only clean pixels to recover corrupted pixels, which can yield unsuccessful dictionary learning if the noise density is high and the number of useful clean pixels is inadequate. Therefore, we use reconstructed pixels to balance the deficiency. Experimental results show that the proposed noise detector has better performance than the conventional noise detectors. Also, with the information of noisy pixel location, the proposed impulse-noise removal method performs better than the conventional methods, through the recovered images resulting in better quality.

• 한국정보처리학회논문지
• /
• 제6권3호
• /
• pp.781-791
• /
• 1999

DD(Decision Diagrams) is an efficient operational data structure for an optimal expression of boolean functions. In a graph-based synthesis using DD, the goal of optimization decreases representation space for boolean functions. This paper represents boolean functions using OPKFDD(Ordered Pseudo-Kronecker Functional Decision Diagrams) for a graph-based synthesis and is based on the number of nodes as the criterion of DD size. For a property of OPKFDD that is able to select one of different decomposition types for each node, OPKFDD is variable in its size by the decomposition types selection of each node and input variable order. This paper proposes a method for generating OPKFDD efficiently from the current BDD(Binary Decision Diagram) Data structure and an algorithm for minimizing one. In the multiple output functions, the relations of each function affect the number of nodes of OPKFDD. Therefore this paper proposes a method to decide the input variable order considering the above cases. Experimental results of comparing with the current representation methods and the reordering methods for deciding input variable order are shown.

• 정보처리학회논문지B
• /
• 제9B권6호
• /
• pp.783-790
• /
• 2002

본 논문에서는 구간값 퍼지집합 추론의 퍼지 Pr/T 네트 표현을 제안한다. 여기에서 퍼지생성규칙은 지식표현을 위해 사용하고, 퍼지생성규칙의 믿음값은 구간값 퍼지집합으로 표현한다. 제안한 구간값 퍼지집합 추론 알고리즘은 퍼지생성규칙의 전제부와 결론부에 있는 퍼지개념에 따라서 적절한 믿음값평가함수를 사용하기 때문에 다른 방법보다 사람이 사용하는 직관과 추론에 더 가깝다.

• Journal of Computing Science and Engineering
• /
• 제12권1호
• /
• pp.1-11
• /
• 2018

Human activities recognition is a challenging task due to its complexity of human movements and the variety performed by different subjects for the same action. This paper presents a recognition algorithm by using skeleton information generated from depth maps. Concatenating motion features and temporal constraint feature produces feature vector. Reducing dictionary scale proposes an improved fast classifier based on sparse representation. The developed method is shown to be effective by recognizing different activities on the UTD-MHAD dataset. Comparison results indicate superior performance of our method over some existing methods.

• 정보관리연구
• /
• 제38권1호
• /
• pp.1-19
• /
• 2007

이 연구에서는 최근 검색성능을 향상시키기 위한 전략으로 사용되는 데이터 결합기법을 웹 문서 검색에 적용하고, 실험을 통해 문서표현 방법의 결합이 검색성능에 미치는 영향을 분석하였다. 문서 표현 방법으로는 내용기반 표현, 링크기반 표현,URL 등을 선정하고, 단일 표현 방법에 의한 검색결과와 표현방법의 결합을 통한 검색결과를 비교하였다. 분석결과 다른 문서표현 방법의 결합이 웹 문서의 검색성능을 향상시키지는 못하는 것으로 나타났다.

• Journal of applied mathematics & informatics
• /
• 제11권1_2호
• /
• pp.1-57
• /
• 2003

Vector fields in three-space admit bundles of internal variables such as a Heisenberg algebra bundle. Information transmission along field lines of vector fields is described by a wave linked to the Schrodinger representation in the realm of time-frequency analysis. The preservation of local information causes geometric optics and a quantization scheme. A natural circle bundle models quantum information visualized by holographic methods. Features of this setting are applied to magnetic resonance imaging.

• 한국정보과학회논문지:시스템및이론
• /
• 제30권5_6호
• /
• pp.213-222
• /
• 2003

일반적으로 하이퍼볼릭 공간상에서 대칭 패턴을 생성하는 알고리즘은 벡터표현 방식에 기반한 포워드 매핑 알고리즘을 사용한다. 기존의 알고리즘에서는 복사한 대칭 패턴을 표현하는 레이어의 증가에 따라 메모리의 사용이 기하급수적으로 증가한다 이러한 문제점으로 인해 전체 패턴의 정밀한 표현이 불가능하다. 또한 기본 패턴으로 비트맵 이미지를 사용하기 어렵고 벡터형태의 결과를 이미지로 변환하는 추가의 처리를 필요로 한다. 본 논문에서는 하이퍼볼릭 공간에서 대칭 패턴을 생성하는데 있어 정밀하고도 효율적인 계산 방법인 백워드 매핑 알고리즘을 제안한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권3호
• /
• pp.1464-1480
• /
• 2019

Robust tracking of infrared (IR) pedestrian targets with various backgrounds, e.g. appearance changes, illumination variations, and background disturbances, is a great challenge in the infrared image processing field. In the paper, we address a new tracking method for IR pedestrian targets via multi-feature local sparse representation (SR), which consists of three important modules. In the first module, a multi-feature local SR model is constructed. Considering the characterization of infrared pedestrian targets, the gray and edge features are first extracted from all target templates, and then fused into the model learning process. In the second module, an effective tracker is proposed via the learned model. To improve the computational efficiency, a sliding window mechanism with multiple scales is first used to scan the current frame to sample the target candidates. Then, the candidates are recognized via sparse reconstruction residual analysis. In the third module, an adaptive dictionary update approach is designed to further improve the tracking performance. The results demonstrate that our method outperforms several classical methods for infrared pedestrian tracking.