• 제목/요약/키워드: complexity function

검색결과 824건 처리시간 0.029초

Biomechanical Analysis of Human Balance Control

  • Shin, Youngkyun;Park, Gu-Bum
    • 조명전기설비학회논문지
    • /
    • 제28권3호
    • /
    • pp.63-71
    • /
    • 2014
  • A single-inverted-pendulum model is presented to simulate and predict the passive response of human balance control. This simplified biomechanical model was comprised of a torsional spring and damper, and a lump mass. An estimation of frequency response function was conducted to parameterize the complexity. The frequency domain identification method is used to identify the parameters of the model. The equivalent viscoelastic parameters of standing body were obtained and there was good conformity between the simulation and experimental result.

Time Complexity Measurement on CUDA-based GPU Parallel Architecture of Morphology Operation

  • Izmantoko, Yonny S.;Choi, Heung-Kook
    • 한국멀티미디어학회논문지
    • /
    • 제16권4호
    • /
    • pp.444-452
    • /
    • 2013
  • Operation time of a function or procedure is a thing that always needs to be optimized. Parallelizing the operation is the general method to reduce the operation time of the function. One of the most powerful parallelizing methods is using GPU. In image processing field, one of the most commonly used operations is morphology operation. Three types of morphology operations kernel, na$\ddot{i}$ve, global and shared, are presented in this paper. All kernels are made using CUDA and work parallel on GPU. Four morphology operations (erosion, dilation, opening, and closing) using square structuring element are tested on MRI images with different size to measure the speedup of the GPU implementation over CPU implementation. The results show that the speedup of dilation is similar for all kernels. However, on erosion, opening, and closing, shared kernel works faster than other kernels.

시스템 안전성평가를 통한 효율적 요건 도출방안 연구 (A Study on the Safety Requirements Establishment through System Safety Processes)

  • 유승우;정진평;이백준
    • 항공우주시스템공학회지
    • /
    • 제7권2호
    • /
    • pp.29-34
    • /
    • 2013
  • Safety requirements for aircraft and system functions include minimum performance constraints for both availability and integrity of the function. These safety requirements should be determined by conducting a safety assessment. The depths and contents of aircraft system safety assessment vary depending on factors such as the complexity of the system, how critical the system is to flight safety, what volume of experience is available on the type of system and the novelty and complexity of the technologies being used. Requirements that are defined to prevent failure conditions or to provide safety related functions should be uniquely identified and traceable through the levels of development. This will ensure visibility of the safety requirements at the software and electronic hardware design level. This paper has prepared to study on promoting the efficiency of establishing hierarchical safety requirements from aircraft level function to item level through system safety processes.

System-level Function and Architecture Codesign for Optimization of MPEG Encoder

  • Choi, Jin-Ku;Togawa, Nozomu;Yanagisawa, Masao;Ohtsuki, Tatsuo
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2002년도 ITC-CSCC -3
    • /
    • pp.1736-1739
    • /
    • 2002
  • The advanced in semiconductor, hardware, and software technologies enables the integration of more com- plex systems and the increasing design complexity. As system design complexity becomes more complicated, System-level design based on the If block and processor model is more needed in most of the RTL level or low level. In this paper, we present a novel approach fur the system-level design, which satisfies the various required constraints and an optimization method of image encoder based on codesign of function, algorithm, and architecture. In addition, we show an MPEG-4 encoder as a design case study. The best tradeoffs between algorithm and architecture are necessary to deliver the design with satisfying performance and area constraints. The evaluations provide the effective optimization of motion estimation, which is in charge of an amount of performance in the MPEG-4 encoder module.

  • PDF

통신 소프트웨어의 복잡도 분석 사례 연구 (An analysis of the switching Software Matrics : Case study)

  • 이재기;신상권;남상식;김창봉
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2002년도 하계종합학술대회 논문집(1)
    • /
    • pp.409-412
    • /
    • 2002
  • The software complexity model makes an estimated of the product software. For a practice of software managed, need to guideline of the static analysis. Especially, Software complexity model introduced for the estimation of software quantity. In case of measurement the software matrices, its need for us to analysis of software qualify and products. In this paper, we represent that the analysis of function point, control structure and interface, volume matrices in various aspect of switching software. Others, their results utilized similar of project and system development.

  • PDF

Complexity Issues of Perfect Roman Domination in Graphs

  • Chakradhar, Padamutham;Reddy, Palagiri Venkata Subba
    • Kyungpook Mathematical Journal
    • /
    • 제61권3호
    • /
    • pp.661-669
    • /
    • 2021
  • For a simple, undirected graph G = (V, E), a perfect Roman dominating function (PRDF) f : V → {0, 1, 2} has the property that, every vertex u with f(u) = 0 is adjacent to exactly one vertex v for which f(v) = 2. The weight of a PRDF is the sum f(V) = ∑v∈V f(v). The minimum weight of a PRDF is called the perfect Roman domination number, denoted by γRP(G). Given a graph G and a positive integer k, the PRDF problem is to check whether G has a perfect Roman dominating function of weight at most k. In this paper, we first investigate the complexity of PRDF problem for some subclasses of bipartite graphs namely, star convex bipartite graphs and comb convex bipartite graphs. Then we show that PRDF problem is linear time solvable for bounded tree-width graphs, chain graphs and threshold graphs, a subclass of split graphs.

On the Minimization of the Multi-output Switching Function by Using the Intersection Table

  • Hwang, Hee-Yeung;Cho, Dong-Sub;Kim, Ho-Kyum
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1979년도 하계 전자.전기연합학술발표회논문집
    • /
    • pp.26-28
    • /
    • 1979
  • The optimal selection of Prime Implications for the multi-output switching function is difficult task, as the input variables increase. This paper is concerned with the technique for the minimization of the multi-output switching function using the intersection table. This procedure is applicable to both manual and computer-programmed realization without complexity.

  • PDF

블럭펄스함수를 이용한 Singular 시스템 해석의 새로운 접근 (Analysis of singular systems via block pulse function : Some new results)

  • 안비오;진준하;김병기
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1998년도 추계학술대회 논문집 학회본부 B
    • /
    • pp.410-412
    • /
    • 1998
  • Some resent papers deals with the solution of LTI singular systems described in state-space via orthogonal functions. There are some complexity to derive the solution because all the previous works[2]-[5] used orthogonal function's integral operation. Therefore, in this paper, some new results are introduced by using a differential operation of orthogonal function to solve the LTI singular systems.

  • PDF

OFDM 신호의 PAPR 감소를 위한 낮은 계산 복잡도를 갖는 PTS 기법 (PTS Technique with Low Computational Complexity for PAPR Reduction of OFDM Signals)

  • 공민한;송문규
    • 대한전자공학회논문지TC
    • /
    • 제45권1호
    • /
    • pp.8-13
    • /
    • 2008
  • 전송 신호의 높은 PAPR(Peak-to-Average Power Ratio)은 OFDM(Orthogonal Frequency Division Multiplexing)의 주된 문제점중의 하나이다. PTS(Partial Transmit Sequences) 기법은 OFDM 신호의 PAPR의 통계를 개선하는 기법이다. 그러나 PTS 기법에서 위상 가중치의 선택을 위한 계산 복잡도는 서브블록의 수에 따라 지수적으로 증가한다. 본 논문에서는 위상 가중치 값의 제한이 없고 탐색을 위해 부가적인 연산이 불필요한 탐색 알고리즘을 제안한다. 제안하는 탐색 알고리즘의 성능을 평가하기 위해 PAPR의 CCDF(Complementary Cumulative Distribution Function)와 계산 복잡도를 완전 탐색과 비교한다. 시뮬레이션을 통하여 제안한 탐색 알고리즘은 완전 탐색과 비교할 때 약간의 성능 저하를 가지고 계산 복잡도를 상당히 낮출 수 있음을 보였다.

복식 디자인에 표현된 의미적 열린 구조 (A Study on Meaning of Open Structure in Clothing Design)

  • 조애래;김영인
    • 복식
    • /
    • 제56권9호
    • /
    • pp.1-13
    • /
    • 2006
  • The purpose of this study is to apply a concept of open structure to clothing design and to verify the characteristics found in the various types of clothing which has open structure. The literatures from various academic fields including philosophy, literature, social science, architecture, and fine arts are investigated to define the concept of openness and to analyze it from the perspectives both of the visual and of the moaning of openness. This paper is to identify the types and the characteristics of clothing by future intention, complexity, discontinuity of open structure. By closely examining fashion design after 1980s found in fashion collection publications and designer's websites, the results of this study are as follows: first, the concept of openness can be classified into two different levels, that is, visual and meaning, secondly, in clothing the concept of open structure is applied to the meaning side by future intention, by complexity and by discontinuity. Open structure through future Intention has new content and interpretation and must have the possibility of intelligence awakening, future guidance and basic contents. Open structure through complexity has secondary function exists concurrent with the shape key example is the smart clothes with the digital functions. It has functions of amusement, supplement and protective, and is future clothes which satisfies with health, welfare, desire of beauty. Open structure with discontinuity is clothes with dramatic changes in system, structures and states. Structure can be changed by silhouette, detail, or fabric, material, or dramatic and practical function as tools in terms of productions and environment. This study can help to formulate and to integrate the concept of open structure in clothing with various phases and enhance the value of clothes by showing an application of the concept of openness to the clothing in meaning level.