全文获取类型
收费全文 | 2693篇 |
免费 | 330篇 |
国内免费 | 126篇 |
专业分类
化学 | 1013篇 |
晶体学 | 5篇 |
力学 | 389篇 |
综合类 | 14篇 |
数学 | 410篇 |
物理学 | 348篇 |
综合类 | 970篇 |
出版年
2024年 | 10篇 |
2023年 | 42篇 |
2022年 | 120篇 |
2021年 | 110篇 |
2020年 | 126篇 |
2019年 | 101篇 |
2018年 | 71篇 |
2017年 | 84篇 |
2016年 | 167篇 |
2015年 | 126篇 |
2014年 | 152篇 |
2013年 | 222篇 |
2012年 | 168篇 |
2011年 | 171篇 |
2010年 | 104篇 |
2009年 | 120篇 |
2008年 | 96篇 |
2007年 | 136篇 |
2006年 | 98篇 |
2005年 | 103篇 |
2004年 | 85篇 |
2003年 | 82篇 |
2002年 | 109篇 |
2001年 | 58篇 |
2000年 | 63篇 |
1999年 | 53篇 |
1998年 | 45篇 |
1997年 | 41篇 |
1996年 | 38篇 |
1995年 | 30篇 |
1994年 | 30篇 |
1993年 | 23篇 |
1992年 | 19篇 |
1991年 | 15篇 |
1990年 | 19篇 |
1989年 | 18篇 |
1988年 | 19篇 |
1987年 | 19篇 |
1986年 | 16篇 |
1985年 | 18篇 |
1984年 | 10篇 |
1983年 | 4篇 |
1982年 | 2篇 |
1981年 | 1篇 |
1978年 | 2篇 |
1975年 | 1篇 |
1971年 | 1篇 |
1955年 | 1篇 |
排序方式: 共有3149条查询结果,搜索用时 31 毫秒
31.
刘建元 《陕西师范大学学报(自然科学版)》2002,30(2):55-58
依据有序二叉判定图(OBDD)和计算树逻辑(或称分支时态逻辑)CTL(Computational Tree Logic)的基本原理,分析了基于OBDD和CTL的验证数据电路设计的基本原理,并在此基础上,给出了时序电路等价验证的方法。 相似文献
32.
We consider a class of non-linear mixed integer programs with n integer variables and k continuous variables. Solving instances from this class to optimality is an NP-hard problem. We show that for the cases with
k=1 and k=2, every optimal solution is integral. In contrast to this, for every k≥3 there exist instances where every optimal solution takes non-integral values.
Received: August 2001 / Accepted: January 2002?Published online March 27, 2002 相似文献
33.
A. A. Bulatov 《Algebra and Logic》2006,45(6):371-388
A combinatorial constraint satisfaction problem aims at expressing in unified terms a wide spectrum of problems in various
branches of mathematics, computer science, and AI. The generalized satisfiability problem is NP-complete, but many of its
restricted versions can be solved in a polynomial time. It is known that the computational complexity of a restricted constraint
satisfaction problem depends only on a set of polymorphisms of relations which are admitted to be used in the problem. For
the case where a set of such relations is invariant under some Mal’tsev operation, we show that the corresponding constraint
satisfaction problem can be solved in a polynomial time.
__________
Translated from Algebra i Logika, Vol. 45, No. 6, pp. 655–686, November–December, 2006. 相似文献
34.
P. S. Szczepaniak 《Journal of Optimization Theory and Applications》1989,63(3):459-468
This paper deals with dynamic systems described by nonlinear differential-difference equations of retarded type. The problem considered is to determine the initial function and certain system parameters which minimize a given cost functional. A computational method is presented and some convergence results are given. Numerical examples of linear and nonlinear systems are also included. 相似文献
35.
A. Y. Lee 《Journal of Optimization Theory and Applications》1988,56(1):157-166
In this paper, we consider a particular approximation scheme which can be used to solve hereditary optimal control problems. These problems are characterized by variables with a time-delayed argumentx(t – ). In our approximation scheme, we first replace the variable with an augmented statey(t) x(t - ). The two-sided Laplace transform ofy(t) is a product of the Laplace transform ofx(t) and an exponential factor. This factor is approximated by a first-order Padé approximation, and a differential relation fory(t) can be found. The transformed problem, without any time-delayed argument, can then be solved using a gradient algorithm in the usual way. Four problems are solved to illustrate the validity and usefulness of this technique.This research was supported in part by the National Aeronautics and Space Administration under NASA Grant NCC-2-106. 相似文献
36.
AbstractFive thienylnicotinamidine derivatives 5a–e were prepared from their corresponding nicotinonitriles 3a–e on treatment with lithium trimethylsilylamide [LiN(TMS)2] followed by hydrolysis using ethanolic/HCl (gas). The nicotinonitriles 3a–e were prepared via Suzuki coupling reaction of bromothienyl derivative 1 with the appropriate phenylboronic acids 2a–e. The DFT calculation was used to optimize the geometric structure of the newly synthesized nicotinamidines. The comparison of DFT/B3LYP calculated spectral data (1H-NMR and 13C-NMR) with the experimental data showed acceptable agreement. Mass fragmentation patterns of 3,4-dimethoxyphenyl, 3,5-dimethoxyphenyl, and 3,4,5-trimethoxyphenyl thienylnicotinamidine derivatives were investigated. 相似文献
37.
为了评估基于snappyHexMesh方法生成的自动网格体系在二维柱体绕流大涡模拟中的适用性,比较了该自动网格体系与人工网格体系对于Re为3 900圆柱绕流和Re为22 000方柱绕流的数值模拟结果。通过设置合理的计算域以及数值格式,采用snappyHexMesh自动网格以及人工网格的算例都表现出良好的数值稳定性。将不同网格体系的数值模拟结果与物理试验结果进行对比,结果表明,采用snappyHexMesh网格可以提高数值求解效率;圆柱绕流对网格体系的变化比较敏感,不同密度的snappyHexMesh网格会显著影响圆柱气动力特征以及尾流区域的流场结果;snappyHexMesh网格体系可以准确预测方柱绕流,在方柱绕流大涡模拟中具有相较于圆柱绕流更好的适用性。 相似文献
38.
We introduce an impartial combinatorial game on Steiner triple systems called Next One to Fill Is the Loser (Nofil ). Players move alternately, choosing points of the triple system. If a player is forced to fill a block on their turn, they lose. By computing nim-values, we determine optimal strategies for Nofil on all Steiner triple systems up to order 15 and a sampling for orders 19, 21 and 25. The game Nofil can be thought of in terms of play on a corresponding hypergraph which will become a graph during play. At that point Nofil is equivalent to playing the game Node Kayles on the graph. We prove necessary conditions and sufficient conditions for a graph to reached playing Nofil. We conclude that the complexity of determining the outcome of the game Nofil on Steiner triple systems is PSPACE-complete for randomized reductions. 相似文献
39.
采用一维有限差分方法,对生长在Si(001)衬底上的Si1-xGex应变基区异质结双极晶体管(HBT)的直流特性进行了数值分析,给出了高斯掺杂情形下,基区中不同Ge分布的Si1-xGexHBT的共射极电流放大系数图、Gum-mel图和平衡能带图;与Si双极同质结晶体管(BJT)的直流特性作了对比,结果表明基区中Ge的引入有效地改善了晶体管的直流性能;其次对基区中Ge分布与p型杂质在基区-集电区交界处的不一致进行了模拟,证实了基区杂质向集电区扩散产生的寄生势垒使集电极电流密度下降这一实验结果. 相似文献
40.
Andrei A. Gakh Bobby G. Sumpter Donald W. Noid Richard A. Sachleben Bruce A. Moyer 《Journal of inclusion phenomena and macrocyclic chemistry》1997,27(3):201-213
A computational neural network method was used for the prediction of stability constants of simple crown ether complexes. The essence of the method lies in the ability of a computer neural network to recognize the structure-property relationships in these host-guest systems. Testing of the computational method has demonstrated that stability constants of alkali metal cation (Na+, K+, Cs+)-crown ether complexes in methanol at 25 °C can be predicted with an average error of ±0.3 log K units based on the chemical structure of the crown ethers alone. The computer model was then used for the preliminary analysis of trends in the stabilities of the above complexes. 相似文献