• Title/Summary/Keyword: 정렬문제

Search Result 294, Processing Time 0.024 seconds

An Analysis on the Roles and Strategies of Imagistic Simulation Observed in Mental Simulation about Problematic Situations of Prediction (예측의 문제 상황에 대한 멘탈 시뮬레이션에서 나타난 심상 시뮬레이션의 역할과 전략 분석)

  • Ko, Min-Seok;Yang, Il-Ho
    • Journal of The Korean Association For Science Education
    • /
    • v.34 no.3
    • /
    • pp.247-260
    • /
    • 2014
  • Purpose of this study is to analyze the roles and strategies of imagistic simulation observed in mental simulation about problematic situation of prediction, and thereby identify the process of generating prediction, explanation and sophistication. For this study, a framework for mental simulation process and strategy based on literary research was developed and content was validated from four experts of science education. This study was participated by 10 preliminary elementary school teachers, and a total of 20 cases were gathered for two thought experiment tasks based on the think-aloud method. The results were as follows: First, mental simulation process described based on the seven elements of 'perception,' 'interpretation,' 'statement of initial representation,' 'running imagistic simulation,' 'identifying result of simulation,' 'identifying alignment' and 'restatement structured representation.' The study confirmed that initial representation by interpreting related concepts and running imagistic simulation a number of times to develop explanation and prediction. Second, the study identified the use of strategies to enhance simulation such as 'zoom in,' 'partition,' 'dimensional enhancement,' 'dimensional reduction,' 'remove,' 'replace' and 'extreme case.' Running spatial transformation that uses strategy to enhance simulation contributed to discovering mechanism elements in problematic situations.

Experimental Vibration Analysis of Vehicle Body-Engine Systems by Transfer Function Synthesis Method (전달함수합성법에 의한 차체-엔진계의 실험적 진동해석)

  • 정의봉;안세진;김원영
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 1995.10a
    • /
    • pp.289-295
    • /
    • 1995
  • 구조물의 동적부하에 대한 동적변형 응답을 정확히 예측하고, Over Design이나 Under Design이 아닌 합리적인 설계방안의 개발은 중요한 과제이다. 동적강도해석이나 소음 승차감과 같은 진동 및 충격에 기인하는 제반 문제를 복잡한 구조물을 대상으로 합리적으로 처리하기 위한 Dynamic Design Analysis는 높은 신뢰성의 추구와 더불어 필요불가결한 기술이 되고 있다. 동적해석 방법으로는 현재 유한요소법이 널리 사용되고 있으며 여러 종류의 범용 프로그램들이 보급되어 있는 실정이다. 그러나 특히 동적문제에 있어서는 형상이나 거동이 복잡한 구조물의 경우, 또는 차량의 차체와 같이 많은 장착물이 부착된 경우에는 유한요소법의 적용이 곤란하여, 지금까지 대처할 수 있는 유용한 방법이 없었다. 따라서 비교적 용이하고 간단하게 적용가능한 진동실험을 기초로 한 구조물의 동적 응답해석 및 설계 방안의 개발이 필요하다. 본 연구에서는 진동시험으로 얻어진 부분구조물의 응답특성과 결합특성으로부터 결합 후의 응답특성을 예측할 수 있는 방법을 전달함수합성이론을 기초로하여 프로그래밍 package화 한다. 그리고 평판구조물에 대하여 진동시험과 컴퓨터 시뮬레이션을 통하여 개발된 방법의 타당성을 검증한다. 또한 실제 차량에서 차체만의 진동시험과 엔진의 자유진동시험에 의한 시험데이터로부터 차체와 엔진이 마운트 결합된 후의 진동특성을 예측한다. 진동시험시에 입력과 출력에 노이즈가 필연적으로 혼입되어 주파수응답함수의 크기(magnitude)와 위상(phase)을 왜곡시킨다. 특히 위상의 왜곡은 복소수연산을 하는 전달함수합성법의 결과에 중요한 영향을 미치게 된다. 본 연구에서는 데이타 획득시 입력과 출력의 시간지연으로 생기는 위상왜곡을 보정하는 방법을 제시하고, 그 개선 정도를 조사한다.는 소견의 확실도로서 가능성을 표현한 것이다. 예를 들면, 진동진폭 스펙트럼상에 2X 성분이 상당히 크게 나타나 정렬불량의 가능성이 0.7 정도라고 판정하는 것 등은 이러한 수치적진리치를 이용하는 방법이다. 그러나 상기의 수치적 표현만으로는 확실도를 한개의 수치로서 대표하게 하는 것은 진단의 정밀도에 문제가 있을 것으로 생각된다. 따라서 언어적진리치가 도입되어 [상당히 확실], [확실], [약간 확실] 등의 언어적인 표현을 이용하여 애매성을 표현하게 되었다. 본 논문에서는 간이진단 결과로부터 추출된 애매한 진단결과중에서 가장 가능성이 높은 이상원인을 복수로 선정하고, 여러 종류의 수치화할 수 없는 언어적(linguistic)인 정보ㄷㄹ을 if-then 형식의 퍼지추론으로 종합하는 회전기계의 이상진단을 위한 정밀진단 알고리즘을 제안하고 그 유용성을 검토한다. 존재하여도 모우드 변수들을 항상 정확하게 구할 수 있으며, 또한 알고리즘의 안정성이 보장된 것이다.. 여기서는 실험실 수준의 평 판모델을 제작하고 실제 현장에서 이루어질 수 있는 진동제어 구조물에 대 한 동적실험 및 FRS를 수행하는 과정과 동일하게 따름으로써 실제 발생할 수 있는 오차나 error를 실험실내의 차원에서 파악하여 진동원을 있는 구조 물에 대한 진동제어기술을 보유하고자 한다. 이용한 해마의 부피측정은 해마경화증 환자의 진단에 있어 육안적인 MR 진단이 어려운 제한된 경우에만 실제적 도움을 줄 수 있는 보조적인 방법으로 생각된다.ofile whereas relaxivity at high field is not affected by τS. On the other hand, the change in τV does not affect low field profile but strongly in fluences on bot

  • PDF

An Implementation of an Edge-based Algorithm for Separating and Intersecting Spherical Polygons (구 볼록 다각형 들의 분리 및 교차를 위한 간선 기반 알고리즘의 구현)

  • Ha, Jong-Seong;Cheon, Eun-Hong
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.28 no.9
    • /
    • pp.479-490
    • /
    • 2001
  • In this paper, we consider the method of partitioning a sphere into faces with a set of spherical convex polygons $\Gamma$=${P_1...P_n}$ for determining the maximum of minimum intersection. This problem is commonly related with five geometric problems that fin the densest hemisphere containing the maximum subset of $\Gamma$, a great circle separating $\Gamma$, a great circle bisecting $\Gamma$ and a great circle intersecting the minimum or maximum subset of $\Gamma$. In order to efficiently compute the minimum or maximum intersection of spherical polygons. we take the approach of edge-based partition, in which the ownerships of edges rather than faces are manipulated as the sphere is incrementally partitioned by each of the polygons. Finally, by gathering the unordered split edges with the maximum number of ownerships. we approximately obtain the centroids of the solution faces without constructing their boundaries. Our algorithm for finding the maximum intersection is analyzed to have an efficient time complexity O(nv) where n and v respectively, are the numbers of polygons and all vertices. Furthermore, it is practical from the view of implementation, since it computes numerical values. robustly and deals with all the degenerate cases, Using the similar approach, the boundary of a general intersection can be constructed in O(nv+LlogL) time, where : is the output-senstive number of solution edges.

  • PDF

An Empirical Investigation into the Effect of the Factors on the Innovation Performance of FinTech Firms (핀테크 기업의 혁신성과에 영향을 미치는 요인에 관한 실증연구)

  • Bo Seong Yun;Yong Jin Kim
    • Information Systems Review
    • /
    • v.22 no.3
    • /
    • pp.59-80
    • /
    • 2020
  • Excellent FinTech firms create value by finding customer needs or addressing customer problems to provide customers with differentiated solutions through information technologies and organizational innovation capability. Accordingly, the survival and growth of FinTech firms rely on the innovation performance for solving customer problems. This study assumes that IT relatedness and entrepreneurial culture play a mediating role in the relationship between service orientation and innovation performance. To examine it, designed and demonstrated is a structural model from the perspective of dynamic organizational capability. The results show that IT relatedness and entrepreneurial culture play a mediating role between service orientation and innovation performance. Although IT relatedness and entrepreneurial culture were partial mediators in each divided model, the integration model showed there was no direct effect of service orientation on innovation performance. The practical implication is that FinTech companies need to understand customer problems accurately, set up appropriate service goals and align all strategies to achieve them. With these strategic alignments, higher innovation performance can be achieved by enabling IT resources and capabilities to be actively utilized in all functions of the organization and institutionalizing the entrepreneurial culture.

Performance Analysis of Frequent Pattern Mining with Multiple Minimum Supports (다중 최소 임계치 기반 빈발 패턴 마이닝의 성능분석)

  • Ryang, Heungmo;Yun, Unil
    • Journal of Internet Computing and Services
    • /
    • v.14 no.6
    • /
    • pp.1-8
    • /
    • 2013
  • Data mining techniques are used to find important and meaningful information from huge databases, and pattern mining is one of the significant data mining techniques. Pattern mining is a method of discovering useful patterns from the huge databases. Frequent pattern mining which is one of the pattern mining extracts patterns having higher frequencies than a minimum support threshold from databases, and the patterns are called frequent patterns. Traditional frequent pattern mining is based on a single minimum support threshold for the whole database to perform mining frequent patterns. This single support model implicitly supposes that all of the items in the database have the same nature. In real world applications, however, each item in databases can have relative characteristics, and thus an appropriate pattern mining technique which reflects the characteristics is required. In the framework of frequent pattern mining, where the natures of items are not considered, it needs to set the single minimum support threshold to a too low value for mining patterns containing rare items. It leads to too many patterns including meaningless items though. In contrast, we cannot mine any pattern if a too high threshold is used. This dilemma is called the rare item problem. To solve this problem, the initial researches proposed approximate approaches which split data into several groups according to item frequencies or group related rare items. However, these methods cannot find all of the frequent patterns including rare frequent patterns due to being based on approximate techniques. Hence, pattern mining model with multiple minimum supports is proposed in order to solve the rare item problem. In the model, each item has a corresponding minimum support threshold, called MIS (Minimum Item Support), and it is calculated based on item frequencies in databases. The multiple minimum supports model finds all of the rare frequent patterns without generating meaningless patterns and losing significant patterns by applying the MIS. Meanwhile, candidate patterns are extracted during a process of mining frequent patterns, and the only single minimum support is compared with frequencies of the candidate patterns in the single minimum support model. Therefore, the characteristics of items consist of the candidate patterns are not reflected. In addition, the rare item problem occurs in the model. In order to address this issue in the multiple minimum supports model, the minimum MIS value among all of the values of items in a candidate pattern is used as a minimum support threshold with respect to the candidate pattern for considering its characteristics. For efficiently mining frequent patterns including rare frequent patterns by adopting the above concept, tree based algorithms of the multiple minimum supports model sort items in a tree according to MIS descending order in contrast to those of the single minimum support model, where the items are ordered in frequency descending order. In this paper, we study the characteristics of the frequent pattern mining based on multiple minimum supports and conduct performance evaluation with a general frequent pattern mining algorithm in terms of runtime, memory usage, and scalability. Experimental results show that the multiple minimum supports based algorithm outperforms the single minimum support based one and demands more memory usage for MIS information. Moreover, the compared algorithms have a good scalability in the results.

Analysis of Parallel Interference Cancellation with the Improved Initial Stage (초기단을 개선시킨 병렬형 간섭 제거기에 관한 분석)

  • 염순진;정재윤;박용완
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.4A
    • /
    • pp.464-470
    • /
    • 2000
  • In this paper, we introduce a modified interference cancellation scheme to overcome MAI(Multiple Access Interference) in DS-CDMA. Among ICs(Interference Cancellers), PIC(Parallel Interference Canceller) requires the more stages to have the better BER(Bit Error Rate), and SIC(Successive Interference Canceller) faces the problems of power reordering and large delays. To resolve the problems of them, we propose a modified interference cancellation scheme combining SIC and PIC. The proposed interference canceller has improved the performance through the total received signal applied sorting method is fed into the initial stage. Its structure extracts the good characteristics because of the input signal removed MAI in the initial stage. The characteristics of the proposed system are as follows (1) smaller delay, and the strongest user signal is also reduced to MAI(unlike SIC), (2) it has the good BER performance only using fewer stages (unlike PIC).

  • PDF

Range finding algorithm of equidistance stereo catadioptric mirror (등거리 스테레오 전방위 렌즈 영상에 대한 위치 측정 알고리즘)

  • Choi, Young-Ho
    • Journal of Internet Computing and Services
    • /
    • v.6 no.6
    • /
    • pp.149-161
    • /
    • 2005
  • Catadioptric mirrors are widely used in automatic surveillance system. The major drawback of catadioptric mirror is its unequal image resolution. Equidistance catadioptric mirror can be the solution to this problem. Even double panoramic structure can generate stereo images with single camera system. So two images obtained from double panoramic equidistance catadioptric mirror can be used in finding the depth and height values of object's points. But compared to the single catadioptric mirror. the image size of double panoramic system is relatively small. This leads to the severe accuracy problem in estimation. The exact axial alignment and the exact mount of mirror are the sources that can be avoided but the focal length variation is inevitable. In this paper, the effects of focal length variation on the computation of depth and height of object' point are explained and the effective focal length finding algorithm, using the assumption that the object's viewing angles are almost same in stereo images, is presented.

  • PDF

Single memory based scan converter for embedded JPEG encoder (내장형 JPEG 압축을 위한 단일 메모리 기반의 스캔 순서 변환기)

  • Park Hyun-Sang
    • Journal of Broadcast Engineering
    • /
    • v.11 no.3 s.32
    • /
    • pp.320-325
    • /
    • 2006
  • An image is partitioned into non-overlapping $8{\times}8$ blocks fer JPEG compression. A scan order converter is placed before the JPEG encoder to provide $8{\times}8$ blocks from the pixels in raster scan order. In general, its architecture requires two line memories for storing eight lines separately to allow the concurrent memory access by both the camera and JPEG processors. Although such architecture is simple to be implemented, it can be inefficient due to too excessive memory requirement as the image resolution increases. However, no deterministic addressing equation has been developed for scan conversion. In this paper, an effective memory addressing algorithm is proposed that can be devised only by adders and subtracters to implement a scan converter based on the single line memory.

Torsional Vibration Control of a Rotating Chamber Shaft System Using Electrorheological Fluid (ER 유체를 이용한 회전식 약실 축계의 비틀림 진동 제어)

  • Lim, Seung-Chul;Kim, Ki-Kap;Kil, Seong-Jin;Shim, Jeong-Soo;Cha, Ki-Up
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.35 no.1
    • /
    • pp.17-24
    • /
    • 2011
  • It is reported that an intermittently rotating chamber system will improve the ratio of firepower to armament space in the case of mid-calibre automatic guns. However, the parallel index, which is a main component of the system, tends to be torsionally flexible due to the low lateral stiffness of cam followers on the index turret. This may cause the shaft system connecting the turret with the chamber prone to considerable residual torsional vibration so that serious misalignment problems occur during ammunition loading and firing processes. Herein, an electrorhelogical (ER) fluid actuator that can suppress such vibrations and the associated semiactive control algorithm are proposed. By mathematical modeling and computer simulations, the performance of the entire system is proved satisfactory.

Korean Unknown-noun Recognition using Strings Following Nouns in Words (명사후문자열을 이용한 미등록어 인식)

  • Park, Ki-Tak;Seo, Young-Hoon
    • The Journal of the Korea Contents Association
    • /
    • v.17 no.4
    • /
    • pp.576-584
    • /
    • 2017
  • Unknown nouns which are not in a dictionary make problems not only morphological analysis but also almost all natural language processing area. This paper describes a recognition method for Korean unknown nouns using strings following nouns such as postposition, suffix and postposition, suffix and eomi, etc. We collect and sort words including nouns from documents and divide a word including unknown noun into two parts, candidate noun and string following the noun, by finding same prefix morphemes from more than two unknown words. We use information of strings following nouns extracted from Sejong corpus and decide unknown noun finally. We obtain 99.64% precision and 99.46% recall for unknown nouns occurred more than two forms in news of two portal sites.