全文获取类型
收费全文 | 3122篇 |
免费 | 662篇 |
国内免费 | 119篇 |
专业分类
化学 | 493篇 |
晶体学 | 25篇 |
力学 | 918篇 |
综合类 | 73篇 |
数学 | 1035篇 |
物理学 | 1359篇 |
出版年
2024年 | 5篇 |
2023年 | 26篇 |
2022年 | 77篇 |
2021年 | 104篇 |
2020年 | 100篇 |
2019年 | 71篇 |
2018年 | 76篇 |
2017年 | 139篇 |
2016年 | 158篇 |
2015年 | 105篇 |
2014年 | 155篇 |
2013年 | 230篇 |
2012年 | 207篇 |
2011年 | 224篇 |
2010年 | 164篇 |
2009年 | 191篇 |
2008年 | 198篇 |
2007年 | 189篇 |
2006年 | 173篇 |
2005年 | 168篇 |
2004年 | 165篇 |
2003年 | 144篇 |
2002年 | 127篇 |
2001年 | 112篇 |
2000年 | 94篇 |
1999年 | 80篇 |
1998年 | 83篇 |
1997年 | 76篇 |
1996年 | 53篇 |
1995年 | 45篇 |
1994年 | 35篇 |
1993年 | 28篇 |
1992年 | 20篇 |
1991年 | 20篇 |
1990年 | 12篇 |
1989年 | 7篇 |
1988年 | 8篇 |
1987年 | 8篇 |
1986年 | 7篇 |
1985年 | 6篇 |
1984年 | 4篇 |
1982年 | 2篇 |
1981年 | 1篇 |
1979年 | 1篇 |
1977年 | 1篇 |
1976年 | 1篇 |
1975年 | 1篇 |
1974年 | 1篇 |
1959年 | 1篇 |
排序方式: 共有3903条查询结果,搜索用时 15 毫秒
21.
王胜奎 《数学的实践与认识》2006,36(5):5-10
根据松纵坑切梢小蠹的主要生物学特征,通过分析抚育间伐持续控制松纵坑切梢小蠹虫害的机理,应用复杂适应系统(CA S)理论,建立了模拟松纵坑切梢小蠹虫害的一种动态演化数学模型,并讨论了模型的收敛性.然后选用昆明小哨林场为背景,进行了各种抚育间伐决策的仿真,从中优选抚育间伐决策.结果表明:模拟优化方案与实际调查统计分析结果一致:均为弱度间伐与中弱度间伐控制蠹害效果最好.最后通过森林积材量与虫害程度之间的优化,给出了抚育间伐的优化策略. 相似文献
22.
Boniface Nkemzi 《Mathematical Methods in the Applied Sciences》2006,29(9):1053-1080
This paper is concerned with the structure of the singular and regular parts of the solution of time‐harmonic Maxwell's equations in polygonal plane domains and their effective numerical treatment. The asymptotic behaviour of the solution near corner points of the domain is studied by means of discrete Fourier transformation and it is proved that the solution of the boundary value problem does not belong locally to H2 when the boundary of the domain has non‐acute angles. A splitting of the solution into a regular part belonging to the space H2, and an explicitly described singular part is presented. For the numerical treatment of the boundary value problem, we propose a finite element discretization which combines local mesh grading and the singular field methods and derive a priori error estimates that show optimal convergence as known for the classical finite element method for problems with regular solutions. Copyright © 2006 John Wiley & Sons, Ltd. 相似文献
23.
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.
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 相似文献
26.
将心磁信号从干扰噪声中加以提取并有效地消除噪声干扰是心磁信号处理中尤为重要的环节 .从改进算法的角度出发,提出互补型自适应滤波器结构以实现心磁信号的消噪处理.该滤波器针对心磁这类非平稳信号进行设计,有效地解决了常规自适应滤波器应用于心磁信号处理时收敛速度和稳态误差的矛盾.通过仿真实验和心磁实验结果表明,该算法能有效地消除心磁信号的背景噪声和工频干扰噪声.同时该算法也可用于其他非平稳信号的消噪处理.
关键词:
自适应滤波
心磁图
最小均方误差 相似文献
27.
YunFei Liu ShengCai Shi ShengLin Yu 《International Journal of Infrared and Millimeter Waves》2003,24(12):2069-2077
When electromagnetic waves propagate through a wire grid, there will be some evanescent space harmonics generated around the wire grid. In this paper, we mainly investigate their effects on the transmission characteristics of a Gaussian beam by cylindrical wire grids. The results are compared with those without taking account of evanescent space-harmonics. 相似文献
28.
杨青 《高校应用数学学报(A辑)》2002,17(3):353-362
热传导型半导体器件的瞬时状态由四个方程的非线性偏微分方程组的初边值问题所决定,其中电子位势方程是椭圆型的,电子和空穴浓度方程是对流扩散型的,温度方程为热传导型的。本文提出解这类问题的特征变网格有限元法,并进行了理论分析,在一定条件下,得到了某种意义下的最佳L^2误差估计结果。 相似文献
29.
30.