全文获取类型
收费全文 | 1652篇 |
免费 | 510篇 |
国内免费 | 56篇 |
专业分类
化学 | 124篇 |
晶体学 | 1篇 |
力学 | 423篇 |
综合类 | 46篇 |
数学 | 646篇 |
物理学 | 978篇 |
出版年
2024年 | 2篇 |
2023年 | 14篇 |
2022年 | 55篇 |
2021年 | 67篇 |
2020年 | 64篇 |
2019年 | 43篇 |
2018年 | 44篇 |
2017年 | 96篇 |
2016年 | 104篇 |
2015年 | 75篇 |
2014年 | 90篇 |
2013年 | 117篇 |
2012年 | 136篇 |
2011年 | 111篇 |
2010年 | 88篇 |
2009年 | 95篇 |
2008年 | 121篇 |
2007年 | 90篇 |
2006年 | 83篇 |
2005年 | 92篇 |
2004年 | 81篇 |
2003年 | 71篇 |
2002年 | 67篇 |
2001年 | 70篇 |
2000年 | 54篇 |
1999年 | 46篇 |
1998年 | 43篇 |
1997年 | 49篇 |
1996年 | 35篇 |
1995年 | 27篇 |
1994年 | 16篇 |
1993年 | 14篇 |
1992年 | 10篇 |
1991年 | 6篇 |
1990年 | 7篇 |
1989年 | 4篇 |
1988年 | 7篇 |
1987年 | 8篇 |
1986年 | 4篇 |
1985年 | 3篇 |
1984年 | 3篇 |
1981年 | 1篇 |
1979年 | 1篇 |
1977年 | 1篇 |
1976年 | 1篇 |
1974年 | 1篇 |
1959年 | 1篇 |
排序方式: 共有2218条查询结果,搜索用时 15 毫秒
11.
Roderich Tumulka 《Foundations of Physics》2007,37(2):186-197
In a recent paper Conway and Kochen, Found. Phys. 36, 2006, claim to have established that theories of the Ghirardi-Rimini-Weber
(RW) type, i.e., of spontaneous wave function collapse, cannot be made relativistic. On the other hand, relativistic GRW-type
theories have already been presented, in my recent paper, J. Stat. Phys. 125, 2006, and by Dowker and Henson, J. Stat. Phys.
115, 2004. Here, I elucidate why these are not excluded by the arguments of Conway and Kochen.
相似文献
12.
Marianna Pensky 《Annals of the Institute of Statistical Mathematics》2002,54(1):83-99
The traditional empirical Bayes (EB) model is considered with the parameter being a location parameter, in the situation when the Bayes estimator has a finite degree of smoothness and, possibly, jump discontinuities at several points. A nonlinear wavelet EB estimator based on wavelets with bounded supports is constructed, and it is shown that a finite number of jump discontinuities in the Bayes estimator do not affect the rate of convergence of the prior risk of the EB estimator to zero. It is also demonstrated that the estimator adjusts to the degree of smoothness of the Bayes estimator, locally, so that outside the neighborhoods of the points of discontinuities, the posterior risk has a high rate of convergence to zero. Hence, the technique suggested in the paper provides estimators which are significantly superior in several respects to those constructed earlier. 相似文献
13.
王胜奎 《数学的实践与认识》2006,36(5):5-10
根据松纵坑切梢小蠹的主要生物学特征,通过分析抚育间伐持续控制松纵坑切梢小蠹虫害的机理,应用复杂适应系统(CA S)理论,建立了模拟松纵坑切梢小蠹虫害的一种动态演化数学模型,并讨论了模型的收敛性.然后选用昆明小哨林场为背景,进行了各种抚育间伐决策的仿真,从中优选抚育间伐决策.结果表明:模拟优化方案与实际调查统计分析结果一致:均为弱度间伐与中弱度间伐控制蠹害效果最好.最后通过森林积材量与虫害程度之间的优化,给出了抚育间伐的优化策略. 相似文献
14.
In this work, the NP-hard maximum clique problem on graphs is considered. Starting from basic greedy heuristics, modifications and improvements are proposed and combined in a two-phase heuristic procedure. In the first phase an improved greedy procedure is applied starting from each node of the graph; on the basis of the results of this phase a reduced subset of nodes is selected and an adaptive greedy algorithm is repeatedly started to build cliques around such nodes. In each restart the selection of nodes is biased by the maximal clique generated in the previous execution. Computational results are reported on the DIMACS benchmarks suite. Remarkably, the two-phase procedure successfully solves the difficult Brockington-Culberson instances, and is generally competitive with state-of-the-art much more complex heuristics. 相似文献
15.
This paper is about algorithms that schedule tasks to be performed in a distributed failure‐prone environment, when processors communicate by message‐passing, and when tasks are independent and of unit length. The processors work under synchrony and may fail by crashing. Failure patterns are imposed by adversaries. Linearly‐bounded adversaries may fail up to a constant fraction of the processors. Weakly‐adaptive adversaries have to select, prior to the start of an execution, a subset of processors to be failure‐prone, and then may fail only the selected processors, at arbitrary steps, in the course of the execution. Strongly adaptive adversaries have a total number of failures as the only restriction on failure patterns. The measures of complexity are work, measured as the available processor steps, and communication, measured as the number of point‐to‐point messages. A randomized algorithm is developed, that attains both ??(n log*n) expected work and ??(n log*n) expected communication, against weakly‐adaptive linearly‐bounded adversaries, in the case when the numbers of tasks and processors are both equal to n. This is in contrast with performance of algorithms against strongly‐adaptive linearly‐bounded adversaries, which has to be Ω(n log n/log log n) in terms of work. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 2004 相似文献
16.
将心磁信号从干扰噪声中加以提取并有效地消除噪声干扰是心磁信号处理中尤为重要的环节 .从改进算法的角度出发,提出互补型自适应滤波器结构以实现心磁信号的消噪处理.该滤波器针对心磁这类非平稳信号进行设计,有效地解决了常规自适应滤波器应用于心磁信号处理时收敛速度和稳态误差的矛盾.通过仿真实验和心磁实验结果表明,该算法能有效地消除心磁信号的背景噪声和工频干扰噪声.同时该算法也可用于其他非平稳信号的消噪处理.
关键词:
自适应滤波
心磁图
最小均方误差 相似文献
17.
18.
Twin Paradox and the Logical Foundation of Relativity Theory 总被引:3,自引:0,他引:3
We study the foundation of space-time theory in the framework of first-order logic (FOL). Since the foundation of mathematics has been successfully carried through (via set theory) in FOL, it is not entirely impossible to do the same for space-time theory (or relativity). First we recall a simple and streamlined FOL-axiomatization Specrel of special relativity from the literature. Specrel is complete with respect to questions about inertial motion. Then we ask ourselves whether we can prove the usual relativistic properties of accelerated motion (e.g., clocks in acceleration) in Specrel. As it turns out, this is practically equivalent to asking whether Specrel is strong enough to “handle” (or treat) accelerated observers. We show that there is a mathematical principle called induction (IND) coming from real analysis which needs to be added to Specrel in order to handle situations involving relativistic acceleration. We present an extended version AccRel of Specrel which is strong enough to handle accelerated motion, in particular, accelerated observers. Among others, we show that~the Twin Paradox becomes provable in AccRel, but it is not provable without IND. 相似文献
19.
提出了一种应用于自适应PID控制器的神经网络与模糊控制相结合的算法,该算法可以有效地解决普通PID控制器依赖于对象的数学模型的缺点,可实现控制系统的在线自适应调整,可满足实时控制的要求。仿真结果表明,基于模糊神经网络整定的PID控制器具有较好的自学习和自适应性,具有较快的响应速度。 相似文献
20.
In this paper, we discuss the classical ill-posed problem of numerical differentiation, assuming that the smoothness of the function to be differentiated is unknown. Using recent results on adaptive regularization of general ill-posed problems, we propose new rules for the choice of the stepsize in the finite-difference methods, and for the regularization parameter choice in numerical differentiation regularized by the iterated Tikhonov method. These methods are shown to be effective for the differentiation of noisy functions, and the order-optimal convergence results for them are proved.