全文获取类型
收费全文 | 3301篇 |
免费 | 323篇 |
国内免费 | 84篇 |
专业分类
化学 | 803篇 |
晶体学 | 2篇 |
力学 | 123篇 |
综合类 | 87篇 |
数学 | 1575篇 |
物理学 | 1118篇 |
出版年
2024年 | 22篇 |
2023年 | 133篇 |
2022年 | 527篇 |
2021年 | 456篇 |
2020年 | 270篇 |
2019年 | 196篇 |
2018年 | 138篇 |
2017年 | 140篇 |
2016年 | 172篇 |
2015年 | 110篇 |
2014年 | 141篇 |
2013年 | 295篇 |
2012年 | 89篇 |
2011年 | 104篇 |
2010年 | 112篇 |
2009年 | 99篇 |
2008年 | 89篇 |
2007年 | 96篇 |
2006年 | 68篇 |
2005年 | 55篇 |
2004年 | 33篇 |
2003年 | 40篇 |
2002年 | 31篇 |
2001年 | 24篇 |
2000年 | 26篇 |
1999年 | 23篇 |
1998年 | 24篇 |
1997年 | 22篇 |
1996年 | 17篇 |
1995年 | 22篇 |
1994年 | 13篇 |
1993年 | 7篇 |
1992年 | 11篇 |
1991年 | 11篇 |
1990年 | 9篇 |
1989年 | 7篇 |
1988年 | 14篇 |
1987年 | 14篇 |
1986年 | 12篇 |
1985年 | 4篇 |
1984年 | 8篇 |
1983年 | 3篇 |
1980年 | 1篇 |
1979年 | 5篇 |
1977年 | 3篇 |
1976年 | 1篇 |
1973年 | 2篇 |
1971年 | 1篇 |
1969年 | 1篇 |
1959年 | 5篇 |
排序方式: 共有3708条查询结果,搜索用时 31 毫秒
11.
Optimization theory provides a framework for determining the best decisions or actions with respect to some mathematical model of a process. This paper focuses on learning to act in a near-optimal manner through reinforcement learning for problems that either have no model or the model is too complex. One approach to solving this class of problems is via approximate dynamic programming. The application of these methods are established primarily for the case of discrete state and action spaces. In this paper we develop efficient methods of learning which act in complex systems with continuous state and action spaces. Monte-Carlo approaches are employed to estimate function values in an iterative, incremental procedure. Derivative-free line search methods are used to obtain a near-optimal action in the continuous action space for a discrete subset of the state space. This near-optimal control policy is then extended to the entire continuous state space via a fuzzy additive model. To compensate for approximation errors, a modified procedure for perturbing the generated control policy is developed. Convergence results under moderate assumptions and stopping criteria are established. 相似文献
12.
Thomas Marlow 《International Journal of Theoretical Physics》2006,45(7):1247-1257
We attempt a justification of a generalisation of the consistent histories programme using a notion of probability that is valid for all complete sets of history propositions. This consists of introducing Cox's axioms of probability theory and showing that our candidate notion of probability obeys them. We also give a generalisation of Bayes' theorem and comment upon how Bayesianism should be useful for the quantum gravity/cosmology programmes.
PACS: 02.50.Cw;03.65.Ta;04.60.-m. 相似文献
13.
We present a Bayesian theory of object identification. Here, identifying an object means selecting a particular observation from a group of observations (variants), this observation (the regular variant) being characterized by a distributional model. In this sense, object identification means assigning a given model to one of several observations. Often, it is the statistical model of the regular variant, only, that is known. We study an estimator which relies essentially on this model and not on the characteristics of the “irregular” variants. In particular, we investigate under what conditions this variant selector is optimal. It turns out that there is a close relationship with exchangeability and Markovian reversibility. We finally apply our theory to the case of irregular variants generated from the regular variant by a Gaussian linear model. 相似文献
14.
James M. Calvin 《Journal of Global Optimization》1993,3(2):223-232
A sequential Bayesian method for finding the maximum of a function based on myopically minimizing the expected dispersion of conditional probabilities is described. It is shown by example that an algorithm that generates a dense set of observations need not converge to the correct answer for some priors on continuous functions on the unit interval. For the Brownian motion prior the myopic algorithm is consistent; for any continuous function, the conditional probabilities converge weakly to a point mass at the true maximum. 相似文献
15.
本文通过模拟研究,讨论了最大似然方法和Bayes方法在分析结构方程模型中的相似点和不同之处。 相似文献
16.
Guido Consonni Piero Veronese Eduardo Gutirrez-Pea 《Journal of multivariate analysis》2004,88(2):335-364
Reference analysis is one of the most successful general methods to derive noninformative prior distributions. In practice, however, reference priors are often difficult to obtain. Recently developed theory for conditionally reducible natural exponential families identifies an attractive reparameterization which allows one, among other things, to construct an enriched conjugate prior. In this paper, under the assumption that the variance function is simple quadratic, the order-invariant group reference prior for the above parameter is found. Furthermore, group reference priors for the mean- and natural parameter of the families are obtained. A brief discussion of the frequentist coverage properties is also presented. The theory is illustrated for the multinomial and negative-multinomial family. Posterior computations are especially straightforward due to the fact that the resulting reference distributions belong to the corresponding enriched conjugate family. A substantive application of the theory relates to the construction of reference priors for the Bayesian analysis of two-way contingency tables with respect to two alternative parameterizations. 相似文献
17.
Support vector machine (SVM), developed by Vapnik et al., is a new and promising technique for classification and regression and has been proved to be competitive with the best available learning machines in many applications. However, the classification speed of SVM is substantially slower than that of other techniques with similar generalization ability. A new type SVM named projected SVM (PSVM), which is a combination of feature vector selection (FVS) method and linear SVM (LSVM), is proposed in present paper. In PSVM, the FVS method is first used to select a relevant subset (feature vectors, FVs) from the training data, and then both the training data and the test data are projected into the subspace constructed by FVs, and finally linear SVM(LSVM) is applied to classify the projected data. The time required by PSVM to calculate the class of new samples is proportional to the count of FVs. In most cases, the count of FVs is smaller than that of support vectors (SVs), and therefore PSVM is faster than SVM in running. Compared with other speeding-up techniques of SVM, PSVM is proved to possess not only speeding-up ability but also de-noising ability for high-noised data, and is found to be of potential use in mechanical fault pattern recognition. 相似文献
18.
Alina Constantinescu 《Applications of Mathematics》2007,52(4):321-326
In one if his paper Luo transformed the problem of sum-fuzzy rationality into artificial learning procedure and gave an algorithm
which used the learning rule of perception. This paper extends the Luo method for finding a sum-fuzzy implementation of a
choice function and offers an algorithm based on the artificial learning procedure with fixed fraction. We also present a
concrete example which uses this algorithm. 相似文献
19.
无失效数据的Bayes和多层Bayes分析 总被引:3,自引:0,他引:3
本文推广了文献[6]的结果,对指数分布无失效数据的失效率,给出了Bayes估计、Bayes置信上限以及多层Bayes估计,从而可以得到无失效数据可靠度的估计,最后,结合实际问题进行了计算。 相似文献
20.
Bruni C. Bruni R. De Santis A. Iacoviello D. Koch G. 《Journal of Optimization Theory and Applications》2002,115(1):67-96
In this paper, a procedure is presented which allows the optimal reconstruction of images from blurred noisy data. The procedure relies on a general Bayesian approach, which makes proper use of all the available information. Special attention is devoted to the informative content of the edges; thus, a preprocessing phase is included, with the aim of estimating the jump sizes in the gray level. The optimization phase follows; existence and uniqueness of the solution is secured. The procedure is tested against simple simulated data and real data. 相似文献