全文获取类型
收费全文 | 9987篇 |
免费 | 1589篇 |
国内免费 | 915篇 |
专业分类
化学 | 3741篇 |
晶体学 | 71篇 |
力学 | 955篇 |
综合类 | 297篇 |
数学 | 3636篇 |
物理学 | 3791篇 |
出版年
2024年 | 37篇 |
2023年 | 151篇 |
2022年 | 530篇 |
2021年 | 431篇 |
2020年 | 317篇 |
2019年 | 268篇 |
2018年 | 230篇 |
2017年 | 405篇 |
2016年 | 443篇 |
2015年 | 372篇 |
2014年 | 632篇 |
2013年 | 825篇 |
2012年 | 622篇 |
2011年 | 604篇 |
2010年 | 526篇 |
2009年 | 595篇 |
2008年 | 554篇 |
2007年 | 606篇 |
2006年 | 503篇 |
2005年 | 430篇 |
2004年 | 398篇 |
2003年 | 381篇 |
2002年 | 362篇 |
2001年 | 273篇 |
2000年 | 294篇 |
1999年 | 270篇 |
1998年 | 223篇 |
1997年 | 213篇 |
1996年 | 162篇 |
1995年 | 117篇 |
1994年 | 126篇 |
1993年 | 102篇 |
1992年 | 70篇 |
1991年 | 64篇 |
1990年 | 58篇 |
1989年 | 31篇 |
1988年 | 34篇 |
1987年 | 29篇 |
1986年 | 40篇 |
1985年 | 31篇 |
1984年 | 26篇 |
1982年 | 17篇 |
1981年 | 11篇 |
1980年 | 8篇 |
1979年 | 16篇 |
1978年 | 10篇 |
1977年 | 14篇 |
1976年 | 5篇 |
1972年 | 5篇 |
1959年 | 4篇 |
排序方式: 共有10000条查询结果,搜索用时 46 毫秒
91.
M. Brazil 《Discrete Applied Mathematics》2006,154(18):2545-2564
The Steiner problem in a λ-plane is the problem of constructing a minimum length network interconnecting a given set of nodes (called terminals), with the constraint that all line segments in the network have slopes chosen from λ uniform orientations in the plane. This network is referred to as a minimum λ-tree. The problem is a generalization of the classical Euclidean and rectilinear Steiner tree problems, with important applications to VLSI wiring design.A λ-tree is said to be locally minimal if its length cannot be reduced by small perturbations of its Steiner points. In this paper we prove that a λ-tree is locally minimal if and only if the length of each path in the tree cannot be reduced under a special parallel perturbation on paths known as a shift. This proves a conjecture on necessary and sufficient conditions for locally minimal λ-trees raised in [M. Brazil, D.A. Thomas, J.F. Weng, Forbidden subpaths for Steiner minimum networks in uniform orientation metrics, Networks 39 (2002) 186-222]. For any path P in a λ-tree T, we then find a simple condition, based on the sum of all angles on one side of P, to determine whether a shift on P reduces, preserves, or increases the length of T. This result improves on our previous forbidden paths results in [M. Brazil, D.A. Thomas, J.F. Weng, Forbidden subpaths for Steiner minimum networks in uniform orientation metrics, Networks 39 (2002) 186-222]. 相似文献
92.
Reverse-mode polymer stabilized cholesteric texture (PSCT) cells with various chiral dopant and monomer concentrations were fabricated. Experimental results indicate that the chiral dopant concentration and the monomer concentration significantly influence the threshold voltage and hysteresis of the cells. The chiral dopant and monomer deform the hysteresis loop. Increasing the monomer concentration reduces the width of the hysteresis loop of the reverse-mode PSCT cell. 相似文献
93.
Lubomír Kubáček 《Mathematica Slovaca》2007,57(1):59-82
In some situations estimates of unknown parameters must be corrected by additional measurements. It is in principle no problem
to calculate the corrected estimates, however, it is of more interest to find formulae for correction itself. The formulae
enable us to design an additional experiment and to judge its usefulness.
The aim of the paper is to find such formulae for several situations.
Supported by the grant of the Council of Czech Government MSM 6 198 959 214. 相似文献
94.
95.
We investigate traces of functions, belonging to a class of functions with dominating mixed smoothness in ℝ3, with respect to planes in oblique position. In comparison with the classical theory for isotropic spaces a few new phenomenona
occur. We shall present two different approaches. One is based on the use of the Fourier transform and restricted to p = 2. The other one is applicable in the general case of Besov-Lizorkin-Triebel spaces and based on atomic decompositions. 相似文献
96.
研究了初态为混合态的电荷量子比特与量子化光场之间的纠缠.通过求解系统的concurrence下限, 研究初态的混合度λ和失谐量Δ对系统纠缠随时间演化的影响. 在弱场中, 电荷量子比特初始是激发态的系统, 其纠缠度远远大于电荷量子比特初始是基态的系统, 并且Δ对系统的纠缠有明显的抑制作用. 在强场中, 电荷量子比特初始分别为激发态和基态时系统的纠缠演化接近一致, 初态混合度最高时系统的纠缠度最小, 并且Δ对系统纠缠的影响变弱.
关键词:
约瑟夫森结
纠缠
混合态
concurrence下限 相似文献
97.
1引言 有限体积方法[l]一l’]作为守恒型的离散技术,被广泛应用于工程计算领域.文【2,3} 基于分片常数和分片常向量函数空间,对二维驻定对流扩散方程提出了一类非协调混合 有限体积(Covolume)格式,证明了格式具有。(hl/2)收敛精度.但该格式要求对偶剖分 比较规则,即采用重 相似文献
98.
A class of circuit-switching open queueing networks is discussed. The main result of the paper is that if extra message flows are not too intensive and the path distribution is mainly concentrated on the paths of (graph) distance 1 (nearest neighbour connections), then the network has a unique stationary working regime, no matter how large the configuration graph of the network is. Standard properties of this regime are established such as decay of correlation and continuity. 相似文献
99.
Richard F. Serfozo 《Queueing Systems》1989,5(1-3):5-36
A Markovian network process describes the movement of discrete units among a set of nodes that process the units. There is considerable knowledge of such networks, often called queueing networks, in which the nodes operate independently and the routes of the units are independent. The focus of this study, in contrast, is on networks with dependent nodes and routings. Examples of dependencies are parallel processing across several nodes, blocking of transitions because of capacity constraints on nodes, alternate routing of units to avoid congestion, and accelerating or decelerating the processing rate at a node depending on downstream congestion. We introduce a general network process representing the numbers of units at the nodes and derive its equilibrium distribution. This distribution takes the form of a product of functions of vectors in which the arguments of the functions satisfy an interchangeability property. This new type of distribution may apply to other multi-variate processes as well. A basic idea in our approach is a linking of certain micro-level balance properties of the network routing to the processing rates at the nodes. The link is via routing-balance partitions of nodes that are inherent in any network. A byproduct of this approach is a general characterization of blocking of transitions without the restriction that the process is reversible, which had been a standard assumption. We also give necessary and sufficient conditions under which a unit moving in the network sees a time average for the unmoved units (called the MUSTA property). Finally, we discuss when certain flows between nodes in an open network are Poisson processes.This research was sponsored in part by Air Force Office of Scientific Research contract 84-0367. 相似文献
100.
Hiroshi Konno 《Mathematical Programming》1988,41(1-3):185-193
We will consider a concave minimization problem associated with a series production system in which raw material is processed inm consecutive facilities. The products at some facility are either sent to the next facility or stocked in the warehouse. The amount of demand for the final products during periodi, i = 1,,n, are known in advance. Our problem is to minimize the sum of processing, holding and backlogging cost, all of which are assumed to be concave.The origin of this model is the classical economic lot size problem of Wagner and Whitin and was extensively studied by Zangwill. This model is very important from the theoretical as well as practical point of view and this is one of the very rare instances in which polynomial time algorithm has been constructed for concave minimization problems.The purpose of this paper is to extend the model further to the situation in which time lag is associated with processing at each facility. We will propose an efficient O(n
4
m) algorithm for this class of problems. 相似文献