• 제목/요약/키워드: Classical Probability

검색결과 124건 처리시간 0.033초

Investigations on coefficient of variation of extreme wind speed

  • Xu, Fuyou;Cai, Chunsheng;Zhang, Zhe
    • Wind and Structures
    • /
    • 제18권6호
    • /
    • pp.633-650
    • /
    • 2014
  • The uncertainty of extreme wind speeds is one key contributor to the uncertainty of wind loads and their effects on structures. The probability distribution of annual extreme wind speeds may be characterized using a classical Gumbel Type distribution. The expression that establishes the relationship between the extreme wind speeds at different recurrence periods and the corresponding coefficients of variation is formulated, and its efficacy is validated. The coefficients of variation are calibrated to be about 0.125 and 0.184 according to defined Chinese and US design specifications, respectively. Based on the wind data of 54 cities in China, 49 meteorological stations in the US, 3 stations in Singapore, the coefficients span intervals of (0.1, 0.35), (0.08, 0.20) and (0.06, 0.14), respectively. For hurricanes in the US, the coefficients range approximately from 0.3 to 0.4. This convenient technique is recommended as one alternative tool for coefficient of variation analyses in the future revisions of related codes. The sensitivities of coefficients of variation for 49 meteorological stations in the US are quantified and demonstrated. Some contradictions and incompatibilities can be clearly detected and illustrated by comparing the coefficients of variation obtained with different combinations of recurrence period wind data.

중앙값을 움직인 부호를 바탕으로 한 비모수 검파기: 점근 성능과 유한 표본 성능 (A Nonparametric Detector Based on Median-Shift Sign: Asymptotic and Finite Sample-Size Performance)

  • 김홍길;박소령;윤석호;이주식;송익호
    • 한국통신학회논문지
    • /
    • 제23권6호
    • /
    • pp.1454-1460
    • /
    • 1998
  • 이 논문에서는 중앙값을 움직인 부호를 바탕으로 한 검파기를 제안하고 그 점근 성능과 우한 표본 성능을 살펴본다. 이 검파기를 중앙값을 움직인 부호 검파기라 부르는데, 이는 고전적인 부호 검파기를 확장한 것이다. 먼저, 점근 최적 이동 중앙값들과 그들의 특성을 알아보고, 이 검파기의 점근 상대효율을 생각해 본다. 확률밀도함수를 알고 있는 잡음환경에서 알려진 신호를 검파하는 문제와 분포를 거의 알 수 없는 잡음에서 알려진 신호를 검파하는 문제를 다룬다.

  • PDF

Reliability-based design optimization using reliability mapping functions

  • Zhao, Weitao;Shi, Xueyan;Tang, Kai
    • Structural Engineering and Mechanics
    • /
    • 제62권2호
    • /
    • pp.125-138
    • /
    • 2017
  • Reliability-based design optimization (RBDO) is a powerful tool for design optimization when considering probabilistic characteristics of design variables. However, it is often computationally intensive because of the coupling of reliability analysis and cost minimization. In this study, the concept of reliability mapping function is defined based on the relationship between the reliability index obtained by using the mean value first order reliability method and the failure probability obtained by using an improved response surface method. Double-loop involved in the classical RBDO can be converted into single-loop by using the reliability mapping function. Since the computational effort of the mean value first order reliability method is minimal, RBDO by using reliability mapping functions should be highly efficient. Engineering examples are given to demonstrate the efficiency and accuracy of the proposed method. Numerical results indicated that the proposed method has the similar accuracy as Monte Carlo simulation, and it can obviously reduce the computational effort.

Neighbor Discovery in a Wireless Sensor Network: Multipacket Reception Capability and Physical-Layer Signal Processing

  • Jeon, Jeongho;Ephremides, Anthony
    • Journal of Communications and Networks
    • /
    • 제14권5호
    • /
    • pp.566-577
    • /
    • 2012
  • In randomly deployed networks, such as sensor networks, an important problem for each node is to discover its neighbor nodes so that the connectivity amongst nodes can be established. In this paper, we consider this problem by incorporating the physical layer parameters in contrast to the most of the previous work which assumed a collision channel. Specifically, the pilot signals that nodes transmit are successfully decoded if the strength of the received signal relative to the interference is sufficiently high. Thus, each node must extract signal parameter information from the superposition of an unknown number of received signals. This problem falls naturally in the purview of random set theory (RST) which generalizes standard probability theory by assigning sets, rather than values, to random outcomes. The contributions in the paper are twofold: First, we introduce the realistic effect of physical layer considerations in the evaluation of the performance of logical discovery algorithms; such an introduction is necessary for the accurate assessment of how an algorithm performs. Secondly, given the double uncertainty of the environment (that is, the lack of knowledge of the number of neighbors along with the lack of knowledge of the individual signal parameters), we adopt the viewpoint of RST and demonstrate its advantage relative to classical matched filter detection method.

A hybrid algorithm for the synthesis of computer-generated holograms

  • Nguyen The Anh;An Jun Won;Choe Jae Gwang;Kim Nam
    • 한국광학회:학술대회논문집
    • /
    • 한국광학회 2003년도 하계학술발표회
    • /
    • pp.60-61
    • /
    • 2003
  • A new approach to reduce the computation time of genetic algorithm (GA) for making binary phase holograms is described. Synthesized holograms having diffraction efficiency of 75.8% and uniformity of 5.8% are proven in computer simulation and experimentally demonstrated. Recently, computer-generated holograms (CGHs) having high diffraction efficiency and flexibility of design have been widely developed in many applications such as optical information processing, optical computing, optical interconnection, etc. Among proposed optimization methods, GA has become popular due to its capability of reaching nearly global. However, there exits a drawback to consider when we use the genetic algorithm. It is the large amount of computation time to construct desired holograms. One of the major reasons that the GA' s operation may be time intensive results from the expense of computing the cost function that must Fourier transform the parameters encoded on the hologram into the fitness value. In trying to remedy this drawback, Artificial Neural Network (ANN) has been put forward, allowing CGHs to be created easily and quickly (1), but the quality of reconstructed images is not high enough to use in applications of high preciseness. For that, we are in attempt to find a new approach of combiningthe good properties and performance of both the GA and ANN to make CGHs of high diffraction efficiency in a short time. The optimization of CGH using the genetic algorithm is merely a process of iteration, including selection, crossover, and mutation operators [2]. It is worth noting that the evaluation of the cost function with the aim of selecting better holograms plays an important role in the implementation of the GA. However, this evaluation process wastes much time for Fourier transforming the encoded parameters on the hologram into the value to be solved. Depending on the speed of computer, this process can even last up to ten minutes. It will be more effective if instead of merely generating random holograms in the initial process, a set of approximately desired holograms is employed. By doing so, the initial population will contain less trial holograms equivalent to the reduction of the computation time of GA's. Accordingly, a hybrid algorithm that utilizes a trained neural network to initiate the GA's procedure is proposed. Consequently, the initial population contains less random holograms and is compensated by approximately desired holograms. Figure 1 is the flowchart of the hybrid algorithm in comparison with the classical GA. The procedure of synthesizing a hologram on computer is divided into two steps. First the simulation of holograms based on ANN method [1] to acquire approximately desired holograms is carried. With a teaching data set of 9 characters obtained from the classical GA, the number of layer is 3, the number of hidden node is 100, learning rate is 0.3, and momentum is 0.5, the artificial neural network trained enables us to attain the approximately desired holograms, which are fairly good agreement with what we suggested in the theory. The second step, effect of several parameters on the operation of the hybrid algorithm is investigated. In principle, the operation of the hybrid algorithm and GA are the same except the modification of the initial step. Hence, the verified results in Ref [2] of the parameters such as the probability of crossover and mutation, the tournament size, and the crossover block size are remained unchanged, beside of the reduced population size. The reconstructed image of 76.4% diffraction efficiency and 5.4% uniformity is achieved when the population size is 30, the iteration number is 2000, the probability of crossover is 0.75, and the probability of mutation is 0.001. A comparison between the hybrid algorithm and GA in term of diffraction efficiency and computation time is also evaluated as shown in Fig. 2. With a 66.7% reduction in computation time and a 2% increase in diffraction efficiency compared to the GA method, the hybrid algorithm demonstrates its efficient performance. In the optical experiment, the phase holograms were displayed on a programmable phase modulator (model XGA). Figures 3 are pictures of diffracted patterns of the letter "0" from the holograms generated using the hybrid algorithm. Diffraction efficiency of 75.8% and uniformity of 5.8% are measured. We see that the simulation and experiment results are fairly good agreement with each other. In this paper, Genetic Algorithm and Neural Network have been successfully combined in designing CGHs. This method gives a significant reduction in computation time compared to the GA method while still allowing holograms of high diffraction efficiency and uniformity to be achieved. This work was supported by No.mOl-2001-000-00324-0 (2002)) from the Korea Science & Engineering Foundation.

  • PDF

Hydrogen Surface Coverage Dependence of the Reaction between Gaseous and Chemisorbed Hydrogen Atoms on a Silicon Surface

  • Ree, Jong-Baik;Chang, Kyung-Soon;Kim, Yoo-Hang
    • Bulletin of the Korean Chemical Society
    • /
    • 제23권2호
    • /
    • pp.205-214
    • /
    • 2002
  • The reaction of gas-phase atomic hydrogen with hydrogen atoms chemisorbed on a silicon surface is studied by use of the classical trajectory approach. Especially, we have focused on the mechanism changes with the hydrogen surface coverage difference. On the sparsely covered surface, the gas atom interacts with the preadsorbed hydrogen atom and adjacent bare surface sites. In this case, it is shown that the chemisorption of H(g) is of major importance. Nearly all of the chemisorption events accompany the desorption of H(ad), i.e., adisplacement reaction. Although much less important than the displacement reaction, the formation of $H_2(g)$ is the second most significant reaction pathway. At gas temperature of 1800 K and surface temperature of 300 K, the probabilities of these two reactions are 0.750 and 0.065, respectively. The adsorption of H(g) without dissociating H(ad) is found to be negligible. In the reaction pathway forming $H_2$, most of the reaction energy is carried by $H_2(g)$. Although the majority of $H_2(g)$ molecules are produced in sub-picosecond, direct-mode collisions, there is a small amount of $H_2(g)$ produced in multiple impact collisions, which is characteristic of complex-mode collisions. On the fully covered surface, it has been shown that the formation of $H_2(g)$ is of major importance. All reactive events occur on a subpicosecond scale, following the Eley-Rideal mechanism. At gas temperature of 1800 K and surface temperature of 300 K, the probability of the $H_2(g)$ formation reaction is 0.082. In this case, neither the gas atom trapping nor the displacement reaction has been found.

평가 문항을 활용한 중학교 수학 교육과정의 내용 및 인지행동의 위계성 조사 (Investigating the Hierarchical Nature of Content and Cognitive Domains in the Mathematics Curriculum for Korean Middle School Students via Assessment Items)

  • 송미영;김선희
    • 대한수학교육학회지:학교수학
    • /
    • 제9권2호
    • /
    • pp.223-240
    • /
    • 2007
  • 본 연구는 중학생들의 수학 성취를 국가수준에서 평가한 경험적 자료를 활용하여 우리나라 중학교 수학과 교육과정의 내용과 수학에서의 인지행동이 위계적으로 구성되어 있는지를 조사하였다. 전반적으로 교육과정의 내용 제시 순서는 난이도 순위와 통계적으로 유의한 상관관계가 나타나지 않은 반면, 인지행동의 위계는 난이도 순위와 통계적으로 유의한 상관관계가 있었다. 이러한 결과에서 검사 문항의 난이도 순위가 학교에서 배운 수학 교과 내용의 순서보다는 문항에서 요구하는 인지행동의 수준과 더 관련이 있음을 알 수 있었다. 그리고 내용 위계와 인지행동의 위계 간 상관관계가 유의하게 나타나, 교육과정에서 늦게 등장하는 내용일수록 요구되는 인지 행동도 높은 수준임을 발견할 수 있었다. 내용 및 인지행동의 위계와 난이도 순위 간 상관분석에서 특이한 양상을 나타낸 문항에 대해서는 그 특성을 분석하였다.

  • PDF

텍스트마이닝 기법을 활용한 미국산업응용수학 학회지의 연구 현황 및 동향 분석 (Analysis on Status and Trends of SIAM Journal Papers using Text Mining)

  • 김성연
    • 한국콘텐츠학회논문지
    • /
    • 제20권7호
    • /
    • pp.212-222
    • /
    • 2020
  • 본 연구의 목적은 전 세계 산업수학의 흐름을 주도하는 미국산업응용수학 학회에서 출판하는 논문들의 연구현황 및 동향을 거시적으로 파악하는 데 있다. 이를 위해 2016년부터 2019년까지 6,255편의 논문 제목 및 초록을 수집하였으며, LDA 기법을 활용한 토픽모델링과 시계열회귀모형 분석을 수행하였다. 분석 결과 첫째, 산업수학 분야는 해석학을 중심으로 기하학, 대수학, 위상수학, 이산수학, 확률 및 통계 등 다양한 분야에서 연구가 진행되었다. 둘째, 시간이 흐름에 따라 상승하는 연구 주제는 수리유체역학, 그래프이론, 확률미분방정식이었으며, 하강하는 연구 주제는 계산이론과 고전기하로 나타났다. 연구 결과는 산업수학 분야의 지적 구조에 대한 전체적인 흐름 및 변화에 대한 이해를 바탕으로 연구자들에게는 향후 연구 방향에 대해서, 그리고 교육 현장에는 시대 변화를 반영한 산업수학 교육과정을 수립하는데 시사점을 제공할 것이다.

두개의 임계치를 갖는 부분 버퍼공유 우선도 방식의 성능 분석에 관한 연구 (A Study on the Performance Analysis for Partial Buffer Sharing Priority Mechanism with Two Thresholds)

  • 박광채;이재호
    • 한국통신학회논문지
    • /
    • 제19권2호
    • /
    • pp.381-389
    • /
    • 1994
  • 고품질 음성, 고속의 데이터 및 영상 등과 같은 멀티미디어 서비스는 통신망에서 기존에 제공하는 서비스에 부가될 것이다. 이와같은 서비스는 통신망에 대해서 새로운 요구를 발생시킨다. 우선순위 제어 메카니즘은 많은 통신 시스템에서 발생된 멀티미디어 서비스를 제어하는데 사용될 수 있다. 우선순위 메카니즘은 서비스 품질에 따라 발생된 정보에 우선순위를 부여하는 트래픽 제어 방식중의 하나로서 우선순위의 할당은 손실 민감도와 지연 민감도등과 같은 트래픽 특성에 대한 우선순위 기준에 의해서 나누어질 수 있다. 본 논문에서는 손실을 줄이는 트래픽 제어로서 부분버퍼 공유(PBS:Partial Buffer Sharing)방식을 이용하고 Markov Chain을 이용한 해석 방법을 제안한다. 제안한 해석 방법을 검증하기 위해서 시뮬레이션 전용 언어인 SIMSCRIPT 11.5를 이용해서 시뮬레이션을 수행하였다. 시뮬레이션 결과 제안한 해석방법이 타당함을 검증하였다. 또한 ATM 망에 결과를 적용했을때 ATM 망의 셀(CELL) 손실 확률을 구하였다.

  • PDF

An Evaluation of the Repetitive Tooth Bleaching with Nonthermal Atmospheric Pressure Plasma

  • Nam, Seoul Hee;Kim, Gyoo Cheon;Hong, Jin Woo
    • International Journal of Oral Biology
    • /
    • 제41권4호
    • /
    • pp.243-251
    • /
    • 2016
  • This study was undertaken to achieve a high bleaching efficacy with plasma, through longer application and reparative bleaching processes, by different shade evaluation methods. Extracted human teeth were divided into 6 groups (n=10). All teeth were treated in pairs. Low concentration of 15% carbamide peroxide (CP) was applied, with and without plasma, for 10, 20, and 30-min tooth bleaching, respectively. The bleaching procedure was repeated once daily for four days. The teeth were maintained in a moist environment provided by artificial saliva. The Vitapan Classical shade guide and Commission Internationale de L'Eclairage (CIELAB) color system were collectively used to measure the bleaching efficacy. Color evaluation was statistically analyzed using Student t-test and one-way analysis of variance (ANOVA) complemented by Tukey's test. Combining the plasma with 15% CP showed significantly greater color changes compared to bleaching without plasma (p<0.05). A high bleaching efficacy with plasma is proportional to the repetitive application and the treatment time. A 30-min application with plasma provided the best bleaching. Repetitive bleaching showed lower probability of color relapse of the bleached tooth. The color change by shade guide correlated with the changes in CIELAB color system. A value of 1 color change units (CCU) conversion factor for overall color change (${\Delta}E$) values comparisons was 3.724 values. The two measuring methods provide a more accurate correspondence of color change. The repetitive and longer application for tooth bleaching, combined with plasma, has a strong bleaching effect and produces whiter teeth.