Search Results: 1 - 10 of 100 matches for " "
All listed articles are free for downloading (OA Articles)
Page 1 /100
Display every page Item
用D-最优化法估算空气隙传爆界面的可靠性  [PDF]
含能材料 , 2012, DOI: 10.3969/j.issn.1006-9941.2012.06.023
Abstract: 以空气隙长度为变量设计了用于确定空气隙传爆界面可靠性的试验方案,并构建了试验装置。采用Neyer-D最优化法,试验并估算了隔板起爆器中由雷管、空气隙和导爆药组成的空气隙传爆界面的可靠性。结果表明,空气隙的临界起爆长度为18.76mm。由p分位数的区间估计所得的置信度为γ=0.95的界面作用可靠度为0.999925。
基于NESSUS的空气隙传爆界面可靠性分析  [PDF]
北京理工大学学报 , 2013,
Abstract: 为研究某隔板起爆器空气隙传爆界面的可靠性,采用NESSUS软件对其进行可靠性分析,得出在设计条件下该界面作用可靠度,并对影响该界面的随机变量进行敏感性和重要性分析.结果表明输出装药的爆速和密度、雷管底的厚度、受主装药的临界起爆能量、雷管底的密度对可靠度影响较大.在选择材料及加工产品时,应保证这些参数的一致性.
Cellular automata simulation of site-saturated and constant nucleation rate transformations in three dimensions
Rios, Paulo Rangel;Oliveira, Valmir Torres de;Pereira, Luciana de Oliveira;Pereira, Maxwell Ruela;Castro, José Adilson de;
Materials Research , 2006, DOI: 10.1590/S1516-14392006000200020
Abstract: microstructural evolution in three dimensions of nucleation and growth transformations is simulated by means of cellular automata. two types of nucleation are considered: site-saturated nucleation and constant nucleation rate. the simulated microstrutural evolution agrees very well with exact analytical expressions. the simulated data also gives very good agreement with expressions derived to describe the evolution of the interfaces between transformed grains.
Automata and automata mappings of semigroups  [PDF]
Boris Plotkin,Tatjana Plotkin
Computer Science , 2015,
Abstract: The paper is devoted to two types of algebraic models of automata. The usual (first type) model leads to the developed decomposition theory (Krohn-Rhodes theory). We introduce another type of automata model and study how these automata are related to cascade connections of automata of the first type. The introduced automata play a significant role in group theory and, hopefully, in the theory of formal languages.
Probabilistic Reversible Automata and Quantum Automata  [PDF]
Marats Golovkins,Maksim Kravtsev
Computer Science , 2002,
Abstract: To study relationship between quantum finite automata and probabilistic finite automata, we introduce a notion of probabilistic reversible automata (PRA, or doubly stochastic automata). We find that there is a strong relationship between different possible models of PRA and corresponding models of quantum finite automata. We also propose a classification of reversible finite 1-way automata.
Hourglass Automata  [PDF]
Yuki Osada,Tim French,Mark Reynolds,Harry Smallbone
Computer Science , 2014, DOI: 10.4204/EPTCS.161.16
Abstract: In this paper, we define the class of hourglass automata, which are timed automata with bounded clocks that can be made to progress backwards as well as forwards at a constant rate. We then introduce a new clock update for timed automata that allows hourglass automata to be expressed. This allows us to show that language emptiness remains decidable with this update when the number of clocks is two or less. This is done by showing that we can construct a finite untimed graph using clock regions from any timed automaton that use this new update.
Introduction to Quantum Cellular Automata  [PDF]
B. Aoun,M. Tarifi
Physics , 2004,
Abstract: We provide an introduction to Quantum Cellular Automata.
Cellular Automata  [PDF]
Franco Bagnoli
Physics , 1998,
Abstract: An introduction to cellular automata (both deterministic and probabilistic) with examples. Definition of deterministic automata, dynamical properties, damage spreading and Lyapunov exponents; probabilistic automata and Markov processes, nonequilibrium phase transitions, directed percolation, diffusion; simulation techniques, mean field. Investigation themes: life, epidemics, forest fires, percolation, modeling of ecosystems and speciation. They represent my notes for the school "Dynamical Modeling in Biotechnologies", ISI, Villa Gualino 1996.
Reaction Automata  [PDF]
Fumiya Okubo,Satoshi Kobayashi,Takashi Yokomori
Computer Science , 2011,
Abstract: Reaction systems are a formal model that has been introduced to investigate the interactive behaviors of biochemical reactions. Based on the formal framework of reaction systems, we propose new computing models called reaction automata that feature (string) language acceptors with multiset manipulation as a computing mechanism, and show that reaction automata are computationally Turing universal. Further, some subclasses of reaction automata with space complexity are investigated and their language classes are compared to the ones in the Chomsky hierarchy.
《海森伯传》译者引言  [PDF]
物理 , 2004,
Abstract: ?《海森伯传》译者引言
Page 1 /100
Display every page Item

Copyright © 2008-2017 Open Access Library. All rights reserved.