全文获取类型
收费全文 | 3102篇 |
免费 | 390篇 |
国内免费 | 225篇 |
专业分类
化学 | 746篇 |
晶体学 | 18篇 |
力学 | 365篇 |
综合类 | 75篇 |
数学 | 1132篇 |
物理学 | 1381篇 |
出版年
2024年 | 4篇 |
2023年 | 18篇 |
2022年 | 75篇 |
2021年 | 81篇 |
2020年 | 85篇 |
2019年 | 69篇 |
2018年 | 57篇 |
2017年 | 92篇 |
2016年 | 118篇 |
2015年 | 88篇 |
2014年 | 139篇 |
2013年 | 225篇 |
2012年 | 180篇 |
2011年 | 194篇 |
2010年 | 163篇 |
2009年 | 187篇 |
2008年 | 214篇 |
2007年 | 162篇 |
2006年 | 176篇 |
2005年 | 156篇 |
2004年 | 130篇 |
2003年 | 120篇 |
2002年 | 117篇 |
2001年 | 122篇 |
2000年 | 87篇 |
1999年 | 86篇 |
1998年 | 83篇 |
1997年 | 71篇 |
1996年 | 76篇 |
1995年 | 38篇 |
1994年 | 38篇 |
1993年 | 35篇 |
1992年 | 42篇 |
1991年 | 23篇 |
1990年 | 23篇 |
1989年 | 23篇 |
1988年 | 20篇 |
1987年 | 16篇 |
1986年 | 8篇 |
1985年 | 12篇 |
1984年 | 17篇 |
1983年 | 4篇 |
1982年 | 10篇 |
1981年 | 4篇 |
1980年 | 11篇 |
1979年 | 6篇 |
1978年 | 5篇 |
1974年 | 1篇 |
1973年 | 3篇 |
1957年 | 1篇 |
排序方式: 共有3717条查询结果,搜索用时 15 毫秒
21.
运输网络中最小饱和流的求解 总被引:4,自引:0,他引:4
运输网络中常常由于流量的不可控易发生堵塞现象.网络发生堵塞时的饱和流值达不到最大流值.最小饱和流是运输网络,尤其是紧急疏散网络设计中很重要的一个参数.通过建立网络的割集矩阵来确定网络的堵塞截面,基于此提出了求解最小饱和流的线性规划模型及算法.举例分析表明,利用该算法计算网络最小饱和流更加简便、更加实用. 相似文献
22.
We present in this paper an efficient approach for solving the problem of planning the long-term (multiyear) operation of a multireservoir hydroelectric power system for the critical period with a monthly variable load. This load is equal to a certain percentage of the total generation at the end of the year, subject to satisfying a number of constraints on the hydrosystem, using the minimum norm formulation.The proposed method is efficient in computing time and in calculating the total expected benefits from the system during the critical period. Numerical results are reported for a real system in operation consisting of two rivers. Each river has two series reservoirs.This work was supported by the Natural Science and Engineering Research Council of Canada, Grant No. A4146. 相似文献
23.
对具有消息恢复的数字签名方案提出了两种攻击方法.此外,对原方案进行了改进,通过对改进方案的安全性分析得出结论:改进方案比原方案更安全,并且消息恢复过程只需要计算一次大数模幂乘和两次单向函数. 相似文献
24.
构造了第孙中禹种强度不等的非对称三态叠加多模叠加态光场|ψ1(ABC)〉q.利用多模压缩态理论研究了态|ψ1(ABC)〉q第一正交分量高次和压缩.结果发现:①当构成态|ψ1(ABC)〉q的三个多模相干态光场的强度不相等时,在一定条件下,态|ψ1(ABC)〉q的第一正交分量可出现任意幂次的高次和压缩.②当上述的三个多模相干态光场强度相等时,态|ψ1(ABC)〉q的第一正交分量的高次和压缩现象消失.在这种情况下,态|ψ1(ABC)〉q的第一正交分量恒处于NH最小测不准态. 相似文献
25.
A new parallel storm surge model, the Parallel Environmental Model (PEM), is developed and tested by comparisons with analytic solutions. The PEM is a 2‐D vertically averaged, wetting and drying numerical model and can be operated in explicit, semi‐implicit and fully implicit modes. In the implicit mode, the propagation, Coriolis and bottom friction terms can all be treated implicitly. The advection and diffusion terms are solved with a parallel Eulerian–Lagrangian scheme developed for this study. The model is developed specifically for use on parallel computer systems and will function accordingly in either explicit of implicit modes. Storm boundary conditions are based on a simple exponential decay of pressure from the centre of a storm. The simulated flooding caused by a major Category 5 hurricane making landfall in the Indian River Lagoon, Florida is then presented as an example application of the PEM. Copyright © 2003 John Wiley & Sons, Ltd. 相似文献
26.
27.
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 相似文献
28.
29.
Tunable microlens arrays using polymer network liquid crystal 总被引:1,自引:0,他引:1
A tunable-focus microlens array based on polymer network liquid crystal (PNLC) is demonstrated. The PNLC was prepared using an ultraviolet (UV) light exposure through a patterned photomask. The photocurable monomer in each of the UV exposed spot forms an inhomogeneous centro-symmetrical polymer network which acts as a lens when a homogeneous electric field is applied to the cell. The focal length of the microlens arrays is tunable with the applied voltage. 相似文献
30.
利用相干渡越辐射(CTR)测量短和超短电子束团长度是国际上束测领域新发展的频域测量技术.文中理论分析和数值计算了北京自由电子激光装置的皮秒级的射频电子束团序列产生的CTR,当辐射波长在长于束长(4ps)时,渡越辐射发生相干增强效应;与非相干渡越辐射相比,当λ≥2πσz时,增强的倍数约等于束团中粒子的数目(108);CTR从亚毫米波到毫米波段呈宽带连续谱特性;渡越辐射能量主要集中在轴线附近,宏脉冲辐射能量高达几毫焦.设计采用偏振型束团长度测量系统,利用CTR自相关技术,实验测量该束团序列的纵向长度,并藉助傅里叶变换光谱法,推求束团电子分布. 相似文献