全文获取类型
收费全文 | 204篇 |
免费 | 4篇 |
国内免费 | 8篇 |
专业分类
化学 | 7篇 |
力学 | 8篇 |
综合类 | 1篇 |
数学 | 179篇 |
物理学 | 21篇 |
出版年
2023年 | 3篇 |
2022年 | 2篇 |
2020年 | 2篇 |
2019年 | 2篇 |
2018年 | 2篇 |
2017年 | 4篇 |
2016年 | 1篇 |
2015年 | 4篇 |
2014年 | 7篇 |
2013年 | 30篇 |
2012年 | 6篇 |
2011年 | 13篇 |
2010年 | 10篇 |
2009年 | 13篇 |
2008年 | 19篇 |
2007年 | 17篇 |
2006年 | 11篇 |
2005年 | 3篇 |
2004年 | 9篇 |
2003年 | 4篇 |
2002年 | 3篇 |
2001年 | 1篇 |
2000年 | 2篇 |
1999年 | 2篇 |
1998年 | 8篇 |
1997年 | 8篇 |
1996年 | 7篇 |
1995年 | 3篇 |
1994年 | 6篇 |
1993年 | 3篇 |
1992年 | 2篇 |
1991年 | 1篇 |
1990年 | 4篇 |
1984年 | 1篇 |
1982年 | 1篇 |
1977年 | 1篇 |
1971年 | 1篇 |
排序方式: 共有216条查询结果,搜索用时 41 毫秒
1.
2.
The generalized Poisson distribution is well known to be a compound Poisson distribution with Borel summands. As a generalization we present closed formulas for compound Bartlett and Delaporte distributions with Borel summands and a recursive structure for certain compound shifted Delaporte mixtures with Borel summands. Our models are introduced in an actuarial context as claim number distributions and are derived only with probabilistic arguments and elementary combinatorial identities. In the actuarial context related compound distributions are of importance as models for the total size of insurance claims for which we present simple recursion formulas of Panjer type. 相似文献
3.
The function-valued Padé-type approximant (FPTA) was defined in the inner product space [8]. In this work, we choose the coefficients in the Neumann power series to make the inner product with both sides a function-valued system of equations to yield a scalar system. Then we express an FPTA in the determinant form. To avoid the direct computation of the determinants, we present the E-algorithm for FPTA based on the vector-valued E-algorithm given by Brezinski [4]. The method of FPTA via E-algorithm (FPTAVEA) not only includes all previous methods but overcomes their essential difficulties. The numerical experiment for a typical integral equation [1] illustrates that the method of FPTAVEA is simpler and more effective for obtaining the characteristic values and the characteristic functions than all previous methods. In addition, this method is also applicable to other Fredholm integral equations of the second kind without explicit characteristic values and characteristic functions. A corresponding example [12] is given and the numerical result is the same as that in [12]. 相似文献
4.
Florent Renac 《Journal of computational physics》2011,230(14):5739-5752
An algorithm for stabilizing linear iterative schemes is developed in this study. The recursive projection method is applied in order to stabilize divergent numerical algorithms. A criterion for selecting the divergent subspace of the iteration matrix with an approximate eigenvalue problem is introduced. The performance of the present algorithm is investigated in terms of storage requirements and CPU costs and is compared to the original Krylov criterion. Theoretical results on the divergent subspace selection accuracy are established. The method is then applied to the resolution of the linear advection–diffusion equation and to a sensitivity analysis for a turbulent transonic flow in the context of aerodynamic shape optimization. Numerical experiments demonstrate better robustness and faster convergence properties of the stabilization algorithm with the new criterion based on the approximate eigenvalue problem. This criterion requires only slight additional operations and memory which vanish in the limit of large linear systems. 相似文献
5.
Nowadays dampers based on magnetorheological (MR) fluids are receiving significant attention specially for control of structural vibration and automotive suspensions systems. In most cases, it is necessary to develop an appropriate control strategy which is practically implementable when a suitable model for MR dampers is available. It is not a trivial task to model the dynamic of MR dampers because of their inherent non-linear and hysteretic dynamics. In this paper, a recursive lazy learning method based on neural networks is considered to model the MR damper behavior. The proposed method is validated by comparison with experimental obtained responses. Results show the estimated model correlates very well with the data obtained experimentally. The method proposed learns quickly that it is only necessarily a learning cycle, it can learn on-line and it is easy to select the network structure and calculate the model parameters. 相似文献
6.
K. Vela Velupillai 《Applied mathematics and computation》2009,215(4):1404-1416
Economic theory, game theory and mathematical statistics have all increasingly become algorithmic sciences. Computable Economics, Algorithmic Game Theory[Noam Nisan, Tim Roiughgarden, Éva Tardos, Vijay V. Vazirani (Eds.), Algorithmic Game Theory, Cambridge University Press, Cambridge, 2007] and Algorithmic Statistics[Péter Gács, John T. Tromp, Paul M.B. Vitányi, Algorithmic statistics, IEEE Transactions on Information Theory 47 (6) (2001) 2443-2463] are frontier research subjects. All of them, each in its own way, are underpinned by (classical) recursion theory - and its applied branches, say computational complexity theory or algorithmic information theory - and, occasionally, proof theory. These research paradigms have posed new mathematical and metamathematical questions and, inadvertently, undermined the traditional mathematical foundations of economic theory. A concise, but partial, pathway into these new frontiers is the subject matter of this paper. Interpreting the core of mathematical economic theory to be defined by General Equilibrium Theory and Game Theory, a general - but concise - analysis of the computable and decidable content of the implications of these two areas are discussed. Issues at the frontiers of macroeconomics, now dominated by Recursive Macroeconomic Theory (The qualification ‘recursive’ here has nothing to do with ‘recursion theory’. Instead, this is a reference to the mathematical formalizations of the rational economic agent’s intertemporal optimization problems, in terms of Markov Decision Processes, (Kalman) Filtering and Dynamic Programming, where a kind of ‘recursion’ is invoked in the solution methods. The metaphor of the rational economic agent as a ‘signal processor’ underpins the recursive macroeconomic paradigm.), are also tackled, albeit ultra briefly. The point of view adopted is that of classical recursion theory and varieties of constructive mathematics. 相似文献
7.
We investigate the complexity of finding solutions to infinite recursive constraint satisfaction problems. We show that, in general, the problem of finding a solution to an infinite recursive constraint satisfaction problem is equivalent to the problem of finding an infinite path through a recursive tree. We also identify natural classes of infinite recursive constraint satisfaction problems where the problem of finding a solution to the infinite recursive constraint satisfaction problem is equivalent to the problem of finding an infinite path through finitely branching recursive trees or recursive binary trees. There are a large number of results in the literature on the complexity of the problem of finding an infinite path through a recursive tree. Our main result allows us to automatically transfer such results to give equivalent results about the complexity of the problem of finding a solution to a recursive constraint satisfaction problem. 相似文献
8.
We present here some results on the applications of linear recursive sequences of order $2$ to the Fermat pseudoprimes, Fibonacci pseudoprimes, and Dickson pseudoprimes. 相似文献
9.
10.
Nicolaj Søndberg-Jeppesen 《International Journal of Approximate Reasoning》2010,51(5):587-599
We consider the situation where two agents try to solve each their own task in a common environment. In particular, we study simple sequential Bayesian games with unlimited time horizon where two players share a visible scene, but where the tasks (termed assignments) of the players are private information. We present an influence diagram framework for representing simple type of games, where each player holds private information. The framework is used to model the analysis depth and time horizon of the opponent and to determine an optimal policy under various assumptions on analysis depth of the opponent. Not surprisingly, the framework turns out to have severe complexity problems even in simple scenarios due to the size of the relevant past. We propose two approaches for approximation. One approach is to use Limited Memory Influence Diagrams (LIMIDs) in which we convert the influence diagram into a set of Bayesian networks and perform single policy update. The other approach is information enhancement, where it is assumed that the opponent in a few moves will know your assignment. Empirical results are presented using a simple board game. 相似文献