• Title/Summary/Keyword: 상대 복잡도

Search Result 191, Processing Time 0.027 seconds

An Abstraction Method for State Minimization based on Syntactic and Semantic Patterns in the Execution Space of Real-Time Systems (실시간 시스템의 실행 공간상에서 구문 및 의미패턴에 기반한 상태 최소화를 위한 추상화 방법)

  • 박지연;조기환;이문근
    • Journal of KIISE:Software and Applications
    • /
    • v.30 no.1_2
    • /
    • pp.103-116
    • /
    • 2003
  • States explosion due to composition of spaces of data, temporal, and locational values is one of the well-known critical problems which cause difficulty in understanding and analysing real-time systems specified with state-based formal methods. In order to overcome this problem, this paper presents an abstraction method for state minimization based on an abstraction in system specification and an abstraction in system execution. The first is named the syntactic in system specification and an abstraction in system execution. The first is named the syntactic abstraction, through which the patterns of the unconditionally internalized computation and the repetition and selection structures are abstracted. The latter is named the semantic abstraction, through which the patterns of the execution space represented with data. Through the abstractions, the components of a system in specification and execution model is hierarchically organized. The system can be analyzed briefly in the upper level in an skeleton manner with low complexity. The system, however, can be abstraction method for the state minimization and the decrease in analysis complexity through the abstraction with examples.

A Hand Gesture Recognition System for Interactive Virtual Environment (인터액티브 가상 환경을 위한 손 제스처 인식 시스템)

  • 조오영;김형곤;고성제;안상철
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.36S no.4
    • /
    • pp.70-82
    • /
    • 1999
  • 본 논문에서는 복잡한 영상에서 추출해낸 손 영역으로부터 제스처를 인식하여 인간과 컴퓨터의 상호작용(HCI, Human-Computer Interaction)을 위한 보다 자연스러운 인터페이스를 제공한다. 제안하는 방법은 정규화된 RGB 색상 공간에 정의한 피부색의 가우시안 분포를 이용해 조명의 변화나 개인의 차이에도 안정적으로 손 영역을 추출하며, 배경에 대한 상대적인 움직임을 이용해 복잡한 영상에서도 효과적으로 손 영역을 추출해 낸다. 추출된 손 영역은 RBF(Radial Basis Function) 신경망을 이용해 각 제스처로 인식된다. 가상 환경과의 상호작용을 제공하기 위해 두 종류의 기본적인 정적 제스처들을 정의하며 간단한 구문론적 규칙을 사용해 하나 이상의 인식 결과들을 조합함으로써 적은 수의 제스처들만으로 보다 효율적이고 다양한 상호작용이 가능하게 한다. 제안하는 시스템은 TM320C80 DSP 칩을 사용하여 구현되었으며 300×240 영상을 12Hz로 처리함으로써 빠른 속도로 가상 환경의 인터페이스를 제공한다.

  • PDF

Dynamic Characteristic Analysis of CNC Grinding Center (High-speed CNC Grinding Center구조의 동적거동 해석)

  • 박종권;노승국;성활경
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 1996.11a
    • /
    • pp.648-652
    • /
    • 1996
  • Grinding Center(GC)는 머시닝센터가 갖는 드릴링, 태핑 등의 절삭가공의 수행은 물론 주축의 고속화, 이송계의 고정밀화를 토대로 연삭숫돌의 절삭성 회복과 다듬질면의 거칠기를 확보하기 위한 기계로서 Dressing/Truing장치, 기상계측 장치, CNC기능을 구비하여 테이블과 공구간에 3차원의 상대운동을 시킴으로써 평면연삭, 내면연삭, 홈연삭, 캠연삭 등의 복잡한 형상의 연삭가공에 대해서도 공정을 집약화 할 수 있는 기계이다.(중략)

  • PDF

Local Information-based Algorithm for Efficient Calculation of Betweenness Centrality in Social Networks (사회관계망에서 효율적인 매개 중심도 계산을 위한 지역정보기반 알고리즘)

  • Shin, Soo-Jin;Kim, Yong-hwan;Kim, Chan-Myung;Han, Youn-Hee
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2014.11a
    • /
    • pp.1126-1129
    • /
    • 2014
  • 사회관계망 분석에 있어서 매개중심도는 네트워크를 구성하는 노드들의 상대적인 중요도를 파악하기 위한 척도로서 오랫동안 사용되어 왔다. 그러나 이러한 매개중심도를 계산하기 위한 계산 복잡도가 높기 때문에 대규모 사회관계망에서는 매개중심도를 계산하기란 쉽지 않은 문제이다. 본 논문에서는 네트워크를 구성하는 각각의 노드들마다 자신의 지역정보를 활용하여 구성한 네트워크에서 매개중심도를 산출함으로써 시간복잡도를 줄이는 한편 지역정보 기반의 네트워크의 특징을 분석함으로써 매개중심도를 더 빠르게 산출할 수 있는 알고리즘을 제안한다. 그리고 실제 소셜 네트워크에서의 실험을 통하여 제안 알고리즘이 기존 알고리즘에 비해 매개중심도를 더 빠르게 산출함을 보인다.

Dynamic Behavior Characteristics of Group Piles with Relative Density in Sandy Soil (건조 모래지반의 상대밀도에 따른 무리말뚝의 동적거동특성)

  • Heungtae Kim;Hongsig Kang;Kusik Jeong;Kwangkuk Ahn
    • Journal of the Korean GEO-environmental Society
    • /
    • v.24 no.9
    • /
    • pp.33-40
    • /
    • 2023
  • The lateral load which is applied to the pile foundation supporting the superstructure during an earthquake is divided into the inertia force of the upper structure and the kinematic force of the ground. The inertia force and the kinematic force could cause failure to the pile foundation through different complex mechanisms. So it is necessary to predict and evaluate interaction of the ground-pile-structure properly for the seismic design of the foundation. The interaction is affected by the lateral behavior of the structure, the length of the pile, the boundary conditions of the head, and the relative density of the ground. Confining pressure and ground stiffness change accordingly when the relative density changes, and it results that the coefficient of subgrade reaction varies depending on each system. Horizontal bearing behavior and capacity of the pile foundation vary depending on lateral load condition and relative density of the sandy soil. Therefore, the 1g shaking table tests were conducted to confirm the effect of the relative density of the dried sandy soil to dynamic behavior of the group pile supporting the superstructure. The result shows that, as the relative density increases, maximum acceleration of the superstructure and the pile cap increases and decreases respectively, and the slope of the p-y curve of the pile decreases.

A Study on Bayesian Approach of Software Stochastic Reliability Superposition Model using General Order Statistics (일반 순서 통계량을 이용한 소프트웨어 신뢰확률 중첩모형에 관한 베이지안 접근에 관한 연구)

  • Lee, Byeong-Su;Kim, Hui-Cheol;Baek, Su-Gi;Jeong, Gwan-Hui;Yun, Ju-Yong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.8
    • /
    • pp.2060-2071
    • /
    • 1999
  • The complicate software failure system is defined to the superposition of the points of failure from several component point process. Because the likelihood function is difficulty in computing, we consider Gibbs sampler using iteration sampling based method. For each observed failure epoch, we applied to latent variables that indicates with component of the superposition mode. For model selection, we explored the posterior Bayesian criterion and the sum of relative errors for the comparison simple pattern with superposition model. A numerical example with NHPP simulated data set applies the thinning method proposed by Lewis and Shedler[25] is given, we consider Goel-Okumoto model and Weibull model with GOS, inference of parameter is studied. Using the posterior Bayesian criterion and the sum of relative errors, as we would expect, the superposition model is best on model under diffuse priors.

  • PDF

Design of Degree-Computationless Modified Euclidean Algorithm using Polynomial Expression (다항식 표현을 이용한 DCME 알고리즘 설계)

  • Kang, Sung-Jin;Kim, Nam-Yong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.10A
    • /
    • pp.809-815
    • /
    • 2011
  • In this paper, we have proposed and implemented a novel architecture which can be used to effectively design the modified Euclidean (ME) algorithm for key equation solver (KES) block in high-speed Reed-Solomon (RS) decoder. With polynomial expressions of newly-defined state variables for controlling each processing element (PE), the proposed architecture has simple input/output signals and requires less hardware complexity because no degree computation circuits are needed. In addition, since each PE circuit is independent of the error correcting capability t of RS codes, it has the advantage of linearly increase of the hardware complexity of KES block as t increases. For comparisons, KES block for RS(255,239,8) decoder is implemented using Verilog HDL and synthesized with 0.13um CMOS cell library. From the results, we can see that the proposed architecture can be used for a high-speed RS decoder with less gate count.

A Study on the continuous Intention of MyData Service Users Based on the Innovation Resistance Model (혁신저항모형에 기반한 마이데이터 서비스 사용자의 지속사용의도에 관한 연구)

  • Haengnam Sung;Taeho Hong;Taewon Lee
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.29 no.2
    • /
    • pp.101-117
    • /
    • 2024
  • The purpose of this study is to consider the characteristics perceived by users who utilize MyData services in the financial sector. It aims to examine how these factors influence users' understanding for sustained usage and their resistance to innovation. The research seeks to explore the relationship between users' awareness of characteristics and its impact on both enhancing comprehension for continued usage and addressing users' resistance to innovation. Utilizing a specialized survey agency, we examined the relative effects of innovation resistance factors, such as relative advantage, perceived risks, complexity, clarity and perceived ease of use on MyData service users. Furthermore, this research focuses on employing empirical analysis to validate the relationships between these factors through the survey. The findings of this study suggest that MyData service should dedicate ongoing efforts to minimize user resistance to service utilization. Specifically, it was revealed that among the innovation resistance factors, perceived ease of use, relative advantage, perceived risk, and complexity exert influence in that order.

An Improved Search Space for QRM-MLD Signal Detection for Spatially Multiplexed MIMO Systems (공간다중화 MIMO 시스템의 QRM-MLD 신호검출을 위한 개선된 탐색공간)

  • Hur, Hoon;Woo, Hyun-Myung;Yang, Won-Young;Bahng, Seung-Jae;Park, Youn-Ok;Kim, Jae-Kwon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.4A
    • /
    • pp.403-410
    • /
    • 2008
  • In this paper, we propose a variant of the QRM-MLD signal detection method that is used for spatially multiplexed multiple antenna system. The original QRM-MLD signal detection method combines the QR decomposition with the M-algorithm, thereby significantly reduces the prohibitive hardware complexity of the ML signal detection method, still achieving a near ML performance. When the number of transmitter antennas and/or constellation size are increased to achieve higher bit rate, however, its increased complexity makes the hardware implementation challenging. In an effort to overcome this drawback of the original QRM-MLD, a number of variants were proposed. A most strong variant among them, in our opinion, is the ranking method, in which the constellation points are ranked and computation is performed for only highly ranked constellation points, thereby reducing the required complexity. However, the variant using the ranking method experiences a significant performance degradation, when compared with the original QRM-MLD. In this paper, we point out the reasons of the performance degradation, and we propose a novel variant that overcomes the drawbacks. We perform a set of computer simulations to show that the proposed method achieves a near performance of the original QRM-MLD, while its computational complexity is near to that of the QRM-MLD with ranking method.

A Re-Ranking Retrieval Model based on Two-Level Similarity Relation Matrices (2단계 유사관계 행렬을 기반으로 한 순위 재조정 검색 모델)

  • 이기영;은희주;김용성
    • Journal of KIISE:Software and Applications
    • /
    • v.31 no.11
    • /
    • pp.1519-1533
    • /
    • 2004
  • When Web-based special retrieval systems for scientific field extremely restrict the expression of user's information request, the process of the information content analysis and that of the information acquisition become inconsistent. In this paper, we apply the fuzzy retrieval model to solve the high time complexity of the retrieval system by constructing a reduced term set for the term's relatively importance degree. Furthermore, we perform a cluster retrieval to reflect the user's Query exactly through the similarity relation matrix satisfying the characteristics of the fuzzy compatibility relation. We have proven the performance of a proposed re-ranking model based on the similarity union of the fuzzy retrieval model and the document cluster retrieval model.