首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   87篇
  免费   16篇
  国内免费   3篇
化学   6篇
力学   20篇
综合类   14篇
数学   24篇
物理学   42篇
  2023年   1篇
  2022年   3篇
  2021年   9篇
  2020年   1篇
  2019年   1篇
  2018年   1篇
  2017年   1篇
  2016年   7篇
  2015年   5篇
  2014年   2篇
  2013年   4篇
  2012年   3篇
  2011年   1篇
  2010年   3篇
  2009年   4篇
  2008年   5篇
  2007年   3篇
  2006年   5篇
  2005年   7篇
  2004年   6篇
  2003年   6篇
  2002年   9篇
  2001年   1篇
  2000年   1篇
  1998年   5篇
  1996年   1篇
  1995年   1篇
  1994年   2篇
  1993年   1篇
  1992年   2篇
  1991年   2篇
  1989年   1篇
  1988年   1篇
  1986年   1篇
排序方式: 共有106条查询结果,搜索用时 387 毫秒
21.
考虑一个处于非Ohmic环境下的系统定向通过一个倒谐振子势鞍点的输运过程,给出了通过几率的解析式。结果表明在欠扩散情况下,时间有关的通过几率出现一个很强的超前峰和回流,这可能有助于理解重核熔合系统的激发函数随质心能量的慢增长机制。Directional transport of a particle in a non-Ohmic environment passing over the saddle point of a potential is considered and the analytical expression of the passing probability is obtained. Our results has shown that both overshooting and backflow are observed in the case of subdiffusion. This is a possible for understanding slow increasing of the fusion probability with the center-of-mass energy.  相似文献   
22.
郝三如  侯伯宇 《中国物理》2002,11(5):450-455
By making use of the theoretical framework presented by Bostroem(K.J.Bostroem,LANL quant-ph/0009052),we generalize the standard quantum information theory of block messages with fixed block length to the variable one.We show that the states belonging to a sufficiently large hilbert space are the highly distinguishable states.We also consider the collection states (product states of more than one qubit state) and seek a “pretty good measurement” (PGM) with measurement vectors to improve the mutual information.The average mutual information over random block-message ensembles with variable block length n is discussed in detail.  相似文献   
23.
椭圆曲线签名方案   总被引:7,自引:0,他引:7  
将椭圆曲线密码系统(ECC)与ElGamal系统进行了比较,在保证签名算法安全性的前提下,对ECC签名方案中的求逆运算和消息恢复问题进行了优化,针对这两个问题分别构造了新的签名方案,通过理论证明和编程模拟实验,解决了ECC签名方案中存在的需要求逆运算和不能实现消息恢复的问题,大大地简化了运算的复杂程度。  相似文献   
24.
Analysis of a discrete-time queueing system with time-limited service   总被引:3,自引:0,他引:3  
We analyze a discrete-time, single-server queueing system in which the length of each service period is limited. The server takes a vacation when the limit expires or the queue empties, whichever occurs first. In the former case, the preempted service is resumed after the vacation without loss or creation of any work. This system models the transmission of message frames from a station on timed-token local-area networks (for example, FDDI and IEEE 802.4 token bus). We study the process of the unfinished work and the joint process of the queue size and the remaining service time. By using the technique of discrete Fourier transforms to determine some unknown functions in the governing equations, we numerically obtain exact mean waiting times.A part of the work of H. Takagi was done while he was with IBM Research, Tokyo Research Laboratory.  相似文献   
25.
利用三维N-S方程和RNGk-ε湍流模型对离心风机内部的非定常粘性流场进行了数值模拟,分析了不同时刻叶片与蜗舌所处的不同相对位置对风机瞬时性能、叶轮出口流动以及对蜗舌处的静压分布和静压脉动的影响。同时指出,改进特定时刻叶片与蜗舌处于特定相对位置时风机的瞬时性能是提高风机总体性能的一条新的途径。此外,还尝试运用一种新的方法,即不用求解声场而直接依据非定常流场中的静压脉动分析了蜗舌处主要气动噪声源的位置及其成因。  相似文献   
26.
Active inference is an increasingly prominent paradigm in theoretical biology. It frames the dynamics of living systems as if they were solving an inference problem. This rests upon their flow towards some (non-equilibrium) steady state—or equivalently, their maximisation of the Bayesian model evidence for an implicit probabilistic model. For many models, these self-evidencing dynamics manifest as messages passed among elements of a system. Such messages resemble synaptic communication at a neuronal network level but could also apply to other network structures. This paper attempts to apply the same formulation to biochemical networks. The chemical computation that occurs in regulation of metabolism relies upon sparse interactions between coupled reactions, where enzymes induce conditional dependencies between reactants. We will see that these reactions may be viewed as the movement of probability mass between alternative categorical states. When framed in this way, the master equations describing such systems can be reformulated in terms of their steady-state distribution. This distribution plays the role of a generative model, affording an inferential interpretation of the underlying biochemistry. Finally, we see that—in analogy with computational neurology and psychiatry—metabolic disorders may be characterized as false inference under aberrant prior beliefs.  相似文献   
27.
为了抑制粘滑振动和监控钻井过程,需要对钻井过程进行控制,并将钻井参数实时地传输至监控中心。本文提出了一种基于ARM和DSP的钻井控制和信息传输平台,DSP作为算法运算中心、信息转发和协议转换器,ARM作为信息显示和数据存储单元。在系统总体框架下,重点分析了系统的软件和硬件设计方案。对系统在井场进行了现场测试,验证了该系统的可靠和稳定性以及控制算法的有效性。最后,阐明了只要性能和接口满足要求,DSP可用别的嵌入式CPU替代。  相似文献   
28.
Many applications in applied mathematics and engineering involve numerical solutions of partial differential equations (PDEs). Various discretisation procedures such as the finite difference method result in a problem of solving large, sparse systems of linear equations. In this paper, a group iterative numerical scheme based on the rotated (skewed) five-point finite difference discretisation is proposed for the solution of a fourth order elliptic PDE which represents physical situations in fluid mechanics and elasticity. The rotated approximation formulas lead to schemes with lower computational complexities compared to the centred approximation formulas since the iterative procedure need only involve nodes on half of the total grid points in the solution domain. We describe the development of the parallel group iterative scheme on a cluster of distributed memory parallel computer using Message-Passing Interface (MPI) programming environment. A comparative study with another group iterative scheme derived from the centred difference formula is also presented. A detailed performance analysis of the parallel implementations of both group methods will be reported and discussed.  相似文献   
29.
Bayesian networks compute marginal distributions through the message passing algorithm—a series of local calculations involving neighboring cliques of variables in a clique tree. In this work, these message passing computations are extended to the case of degenerate Gaussian potentials which are multivariate Gaussian densities that can have two different kinds of degeneracies corresponding to projections with zero variance and projections with infinite variance. The basic operations of the message passing algorithm, such as representing conditional distributions, extending potentials, and conditioning on observations, create or operate on potentials with various kinds of degeneracies thereby demonstrating the need for such methodology. Computer implementation of this scheme follows easily from the details within and some computational aspects are discussed. We also demonstrate an application of our methodology to automatic musical accompaniment.  相似文献   
30.
A parallel algorithm for efficient calculation of the second derivatives (Hessian) of the conformational energy in internal coordinates is proposed. This parallel algorithm is based on the master/slave model. A master processor distributes the calculations of components of the Hessian to one or more slave processors that, after finishing their calculations, send the results to the master processor that assembles all the components of the Hessian. Our previously developed molecular analysis system for conformational energy optimization, normal mode analysis, and Monte Carlo simulation for internal coordinates is extended to use this parallel algorithm for Hessian calculation on a massively parallel computer. The implementation of our algorithm uses the message passing interface and works effectively on both distributed-memory parallel computers and shared-memory parallel computers. We applied this system to the Newton–Raphson energy optimization of the structures of glutaminyl transfer RNA (Gln-tRNA) with 74 nucleotides and glutaminyl-tRNA synthetase (GlnRS) with 540 residues to analyze the performance of our system. The parallel speedups for the Hessian calculation were 6.8 for Gln-tRNA with 24 processors and 11.2 for GlnRS with 54 processors. The parallel speedups for the Newton–Raphson optimization were 6.3 for Gln-tRNA with 30 processors and 12.0 for GlnRS with 62 processors. © 1998 John Wiley & Sons, Inc. J Comput Chem 19: 1716–1723, 1998  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号