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

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

MJH 해쉬 함수 역상 공격 (A Preimage Attack on the MJH Hash Function)

  • 이주영;김종성
    • 정보보호학회논문지
    • /
    • 제26권2호
    • /
    • pp.315-318
    • /
    • 2016
  • 본 논문에서 우리는 이중 블록 길이 블록 암호 기반 해쉬 함수 MJH에 대한 새로운 역상 공격을 제안한다. MJH 해쉬 함수가 n 비트 블록 암호에 기반하여 2n 비트를 출력할 때, 기존 공격은 $O(2^{3n/2})$회의 질의를 요구하였으나, 본 논문에서는 이를 더욱 개선시켜 $O(n2^n)$의 계산량 및 같은 수준의 메모리를 사용하여 역상을 찾을 수 있음을 보인다.

커크우드-버프 용액 이론 (Kirkwood-Buff Solution Theory)

  • 임경희
    • 한국응용과학기술학회지
    • /
    • 제27권4호
    • /
    • pp.452-460
    • /
    • 2010
  • Any theory of liquid should account for interactions between molecules, since molecules in a liquid are close to each other. For this matter statistical-mechanical methodology has been used and various models have been proposed on the basis of this methodology. Among them Kirkwood-Buff solution theory has attracted a lot of interest, because it is regarded as being the most powerful. In this article Kirkwood-Buff solution theory is revisited and its key equations are derived. On the way to these equations, the concepts of pair correlation function, radial distribution function, Kirkwood-Buff integration are explained and implemented. Since complexity of statical mechanics involved in this theory, the equations are applied to one-component systems and the results are compared to those obtained by classical thermodynamics. This may be a simple way for Kirkwood-Buff solution theory to be examined for its validity.

점진적 학습영역 확장에 의한 다층인식자의 학습능력 향상 (Improvement of Learning Capabilities in Multilayer Perceptron by Progressively Enlarging the Learning Domain)

  • 최종호;신성식;최진영
    • 전자공학회논문지B
    • /
    • 제29B권1호
    • /
    • pp.94-101
    • /
    • 1992
  • The multilayer perceptron, trained by the error back-propagation learning rule, has been known as a mapping network which can represent arbitrary functions. However depending on the complexity of a function and the initial weights of the multilayer perceptron, the error back-propagation learning may fall into a local minimum or a flat area which may require a long learning time or lead to unsuccessful learning. To solve such difficulties in training the multilayer perceptron by standard error back-propagation learning rule, the paper proposes a learning method which progressively enlarges the learning domain from a small area to the entire region. The proposed method is devised from the investigation on the roles of hidden nodes and connection weights in the multilayer perceptron which approximates a function of one variable. The validity of the proposed method was illustrated through simulations for a function of one variable and a function of two variable with many extremal points.

  • PDF

A Vtub-Shaped Hazard Rate Function with Applications to System Safety

  • Pham, Hoang
    • International Journal of Reliability and Applications
    • /
    • 제3권1호
    • /
    • pp.1-16
    • /
    • 2002
  • In reliability engineering, the bathtub-shaped hazard rates play an important role in survival analysis and many other applications as well. For the bathtub-shaped, initially the hazard rate decreases from a relatively high value due to manufacturing defects or infant mortality to a relatively stable middle useful life value and then slowly increases with the onset of old age or wear out. In this paper, we present a new two-parameter lifetime distribution function, called the Loglog distribution, with Vtub-shaped hazard rate function. We illustrate the usefulness of the new Vtub-shaped hazard rate function by evaluating the reliability of several helicopter parts based on the data obtained in the maintenance malfunction information reporting system database collected from October 1995 to September 1999. We develop the S-Plus add-in software tool, called Reliability and Safety Assessment (RSA), to calculate reliability measures include mean time to failure, mean residual function, and confidence Intervals of the two helicopter critical parts. We use the mean squared error to compare relative goodness of fit test of the distribution models include normal, lognormal, and Weibull within the two data sets. This research indicates that the result of the new Vtub-shaped hazard rate function is worth the extra function-complexity for a better relative fit. More application in broader validation of this conclusion is needed using other data sets for reliability modeling in a general industrial setting.

  • PDF

MC-CDMA 시스템용 PN 부호 동기획득 구조의 구현 (Architecture Design of PN Code Acquisition for MC-CDMA Systems)

  • 노정민;이성주;김재석
    • 대한전자공학회논문지SD
    • /
    • 제40권2호
    • /
    • pp.117-125
    • /
    • 2003
  • 본 논문에서는 저전력 및 고속의 특성을 갖는 MC-CDMA 시스템용의 동기획득 구조를 제안한다. 이를 위해 탐색핑거라는 새로운 구조를 설계하였다. 제안한 탐색핑거는 기존의 핑거를 수정한 구조로써, 원래의 핑거 기능 이외에 탐색기의 기능을 갖고 있다. 초기 동기획득시 탐색핑거는 탐색기와 함께 탐색기의 기능을 수행함으로써 초기 동기획득 시간을 단축시킨다. 그리고 초기 동기획득이 끝난 후에 본래의 핑거로 동작한다. 제안한 구조를 5㎒ MC-CAMA 시스템에 적용할 경우, 동기회득을 수행하는 블록에서 게이트카운트론 비교하였을 때, 약 63%의 하드웨어 복잡도 감소와 동시에 동기획득 시간을 5배 단축할 수 있었다.또한, 20㎒ MC-CDMA에서는, 약 75%의 하드웨어 복잡도를 감소시키면서 평균 동기 획득 시간을 최대 19배 단축할 수 있었다.

Computation and Communication Efficient Key Distribution Protocol for Secure Multicast Communication

  • Vijayakumar, P.;Bose, S.;Kannan, A.;Jegatha Deborah, L.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제7권4호
    • /
    • pp.878-894
    • /
    • 2013
  • Secure multimedia multicast applications involve group communications where group membership requires secured dynamic key generation and updating operations. Such operations usually consume high computation time and therefore designing a key distribution protocol with reduced computation time is necessary for multicast applications. In this paper, we propose a new key distribution protocol that focuses on two aspects. The first one aims at the reduction of computation complexity by performing lesser numbers of multiplication operations using a ternary-tree approach during key updating. Moreover, it aims to optimize the number of multiplication operations by using the existing Karatsuba divide and conquer approach for fast multiplication. The second aspect aims at reducing the amount of information communicated to the group members during the update operations in the key content. The proposed algorithm has been evaluated based on computation and communication complexity and a comparative performance analysis of various key distribution protocols is provided. Moreover, it has been observed that the proposed algorithm reduces the computation and communication time significantly.

Optimal Buffer Allocation in Multi-Product Repairable Production Lines Based on Multi-State Reliability and Structural Complexity

  • Duan, Jianguo;Xie, Nan;Li, Lianhui
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제14권4호
    • /
    • pp.1579-1602
    • /
    • 2020
  • In the design of production system, buffer capacity allocation is a major step. Through polymorphism analysis of production capacity and production capability, this paper investigates a buffer allocation optimization problem aiming at the multi-stage production line including unreliable machines, which is concerned with maximizing the system theoretical production rate and minimizing the system state entropy for a certain amount of buffers simultaneously. Stochastic process analysis is employed to establish Markov models for repairable modular machines. Considering the complex structure, an improved vector UGF (Universal Generating Function) technique and composition operators are introduced to construct the system model. Then the measures to assess the system's multi-state reliability and structural complexity are given. Based on system theoretical production rate and system state entropy, mathematical model for buffer capacity optimization is built and optimized by a specific genetic algorithm. The feasibility and effectiveness of the proposed method is verified by an application of an engine head production line.

Resource Allocation and EE-SE Tradeoff for H-CRAN with NOMA-Based D2D Communications

  • Wang, Jingpu;Song, Xin;Dong, Li
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제14권4호
    • /
    • pp.1837-1860
    • /
    • 2020
  • We propose a general framework for studying resource allocation problem and the tradeoff between spectral efficiency (SE) and energy efficiency (EE) for downlink traffic in power domain-non-orthogonal multiple access (PD-NOMA) and device to device (D2D) based heterogeneous cloud radio access networks (H-CRANs) under imperfect channel state information (CSI). The aim is jointly optimize radio remote head (RRH) selection, spectrum allocation and power control, which is formulated as a multi-objective optimization (MOO) problem that can be solved with weighted Tchebycheff method. We propose a low-complexity algorithm to solve user association, spectrum allocation and power coordination separately. We first compute the CSI for RRHs. Then we study allocating the cell users (CUs) and D2D groups to different subchannels by constructing a bipartite graph and Hungrarian algorithm. To solve the power control and EE-SE tradeoff problems, we decompose the target function into two subproblems. Then, we utilize successive convex program approach to lower the computational complexity. Moreover, we use Lagrangian method and KKT conditions to find the global optimum with low complexity, and get a fast convergence by subgradient method. Numerical simulation results demonstrate that by using PD-NOMA technique and H-CRAN with D2D communications, the system gets good EE-SE tradeoff performance.

Sensing Performance of Efficient Cyclostationary Detector with Multiple Antennas in Multipath Fading and Lognormal Shadowing Environments

  • Zhu, Ying;Liu, Jia;Feng, Zhiyong;Zhang, Ping
    • Journal of Communications and Networks
    • /
    • 제16권2호
    • /
    • pp.162-171
    • /
    • 2014
  • Spectrum sensing is a key technical challenge for cognitive radio (CR). It is well known that multicycle cyclostationarity (MC) detection is a powerful method for spectrum sensing. However, a conventional MC detector is difficult to implement because of its high computational complexity. This paper considers reducing computational complexity by simplifying the test statistic of a conventional MC detector. On the basis of this simplification process, an improved MC detector is proposed. Compared with the conventional detector, the proposed detector has low-computational complexity and high-accuracy sensing performance. Subsequently, the sensing performance is further investigated for the cases of Rayleigh, Nakagami-m, Rician, and Rayleigh fading and lognormal shadowing channels. Furthermore, square-law combining (SLC) is introduced to improve the detection capability in fading and shadowing environments. The corresponding closed-form expressions of average detection probability are derived for each case by the moment generation function (MGF) and contour integral approaches. Finally, illustrative and analytical results show the efficiency and reliability of the proposed detector and the improvement in sensing performance by SLC in multipath fading and lognormal shadowing environments.

형태에 있어서 미학 특성의 평가를 위한 스키마 표현과 방법론의 이론적 고찰 (Shape Schema representation for Evaluation of Aesthetic value on Shape)

  • 차명열
    • 디자인학연구
    • /
    • 제16권2호
    • /
    • pp.141-150
    • /
    • 2003
  • 건축디자인을 평가하는 방법에는 상당히 맡은 요소를 고려 할 수 있다. 기능성, 구조성, 형태, 환경 등 다양한 요소를 고려하여 최종의 디자인을 생산해 낸다. 여기서 computer와 같은 자동화된 기계에 의해서 디자인이 생성된다면, 그 결과는 경우에 따라서 무수히 맡아 우리 인간의 평가 능력 범위를 넘는 수 가 있다. 따라서 디자인을 자동으로 생산할 뿐 만 아니라 자동으로 최선의 결과물을 자동적으로 평가하여 선택하는 것도 상당히 중요하다. 본 논문에서는 상기에서 언급한 요소 중 미학적 특성을 기계가 자동으로 평가하여 최적의 결과물을 선택할 수 있도록 평가 방법을 제시하였다. 평가 방법은 고전적으로 내려오는 미적 평가방법의 하나인 질서와 무질서의 상관 관계를 측정하는 것으로 이는 형태요소와 공간관계를 나타내는 형태 디자인 지식의 스키마적 표현을 적용한다.

  • PDF