全文获取类型
收费全文 | 46篇 |
免费 | 1篇 |
专业分类
电工技术 | 2篇 |
综合类 | 5篇 |
机械仪表 | 2篇 |
能源动力 | 1篇 |
轻工业 | 1篇 |
无线电 | 2篇 |
一般工业技术 | 1篇 |
自动化技术 | 33篇 |
出版年
2023年 | 1篇 |
2021年 | 1篇 |
2019年 | 1篇 |
2018年 | 2篇 |
2015年 | 1篇 |
2014年 | 2篇 |
2013年 | 1篇 |
2012年 | 1篇 |
2011年 | 5篇 |
2009年 | 4篇 |
2008年 | 2篇 |
2007年 | 1篇 |
2006年 | 8篇 |
2005年 | 1篇 |
2004年 | 1篇 |
2003年 | 2篇 |
2002年 | 4篇 |
1998年 | 2篇 |
1997年 | 1篇 |
1996年 | 1篇 |
1995年 | 1篇 |
1994年 | 1篇 |
1993年 | 1篇 |
1991年 | 1篇 |
1988年 | 1篇 |
排序方式: 共有47条查询结果,搜索用时 15 毫秒
1.
J.E. Macías-Díaz 《Computer Physics Communications》2011,182(12):2471-2478
Departing from a finite-difference scheme to approximate solutions of a nonlinear, hyperbolic partial differential equation which generalizes the Burgers–Huxley equation from fluid dynamics, we investigate conditions on the model coefficients and the computational parameters under which positive and bounded initial data evolve into positive and bounded new approximations. The model under investigation includes nonlinear coefficients of damping and advection, and the reaction term extends the reaction law of the classical Fisher–Kolmogorov–Petrovsky–Piscounov equation. The method can be expressed in vector form in terms of a multiplicative matrix which, under certain parametric conditions, becomes an M-matrix. Using the fact that every M-matrix is non-singular and that the entries of its inverse are positive, real numbers, we establish sufficient conditions under which the method provides new, positive and bounded approximations from previous, positive and bounded data and boundary conditions. The numerical results confirm the fact that the conditions derived here are sufficient for the positivity and the boundedness of the approximations; moreover, computational experiments evidence the fact that the method still preserves these properties for values of the model and the numerical parameters outside of the analytic regions of positivity and boundedness. We point out that our simulations show a good agreement between the numerical approximations computed through our method and the corresponding, analytical solutions. 相似文献
2.
We prove several decidability and undecidability results for ν-PN, an extension of P/T nets with pure name creation and name management. We give a simple proof of undecidability of reachability, by reducing reachability in nets with inhibitor arcs to it. Thus, the expressive power of ν-PN strictly surpasses that of P/T nets. We encode ν-PN into Petri Data Nets, so that coverability, termination and boundedness are decidable. Moreover, we obtain Ackermann-hardness results for all our decidable decision problems. Then we consider two properties, width-boundedness and depth-boundedness, that factorize boundedness. Width-boundedness has already been proven to be decidable. Here we prove that its complexity is also non-primitive recursive. Then we prove undecidability of depth-boundedness. Finally, we prove that the corresponding “place version” of all the boundedness problems is undecidable for ν-PN. These results carry over to Petri Data Nets. 相似文献
3.
张红雷 《徐州工程学院学报》2006,21(3):21-24
通过定性分析方法讨论了一类被捕食者种群有密度制约的Ho lling I类捕食系统平衡点的性态、解的有界性、正平衡点的全局渐进稳定性,得到了极限环不存在的条件,并利用Po incare-Bend ixson环域定理得到了极限环存在的充分条件. 相似文献
4.
熊佐亮 《南昌大学学报(工科版)》1993,15(1):1
本文对一类饱和反应模型进行了研究,得到了其在R~+中的一切解的有界性以及平衡点M(x~*,y~*)在R~+中的全局稳定性的充分条件。 相似文献
5.
This paper investigates an online gradient method with penalty for training feedforward neural networks with linear output.
A usual penalty is considered, which is a term proportional to the norm of the weights. The main contribution of this paper
is to theoretically prove the boundedness of the weights in the network training process. This boundedness is then used to
prove an almost sure convergence of the algorithm to the zero set of the gradient of the error function. 相似文献
6.
In this paper, the deterministic convergence of an online gradient method with penalty and momentum is investigated for training two-layer feedforward neural networks. The monotonicity of the new error function with the penalty term in the training iteration is firstly proved. Under this conclusion, we show that the weights are uniformly bounded during the training process and the algorithm is deterministically convergent. Sufficient conditions are also provided for both weak and strong convergence results. 相似文献
7.
M. Jaberi Douraki Mehdi Dehghan Javad Mashreghi 《Computers & Mathematics with Applications》2008,56(1):186-198
We study the invariant interval, the character of semicycles, the global stability, and the boundedness of the difference equation where the initial conditions x−k,…,x−1,x0 are nonnegative, and p,q>0. 相似文献
8.
9.
定义了一类广义极大算子,该算子是Hardy-Littlewood极大算子的推广,建立了该算子的加权弱型与强型Φ-有界性,这里Φ是Yong函数. 相似文献
10.