• 한국수학교육학회지시리즈C:초등수학교육
• /
• 제14권1호
• /
• pp.27-41
• /
• 2011

본 연구는 분석과 종합에 대한 역사적 출발이라고 볼 수 있는 유클리드의 저작인 '자료론'과 '분할론'에 대한 분석 연구이다. Euclid의 원론에 비해 거의 관심이 없는 두 문헌에 대한 분석을 통해 사고활동으로서의 분석 및 종합에 대한 의미를 살펴보았다. 먼저 분석, 종합이 포함된 다양한 용어들에 대한 개념을 살펴보고, 이를 바탕으로 본 연구에서 사용한 분석과 종합의 개념을 명확화하였다. 또한 두 문헌에 제시된 명제에 대한 분석을 통해 분석은 '외재적 분석'과 '내재적 분석'으로 분류하였는데, 외재적 분석은 제시된 명제에 자체에서 외형적으로 드러난 수학적 대상, 요소, 성질, 속성에 대한 분석이고, 내재적 분석은 외재적 분석의 결과로 추출된 수학적 대상, 요소, 성질, 속성에 대한 재분석 혹은 결합 및 관련성의 추출을 통한 분석이다. 종합은 '이론적 종합'과 '경험적 종합'으로 분류하였는데, 이론적 종합은 경험보다는 논리적, 이성적 과정을 통한 새로운 대상의 추출이고, 경험적 종합은 과거의 학습 경험과 이에 대한 활용을 통한 대상의 추출이다. 이러한 분류를 기초로 하여 초등학교 교과서에 제시된 문제를 통해 실제 적용하여 탐색하였다.

• Journal of Electrical Engineering and information Science
• /
• 제3권1호
• /
• pp.1-7
• /
• 1998

High-Level synthesis of digital circuits calls for automatic translation of a behavioral description to a structural design entity represented in terms of components and connection. One of the critical steps in high-level synthesis is to determine a particular scheduling algorithm that will assign behavioral operations to control states. A new scheduling algorithm called Data Availability Scheduling (DAS) for high-level synthesis is presented. It can determine an appropriate scheduling algorithm and minimize the number of states required using data availability and dependency conditions extracted from the behavioral code, taking into account of states required using data availability and dependency conditions extracted from the behavioral code, taking into account resource constraint in each control state. The DAS algorithm is efficient because data availability conditions, and conditional and wait statements break the behavioral code into manageable pieces which are analyzed independently. The output is the number of states in a finite state machine and shows better results than those of previous algorithms.

• 한국멀티미디어학회논문지
• /
• 제11권12호
• /
• pp.1739-1748
• /
• 2008

When we conduct a data mining procedure on sample data sources, several rules are generated. But some rules are redundant or logically disjoint and therefore they can be removed. We suggest a new rule minimization algorithm inspired from logic synthesis to improve comprehensibility and eliminate redundant rules. The method can merge several relevant rules into one based on data mining and logic synthesis without high loss of accuracy. In case of two or more rules are candidates to be merged, we merge the rules with the attribute having the lowest information gain. To show the proposed method could be a reasonable solution, we applied the proposed approach to a problem domain constructing user preferred ontology in anti-spam systems.

• 대한음성학회지:말소리
• /
• 제43호
• /
• pp.89-99
• /
• 2002

Recently, researches into ways of improving large vocabulary continuous speech recognition and speech synthesis are being carried out intensively as the field of speech information technology is progressing rapidly. In the field of speech recognition, developments of stochastic methods such as HMM require large amount of speech data for training, and also in the field of speech synthesis, recent practices show that synthesis of better quality can be produced by selecting and connecting only the variable size of speech data from the large amount of speech data. In this paper we design and discuss linguistic contents for speech copora for speech recognition and synthesis to be shared in common.

• 소음진동
• /
• 제6권1호
• /
• pp.97-106
• /
• 1996

This paper presents systematic study of the experimental application of a free-interfaced component mode synthesis method. In the free-interfaced component mode synthesis method, an error the to truncated higher modes and neglected ineria loadings on a component from the connected component is inherent. Also, it is difficult to directly use experimental modal data in a modal synthesis method which links experimental model to finite-element model because of many inconsistencies between experimentally obtained and analytically obtained modal vectors and missing degrees-of-freedom (DOFs) such as rotational DOFs. In order to solve these problems, three methods, the first one based on attaching auxiliary weights to the connection points, the second one utillizing the normalization of experimental modal vector, and the third one generating smoothed and expanded experimental mode shapes, are studied in this paper. Finally, the study is illustrated for a flat-plate structure by using simulated and measured experimental data.

• 한국음향학회:학술대회논문집
• /
• 한국음향학회 1994년도 FIFTH WESTERN PACIFIC REGIONAL ACOUSTICS CONFERENCE SEOUL KOREA
• /
• pp.949-956
• /
• 1994

In this paper, we introduce a new speech synthesis method for Japanese and Korean arbitrary sentences using the natural speech data-base. Also, application of this method to a CAI system is discussed. In our synthesis method, a basic sentence and basic accent-phrases are selected from the data-base against a target sentence. Factors for those selections are phrase dependency structure (separation degree), number of morae, type of accent and phonemic labels. The target pitch pattern and phonemic parameter series are generated using those selected basic units. As the pitch pattern is generated using patterns which are directly extracted form real speech, it is expected to be more natural than any other pattern which is estimated by any model. Until now, we have examined this method on Japanese sentence speech and affirmed that the synthetic sound preserves human-like features fairly well. Now we extend this method to Korean sentence speech synthesis. Further more, we are trying to apply this synthesis unit to a CAI system.

• 대한전자공학회논문지
• /
• 제27권8호
• /
• pp.1303-1310
• /
• 1990

This paper describes the design and implementation of a system for automatic data path synthesis in digital system. There are four subtasks to synthesize a digital system: scheduling, register allocation, functional unit allocation and bus allocation. In this paper, force directed algorithm is used for the scheduling while new algorithms are proposed for the allocation subtasks. Synthesis results of two experimental data paths including MC6502 have shown that our proposed algorithm out goes most of previous works.

• 한국컴퓨터정보학회:학술대회논문집
• /
• 한국컴퓨터정보학회 2014년도 제49차 동계학술대회논문집 22권1호
• /
• pp.1-4
• /
• 2014

Although physical modeling synthesis is becoming more and more efficient in rich and natural high-quality sound synthesis, its high computational complexity limits its use in portable devices. This constraint motivated research of single-instruction multiple-data many-core architectures that support the tremendous amount of computations by exploiting massive parallelism inherent in physical modeling synthesis. Since no general consensus has been reached which grain sizes of many-core processors and memories provide the most efficient operation for sound synthesis, design space exploration is conducted for seven processing element (PE) configurations. To find an optimal PE configuration, each PE configuration is evaluated in terms of execution time, area and energy efficiencies. Experimental results show that all PE configurations are satisfied with the system requirements to be implemented in portable devices.

• 전자공학회논문지C
• /
• 제34C권3호
• /
• pp.1-10
• /
• 1997

We present an approach to high-level synthesis for a specific target architecture-partitioned bus architecture. In this approach, we have specific goals of minimizing data transfer length and number of buses in addition to common synthesis goals such as minimizing number of control steps and satisfying given resource constraint. Minimizing data transfer length and number of buses can be very important design goals in the era of deep submicron technology in which interconnection delay and area dominate total delay and area of the chip to be designed. in partitioned bus architecture, to get optimal solution satisfying all the goals, partitioning of operation nodes among segments and ordering of segments as well as scheduling and allocation/binding must be considered concurrently. Those additional goals may impose much more complexity on the existing high-level synthesis problem. To cope with this increased complexity and get reasonable results, we have employed two ideas in ur synthesis approach-extension of the target architecture to alleviate bus requirement for data transfer and adoption of genetic algorithm as a principal methodology for design space exploration. Experimental results show that our approach is a promising high-level synthesis mehtodology for partitioned bus architecture.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 2009년도 IWAIT
• /
• pp.28-31
• /
• 2009

In this paper, a new approach for solid texture synthesis from input volume data is presented. In the pre-process, feature vectors and a similarity set were constructed for input volume data. The feature vectors were used to construct neighboring vectors for more accurate neighborhood matching. The similarity set which recorded 3 candidates for each voxel helped more effective neighborhood matching. In the synthesis process, the pyramid synthesis method was used to synthesize solid textures from coarse to fine level. The results of the proposed approach were satisfactory.