全文获取类型
收费全文 | 2470篇 |
免费 | 633篇 |
国内免费 | 144篇 |
专业分类
化学 | 541篇 |
晶体学 | 11篇 |
力学 | 636篇 |
综合类 | 51篇 |
数学 | 829篇 |
物理学 | 1179篇 |
出版年
2024年 | 2篇 |
2023年 | 18篇 |
2022年 | 37篇 |
2021年 | 79篇 |
2020年 | 82篇 |
2019年 | 78篇 |
2018年 | 69篇 |
2017年 | 131篇 |
2016年 | 132篇 |
2015年 | 105篇 |
2014年 | 139篇 |
2013年 | 193篇 |
2012年 | 198篇 |
2011年 | 164篇 |
2010年 | 133篇 |
2009年 | 143篇 |
2008年 | 174篇 |
2007年 | 132篇 |
2006年 | 137篇 |
2005年 | 134篇 |
2004年 | 125篇 |
2003年 | 114篇 |
2002年 | 98篇 |
2001年 | 108篇 |
2000年 | 76篇 |
1999年 | 66篇 |
1998年 | 67篇 |
1997年 | 67篇 |
1996年 | 46篇 |
1995年 | 43篇 |
1994年 | 26篇 |
1993年 | 25篇 |
1992年 | 23篇 |
1991年 | 17篇 |
1990年 | 15篇 |
1989年 | 8篇 |
1988年 | 8篇 |
1987年 | 8篇 |
1986年 | 6篇 |
1985年 | 3篇 |
1984年 | 6篇 |
1983年 | 1篇 |
1982年 | 2篇 |
1981年 | 2篇 |
1979年 | 2篇 |
1977年 | 1篇 |
1976年 | 2篇 |
1974年 | 1篇 |
1959年 | 1篇 |
排序方式: 共有3247条查询结果,搜索用时 156 毫秒
21.
Robert J. Rubin 《Journal of statistical physics》1991,65(5-6):1207-1216
A one-dimensional lattice random walk in the presence ofm equally spaced traps is considered. The step length distribution is a symmetric exponential. An explicit analytic expression is obtained for the probability that the random walk will be trapped at thejth trapping site. 相似文献
22.
王胜奎 《数学的实践与认识》2006,36(5):5-10
根据松纵坑切梢小蠹的主要生物学特征,通过分析抚育间伐持续控制松纵坑切梢小蠹虫害的机理,应用复杂适应系统(CA S)理论,建立了模拟松纵坑切梢小蠹虫害的一种动态演化数学模型,并讨论了模型的收敛性.然后选用昆明小哨林场为背景,进行了各种抚育间伐决策的仿真,从中优选抚育间伐决策.结果表明:模拟优化方案与实际调查统计分析结果一致:均为弱度间伐与中弱度间伐控制蠹害效果最好.最后通过森林积材量与虫害程度之间的优化,给出了抚育间伐的优化策略. 相似文献
23.
In this paper, we study the consistency of a variant of fractionalstep Runge–Kutta methods. These methods are designed tointegrate efficiently semi-linear multidimensional parabolicproblems by means of linearly implicit time integration processes.Such time discretization procedures are also related to a splittingof the space differential operator (or the spatial discretizationof it) as a sum of simpler linear differentialoperators and a nonlinear term. 相似文献
24.
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. 相似文献
25.
26.
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 相似文献
27.
将心磁信号从干扰噪声中加以提取并有效地消除噪声干扰是心磁信号处理中尤为重要的环节 .从改进算法的角度出发,提出互补型自适应滤波器结构以实现心磁信号的消噪处理.该滤波器针对心磁这类非平稳信号进行设计,有效地解决了常规自适应滤波器应用于心磁信号处理时收敛速度和稳态误差的矛盾.通过仿真实验和心磁实验结果表明,该算法能有效地消除心磁信号的背景噪声和工频干扰噪声.同时该算法也可用于其他非平稳信号的消噪处理.
关键词:
自适应滤波
心磁图
最小均方误差 相似文献
28.
通过保持非耗散介观LC电路的固有频率不变,而使电路参数作阶跃函数变化,就可将介观LC电路由初始的偶相干态制备到压缩偶相干态;在压缩偶相干态下,介观电路系统不仅有非经典的量子压缩效应,而且有非经典的反聚束效应.
关键词:
介观LC电路
单位阶跃函数
压缩算符
压缩偶相干态 相似文献
29.
30.
It is proposed that continuous time is in effect discretized in the brain by dynamic pattern recognition mechanisms in neurons. Time discretization is required to support formal computations in continuous time systems consisting of a large number of components. The ability to perform formal computations is necessary if the system is to execute high level algorithms of the type used in present day artificial intelligence. The weakness of such algorithms is that they work efficiently only when the forms of patterns and objects presented to them are highly constrained. The dynamic mechanisms which discretize the brain's time line also serve to code patterns into constrained forms suitable for high level processing. 相似文献