全文获取类型
收费全文 | 1086篇 |
免费 | 41篇 |
国内免费 | 49篇 |
专业分类
化学 | 232篇 |
力学 | 51篇 |
综合类 | 2篇 |
数学 | 397篇 |
物理学 | 494篇 |
出版年
2024年 | 3篇 |
2023年 | 36篇 |
2022年 | 25篇 |
2021年 | 21篇 |
2020年 | 24篇 |
2019年 | 29篇 |
2018年 | 11篇 |
2017年 | 15篇 |
2016年 | 30篇 |
2015年 | 27篇 |
2014年 | 55篇 |
2013年 | 64篇 |
2012年 | 44篇 |
2011年 | 60篇 |
2010年 | 66篇 |
2009年 | 84篇 |
2008年 | 85篇 |
2007年 | 96篇 |
2006年 | 69篇 |
2005年 | 34篇 |
2004年 | 42篇 |
2003年 | 33篇 |
2002年 | 23篇 |
2001年 | 19篇 |
2000年 | 24篇 |
1999年 | 20篇 |
1998年 | 18篇 |
1997年 | 14篇 |
1996年 | 19篇 |
1995年 | 12篇 |
1994年 | 13篇 |
1993年 | 12篇 |
1992年 | 7篇 |
1991年 | 2篇 |
1990年 | 3篇 |
1989年 | 3篇 |
1988年 | 4篇 |
1986年 | 3篇 |
1985年 | 9篇 |
1984年 | 2篇 |
1983年 | 2篇 |
1982年 | 4篇 |
1981年 | 2篇 |
1980年 | 2篇 |
1979年 | 2篇 |
1978年 | 1篇 |
1977年 | 2篇 |
1972年 | 1篇 |
排序方式: 共有1176条查询结果,搜索用时 15 毫秒
81.
82.
Peter?EichelsbacherEmail author Matthias?L?we 《Probability Theory and Related Fields》2004,130(4):441-472
We derive moderate deviation principles for the overlap parameter in the Hopfield model of spin glasses and neural networks. If the inverse temperature is different from the critical inverse temperature c=1 and the number of patterns M(N) satisfies M(N)/N 0, the overlap parameter multiplied by N, 1/2 < < 1, obeys a moderate deviation principle with speed N1–2 and a quadratic rate function (i.e. the Gaussian limit for = 1/2 remains visible on the moderate deviation scale). At the critical temperature we need to multiply the overlap parameter by N, 1/4 < < 1. If then M(N) satisfies (M(N)6 log N M(N)2N4 log N)/N 0, the rescaled overlap parameter obeys a moderate deviation principle with speed N1–4 and a rate function that is basically a fourth power. The random term occurring in the Central Limit theorem for the overlap at c = 1 is no longer present on a moderate deviation scale. If the scaling is even closer to N1/4, e.g. if we multiply the overlap parameter by N1/4 log log N the moderate deviation principle breaks down. The case of variable temperature converging to one is also considered. If N converges to c fast enough, i.e. faster than the non-Gaussian rate function persists, whereas for N converging to one slower than the moderate deviations principle is given by the Gaussian rate. At the borderline the moderate deviation rate function is the one at criticality plus an additional Gaussian term.Research supported by the Volkswagen-Stiftung (RiP-program at Oberwolfach, Germany).Mathematics Subject Classification (2000): 60F10 (primary), 60K35, 82B44, 82D30 (secondary) 相似文献
83.
时延细胞神经网络的概周期解的存在性和指数稳定性 总被引:1,自引:0,他引:1
研究时延细胞神经网络的概周期解存在性和全局指数稳定性问题 ,巧妙地引入可调实参数di>0 (i =1,2 ,… ,n) ,获得了该神经网络存在唯一的概周期解的充分条件和所有其它解均指数地收敛于此概周期解的充分条件 . 相似文献
84.
A key challenge for call centres remains the forecasting of high frequency call arrivals collected in hourly or shorter time buckets. In addition to the complex intraday, intraweek and intrayear seasonal cycles, call arrival data typically contain a large number of anomalous days, driven by the occurrence of holidays, special events, promotional activities and system failures. This study evaluates the use of a variety of univariate time series forecasting methods for forecasting intraday call arrivals in the presence of such outliers. Apart from established, statistical methods, we consider artificial neural networks (ANNs). Based on the modelling flexibility of the latter, we introduce and evaluate different methods to encode the outlying periods. Using intraday arrival series from a call centre operated by one of Europe’s leading entertainment companies, we provide new insights on the impact of outliers on the performance of established forecasting methods. Results show that ANNs forecast call centre data accurately, and are capable of modelling complex outliers using relatively simple outlier modelling approaches. We argue that the relative complexity of ANNs over standard statistical models is offset by the simplicity of coding multiple and unknown effects during outlying periods. 相似文献
85.
Recently, linear programming problems with special structures have assumed growing importance in mathematical programming.
It is well known that exploiting network structures within linear programs can lead to considerable improvement of the computational
solution of large-scale linear programming problems. A linear program is said to contain an embedded network structure provided
that some subset of its constraints can be interpreted as specifying conservation of flow. If a column of the constraint matrix
has at most two non-zeros, then it leads to embedded generalized network structure and if these non-zeros are unit elements
and of opposite signs, then it leads to embedded pure network structure.
In this paper, we are concerned with algorithms for detecting embedded pure network structures within linear programs. The
network extraction methods are presented in two groups. The first group covers deletion and addition based algorithms and
the second group covers GUB based algorithms. We have extended the GUB based algorithm appearing in the second group by introducing
Markowitz merit count approach for exploiting matrix non zeros. A set of well known test problems has been used to carry out
computational experiments which show that our extensions to the GUB based algorithms give better results than the algorithms
reported earlier. 相似文献
86.
综合评判的神经网络方法 总被引:20,自引:1,他引:20
综合评判的方法已经广泛运用到信息,决策,管理和控制等领域,但是它的两大难点-权重和单因素评价矩阵的确定越来越来明显地展现在人们面前,本文试图用神经网络方法来解决这两个难点,并从理论上证明了这种方法的收敛性。 相似文献
87.
本文主要讨论单个函数平移和伸缩的线性组合对Lp(Rn)中任一紧集内函数的逼近.给出一个很强的逼近结果.这在神经网络应用研究中具有重要意义. 相似文献
88.
Forecasting the number of warranty claims is vitally important for manufacturers/warranty providers in preparing fiscal plans. In existing literature, a number of techniques such as log-linear Poisson models, Kalman filter, time series models, and artificial neural network models have been developed. Nevertheless, one might find two weaknesses existing in these approaches: (1) they do not consider the fact that warranty claims reported in the recent months might be more important in forecasting future warranty claims than those reported in the earlier months, and (2) they are developed based on repair rates (i.e., the total number of claims divided by the total number of products in service), which can cause information loss through such an arithmetic-mean operation.To overcome the above two weaknesses, this paper introduces two different approaches to forecasting warranty claims: the first is a weighted support vector regression (SVR) model and the second is a weighted SVR-based time series model. These two approaches can be applied to two scenarios: when only claim rate data are available and when original claim data are available. Two case studies are conducted to validate the two modelling approaches. On the basis of model evaluation over six months ahead forecasting, the results show that the proposed models exhibit superior performance compared to that of multilayer perceptrons, radial basis function networks and ordinary support vector regression models. 相似文献
89.
The dynamics of a neural network model in neutral form is investigated. We prove that a sequence of Hopf bifurcations occurs at the origin as the delay increases. The direction of the Hopf bifurcations and the stability of the bifurcating periodic solutions are determined by using normal form method and center manifold theory. Global existence of periodic solutions is established using a global Hopf bifurcation result of Krawcewicz et al. and a Bendixson's criterion for higher dimensional ordinary differential equations due to Li and Muldowney. 相似文献
90.
The particle swarm optimization (PSO) technique is a powerful stochastic evolutionary algorithm that can be used to find the global optimum solution in a complex search space. This paper presents a variation on the standard PSO algorithm called the rank based particle swarm optimizer, or PSOrank, employing cooperative behavior of the particles to significantly improve the performance of the original algorithm. In this method, in order to efficiently control the local search and convergence to global optimum solution, the γ best particles are taken to contribute to the updating of the position of a candidate particle. The contribution of each particle is proportional to its strength. The strength is a function of three parameters: strivness, immediacy and number of contributed particles. All particles are sorted according to their fitness values, and only the γ best particles will be selected. The value of γ decreases linearly as the iteration increases. A time-varying inertia weight decreasing non-linearly is introduced to improve the performance. PSOrank is tested on a commonly used set of optimization problems and is compared to other variants of the PSO algorithm presented in the literature. As a real application, PSOrank is used for neural network training. The PSOrank strategy outperformed all the methods considered in this investigation for most of the functions. Experimental results show the suitability of the proposed algorithm in terms of effectiveness and robustness. 相似文献